{"meta":{"query_hash":"4423166447e2","filters":{"topic":"semigroups and automata theory"},"cohort_total":1153,"direct_labels_cover":1,"predictions_cover":1153,"exported":1153,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/4423166447e2","api":"https://metacan.xera.ac/api/v1/cohort?topic=semigroups+and+automata+theory"},"results":[{"id":"W104024513","doi":"10.1007/978-3-642-40663-8_7","title":"The Algebraic Theory of Parikh Automata","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Unary operation; Automaton; Regular language; Computer science; Automata theory; Algebraic theory; Discrete mathematics; Set (abstract data type); Deterministic finite automaton; Algebraic number; Mathematics; Theoretical computer science; Programming language","score_opus":0.011804015400249616,"score_gpt":0.2192549703204398,"score_spread":0.2074509549201902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104024513","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033319272,0.015814884,0.41646084,0.004938362,0.0017121707,0.00007902212,0.0005396951,0.00075041084,0.5263853],"genre_scores_gemma":[0.79052514,0.013765914,0.08394448,0.001269202,0.003638623,0.0002828829,0.000789936,0.00036470874,0.10541907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907756,0.00024885146,0.00006247948,0.00017847716,0.00033331173,0.000099259465],"domain_scores_gemma":[0.99902225,0.00050031295,0.00005994495,0.00020942847,0.00014911528,0.000059050042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007840284,0.0006124145,0.0008761445,0.0014025411,0.0018960806,0.0047618547,0.0012397694,0.0010247935,0.010472356],"category_scores_gemma":[0.0023551525,0.0006942033,0.0011404674,0.001895542,0.0055624396,0.009827995,0.0019922184,0.0036382347,0.003395457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048523743,0.0000030770382,0.000015111102,0.000025978226,0.000001758842,0.0000098375585,0.00007066107,0.00024589748,0.00012119397,0.9948384,0.00089796854,0.0037651511],"study_design_scores_gemma":[0.0000029580294,0.0000037435527,0.000014668683,0.0000081810385,0.0000016269371,0.000028917631,0.000016128906,0.0005954589,0.000098714125,0.98861396,0.010612531,0.000003040841],"about_ca_topic_score_codex":0.00066952687,"about_ca_topic_score_gemma":0.00043217518,"teacher_disagreement_score":0.010472356,"about_ca_system_score_codex":0.0019507015,"about_ca_system_score_gemma":0.0008980608,"threshold_uncertainty_score":0.035033524},"labels":[],"label_agreement":null},{"id":"W104936076","doi":"","title":"Homomorphisms Preserving Types of Density.","year":2008,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Western University","funders":"","keywords":"Homomorphism; Endomorphism; Mathematics; Hierarchy; Relation (database); Pure mathematics; Monoid; Equivalence relation; Algebra over a field; Discrete mathematics; Computer science","score_opus":0.013487506600315502,"score_gpt":0.20321824248603676,"score_spread":0.18973073588572126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104936076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21719673,0.0007707963,0.74635476,0.00060556945,0.00023691813,0.00031426657,0.00043167625,0.00086871436,0.033220507],"genre_scores_gemma":[0.8493812,0.00039378268,0.14227587,0.00021010877,0.00014603444,0.0002305939,0.00036754776,0.00014927516,0.0068455124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697185,0.0007065345,0.00034134559,0.0006634737,0.0009705284,0.00034623744],"domain_scores_gemma":[0.9886874,0.0061592446,0.00077374413,0.0023181278,0.001276544,0.00078494684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038007626,0.00037360468,0.000517233,0.001965129,0.0021327264,0.0026800819,0.0009064923,0.0009273399,0.0036488357],"category_scores_gemma":[0.013084275,0.00057069556,0.001335642,0.0009994983,0.004874217,0.008926979,0.0032623052,0.0019333315,0.0005838661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009082099,0.000037145393,0.0021355385,0.00010424373,0.000024003486,0.00019572038,0.001172492,0.0010475327,0.004787478,0.9497957,0.0006464387,0.039962888],"study_design_scores_gemma":[0.00002029073,0.00010162796,0.001712286,0.00007357823,0.00006556352,0.0012776437,0.0007847446,0.009974878,0.014123733,0.95842665,0.013385262,0.000053812044],"about_ca_topic_score_codex":0.0011335711,"about_ca_topic_score_gemma":0.00082059775,"teacher_disagreement_score":0.0038007626,"about_ca_system_score_codex":0.0012352166,"about_ca_system_score_gemma":0.00096216716,"threshold_uncertainty_score":0.020100594},"labels":[],"label_agreement":null},{"id":"W1081471053","doi":"10.1016/j.ic.2017.09.002","title":"On the complexity and decidability of some problems involving shuffle","year":2017,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Nondeterministic algorithm; Decidability; Combinatorics; Pushdown automaton; Discrete mathematics; Mathematics; Closure (psychology); Time complexity; Bounded function; Decision problem; Finite-state machine; Algorithm","score_opus":0.04185534428189584,"score_gpt":0.2631921773337993,"score_spread":0.22133683305190344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1081471053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42569104,0.0039994544,0.479607,0.037225857,0.0005213727,0.0005798713,0.0030445822,0.0013764405,0.047954366],"genre_scores_gemma":[0.8825103,0.0018670314,0.09682773,0.0018238575,0.0013728515,0.00047222208,0.0028867307,0.00049869076,0.011740707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9873768,0.0040988843,0.00093621894,0.003133518,0.0026324405,0.0018221763],"domain_scores_gemma":[0.77904886,0.20528063,0.00412148,0.0071967207,0.002103868,0.0022484765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010069774,0.0014270066,0.003178222,0.0030872193,0.005444186,0.012580476,0.006485983,0.005875914,0.011883032],"category_scores_gemma":[0.06829184,0.0020116973,0.0072394805,0.005058376,0.011565828,0.03408039,0.007122403,0.01458471,0.0007922167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008920531,0.0006931169,0.0044593406,0.00087899144,0.0002769851,0.00066486135,0.001960663,0.053910296,0.001979849,0.89244384,0.008645696,0.03319435],"study_design_scores_gemma":[0.00007902891,0.000026021258,0.0003735898,0.000030837422,0.000055612483,0.00013243944,0.00017024465,0.056200147,0.0010006281,0.94093925,0.0009590967,0.000033043616],"about_ca_topic_score_codex":0.0057160286,"about_ca_topic_score_gemma":0.0048029306,"teacher_disagreement_score":0.012580476,"about_ca_system_score_codex":0.0070225834,"about_ca_system_score_gemma":0.0057730055,"threshold_uncertainty_score":0.053254664},"labels":[],"label_agreement":null},{"id":"W108390543","doi":"","title":"On imp-sets, kernels by monochromatic paths of the duplication.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Mathematics; Gene duplication; Arithmetic; Optics; Physics; Biology; Genetics","score_opus":0.006482147157062837,"score_gpt":0.22893580515048087,"score_spread":0.22245365799341804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108390543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27601796,0.0025025557,0.57461846,0.001577573,0.00063418836,0.00015127906,0.0013251775,0.0018806659,0.14129211],"genre_scores_gemma":[0.8911979,0.00089339714,0.0712702,0.0006333352,0.00034597036,0.00017447739,0.00085776666,0.0004682796,0.034158673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864393,0.00032742048,0.00011588116,0.00035327705,0.0003052631,0.00025432432],"domain_scores_gemma":[0.99684346,0.0015429615,0.00030467816,0.00074178603,0.0002696363,0.00029752468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093459786,0.00050342316,0.0007918771,0.0015233598,0.0022732227,0.0031472086,0.0012335805,0.0012278815,0.00863214],"category_scores_gemma":[0.0050877356,0.00062356243,0.0011850365,0.0014664017,0.0031109066,0.008689493,0.0032300903,0.0018781377,0.0022392888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007179273,0.000023840716,0.00030351983,0.000055362278,0.000010335585,0.0003097974,0.00036317875,0.00091100816,0.0012336688,0.9855531,0.002024761,0.009139634],"study_design_scores_gemma":[0.000013347222,0.000018866993,0.00026017695,0.000023014341,0.000014278842,0.0004880496,0.00014750243,0.004027364,0.0010270125,0.9879981,0.0059657786,0.00001647788],"about_ca_topic_score_codex":0.0009945068,"about_ca_topic_score_gemma":0.0011668041,"teacher_disagreement_score":0.00863214,"about_ca_system_score_codex":0.0012486731,"about_ca_system_score_gemma":0.0005908464,"threshold_uncertainty_score":0.028877437},"labels":[],"label_agreement":null},{"id":"W112721313","doi":"10.46298/dmtcs.412","title":"Properties of the extremal infinite smooth words","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; De Bruijn sequence; Alphabet; Fibonacci number; Combinatorics; Mathematics; Graph; De Bruijn graph; Word (group theory); Sequence (biology); Reduction (mathematics); Order (exchange); Construct (python library); Discrete mathematics; Computer science","score_opus":0.01691437624846669,"score_gpt":0.24090651037820063,"score_spread":0.22399213412973393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112721313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96229506,0.00028459396,0.022660758,0.00011979288,0.00002923372,0.000021785696,0.00015169314,0.00014812435,0.014289004],"genre_scores_gemma":[0.9913449,0.00010994335,0.0042610746,0.000024103374,0.000038807626,0.000029153682,0.0001813619,0.000039403723,0.0039713643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974793,0.000035277255,0.00002528853,0.000062654806,0.000066344815,0.00006248904],"domain_scores_gemma":[0.9992028,0.0003467021,0.00016435243,0.000066131295,0.00010895174,0.000111034315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024637306,0.00032079488,0.00044970986,0.0014269432,0.0011557004,0.0021556108,0.00039011898,0.00059215917,0.004691307],"category_scores_gemma":[0.0018486257,0.0004632569,0.00039817454,0.00065446546,0.0018079369,0.0016378133,0.00093487574,0.0007007773,0.00047867265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002372833,0.000046875513,0.0035519477,0.00018021771,0.000027086706,0.0009976743,0.0009611886,0.0032981704,0.028424518,0.94591427,0.00065998617,0.015700694],"study_design_scores_gemma":[0.000047940684,0.00015907534,0.004900356,0.000076628734,0.00006185571,0.0012836361,0.0007406874,0.018328598,0.016736208,0.9510281,0.006553228,0.00008371065],"about_ca_topic_score_codex":0.0003334472,"about_ca_topic_score_gemma":0.00038007417,"teacher_disagreement_score":0.004691307,"about_ca_system_score_codex":0.0005001375,"about_ca_system_score_gemma":0.00029943557,"threshold_uncertainty_score":0.015693963},"labels":[],"label_agreement":null},{"id":"W1168124290","doi":"10.1007/978-3-319-20028-6_4","title":"A New Approach to the Paperfolding Sequences","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Environmental Studies Association of Canada; Queen's University; University of Waterloo","funders":"","keywords":"Computer science; Computation; Function (biology); Algorithm; Theoretical computer science; Artificial intelligence","score_opus":0.03616012033275176,"score_gpt":0.25462790725618134,"score_spread":0.21846778692342958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1168124290","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008222691,0.0010434685,0.86865705,0.0012766987,0.0022757987,0.000070962444,0.0001556836,0.000493826,0.11780389],"genre_scores_gemma":[0.17401059,0.0029225817,0.53474087,0.0017445234,0.0031825763,0.00042652464,0.0005537476,0.0013295818,0.281089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990159,0.0002827834,0.00008329888,0.00025140124,0.00029633523,0.000070283306],"domain_scores_gemma":[0.9988632,0.00037116723,0.00006153089,0.00027721256,0.00027350205,0.00015335198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009918134,0.0012429648,0.00075370935,0.002449063,0.0019301515,0.0025932847,0.0017798075,0.0014590292,0.020026634],"category_scores_gemma":[0.0029762264,0.0006042456,0.0011182848,0.0018120005,0.0029972428,0.00830747,0.0033282514,0.0034401384,0.005313662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000763544,0.000009259039,0.000025604844,0.000028198952,0.0000018604974,0.000029438606,0.00013621376,0.0003389596,0.0005720235,0.97672343,0.002193605,0.019933693],"study_design_scores_gemma":[0.0000045969628,0.000016333343,0.000027228922,0.000017289163,0.000002940474,0.00011856742,0.000051901014,0.0032225954,0.00055274565,0.9600473,0.0359306,0.000007895984],"about_ca_topic_score_codex":0.00043881728,"about_ca_topic_score_gemma":0.00046309308,"teacher_disagreement_score":0.020026634,"about_ca_system_score_codex":0.00080392003,"about_ca_system_score_gemma":0.0005939688,"threshold_uncertainty_score":0.06699574},"labels":[],"label_agreement":null},{"id":"W124365840","doi":"10.1007/978-3-642-22600-7_13","title":"State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Intersection (aeronautics); Star (game theory); Computer science; State (computer science); Algorithm; Theoretical computer science; Mathematics; Aerospace engineering; Engineering","score_opus":0.029660957460839108,"score_gpt":0.23200068623280984,"score_spread":0.20233972877197073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124365840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90744865,0.00021881367,0.06773673,0.0011401667,0.000052045518,0.000085176194,0.0013981783,0.00065029704,0.02126995],"genre_scores_gemma":[0.98659384,0.00007721259,0.007716885,0.000037659098,0.000027825205,0.000047900347,0.00075190415,0.00010900733,0.0046376805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985359,0.00029879902,0.00008137446,0.00025062182,0.00042351303,0.00040971476],"domain_scores_gemma":[0.98035675,0.016256325,0.0006876668,0.001267592,0.00089126336,0.00054037705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010659477,0.00047628704,0.000848795,0.00082723453,0.0011982688,0.0046784,0.0015442093,0.0014376664,0.015473749],"category_scores_gemma":[0.008936105,0.00046805182,0.0013278301,0.0011799228,0.0019577192,0.0071523725,0.0016716382,0.0018794377,0.00071796647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028020167,0.00059748057,0.008205535,0.00038490398,0.00016056973,0.0003267267,0.0012626584,0.3091769,0.011046488,0.5884125,0.0101153795,0.06750879],"study_design_scores_gemma":[0.0001136659,0.00010567874,0.0019224845,0.000015761325,0.000087955574,0.000067699366,0.00023925772,0.7249285,0.0061592883,0.26540118,0.0009076468,0.00005088158],"about_ca_topic_score_codex":0.010984757,"about_ca_topic_score_gemma":0.01179077,"teacher_disagreement_score":0.015473749,"about_ca_system_score_codex":0.0028937757,"about_ca_system_score_gemma":0.0025609427,"threshold_uncertainty_score":0.051764846},"labels":[],"label_agreement":null},{"id":"W124609046","doi":"10.1007/978-3-642-22600-7_21","title":"State Trade-Offs in Unranked Tree Automata","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Nondeterministic finite automaton; Deterministic finite automaton; Tree (set theory); Automaton; Upper and lower bounds; Computer science; Horizontal and vertical; State (computer science); ω-automaton; Finite-state machine; Quantum finite automata; Discrete mathematics; Mathematics; Combinatorics; Automata theory; Theoretical computer science; Algorithm; Geometry","score_opus":0.018659769607563,"score_gpt":0.22903347662304183,"score_spread":0.21037370701547883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124609046","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5367902,0.0020055876,0.42195714,0.0014354505,0.00018504923,0.00009650214,0.00035694742,0.0013284346,0.03584479],"genre_scores_gemma":[0.96467674,0.00031610683,0.02753228,0.0000728964,0.000064772605,0.00007101894,0.00012968866,0.00019141754,0.0069450852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782616,0.0008879229,0.0001788107,0.00029277182,0.00050038734,0.00031395067],"domain_scores_gemma":[0.9769786,0.018803641,0.0010039947,0.0015527605,0.0009860011,0.0006749221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027001477,0.00072424195,0.0016274196,0.0010579309,0.0013883117,0.0047150026,0.0017244887,0.002387517,0.008641996],"category_scores_gemma":[0.015751157,0.00090255204,0.0007646657,0.0013913129,0.0023748826,0.008940878,0.0017889012,0.0023058327,0.0008550101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005502828,0.00018070088,0.0010187352,0.0002465022,0.000046688645,0.00031171914,0.0005105241,0.23113474,0.006133705,0.70572907,0.0022208302,0.05191657],"study_design_scores_gemma":[0.000023873472,0.00006442224,0.000136764,0.0000156202,0.00001869206,0.000053031974,0.000050287825,0.35531008,0.001192418,0.64266264,0.00045288444,0.000019363273],"about_ca_topic_score_codex":0.0006378472,"about_ca_topic_score_gemma":0.0012836617,"teacher_disagreement_score":0.008641996,"about_ca_system_score_codex":0.0016790448,"about_ca_system_score_gemma":0.000785154,"threshold_uncertainty_score":0.028910339},"labels":[],"label_agreement":null},{"id":"W136331652","doi":"10.14232/actacyb.21.4.2014.1","title":"Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Language","year":2014,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Agentúra na Podporu Výskumu a Vývoja","keywords":"Regular language; Quotient; Prefix; Suffix; Mathematics; Discrete mathematics; Concatenation (mathematics); Combinatorics; Computer science; Automaton; Theoretical computer science; Linguistics","score_opus":0.012780509155064247,"score_gpt":0.21787180460326577,"score_spread":0.20509129544820154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136331652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9195275,0.00041449937,0.06911574,0.0005876043,0.000034770525,0.00007280236,0.0010222867,0.0004139651,0.008810855],"genre_scores_gemma":[0.9817146,0.00017087148,0.014321378,0.00007039467,0.00003829957,0.0000936327,0.0009664284,0.000081400016,0.002543073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813145,0.00020313969,0.00021157338,0.0004944071,0.00046722192,0.00049223355],"domain_scores_gemma":[0.9926045,0.004474961,0.00059007667,0.00079038466,0.00084136816,0.0006987051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075736333,0.00041538032,0.00074418954,0.0010799658,0.0009770641,0.0025024072,0.0011671281,0.00062705955,0.005607007],"category_scores_gemma":[0.007128185,0.0002608071,0.0012227881,0.0007891569,0.0020844173,0.0056597986,0.0018779347,0.0011296016,0.00037576607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001538624,0.00023877367,0.01727074,0.00048265222,0.00010273604,0.0006493173,0.0033236057,0.08102396,0.04132326,0.7978188,0.004230615,0.0519969],"study_design_scores_gemma":[0.000052853444,0.00013892663,0.003297716,0.000026176032,0.00006514702,0.00042576948,0.00033570008,0.22505188,0.015442255,0.75219125,0.0028889577,0.000083517225],"about_ca_topic_score_codex":0.0029710466,"about_ca_topic_score_gemma":0.0018016187,"teacher_disagreement_score":0.005607007,"about_ca_system_score_codex":0.0025425158,"about_ca_system_score_gemma":0.0019623674,"threshold_uncertainty_score":0.018757343},"labels":[],"label_agreement":null},{"id":"W14029668","doi":"10.1007/978-3-642-31623-4_12","title":"State Complexity of Star and Square of Union of k Regular Languages","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Star (game theory); Component (thermodynamics); Discrete mathematics; Mathematics; Combinatorics; Computer science; Algorithm; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.019033828007513583,"score_gpt":0.24505816518295828,"score_spread":0.2260243371754447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W14029668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.902847,0.00048130183,0.06898187,0.0015083308,0.000052821128,0.00006146455,0.0011008402,0.0003556432,0.02461073],"genre_scores_gemma":[0.98725325,0.00016059089,0.0070882016,0.00005505581,0.00005952629,0.000049135775,0.00059922284,0.00010225804,0.0046327394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980603,0.0003915798,0.0001467774,0.00039856895,0.00055668544,0.00044598925],"domain_scores_gemma":[0.9814401,0.014415781,0.0010047319,0.0011902102,0.0009731668,0.00097593095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011951124,0.0003902116,0.0011649833,0.00093439396,0.0016340829,0.0063080485,0.0018558211,0.0014683722,0.012417438],"category_scores_gemma":[0.012053575,0.0008087461,0.0015908115,0.0013541913,0.0025645664,0.009795279,0.0025290283,0.002695848,0.00067958276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010298726,0.00015033303,0.005254126,0.00026795286,0.00006878016,0.0002898917,0.0016963325,0.05959398,0.0052999095,0.9044554,0.004017578,0.01787578],"study_design_scores_gemma":[0.000056942976,0.00006784392,0.0017839827,0.000018424671,0.000043762615,0.00014301353,0.0003170279,0.22784056,0.0026601085,0.7659879,0.0010369676,0.00004346137],"about_ca_topic_score_codex":0.004057239,"about_ca_topic_score_gemma":0.0039199665,"teacher_disagreement_score":0.012417438,"about_ca_system_score_codex":0.002768325,"about_ca_system_score_gemma":0.0021495149,"threshold_uncertainty_score":0.041540444},"labels":[],"label_agreement":null},{"id":"W1440639274","doi":"10.1007/978-3-319-22360-5_20","title":"State Complexity of Prefix Distance","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Substring; Suffix; Prefix; Generalized suffix tree; Combinatorics; Deterministic finite automaton; Nondeterministic algorithm; Regular language; State (computer science); Nondeterministic finite automaton; Discrete mathematics; Mathematics; Computer science; Suffix tree; Finite-state machine; Set (abstract data type); Automaton; Algorithm; Theoretical computer science; Automata theory","score_opus":0.039669410557302325,"score_gpt":0.26118050086586275,"score_spread":0.22151109030856042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1440639274","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4329573,0.003062881,0.38528904,0.0072665946,0.00036629074,0.0001461837,0.002459364,0.00070397946,0.16774836],"genre_scores_gemma":[0.9562389,0.0012590222,0.02097146,0.00026181448,0.00042376708,0.00020144277,0.0010220122,0.00023687162,0.01938467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721164,0.00058733585,0.00018082153,0.00056801573,0.0010576906,0.0003945846],"domain_scores_gemma":[0.98556465,0.011006815,0.00063052634,0.0014443673,0.0008440892,0.0005095911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014554184,0.00059479254,0.0015237507,0.0015467184,0.0016604403,0.006682009,0.0023256703,0.0021186087,0.01730441],"category_scores_gemma":[0.01300275,0.00076352723,0.0014359341,0.0031313165,0.0034598361,0.014237784,0.0040199533,0.0047066943,0.0014632543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000705288,0.000024296214,0.00027370808,0.000071698654,0.000011291637,0.000034408476,0.00016759736,0.008231761,0.0005182058,0.98088545,0.0014434486,0.008267597],"study_design_scores_gemma":[0.000008701989,0.000009802831,0.00012211886,0.000009156426,0.000008365126,0.000028967652,0.00002574803,0.02307171,0.00034777116,0.97549224,0.00086615275,0.000009375701],"about_ca_topic_score_codex":0.0014417974,"about_ca_topic_score_gemma":0.0010573091,"teacher_disagreement_score":0.01730441,"about_ca_system_score_codex":0.0034832323,"about_ca_system_score_gemma":0.001644531,"threshold_uncertainty_score":0.057889044},"labels":[],"label_agreement":null},{"id":"W1442386651","doi":"10.1007/978-3-319-23660-5_15","title":"Mechanical Proofs of Properties of the Tribonacci Word","year":2015,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Mathematical proof; Class (philosophy); Word (group theory); Point (geometry); Mathematics; Computer science; Combinatorics; Artificial intelligence","score_opus":0.0298734212841338,"score_gpt":0.25029416221898626,"score_spread":0.22042074093485245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1442386651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21539974,0.0035451862,0.422303,0.009177308,0.002203682,0.00017481472,0.0006816105,0.0012297917,0.34528485],"genre_scores_gemma":[0.94649744,0.00056697516,0.032410935,0.00087649666,0.0007962469,0.00015056551,0.00039864282,0.000374932,0.0179278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979418,0.0006781299,0.00014693166,0.00036094015,0.00061401917,0.00025821172],"domain_scores_gemma":[0.98963016,0.0069911825,0.0004427915,0.0016623671,0.0009293367,0.00034410605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017007038,0.00067042845,0.0009682558,0.0015549583,0.003713163,0.0036930512,0.0020215493,0.0022281385,0.015326678],"category_scores_gemma":[0.014265946,0.0008367877,0.0015409095,0.0011933522,0.0058095315,0.007600667,0.0034128649,0.0035905477,0.0018841128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028098242,0.000010415872,0.00010839819,0.00005091502,0.0000072799776,0.00010574264,0.00020674696,0.00034000777,0.00086371286,0.994514,0.0012183423,0.002546278],"study_design_scores_gemma":[0.000014905018,0.000010149926,0.000099580764,0.000015763404,0.0000063123375,0.0000838303,0.0000541341,0.0017751743,0.0011158347,0.9925217,0.0042909677,0.000011556634],"about_ca_topic_score_codex":0.0009730286,"about_ca_topic_score_gemma":0.00096518785,"teacher_disagreement_score":0.015326678,"about_ca_system_score_codex":0.0015433877,"about_ca_system_score_gemma":0.00091990246,"threshold_uncertainty_score":0.05127287},"labels":[],"label_agreement":null},{"id":"W1479790588","doi":"10.37236/583","title":"On Variants of Conway and Conolly's Meta-Fibonacci Recursions","year":2011,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Fibonacci number; Combinatorics; Monotonic function; Integer (computer science); Recursion (computer science); Mathematics; Sequence (biology); Physics; Algorithm; Mathematical analysis; Chemistry","score_opus":0.025882670816511837,"score_gpt":0.240042085165349,"score_spread":0.21415941434883717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1479790588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17216597,0.00226394,0.6080281,0.001432774,0.0006052677,0.00018969164,0.00040904715,0.0006777201,0.21422745],"genre_scores_gemma":[0.734413,0.0011492742,0.20498724,0.0008147313,0.0003684349,0.0003183719,0.00038131574,0.00046425418,0.057103414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830294,0.0005089856,0.00010288878,0.00028419207,0.00045175967,0.00034914608],"domain_scores_gemma":[0.99784994,0.0011553693,0.00014230631,0.0003335282,0.00033479417,0.00018410238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023167382,0.0007412798,0.0006837532,0.0015043361,0.0020798617,0.002603869,0.001609335,0.0011601892,0.0071085473],"category_scores_gemma":[0.007825153,0.00054275966,0.0015755135,0.0018234852,0.0038116663,0.0048068846,0.002238117,0.002829945,0.0015147728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016103313,0.000007519574,0.00016002342,0.000013771713,0.0000023838509,0.00007572666,0.00025358907,0.0010766234,0.00038896082,0.99315166,0.000383894,0.0044696187],"study_design_scores_gemma":[0.000016748476,0.00002326551,0.00016389083,0.000037991947,0.000009415036,0.00015833828,0.00011432098,0.014862553,0.0009186983,0.9705602,0.013113355,0.000021095428],"about_ca_topic_score_codex":0.0059662387,"about_ca_topic_score_gemma":0.0074742674,"teacher_disagreement_score":0.0071085473,"about_ca_system_score_codex":0.0029643758,"about_ca_system_score_gemma":0.00148025,"threshold_uncertainty_score":0.023780406},"labels":[],"label_agreement":null},{"id":"W1480727594","doi":"","title":"Simple permutations of the classes Av(321;13524) and Av(321;13452) have polynomial growth","year":2011,"lang":"en","type":"article","venue":"Redalyc (Universidad Autónoma del Estado de México)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Guelph","funders":"","keywords":"Combinatorics; Permutation (music); Cyclic permutation; Simple (philosophy); Permutation graph; Mathematics; Parity of a permutation; Class (philosophy); Partial permutation; Derangement; Bit-reversal permutation; Set (abstract data type); Discrete mathematics; Symmetric group; Computer science; Artificial intelligence","score_opus":0.0176476972011365,"score_gpt":0.22334931950861164,"score_spread":0.20570162230747513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480727594","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8701546,0.0004501755,0.07431877,0.0011151395,0.0002003814,0.00020975433,0.0018745832,0.0005193807,0.051157195],"genre_scores_gemma":[0.96079457,0.0002030974,0.026150197,0.0000827052,0.0001056237,0.0001174595,0.0013675744,0.000066271896,0.011112567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931455,0.00009545341,0.00003874565,0.00016196421,0.00019969988,0.00018962624],"domain_scores_gemma":[0.99568546,0.00251271,0.00069397525,0.00043050168,0.00026695366,0.00041034064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050329167,0.00039972833,0.0004647264,0.0007962636,0.0015318416,0.0019465643,0.00059968815,0.0005587009,0.007795976],"category_scores_gemma":[0.002905971,0.00025694052,0.00084776967,0.0007322884,0.0014424201,0.0017553045,0.0008476865,0.0010499961,0.0008314819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011951358,0.00024535402,0.015855912,0.00035736916,0.00009786696,0.0007492605,0.0009891087,0.012268223,0.03670093,0.8078929,0.012460017,0.11118792],"study_design_scores_gemma":[0.00016127022,0.000355055,0.017442122,0.000060265385,0.000086915,0.0022493708,0.0003977599,0.058672022,0.025205577,0.8605987,0.0346919,0.00007907726],"about_ca_topic_score_codex":0.0009436274,"about_ca_topic_score_gemma":0.0018760104,"teacher_disagreement_score":0.007795976,"about_ca_system_score_codex":0.001170685,"about_ca_system_score_gemma":0.0010999029,"threshold_uncertainty_score":0.026080191},"labels":[],"label_agreement":null},{"id":"W1481269160","doi":"10.1007/978-3-642-02930-1_5","title":"Faithful Loops for Aperiodic E-Ordered Monoids","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi; Université de Sherbrooke","funders":"","keywords":"Aperiodic graph; Computer science; Algebra over a field; Combinatorics; Mathematics; Pure mathematics","score_opus":0.01230811188658492,"score_gpt":0.23358944386566746,"score_spread":0.22128133197908254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481269160","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39550376,0.0022953989,0.47206008,0.0006791518,0.00057241984,0.00017117347,0.00035671156,0.0018045853,0.1265566],"genre_scores_gemma":[0.95469815,0.0005732609,0.023703484,0.00014093814,0.00019431941,0.00008787082,0.00016509426,0.0001632521,0.02027366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992384,0.00016606732,0.00006812705,0.00014439672,0.00022824787,0.00015482806],"domain_scores_gemma":[0.99770397,0.0013567995,0.00016455802,0.00036147138,0.00024974192,0.00016346079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010545739,0.0005802322,0.000496328,0.0014878659,0.0013460142,0.0029465412,0.00072517636,0.000964639,0.0051523685],"category_scores_gemma":[0.003234364,0.00059457484,0.00081847,0.0009201107,0.0030232365,0.0046866136,0.0018870152,0.0019335431,0.0006952533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039252063,0.000020575762,0.000113705435,0.000042630716,0.0000054449415,0.00010962865,0.0006193606,0.00073863065,0.0019191921,0.98701626,0.0003147323,0.00906054],"study_design_scores_gemma":[0.00001535425,0.000028906803,0.00009515472,0.000012689885,0.000008311102,0.00008034624,0.00007534145,0.0019907316,0.0016475683,0.9913777,0.0046565454,0.000011219148],"about_ca_topic_score_codex":0.0005415412,"about_ca_topic_score_gemma":0.00041880982,"teacher_disagreement_score":0.0051523685,"about_ca_system_score_codex":0.001085449,"about_ca_system_score_gemma":0.0004121776,"threshold_uncertainty_score":0.017236412},"labels":[],"label_agreement":null},{"id":"W1482663448","doi":"10.1016/j.ipl.2005.06.011","title":"The state complexity of and","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unary operation; Alphabet; State (computer science); Mathematics; Computational complexity theory; Combinatorics; Time complexity; Discrete mathematics; Regular language; Algorithm; Computer science; Automaton; Theoretical computer science; Linguistics","score_opus":0.01051109242909641,"score_gpt":0.2119664226953609,"score_spread":0.2014553302662645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482663448","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44940585,0.0010663146,0.4014953,0.013066884,0.00034993733,0.00019678043,0.002753061,0.0009056286,0.1307601],"genre_scores_gemma":[0.9772618,0.0002457304,0.010313906,0.00024452858,0.00015096205,0.000121280944,0.0006257269,0.00014408487,0.010892019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955782,0.001126692,0.00025507002,0.0010520802,0.0012540101,0.00073387794],"domain_scores_gemma":[0.96722066,0.023836663,0.0016376902,0.0044203214,0.0018662467,0.0010183041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023532384,0.00064062583,0.0013757063,0.001416873,0.002226319,0.00734341,0.0021948006,0.0027974013,0.018329252],"category_scores_gemma":[0.02635446,0.0008422706,0.0012834558,0.0015878046,0.0036912689,0.017268889,0.0034607206,0.003933174,0.0015366385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099222314,0.000033349104,0.00061185,0.00005283153,0.000018295232,0.000051030867,0.0003049185,0.008387187,0.00067335216,0.98191386,0.0013353967,0.006518736],"study_design_scores_gemma":[0.000014593658,0.000015457752,0.00038865514,0.000014977768,0.00001570934,0.00006437488,0.00008030095,0.05745262,0.0009530405,0.93944573,0.0015331283,0.000021299093],"about_ca_topic_score_codex":0.0015928047,"about_ca_topic_score_gemma":0.001109624,"teacher_disagreement_score":0.018329252,"about_ca_system_score_codex":0.0029222062,"about_ca_system_score_gemma":0.0026077838,"threshold_uncertainty_score":0.061317503},"labels":[],"label_agreement":null},{"id":"W1483785569","doi":"10.1007/11812128_10","title":"Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Concatenation (mathematics); Deterministic context-free grammar; Embedded pushdown automaton; Time complexity; Theoretical computer science; Simple (philosophy); Reduction (mathematics); Context-free grammar; Stateless protocol; Pushdown automaton; Algorithm; Rule-based machine translation; Automaton; Artificial intelligence; State (computer science); Tree-adjoining grammar; Mathematics; Arithmetic","score_opus":0.008559549543281935,"score_gpt":0.2297447781685894,"score_spread":0.22118522862530746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483785569","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09129129,0.002097927,0.82079077,0.0130177755,0.0007244447,0.0004351801,0.0011341606,0.013702805,0.05680573],"genre_scores_gemma":[0.5194571,0.0015468219,0.44078526,0.002383038,0.0007525011,0.00055429514,0.0020760386,0.0058267154,0.02661825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9863019,0.0040030587,0.00083183707,0.0023750465,0.004930874,0.0015572563],"domain_scores_gemma":[0.9417112,0.03326213,0.0010611202,0.020432571,0.0026666562,0.00086640223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058991807,0.0017523266,0.0021122321,0.0013729536,0.0022853,0.0059218355,0.005146433,0.0029132848,0.01823991],"category_scores_gemma":[0.04273243,0.0015209009,0.0028838124,0.0035791884,0.0051315394,0.018571708,0.010454598,0.0093146805,0.006758852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016403791,0.0007880554,0.0020175893,0.0011847637,0.0002058082,0.0003577557,0.0020432007,0.044504337,0.012677948,0.559404,0.051325332,0.3238508],"study_design_scores_gemma":[0.00014809922,0.000069363996,0.00019631938,0.000052375173,0.000082305356,0.00018190076,0.0002870603,0.058809176,0.00541374,0.92378294,0.0109476065,0.000029078426],"about_ca_topic_score_codex":0.0027826868,"about_ca_topic_score_gemma":0.0048028235,"teacher_disagreement_score":0.01823991,"about_ca_system_score_codex":0.0033529704,"about_ca_system_score_gemma":0.0052139885,"threshold_uncertainty_score":0.061018586},"labels":[],"label_agreement":null},{"id":"W1485181793","doi":"10.1017/cbo9780511808876","title":"A Second Course in Formal Languages and Automata Theory","year":2008,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":206,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Formal language; Abstract family of languages; Computer science; Lemma (botany); Parsing; Automaton; Context-free language; Automata theory; Chomsky hierarchy; Pumping lemma for regular languages; Context (archaeology); Programming language; Course (navigation); Turing machine; Second-generation programming language; Artificial intelligence; Computation; Rule-based machine translation; Fifth-generation programming language","score_opus":0.008768383314324668,"score_gpt":0.202186131174794,"score_spread":0.19341774786046934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485181793","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018594306,0.010517216,0.04027123,0.006502252,0.008753312,0.000117552576,0.001706652,0.002440905,0.9278315],"genre_scores_gemma":[0.0052791527,0.0034833453,0.0076600867,0.0013907434,0.0007894754,0.00006670648,0.0010657663,0.0004971401,0.9797677],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996803,0.000029767714,0.000010976003,0.00007654337,0.0001701037,0.00003240698],"domain_scores_gemma":[0.999468,0.00020894247,0.000023675411,0.00006536331,0.00015362713,0.00008036803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027257763,0.0009195002,0.00096848694,0.0012481961,0.0008561042,0.0027572226,0.0007363917,0.00093782955,0.14630114],"category_scores_gemma":[0.0011524607,0.00044683556,0.0009185323,0.0014296223,0.00070083735,0.002909156,0.0009232576,0.0031514901,0.070485316],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020692667,0.000049731003,0.0001568246,0.00023987929,0.000008840514,0.00014288387,0.00035934744,0.0007888785,0.0016395838,0.081793495,0.73582745,0.17897244],"study_design_scores_gemma":[0.000003177939,0.000013836446,0.00018987946,0.000082767285,0.000002457708,0.00016939022,0.0000403011,0.00034096718,0.0002457141,0.016847208,0.98205966,0.000004635911],"about_ca_topic_score_codex":0.0009571056,"about_ca_topic_score_gemma":0.0022554444,"teacher_disagreement_score":0.14630114,"about_ca_system_score_codex":0.0015104804,"about_ca_system_score_gemma":0.0012515326,"threshold_uncertainty_score":0.48942608},"labels":[],"label_agreement":null},{"id":"W1486877437","doi":"10.1007/3-540-44674-5_26","title":"The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Parameterized complexity; Intersection (aeronautics); Finite-state machine; Transducer; Automaton; Composition (language); Computational complexity theory; Computer science; State (computer science); Finite state; Representation (politics); Algorithm; Time complexity; Theoretical computer science; Acoustics","score_opus":0.028241553057275538,"score_gpt":0.2603732987965553,"score_spread":0.23213174573927975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486877437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4965936,0.0023899097,0.4522214,0.00462143,0.00025061675,0.00022655202,0.0026325863,0.0010976365,0.039966296],"genre_scores_gemma":[0.92982876,0.0010509177,0.05754484,0.00020893189,0.00039455597,0.00033727955,0.0019198532,0.0004809938,0.008233867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991932,0.0020506226,0.00079375925,0.001612476,0.0027138204,0.0008974095],"domain_scores_gemma":[0.9359453,0.0514948,0.0026374809,0.0066086696,0.001993858,0.0013199601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035446014,0.0012308641,0.0026179971,0.0020139108,0.0029414557,0.013470145,0.0056395177,0.0030113626,0.01208192],"category_scores_gemma":[0.038147014,0.0022801515,0.0035625717,0.005403967,0.0060099876,0.05324748,0.004419322,0.0074869776,0.00096428714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054357026,0.00019109847,0.0029671744,0.00026688888,0.00013292146,0.00020192993,0.0010164696,0.06502543,0.0026515753,0.88793325,0.0035204545,0.03554928],"study_design_scores_gemma":[0.00003493922,0.000028034108,0.00059899216,0.000021153444,0.000045493172,0.00011370848,0.0001384016,0.081586316,0.001462751,0.91474235,0.0011897827,0.000038057395],"about_ca_topic_score_codex":0.0036314132,"about_ca_topic_score_gemma":0.0026399086,"teacher_disagreement_score":0.013470145,"about_ca_system_score_codex":0.0065706708,"about_ca_system_score_gemma":0.003342675,"threshold_uncertainty_score":0.04767376},"labels":[],"label_agreement":null},{"id":"W1489809596","doi":"10.1007/978-3-319-15579-1_54","title":"Order Structures for Subclasses of Generalised Traces","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; TRACE (psycholinguistics); Equivalence (formal languages); Causality (physics); Simultaneity; Order (exchange); Theoretical computer science; Algorithm; Discrete mathematics; Mathematics","score_opus":0.03179765081236744,"score_gpt":0.2717965071202799,"score_spread":0.23999885630791248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489809596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26152417,0.0028933014,0.525468,0.0027505637,0.0008271187,0.00030458524,0.0014782281,0.0016154023,0.20313856],"genre_scores_gemma":[0.8557067,0.0015898246,0.07418816,0.0005128113,0.00056116545,0.0003054803,0.0013510629,0.000799769,0.06498511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836224,0.00027061228,0.00020438654,0.0004109685,0.0004992638,0.00025257727],"domain_scores_gemma":[0.9964959,0.0017928637,0.00019946808,0.0008209342,0.0004179647,0.00027296317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001287869,0.0008041587,0.0010923435,0.0025192196,0.0023508563,0.0051624435,0.0012530861,0.0016731222,0.007243626],"category_scores_gemma":[0.0049550105,0.0011913066,0.0020525546,0.002018112,0.0044362224,0.011253302,0.0036659648,0.004778493,0.0016952029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014613609,0.000008869775,0.00012993271,0.000027462756,0.0000049633604,0.000084562205,0.0005362664,0.00022242023,0.000456081,0.99349916,0.0005264629,0.004489303],"study_design_scores_gemma":[0.000007400829,0.0000065978315,0.000075350355,0.000019617193,0.000006438635,0.00010695452,0.00011662314,0.00090275815,0.00032259634,0.9937309,0.004695885,0.00000882799],"about_ca_topic_score_codex":0.0016929406,"about_ca_topic_score_gemma":0.0015058488,"teacher_disagreement_score":0.007243626,"about_ca_system_score_codex":0.0020142088,"about_ca_system_score_gemma":0.00083840435,"threshold_uncertainty_score":0.024232388},"labels":[],"label_agreement":null},{"id":"W1489975931","doi":"10.25596/jalc-2002-247","title":"The Computing Power of Programs over Finite Monoids","year":2002,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Monoid; Formalism (music); Computation; Connection (principal bundle); Syntactic monoid; Expressive power; Mathematics; Polynomial; Regular language; Computer science; Discrete mathematics; Free monoid; Algebra over a field; Pure mathematics; Theoretical computer science; Algorithm; Automaton","score_opus":0.015135791753426598,"score_gpt":0.21903853496017972,"score_spread":0.2039027432067531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489975931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7690545,0.0015837759,0.20307487,0.0031643328,0.00009698237,0.00005862626,0.0002486407,0.00044672427,0.022271574],"genre_scores_gemma":[0.9756614,0.00066539866,0.019946761,0.00017596353,0.00018538472,0.000049162736,0.00015253027,0.000056154393,0.0031073217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871314,0.0003564155,0.00010268545,0.000358213,0.00031657377,0.00015306596],"domain_scores_gemma":[0.98821646,0.009179562,0.000580217,0.0010976951,0.00040105192,0.0005250943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018408622,0.0004990565,0.00071625906,0.001337766,0.0014167286,0.004455783,0.0011580223,0.00095157325,0.0029457356],"category_scores_gemma":[0.010229365,0.0007233405,0.0011212641,0.0013436729,0.005503482,0.014260642,0.0026356794,0.0022765908,0.00036230223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013728454,0.000038456656,0.0007734406,0.0001230776,0.0000166234,0.00010568186,0.00060562266,0.005926576,0.0059784725,0.9782145,0.00036008586,0.0077201906],"study_design_scores_gemma":[0.000029504014,0.000042694224,0.00030318383,0.00002341772,0.000025285412,0.00009989916,0.00009623944,0.02463489,0.0040353695,0.9682875,0.0024015608,0.000020547328],"about_ca_topic_score_codex":0.0008519568,"about_ca_topic_score_gemma":0.00087326654,"teacher_disagreement_score":0.004455783,"about_ca_system_score_codex":0.0013917801,"about_ca_system_score_gemma":0.0007624454,"threshold_uncertainty_score":0.010098159},"labels":[],"label_agreement":null},{"id":"W1498880175","doi":"10.46298/dmtcs.486","title":"Cubefree words with many squares","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Construct (python library); Binary number; Square (algebra); Mathematics; Integer (computer science); Semantics (computer science); Discrete mathematics; Automaton; Cellular automaton; Combinatorics; Computer science; Arithmetic; Algorithm; Theoretical computer science; Geometry","score_opus":0.0070838399705147334,"score_gpt":0.23674419756294127,"score_spread":0.22966035759242653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498880175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4201548,0.0016187718,0.52314585,0.001844818,0.00038025217,0.0000923353,0.0005756396,0.0010181259,0.05116943],"genre_scores_gemma":[0.8839407,0.00053339836,0.09584576,0.00057988847,0.00012842004,0.00016825224,0.00037423274,0.00016499039,0.018264288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994522,0.0001217998,0.000050038576,0.00013403756,0.0001422628,0.00009969084],"domain_scores_gemma":[0.99806243,0.0010302666,0.00018769289,0.00024572742,0.0003215096,0.00015236043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004775476,0.0005277965,0.00058074365,0.0004831635,0.001065606,0.0018579882,0.0006756639,0.0006370176,0.0052383123],"category_scores_gemma":[0.0022021981,0.0003579195,0.0005969893,0.0006179225,0.0022633215,0.0048510185,0.0024205004,0.0013700878,0.0010746553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001594648,0.000029376157,0.00055733905,0.00009752165,0.000008379433,0.00025753025,0.00041649494,0.0057146046,0.010667702,0.9671294,0.0015742622,0.013387814],"study_design_scores_gemma":[0.000031416672,0.00006666677,0.00027470937,0.00003962836,0.000016896944,0.00035014606,0.0001834035,0.024795994,0.012221667,0.9488065,0.013173255,0.000039676346],"about_ca_topic_score_codex":0.0007747296,"about_ca_topic_score_gemma":0.0010654564,"teacher_disagreement_score":0.0052383123,"about_ca_system_score_codex":0.00088481494,"about_ca_system_score_gemma":0.00063595024,"threshold_uncertainty_score":0.017523944},"labels":[],"label_agreement":null},{"id":"W1500269013","doi":"10.1007/11907350_34","title":"An Optimal Algorithm for Detecting Pseudo-squares","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Polyomino; Computer science; Algorithm; Quadratic equation; Square (algebra); Plane (geometry); Boundary (topology); Word (group theory); Translation (biology); Time complexity; Mathematics; Geometry","score_opus":0.012223271622770836,"score_gpt":0.2472001122946769,"score_spread":0.23497684067190605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500269013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014055489,0.00017875606,0.9800016,0.00017912297,0.00010953986,0.00013606738,0.00015480364,0.0030313332,0.0021532346],"genre_scores_gemma":[0.05956051,0.00007816561,0.93610203,0.00011970984,0.00004400335,0.00017951733,0.00056927855,0.00026714735,0.0030796896],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981797,0.00027899994,0.00014679776,0.00058982696,0.0005909375,0.00021378369],"domain_scores_gemma":[0.99711585,0.0012205299,0.0001455376,0.0006924464,0.00069040887,0.0001352684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009922576,0.0016251991,0.0017311367,0.0020074234,0.001319636,0.0021363492,0.0028901196,0.0022819007,0.009930894],"category_scores_gemma":[0.0049555115,0.0009799644,0.0013162794,0.0020595705,0.0010102277,0.0030972885,0.0029748871,0.0013555354,0.003890213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066316954,0.00023917881,0.0013991229,0.0002853658,0.0000846888,0.00013674045,0.00015751868,0.018395927,0.04294338,0.017941065,0.01012816,0.9076258],"study_design_scores_gemma":[0.00039009098,0.00041876963,0.002147265,0.000067290144,0.0001778237,0.0011339706,0.00038348453,0.7966312,0.07214159,0.11043199,0.015960936,0.00011559309],"about_ca_topic_score_codex":0.0015643442,"about_ca_topic_score_gemma":0.0029714182,"teacher_disagreement_score":0.009930894,"about_ca_system_score_codex":0.00085859705,"about_ca_system_score_gemma":0.002158154,"threshold_uncertainty_score":0.03322208},"labels":[],"label_agreement":null},{"id":"W1500786493","doi":"10.3233/fi-2010-285","title":"An Improved Bound for an Extension of Fine and Wilf’s Theorem and Its Optimality","year":2010,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Extension (predicate logic); Mathematics; Discrete mathematics; Combinatorics; Computer science; Programming language","score_opus":0.016521425353453467,"score_gpt":0.27466689756448437,"score_spread":0.2581454722110309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500786493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07615393,0.011710342,0.70874846,0.013913334,0.0043215733,0.000331933,0.0017047019,0.0015682015,0.18154752],"genre_scores_gemma":[0.58421224,0.0064808205,0.33450332,0.007701862,0.0050987294,0.00095740263,0.0020122342,0.0022140234,0.056819376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98997307,0.0016909649,0.000431685,0.002623112,0.003225754,0.0020553395],"domain_scores_gemma":[0.9700033,0.020353975,0.000879951,0.0044701854,0.0029988948,0.0012935781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00886472,0.0024107848,0.0041959216,0.0044196723,0.0034293921,0.004609189,0.006788376,0.0045090797,0.01810217],"category_scores_gemma":[0.04502211,0.0011931361,0.0046499097,0.0040783025,0.0069910064,0.017671725,0.007773865,0.010551808,0.0050999923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010264411,0.0003156035,0.002138522,0.0008850518,0.00017519054,0.00055050704,0.00069381576,0.02980867,0.006900131,0.81761354,0.042747483,0.09714506],"study_design_scores_gemma":[0.000075328615,0.0002020504,0.0009825233,0.00020703766,0.0001323899,0.00052447186,0.000083874525,0.09139617,0.0034235234,0.8742975,0.028543659,0.00013142968],"about_ca_topic_score_codex":0.003372257,"about_ca_topic_score_gemma":0.0025223226,"teacher_disagreement_score":0.01810217,"about_ca_system_score_codex":0.0058413255,"about_ca_system_score_gemma":0.0033481538,"threshold_uncertainty_score":0.060557783},"labels":[],"label_agreement":null},{"id":"W1501444314","doi":"10.1142/s0129054112400515","title":"QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quotient; Concatenation (mathematics); Mathematics; Regular language; Discrete mathematics; Star (game theory); Combinatorics; Pumping lemma for regular languages; Intersection (aeronautics); Computer science; Theoretical computer science; Automaton; Programming language","score_opus":0.032152299180226156,"score_gpt":0.31842170595452435,"score_spread":0.2862694067742982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501444314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78027856,0.0005343276,0.19333716,0.0010748999,0.00005571221,0.00012738319,0.0010428726,0.00060910615,0.022940008],"genre_scores_gemma":[0.9747672,0.00025031666,0.018670095,0.00012042898,0.00007803678,0.00013247819,0.0008737184,0.00014909846,0.0049585323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711823,0.0004054478,0.0003420369,0.00060447445,0.0010122743,0.00051746774],"domain_scores_gemma":[0.98691326,0.00870308,0.0007560884,0.0012600699,0.0014312491,0.0009361838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013196064,0.00049895875,0.00095644285,0.0012660525,0.0011373889,0.0038621507,0.0012923867,0.0006495583,0.007458239],"category_scores_gemma":[0.011329857,0.0004444755,0.0015183367,0.00093048933,0.003000559,0.009828074,0.003411592,0.0020144877,0.0006038087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005879871,0.00011467724,0.004291371,0.00025657017,0.00005118778,0.00038890267,0.0018516822,0.03484719,0.014420119,0.9191266,0.0019453518,0.022118455],"study_design_scores_gemma":[0.00002852342,0.000059353082,0.0009609214,0.00001557776,0.000029787048,0.00021441217,0.0001397637,0.09238071,0.0065893396,0.8972252,0.002320244,0.000036115795],"about_ca_topic_score_codex":0.0017169906,"about_ca_topic_score_gemma":0.0011572626,"teacher_disagreement_score":0.007458239,"about_ca_system_score_codex":0.0027179178,"about_ca_system_score_gemma":0.0015450021,"threshold_uncertainty_score":0.024950325},"labels":[],"label_agreement":null},{"id":"W1502715615","doi":"10.1016/j.ejc.2015.05.006","title":"Palindromic sequences generated from marked morphisms","year":2015,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Morphism; Mathematics; Palindrome; Alphabet; Combinatorics; Combinatorics on words; Fixed point; Class (philosophy); Aperiodic graph; Order (exchange); Discrete mathematics; Sequence (biology); Geometry","score_opus":0.03061910790872446,"score_gpt":0.21986033904549562,"score_spread":0.18924123113677116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502715615","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56730294,0.00056187843,0.35538313,0.0004960248,0.0004667421,0.00014341644,0.00039015018,0.0011978374,0.07405784],"genre_scores_gemma":[0.9304945,0.00023609125,0.033979926,0.00015509756,0.00016758467,0.000108222885,0.00039644205,0.00023548726,0.03422664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912864,0.0001617424,0.00006540345,0.00027284725,0.00022469438,0.00014662922],"domain_scores_gemma":[0.9975914,0.0012279835,0.00028447362,0.00030296587,0.00032317822,0.0002699838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078832754,0.0007555655,0.00054223667,0.0015655062,0.0013699079,0.0021494124,0.001042545,0.0011400149,0.008500072],"category_scores_gemma":[0.0026091211,0.00057503907,0.0008713378,0.0010120233,0.0013872987,0.0032579699,0.0022769428,0.0019200433,0.002491111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030475773,0.00012951574,0.00069973257,0.00013409129,0.000024341785,0.0010733281,0.0012720622,0.0013776819,0.02089744,0.9536715,0.0008188629,0.01959669],"study_design_scores_gemma":[0.0000817166,0.00017629201,0.0007356879,0.000043477736,0.000046164154,0.0014262063,0.00029775748,0.0063615525,0.021002026,0.95863503,0.011148355,0.00004559305],"about_ca_topic_score_codex":0.0001262802,"about_ca_topic_score_gemma":0.00018618458,"teacher_disagreement_score":0.008500072,"about_ca_system_score_codex":0.0006186338,"about_ca_system_score_gemma":0.0004258996,"threshold_uncertainty_score":0.028435588},"labels":[],"label_agreement":null},{"id":"W1503119185","doi":"10.1007/3-540-36136-7_56","title":"Expected Acceptance Counts for Finite Automata with Almost Uniform Input","year":2002,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Reciprocal; Sequence (biology); Mathematics; Prefix; Automaton; Entropy (arrow of time); Discrete mathematics; Constant (computer programming); Random sequence; Finite-state machine; Algorithm; Computer science; Distribution (mathematics); Theoretical computer science","score_opus":0.016065270335361096,"score_gpt":0.2365474981994039,"score_spread":0.2204822278640428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503119185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51863897,0.00033067184,0.466444,0.0017310127,0.00012241326,0.00021578804,0.0008298008,0.0019053093,0.009782055],"genre_scores_gemma":[0.97072583,0.00011362101,0.024617778,0.00020700558,0.00016858848,0.00034643282,0.0006002377,0.00044983882,0.0027705575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9886669,0.0038494223,0.0008934487,0.002010089,0.0025874132,0.0019927165],"domain_scores_gemma":[0.7945479,0.17079721,0.0059470497,0.011557857,0.0098053785,0.0073446142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0091418335,0.0014035319,0.003199115,0.0020855535,0.0018873536,0.00787014,0.0055573564,0.0031267833,0.010447088],"category_scores_gemma":[0.076122954,0.0017478099,0.0020720067,0.0014600147,0.0034923095,0.01230063,0.003575682,0.0050993734,0.0010204755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040175295,0.0009723172,0.0133473305,0.000820323,0.00035034528,0.00065505074,0.0017737763,0.11675571,0.014732782,0.8057194,0.0048577073,0.03599775],"study_design_scores_gemma":[0.00019014369,0.00025022414,0.0017129383,0.00004782941,0.000106661755,0.00030833535,0.00017501778,0.4417446,0.0065292963,0.5482289,0.0006163764,0.000089609865],"about_ca_topic_score_codex":0.00067317387,"about_ca_topic_score_gemma":0.0009071243,"teacher_disagreement_score":0.010447088,"about_ca_system_score_codex":0.0033514986,"about_ca_system_score_gemma":0.0023856482,"threshold_uncertainty_score":0.048347235},"labels":[],"label_agreement":null},{"id":"W1503539558","doi":"10.1007/978-3-540-74456-6_45","title":"State Complexity of Basic Operations on Suffix-Free Regular Languages","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Suffix; State (computer science); Programming language; Theoretical computer science; Linguistics","score_opus":0.02995933655791481,"score_gpt":0.2700726167175028,"score_spread":0.24011328015958802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503539558","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8425209,0.00041989982,0.124736674,0.0011999619,0.0000659414,0.000100179175,0.0013304445,0.00072975486,0.028896276],"genre_scores_gemma":[0.98069876,0.00023552719,0.0119587425,0.00006709881,0.000097687334,0.00010228693,0.00091431424,0.00017861559,0.0057469774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788207,0.00035602823,0.00015691012,0.0003552475,0.0007859567,0.0004637438],"domain_scores_gemma":[0.97925127,0.016359266,0.0009308977,0.0017204143,0.0010289683,0.0007091561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013310855,0.00057066017,0.0013567107,0.0012294773,0.0013731407,0.006357405,0.0020187986,0.0015057471,0.011410359],"category_scores_gemma":[0.010843727,0.0008230974,0.0015378401,0.002077382,0.0026788765,0.012081999,0.0023402148,0.0032146336,0.0008698849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008236479,0.0002154059,0.002335499,0.00021083202,0.000051162362,0.00016237378,0.0010605012,0.043844223,0.008501541,0.9148259,0.0032538848,0.024714934],"study_design_scores_gemma":[0.00005103065,0.000063717845,0.00088204007,0.000013595272,0.00003216223,0.00007625177,0.00013218341,0.12129009,0.0038621183,0.87283397,0.0007286518,0.000034214972],"about_ca_topic_score_codex":0.0019147607,"about_ca_topic_score_gemma":0.002103498,"teacher_disagreement_score":0.011410359,"about_ca_system_score_codex":0.0024490675,"about_ca_system_score_gemma":0.0018261386,"threshold_uncertainty_score":0.03817147},"labels":[],"label_agreement":null},{"id":"W1504799708","doi":"10.46298/dmtcs.566","title":"Monadic Second-Order Classes of Forests with a Monadic Second-Order 0-1 Law","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Order (exchange); Mathematics; Law; Political science; Business","score_opus":0.010491665668105733,"score_gpt":0.24365169020359717,"score_spread":0.23316002453549145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504799708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36412174,0.0029495666,0.51899165,0.0029171193,0.0003774464,0.00012787888,0.00081375864,0.0012142366,0.108486675],"genre_scores_gemma":[0.9254458,0.00046282983,0.057424236,0.00046028104,0.0003923486,0.00015215327,0.00037618057,0.00013420783,0.015152027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982153,0.00031296804,0.000112138834,0.00039878712,0.00056041137,0.00040052304],"domain_scores_gemma":[0.996557,0.0016095819,0.00036753571,0.00044883284,0.0005705685,0.0004465076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002082171,0.00041565165,0.00064643833,0.002413588,0.0020141064,0.0046931924,0.0009153451,0.000975791,0.0032082333],"category_scores_gemma":[0.004012564,0.00043424763,0.001745674,0.0013317798,0.0052218544,0.0074274903,0.0020441632,0.0022261613,0.000416847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000098715445,0.0000059607196,0.00031942822,0.000010947058,0.0000026813416,0.000034412715,0.00019369886,0.0003262846,0.00036501736,0.9970023,0.00026172487,0.0014676485],"study_design_scores_gemma":[0.000019084031,0.00001975332,0.0010797245,0.000018761662,0.000014821894,0.0002190487,0.00014292932,0.009030505,0.0011634831,0.97556585,0.0127012385,0.000024652687],"about_ca_topic_score_codex":0.0071786456,"about_ca_topic_score_gemma":0.0075280895,"teacher_disagreement_score":0.0071786456,"about_ca_system_score_codex":0.004136002,"about_ca_system_score_gemma":0.0012352673,"threshold_uncertainty_score":0.030008912},"labels":[],"label_agreement":null},{"id":"W1504896064","doi":"10.3233/fi-2013-804","title":"Filtrations of Formal Languages by Arithmetic Progressions","year":2013,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arithmetic; Computer science; Mathematics; Programming language; Algebra over a field; Pure mathematics","score_opus":0.004885578396302735,"score_gpt":0.22976776281802905,"score_spread":0.2248821844217263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504896064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45579925,0.00083817815,0.50701714,0.00081197266,0.0001660021,0.00017905816,0.0005753686,0.001694441,0.032918647],"genre_scores_gemma":[0.891756,0.00039097894,0.095286645,0.00022925183,0.000252671,0.00031578063,0.0006680159,0.00023913471,0.010861593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971054,0.00064592675,0.00031225086,0.0007469462,0.00059650105,0.0005929392],"domain_scores_gemma":[0.99337715,0.0037728546,0.0006113741,0.0008671447,0.0006709897,0.0007005075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028738298,0.00083484483,0.00089555123,0.002838068,0.0025316495,0.004403189,0.00074844615,0.0009977643,0.004968969],"category_scores_gemma":[0.006137205,0.00082579046,0.0026889623,0.0011281896,0.0044055013,0.0057692598,0.002928462,0.0021974067,0.0009218995],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014171761,0.000052518844,0.0007844933,0.00008313448,0.000020309973,0.00038922997,0.0014178168,0.0036721977,0.009320461,0.96958935,0.0008344853,0.013694234],"study_design_scores_gemma":[0.000049032016,0.00009689581,0.00066768273,0.000042781416,0.00002905727,0.00037595746,0.00021262898,0.015668817,0.007151235,0.96824616,0.007403127,0.00005672835],"about_ca_topic_score_codex":0.0011013394,"about_ca_topic_score_gemma":0.00077626074,"teacher_disagreement_score":0.004968969,"about_ca_system_score_codex":0.0018616625,"about_ca_system_score_gemma":0.0010056357,"threshold_uncertainty_score":0.016622841},"labels":[],"label_agreement":null},{"id":"W1505339043","doi":"10.1090/proc/13013","title":"Incoherent Coxeter Groups","year":2015,"lang":"en","type":"preprint","venue":"Proceedings of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Coxeter group; Mathematics; Combinatorics","score_opus":0.019771557830328072,"score_gpt":0.25868605566610214,"score_spread":0.23891449783577406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505339043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2821534,0.00053320517,0.6478027,0.0032324465,0.000546456,0.00010474419,0.00041921,0.00045307615,0.06475477],"genre_scores_gemma":[0.93990386,0.00029591648,0.045228522,0.00063603645,0.0005775151,0.00015379845,0.00035362868,0.00020476902,0.012646002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99573416,0.0010569809,0.0002823977,0.0010046223,0.0014285154,0.0004933381],"domain_scores_gemma":[0.9878115,0.005669938,0.0012979726,0.0027271588,0.0018417814,0.00065159245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003748849,0.0006802227,0.0008839248,0.0018978438,0.0031591197,0.003401264,0.0013161979,0.0012601664,0.008591779],"category_scores_gemma":[0.016056674,0.000704413,0.0012487527,0.0011394911,0.005639491,0.0069721863,0.004475689,0.003655205,0.0011466919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021496628,0.000008595293,0.00039597237,0.000020825019,0.000007019397,0.00006712167,0.0002623913,0.00045313462,0.0005919847,0.99591285,0.000435352,0.001823283],"study_design_scores_gemma":[0.000007976695,0.000020039168,0.00020173364,0.0000096041385,0.0000075692433,0.00009952065,0.00010097264,0.00391427,0.0009506417,0.9918601,0.002817166,0.000010440167],"about_ca_topic_score_codex":0.00043540474,"about_ca_topic_score_gemma":0.00045295118,"teacher_disagreement_score":0.008591779,"about_ca_system_score_codex":0.0010250498,"about_ca_system_score_gemma":0.0007221668,"threshold_uncertainty_score":0.028742313},"labels":[],"label_agreement":null},{"id":"W1506687179","doi":"10.1007/3-540-45005-x_28","title":"Circular Words Avoiding Patterns","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Cube (algebra); Binary number; Algorithm; Arithmetic; Combinatorics; Mathematics","score_opus":0.014616099937376179,"score_gpt":0.22725970504435922,"score_spread":0.21264360510698305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506687179","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12278992,0.0013831555,0.17465042,0.0013560678,0.000916352,0.00014586208,0.0005087855,0.0010294651,0.69722],"genre_scores_gemma":[0.5761907,0.0013659908,0.05747222,0.0005785721,0.00040758672,0.00022955131,0.0010237827,0.0007236067,0.36200795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999624,0.000049828202,0.00002938146,0.000108752414,0.00011737675,0.000070604896],"domain_scores_gemma":[0.99937683,0.00016845891,0.00005635525,0.000192799,0.00014040654,0.000065128486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002268244,0.00044355847,0.00049418525,0.0010015717,0.0015538225,0.0021320519,0.00061513524,0.0007754652,0.01790317],"category_scores_gemma":[0.0015018772,0.0004312371,0.00047132955,0.0013734401,0.0015164554,0.0034616152,0.0019573877,0.0012633326,0.0055424743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004032214,0.00001259901,0.000117933945,0.000051037816,0.0000043649275,0.00010087695,0.00036604787,0.00022582298,0.0021006395,0.96275926,0.005386079,0.028834948],"study_design_scores_gemma":[0.00000937947,0.000020012205,0.00012148758,0.000017709604,0.000008507321,0.00034626946,0.00016169953,0.0010506758,0.0020578348,0.945461,0.050736878,0.000008486577],"about_ca_topic_score_codex":0.00036339933,"about_ca_topic_score_gemma":0.00040910387,"teacher_disagreement_score":0.01790317,"about_ca_system_score_codex":0.00054925063,"about_ca_system_score_gemma":0.00046153393,"threshold_uncertainty_score":0.059892118},"labels":[],"label_agreement":null},{"id":"W1512110678","doi":"10.1007/bfb0023887","title":"Kleene automata and recursion theory","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Recursion (computer science); Kleene's recursion theorem; Primitive recursive function; Negation; Automaton; Class (philosophy); Finite-state machine; Mathematics; Turing machine; Discrete mathematics; Computer science; Algebra over a field; Algorithm; Theoretical computer science; Pure mathematics; Programming language; Artificial intelligence","score_opus":0.010200385523994044,"score_gpt":0.22829224856054825,"score_spread":0.2180918630365542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512110678","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01785852,0.04450935,0.25250027,0.0059281164,0.0015334431,0.000077168035,0.00053556095,0.00087763875,0.6761799],"genre_scores_gemma":[0.5157922,0.034736264,0.0806253,0.0016402308,0.002784308,0.00032556904,0.0012710806,0.0006451291,0.36217988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943465,0.00013996956,0.000040100003,0.00010001991,0.00021714978,0.00006801739],"domain_scores_gemma":[0.9993389,0.00041959572,0.00003037203,0.00009215721,0.000092691,0.000026202408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057404133,0.0008298165,0.0010314712,0.0017308203,0.001828096,0.0045017484,0.0010926978,0.0016915591,0.014271359],"category_scores_gemma":[0.0017423749,0.0007183392,0.0007954358,0.0029392568,0.004224601,0.009984664,0.0013312877,0.00368206,0.0045572557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033055776,0.0000054932866,0.000020181007,0.000040728628,0.00000249016,0.000020127189,0.0001841051,0.0002983127,0.00017544477,0.98934597,0.0024362742,0.007467518],"study_design_scores_gemma":[0.000002368354,0.0000025224513,0.000027479795,0.00001768971,0.0000029831351,0.000037440725,0.000034867157,0.00037295988,0.000131081,0.9726616,0.026703775,0.0000051928355],"about_ca_topic_score_codex":0.0015456576,"about_ca_topic_score_gemma":0.0020542312,"teacher_disagreement_score":0.014271359,"about_ca_system_score_codex":0.002346327,"about_ca_system_score_gemma":0.0010524888,"threshold_uncertainty_score":0.047742426},"labels":[],"label_agreement":null},{"id":"W1512254831","doi":"10.1007/3-540-45687-2_27","title":"Algorithms for Computing Small NFAs","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science","score_opus":0.03125291508506543,"score_gpt":0.248655068798754,"score_spread":0.21740215371368854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512254831","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016119668,0.00059571344,0.9703616,0.00034790367,0.00010015536,0.00013743312,0.000300045,0.003402844,0.008634735],"genre_scores_gemma":[0.1456701,0.00071587856,0.8403818,0.0002175338,0.00016309721,0.0004914438,0.0013919341,0.0008698327,0.01009839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983279,0.0003666922,0.00015203412,0.00043345283,0.0005219419,0.00019799208],"domain_scores_gemma":[0.99053264,0.0062614805,0.00028702928,0.00207105,0.0006119018,0.00023582074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018173929,0.0016558109,0.0016523493,0.0024890194,0.0015416581,0.0038992371,0.0033937455,0.0016248425,0.018688088],"category_scores_gemma":[0.010762238,0.0010295586,0.0023425962,0.0035792498,0.0022872547,0.012272032,0.0040504215,0.0032700016,0.004109787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042391077,0.000185711,0.0010807426,0.000677907,0.00008717703,0.00007988082,0.00052399136,0.032598272,0.0057928115,0.4800432,0.012553978,0.46595252],"study_design_scores_gemma":[0.0000673363,0.000044443335,0.00016931847,0.000071251656,0.00006175161,0.000095593256,0.00011003777,0.10970365,0.0035486312,0.8763294,0.009773848,0.000024814437],"about_ca_topic_score_codex":0.001556579,"about_ca_topic_score_gemma":0.0034076388,"teacher_disagreement_score":0.018688088,"about_ca_system_score_codex":0.002065587,"about_ca_system_score_gemma":0.0013819858,"threshold_uncertainty_score":0.06251788},"labels":[],"label_agreement":null},{"id":"W1512553031","doi":"10.1007/978-3-540-77684-0_16","title":"Visibly Pushdown Transducers for Approximate Validation of Streaming XML","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Well-formed document; XML validation; Document Structure Description; XML; Pushdown automaton; Streaming XML; Programming language; XML Schema (W3C); XML Encryption; Theoretical computer science; Automaton; World Wide Web","score_opus":0.01680012912695094,"score_gpt":0.23939827623336368,"score_spread":0.22259814710641274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512553031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014907173,0.00019045091,0.97694904,0.00026044066,0.000115777904,0.00008380707,0.00023480863,0.00510512,0.0021533426],"genre_scores_gemma":[0.55083567,0.00030149077,0.43874332,0.00031831992,0.00015111956,0.00031772334,0.0013023464,0.0018048341,0.006225131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99350834,0.002051421,0.00063194684,0.0011058325,0.0021789,0.00052358024],"domain_scores_gemma":[0.9681773,0.020078557,0.00090752024,0.008292479,0.0022211645,0.00032297202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050437534,0.0010217538,0.0016294958,0.0012919914,0.0012440598,0.0036510224,0.0033716096,0.0024178617,0.006924341],"category_scores_gemma":[0.026615564,0.0014628398,0.0023367906,0.00135894,0.0036784231,0.009154844,0.0059240703,0.004456278,0.0017913781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011741052,0.0001853441,0.0021168962,0.0007660929,0.00020143834,0.0007528511,0.0012599698,0.176989,0.0352432,0.57972217,0.0064010224,0.19518787],"study_design_scores_gemma":[0.00004784091,0.00009270072,0.00020451393,0.00008011371,0.000079261794,0.0001868537,0.00015226183,0.4605346,0.031624313,0.50237936,0.0045563406,0.00006184075],"about_ca_topic_score_codex":0.0017448132,"about_ca_topic_score_gemma":0.0026965404,"teacher_disagreement_score":0.006924341,"about_ca_system_score_codex":0.001984845,"about_ca_system_score_gemma":0.0020584585,"threshold_uncertainty_score":0.02667427},"labels":[],"label_agreement":null},{"id":"W1517109152","doi":"10.37236/2721","title":"On a Matrix Representation for Polynomially Recursive Sequences","year":2012,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Characterization (materials science); Sequence (biology); Uniqueness; Extension (predicate logic); Combinatorics; Representation (politics); Matrix (chemical analysis); Similarity (geometry); Field (mathematics); Canonical form; Discrete mathematics; Pure mathematics; Algebra over a field; Mathematical analysis; Computer science","score_opus":0.012416149409724757,"score_gpt":0.2878384431530843,"score_spread":0.2754222937433596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517109152","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.327614,0.0006300593,0.5812109,0.0012675038,0.00033987805,0.00009854253,0.00034647214,0.00031167362,0.088180915],"genre_scores_gemma":[0.9309288,0.0004372512,0.049967322,0.00023102004,0.00027586476,0.000083885796,0.0002251783,0.000095962976,0.017754674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995746,0.0000864864,0.000022337195,0.000106259635,0.00012619968,0.00008419949],"domain_scores_gemma":[0.99943954,0.00022456804,0.00007989736,0.00005595002,0.000120120676,0.0000798864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005445004,0.00038745452,0.00025095697,0.0008138333,0.00092982914,0.0014773273,0.00035360391,0.00057992776,0.0076097865],"category_scores_gemma":[0.0018094867,0.00015571843,0.00040574392,0.0006161727,0.0014393554,0.0028915573,0.00096043845,0.0010469501,0.0012206074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009214725,0.000007224234,0.00005923242,0.0000135510745,9.049834e-7,0.00005338608,0.00016631387,0.00041885476,0.0016066867,0.9936173,0.00024789677,0.0037994385],"study_design_scores_gemma":[0.000007682913,0.00004130969,0.00014263611,0.000013518233,0.0000031889235,0.00019359645,0.00012534669,0.010191187,0.0019704537,0.9817722,0.005524332,0.000014523652],"about_ca_topic_score_codex":0.00047988535,"about_ca_topic_score_gemma":0.00045392828,"teacher_disagreement_score":0.0076097865,"about_ca_system_score_codex":0.00064627716,"about_ca_system_score_gemma":0.00037410934,"threshold_uncertainty_score":0.025457263},"labels":[],"label_agreement":null},{"id":"W1519107695","doi":"10.37236/436","title":"A Theory of Transformation Monoids: Combinatorics and Representation Theory","year":2010,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monoid; Mathematics; Transformation (genetics); Discrete mathematics; Pure mathematics; Combinatorics; Algebra over a field","score_opus":0.010460771401402174,"score_gpt":0.24416750660461436,"score_spread":0.2337067352032122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519107695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07386525,0.006965376,0.805877,0.0039131623,0.00064762513,0.00012750634,0.0006101795,0.00044297447,0.10755093],"genre_scores_gemma":[0.7965623,0.0041400604,0.14975323,0.0009958153,0.0011874232,0.0003845839,0.00072100887,0.00018379932,0.04607175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909985,0.00024142304,0.000062242085,0.00022060213,0.00025983964,0.00011601569],"domain_scores_gemma":[0.9987367,0.0006019402,0.0001300267,0.00022424686,0.000172042,0.0001351128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096536585,0.0005112345,0.00059665,0.0017917465,0.00195015,0.0040675523,0.0010862558,0.0011504539,0.0077038077],"category_scores_gemma":[0.0018331846,0.00038750548,0.0011273791,0.0018514011,0.004928835,0.0071643894,0.00218922,0.0021263256,0.001142102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029106704,0.0000039781717,0.00004831196,0.000017032582,0.0000018034369,0.00002225524,0.000091322036,0.00028798348,0.00017983258,0.99672335,0.0002610828,0.0023602291],"study_design_scores_gemma":[0.000004775791,0.0000107518135,0.00007111013,0.000014857525,0.0000038762755,0.00010147438,0.0000487067,0.0024091778,0.00025985617,0.9849908,0.012079193,0.0000053530052],"about_ca_topic_score_codex":0.00092538487,"about_ca_topic_score_gemma":0.0006000332,"teacher_disagreement_score":0.0077038077,"about_ca_system_score_codex":0.0018246606,"about_ca_system_score_gemma":0.0009854988,"threshold_uncertainty_score":0.025771797},"labels":[],"label_agreement":null},{"id":"W1524205571","doi":"10.1007/978-3-540-30500-2_20","title":"State Complexity and the Monoid of Transformations of a Finite Set","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Monoid; State (computer science); Computer science; Root (linguistics); Set (abstract data type); Free monoid; Syntactic monoid; Finite-state machine; Computational complexity theory; Regular language; Finite set; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics; Automaton; Programming language; Linguistics","score_opus":0.021319518591987767,"score_gpt":0.23951034962227816,"score_spread":0.21819083103029038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524205571","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43704084,0.006889935,0.39671758,0.00450526,0.00031411438,0.00015460438,0.0011414636,0.00042768323,0.15280846],"genre_scores_gemma":[0.95512915,0.0014113683,0.026990408,0.0001648998,0.0002921527,0.0001399445,0.0004586919,0.00006159705,0.015351776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815625,0.0004503195,0.00017112604,0.0003862666,0.00064477674,0.00019125895],"domain_scores_gemma":[0.99020547,0.0076319454,0.0005049249,0.0008516803,0.0004971717,0.0003087301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014039837,0.00043234392,0.00094266987,0.0020046101,0.0015009192,0.0062534055,0.0009969234,0.0012529304,0.0060633495],"category_scores_gemma":[0.006796617,0.0006001476,0.0012436896,0.0018612772,0.0041991943,0.011713068,0.0020374553,0.0029879513,0.00046390315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036928064,0.000011757374,0.00025716185,0.00004201168,0.0000080859745,0.000022683213,0.00019223557,0.0022291148,0.00041850467,0.99142766,0.00038695944,0.0049670283],"study_design_scores_gemma":[0.000007232195,0.000015092981,0.00021129205,0.000008018039,0.000007598041,0.0000483867,0.000038614675,0.007925639,0.00036700387,0.98976785,0.0015935332,0.000009796635],"about_ca_topic_score_codex":0.0013804586,"about_ca_topic_score_gemma":0.000911831,"teacher_disagreement_score":0.0062534055,"about_ca_system_score_codex":0.0026060494,"about_ca_system_score_gemma":0.0009941189,"threshold_uncertainty_score":0.020283878},"labels":[],"label_agreement":null},{"id":"W1524482766","doi":"10.1007/978-3-540-30550-7_8","title":"The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hierarchy; Delta; Polynomial; Mathematics; Combinatorics; Physics; Mathematical analysis; Political science; Astronomy","score_opus":0.017019496046477036,"score_gpt":0.2334018407475007,"score_spread":0.21638234470102366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524482766","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12089979,0.001656043,0.6003537,0.003383514,0.0006291175,0.00012722716,0.0007660431,0.0012767689,0.2709078],"genre_scores_gemma":[0.7827787,0.00156592,0.14539818,0.0009572555,0.00040928976,0.00014575246,0.00041958597,0.0007824199,0.06754286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990798,0.00012095045,0.000055578843,0.00025087318,0.00023283256,0.00025989438],"domain_scores_gemma":[0.99753404,0.0010111784,0.00014023614,0.0005576049,0.00043372528,0.00032323363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073480426,0.0005798924,0.0008979821,0.0015062467,0.0021760727,0.00526381,0.0014220407,0.0020155734,0.017581709],"category_scores_gemma":[0.004468325,0.00083442294,0.0011482817,0.0015072325,0.004938688,0.015340293,0.003053138,0.005302043,0.0036105097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018221544,0.000008577968,0.000088030014,0.000020210424,0.0000016036419,0.000025952206,0.00015811756,0.00014541393,0.00048542506,0.9923219,0.0006914444,0.006035151],"study_design_scores_gemma":[0.000009779294,0.000011765632,0.00015073789,0.000012617301,0.000005228716,0.00008080584,0.00010549799,0.0014856219,0.0006359003,0.99142504,0.0060659316,0.000010985878],"about_ca_topic_score_codex":0.0019308066,"about_ca_topic_score_gemma":0.002760035,"teacher_disagreement_score":0.017581709,"about_ca_system_score_codex":0.0017597559,"about_ca_system_score_gemma":0.0008826307,"threshold_uncertainty_score":0.05881667},"labels":[],"label_agreement":null},{"id":"W1524812206","doi":"10.1007/978-3-642-02737-6_14","title":"An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Extension (predicate logic); Computer science; Algorithm; Programming language","score_opus":0.011703666272083312,"score_gpt":0.24108665072141916,"score_spread":0.22938298444933586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524812206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10377889,0.003418642,0.44943807,0.0027222824,0.0018615597,0.00008163907,0.00032229378,0.0006916019,0.43768498],"genre_scores_gemma":[0.7762589,0.00408155,0.0745902,0.0017306565,0.0028146582,0.00019275869,0.00046606807,0.0005496088,0.13931571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956757,0.00009003089,0.000029276676,0.000113582755,0.00013746425,0.00006199859],"domain_scores_gemma":[0.9992341,0.00036431002,0.000052188985,0.00015340644,0.00013899223,0.00005700863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005696071,0.0005895096,0.00080947543,0.0014759388,0.0012713373,0.0018730512,0.0009997202,0.0009362234,0.012909822],"category_scores_gemma":[0.0021793158,0.0004290246,0.0013128683,0.0012788634,0.0022723023,0.005253775,0.0023916776,0.0018883231,0.002261907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034165452,0.0000149406205,0.000062492305,0.00006606158,0.0000063307834,0.000121747566,0.00017632154,0.00076923246,0.0012881845,0.9804269,0.0020199649,0.015013517],"study_design_scores_gemma":[0.000010366016,0.00001771784,0.00009037189,0.000012779196,0.000007645374,0.00009923064,0.000029131548,0.0029781929,0.000603728,0.9868847,0.009255305,0.000010768041],"about_ca_topic_score_codex":0.00054213643,"about_ca_topic_score_gemma":0.00057208264,"teacher_disagreement_score":0.012909822,"about_ca_system_score_codex":0.000773375,"about_ca_system_score_gemma":0.0004890712,"threshold_uncertainty_score":0.043187678},"labels":[],"label_agreement":null},{"id":"W1525517827","doi":"10.1007/3-540-45005-x_18","title":"Improved Bounds on the Number of Automata Accepting Finite Languages","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Deterministic finite automaton; Computer science; Pairwise comparison; Automaton; Finite-state machine; Upper and lower bounds; DFA minimization; Regular language; Quantum finite automata; Finite set; Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Automata theory; Artificial intelligence","score_opus":0.014217663678697284,"score_gpt":0.2594135747342495,"score_spread":0.2451959110555522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525517827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09938587,0.008642907,0.7389852,0.007510298,0.0027052148,0.00044603235,0.00326647,0.008621026,0.13043706],"genre_scores_gemma":[0.5912641,0.0046837823,0.32904354,0.0030177766,0.0050246106,0.0018910842,0.0051653464,0.0041980674,0.055711642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98399144,0.002871462,0.0010717076,0.0039449916,0.004964584,0.0031558322],"domain_scores_gemma":[0.87014043,0.10097415,0.00252816,0.01725513,0.005586659,0.0035155239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01010099,0.0045085344,0.004813867,0.004632745,0.0035758927,0.010558831,0.014223263,0.0050265053,0.035055652],"category_scores_gemma":[0.0528238,0.0029025876,0.005728125,0.0037045118,0.0071912245,0.030469991,0.011259516,0.016222479,0.008760187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006813597,0.0009463212,0.0044764676,0.0019505762,0.00044361895,0.0006080615,0.0013099465,0.15218161,0.03555846,0.6049186,0.044574175,0.14621854],"study_design_scores_gemma":[0.00023045077,0.0002689973,0.0013055116,0.00023383106,0.00033054495,0.0003788499,0.00014191067,0.29314896,0.013253855,0.678018,0.012522831,0.00016634275],"about_ca_topic_score_codex":0.0020620076,"about_ca_topic_score_gemma":0.0039022977,"teacher_disagreement_score":0.035055652,"about_ca_system_score_codex":0.007815981,"about_ca_system_score_gemma":0.003477831,"threshold_uncertainty_score":0.11727291},"labels":[],"label_agreement":null},{"id":"W1526241488","doi":"10.1007/978-3-540-70844-5_2","title":"Language Decompositions, Primality, and Trajectory-Based Operations","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Primality test; Catenation; Computer science; Theoretical computer science; Programming language; Arithmetic; Algebra over a field; Discrete mathematics; Mathematics; Pure mathematics","score_opus":0.011695224623256516,"score_gpt":0.24572345660833153,"score_spread":0.23402823198507502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526241488","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04271756,0.001663602,0.88627183,0.0011139892,0.00033934208,0.000067357156,0.00026771432,0.00053073803,0.06702782],"genre_scores_gemma":[0.62322557,0.0021221961,0.32986036,0.00034834028,0.00044778397,0.00027968985,0.0006390489,0.0006074198,0.042469576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990208,0.00028187095,0.00009056905,0.00025580073,0.00017973782,0.00017125334],"domain_scores_gemma":[0.998448,0.00060592574,0.00014964967,0.00036597886,0.00025219558,0.00017817429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013935739,0.00064596406,0.00066585874,0.0011720479,0.0013034795,0.0034229397,0.00095376297,0.00093036797,0.008714699],"category_scores_gemma":[0.0030468134,0.0005699701,0.001428686,0.0011645311,0.003987978,0.008337339,0.0031670218,0.003402179,0.0017136004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025024094,0.000006687346,0.0000349936,0.000021645625,0.0000025479267,0.000020639356,0.00013557797,0.00068064494,0.000524838,0.9900282,0.00047146247,0.008047655],"study_design_scores_gemma":[0.0000056122494,0.000011999591,0.000028144865,0.000014045168,0.000005582777,0.000060054976,0.000064889595,0.0037088813,0.0006623506,0.99141496,0.004017174,0.0000061620453],"about_ca_topic_score_codex":0.00039135283,"about_ca_topic_score_gemma":0.000340253,"teacher_disagreement_score":0.008714699,"about_ca_system_score_codex":0.0011667773,"about_ca_system_score_gemma":0.00068650045,"threshold_uncertainty_score":0.029153585},"labels":[],"label_agreement":null},{"id":"W1529714626","doi":"10.1007/3-540-44674-5_20","title":"An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Cover (algebra); Computer science; Deterministic finite automaton; DFA minimization; Finite-state machine; Automaton; Nondeterministic finite automaton; Regular language; Algorithm; Deterministic automaton; Time complexity; Quantum finite automata; Computational complexity theory; Formal language; Theoretical computer science; Automata theory","score_opus":0.015139076732280194,"score_gpt":0.26906014390683425,"score_spread":0.25392106717455404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529714626","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040965404,0.00034107832,0.9286821,0.00047653672,0.00009062593,0.0003994282,0.0006938896,0.016590413,0.011760565],"genre_scores_gemma":[0.13707037,0.000166862,0.8510377,0.0001955003,0.00004009663,0.000591813,0.002618554,0.0014182227,0.0068608182],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915075,0.00014131407,0.000062542,0.0002468461,0.0002627297,0.0001357768],"domain_scores_gemma":[0.99783593,0.0013425504,0.00007155694,0.00049399206,0.00017369354,0.00008231128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048095395,0.0014173945,0.0012231458,0.0011376635,0.0015230363,0.0020038215,0.0023659575,0.0015359217,0.017510165],"category_scores_gemma":[0.0027201185,0.0011725086,0.0021809153,0.0016312297,0.00093199953,0.0045687654,0.0033019152,0.0020086172,0.004830102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079501275,0.00040951467,0.0015115041,0.00082996715,0.00016750445,0.0002798903,0.0006711433,0.024374422,0.04486674,0.044104736,0.0280311,0.8539584],"study_design_scores_gemma":[0.0004803767,0.00034379415,0.0016355658,0.00018168984,0.00038764675,0.00073752407,0.00068609125,0.58020645,0.06673067,0.3067071,0.04175058,0.00015247164],"about_ca_topic_score_codex":0.0025584898,"about_ca_topic_score_gemma":0.0073671467,"teacher_disagreement_score":0.017510165,"about_ca_system_score_codex":0.0015835689,"about_ca_system_score_gemma":0.001689865,"threshold_uncertainty_score":0.05857736},"labels":[],"label_agreement":null},{"id":"W1529995230","doi":"10.1007/978-3-540-88282-4_7","title":"Finite Automata, Palindromes, Powers, and Patterns","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Palindrome; Word (group theory); Automaton; Nondeterministic algorithm; Computer science; Mathematics; Combinatorics; Discrete mathematics; Arithmetic; Theoretical computer science; Biology","score_opus":0.012039608008618592,"score_gpt":0.2215446534782919,"score_spread":0.2095050454696733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529995230","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09577295,0.050977137,0.29270253,0.005376546,0.0019179014,0.00010306673,0.0005479994,0.0007474237,0.55185443],"genre_scores_gemma":[0.7941273,0.017687788,0.07910855,0.0011600197,0.0018871045,0.00023506109,0.0005754076,0.00021659448,0.105002135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995295,0.00012789686,0.000042429907,0.00012940966,0.00012674989,0.000043987446],"domain_scores_gemma":[0.99920434,0.00046762626,0.000054537268,0.00015700392,0.00007296848,0.00004350189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000466299,0.00056973624,0.0006492804,0.0011113844,0.000995138,0.002875236,0.0007575852,0.0008870714,0.007184395],"category_scores_gemma":[0.0020296683,0.000440647,0.00058988424,0.0017706697,0.0044195657,0.007044607,0.0009469512,0.001872879,0.0015785145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016218759,0.000010693337,0.00008726553,0.00008677722,0.0000040110303,0.00005009398,0.0003401179,0.00033541422,0.0008768623,0.9734293,0.002347654,0.02241555],"study_design_scores_gemma":[0.0000031760062,0.000008928958,0.00004678823,0.000017401542,0.0000025565137,0.00011516892,0.000074942494,0.0004297901,0.00021210927,0.9870897,0.011995758,0.0000036597187],"about_ca_topic_score_codex":0.00039115982,"about_ca_topic_score_gemma":0.0005517509,"teacher_disagreement_score":0.007184395,"about_ca_system_score_codex":0.00069146114,"about_ca_system_score_gemma":0.00034344126,"threshold_uncertainty_score":0.024034142},"labels":[],"label_agreement":null},{"id":"W1532642937","doi":"10.1016/j.tcs.2009.07.049","title":"On NFAs where all states are final, initial, or both","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nondeterministic algorithm; Automaton; Nondeterministic finite automaton; Finite-state machine; Regular language; Computer science; Discrete mathematics; Theoretical computer science; Combinatorics; Mathematics; Programming language; Automata theory","score_opus":0.024796216736811667,"score_gpt":0.2909578726236236,"score_spread":0.26616165588681195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532642937","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22074679,0.0013204851,0.71266234,0.0020856499,0.00048790788,0.00021713309,0.001194321,0.0021370715,0.0591483],"genre_scores_gemma":[0.8267475,0.0013868161,0.13148752,0.0007610882,0.00069047656,0.0006073644,0.0015876682,0.00072971504,0.03600189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951041,0.0012242445,0.00041500127,0.0011306435,0.0012007658,0.0009253843],"domain_scores_gemma":[0.98174715,0.011556686,0.0013919831,0.0033190604,0.001269526,0.0007155656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003295212,0.0012616351,0.0017571127,0.002351476,0.0033149552,0.0052014417,0.0017720019,0.0029815217,0.0085806],"category_scores_gemma":[0.013572322,0.000957538,0.0026655444,0.0022487734,0.0060569276,0.01758866,0.0042450647,0.002806266,0.0017037044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020791114,0.000084022526,0.00106289,0.00018919696,0.00005652659,0.0004342801,0.0012123488,0.008211572,0.003915029,0.96298337,0.001558516,0.020084256],"study_design_scores_gemma":[0.000028491257,0.000032298893,0.0002134095,0.000081656486,0.000037286973,0.00025050092,0.00016753259,0.01310734,0.0011197107,0.9815523,0.0033749596,0.000034579425],"about_ca_topic_score_codex":0.0035461143,"about_ca_topic_score_gemma":0.004285273,"teacher_disagreement_score":0.0085806,"about_ca_system_score_codex":0.002485845,"about_ca_system_score_gemma":0.0016816766,"threshold_uncertainty_score":0.028704941},"labels":[],"label_agreement":null},{"id":"W1533036729","doi":"10.1007/s00224-013-9515-7","title":"Quotient Complexity of Closed Languages","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Waterloo","funders":"","keywords":"Suffix; Concatenation (mathematics); Prefix; Closure (psychology); Regular language; Complement (music); Subsequence; Formal language; Abstract family of languages; Mathematics; Quotient; Computer science; Discrete mathematics; Transitive closure; Word (group theory); Combinatorics; Theoretical computer science; Algorithm; Automaton; Linguistics; Programming language","score_opus":0.024427312795081518,"score_gpt":0.2479190127007407,"score_spread":0.2234916999056592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533036729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55083513,0.0029606828,0.30514854,0.008036699,0.00030662856,0.00009697003,0.0009273144,0.0005535056,0.13113444],"genre_scores_gemma":[0.97707987,0.0005510002,0.010390798,0.00024829357,0.00031571934,0.00008974211,0.00046166655,0.00008979776,0.010772927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976497,0.0006245903,0.0001432817,0.0004355269,0.0008154596,0.0003313573],"domain_scores_gemma":[0.99259925,0.0050413627,0.00035339428,0.0006538259,0.0007293176,0.00062281825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016991955,0.00067491375,0.0014345427,0.0021885755,0.0017807982,0.00602391,0.0019240481,0.0011450105,0.00910635],"category_scores_gemma":[0.008268035,0.00049489044,0.0013882754,0.0018953598,0.004562197,0.016307471,0.0033234102,0.003919006,0.0005316997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003711844,0.000014903803,0.0002420385,0.000024002842,0.000006457863,0.00003075361,0.00026067428,0.0009822876,0.00025551004,0.99559844,0.00043241412,0.0021153998],"study_design_scores_gemma":[0.000007987701,0.000004875739,0.00010152792,0.0000031709915,0.0000047261783,0.000021279988,0.000035100766,0.0048117638,0.00016020151,0.9942075,0.00063673494,0.0000050802846],"about_ca_topic_score_codex":0.00224263,"about_ca_topic_score_gemma":0.0013391434,"teacher_disagreement_score":0.00910635,"about_ca_system_score_codex":0.0036026186,"about_ca_system_score_gemma":0.0011497955,"threshold_uncertainty_score":0.030463755},"labels":[],"label_agreement":null},{"id":"W1533466804","doi":"10.37236/3605","title":"Square-Free Words with Square-Free Self-Shuffles","year":2014,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Square-free integer; Square (algebra); Combinatorics; Discrete mathematics; Geometry","score_opus":0.0035218822975547205,"score_gpt":0.1908905607506606,"score_spread":0.1873686784531059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533466804","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8248146,0.0012976233,0.12925537,0.002034949,0.0005746996,0.000059934693,0.00041982875,0.00056935806,0.040973675],"genre_scores_gemma":[0.95455146,0.000465234,0.026353575,0.0005626283,0.00028144312,0.00007876727,0.00037625994,0.00010511726,0.017225517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932766,0.00013954623,0.000068700254,0.0001836902,0.00013902671,0.00014138478],"domain_scores_gemma":[0.9967514,0.0019667668,0.00037640397,0.00032560978,0.00029443446,0.0002852935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059101597,0.00047068865,0.00048007912,0.00052552024,0.0013958706,0.0018776004,0.0006124752,0.0011315293,0.007375105],"category_scores_gemma":[0.003581349,0.00053421094,0.0006316289,0.0007352252,0.0018809385,0.0051385043,0.002159324,0.001060501,0.0018279761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005017762,0.000104465944,0.0017562122,0.0003945362,0.00003067485,0.0008562263,0.0014280376,0.0037301523,0.014517459,0.95050794,0.004130444,0.022042084],"study_design_scores_gemma":[0.00006342409,0.000103569124,0.0005430854,0.000030538926,0.0000294017,0.0005275126,0.000422818,0.0076171723,0.009913092,0.9699599,0.0107502,0.00003920124],"about_ca_topic_score_codex":0.0003234001,"about_ca_topic_score_gemma":0.00040202602,"teacher_disagreement_score":0.007375105,"about_ca_system_score_codex":0.00041942517,"about_ca_system_score_gemma":0.00045560635,"threshold_uncertainty_score":0.02467215},"labels":[],"label_agreement":null},{"id":"W1535419843","doi":"10.26686/ajl.v2i0.1768","title":"Limiting Cases for Spectrum Closure Results","year":2004,"lang":"en","type":"article","venue":"The Australasian Journal of Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Spectrum (functional analysis); Closure (psychology); Mathematics; Class (philosophy); Image (mathematics); Function (biology); Limiting; Set (abstract data type); Sentence; Order (exchange); Pure mathematics; Spectral line; Combinatorics; Discrete mathematics; Computer science; Artificial intelligence; Physics; Quantum mechanics","score_opus":0.038826823084315766,"score_gpt":0.27515505416402564,"score_spread":0.23632823107970988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535419843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32899737,0.0042635137,0.46370003,0.009926615,0.00045857593,0.00023309115,0.0007915514,0.0015045751,0.1901246],"genre_scores_gemma":[0.96556205,0.0010627073,0.022917371,0.0012087505,0.0005843561,0.00031086992,0.00043845145,0.0003103125,0.0076050423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936727,0.0015432776,0.00046094373,0.0017562511,0.0015813219,0.0009854129],"domain_scores_gemma":[0.9709472,0.021585504,0.001388283,0.0024478713,0.0017501557,0.001881006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006978875,0.00086398073,0.0014310688,0.0031096675,0.003520234,0.0068922485,0.0016797163,0.0026724264,0.011886929],"category_scores_gemma":[0.028811345,0.000706059,0.0026729717,0.0015138491,0.008030593,0.01906131,0.007923415,0.0057991166,0.0013910797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057583093,0.000043223357,0.0006952458,0.00005581028,0.00001484701,0.00036030373,0.00072576833,0.00042633017,0.000773416,0.99206275,0.0009389547,0.0038457676],"study_design_scores_gemma":[0.000026155189,0.000017875831,0.000219972,0.000033853623,0.000011261787,0.00035734414,0.0002548702,0.0037646291,0.00072038465,0.9916402,0.002938435,0.000014991499],"about_ca_topic_score_codex":0.00073519757,"about_ca_topic_score_gemma":0.00029443903,"teacher_disagreement_score":0.011886929,"about_ca_system_score_codex":0.002505419,"about_ca_system_score_gemma":0.0006527441,"threshold_uncertainty_score":0.039765716},"labels":[],"label_agreement":null},{"id":"W1537925488","doi":"","title":"Factorizations of languages and commutativity conditions","year":2002,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; Prime (order theory); Prime factor; Factorization; Commutative property; Product (mathematics); Mathematics; Section (typography); Computer science; Discrete mathematics; Algebra over a field; Pure mathematics; Combinatorics; Algorithm; Geometry","score_opus":0.011980022641201264,"score_gpt":0.25367416798842124,"score_spread":0.24169414534721997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537925488","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22938927,0.0015809529,0.6862778,0.001334258,0.00035891193,0.0002493357,0.0007416091,0.00065717526,0.079410695],"genre_scores_gemma":[0.8554912,0.0007582799,0.12452611,0.00040651092,0.0003260189,0.00035574092,0.0009354139,0.00016120018,0.01703953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967271,0.00076956436,0.0004033504,0.0011161652,0.00048203184,0.0005016877],"domain_scores_gemma":[0.99488056,0.0025630982,0.00042085952,0.0008737152,0.0008770311,0.0003846648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031905412,0.0005620278,0.0007103677,0.0012047844,0.001906747,0.002866698,0.0005637739,0.0011174941,0.011424503],"category_scores_gemma":[0.0066853166,0.00067086244,0.0013621398,0.00066544855,0.00486068,0.007419437,0.0022177398,0.001727333,0.0016540595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042532756,0.00001404797,0.00019451154,0.0000396711,0.0000057761276,0.00014528172,0.00060895015,0.00049535325,0.0018434899,0.9908886,0.0005944418,0.0051272903],"study_design_scores_gemma":[0.000017599272,0.0000369545,0.00015249352,0.000025112538,0.000008376448,0.0002514529,0.00021112734,0.0034632527,0.0019855022,0.98741686,0.0064135683,0.000017682685],"about_ca_topic_score_codex":0.00084809045,"about_ca_topic_score_gemma":0.0006128305,"teacher_disagreement_score":0.011424503,"about_ca_system_score_codex":0.0010848396,"about_ca_system_score_gemma":0.000842566,"threshold_uncertainty_score":0.038218796},"labels":[],"label_agreement":null},{"id":"W1539025858","doi":"10.25596/jalc-2004-233","title":"Regular Expressions: New Results and Open Problems","year":2004,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"semigroups and automata theory","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sketch; Computer science; Regular expression; Theoretical computer science; Programming language; Algorithm","score_opus":0.0232650438718394,"score_gpt":0.23158112755538385,"score_spread":0.20831608368354446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539025858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028816236,0.25694323,0.51182854,0.07534999,0.0059086867,0.00013518386,0.0011425987,0.0016356119,0.11823995],"genre_scores_gemma":[0.3002919,0.29347447,0.3051217,0.014807648,0.043723404,0.0004673426,0.0030875776,0.002410041,0.03661603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99210125,0.002720006,0.00067706563,0.0018407309,0.0021241044,0.0005368211],"domain_scores_gemma":[0.96008664,0.032032426,0.0009151997,0.0034985475,0.0024082894,0.0010589225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011794755,0.0022850926,0.0035879212,0.0057589416,0.0030957477,0.010684071,0.0048644342,0.004214255,0.012020629],"category_scores_gemma":[0.02184083,0.0017723487,0.0040831105,0.008186156,0.018280402,0.062146742,0.0064445995,0.013728691,0.004393344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060054354,0.000085682295,0.00031094596,0.0007497186,0.00004016239,0.00018259497,0.000648583,0.0013422741,0.00026482495,0.9322502,0.011013489,0.053051446],"study_design_scores_gemma":[0.00001048322,0.000015720589,0.00008308865,0.0001358326,0.000014075671,0.00016729333,0.00022111865,0.0021057548,0.00015082964,0.97757304,0.019497944,0.000024833442],"about_ca_topic_score_codex":0.0013894903,"about_ca_topic_score_gemma":0.0008320215,"teacher_disagreement_score":0.012020629,"about_ca_system_score_codex":0.0034695347,"about_ca_system_score_gemma":0.0018663798,"threshold_uncertainty_score":0.062377393},"labels":[],"label_agreement":null},{"id":"W1541666628","doi":"10.1007/11496656_27","title":"Reducing the Size of NFAs by Using Equivalences and Preorders","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Nondeterministic algorithm; Automaton; Nondeterministic finite automaton; Computer science; Regular expression; Matching (statistics); DFA minimization; Deterministic automaton; Theoretical computer science; Algorithm; Discrete mathematics; Mathematics; Automata theory; Programming language","score_opus":0.01572826700469847,"score_gpt":0.2468300156282682,"score_spread":0.23110174862356972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541666628","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1751485,0.0012827555,0.7783728,0.0032613534,0.00055886665,0.00040263368,0.00094927935,0.011417636,0.028606167],"genre_scores_gemma":[0.52675563,0.0009964926,0.45258912,0.00076378125,0.00042354284,0.00046382193,0.0017698349,0.0035966067,0.012641229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938412,0.0017417592,0.0005812213,0.00096678804,0.0021357012,0.0007333252],"domain_scores_gemma":[0.945669,0.037100803,0.0013281181,0.012761838,0.0024249847,0.0007153054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030908803,0.0012582912,0.0020577514,0.001957982,0.0015447711,0.004228894,0.0037951407,0.001576344,0.014268636],"category_scores_gemma":[0.02439435,0.0014798414,0.0045245946,0.0018882675,0.0030493494,0.021912271,0.0051205726,0.004149336,0.0019446719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013709449,0.0008259616,0.004074445,0.0014808754,0.00022804042,0.00053149625,0.0013406386,0.08442533,0.046886202,0.32665238,0.015509887,0.5166738],"study_design_scores_gemma":[0.00023656905,0.00024287947,0.0008405365,0.00018376479,0.00029854008,0.0003784031,0.00048727938,0.18173948,0.027443433,0.76867,0.019377047,0.000101948135],"about_ca_topic_score_codex":0.002350994,"about_ca_topic_score_gemma":0.0046628513,"teacher_disagreement_score":0.014268636,"about_ca_system_score_codex":0.0027114244,"about_ca_system_score_gemma":0.0026077342,"threshold_uncertainty_score":0.047733366},"labels":[],"label_agreement":null},{"id":"W154460323","doi":"10.1007/978-3-642-31623-4_9","title":"Syntactic Complexities of Some Classes of Star-Free Languages","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Abstract family of languages; Cardinality (data modeling); Computer science; Monotonic function; Regular language; Pumping lemma for regular languages; Cone (formal languages); Star (game theory); Discrete mathematics; Upper and lower bounds; Context-free language; Function (biology); Automaton; Mathematics; Theoretical computer science; Artificial intelligence; Algorithm; Second-generation programming language; Programming language; Fifth-generation programming language; Rule-based machine translation; Programming paradigm","score_opus":0.019513624987755076,"score_gpt":0.25123815036967634,"score_spread":0.23172452538192126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154460323","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74042237,0.0015321735,0.10739006,0.0046088374,0.00013083502,0.00014503137,0.0010158577,0.00050049426,0.14425434],"genre_scores_gemma":[0.9674442,0.000847454,0.014065037,0.0002561405,0.00028347413,0.00022151181,0.0008094112,0.00019300125,0.015879834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980946,0.0003864642,0.00014266369,0.00024245588,0.0008480858,0.00028571472],"domain_scores_gemma":[0.991623,0.006539779,0.00045531787,0.0005833106,0.00043983507,0.00035874438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001300522,0.0005107141,0.0009291455,0.0018227407,0.0021415958,0.0048895916,0.0015236123,0.0012549463,0.0098566525],"category_scores_gemma":[0.0073352084,0.0009907811,0.001617576,0.0020741501,0.0036907448,0.009209574,0.002516171,0.003887956,0.00076472404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006376373,0.000038836984,0.0004720294,0.00006495671,0.000012099946,0.00013753212,0.00068000273,0.0022620384,0.0007937454,0.9895097,0.0012857855,0.004679469],"study_design_scores_gemma":[0.0000217756,0.000010070178,0.0005076482,0.000009588115,0.000013379336,0.00012585906,0.00014629509,0.0055368883,0.0004678506,0.99126536,0.0018803052,0.00001495465],"about_ca_topic_score_codex":0.0011134783,"about_ca_topic_score_gemma":0.00090700336,"teacher_disagreement_score":0.0098566525,"about_ca_system_score_codex":0.002042615,"about_ca_system_score_gemma":0.0011296791,"threshold_uncertainty_score":0.032973766},"labels":[],"label_agreement":null},{"id":"W1546124752","doi":"","title":"The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal","year":2008,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Catenation; Star (game theory); Combined operations; State (computer science); Automaton; Computer science; Regular language; Theoretical computer science; Algorithm; Mathematics","score_opus":0.03127157510158429,"score_gpt":0.2525004377000977,"score_spread":0.22122886259851343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546124752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68524766,0.0009968358,0.28454426,0.001104775,0.000144939,0.00015367572,0.0005546031,0.0005328119,0.026720416],"genre_scores_gemma":[0.96923673,0.00045544346,0.025899198,0.000065742504,0.00008764075,0.00013517174,0.00038860226,0.00013350906,0.003597996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734807,0.00054674,0.0001800337,0.00057504955,0.00073128974,0.000618826],"domain_scores_gemma":[0.97042793,0.023571089,0.0017922287,0.0021028966,0.0012887965,0.0008170827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017647679,0.00071147643,0.0010345909,0.0015044191,0.0012569005,0.004792007,0.001314366,0.0011515465,0.007220926],"category_scores_gemma":[0.015739141,0.00050327583,0.0014991509,0.0012051683,0.0029071276,0.009193416,0.0028684444,0.0026010405,0.00052126154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010927694,0.00018522039,0.0045256456,0.00039591343,0.000104215884,0.0003889073,0.0007759368,0.08077283,0.013202868,0.8543055,0.0020425515,0.042207547],"study_design_scores_gemma":[0.00004370589,0.00029387293,0.0017576216,0.000050429873,0.00012840805,0.00039886942,0.00034164725,0.308711,0.013663589,0.6717713,0.0027391666,0.00010034632],"about_ca_topic_score_codex":0.0012198746,"about_ca_topic_score_gemma":0.001344206,"teacher_disagreement_score":0.007220926,"about_ca_system_score_codex":0.0020652078,"about_ca_system_score_gemma":0.0014887863,"threshold_uncertainty_score":0.024156392},"labels":[],"label_agreement":null},{"id":"W1548490899","doi":"10.1007/11779148_15","title":"On Weakly Ambiguous Finite Transducers","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Nondeterministic algorithm; Transducer; Hierarchy; Ambiguity; Expressive power; Finite set; Computer science; Nondeterministic finite automaton; Mathematics; Discrete mathematics; Algorithm; Theoretical computer science; Automaton; Acoustics; Physics; Automata theory; Programming language; Mathematical analysis","score_opus":0.010220810517743562,"score_gpt":0.2162199880394688,"score_spread":0.20599917752172522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548490899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044935714,0.008042094,0.6461737,0.004181955,0.0015680395,0.00011094316,0.00043446445,0.0010341929,0.29351884],"genre_scores_gemma":[0.7412635,0.008183083,0.10465861,0.001866614,0.0020299267,0.00039350355,0.0011099842,0.0010732748,0.1394214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984995,0.00039779174,0.00009732135,0.0003052958,0.00054438255,0.00015569982],"domain_scores_gemma":[0.9972746,0.0018122131,0.00007389419,0.000467078,0.00027175876,0.000100419165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011877012,0.0012500195,0.0013874215,0.0015112924,0.0022778497,0.0036150103,0.0013742547,0.0018939619,0.009726194],"category_scores_gemma":[0.004661086,0.0013180376,0.0013265294,0.0019141538,0.006186666,0.010491452,0.005879856,0.005627695,0.00250333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024448746,0.000009014457,0.00008091577,0.00006342363,0.0000045975085,0.000097681914,0.00037083743,0.0011162489,0.00083811744,0.984939,0.0015653803,0.010890395],"study_design_scores_gemma":[0.0000021003452,0.0000050245317,0.00003846897,0.000020276344,0.0000043215687,0.000059909467,0.00004817572,0.0020550152,0.00042365695,0.99115247,0.0061849533,0.000005498999],"about_ca_topic_score_codex":0.0006719733,"about_ca_topic_score_gemma":0.00058167323,"teacher_disagreement_score":0.009726194,"about_ca_system_score_codex":0.0016004201,"about_ca_system_score_gemma":0.00082253094,"threshold_uncertainty_score":0.03253734},"labels":[],"label_agreement":null},{"id":"W1549690229","doi":"10.1007/978-3-540-30500-2_2","title":"Enumerating Regular Expressions and Their Languages","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Enumeration; Programming language; Regular expression; Theoretical computer science; Discrete mathematics; Mathematics","score_opus":0.009472930485466024,"score_gpt":0.2319570946696085,"score_spread":0.2224841641841425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549690229","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050372124,0.00256162,0.90647984,0.00096584484,0.00020494021,0.00019736633,0.00095674285,0.003623378,0.034638066],"genre_scores_gemma":[0.19671354,0.0027359237,0.7454829,0.00051500305,0.00023004154,0.0004442427,0.003761804,0.0013538651,0.048762556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976928,0.00060091633,0.0002845552,0.00042169308,0.00082116615,0.00017881308],"domain_scores_gemma":[0.9941147,0.0041391486,0.00021160198,0.0008626254,0.00057597266,0.00009595856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019563902,0.0009593373,0.0014842001,0.0028952167,0.0013775621,0.003856774,0.0023713186,0.0011255275,0.008523786],"category_scores_gemma":[0.00964027,0.0013811621,0.0017175815,0.004090008,0.002232457,0.012157816,0.0031301081,0.003648203,0.0034947398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009349421,0.00007117177,0.0008836593,0.000509485,0.000032994325,0.00015944267,0.0013158381,0.005683835,0.0040123183,0.700685,0.00630808,0.28024462],"study_design_scores_gemma":[0.000011646945,0.000019966159,0.00020210908,0.0001300644,0.000032703287,0.00026515734,0.00017813845,0.014672681,0.004126623,0.96332675,0.017008932,0.000025155721],"about_ca_topic_score_codex":0.0007899544,"about_ca_topic_score_gemma":0.0011614154,"teacher_disagreement_score":0.008523786,"about_ca_system_score_codex":0.0012369279,"about_ca_system_score_gemma":0.0012757501,"threshold_uncertainty_score":0.028514922},"labels":[],"label_agreement":null},{"id":"W1554118774","doi":"10.1007/3-540-45061-0_76","title":"Locally Commutative Categories","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Variety (cybernetics); Commutative property; Monoid; Characterization (materials science); Mathematics; Pure mathematics; Algebra over a field; Physics","score_opus":0.012707246946327678,"score_gpt":0.23440598915890878,"score_spread":0.2216987422125811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554118774","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019790137,0.0052248603,0.044526197,0.0012455393,0.0005969052,0.000036733774,0.00039502326,0.0004585259,0.9277261],"genre_scores_gemma":[0.399293,0.0046139825,0.017566895,0.00058343343,0.00089938147,0.00012711204,0.0009777341,0.00035206464,0.5755864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997583,0.00004342194,0.000011562802,0.000057495763,0.000096751115,0.000032465876],"domain_scores_gemma":[0.99979657,0.000054993285,0.0000119076585,0.000049686558,0.0000557786,0.000031017913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002887845,0.00046021593,0.000475558,0.0012741212,0.0013397997,0.0022461698,0.00047383824,0.00038485596,0.030314906],"category_scores_gemma":[0.00050436286,0.00029437026,0.00031468747,0.0012074881,0.0017346893,0.003587744,0.0014014082,0.0013396459,0.005545053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046495466,0.0000038800654,0.000031157062,0.000028312123,0.0000025226836,0.000018221615,0.00021103799,0.000065757566,0.00042159442,0.98448426,0.005984384,0.008744291],"study_design_scores_gemma":[0.000004138449,0.0000091798265,0.00016900757,0.000018372342,0.0000068201502,0.00016471554,0.00012570758,0.00023653058,0.00062879117,0.8522536,0.14637768,0.0000054864513],"about_ca_topic_score_codex":0.00054967613,"about_ca_topic_score_gemma":0.00064141856,"teacher_disagreement_score":0.030314906,"about_ca_system_score_codex":0.0009951328,"about_ca_system_score_gemma":0.0005251422,"threshold_uncertainty_score":0.10141343},"labels":[],"label_agreement":null},{"id":"W1554222672","doi":"10.37236/1052","title":"Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fibonacci number; Mathematics; Combinatorics; Integer sequence; Integer (computer science); Pisano period; Binary number; Discrete mathematics; Binary tree; Fibonacci polynomials; Generating function; Arithmetic; Computer science","score_opus":0.017613448403264544,"score_gpt":0.2302005328627704,"score_spread":0.21258708445950586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554222672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6944447,0.002870346,0.268674,0.00050610915,0.00010348329,0.000038694994,0.00025352233,0.00017353574,0.032935668],"genre_scores_gemma":[0.95891976,0.0008933039,0.03523249,0.00009214701,0.00009123986,0.00005661506,0.00014646843,0.000030201381,0.0045377933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998072,0.000040327257,0.000012099666,0.000035565747,0.00007111504,0.00003369813],"domain_scores_gemma":[0.9991553,0.00043963222,0.00017220998,0.000064426684,0.0000924621,0.00007603157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036799524,0.0003771506,0.00032330546,0.0012151292,0.000686883,0.0009273651,0.0005377721,0.00071083294,0.0018801535],"category_scores_gemma":[0.0024613943,0.00017535187,0.00029026432,0.00075819343,0.0009846973,0.0014186727,0.00049734954,0.0006152487,0.00030461096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003172215,0.000012546429,0.0008508496,0.000049539205,0.000004911609,0.00027230615,0.0001981109,0.007193341,0.0040661665,0.97876567,0.0003185978,0.008236217],"study_design_scores_gemma":[0.000009576797,0.00003328221,0.0007072487,0.00004002788,0.000007947276,0.0006723195,0.0001574162,0.05482479,0.0030522854,0.9373748,0.0030999,0.000020346211],"about_ca_topic_score_codex":0.0003747349,"about_ca_topic_score_gemma":0.00049765466,"teacher_disagreement_score":0.0018801535,"about_ca_system_score_codex":0.0006205131,"about_ca_system_score_gemma":0.00021103393,"threshold_uncertainty_score":0.0062897205},"labels":[],"label_agreement":null},{"id":"W1555454948","doi":"10.37236/1587","title":"Weakly Self-Avoiding Words and a Construction of Friedman","year":2001,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subsequence; Alphabet; Word (group theory); Combinatorics; Mathematics; Sequence (biology); Upper and lower bounds; Longest increasing subsequence; Longest common subsequence problem; Combinatorics on words; Discrete mathematics; Linguistics","score_opus":0.003872217624354327,"score_gpt":0.19836813087052352,"score_spread":0.1944959132461692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555454948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58247405,0.0019308471,0.27427775,0.0025848923,0.00055119477,0.00013688236,0.00038546955,0.0011473281,0.13651164],"genre_scores_gemma":[0.9144327,0.0003314897,0.06122161,0.0004730677,0.00017235581,0.00011308277,0.00015318814,0.00009844665,0.023004003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993819,0.0001572974,0.000041903848,0.00013636747,0.00016108259,0.000121404504],"domain_scores_gemma":[0.9989329,0.00050202315,0.00010219275,0.00014942365,0.00018383631,0.00012959367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072569697,0.00025534045,0.0005090946,0.00077197154,0.0017369301,0.0009306791,0.0005252505,0.000560372,0.0030024585],"category_scores_gemma":[0.0030186782,0.00030960678,0.00052760285,0.00043050354,0.0017018894,0.0021620297,0.001723823,0.0010432911,0.0005317689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010261479,0.000051229526,0.001273179,0.00007505153,0.000014293038,0.0003951705,0.0010701638,0.0019223685,0.011827319,0.9535953,0.0021468468,0.02752645],"study_design_scores_gemma":[0.000028054452,0.00011997482,0.0009623222,0.000027933196,0.000021130636,0.00046824626,0.00021108914,0.010872894,0.011074566,0.95187825,0.024281789,0.000053693475],"about_ca_topic_score_codex":0.00079098303,"about_ca_topic_score_gemma":0.0006679972,"teacher_disagreement_score":0.0030024585,"about_ca_system_score_codex":0.00093780406,"about_ca_system_score_gemma":0.00065515446,"threshold_uncertainty_score":0.010044217},"labels":[],"label_agreement":null},{"id":"W15569406","doi":"10.1007/978-1-4614-6642-0_17","title":"Description of Generalized Continued Fractions by Finite Automata","year":2013,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Mathematics; Finite-state machine; Automaton; Set (abstract data type); Discrete mathematics; Fraction (chemistry); Finite set; Deterministic finite automaton; Combinatorics; Algorithm; Computer science; Theoretical computer science; Mathematical analysis","score_opus":0.02113937369145425,"score_gpt":0.23462824092515933,"score_spread":0.21348886723370508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W15569406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08997219,0.0053253607,0.7149146,0.0021126545,0.0009580733,0.00015938007,0.0006860159,0.0010038664,0.1848678],"genre_scores_gemma":[0.8104623,0.002323896,0.12737381,0.0006428687,0.000934964,0.0003279368,0.0006770673,0.0006014558,0.056655716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994816,0.00012848523,0.000048393475,0.00009136522,0.00016144116,0.00008869883],"domain_scores_gemma":[0.9995252,0.00017268992,0.000044908375,0.00010860818,0.00010149516,0.0000470787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006858367,0.0011508053,0.0010136565,0.0017286317,0.0012301614,0.0038591232,0.0014929383,0.0013535969,0.010071329],"category_scores_gemma":[0.0015321684,0.0005920702,0.0016500289,0.0012015083,0.0032529968,0.004844403,0.0014968672,0.002259774,0.0015798655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004121622,0.0000027091396,0.000030106461,0.000012914282,0.0000024076612,0.000039796545,0.00008656132,0.0008675272,0.00028951207,0.9965648,0.0003312837,0.0017682059],"study_design_scores_gemma":[0.000004772168,0.0000035874832,0.000023154504,0.000009068092,0.000002232653,0.000046042966,0.000022026294,0.0046751,0.00011165475,0.9918978,0.003199516,0.000005081783],"about_ca_topic_score_codex":0.0012185101,"about_ca_topic_score_gemma":0.0011904173,"teacher_disagreement_score":0.010071329,"about_ca_system_score_codex":0.0014931102,"about_ca_system_score_gemma":0.0007870605,"threshold_uncertainty_score":0.033692002},"labels":[],"label_agreement":null},{"id":"W1557475033","doi":"10.1007/3-540-45841-7_37","title":"Nesting Until and Since in Linear Temporal Logic","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decidability; Linear temporal logic; Nesting (process); Temporal logic; Interval temporal logic; Characterization (materials science); Hierarchy; Property (philosophy); Computer science; Computation tree logic; Class (philosophy); Block (permutation group theory); Algebraic number; Semigroup; Mathematics; Theoretical computer science; Discrete mathematics; Algebra over a field; Algorithm; Pure mathematics; Artificial intelligence; Combinatorics","score_opus":0.02280034160031561,"score_gpt":0.23929726892646178,"score_spread":0.21649692732614617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557475033","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03554449,0.0041898848,0.8180117,0.002455369,0.0008067377,0.000092911185,0.00031517356,0.0022666585,0.13631712],"genre_scores_gemma":[0.6124051,0.002738077,0.30360866,0.0011015551,0.0007822287,0.00013866037,0.00041928826,0.0013991544,0.07740735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988048,0.00046582276,0.00010157563,0.00022228809,0.0002389764,0.00016656375],"domain_scores_gemma":[0.99803406,0.0011970542,0.00014191699,0.0003458162,0.00017425552,0.0001067787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018635057,0.00063948514,0.0007063962,0.0008465576,0.0021573564,0.003554662,0.00143025,0.0009377782,0.006485509],"category_scores_gemma":[0.0037385677,0.0014601224,0.0010048513,0.0016301473,0.004246234,0.012667114,0.0019273061,0.003343646,0.0016304316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003364162,0.000012332044,0.000083793624,0.000050197625,0.0000045410516,0.00006491076,0.00065859564,0.0006607598,0.0005407405,0.97588444,0.001438608,0.02056738],"study_design_scores_gemma":[0.000009517485,0.000014455274,0.000033848384,0.000025184156,0.000019616451,0.000089502726,0.00009512182,0.0031942537,0.0008812953,0.9814432,0.014180776,0.000013241598],"about_ca_topic_score_codex":0.0029165319,"about_ca_topic_score_gemma":0.0047276737,"teacher_disagreement_score":0.006485509,"about_ca_system_score_codex":0.001807358,"about_ca_system_score_gemma":0.0012602084,"threshold_uncertainty_score":0.02169621},"labels":[],"label_agreement":null},{"id":"W1558734229","doi":"10.1007/3-540-44612-5_37","title":"Alternating and Empty Alternating Auxiliary Stack Automata","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Stack (abstract data type); PSPACE; Bounded function; Hierarchy; Automaton; Polynomial hierarchy; Constant (computer programming); Combinatorics; Mathematics; Cellular automaton; Discrete mathematics; Time complexity; Computer science; Computational complexity theory; Theoretical computer science; Algorithm; Programming language","score_opus":0.013270922330737804,"score_gpt":0.24352863857550208,"score_spread":0.23025771624476427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558734229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19887374,0.0009550882,0.6087524,0.0010420516,0.000819929,0.00012628193,0.0007859856,0.001870119,0.18677436],"genre_scores_gemma":[0.80376256,0.00071615406,0.10029402,0.0003429049,0.00029385914,0.00023645461,0.00086872303,0.0008521053,0.09263317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989429,0.00021291194,0.000110832596,0.00021180073,0.00029066164,0.00023078774],"domain_scores_gemma":[0.99665976,0.0015707336,0.00016997947,0.00071598706,0.0005971677,0.0002863887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011214996,0.00080433453,0.0006740742,0.00087216485,0.0019763384,0.0036532746,0.0018505651,0.0013675014,0.013085987],"category_scores_gemma":[0.0052433168,0.00073454797,0.0011451937,0.0010382418,0.003049064,0.012155664,0.0031947433,0.003458248,0.0024373888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009175664,0.000028422064,0.00013660519,0.000046015495,0.0000054577486,0.00008749412,0.0003687756,0.0008464316,0.0021039944,0.9830656,0.0015731326,0.011646246],"study_design_scores_gemma":[0.000011517056,0.00002280236,0.00011401136,0.000014854684,0.000019439936,0.0001578539,0.00010832122,0.007161467,0.0034008434,0.9807984,0.008173653,0.000016837666],"about_ca_topic_score_codex":0.00045451822,"about_ca_topic_score_gemma":0.0005929419,"teacher_disagreement_score":0.013085987,"about_ca_system_score_codex":0.0006489188,"about_ca_system_score_gemma":0.00082939834,"threshold_uncertainty_score":0.04377699},"labels":[],"label_agreement":null},{"id":"W1571429055","doi":"10.1007/978-3-540-73208-2_22","title":"State Complexity of Union and Intersection of Finite Languages","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Intersection (aeronautics); Alphabet; Finite-state machine; Regular language; Upper and lower bounds; Deterministic finite automaton; Automaton; State (computer science); Mathematics; Nondeterministic finite automaton; Discrete mathematics; Computer science; Theoretical computer science; Algorithm; Automata theory","score_opus":0.02657055417739969,"score_gpt":0.26644678083795076,"score_spread":0.23987622666055108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571429055","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7577622,0.0011733868,0.18726012,0.00346378,0.000101451995,0.00009751771,0.0017717131,0.00061531196,0.047754433],"genre_scores_gemma":[0.98185235,0.00035912605,0.011014953,0.00008533962,0.00014049743,0.00010619715,0.00082993356,0.00015414505,0.0054573463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961314,0.0008860928,0.00025580582,0.0006677388,0.0014352342,0.00062373135],"domain_scores_gemma":[0.9529844,0.039934322,0.0015905746,0.0026111482,0.0016059724,0.0012734832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025974086,0.0005703116,0.0016283588,0.0020049529,0.002435721,0.010253842,0.0027312122,0.0021226793,0.01140567],"category_scores_gemma":[0.023015281,0.0012647706,0.0020810696,0.0029577578,0.0046492214,0.021116111,0.0036328614,0.005658312,0.0006503022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003297972,0.00009237944,0.0023823746,0.000120471144,0.00004037911,0.00009596309,0.0009806431,0.027092727,0.0015105037,0.9525838,0.0020841379,0.012686824],"study_design_scores_gemma":[0.000023331637,0.000019118715,0.00078539003,0.000014559713,0.000026254487,0.00006590716,0.0001474661,0.09440851,0.001322983,0.9024247,0.00073498604,0.000026637612],"about_ca_topic_score_codex":0.0035626446,"about_ca_topic_score_gemma":0.0028998991,"teacher_disagreement_score":0.01140567,"about_ca_system_score_codex":0.00431187,"about_ca_system_score_gemma":0.0025396647,"threshold_uncertainty_score":0.038155794},"labels":[],"label_agreement":null},{"id":"W1571887931","doi":"10.1007/978-3-642-30870-3_12","title":"An Undecidable Nested Recurrence Relation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Undecidable problem; Mathematics; Combinatorics; Relation (database); Recurrence relation; Turing; Left and right; Discrete mathematics; Computer science; Decidability","score_opus":0.01961635530253146,"score_gpt":0.2509982774693665,"score_spread":0.231381922166835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571887931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24251804,0.001779049,0.6091771,0.0028016984,0.0005915122,0.000270872,0.0011110137,0.0033408776,0.13840984],"genre_scores_gemma":[0.79328704,0.0008288986,0.15531957,0.0006440114,0.0002855134,0.00023013326,0.0012358424,0.0006506233,0.047518387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998857,0.00022377737,0.00009073712,0.00030966479,0.00035458067,0.00016425608],"domain_scores_gemma":[0.99616027,0.0027257886,0.00019699363,0.00043612183,0.00038481597,0.00009592209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091894926,0.0005968408,0.00063910155,0.0005161249,0.0015161255,0.0020435262,0.0013638176,0.00109124,0.006577587],"category_scores_gemma":[0.004977563,0.0007387397,0.0011534381,0.0006706515,0.0022420827,0.005337526,0.001639368,0.0031036348,0.0012400936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060265276,0.000051950672,0.00021567628,0.00015057606,0.000011098691,0.00024090208,0.000527182,0.0040272176,0.00451255,0.9623094,0.003556791,0.02433642],"study_design_scores_gemma":[0.00003267127,0.000018743507,0.00011995208,0.000027733251,0.000026343947,0.00018537906,0.000092306385,0.016221099,0.0035045126,0.96821654,0.011536637,0.0000180741],"about_ca_topic_score_codex":0.0025340747,"about_ca_topic_score_gemma":0.0036034558,"teacher_disagreement_score":0.006577587,"about_ca_system_score_codex":0.0013586915,"about_ca_system_score_gemma":0.0011886928,"threshold_uncertainty_score":0.022004187},"labels":[],"label_agreement":null},{"id":"W1571909284","doi":"10.1007/3-540-45465-9_20","title":"On the Complexity of Resolution with Bounded Conjunctions","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Resolution (logic); Hierarchy; Proof complexity; Bounded function; Space (punctuation); Mathematics; Upper and lower bounds; Computer science; Discrete mathematics; Algorithm; Combinatorics; Mathematical proof; Artificial intelligence; Geometry; Mathematical analysis","score_opus":0.03747163055043265,"score_gpt":0.22937757133314626,"score_spread":0.1919059407827136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571909284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2383176,0.009822821,0.53388166,0.02466399,0.00085133436,0.0003290338,0.0024680535,0.0020873463,0.1875781],"genre_scores_gemma":[0.86676437,0.004535774,0.09950968,0.001557539,0.0015791499,0.00036638105,0.002010696,0.0007790418,0.022897458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9870788,0.0044879727,0.0008207566,0.001867726,0.0043774373,0.0013673909],"domain_scores_gemma":[0.88819486,0.099285744,0.0026033819,0.0062283883,0.0022275008,0.001460071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006805233,0.0016405768,0.0032174308,0.00341813,0.004151086,0.012121689,0.005989495,0.003791499,0.022578022],"category_scores_gemma":[0.05143768,0.0027932462,0.00441031,0.0067029586,0.008644517,0.049575426,0.010522149,0.011691401,0.00217457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033374678,0.00012372147,0.0009861497,0.0003800789,0.00011065927,0.00024055505,0.0007392195,0.01678671,0.0009227593,0.9448597,0.006623199,0.027893502],"study_design_scores_gemma":[0.00003373512,0.000013155995,0.00018009255,0.000028327686,0.000041672414,0.00011351473,0.00009062353,0.018790543,0.0004686741,0.9782402,0.001974509,0.00002500496],"about_ca_topic_score_codex":0.0029539792,"about_ca_topic_score_gemma":0.0024241519,"teacher_disagreement_score":0.022578022,"about_ca_system_score_codex":0.0047416408,"about_ca_system_score_gemma":0.0024200308,"threshold_uncertainty_score":0.075531065},"labels":[],"label_agreement":null},{"id":"W1572529124","doi":"10.3233/fi-2011-533","title":"Transition Complexity of Incomplete DFAs","year":2011,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Transition (genetics); Computer science; Theoretical computer science","score_opus":0.08387304573960493,"score_gpt":0.23571382373511496,"score_spread":0.15184077799551005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572529124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5069995,0.0005769541,0.48141432,0.0007331057,0.00005187128,0.00008934774,0.0011500915,0.0005082419,0.008476642],"genre_scores_gemma":[0.96965003,0.00029731306,0.027240999,0.000047983754,0.000038195252,0.00011134151,0.0006783691,0.00008495527,0.001851008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715495,0.0005049483,0.000275354,0.00064505753,0.0009380369,0.00048174005],"domain_scores_gemma":[0.97960955,0.01492937,0.0015184899,0.0018344603,0.0014634837,0.00064471905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017729324,0.00052190985,0.0010808607,0.0018586117,0.0010785491,0.003650979,0.0015909722,0.0008993615,0.003609441],"category_scores_gemma":[0.015560905,0.00042881566,0.0019983011,0.0014738342,0.002143595,0.007904277,0.0021904702,0.0027046828,0.0003068498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002488105,0.00007896665,0.003100567,0.00024242734,0.00008766958,0.00022086063,0.0007159072,0.22380458,0.005511481,0.7444695,0.0007339091,0.020785253],"study_design_scores_gemma":[0.000015154739,0.00003905312,0.0007043053,0.000024163013,0.00003960533,0.000072990966,0.00007731766,0.39630082,0.0031173774,0.59824866,0.0013313374,0.000029254064],"about_ca_topic_score_codex":0.003076832,"about_ca_topic_score_gemma":0.0020666302,"teacher_disagreement_score":0.003650979,"about_ca_system_score_codex":0.0032955518,"about_ca_system_score_gemma":0.0014612754,"threshold_uncertainty_score":0.023911059},"labels":[],"label_agreement":null},{"id":"W1573072008","doi":"10.1007/978-3-540-68746-7_18","title":"Modelling Concurrency with Quotient Monoids","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Quotient; Concurrency; Computer science; Algebra over a field; Programming language; Mathematics; Combinatorics; Pure mathematics","score_opus":0.018538662174425805,"score_gpt":0.2175353934230081,"score_spread":0.1989967312485823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573072008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038033415,0.0010131152,0.9347005,0.00030198862,0.00016941836,0.00009547641,0.000106159634,0.0008793728,0.024700446],"genre_scores_gemma":[0.74923736,0.0011087924,0.23149525,0.00009750075,0.00017576852,0.00024093773,0.0002668806,0.00036380024,0.017013688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985682,0.0005763793,0.00013460878,0.00022422186,0.00034289603,0.00015359148],"domain_scores_gemma":[0.997741,0.001331483,0.00012514472,0.00046227552,0.00019869409,0.00014141052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019072408,0.0008231308,0.0008177415,0.00079780916,0.0007779555,0.0031693894,0.001614368,0.00083669805,0.005450761],"category_scores_gemma":[0.0045644497,0.00089092506,0.0014666015,0.000728098,0.003458156,0.0073587373,0.0030233169,0.0019291681,0.0008751925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058226167,0.000024591294,0.00024092062,0.000083420644,0.000014814158,0.0001702734,0.00070539326,0.016400171,0.0029151826,0.96623313,0.0005109756,0.012643012],"study_design_scores_gemma":[0.000027043552,0.000030297397,0.000065451175,0.000037978258,0.000023582003,0.00013010911,0.00011643367,0.0780909,0.0025610207,0.90673643,0.01215855,0.000022142638],"about_ca_topic_score_codex":0.0016840043,"about_ca_topic_score_gemma":0.0014958412,"teacher_disagreement_score":0.005450761,"about_ca_system_score_codex":0.0011332073,"about_ca_system_score_gemma":0.0008426833,"threshold_uncertainty_score":0.01823461},"labels":[],"label_agreement":null},{"id":"W1573169217","doi":"10.1007/978-3-540-30500-2_11","title":"Concatenation State Machines and Simple Functions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Concatenation (mathematics); Computer science; Simple (philosophy); Class (philosophy); State (computer science); Domain (mathematical analysis); Theoretical computer science; Algorithm; Finite-state machine; Arithmetic; Artificial intelligence; Mathematics","score_opus":0.010849468625131165,"score_gpt":0.23140519608087287,"score_spread":0.2205557274557417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573169217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043810524,0.008138578,0.7466536,0.0012571787,0.0011595344,0.00011189158,0.0004968695,0.0013908377,0.19698097],"genre_scores_gemma":[0.60988504,0.0075083044,0.17119193,0.00054377737,0.0013311504,0.00046229825,0.001119202,0.00058772136,0.2073705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995999,0.000095825664,0.000033116245,0.000090323614,0.00012881431,0.00005208446],"domain_scores_gemma":[0.9992762,0.0004262329,0.000052057767,0.00013151957,0.00007842734,0.000035641056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044156009,0.00081728265,0.000831695,0.00093693874,0.0012205486,0.0024083091,0.00079367426,0.0010734561,0.010986103],"category_scores_gemma":[0.0013720499,0.00061214226,0.00079809385,0.0018046646,0.0031780982,0.0057201223,0.0013688175,0.0018572146,0.0026730862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014387852,0.000008323239,0.00003759728,0.000045380788,0.00000364685,0.000047963396,0.0001706884,0.00090710865,0.00076002977,0.98261654,0.0015920184,0.013796403],"study_design_scores_gemma":[0.0000033572028,0.000009873628,0.00004632076,0.0000116574765,0.0000054015063,0.000067051595,0.000021445105,0.0025729735,0.00090661866,0.9827153,0.01363262,0.00000754547],"about_ca_topic_score_codex":0.0004330482,"about_ca_topic_score_gemma":0.0004490487,"teacher_disagreement_score":0.010986103,"about_ca_system_score_codex":0.00094881706,"about_ca_system_score_gemma":0.0005859595,"threshold_uncertainty_score":0.036752105},"labels":[],"label_agreement":null},{"id":"W1576164625","doi":"10.1007/3-540-44693-1_8","title":"Star-Free Open Languages and Aperiodic Loops","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université du Québec à Chicoutimi; Université de Sherbrooke","funders":"","keywords":"Aperiodic graph; Mathematics; Wreath product; Closure (psychology); Class (philosophy); Context (archaeology); Star (game theory); Star product; Discrete mathematics; Pure mathematics; Product (mathematics); Computer science; Combinatorics; Geometry; Artificial intelligence; Mathematical analysis","score_opus":0.01792938583660957,"score_gpt":0.2759212597018551,"score_spread":0.2579918738652455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576164625","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45242754,0.0025102878,0.35286862,0.0011617293,0.0005439279,0.000104263985,0.0002796497,0.0007097019,0.18939435],"genre_scores_gemma":[0.92608035,0.0007787872,0.025682712,0.00017860095,0.00022044055,0.0001007505,0.00019995721,0.00015839988,0.04659992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996123,0.00007700308,0.000036154004,0.00008572228,0.00011656061,0.00007236585],"domain_scores_gemma":[0.99864763,0.00078212284,0.00011986352,0.00012591117,0.00018191934,0.00014255583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046610704,0.00042358745,0.0004964444,0.0008738259,0.0011400448,0.002089822,0.00056212186,0.0006533313,0.0045009023],"category_scores_gemma":[0.0017619628,0.00041260634,0.0005792489,0.000906497,0.00222255,0.003936441,0.0015267513,0.0013428542,0.0006449328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029853565,0.000013078813,0.000085536914,0.000033660566,0.00000265194,0.00008486802,0.00040071137,0.0005167042,0.0016766574,0.9913747,0.00046379364,0.0053177755],"study_design_scores_gemma":[0.000008998117,0.000014885188,0.000048676917,0.0000055514515,0.0000032277428,0.00010157513,0.00009647594,0.0013661521,0.00076113123,0.9933076,0.004279498,0.0000061226683],"about_ca_topic_score_codex":0.00025290088,"about_ca_topic_score_gemma":0.00030650714,"teacher_disagreement_score":0.0045009023,"about_ca_system_score_codex":0.00057553913,"about_ca_system_score_gemma":0.0004533959,"threshold_uncertainty_score":0.015056968},"labels":[],"label_agreement":null},{"id":"W1582270156","doi":"10.1007/3-540-45007-6_20","title":"On Enumeration of Müller Automata","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Enumeration; Automaton; Combinatorics; Discrete mathematics; Set (abstract data type); Function (biology); Mathematics; Computer science; Theoretical computer science","score_opus":0.012557795738976621,"score_gpt":0.2317412304424569,"score_spread":0.21918343470348028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582270156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07663628,0.00552522,0.6049019,0.0028154915,0.0009924173,0.00016309935,0.0006119747,0.0012127869,0.30714077],"genre_scores_gemma":[0.61905795,0.0047343792,0.2529771,0.0011332458,0.0010486809,0.00051927974,0.0016091162,0.0008283937,0.11809183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985965,0.00057285256,0.00010291932,0.00019409556,0.00035804958,0.00017550665],"domain_scores_gemma":[0.99727494,0.0018323913,0.0000974158,0.00038830435,0.00030210792,0.00010492395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010620605,0.0009185742,0.0011525754,0.0019197774,0.0018802385,0.003441512,0.0014558412,0.0011509571,0.012472169],"category_scores_gemma":[0.0054316297,0.00087284896,0.0014937524,0.0026188442,0.0025040812,0.008331294,0.0032617315,0.0033637467,0.0023872172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002863443,0.000017192697,0.0001247672,0.00006600672,0.0000057189336,0.000038139806,0.00019683318,0.0012781633,0.0005522537,0.9726626,0.002630174,0.022399597],"study_design_scores_gemma":[0.0000037133298,0.0000070450897,0.00004732952,0.00002286919,0.0000045679612,0.000038986516,0.000035136538,0.0040758518,0.00041143666,0.9900747,0.005272266,0.0000061663277],"about_ca_topic_score_codex":0.0010130116,"about_ca_topic_score_gemma":0.0016440409,"teacher_disagreement_score":0.012472169,"about_ca_system_score_codex":0.0017163402,"about_ca_system_score_gemma":0.00087326654,"threshold_uncertainty_score":0.04172361},"labels":[],"label_agreement":null},{"id":"W1583687157","doi":"10.1007/3-540-45452-7_23","title":"Constructing NFAs by Optimal Use of Positions in Regular Expressions","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Regular expression; Nondeterministic finite automaton; Computer science; Automaton; Quotient; Nondeterministic algorithm; Expression (computer science); Finite-state machine; Algorithm; Discrete mathematics; Combinatorics; Theoretical computer science; Mathematics; Automata theory; Programming language","score_opus":0.01848285626588725,"score_gpt":0.22802256862829434,"score_spread":0.2095397123624071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583687157","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1016439,0.0002096102,0.88194644,0.0002742544,0.000121921286,0.00014728031,0.00020312301,0.004936777,0.01051674],"genre_scores_gemma":[0.37366048,0.0003117919,0.61775005,0.00010658341,0.000049656253,0.00017152178,0.00045300258,0.0013618238,0.006135107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835145,0.00039500924,0.00017029706,0.00039862934,0.00036134635,0.0003233116],"domain_scores_gemma":[0.9961939,0.0020501956,0.00017711056,0.0011602291,0.0002940636,0.00012457423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013143984,0.0009671255,0.0014466193,0.0011263672,0.001319587,0.0026156513,0.0019965256,0.0013721093,0.0051139523],"category_scores_gemma":[0.0063292966,0.0014019435,0.0021010514,0.0014675572,0.0023245146,0.0066406187,0.0030953414,0.0023769338,0.0020236224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006043198,0.00034058845,0.0032424647,0.0006935016,0.000099014294,0.0006425988,0.0020084574,0.02721324,0.048314784,0.51362413,0.0043418445,0.398875],"study_design_scores_gemma":[0.00015270968,0.00019068786,0.00053606014,0.00016297461,0.00027620982,0.00057475106,0.00081958517,0.11527729,0.064581715,0.7926239,0.024682734,0.000121384866],"about_ca_topic_score_codex":0.001159798,"about_ca_topic_score_gemma":0.002126547,"teacher_disagreement_score":0.0051139523,"about_ca_system_score_codex":0.00090928556,"about_ca_system_score_gemma":0.0010188887,"threshold_uncertainty_score":0.017107904},"labels":[],"label_agreement":null},{"id":"W1592957478","doi":"10.1016/j.tcs.2009.02.006","title":"Periodicity, repetitions, and orbits of an automatic sequence","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Decidability; Sequence (biology); Mathematics; Lexicographical order; Simple (philosophy); Quotient; Closure (psychology); Combinatorics; Discrete mathematics","score_opus":0.010897308510883006,"score_gpt":0.2616924037423216,"score_spread":0.2507950952314386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592957478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86085814,0.00035982934,0.119750105,0.00035341017,0.00014544341,0.000030482,0.00022355972,0.00029219984,0.017986823],"genre_scores_gemma":[0.97687733,0.00012852496,0.017738422,0.00003840944,0.00012468167,0.000048418362,0.00016714828,0.000053688163,0.0048233964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992557,0.0001617213,0.00007731183,0.00018372602,0.0002095841,0.00011201231],"domain_scores_gemma":[0.99489945,0.0029544623,0.0006689494,0.0007659828,0.00036022812,0.0003509623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077720825,0.00026505865,0.00047845067,0.0012066483,0.0013982593,0.0014630626,0.00060533674,0.0008813474,0.0031756717],"category_scores_gemma":[0.004324805,0.00035961252,0.00059288397,0.0006326875,0.0024423536,0.0028093155,0.0009839723,0.0008719192,0.0003461485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031426814,0.000043922697,0.0020355645,0.00006243662,0.000016755635,0.0005773235,0.0011442512,0.0026748711,0.012328733,0.96218216,0.00064594176,0.017973749],"study_design_scores_gemma":[0.000028856544,0.00010570234,0.001538057,0.000019042296,0.000018255552,0.00060654763,0.00019789294,0.022611909,0.0039229863,0.9689098,0.0020070865,0.000033821052],"about_ca_topic_score_codex":0.00046583207,"about_ca_topic_score_gemma":0.0004713435,"teacher_disagreement_score":0.0031756717,"about_ca_system_score_codex":0.00043648272,"about_ca_system_score_gemma":0.00044451217,"threshold_uncertainty_score":0.0106236935},"labels":[],"label_agreement":null},{"id":"W1593046698","doi":"10.1007/978-3-642-18098-9_11","title":"State Complexity of Catenation Combined with Union and Intersection","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; Intersection (aeronautics); State (computer science); Computer science; Combined operations; Composition (language); Algorithm; Engineering; Law; Political science","score_opus":0.021888749043671447,"score_gpt":0.2190697652432465,"score_spread":0.19718101619957507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593046698","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47656566,0.0018244016,0.42317387,0.0037909718,0.00034404648,0.00019279962,0.0016076795,0.0012355978,0.09126496],"genre_scores_gemma":[0.9626786,0.00041231004,0.026274787,0.0001437358,0.00025084472,0.00012090017,0.00070167676,0.00026279705,0.009154267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958425,0.00083098887,0.00029585263,0.0007310324,0.0015958919,0.00070370483],"domain_scores_gemma":[0.97389674,0.019914534,0.0009050696,0.003271855,0.0013564462,0.00065526867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023099005,0.0007079115,0.0022310577,0.0020793334,0.002169662,0.0077054887,0.00298428,0.0023956173,0.015946897],"category_scores_gemma":[0.017053803,0.0012192305,0.0032610544,0.0031150708,0.003673842,0.02045587,0.0047097625,0.005493949,0.0009991442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030212657,0.00008007512,0.0010098093,0.00020937817,0.0000441826,0.00010709085,0.0004058979,0.025730869,0.002044622,0.9484161,0.0027851644,0.01886466],"study_design_scores_gemma":[0.00002402141,0.00002995929,0.00035266587,0.000018901756,0.00004010216,0.00006970748,0.00006708058,0.09386206,0.0018880931,0.902489,0.0011270577,0.000031473814],"about_ca_topic_score_codex":0.0026808965,"about_ca_topic_score_gemma":0.002525571,"teacher_disagreement_score":0.015946897,"about_ca_system_score_codex":0.0031389168,"about_ca_system_score_gemma":0.002251632,"threshold_uncertainty_score":0.053347707},"labels":[],"label_agreement":null},{"id":"W1593192935","doi":"10.37236/1763","title":"There Exist Binary Circular $5/2^+$ Power Free Words of Every Length","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Binary number; Power (physics); Discrete mathematics; Arithmetic","score_opus":0.005737579744329706,"score_gpt":0.2091109374382763,"score_spread":0.2033733576939466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593192935","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6908141,0.0011873122,0.15584771,0.0025270768,0.0006240594,0.00014436462,0.0009547458,0.0009310499,0.1469696],"genre_scores_gemma":[0.8618891,0.0005869898,0.07189095,0.0008550508,0.00023415792,0.0003563794,0.0010590628,0.00032600685,0.06280231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995346,0.00005616995,0.000028332728,0.0001204091,0.00009796082,0.00016253252],"domain_scores_gemma":[0.9982628,0.000886213,0.00023293677,0.00015775727,0.00024961744,0.00021069749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036563186,0.0006399817,0.0004370064,0.00054746855,0.0018699275,0.0016873322,0.00069017964,0.0010719202,0.018515421],"category_scores_gemma":[0.0020508734,0.0005114234,0.00074204593,0.00060828286,0.0012136665,0.003965051,0.002359691,0.0013490802,0.003065879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069488573,0.00014586296,0.0018689784,0.00048850046,0.00003445129,0.0012206568,0.0012418656,0.0014975802,0.028746143,0.9149311,0.008077926,0.04105208],"study_design_scores_gemma":[0.00012705167,0.00020603884,0.0018808346,0.00012787057,0.00010615624,0.001386172,0.00080798776,0.008902657,0.037432767,0.8895745,0.059364278,0.000083696345],"about_ca_topic_score_codex":0.00037880254,"about_ca_topic_score_gemma":0.00043972177,"teacher_disagreement_score":0.018515421,"about_ca_system_score_codex":0.0005536458,"about_ca_system_score_gemma":0.00051862246,"threshold_uncertainty_score":0.061940193},"labels":[],"label_agreement":null},{"id":"W1596039687","doi":"10.1007/3-540-36390-4_2","title":"Cascade Decompositions are Bit-Vector Algorithms","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Automaton; Computer science; Algorithm; Bit array; Cascade; Computation; Bounded function; Theoretical computer science; Mathematics; Type (biology)","score_opus":0.01628224680208691,"score_gpt":0.23745818173092115,"score_spread":0.22117593492883425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596039687","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015716923,0.0008394282,0.9299316,0.0006188865,0.0003720719,0.00023607402,0.00052143907,0.0031937417,0.048569832],"genre_scores_gemma":[0.3114696,0.0019586517,0.60685843,0.0010511868,0.00059298985,0.0007952517,0.0021007934,0.0019731843,0.07319994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990734,0.00018053649,0.000070109665,0.00022682,0.0003327263,0.00011636209],"domain_scores_gemma":[0.9987595,0.0004822109,0.00008031764,0.0003805406,0.00022329082,0.00007417436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008194181,0.0011995181,0.0009862244,0.0016876992,0.0011015792,0.0025617944,0.0014030454,0.001183358,0.029421143],"category_scores_gemma":[0.003258391,0.0008400021,0.0011495458,0.0024470005,0.0011312314,0.0060296543,0.0019468535,0.0025163083,0.008559213],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032809336,0.00013277805,0.00025460453,0.00023840931,0.000036954,0.00005390679,0.0001230789,0.009251929,0.0059139687,0.71300584,0.022216931,0.24844356],"study_design_scores_gemma":[0.000050510724,0.000064190885,0.0001259621,0.000055672495,0.000034164652,0.00010720321,0.00003084492,0.08321226,0.006115349,0.89215046,0.018029174,0.000024163743],"about_ca_topic_score_codex":0.00054315664,"about_ca_topic_score_gemma":0.0010209623,"teacher_disagreement_score":0.029421143,"about_ca_system_score_codex":0.000994701,"about_ca_system_score_gemma":0.0008627607,"threshold_uncertainty_score":0.09842354},"labels":[],"label_agreement":null},{"id":"W1598379535","doi":"10.1007/978-3-540-76336-9_11","title":"Deterministic Caterpillar Expressions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Caterpillar; Determinism; Expression (computer science); Regular expression; Automaton; Markup language; Tree (set theory); Computer science; Programming language; Mathematics; Algebra over a field; Theoretical computer science; Combinatorics; Pure mathematics; Biology; World Wide Web; Physics; XML; Botany","score_opus":0.022281807377359526,"score_gpt":0.2639599130271646,"score_spread":0.24167810564980508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598379535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04931977,0.0009311656,0.66556144,0.0009893177,0.0004937231,0.00011222048,0.0006527563,0.0023316192,0.27960798],"genre_scores_gemma":[0.6824521,0.0013862858,0.13703011,0.0004861473,0.00022958916,0.00019277926,0.0010269934,0.00082957663,0.17636652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995696,0.00006626614,0.00002741049,0.0000981671,0.00014621139,0.00009234073],"domain_scores_gemma":[0.99959415,0.00016871472,0.000027760687,0.00009787066,0.0000891415,0.00002241114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034644592,0.00046474612,0.00036343292,0.000417805,0.00082529255,0.0014434061,0.0007749866,0.0006004754,0.01256027],"category_scores_gemma":[0.0012509843,0.00036278352,0.00048658974,0.00084520876,0.0011829298,0.0019719359,0.0011038003,0.00089848967,0.0035067964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044178683,0.000009216303,0.000044991295,0.000051155097,0.0000038857393,0.000063371095,0.00012261176,0.0020223844,0.0033677937,0.96274346,0.004291644,0.02723531],"study_design_scores_gemma":[0.000024961859,0.00003646116,0.000111519774,0.000042413147,0.000021825943,0.00024586127,0.00008280304,0.013683432,0.012400662,0.89111155,0.08220508,0.000033434942],"about_ca_topic_score_codex":0.00039461773,"about_ca_topic_score_gemma":0.00054770004,"teacher_disagreement_score":0.01256027,"about_ca_system_score_codex":0.0009205876,"about_ca_system_score_gemma":0.00048353092,"threshold_uncertainty_score":0.042018294},"labels":[],"label_agreement":null},{"id":"W1598706676","doi":"10.1007/3-540-44674-5_23","title":"State Complexity and Jacobsthal’s Function","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Intersection (aeronautics); Alphabet; State (computer science); Connection (principal bundle); Function (biology); Theoretical computer science; Algorithm; Mathematics","score_opus":0.023085554994154576,"score_gpt":0.23324748797773917,"score_spread":0.2101619329835846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598706676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24230728,0.003743506,0.40836346,0.012612646,0.0006925645,0.0001636871,0.00063489896,0.0007201072,0.33076176],"genre_scores_gemma":[0.93191826,0.0012077601,0.023076734,0.000507885,0.00053820544,0.00018225584,0.00023039232,0.00023984807,0.042098645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835265,0.00035100538,0.00012602052,0.0003619072,0.0004833404,0.0003251679],"domain_scores_gemma":[0.9926479,0.005530125,0.00023440097,0.00083063694,0.0004770317,0.00027996523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001637337,0.00077804667,0.0016331868,0.0025778238,0.0028801728,0.0045112036,0.0015863094,0.0019378719,0.012366826],"category_scores_gemma":[0.008227409,0.0007343426,0.0019563418,0.0029486753,0.005992125,0.01629394,0.0037308445,0.005066698,0.0013481978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016451933,0.0000084519315,0.00006099585,0.000020127422,0.0000037882594,0.000013906018,0.00013367491,0.0008745101,0.0001601566,0.99443144,0.0007439715,0.0035325333],"study_design_scores_gemma":[0.0000052517375,0.0000061565315,0.000069343536,0.0000054128723,0.000005978262,0.000024684276,0.000024228364,0.00390683,0.0002583415,0.993979,0.0017064253,0.000008427438],"about_ca_topic_score_codex":0.0015770985,"about_ca_topic_score_gemma":0.000854401,"teacher_disagreement_score":0.012366826,"about_ca_system_score_codex":0.003949325,"about_ca_system_score_gemma":0.0013212954,"threshold_uncertainty_score":0.041371167},"labels":[],"label_agreement":null},{"id":"W1599511149","doi":"10.1007/978-3-642-18098-9_14","title":"On Lazy Representations and Sturmian Graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Graph; Representation (politics); Set (abstract data type); Computer science; Integer (computer science); Path (computing); Mathematics; Discrete mathematics","score_opus":0.018536103187688852,"score_gpt":0.2464878192117674,"score_spread":0.22795171602407854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599511149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17290276,0.018401688,0.42416325,0.00894913,0.0018246712,0.00011784986,0.000663351,0.0012173033,0.37175998],"genre_scores_gemma":[0.8431089,0.007889444,0.07275101,0.0013233607,0.0017837296,0.00021355189,0.0008910572,0.00053856574,0.07150049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937266,0.00021352032,0.00003921811,0.00010486106,0.00018253001,0.00008727079],"domain_scores_gemma":[0.9991228,0.0004918672,0.0000657252,0.00015291729,0.000107245316,0.000059527174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082444795,0.00076390605,0.0009963927,0.0023436071,0.0022983,0.003293424,0.0011288981,0.0017251783,0.0077354717],"category_scores_gemma":[0.002274101,0.0007961513,0.0011612157,0.0036160182,0.0049163364,0.0088082105,0.0021859352,0.0037413589,0.0013526833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070015367,0.0000061111014,0.000029140178,0.000022176795,0.0000023818282,0.000020894098,0.00018250567,0.0003766379,0.00015725952,0.9937503,0.0010733197,0.0043722047],"study_design_scores_gemma":[0.0000023175048,0.0000024115043,0.000022482229,0.0000065083054,0.0000019291595,0.000017870323,0.000023421913,0.00042547385,0.00004318076,0.9975465,0.0019047704,0.0000030928709],"about_ca_topic_score_codex":0.0012174404,"about_ca_topic_score_gemma":0.0015918767,"teacher_disagreement_score":0.0077354717,"about_ca_system_score_codex":0.0016487482,"about_ca_system_score_gemma":0.00055375346,"threshold_uncertainty_score":0.025877714},"labels":[],"label_agreement":null},{"id":"W1605990238","doi":"10.1007/978-3-540-76336-9_22","title":"Efficient Enumeration of Regular Languages","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Enumeration; Lexicographical order; Domain (mathematical analysis); Mathematics; Computer science; Section (typography); Computation; Algorithm; Combinatorics","score_opus":0.01162829050439511,"score_gpt":0.24877875866560786,"score_spread":0.23715046816121274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605990238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059687734,0.00070919696,0.85999113,0.00081733154,0.00017890347,0.00016550695,0.0009678092,0.004960171,0.07252219],"genre_scores_gemma":[0.3766871,0.0009342914,0.54209656,0.00045762496,0.00019491311,0.00046830435,0.005203563,0.0020295444,0.071928106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983234,0.00044660785,0.00012188963,0.00027874243,0.0005872963,0.00024212738],"domain_scores_gemma":[0.99703777,0.0016144363,0.000120753895,0.0007936559,0.00034200275,0.00009144063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075107976,0.00076864887,0.0011472611,0.0011441583,0.0010383149,0.0030876396,0.0019242073,0.0007589712,0.0137309],"category_scores_gemma":[0.0037994916,0.0009004814,0.001169894,0.0021206995,0.0010735742,0.004767605,0.0030617963,0.002284722,0.0048946757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029369237,0.0002231085,0.00050041004,0.0004700066,0.00004144087,0.00015746133,0.00042529605,0.016636178,0.0173267,0.6229413,0.021721497,0.31926295],"study_design_scores_gemma":[0.000047583893,0.00003976037,0.0001919867,0.00005180278,0.00003091522,0.00018975868,0.00009392948,0.069628686,0.011327249,0.895241,0.02312946,0.000027779008],"about_ca_topic_score_codex":0.0005404068,"about_ca_topic_score_gemma":0.001489509,"teacher_disagreement_score":0.0137309,"about_ca_system_score_codex":0.0010497526,"about_ca_system_score_gemma":0.0010813762,"threshold_uncertainty_score":0.0459345},"labels":[],"label_agreement":null},{"id":"W1614407559","doi":"10.1007/978-3-211-74280-8_19","title":"On the Continued Fraction Expansion of a Class of Numbers","year":2008,"lang":"en","type":"book-chapter","venue":"Developments in mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Irrational number; Mathematics; Continued fraction; Real number; Combinatorics; Rational number; Bounded function; Infinity; Fraction (chemistry); Constant (computer programming); Quotient; Dirichlet distribution; Analytic number theory; Class (philosophy); Discrete mathematics; Mathematical analysis; Arithmetic; Geometry","score_opus":0.023199445158452132,"score_gpt":0.2331547342704648,"score_spread":0.20995528911201267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1614407559","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06635233,0.03537939,0.22589998,0.006213238,0.0031357943,0.00007386992,0.00023217205,0.00042436091,0.66228896],"genre_scores_gemma":[0.6860382,0.023182398,0.072865516,0.001811612,0.0063412525,0.00025066652,0.00032511578,0.00044308754,0.20874213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967456,0.00008942719,0.000015068591,0.000061918894,0.00012142384,0.000037680085],"domain_scores_gemma":[0.9992362,0.00053921033,0.000035307454,0.0000670776,0.000081956176,0.00004028133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010063684,0.0008638486,0.00085888547,0.0019540119,0.0010109079,0.0024064698,0.0005238558,0.00090671174,0.005469703],"category_scores_gemma":[0.0026897795,0.000289533,0.00058514497,0.0017888406,0.004006739,0.005113598,0.000928864,0.003322265,0.0011146415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071663403,0.0000027185476,0.000021988286,0.000017426428,0.0000012291645,0.000022761034,0.000107868975,0.00023654384,0.00029830085,0.99225086,0.0010787664,0.0059543243],"study_design_scores_gemma":[0.000006684541,0.000009600271,0.0000760451,0.000025713818,0.0000028537931,0.000108142616,0.00002625924,0.0015832355,0.00019205653,0.97877973,0.019183902,0.0000057612865],"about_ca_topic_score_codex":0.0007562411,"about_ca_topic_score_gemma":0.00048074676,"teacher_disagreement_score":0.005469703,"about_ca_system_score_codex":0.001406197,"about_ca_system_score_gemma":0.0005067086,"threshold_uncertainty_score":0.01829803},"labels":[],"label_agreement":null},{"id":"W1627395571","doi":"10.1007/978-3-642-37064-9_27","title":"On the Number of Unbordered Factors","year":2013,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Sequence (biology); Morse code; Combinatorics; Mathematics; Discrete mathematics; Computer science; Biology; Genetics","score_opus":0.016682456486248436,"score_gpt":0.26190404839952536,"score_spread":0.24522159191327692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1627395571","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7043171,0.0043587056,0.20161536,0.004502093,0.0009767289,0.00008981861,0.0009431137,0.00065404247,0.082543045],"genre_scores_gemma":[0.96171397,0.0011539037,0.022597471,0.00033198323,0.0005879063,0.000101156314,0.0003879225,0.00025102796,0.012874633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99673873,0.00070311705,0.0002533025,0.0010273604,0.00063057843,0.00064692256],"domain_scores_gemma":[0.9720737,0.020005567,0.0018153703,0.001902548,0.0016409875,0.0025618286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003613609,0.0011480914,0.0020624746,0.0033647078,0.0028814098,0.007312442,0.002909525,0.0023190514,0.013471913],"category_scores_gemma":[0.018372562,0.0010129561,0.0011672048,0.0020930574,0.0063305325,0.014478138,0.0036178161,0.0038567535,0.001493468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009338084,0.0000929496,0.003905095,0.00022678173,0.000053130563,0.00025575567,0.00068820675,0.003052957,0.004588102,0.9644662,0.0027131909,0.019023921],"study_design_scores_gemma":[0.000047485202,0.000056237182,0.0008459234,0.00006406399,0.000055163076,0.00038588286,0.00017686223,0.009073344,0.002230404,0.98368293,0.0033423402,0.00003936016],"about_ca_topic_score_codex":0.00053301896,"about_ca_topic_score_gemma":0.00057628343,"teacher_disagreement_score":0.013471913,"about_ca_system_score_codex":0.0017090654,"about_ca_system_score_gemma":0.0007389266,"threshold_uncertainty_score":0.045068026},"labels":[],"label_agreement":null},{"id":"W1634002241","doi":"10.37236/621","title":"Further Applications of a Power Series Method for Pattern Avoidance","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Mathematics; Morphism; Combinatorics; Combinatorics on words; Sigma; Series (stratigraphy); Class (philosophy); Binary number; Word (group theory); Algebraic combinatorics; Discrete mathematics; Algebraic number; Power series; Arithmetic; Computer science; Geometry","score_opus":0.009534080433971958,"score_gpt":0.24123411333055647,"score_spread":0.2317000328965845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1634002241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02171658,0.0016972249,0.8948684,0.0032595124,0.00094684126,0.0001420317,0.00013667993,0.0007040681,0.076528706],"genre_scores_gemma":[0.3684868,0.0038495716,0.5329815,0.0022968072,0.0023596084,0.00056099,0.00037720278,0.0010417034,0.08804584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985262,0.00036520627,0.00008530718,0.0003978375,0.000494187,0.00013111315],"domain_scores_gemma":[0.99654275,0.002012505,0.00016007017,0.0008047564,0.00033911652,0.00014081999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017492683,0.0014073987,0.0011134907,0.002644749,0.0018687369,0.0018123619,0.0020866732,0.0013739099,0.018723559],"category_scores_gemma":[0.008379261,0.00064817246,0.0023921828,0.0027569248,0.0038726805,0.0060709813,0.0037287609,0.004330992,0.0031254855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006381465,0.000075767544,0.00034230962,0.00013462927,0.000027302185,0.00018188347,0.00033561533,0.0063874694,0.0032787377,0.9132673,0.0052599343,0.07064517],"study_design_scores_gemma":[0.000023984001,0.000060639926,0.00012547725,0.000023985374,0.00002031962,0.00028393796,0.0000570679,0.03828826,0.0018617591,0.9333434,0.025880285,0.0000308727],"about_ca_topic_score_codex":0.001100483,"about_ca_topic_score_gemma":0.001396723,"teacher_disagreement_score":0.018723559,"about_ca_system_score_codex":0.001211307,"about_ca_system_score_gemma":0.0007555514,"threshold_uncertainty_score":0.062636495},"labels":[],"label_agreement":null},{"id":"W164208013","doi":"","title":"Combinatorial Proofs of a Type of Binomial Identity.","year":2005,"lang":"ca","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical proof; Type (biology); Identity (music); Binomial coefficient; Combinatorial proof; Binomial (polynomial); Combinatorics; Discrete mathematics; Statistics; Geometry; Biology; Physics","score_opus":0.016133512960468648,"score_gpt":0.26702322381014104,"score_spread":0.2508897108496724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164208013","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10004796,0.0031597917,0.43893617,0.012039597,0.0032242155,0.00014435957,0.0012737671,0.0018534326,0.43932065],"genre_scores_gemma":[0.8709379,0.001133447,0.06319495,0.0022977917,0.0014151937,0.00013307115,0.00072002487,0.00043781367,0.059729792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99716055,0.0012120844,0.00015329395,0.00043450145,0.00074624055,0.00029330683],"domain_scores_gemma":[0.9871564,0.008578942,0.0006036664,0.001922303,0.0011097207,0.0006289379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024877149,0.0005405878,0.0007837091,0.0013317448,0.0029956603,0.0037198083,0.0018769973,0.0013831793,0.02016183],"category_scores_gemma":[0.014677648,0.00068021845,0.0012463151,0.0014039417,0.004396724,0.009289549,0.0039638365,0.0032943648,0.0025320542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002744491,0.000023092425,0.00017494854,0.00005441555,0.000009812212,0.00015569996,0.0001720164,0.00015150601,0.00036799305,0.9891327,0.005495642,0.0042347],"study_design_scores_gemma":[0.000023862265,0.00001565681,0.00018708258,0.00003389329,0.000019563304,0.0004046294,0.00007771699,0.0015440637,0.0008840236,0.9837467,0.013048854,0.000013841167],"about_ca_topic_score_codex":0.00072805525,"about_ca_topic_score_gemma":0.0009922539,"teacher_disagreement_score":0.02016183,"about_ca_system_score_codex":0.0016936274,"about_ca_system_score_gemma":0.0009841992,"threshold_uncertainty_score":0.06744808},"labels":[],"label_agreement":null},{"id":"W1644292110","doi":"10.1016/j.tcs.2008.11.001","title":"A new characteristic property of rich words","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Palindrome; Suffix; Property (philosophy); Prefix; Class (philosophy); Combinatorics; Mathematics; Pure mathematics; Computer science; Linguistics; Philosophy; Artificial intelligence; Biology","score_opus":0.01267596089827406,"score_gpt":0.22429627106657327,"score_spread":0.2116203101682992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1644292110","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5883242,0.0009778106,0.35073537,0.001955075,0.00029840798,0.00008590455,0.00093966635,0.0009878264,0.05569579],"genre_scores_gemma":[0.96356225,0.00029238782,0.025159067,0.00028538267,0.00025186685,0.00007215088,0.00031560528,0.0002128248,0.009848462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991516,0.00013341948,0.00006838925,0.0002866642,0.00020368153,0.00015629917],"domain_scores_gemma":[0.9950362,0.0024799202,0.0006245695,0.00078143255,0.0005885776,0.0004892821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007240339,0.0002621566,0.00067424646,0.0015667172,0.0012863929,0.0026433582,0.0007291103,0.0008411065,0.0049814847],"category_scores_gemma":[0.0051698643,0.00041809643,0.0006116332,0.0017477967,0.0024724666,0.0087446235,0.001987758,0.0016662095,0.0007388664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110992296,0.0000148203135,0.0014885636,0.00007675582,0.000010845441,0.00020333545,0.0006386188,0.0004730433,0.0056551793,0.97892857,0.0013264241,0.011072853],"study_design_scores_gemma":[0.000030050618,0.00005401683,0.001109566,0.00002068552,0.000023702272,0.00092598406,0.00032135317,0.0050157188,0.003707182,0.97873634,0.010021212,0.000034278128],"about_ca_topic_score_codex":0.00028692628,"about_ca_topic_score_gemma":0.00029379997,"teacher_disagreement_score":0.0049814847,"about_ca_system_score_codex":0.0008491688,"about_ca_system_score_gemma":0.0005596088,"threshold_uncertainty_score":0.016664743},"labels":[],"label_agreement":null},{"id":"W1645602948","doi":"10.1142/s0129054114400097","title":"SYNTACTIC COMPLEXITY OF ℛ- AND 𝒥-TRIVIAL REGULAR LANGUAGES","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular language; Cardinality (data modeling); Complexity class; Abstract family of languages; Cone (formal languages); Class (philosophy); Descriptive complexity theory; Formal language","score_opus":0.019917248690145807,"score_gpt":0.3049048066592412,"score_spread":0.28498755796909536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1645602948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9284471,0.0003683808,0.049001306,0.0013655572,0.000034466673,0.000041706782,0.00058967044,0.00024637213,0.019905465],"genre_scores_gemma":[0.99104404,0.00015687718,0.006324801,0.0000927714,0.00008764333,0.000058243237,0.0004140458,0.000054038148,0.0017675635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771833,0.00036575657,0.00019342802,0.00053431565,0.00074249937,0.00044571998],"domain_scores_gemma":[0.97487575,0.019610604,0.0019723787,0.0015082395,0.001148516,0.0008844242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016604475,0.00035770342,0.00080125243,0.0013717323,0.001191019,0.0035515185,0.0011397983,0.0007177968,0.0032259875],"category_scores_gemma":[0.011164125,0.0005351571,0.0012862796,0.00075982476,0.0028304388,0.0058935545,0.0022727565,0.0018484471,0.00023794519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060827733,0.00017205226,0.013040112,0.0003231322,0.00008990317,0.00041975718,0.0019525009,0.024467211,0.022483949,0.91277516,0.002282079,0.021385854],"study_design_scores_gemma":[0.00003625513,0.000061412866,0.011100848,0.0000406588,0.000071489405,0.0005773314,0.00038284995,0.10924939,0.009394135,0.8665793,0.0024206997,0.00008563835],"about_ca_topic_score_codex":0.0009919141,"about_ca_topic_score_gemma":0.00094566314,"teacher_disagreement_score":0.0035515185,"about_ca_system_score_codex":0.0019522373,"about_ca_system_score_gemma":0.001098382,"threshold_uncertainty_score":0.014164507},"labels":[],"label_agreement":null},{"id":"W1661074815","doi":"10.1007/s00233-015-9746-9","title":"Strongly productive ultrafilters on semigroups","year":2015,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Ultrafilter; Semilattice; Inverse semigroup; Semigroup; Commutative property; Special classes of semigroups; Bicyclic semigroup; Binary operation","score_opus":0.019055889483309343,"score_gpt":0.23717290279419495,"score_spread":0.21811701331088562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1661074815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3866999,0.002299542,0.5532671,0.0023550226,0.00067420426,0.000091003254,0.0005771982,0.0010684133,0.052967686],"genre_scores_gemma":[0.94057876,0.00072782405,0.033754017,0.00026097248,0.0005761808,0.00014985203,0.00030756558,0.00021044898,0.023434427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964503,0.0010533633,0.00025894894,0.0007341237,0.0007938361,0.00070942787],"domain_scores_gemma":[0.98530954,0.009505904,0.00094708754,0.001343421,0.0012147215,0.00167933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041930713,0.0009943235,0.001267003,0.0037675805,0.0037188276,0.0060899546,0.0013411044,0.0018382837,0.008954573],"category_scores_gemma":[0.008983819,0.0012058154,0.0016940709,0.002271976,0.004785976,0.01780474,0.0053991876,0.00286797,0.0011854559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068632326,0.000030576037,0.0002582351,0.00003462044,0.000007095727,0.00013188751,0.0009207739,0.00026969588,0.0015910023,0.9916148,0.00046251403,0.004610082],"study_design_scores_gemma":[0.00003461551,0.000046027395,0.00031619734,0.000020683332,0.000016401451,0.00020099572,0.00026202833,0.0026642783,0.0013800124,0.9902018,0.004830312,0.000026717944],"about_ca_topic_score_codex":0.0005384904,"about_ca_topic_score_gemma":0.0005644487,"teacher_disagreement_score":0.008954573,"about_ca_system_score_codex":0.0016220602,"about_ca_system_score_gemma":0.00071540725,"threshold_uncertainty_score":0.029956043},"labels":[],"label_agreement":null},{"id":"W1670403172","doi":"10.1142/s0129054116500088","title":"Remarks on Privileged Words","year":2016,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Word (group theory); Linguistics; Context (archaeology); Word length; Computer science; Natural language processing; Arithmetic; Mathematics; History; Philosophy","score_opus":0.016328615167978063,"score_gpt":0.30530616625986967,"score_spread":0.2889775510918916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1670403172","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063066445,0.033664808,0.31958935,0.23141871,0.022696543,0.00031118808,0.0016806105,0.0022452944,0.325327],"genre_scores_gemma":[0.72925633,0.018114438,0.08315398,0.07512052,0.023760986,0.0005810196,0.0011041682,0.0009713837,0.06793721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99447495,0.0017317116,0.00033927648,0.0014840266,0.0013601203,0.00060987065],"domain_scores_gemma":[0.9805407,0.013734839,0.00067485747,0.0021488385,0.0020879065,0.00081297144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005160233,0.0012767824,0.0013589723,0.0017050058,0.004379186,0.0033907646,0.003647624,0.0034621223,0.01988008],"category_scores_gemma":[0.020674132,0.0005399722,0.0017339893,0.001683808,0.010753941,0.021519816,0.0057693883,0.009511689,0.003861032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010296994,0.000034554483,0.00056280114,0.00025926568,0.000016322834,0.00036467722,0.0008613785,0.0013748619,0.0005990404,0.9528689,0.02800448,0.014950775],"study_design_scores_gemma":[0.000024226805,0.000043567677,0.0003357649,0.0001044165,0.000012253672,0.00027165734,0.00033749864,0.0013375339,0.0006931822,0.9078182,0.08898865,0.000032974134],"about_ca_topic_score_codex":0.0024608406,"about_ca_topic_score_gemma":0.00100046,"teacher_disagreement_score":0.01988008,"about_ca_system_score_codex":0.0019650813,"about_ca_system_score_gemma":0.0008272841,"threshold_uncertainty_score":0.06650549},"labels":[],"label_agreement":null},{"id":"W1675101798","doi":"10.3233/fi-2014-1112","title":"Reconstructing Words from a σ-palindromic Language","year":2014,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Palindrome; Alphabet; Computation; Involution (esoterism); Mathematics; Combinatorics; Computer science; Algebra over a field; Discrete mathematics; Linguistics; Algorithm; Pure mathematics; Philosophy","score_opus":0.005768128546149364,"score_gpt":0.21212812442914294,"score_spread":0.20635999588299359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1675101798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2729394,0.00057889015,0.7185153,0.00053402514,0.00013629794,0.00009183867,0.0006262385,0.0019113289,0.004666665],"genre_scores_gemma":[0.53528565,0.00039486328,0.45480317,0.00017907818,0.00010632944,0.00010871922,0.0020620276,0.0006149171,0.0064451424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920136,0.00018338903,0.00008227188,0.00027704152,0.0001472141,0.00010874024],"domain_scores_gemma":[0.99591845,0.0025408475,0.00029191293,0.0007732375,0.00034536363,0.00013016678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007788801,0.000763567,0.0007153183,0.0008634449,0.00074036943,0.0017869446,0.0014532434,0.0011242904,0.004099721],"category_scores_gemma":[0.0077408873,0.0007811494,0.0010456687,0.0009344332,0.0013648318,0.0030522905,0.0022853143,0.0014915484,0.001936256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017736485,0.00026342552,0.0054370523,0.001521962,0.00012437989,0.002045614,0.004474351,0.07586628,0.0709906,0.44062522,0.0063791275,0.3904984],"study_design_scores_gemma":[0.000115782066,0.00025918908,0.00042423478,0.00012631253,0.000081269485,0.00064449036,0.00097006164,0.20064156,0.048295114,0.7394015,0.008974513,0.000065906745],"about_ca_topic_score_codex":0.00081722817,"about_ca_topic_score_gemma":0.0013209569,"teacher_disagreement_score":0.004099721,"about_ca_system_score_codex":0.00050960004,"about_ca_system_score_gemma":0.0007596981,"threshold_uncertainty_score":0.013714969},"labels":[],"label_agreement":null},{"id":"W1683991801","doi":"10.1007/s00233-015-9725-1","title":"Growth degree classification for finitely generated semigroups of integer matrices","year":2015,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Integer (computer science); Degree (music); Finitely-generated abelian group; Product (mathematics); Norm (philosophy); Discrete mathematics; Geometry","score_opus":0.07655738515433512,"score_gpt":0.27468651099593133,"score_spread":0.1981291258415962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1683991801","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86098236,0.0010093648,0.10494342,0.00189389,0.0001750963,0.00005252739,0.0006743329,0.0003385106,0.029930461],"genre_scores_gemma":[0.97746664,0.00051244156,0.009619842,0.00011554004,0.0002626144,0.000042344018,0.0007556204,0.00010111101,0.011123925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904746,0.00014905861,0.00005294749,0.0002002502,0.00029331222,0.0002569474],"domain_scores_gemma":[0.99228,0.0043017827,0.00092218537,0.00046429865,0.00069011736,0.0013416266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012635702,0.00070742995,0.00084572606,0.0034205725,0.0016621754,0.0042008716,0.0013213627,0.0011863094,0.0063095735],"category_scores_gemma":[0.0060736635,0.00046174624,0.0008379678,0.0017623863,0.0027271283,0.0057863905,0.0018405697,0.0024341086,0.0009043252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020835522,0.000065716944,0.0031216217,0.000072580144,0.000009689071,0.00013113445,0.0008918457,0.0031017598,0.005808716,0.9742337,0.0023550082,0.009999831],"study_design_scores_gemma":[0.000031984342,0.000059518487,0.0028274634,0.000041760188,0.000016139555,0.00034738187,0.00035471303,0.03731323,0.004070037,0.95096856,0.0039157835,0.00005345724],"about_ca_topic_score_codex":0.0012202883,"about_ca_topic_score_gemma":0.0009153482,"teacher_disagreement_score":0.0063095735,"about_ca_system_score_codex":0.0018875342,"about_ca_system_score_gemma":0.00059751386,"threshold_uncertainty_score":0.021107614},"labels":[],"label_agreement":null},{"id":"W1684681859","doi":"10.3233/fun-2002-52405","title":"One-Visit Caterpillar Tree Automata","year":2002,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Caterpillar; Tree (set theory); Automaton; Computer science; Mathematics; Theoretical computer science; Combinatorics; Biology; Botany; Larva","score_opus":0.02570031036777105,"score_gpt":0.21881751186003628,"score_spread":0.19311720149226524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1684681859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74871975,0.0005222827,0.22884198,0.0007474664,0.00006954205,0.00015032635,0.00048484514,0.0010901762,0.019373644],"genre_scores_gemma":[0.9681327,0.00018141305,0.02723012,0.000088579916,0.000020187092,0.00008690358,0.00026062637,0.000049030667,0.003950538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941266,0.00009682934,0.000051674484,0.00018508166,0.00009690444,0.00015684086],"domain_scores_gemma":[0.99710685,0.0015104695,0.00034511066,0.0006171796,0.00021418353,0.00020621021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048244488,0.0003111256,0.00050748803,0.00023196844,0.0011070404,0.0011859315,0.0016366333,0.0010753963,0.0031149238],"category_scores_gemma":[0.0024706598,0.00027176258,0.00081869576,0.00048707114,0.0016072462,0.001657598,0.0009634188,0.0008429684,0.0005262756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009148268,0.00033641857,0.011765091,0.0005201209,0.00009395548,0.0021358153,0.0027672008,0.11615944,0.06540803,0.75188416,0.0055174143,0.042497456],"study_design_scores_gemma":[0.0001972362,0.00043275816,0.0021692556,0.000056335364,0.00013347347,0.0019780006,0.00090086483,0.447031,0.030100346,0.50255847,0.01432695,0.00011529683],"about_ca_topic_score_codex":0.0014654868,"about_ca_topic_score_gemma":0.0018722864,"teacher_disagreement_score":0.0031149238,"about_ca_system_score_codex":0.00088684785,"about_ca_system_score_gemma":0.0007479891,"threshold_uncertainty_score":0.010420382},"labels":[],"label_agreement":null},{"id":"W1722516136","doi":"10.3233/fi-2010-287","title":"Computing Maximal Error-detecting Capabilities and Distances of Regular Languages","year":2010,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Computer science; Programming language; Theoretical computer science","score_opus":0.007556075071810087,"score_gpt":0.24278347386891294,"score_spread":0.23522739879710286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1722516136","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60407615,0.00019350777,0.38885424,0.00023346725,0.00002299221,0.00007962307,0.00053549797,0.0010409773,0.004963609],"genre_scores_gemma":[0.9134512,0.0000823888,0.085260704,0.0000321018,0.00002469972,0.000072204675,0.00033857548,0.000110722336,0.00062747946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961274,0.0009881514,0.00052094454,0.0010703006,0.000870924,0.000422301],"domain_scores_gemma":[0.9645523,0.026862739,0.0029930768,0.0028777993,0.001523129,0.0011911225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028995713,0.00086541224,0.0009077006,0.0026304927,0.00070400466,0.0030609842,0.0012821119,0.0008458412,0.0018504716],"category_scores_gemma":[0.023899127,0.0007303349,0.0013300717,0.0011830999,0.004035706,0.007222434,0.0032750708,0.0015858337,0.00030175343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016666864,0.0002334942,0.018302193,0.0009525013,0.0002533694,0.0006101016,0.003507293,0.23801649,0.039907113,0.59952015,0.00093652686,0.09609404],"study_design_scores_gemma":[0.00008245089,0.00027332603,0.002749788,0.000089474685,0.00012303403,0.00044344718,0.0007871693,0.25765166,0.060201913,0.6749262,0.0025094885,0.00016200983],"about_ca_topic_score_codex":0.0006671803,"about_ca_topic_score_gemma":0.0005496109,"teacher_disagreement_score":0.0030609842,"about_ca_system_score_codex":0.0011755236,"about_ca_system_score_gemma":0.0010009578,"threshold_uncertainty_score":0.015334606},"labels":[],"label_agreement":null},{"id":"W1738437109","doi":"10.1007/3-540-36494-3_17","title":"Fast Algorithms for Extended Regular Expression Matching and Searching","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Regular expression; Complement (music); Intersection (aeronautics); Computer science; Expression (computer science); Algorithm; Matching (statistics); Extension (predicate logic); Pattern matching; Word (group theory); Upper and lower bounds; Mathematics; Artificial intelligence; Programming language","score_opus":0.01678256366001422,"score_gpt":0.2586254758790411,"score_spread":0.2418429122190269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1738437109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01056493,0.00076481246,0.97124445,0.00028972363,0.00013618071,0.00019644237,0.00052752456,0.010573724,0.0057022176],"genre_scores_gemma":[0.0661118,0.0004323996,0.9198132,0.00015788223,0.00009219822,0.00041207418,0.002308698,0.0014568178,0.009215049],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958333,0.0007553192,0.00038774952,0.0011561112,0.0013089629,0.0005586213],"domain_scores_gemma":[0.99335724,0.0032102722,0.00026019118,0.0022945034,0.0006984759,0.00017940687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00228982,0.0023034546,0.0033709798,0.0031903274,0.0017972216,0.004158927,0.0073135053,0.002504428,0.031147959],"category_scores_gemma":[0.009689318,0.0018305208,0.0028810166,0.0080029415,0.0018030008,0.0135831535,0.006177154,0.0031240403,0.009517418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010869618,0.00029853804,0.0006576471,0.0006760163,0.00013283423,0.00012500181,0.0003723929,0.027748378,0.0069116876,0.115910426,0.027113939,0.8189662],"study_design_scores_gemma":[0.0005298741,0.0001966746,0.0004779911,0.00010786782,0.00019356266,0.00043521688,0.00032343715,0.44362056,0.017743273,0.5085296,0.027728513,0.00011343371],"about_ca_topic_score_codex":0.004182665,"about_ca_topic_score_gemma":0.0064939247,"teacher_disagreement_score":0.031147959,"about_ca_system_score_codex":0.0027585956,"about_ca_system_score_gemma":0.0027243658,"threshold_uncertainty_score":0.1042003},"labels":[],"label_agreement":null},{"id":"W1738746856","doi":"","title":"Results on Transforming NFA into DFCA","year":2004,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Prince Edward Island","funders":"","keywords":"Nondeterministic finite automaton; Deterministic finite automaton; Mathematics; Finite-state machine; Upper and lower bounds; Discrete mathematics; Combinatorics; Nondeterministic algorithm; Nested word; ω-automaton; Quantum finite automata; DFA minimization; Conjecture; Cover (algebra); Automaton; State (computer science); Automata theory; Algorithm; Computer science; Theoretical computer science","score_opus":0.011932914249501422,"score_gpt":0.2410837567690871,"score_spread":0.22915084251958567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1738746856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06435646,0.0016740375,0.87646747,0.0017874142,0.00022308198,0.00017416377,0.00044427224,0.0012445257,0.053628597],"genre_scores_gemma":[0.7003008,0.0025147337,0.2793192,0.0015181608,0.000535193,0.0005223525,0.0016065747,0.0007421737,0.012940648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99508095,0.0007752868,0.00043864135,0.0012617344,0.001937597,0.00050582364],"domain_scores_gemma":[0.977344,0.017081963,0.00061941723,0.0033026608,0.0013661791,0.00028588317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024108398,0.00075036444,0.0009263195,0.0012961655,0.0015693092,0.0024613882,0.0015404292,0.0014508663,0.009630677],"category_scores_gemma":[0.016991481,0.00057723554,0.0026958429,0.0015666725,0.002678591,0.007900531,0.0021514609,0.00421218,0.0014302833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017859534,0.00024266758,0.0014981139,0.0009152845,0.00007412556,0.00027394271,0.0008566773,0.037415605,0.015362455,0.83630323,0.0027157208,0.10416366],"study_design_scores_gemma":[0.000033282326,0.00010456786,0.00076239347,0.0001093713,0.00007663981,0.0004281341,0.0001278624,0.064192414,0.012102029,0.898911,0.023117501,0.000034792207],"about_ca_topic_score_codex":0.0018083086,"about_ca_topic_score_gemma":0.0010703147,"teacher_disagreement_score":0.009630677,"about_ca_system_score_codex":0.0022890195,"about_ca_system_score_gemma":0.0009990147,"threshold_uncertainty_score":0.03221786},"labels":[],"label_agreement":null},{"id":"W1752350786","doi":"10.55016/ojs/cdm.v13i1.62788","title":"Density dichotomy in random words","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Substring; Combinatorics; Word (group theory); Mathematics; Alphabet; Sigma; Rank (graph theory); Limit (mathematics); Physics; Linguistics; Computer science; Philosophy; Geometry","score_opus":0.008632125033444954,"score_gpt":0.27738556260323755,"score_spread":0.2687534375697926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1752350786","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61849415,0.0031120337,0.29340154,0.011753179,0.00033095042,0.00013996614,0.0010422595,0.0008679352,0.070857935],"genre_scores_gemma":[0.97287095,0.00069614296,0.014314035,0.0009623093,0.00043808398,0.00033285885,0.00042007078,0.00015790739,0.00980764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964257,0.0013733353,0.00016042117,0.00085604563,0.00081112835,0.0003732733],"domain_scores_gemma":[0.97486657,0.019783301,0.001142207,0.0015262367,0.0013567472,0.0013248341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037327842,0.00042867282,0.0012425765,0.0022112108,0.0023005556,0.0039653555,0.0014561996,0.0017623914,0.0077655315],"category_scores_gemma":[0.025255157,0.0005520391,0.001158078,0.0010631679,0.0058489484,0.0074996166,0.003590215,0.0029882041,0.0009014635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003660403,0.000016425538,0.00080199505,0.000043427757,0.000009294344,0.000075995915,0.0004729793,0.0017113528,0.00044739072,0.99244785,0.0012291548,0.0027074707],"study_design_scores_gemma":[0.000021840757,0.000026463915,0.00070245384,0.00003509117,0.000008138538,0.00013041619,0.00014936627,0.043785904,0.00042104366,0.9527134,0.0019831029,0.000022746495],"about_ca_topic_score_codex":0.00171445,"about_ca_topic_score_gemma":0.000830553,"teacher_disagreement_score":0.0077655315,"about_ca_system_score_codex":0.0036717972,"about_ca_system_score_gemma":0.0009232707,"threshold_uncertainty_score":0.026640892},"labels":[],"label_agreement":null},{"id":"W1764454094","doi":"10.1007/3-540-44693-1_48","title":"Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bounded function; Computer science; Order (exchange); Upper and lower bounds; Discrete mathematics; Mathematics","score_opus":0.007681388212035996,"score_gpt":0.22911991591952036,"score_spread":0.22143852770748437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1764454094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2150875,0.002818402,0.7292418,0.0010603712,0.0004104835,0.00018186907,0.00050445716,0.0018875959,0.048807554],"genre_scores_gemma":[0.74144274,0.001131479,0.2276588,0.0004781533,0.00022362996,0.00026829378,0.00056133076,0.00067721744,0.027558338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985461,0.00037237024,0.00011706282,0.00033014597,0.0003738205,0.00026054826],"domain_scores_gemma":[0.99808997,0.001043676,0.0001909341,0.00035125253,0.0002171664,0.00010694204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009810401,0.0010481193,0.0012149347,0.0008775653,0.00082850223,0.003979718,0.002001981,0.0012542821,0.0027416772],"category_scores_gemma":[0.0024563288,0.0010314411,0.0013295993,0.0011456923,0.0028409557,0.0067343726,0.0014629875,0.0033662573,0.00088052277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085992244,0.000021812066,0.00014559744,0.00013091847,0.000021192394,0.00024289382,0.0007389635,0.0036351993,0.008562494,0.971916,0.0009692755,0.013529808],"study_design_scores_gemma":[0.00004476611,0.000036556972,0.00016123417,0.00004595581,0.00003657176,0.00040074717,0.00018838252,0.020399017,0.0074887457,0.96012175,0.01103744,0.000038909868],"about_ca_topic_score_codex":0.00057156105,"about_ca_topic_score_gemma":0.0008951715,"teacher_disagreement_score":0.003979718,"about_ca_system_score_codex":0.00104138,"about_ca_system_score_gemma":0.0006417643,"threshold_uncertainty_score":0.009171784},"labels":[],"label_agreement":null},{"id":"W1765943450","doi":"10.3968/j.pam.1925252820130502.643","title":"The Subclasses of Characterization on $\\Pi^*$-Regular Semigroups","year":2013,"lang":"en","type":"article","venue":"Progress in applied mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Pi; Characterization (materials science); Mathematics; Discrete mathematics; Combinatorics; Computer science; Physics; Geometry","score_opus":0.009002251138495704,"score_gpt":0.22387205176140482,"score_spread":0.2148698006229091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1765943450","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6077964,0.0010468893,0.2501395,0.0010958026,0.00036700486,0.0001363632,0.0004987785,0.00067265396,0.13824664],"genre_scores_gemma":[0.9712503,0.00026603686,0.017267352,0.00015641426,0.00025486402,0.00011091135,0.00043799888,0.00010205255,0.010154066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981839,0.0003819411,0.00014464906,0.0006290031,0.00041154138,0.00024885946],"domain_scores_gemma":[0.9980854,0.00077556056,0.00028955677,0.00024478513,0.00035329524,0.0002514993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011725789,0.0003975241,0.000436737,0.0012122628,0.0017908392,0.0021745556,0.00066123786,0.0005955819,0.0050643864],"category_scores_gemma":[0.0027669852,0.00027521324,0.0007005522,0.0006170715,0.0020686295,0.0036901503,0.0014744477,0.0015613864,0.0006420378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005984948,0.00003552446,0.0006456271,0.000041798932,0.000008339846,0.00020720535,0.000730127,0.00032517,0.0040215966,0.9822681,0.00064556213,0.011011102],"study_design_scores_gemma":[0.000029402017,0.000103010134,0.0023340113,0.000046421184,0.000028378487,0.0009831695,0.0007128964,0.011471097,0.0084258,0.95301896,0.02280201,0.00004475945],"about_ca_topic_score_codex":0.00055444875,"about_ca_topic_score_gemma":0.00029180845,"teacher_disagreement_score":0.0050643864,"about_ca_system_score_codex":0.00084234483,"about_ca_system_score_gemma":0.00041252057,"threshold_uncertainty_score":0.016942084},"labels":[],"label_agreement":null},{"id":"W1768118166","doi":"10.1016/j.tcs.2014.04.016","title":"Theory of átomata","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Regional Development Fund; Haridus- ja Teadusministeerium; Natural Sciences and Engineering Research Council of Canada; Eesti Teadusfondi","keywords":"Nondeterministic finite automaton; Deterministic finite automaton; Regular language; Deterministic automaton; Büchi automaton; Nondeterministic algorithm; Finite-state machine; Mathematics; Discrete mathematics; DFA minimization; Quotient; Automaton; Regular expression; Combinatorics; Two-way deterministic finite automaton; Computer science; Algorithm; Automata theory; Theoretical computer science; Programming language","score_opus":0.008109070715470214,"score_gpt":0.22572407714878318,"score_spread":0.21761500643331297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1768118166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034442306,0.0068937996,0.5524624,0.007958856,0.0014848738,0.00017515103,0.0020801001,0.0018995911,0.392603],"genre_scores_gemma":[0.721853,0.004239105,0.15336868,0.0026032133,0.0015328939,0.00048699728,0.0026839087,0.00089077745,0.1123414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810636,0.0005593454,0.00013560076,0.00049022544,0.0004785334,0.00022981226],"domain_scores_gemma":[0.99808806,0.00079798646,0.000106366744,0.000447242,0.00045567178,0.00010466436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014700132,0.00086758414,0.0011672871,0.0025382265,0.0038023498,0.0064418153,0.0020314772,0.001893068,0.021142824],"category_scores_gemma":[0.004149072,0.0011137198,0.00198848,0.0025275203,0.0064455094,0.014174778,0.003932702,0.004408286,0.0045372406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005662326,0.0000034992738,0.000041023235,0.00001823893,0.0000026384675,0.000011571808,0.000096160504,0.00011017583,0.00007021626,0.9965431,0.0011892914,0.0019085003],"study_design_scores_gemma":[0.000006318178,0.0000028097184,0.000031451913,0.000010846742,0.0000056364747,0.000028836508,0.00003657136,0.00068121566,0.00014120272,0.9882089,0.010841898,0.0000043315713],"about_ca_topic_score_codex":0.0025360978,"about_ca_topic_score_gemma":0.0017921858,"teacher_disagreement_score":0.021142824,"about_ca_system_score_codex":0.0029644927,"about_ca_system_score_gemma":0.0015988088,"threshold_uncertainty_score":0.07072973},"labels":[],"label_agreement":null},{"id":"W1768292","doi":"","title":"On the existence of Aperiodic Perfect Maps for 2 x 2 Windows.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Aperiodic graph; Mathematics; Combinatorics","score_opus":0.019856818305440532,"score_gpt":0.2191653776294581,"score_spread":0.19930855932401756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1768292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48305452,0.001855927,0.48577628,0.00085424114,0.00030423226,0.00012309721,0.0005371045,0.001221861,0.026272751],"genre_scores_gemma":[0.944576,0.00051401684,0.04625672,0.00013674519,0.00020572609,0.0001128143,0.00028435123,0.0001774241,0.007736065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986739,0.0003011124,0.00012637489,0.0003506196,0.00031020562,0.00023766581],"domain_scores_gemma":[0.99139977,0.005172949,0.0012236454,0.00089544605,0.00064754556,0.00066060823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013845296,0.00046041582,0.00051800563,0.0018859053,0.0012949192,0.0023839355,0.00056082994,0.00090904126,0.0048302216],"category_scores_gemma":[0.012071174,0.00066693145,0.0006029673,0.0008031363,0.0017494697,0.003923407,0.0013699614,0.0007689203,0.0012393513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048702108,0.000052473217,0.0026447924,0.0002391987,0.00004703247,0.0010558537,0.0009866336,0.008152152,0.012897043,0.9260702,0.0024112258,0.04495643],"study_design_scores_gemma":[0.00008726574,0.00018770095,0.0031580552,0.000102647915,0.000052646825,0.0023052003,0.0003546791,0.07524634,0.0081529105,0.89717704,0.013075794,0.00009960473],"about_ca_topic_score_codex":0.000575453,"about_ca_topic_score_gemma":0.00049720873,"teacher_disagreement_score":0.0048302216,"about_ca_system_score_codex":0.0007042022,"about_ca_system_score_gemma":0.0006486625,"threshold_uncertainty_score":0.01615864},"labels":[],"label_agreement":null},{"id":"W1768688475","doi":"10.1007/978-3-642-38771-5_23","title":"Subword Complexity and k-Synchronization","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Sequence (biology); Synchronization (alternating current); Contrast (vision); Function (biology); Algorithm; Arithmetic; Discrete mathematics; Combinatorics; Theoretical computer science; Artificial intelligence; Mathematics; Telecommunications; Biology","score_opus":0.019010154914770146,"score_gpt":0.22842723487517438,"score_spread":0.20941707996040423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1768688475","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29125893,0.006735676,0.35693264,0.006306646,0.001113229,0.000120940844,0.0006821757,0.0010459349,0.33580396],"genre_scores_gemma":[0.9320946,0.0017938068,0.019635528,0.00040758163,0.000730398,0.00013549495,0.00037178924,0.00022193373,0.044608798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999185,0.00017440673,0.000085646025,0.00021042566,0.0002079497,0.00013655257],"domain_scores_gemma":[0.99687,0.0020290723,0.00025803305,0.00041226528,0.00026217947,0.00016858982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004983515,0.00047516872,0.0009033336,0.0011067352,0.0014507766,0.0035755746,0.000912445,0.0013256157,0.014932995],"category_scores_gemma":[0.004246079,0.00038741942,0.00088992907,0.0018434505,0.0026239257,0.0084718065,0.002117989,0.0022341053,0.0022316289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038529957,0.000009767603,0.00008907921,0.000056443198,0.000007901594,0.00004958099,0.00020811209,0.0014370357,0.00076114974,0.98669446,0.0016307518,0.009017126],"study_design_scores_gemma":[0.0000062986305,0.000006294991,0.000058543552,0.0000067253754,0.000004661349,0.000038692826,0.000039686358,0.0026050431,0.0002987215,0.9945024,0.0024252571,0.000007639346],"about_ca_topic_score_codex":0.00064515223,"about_ca_topic_score_gemma":0.0004852155,"teacher_disagreement_score":0.014932995,"about_ca_system_score_codex":0.0015896661,"about_ca_system_score_gemma":0.00078388833,"threshold_uncertainty_score":0.049955845},"labels":[],"label_agreement":null},{"id":"W1813146539","doi":"10.1007/978-3-540-88282-4_43","title":"Length Codes, Products of Languages and Primality","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Primality test; Catenation; Computer science; Extension (predicate logic); Prime (order theory); Code (set theory); Decomposition; Programming language; Prefix code; Regular language; Algebra over a field; Discrete mathematics; Arithmetic; Mathematics; Theoretical computer science; Automaton; Algorithm; Pure mathematics; Combinatorics; Linear code; Set (abstract data type)","score_opus":0.012823321688631656,"score_gpt":0.24395722421437444,"score_spread":0.23113390252574278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1813146539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26749587,0.018378593,0.48352832,0.005887595,0.0012451819,0.00010822604,0.0007707708,0.0006380781,0.22194733],"genre_scores_gemma":[0.86151636,0.0070046284,0.07313625,0.00081859995,0.0017194276,0.00022805657,0.0005281096,0.0004678957,0.05458069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998814,0.00030096972,0.00008554101,0.00026297878,0.00039535944,0.00014132005],"domain_scores_gemma":[0.99573684,0.002862459,0.0003993901,0.00044383088,0.00034499553,0.00021248519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013752464,0.0006469064,0.0008300724,0.00166768,0.0015291556,0.0042914953,0.00083307154,0.0013263754,0.005386292],"category_scores_gemma":[0.006159839,0.00083457684,0.0007012309,0.0021354163,0.0057535623,0.008880281,0.0026317479,0.0035564408,0.0010317124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035422712,0.0000086342425,0.00011967989,0.000050201852,0.0000033466606,0.00002739274,0.00019071263,0.0006948974,0.0005341465,0.98821425,0.0009366829,0.009184577],"study_design_scores_gemma":[0.000005006798,0.000009309593,0.00005419944,0.000010456959,0.0000036837487,0.0000724578,0.000028149158,0.0007858461,0.00032702633,0.99580306,0.0028943706,0.0000065434238],"about_ca_topic_score_codex":0.00038392734,"about_ca_topic_score_gemma":0.00034647615,"teacher_disagreement_score":0.005386292,"about_ca_system_score_codex":0.0013339523,"about_ca_system_score_gemma":0.00071632315,"threshold_uncertainty_score":0.018018961},"labels":[],"label_agreement":null},{"id":"W1833516523","doi":"10.1007/978-3-642-38771-5_34","title":"Repetition Avoidance in Circular Factors","year":2013,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Word (group theory); Repetition (rhetorical device); Alphabet; Exponent; Mathematics; Word length; Combinatorics; Variation (astronomy); Upper and lower bounds; Computer science; Geometry; Physics; Natural language processing; Linguistics; Mathematical analysis","score_opus":0.01386120211592238,"score_gpt":0.2395959528970629,"score_spread":0.22573475078114053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1833516523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60189337,0.0010060249,0.26985878,0.0010636431,0.00035854572,0.000082362545,0.00015629547,0.0010755402,0.12450539],"genre_scores_gemma":[0.9562372,0.00024629556,0.02007345,0.00017867517,0.000137447,0.00005293059,0.00012476559,0.00025282303,0.02269649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989512,0.00020701786,0.00006233291,0.00026798638,0.00023451194,0.0002769843],"domain_scores_gemma":[0.9957676,0.0021531193,0.00039414814,0.0008596844,0.0004505956,0.0003748691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007893668,0.00045648558,0.00079916656,0.0011486871,0.0022004994,0.0021905892,0.0009837662,0.0011370726,0.009050819],"category_scores_gemma":[0.005680184,0.0005863768,0.0010616665,0.0009776964,0.0026077714,0.00386347,0.0025389125,0.0016600057,0.0012166342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015490747,0.000024132001,0.00040079287,0.00005460421,0.000010208119,0.00021770563,0.0006516974,0.0017949158,0.0026167876,0.98422766,0.0011405589,0.008705818],"study_design_scores_gemma":[0.00002235404,0.000024201847,0.00015318856,0.000013979572,0.000015694302,0.00016980492,0.00013690675,0.006561683,0.0015502225,0.9880314,0.003301864,0.000018782332],"about_ca_topic_score_codex":0.0009899985,"about_ca_topic_score_gemma":0.0008752959,"teacher_disagreement_score":0.009050819,"about_ca_system_score_codex":0.00078975194,"about_ca_system_score_gemma":0.00060989236,"threshold_uncertainty_score":0.030277967},"labels":[],"label_agreement":null},{"id":"W1834459590","doi":"","title":"What is a maximal error-detecting capability of a formal language?","year":2006,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Computer science; Class (philosophy); Set (abstract data type); Channel (broadcasting); Formal language; Error detection and correction; Theoretical computer science; Emphasis (telecommunications); Algorithm; Artificial intelligence; Programming language; Telecommunications","score_opus":0.009546469054599459,"score_gpt":0.24010113927292348,"score_spread":0.23055467021832401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1834459590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3210675,0.0026319926,0.63491344,0.004141543,0.00027631648,0.00013626167,0.0009007095,0.0012369889,0.034695257],"genre_scores_gemma":[0.9466798,0.0007851727,0.05031766,0.00025039134,0.0002665308,0.00007690434,0.00015441663,0.00010986252,0.001359296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951934,0.0011145333,0.0004173507,0.001322461,0.0012679327,0.0006842606],"domain_scores_gemma":[0.9586214,0.030476224,0.0029438352,0.0033573725,0.0030538323,0.0015473634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051097954,0.0009331142,0.0010764309,0.0028719394,0.0011377871,0.004168114,0.001711784,0.0017254954,0.0033941292],"category_scores_gemma":[0.02455208,0.0005014949,0.0012431908,0.0018021368,0.009184846,0.012565468,0.0019163915,0.0015289605,0.0005574697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017698458,0.0000624026,0.0032955394,0.0005051206,0.00008189129,0.0003796392,0.0014033457,0.010933385,0.008017889,0.9468408,0.00078519544,0.027517904],"study_design_scores_gemma":[0.000017572855,0.000103505125,0.0006791209,0.00017774955,0.00005896257,0.0007674977,0.0005274934,0.01797414,0.013498919,0.96014345,0.0059583713,0.00009327191],"about_ca_topic_score_codex":0.0006358954,"about_ca_topic_score_gemma":0.00030453372,"teacher_disagreement_score":0.0051097954,"about_ca_system_score_codex":0.0010800471,"about_ca_system_score_gemma":0.0013471511,"threshold_uncertainty_score":0.027023554},"labels":[],"label_agreement":null},{"id":"W1835137587","doi":"10.1007/978-3-642-04027-6_16","title":"On the Word Problem for ${\\it \\Sigma\\Pi}$ -Categories, and the Properties of Two-Way Communication","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Sigma; Word (group theory); Pi; Natural language processing; Artificial intelligence; Linguistics; Mathematics; Philosophy; Physics","score_opus":0.02236925122544508,"score_gpt":0.2297262105053634,"score_spread":0.20735695927991832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1835137587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14342003,0.019462822,0.47980636,0.03761697,0.0017407562,0.00026583453,0.001657032,0.00075666147,0.3152736],"genre_scores_gemma":[0.74008983,0.009761273,0.12103822,0.0040542088,0.0028839535,0.0008797382,0.0019016251,0.00084228767,0.11854892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821883,0.0005526497,0.0001863103,0.0004269721,0.0003635616,0.00025159484],"domain_scores_gemma":[0.9964251,0.0025637967,0.00018227182,0.0004134965,0.00027218604,0.00014323689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025983069,0.0011948883,0.0020603586,0.0023616864,0.006744504,0.008740136,0.0028551926,0.006700505,0.0149265],"category_scores_gemma":[0.007151634,0.0012148693,0.0027760458,0.004999613,0.012203308,0.04049736,0.0056520104,0.006534094,0.002071017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014374011,0.0000068794366,0.000025961333,0.000037281323,0.000002887067,0.000021625534,0.00016411794,0.00032120445,0.00008050392,0.995086,0.0014702221,0.0027689608],"study_design_scores_gemma":[0.000002976264,0.0000018668857,0.000015959438,0.0000067576702,0.0000015984944,0.00002155154,0.000046982474,0.00047837532,0.00003671712,0.9980817,0.0013002418,0.000005290168],"about_ca_topic_score_codex":0.003663559,"about_ca_topic_score_gemma":0.0022733666,"teacher_disagreement_score":0.0149265,"about_ca_system_score_codex":0.0035647983,"about_ca_system_score_gemma":0.0017895313,"threshold_uncertainty_score":0.04993409},"labels":[],"label_agreement":null},{"id":"W1836835072","doi":"10.1023/a:1022091131450","title":"On 2-Symmetric Words in Nilpotent Groups","year":2002,"lang":"en","type":"article","venue":"Ukrainian Mathematical Journal","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Algebra over a field; Pure mathematics","score_opus":0.02328301646311038,"score_gpt":0.23588537002776955,"score_spread":0.21260235356465917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1836835072","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83622754,0.0022169848,0.07516359,0.001486342,0.0009507171,0.00010788694,0.00052781886,0.00025788046,0.08306127],"genre_scores_gemma":[0.9676569,0.0006840196,0.0057438947,0.00029720998,0.0004323534,0.000094459756,0.0002732971,0.00008501983,0.024732886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999418,0.00015345853,0.000050778854,0.00011173655,0.00011235096,0.00015371545],"domain_scores_gemma":[0.999196,0.000370341,0.00011981867,0.00006247771,0.00011614453,0.00013527204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004496505,0.00080573844,0.0009124485,0.0022793955,0.0021157619,0.0031310858,0.0007032037,0.0011740347,0.0064775017],"category_scores_gemma":[0.0012807912,0.00043110087,0.00083129964,0.0014102733,0.002119591,0.0039000725,0.0022124145,0.0009641019,0.0012533492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001023041,0.00003685583,0.0003200968,0.00006671367,0.00001253569,0.00042599768,0.0014174837,0.0012843973,0.0021942768,0.9871725,0.0007887905,0.0061781085],"study_design_scores_gemma":[0.000016243692,0.00003638305,0.0002597705,0.000015034053,0.000009089485,0.00016289402,0.00025374055,0.0024003466,0.0005385802,0.99350715,0.0027846922,0.000016111167],"about_ca_topic_score_codex":0.0006617161,"about_ca_topic_score_gemma":0.00067277264,"teacher_disagreement_score":0.0064775017,"about_ca_system_score_codex":0.0012280243,"about_ca_system_score_gemma":0.0008039767,"threshold_uncertainty_score":0.021669388},"labels":[],"label_agreement":null},{"id":"W1843502301","doi":"10.3968/j.sms.1923845220120101.007","title":"On the Construction of Normal Subgroups","year":2010,"lang":"en","type":"article","venue":"Studies in mathematical sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Sylow theorems; Mathematics; Normal subgroup; Character (mathematics); Extension (predicate logic); Group (periodic table); Pure mathematics; Fitting subgroup; Finite group; Key (lock); Algebra over a field; Locally finite group; Combinatorics; Computer science; Geometry; Physics","score_opus":0.039009304528157214,"score_gpt":0.31343841658814064,"score_spread":0.27442911205998344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1843502301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23789427,0.0011489799,0.65047675,0.0017728906,0.00050271046,0.000211635,0.00017552855,0.0006292163,0.10718805],"genre_scores_gemma":[0.86049634,0.00082301314,0.11395389,0.0003879261,0.00030080677,0.00022371525,0.00019211226,0.00016669894,0.023455577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987766,0.00051747274,0.00008380644,0.00027234774,0.00022839839,0.00012135828],"domain_scores_gemma":[0.9990159,0.0004332001,0.00006519034,0.0002163941,0.00016415723,0.00010519476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017096585,0.0005530158,0.0005551989,0.00121861,0.0011511594,0.0015066606,0.00050896604,0.00060865056,0.0028319976],"category_scores_gemma":[0.0023744283,0.00026242714,0.0010083945,0.00071664446,0.005322881,0.004952126,0.0031378577,0.0017412638,0.0005280919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018005863,0.000008374327,0.00014529935,0.00002008092,0.0000038819758,0.0000819835,0.0005686117,0.00037684044,0.0018736696,0.9921747,0.00022915719,0.0044994056],"study_design_scores_gemma":[0.000013589626,0.00006869816,0.00014695579,0.000013208399,0.000008216469,0.0002157226,0.00017815549,0.0036588216,0.004002013,0.9770304,0.014650193,0.000014102098],"about_ca_topic_score_codex":0.0004379406,"about_ca_topic_score_gemma":0.00023550578,"teacher_disagreement_score":0.0028319976,"about_ca_system_score_codex":0.00093842717,"about_ca_system_score_gemma":0.00058919226,"threshold_uncertainty_score":0.0094739795},"labels":[],"label_agreement":null},{"id":"W1848286548","doi":"10.48550/arxiv.0801.1097","title":"A Combinatorial Interpretation for Certain Relatives of the Conolly Sequence","year":2008,"lang":"en","type":"article","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Interpretation (philosophy); Sequence (biology); Integer (computer science); Parameterized complexity; Integer sequence; Recursion (computer science); Monotone polygon; Tree (set theory); Discrete mathematics; Generating function; Algorithm; Computer science; Biology","score_opus":0.04558555725837715,"score_gpt":0.2642845428738127,"score_spread":0.21869898561543555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1848286548","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45107555,0.00062111847,0.38394356,0.0011443881,0.00019798019,0.00014568782,0.0006062476,0.0006641224,0.16160133],"genre_scores_gemma":[0.9157325,0.00021185726,0.066195205,0.00036854722,0.00020488136,0.00020671978,0.00040517835,0.00014199936,0.016533073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993031,0.00018318185,0.000049122835,0.0002162774,0.00014063162,0.0001077035],"domain_scores_gemma":[0.99829084,0.0007671703,0.00029574425,0.00019937052,0.00024987644,0.0001970057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069404446,0.00040857051,0.00039258276,0.0014144502,0.0017333456,0.0017235965,0.0009590216,0.0008205124,0.0071259686],"category_scores_gemma":[0.0033838428,0.0002811945,0.0005730912,0.0014521042,0.0023289456,0.0027083033,0.0008171499,0.0012612826,0.000581062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019434588,0.000012496204,0.00031847134,0.000020661962,0.0000024019612,0.00014197761,0.00018900429,0.0012488003,0.0011524521,0.9917858,0.00043957683,0.0046689096],"study_design_scores_gemma":[0.000014046961,0.000037019545,0.00045688218,0.00001783186,0.000007883832,0.00046227744,0.00015764659,0.020542951,0.0017785464,0.9677563,0.008748745,0.00001982623],"about_ca_topic_score_codex":0.0008966257,"about_ca_topic_score_gemma":0.0011409852,"teacher_disagreement_score":0.0071259686,"about_ca_system_score_codex":0.0012724919,"about_ca_system_score_gemma":0.00051746797,"threshold_uncertainty_score":0.023838758},"labels":[],"label_agreement":null},{"id":"W1854120094","doi":"10.1142/s0129054111008131","title":"PROPERTIES OF PSEUDO-PRIMITIVE WORDS AND THEIR APPLICATIONS","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Catenation; Mathematics; Involution (esoterism); Palindrome; Word (group theory); Combinatorics; Combinatorics on words; Commutative property; Primitive root modulo n; Arithmetic; Discrete mathematics; Modulo; Geometry","score_opus":0.03143803747516207,"score_gpt":0.25822805487195344,"score_spread":0.22679001739679136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1854120094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38839772,0.003570358,0.53184134,0.0014094978,0.00049451634,0.00013428938,0.00032913202,0.00056091516,0.073262244],"genre_scores_gemma":[0.87889045,0.0012357556,0.108236864,0.0003071633,0.00047902451,0.0001363774,0.000281633,0.00017252119,0.010260073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989442,0.00029427317,0.00014705696,0.00024287667,0.00028458756,0.000087019995],"domain_scores_gemma":[0.99667066,0.0016612053,0.00038148428,0.0005226118,0.00057541305,0.0001886693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008083709,0.00041475255,0.00047824573,0.0009569911,0.0010121915,0.0015201913,0.0006677299,0.0007218668,0.00547094],"category_scores_gemma":[0.0047256523,0.00043536798,0.00072626566,0.00096762326,0.0023044464,0.0038930047,0.001888563,0.001146207,0.0007782269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006648932,0.000019319774,0.00048032144,0.0001476394,0.0000071310556,0.00035719454,0.00052068586,0.002090884,0.0058522276,0.9653847,0.00051723747,0.024556149],"study_design_scores_gemma":[0.0000118887165,0.000054888107,0.00020110849,0.000034776127,0.00000915727,0.0006521199,0.00016144392,0.011847552,0.0049475897,0.97222465,0.009833209,0.000021589673],"about_ca_topic_score_codex":0.0002169185,"about_ca_topic_score_gemma":0.00024680753,"teacher_disagreement_score":0.00547094,"about_ca_system_score_codex":0.000552097,"about_ca_system_score_gemma":0.0004490521,"threshold_uncertainty_score":0.018302083},"labels":[],"label_agreement":null},{"id":"W1854985511","doi":"10.1007/978-3-642-22321-1_15","title":"Enumeration and Decidable Properties of Automatic Sequences","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decidability; Enumeration; Recursively enumerable language; Class (philosophy); Computer science; Function (biology); Sequence (biology); Characterization (materials science); Combinatorics; Discrete mathematics; Mathematics; Algorithm; Artificial intelligence; Biology; Physics","score_opus":0.022701264572092743,"score_gpt":0.21484894919083253,"score_spread":0.1921476846187398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1854985511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24519765,0.0032666607,0.6046074,0.00288223,0.0003262357,0.00017126185,0.0012742227,0.0015510344,0.14072332],"genre_scores_gemma":[0.83505684,0.0015897262,0.13327625,0.00044497257,0.0005740656,0.0004465433,0.002430616,0.00048913085,0.025691729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971206,0.00081678055,0.00026353204,0.00067119073,0.00081715104,0.0003107338],"domain_scores_gemma":[0.98435867,0.013096254,0.00052891724,0.0011950738,0.00058052485,0.00024062877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020358039,0.000841914,0.00079312274,0.0016685113,0.0016956313,0.004611513,0.0024784917,0.0012617734,0.0059216954],"category_scores_gemma":[0.011225163,0.0011323511,0.0017157423,0.0024401057,0.004596876,0.009941346,0.0020284334,0.005195644,0.00076087756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006724274,0.00005795797,0.00032557998,0.00011401162,0.0000151816,0.00010506579,0.00038769512,0.003778008,0.001973827,0.9708746,0.0015375968,0.020763116],"study_design_scores_gemma":[0.000015783906,0.000009202422,0.00010966561,0.000020098903,0.00000840823,0.00007701935,0.000039083207,0.0072007114,0.00143262,0.9886672,0.00241172,0.000008520854],"about_ca_topic_score_codex":0.0010738893,"about_ca_topic_score_gemma":0.0014334557,"teacher_disagreement_score":0.0059216954,"about_ca_system_score_codex":0.0020173427,"about_ca_system_score_gemma":0.0013798664,"threshold_uncertainty_score":0.01981002},"labels":[],"label_agreement":null},{"id":"W1859305636","doi":"10.1016/j.ic.2017.08.014","title":"Syntactic complexity of suffix-free languages","year":2017,"lang":"en","type":"preprint","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowym Centrum Nauki; Narodowe Centrum Nauki","keywords":"Regular language; Cardinality (data modeling); Suffix; Semigroup; Alphabet; Discrete mathematics; Mathematics; Upper and lower bounds; State (computer science); Combinatorics; Automaton; Quotient; Computer science; Theoretical computer science; Algorithm; Linguistics","score_opus":0.032337632840797846,"score_gpt":0.2946075498334217,"score_spread":0.26226991699262386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1859305636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74536467,0.0015731594,0.17722009,0.009492397,0.00020723988,0.000075780445,0.0020688898,0.0005836927,0.06341411],"genre_scores_gemma":[0.9845271,0.00046419734,0.008077591,0.0003065712,0.00030916015,0.000074349446,0.00083629333,0.00013855271,0.005266329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962632,0.0009907095,0.00027624797,0.00063110224,0.001363294,0.00047541197],"domain_scores_gemma":[0.9787638,0.016469372,0.0011209467,0.00153668,0.0014617984,0.0006473463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021090163,0.0005357338,0.001284644,0.0021823863,0.0018686178,0.007305945,0.001798156,0.0019040847,0.0098081175],"category_scores_gemma":[0.01394542,0.00075154233,0.0013821813,0.0024928285,0.0040143444,0.014686656,0.0030254666,0.0034036718,0.00089589553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010581917,0.000045765573,0.0009587951,0.00011195636,0.000019652614,0.00012426275,0.0006325435,0.0047686845,0.001297361,0.98404145,0.0017843692,0.0061093373],"study_design_scores_gemma":[0.000007709124,0.0000053418585,0.00020504788,0.0000066115813,0.0000075641838,0.000039889594,0.000045852874,0.008602491,0.000353425,0.9901682,0.000548459,0.000009335167],"about_ca_topic_score_codex":0.0012297889,"about_ca_topic_score_gemma":0.00095297635,"teacher_disagreement_score":0.0098081175,"about_ca_system_score_codex":0.0027279297,"about_ca_system_score_gemma":0.0016552734,"threshold_uncertainty_score":0.032811463},"labels":[],"label_agreement":null},{"id":"W1880858962","doi":"10.1007/3-540-45526-4_5","title":"Metric Lexical Analysis","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Linguistics; Computer science; Mathematics; Philosophy","score_opus":0.015200702678385558,"score_gpt":0.24701855855411545,"score_spread":0.2318178558757299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1880858962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029275656,0.004939665,0.7173394,0.0034254685,0.0009841063,0.00015079105,0.0033938542,0.0028924146,0.23759861],"genre_scores_gemma":[0.6170206,0.0027939708,0.24857885,0.0010725849,0.0011203233,0.00032747546,0.008440691,0.0022659013,0.11837964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99816304,0.0004979053,0.00017598057,0.0005124613,0.000522334,0.00012823768],"domain_scores_gemma":[0.9983651,0.0004373218,0.00009229897,0.00047638183,0.0005308907,0.00009785974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087964773,0.00089389435,0.001263823,0.0041349498,0.001956636,0.00391708,0.0012348744,0.0009265385,0.027037594],"category_scores_gemma":[0.0048831557,0.0005215468,0.00104448,0.0048908517,0.0019472612,0.0069325953,0.0025764315,0.0017815704,0.0090353],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003860787,0.000022332122,0.00035800258,0.000111234825,0.000029095649,0.000052341908,0.00018474726,0.0008721082,0.0010483857,0.8674338,0.016928691,0.11292058],"study_design_scores_gemma":[0.0000042646,0.000011594573,0.00033020653,0.000029195744,0.000016672286,0.00010389874,0.00011696153,0.006668444,0.0007470355,0.9590343,0.032922056,0.000015337991],"about_ca_topic_score_codex":0.001442916,"about_ca_topic_score_gemma":0.001266504,"teacher_disagreement_score":0.027037594,"about_ca_system_score_codex":0.0014576092,"about_ca_system_score_gemma":0.00078647153,"threshold_uncertainty_score":0.09044975},"labels":[],"label_agreement":null},{"id":"W1884582486","doi":"10.1007/3-540-45995-2_13","title":"Weakly Iterated Block Products of Finite Monoids","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Iterated function; Mathematics; Block (permutation group theory); Operand; Variety (cybernetics); Wreath product; Product (mathematics); Mathematical proof; Associative property; Discrete mathematics; Algebra over a field; Pure mathematics; Arithmetic; Combinatorics","score_opus":0.01492536362326868,"score_gpt":0.21454599110122854,"score_spread":0.19962062747795986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1884582486","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5243304,0.0020527157,0.37301067,0.00021920537,0.00017118602,0.00011234901,0.00030198545,0.00056873163,0.09923271],"genre_scores_gemma":[0.8694013,0.0010406773,0.056230713,0.00006831665,0.00011664857,0.00018505137,0.00041501812,0.00024375612,0.072298385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925095,0.00018988036,0.00005978977,0.00011600082,0.00026356068,0.000119758435],"domain_scores_gemma":[0.9986852,0.0006210034,0.00011831503,0.00017985779,0.00024467421,0.00015092453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007876239,0.0005074189,0.0007455738,0.0008787459,0.001018514,0.0023510186,0.0006971665,0.00047388935,0.0043464783],"category_scores_gemma":[0.0016274204,0.00070186297,0.0008105522,0.0007589821,0.0015217107,0.0040809354,0.0016870559,0.0011129439,0.0010901785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010849477,0.000024392531,0.00037832695,0.00007847019,0.000016649308,0.00019002023,0.0008337768,0.0012800571,0.009560684,0.97730607,0.00056552683,0.009657583],"study_design_scores_gemma":[0.00002636289,0.00013410822,0.0007964901,0.000040054376,0.000050896888,0.0004030388,0.00030541484,0.012923707,0.011848252,0.95657575,0.016866539,0.000029457982],"about_ca_topic_score_codex":0.0006291107,"about_ca_topic_score_gemma":0.0008735961,"teacher_disagreement_score":0.0043464783,"about_ca_system_score_codex":0.0008275424,"about_ca_system_score_gemma":0.00050048303,"threshold_uncertainty_score":0.014540434},"labels":[],"label_agreement":null},{"id":"W1884798717","doi":"10.37236/218","title":"Trees and Meta-Fibonacci Sequences","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Fibonacci number; Recursion (computer science); Combinatorics; Mathematics; Interpretation (philosophy); Integer (computer science); Tree (set theory); Constraint (computer-aided design); Discrete mathematics; Algorithm; Computer science","score_opus":0.01110436457372468,"score_gpt":0.23296925799772986,"score_spread":0.22186489342400517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1884798717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47307578,0.0029389742,0.44619218,0.0021848455,0.00016448977,0.00008623737,0.0005136126,0.0005021202,0.074341714],"genre_scores_gemma":[0.8817705,0.0008627973,0.10346382,0.0005004951,0.00014595044,0.00019759676,0.00033901288,0.00011452088,0.012605356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940884,0.00019510339,0.000030802792,0.00011350646,0.00013314009,0.00011846164],"domain_scores_gemma":[0.9977581,0.0013313974,0.0003642515,0.00018196716,0.00022922369,0.00013522149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082498975,0.0005353678,0.00045877078,0.0019335635,0.0013837881,0.0021694729,0.0010467207,0.0015231712,0.0043478487],"category_scores_gemma":[0.0054902816,0.0003120322,0.0006677274,0.0020874548,0.0019216404,0.003060472,0.0007588985,0.0015404512,0.00085296604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009718566,0.000007677995,0.00047317464,0.000023453671,0.0000031927623,0.000046389803,0.000116642645,0.0035147665,0.0006813682,0.9883355,0.0006189007,0.00616926],"study_design_scores_gemma":[0.000004870556,0.0000057731877,0.00027014242,0.000020098718,0.0000031366312,0.0001307368,0.00007586219,0.030965907,0.0003642653,0.96560764,0.002541339,0.000010164149],"about_ca_topic_score_codex":0.0014381633,"about_ca_topic_score_gemma":0.003117405,"teacher_disagreement_score":0.0043478487,"about_ca_system_score_codex":0.0020539411,"about_ca_system_score_gemma":0.0009066115,"threshold_uncertainty_score":0.0149024725},"labels":[],"label_agreement":null},{"id":"W188877664","doi":"10.1016/s0021-8693(03)00394-6","title":"The finite basis problem for quasivarieties and pseudovarieties generated by regular semigroups","year":2003,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Mathematics; Basis (linear algebra); Pure mathematics; Algebra over a field; Geometry","score_opus":0.006853080843443468,"score_gpt":0.20430173458437226,"score_spread":0.1974486537409288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188877664","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53414965,0.0026730984,0.41649622,0.005322036,0.00029869625,0.00006818533,0.0004050122,0.00026486904,0.040322177],"genre_scores_gemma":[0.9449607,0.0010806067,0.040213216,0.000200606,0.00028325725,0.00007276174,0.00047851496,0.000116460695,0.012593835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986172,0.0005156444,0.00009559982,0.00022767499,0.00027799528,0.00026593366],"domain_scores_gemma":[0.9948096,0.0038625572,0.0002209954,0.00040833105,0.00029698986,0.0004014752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026609898,0.00048697137,0.0016280642,0.0012211249,0.002407521,0.005894328,0.0015013539,0.0020591698,0.005714088],"category_scores_gemma":[0.0060392697,0.000961818,0.0015281753,0.0014219596,0.004554397,0.012457941,0.0027414386,0.0039033995,0.0006179708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041454474,0.0000215315,0.00013576479,0.000032511285,0.000008665067,0.000053867443,0.0002751347,0.0011407513,0.00041917156,0.9936811,0.00044785673,0.0037421884],"study_design_scores_gemma":[0.000011136729,0.000005609247,0.000038593895,0.000007462371,0.0000039624833,0.000033248005,0.00013437385,0.00511506,0.00024341041,0.99374455,0.00065584097,0.000006655412],"about_ca_topic_score_codex":0.0012317019,"about_ca_topic_score_gemma":0.0012001393,"teacher_disagreement_score":0.005894328,"about_ca_system_score_codex":0.0014977753,"about_ca_system_score_gemma":0.00097564835,"threshold_uncertainty_score":0.019115508},"labels":[],"label_agreement":null},{"id":"W1894891660","doi":"10.1007/978-3-642-28332-1_42","title":"k-Automatic Sets of Rational Numbers","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decidability; Closure (psychology); Computer science; Set (abstract data type); Rational number; Discrete mathematics; Algorithm; Theoretical computer science; Mathematics; Programming language","score_opus":0.013988133444734424,"score_gpt":0.24152889745235093,"score_spread":0.2275407640076165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1894891660","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18251751,0.0038449708,0.12057608,0.0014254327,0.0011528984,0.00010619057,0.0007042999,0.0008143103,0.6888584],"genre_scores_gemma":[0.88774174,0.0018499829,0.034028374,0.00031796552,0.0005777286,0.0001858976,0.0007216369,0.00026829034,0.074308395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929905,0.000115869305,0.000052971933,0.00015196115,0.00026396854,0.00011610834],"domain_scores_gemma":[0.9991172,0.00042750983,0.000068769434,0.00014977469,0.00015784487,0.00007900997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039711164,0.0005610056,0.0005353157,0.0016063161,0.0018352029,0.0038352697,0.0010511195,0.0007366812,0.009183839],"category_scores_gemma":[0.0016743173,0.000619471,0.00090835936,0.0010587429,0.0029963057,0.004266502,0.001980826,0.001854119,0.0027119736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023734621,0.000008255862,0.00008706954,0.00005550079,0.0000054071957,0.000051772353,0.0002908935,0.00034162635,0.0011310095,0.9900525,0.0013214856,0.0066307015],"study_design_scores_gemma":[0.000011642732,0.000011943522,0.0002708487,0.000027873955,0.000007227207,0.00018421971,0.00012277297,0.0012238469,0.001052892,0.9813787,0.015692154,0.0000158086],"about_ca_topic_score_codex":0.00038442857,"about_ca_topic_score_gemma":0.00043937797,"teacher_disagreement_score":0.009183839,"about_ca_system_score_codex":0.0011985428,"about_ca_system_score_gemma":0.0005481121,"threshold_uncertainty_score":0.030723035},"labels":[],"label_agreement":null},{"id":"W1916296292","doi":"10.1002/rsa.20707","title":"The graph structure of a deterministic automaton chosen at random","year":2016,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Deterministic automaton; Alphabet; Digraph; Deterministic finite automaton; Two-way deterministic finite automaton; Büchi automaton; Strongly connected component; Automaton","score_opus":0.004889465677345986,"score_gpt":0.21578913220370488,"score_spread":0.2108996665263589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1916296292","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8527782,0.00013941247,0.13410623,0.0010188022,0.00005857174,0.00005740748,0.00046086236,0.0005021324,0.010878485],"genre_scores_gemma":[0.9860973,0.000041052343,0.01134598,0.00006578828,0.000011925,0.00004509707,0.00016508978,0.00003793406,0.0021899363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995353,0.00014622226,0.000023512139,0.00015455789,0.00006810247,0.00007233178],"domain_scores_gemma":[0.9977952,0.0012172911,0.00025078226,0.0002602061,0.00025876836,0.00021769086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041221592,0.00019519038,0.000365704,0.0008855416,0.0006948317,0.001137663,0.0006564389,0.0008338574,0.0030508863],"category_scores_gemma":[0.0025317182,0.00027109802,0.0003551734,0.00041750798,0.0013986789,0.001067197,0.0006956324,0.0005418773,0.00034644146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003697625,0.00009463559,0.0063354904,0.000116562056,0.000058236663,0.0011221981,0.0008914983,0.11628903,0.02573739,0.8338233,0.0024402232,0.012721624],"study_design_scores_gemma":[0.00007369173,0.000094731404,0.0017192366,0.000023260869,0.000029337996,0.00028140232,0.00015107589,0.64797366,0.0041504726,0.34321013,0.0022494758,0.00004352795],"about_ca_topic_score_codex":0.0019846815,"about_ca_topic_score_gemma":0.0016833865,"teacher_disagreement_score":0.0030508863,"about_ca_system_score_codex":0.0009940625,"about_ca_system_score_gemma":0.00051566,"threshold_uncertainty_score":0.010206282},"labels":[],"label_agreement":null},{"id":"W1923351770","doi":"10.37236/5583","title":"Words with many Palindrome Pair Factors","year":2015,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Palindrome; Property (philosophy); Conjecture; Mathematics; Class (philosophy); Combinatorics; Word (group theory); Product (mathematics); Discrete mathematics; Pure mathematics; Computer science; Artificial intelligence; Geometry","score_opus":0.013935371001254302,"score_gpt":0.23112483982238996,"score_spread":0.21718946882113566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1923351770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.905742,0.00082536903,0.06692346,0.0004728603,0.000078475925,0.000038235277,0.00016208137,0.00022482131,0.025532614],"genre_scores_gemma":[0.9746504,0.00015900389,0.019409131,0.000089511115,0.00007617698,0.000047463436,0.00016220415,0.000035875215,0.0053703063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952745,0.00007433872,0.00004506683,0.00018859381,0.000089500456,0.000075163305],"domain_scores_gemma":[0.9989913,0.0004378349,0.00019679623,0.00015068815,0.00010746595,0.0001158387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035217477,0.0004670998,0.00057228224,0.00058452174,0.0012403287,0.0015014433,0.0005247989,0.0008171214,0.0045339274],"category_scores_gemma":[0.001962655,0.00042885166,0.0006600061,0.00040926595,0.0017757363,0.0027651726,0.0010364549,0.0008128622,0.0005534168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033567526,0.000080850536,0.004404943,0.00023100455,0.000033811753,0.0012534247,0.0012496422,0.0031964127,0.028036986,0.94048744,0.0010269205,0.019662838],"study_design_scores_gemma":[0.000074178584,0.00023979646,0.0025014116,0.000068568654,0.00007012179,0.0022840367,0.0008833144,0.020003483,0.017138137,0.9412929,0.015385903,0.000058193295],"about_ca_topic_score_codex":0.00033051678,"about_ca_topic_score_gemma":0.0005727406,"teacher_disagreement_score":0.0045339274,"about_ca_system_score_codex":0.00062156667,"about_ca_system_score_gemma":0.0003019788,"threshold_uncertainty_score":0.015167475},"labels":[],"label_agreement":null},{"id":"W1927155547","doi":"10.1051/ita/2017004","title":"Interval exchanges, admissibility and branching Rauzy induction","year":2017,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Branching (polymer chemistry); Interval (graph theory); Mathematics; Mathematical economics; Chemistry; Combinatorics; Organic chemistry","score_opus":0.01511514287224976,"score_gpt":0.27387760225122476,"score_spread":0.258762459378975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1927155547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17799172,0.0005994812,0.7676135,0.0008630603,0.00010865761,0.00011066077,0.00022136577,0.0004339659,0.052057587],"genre_scores_gemma":[0.8706093,0.00032027814,0.11545503,0.0002466701,0.00011130461,0.00017154995,0.0002644613,0.00016713153,0.012654338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981198,0.00039034864,0.00015599815,0.0004725179,0.0005384385,0.00032289245],"domain_scores_gemma":[0.9955988,0.0020276757,0.00041568934,0.0010073925,0.0006438691,0.0003065902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020720994,0.00042381365,0.0006091357,0.0012963865,0.0017359053,0.002165179,0.0012003913,0.00092100794,0.0039728303],"category_scores_gemma":[0.0051081358,0.00040003884,0.0014091985,0.0009385018,0.00576371,0.005263875,0.0029250265,0.0035640227,0.0007275091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026293415,0.000013958524,0.0002941003,0.000017543543,0.0000036016913,0.000087603854,0.0003141763,0.0011719584,0.0020906639,0.99080175,0.00013960566,0.0050386973],"study_design_scores_gemma":[0.000021771091,0.000055209,0.00045442473,0.000024921503,0.000013630017,0.0002567774,0.0001934007,0.009471281,0.0065161693,0.97487664,0.008091129,0.00002449513],"about_ca_topic_score_codex":0.001000768,"about_ca_topic_score_gemma":0.0006822545,"teacher_disagreement_score":0.0039728303,"about_ca_system_score_codex":0.0015865784,"about_ca_system_score_gemma":0.00068329496,"threshold_uncertainty_score":0.013290405},"labels":[],"label_agreement":null},{"id":"W193481530","doi":"10.1007/978-3-642-19391-0_5","title":"On Language Decompositions and Primality","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Manitoba","funders":"","keywords":"Concatenation (mathematics); Computer science; Primality test; Formal language; Prime (order theory); Abstract family of languages; Regular language; Inverse; Theoretical computer science; Algorithm; Arithmetic; Mathematics; Programming language; Combinatorics; Second-generation programming language; Fifth-generation programming language; Automaton","score_opus":0.012018288405341882,"score_gpt":0.23968593960206275,"score_spread":0.22766765119672086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W193481530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048432827,0.0068827407,0.6606865,0.0050469534,0.0012232861,0.00010186263,0.0004271865,0.00064301846,0.27655563],"genre_scores_gemma":[0.6402948,0.006602438,0.25717333,0.0014864394,0.0018113779,0.0003717569,0.0009732775,0.0011998195,0.090086736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904364,0.00036065804,0.000065828644,0.00020895993,0.00017379565,0.00014704102],"domain_scores_gemma":[0.99805415,0.0011330182,0.00011080053,0.00031376316,0.00023533012,0.00015294716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014775314,0.0009550697,0.00095326785,0.0015186006,0.0018006242,0.003581718,0.0009422823,0.00093552936,0.013076051],"category_scores_gemma":[0.0038703321,0.0010964302,0.0015300448,0.0015997445,0.004586332,0.0112940995,0.0041198875,0.005348568,0.0026342524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013788586,0.000006563424,0.000028305565,0.000031495427,0.000002931532,0.000023219949,0.00017462893,0.00025025103,0.00024147033,0.9901659,0.0012093812,0.00785204],"study_design_scores_gemma":[0.000003474434,0.0000032551159,0.000018404538,0.000014468857,0.0000033807364,0.000041102143,0.000034815337,0.00057743257,0.00014114029,0.9947296,0.0044301697,0.000002807496],"about_ca_topic_score_codex":0.00039547036,"about_ca_topic_score_gemma":0.00039181666,"teacher_disagreement_score":0.013076051,"about_ca_system_score_codex":0.0013500982,"about_ca_system_score_gemma":0.00058096816,"threshold_uncertainty_score":0.04374373},"labels":[],"label_agreement":null},{"id":"W1938002898","doi":"10.5555/1231159.1231161","title":"Automata Recognizing No Words: A Statistical Approach","year":2006,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Deterministic finite automaton; Word (group theory); Mathematics; Nondeterministic finite automaton; Deterministic automaton; Probabilistic automaton; Automaton; Discrete mathematics; Probabilistic logic; Finite-state machine; Alphabet; Combinatorics; Algorithm; Computer science; Theoretical computer science; Automata theory; Statistics","score_opus":0.010080715382548922,"score_gpt":0.21558706600859373,"score_spread":0.2055063506260448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1938002898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036584564,0.0006578931,0.9584846,0.0008805266,0.000078938174,0.000046714846,0.00013914752,0.00040414472,0.0027235409],"genre_scores_gemma":[0.8929885,0.0009835728,0.10149737,0.0006568941,0.0007360542,0.0003863831,0.00044507717,0.00015282628,0.002153375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98938483,0.004374574,0.00051180413,0.0030222998,0.002312628,0.00039393152],"domain_scores_gemma":[0.8508591,0.12473597,0.0062681893,0.01274012,0.0043371404,0.0010594404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01178456,0.0008765658,0.0019145291,0.0043076347,0.0015508345,0.0040610516,0.0028874963,0.002162185,0.0026657437],"category_scores_gemma":[0.09727647,0.00084810617,0.0014494613,0.001966347,0.0073509016,0.008719517,0.0028393257,0.0031668355,0.00071583356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017697326,0.000086599175,0.015692059,0.00029662185,0.00040730464,0.00041548544,0.0005503075,0.20617826,0.0030118797,0.71125805,0.0017602786,0.0601663],"study_design_scores_gemma":[0.000012887516,0.00008877355,0.001830615,0.000029685232,0.0000511509,0.00034497876,0.000109604916,0.4093569,0.0013802495,0.585027,0.0017070555,0.000061080464],"about_ca_topic_score_codex":0.0017733318,"about_ca_topic_score_gemma":0.0009426115,"teacher_disagreement_score":0.01178456,"about_ca_system_score_codex":0.0017328572,"about_ca_system_score_gemma":0.0012605987,"threshold_uncertainty_score":0.06232339},"labels":[],"label_agreement":null},{"id":"W194250784","doi":"10.1007/978-0-387-21652-2_3","title":"Pisot and Salem Numbers","year":2002,"lang":"en","type":"book-chapter","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Integer (computer science); Algebraic number; Class (philosophy); Combinatorics; Conjugate; Monic polynomial; Discrete mathematics; Polynomial; Computer science; Mathematical analysis","score_opus":0.013497119671924209,"score_gpt":0.18868054042207846,"score_spread":0.17518342075015425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194250784","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005429883,0.0074618724,0.020889916,0.0015334756,0.0013164595,0.000032209246,0.000085991545,0.000134202,0.96311593],"genre_scores_gemma":[0.18999115,0.012613848,0.022013098,0.0010546796,0.0019167353,0.00018311526,0.0002725867,0.00024733992,0.7717074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997651,0.000047904647,0.000009463512,0.000034531582,0.00011698639,0.000026013133],"domain_scores_gemma":[0.99980325,0.00009690663,0.000011041946,0.00003143039,0.000041790627,0.000015531492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028526652,0.00066875113,0.0006160238,0.0015705685,0.0016156913,0.0023703917,0.00052352785,0.00063029176,0.018377123],"category_scores_gemma":[0.0009723646,0.00030767062,0.0003162885,0.0020679424,0.0026043504,0.0037209946,0.0009182277,0.001913375,0.005190572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033047609,0.0000025731908,0.000009279451,0.000019752393,5.0542394e-7,0.000012168934,0.0000860963,0.000067336834,0.000085501844,0.9852191,0.005898367,0.008595896],"study_design_scores_gemma":[0.0000047143344,0.000009085194,0.00006158684,0.000028147584,0.0000024717217,0.00011179025,0.00006845871,0.00036279677,0.00025599246,0.7515522,0.24753807,0.000004654903],"about_ca_topic_score_codex":0.00070346345,"about_ca_topic_score_gemma":0.0011567352,"teacher_disagreement_score":0.018377123,"about_ca_system_score_codex":0.0015581502,"about_ca_system_score_gemma":0.00083693565,"threshold_uncertainty_score":0.0614776},"labels":[],"label_agreement":null},{"id":"W1943597037","doi":"10.3233/fi-2012-670","title":"State Complexity of Combined Operations with Union, Intersection, Star and Reversal","year":2012,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Intersection (aeronautics); Star (game theory); State (computer science); Regular language; Mathematics; Combined operations; Computer science; Discrete mathematics; Combinatorics; Algorithm; Theoretical computer science; Automaton; Political science; Engineering","score_opus":0.019345864440645868,"score_gpt":0.23070205014580658,"score_spread":0.2113561857051607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943597037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7881254,0.00052978954,0.19549927,0.00086620275,0.00008048707,0.0002271623,0.0010482722,0.0012985868,0.01232491],"genre_scores_gemma":[0.967839,0.00017663525,0.027958972,0.0000564411,0.00004402165,0.00020404227,0.0006895289,0.0002098884,0.002821393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947831,0.0008570055,0.00049951824,0.0010292685,0.001496053,0.0013349908],"domain_scores_gemma":[0.96838164,0.023212492,0.0021035876,0.0037484416,0.0015570255,0.0009968508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023116318,0.0007715461,0.0012470227,0.0012601118,0.0015032013,0.005902084,0.0023981335,0.0013873734,0.01241292],"category_scores_gemma":[0.017311333,0.00062571926,0.0018225219,0.0016187053,0.0028826196,0.01338684,0.003428007,0.0028533484,0.0009158764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006700809,0.0011275461,0.019275365,0.0013752229,0.0003906779,0.000991241,0.0020095776,0.30473685,0.04558984,0.49098474,0.005417406,0.1214007],"study_design_scores_gemma":[0.00017425035,0.00058201887,0.0024589223,0.0000668406,0.0003056378,0.0004343148,0.00072146306,0.7066734,0.042449597,0.24234731,0.0036343553,0.00015189749],"about_ca_topic_score_codex":0.003115294,"about_ca_topic_score_gemma":0.0032783349,"teacher_disagreement_score":0.01241292,"about_ca_system_score_codex":0.0027371738,"about_ca_system_score_gemma":0.0036333029,"threshold_uncertainty_score":0.041525304},"labels":[],"label_agreement":null},{"id":"W1947634890","doi":"10.37236/5483","title":"Avoidability Index for Binary Patterns with Reversal","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; Universities Space Research Association","keywords":"Index (typography); Binary number; Mathematics; Computer science; World Wide Web; Arithmetic","score_opus":0.007817291661901503,"score_gpt":0.23007325315529695,"score_spread":0.22225596149339544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1947634890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6531319,0.00086161983,0.19848941,0.0014627393,0.00041081774,0.00020685227,0.0029640817,0.0016872399,0.14078534],"genre_scores_gemma":[0.9282406,0.00037372502,0.045325868,0.00030721942,0.00023971607,0.00023361368,0.0019761478,0.00038268472,0.022920474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987954,0.00012080698,0.00016497166,0.00031582938,0.00032381926,0.00027910972],"domain_scores_gemma":[0.9968573,0.00116405,0.00040970926,0.0006291357,0.00042374872,0.00051602186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063613086,0.0005648758,0.0006530462,0.0019159756,0.001595758,0.0029053285,0.0011543026,0.0009137187,0.013542286],"category_scores_gemma":[0.0037717188,0.00035626112,0.00083219283,0.0014663027,0.0016776139,0.0039283386,0.0021264812,0.0019683973,0.0022187785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042620618,0.00011201298,0.0022334154,0.00019908063,0.000027062584,0.0005690732,0.0008840391,0.0031133343,0.01583842,0.943182,0.0043829354,0.029032547],"study_design_scores_gemma":[0.000048058082,0.00010946499,0.0010956081,0.000042972708,0.00003722189,0.00092375185,0.00026922926,0.01199925,0.007489879,0.9602607,0.01767534,0.00004852016],"about_ca_topic_score_codex":0.00077434286,"about_ca_topic_score_gemma":0.0007552566,"teacher_disagreement_score":0.013542286,"about_ca_system_score_codex":0.0013013831,"about_ca_system_score_gemma":0.00076664303,"threshold_uncertainty_score":0.045303464},"labels":[],"label_agreement":null},{"id":"W1953189605","doi":"10.1023/a:1025712521140","title":"Undecidability of the Free Adjoint Construction","year":2003,"lang":"en","type":"article","venue":"Applied Categorical Structures","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Saint Mary's University","funders":"","keywords":"Undecidable problem; Abacus (architecture); Halting problem; Equivalence relation; Relation (database); Mathematics; Theory of computation; Equivalence (formal languages); Discrete mathematics; Combinatorics; Computer science; Decidability; Algorithm","score_opus":0.007395653299448827,"score_gpt":0.19286012096342933,"score_spread":0.1854644676639805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1953189605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4034488,0.0012172901,0.5161171,0.012987454,0.000722878,0.00023767138,0.0015450174,0.004163682,0.059559967],"genre_scores_gemma":[0.94917625,0.0003901923,0.035958014,0.0011302962,0.00034545525,0.00018504841,0.0015265476,0.00059907703,0.010689144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99381644,0.0016864428,0.00038965477,0.0014736879,0.0015134593,0.0011202228],"domain_scores_gemma":[0.96003103,0.030563798,0.0009911386,0.0045366213,0.0027758612,0.0011015844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051727686,0.0008101707,0.0011761895,0.0011093762,0.0033209375,0.006381242,0.0036988754,0.0033613082,0.0074409666],"category_scores_gemma":[0.01841518,0.0015408957,0.0026172926,0.0012262604,0.0074472795,0.017990055,0.0048029693,0.010443411,0.0010377296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002899473,0.00021331653,0.0016805694,0.00021973308,0.000046219073,0.00028976152,0.0011293418,0.0077618263,0.0032356,0.96259046,0.00540976,0.017133487],"study_design_scores_gemma":[0.00005398409,0.000017757367,0.00020461551,0.000017273236,0.000031517244,0.00008890902,0.0001574743,0.013648205,0.0028730694,0.9804519,0.002432465,0.000022749133],"about_ca_topic_score_codex":0.004488393,"about_ca_topic_score_gemma":0.0038555833,"teacher_disagreement_score":0.0074409666,"about_ca_system_score_codex":0.0030661821,"about_ca_system_score_gemma":0.0042688423,"threshold_uncertainty_score":0.027356565},"labels":[],"label_agreement":null},{"id":"W1960513303","doi":"10.1007/978-3-642-39310-5_18","title":"Shortest Repetition-Free Words Accepted by Automata","year":2013,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Word (group theory); Repetition (rhetorical device); Automaton; Discrete mathematics; Combinatorics; Upper and lower bounds; Mathematics; Computer science; Arithmetic; Theoretical computer science; Linguistics","score_opus":0.010964330751629505,"score_gpt":0.2452820866756373,"score_spread":0.2343177559240078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1960513303","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7288839,0.000755255,0.23377551,0.001519164,0.0004317221,0.00011983867,0.0006615227,0.002402318,0.03145073],"genre_scores_gemma":[0.9361528,0.0002538727,0.046583463,0.0002975169,0.00027658674,0.00012435879,0.0006651704,0.0005235506,0.015122648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776065,0.0004898253,0.0002585342,0.0005495109,0.0006013847,0.0003400913],"domain_scores_gemma":[0.99181855,0.004453812,0.000698869,0.0010584441,0.0013516627,0.0006187032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009824941,0.0005984226,0.0007750737,0.00088589685,0.0015859983,0.003167174,0.0015285377,0.0013618519,0.004434424],"category_scores_gemma":[0.0069772755,0.00067519455,0.0009886266,0.00096726324,0.0016507171,0.0038865767,0.0017132685,0.0016660001,0.0016309058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017445642,0.0002019388,0.004408132,0.0005404024,0.00014951263,0.0017300629,0.005413882,0.017327692,0.067725234,0.82549214,0.007484093,0.06778234],"study_design_scores_gemma":[0.00010316111,0.00012267391,0.00043820546,0.00003512837,0.00007767258,0.00045365616,0.0004156134,0.02895271,0.010012291,0.95165366,0.007677656,0.000057646652],"about_ca_topic_score_codex":0.00048272638,"about_ca_topic_score_gemma":0.00083506,"teacher_disagreement_score":0.004434424,"about_ca_system_score_codex":0.0007699405,"about_ca_system_score_gemma":0.000914927,"threshold_uncertainty_score":0.014834642},"labels":[],"label_agreement":null},{"id":"W196301943","doi":"10.1007/978-3-642-39310-5_16","title":"Syntactic Complexity of ${\\mathcal R}$ - and ${\\mathcal J}$ -Trivial Regular Languages","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cardinality (data modeling); Class (philosophy); Complexity class; Regular language; Discrete mathematics; Computer science; Combinatorics; Function (biology); Mathematics; Time complexity; Theoretical computer science; Artificial intelligence; Automaton","score_opus":0.019651194461230665,"score_gpt":0.24759844860240657,"score_spread":0.2279472541411759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W196301943","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7050405,0.0013441003,0.10869422,0.00698611,0.00026705628,0.00009198406,0.0013377791,0.0007670326,0.17547123],"genre_scores_gemma":[0.97307116,0.00041787868,0.011783124,0.00034706108,0.00026921366,0.00010007935,0.00100272,0.00035099863,0.01265766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751174,0.00054048223,0.0001783309,0.00042638104,0.0008464935,0.00049645425],"domain_scores_gemma":[0.9927331,0.0051602162,0.00049174787,0.000573249,0.0006726049,0.000368953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012346485,0.00048925466,0.00098545,0.001498986,0.00285437,0.006537388,0.0022154863,0.0015643485,0.01277942],"category_scores_gemma":[0.006583519,0.000941042,0.0018841425,0.0017136543,0.004738136,0.010916616,0.0028533102,0.004609887,0.0015006084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052787047,0.00002600405,0.00037688756,0.000050069317,0.000008899697,0.000069598274,0.00050108414,0.0010502043,0.0007459446,0.991751,0.0013582549,0.004009213],"study_design_scores_gemma":[0.0000129238015,0.000008499158,0.00041025135,0.000012913576,0.000013463809,0.00008362465,0.00015785565,0.004357497,0.00067797594,0.9926717,0.001569689,0.000023566774],"about_ca_topic_score_codex":0.0021419975,"about_ca_topic_score_gemma":0.0019547048,"teacher_disagreement_score":0.01277942,"about_ca_system_score_codex":0.0028096053,"about_ca_system_score_gemma":0.0015389902,"threshold_uncertainty_score":0.04275137},"labels":[],"label_agreement":null},{"id":"W1963731267","doi":"10.1016/j.tcs.2009.09.037","title":"On a special class of primitive words","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Class (philosophy); Mathematics; Algebra over a field; Computer science; Linguistics; Combinatorics; Pure mathematics; Artificial intelligence; Philosophy","score_opus":0.007007482571960792,"score_gpt":0.2378683292514425,"score_spread":0.2308608466794817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963731267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6152295,0.0021620085,0.23810633,0.0025394338,0.0007913334,0.00010910261,0.00066970533,0.0006875149,0.13970506],"genre_scores_gemma":[0.9517167,0.0008529005,0.020318016,0.00036709214,0.000835041,0.00013037398,0.00055735064,0.00018064815,0.02504186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991836,0.00013754045,0.000043587155,0.00024284013,0.00019147719,0.0002009224],"domain_scores_gemma":[0.99636143,0.002181092,0.00027258944,0.00049926987,0.00030197398,0.00038371317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007211311,0.0006985269,0.0014306887,0.0017075009,0.0031581572,0.0034847918,0.0012489989,0.0018178758,0.009284815],"category_scores_gemma":[0.0038277332,0.00066527165,0.0012893043,0.0019090954,0.003590933,0.0074109933,0.002548556,0.0023637388,0.0010821898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004121069,0.000012056607,0.00021309018,0.000033714605,0.0000058116857,0.00016202855,0.00024878196,0.00026476846,0.0008793371,0.9934976,0.0008311735,0.003810374],"study_design_scores_gemma":[0.000016596592,0.000016558712,0.00021640908,0.000012864026,0.00000935552,0.00029636567,0.00007523156,0.0027749594,0.00044218617,0.99306446,0.0030644932,0.000010622476],"about_ca_topic_score_codex":0.00058839424,"about_ca_topic_score_gemma":0.0004945721,"teacher_disagreement_score":0.009284815,"about_ca_system_score_codex":0.0010619619,"about_ca_system_score_gemma":0.0006845536,"threshold_uncertainty_score":0.031060815},"labels":[],"label_agreement":null},{"id":"W1964707275","doi":"10.4204/eptcs.63.29","title":"The Critical Exponent is Computable for Automatic Sequences","year":2011,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Tulane University","keywords":"Exponent; Infimum and supremum; Critical exponent; Mathematics; Constant (computer programming); Computation; Sequence (biology); Rational number; Discrete mathematics; Combinatorics; Computer science; Algorithm; Geometry","score_opus":0.013787653203243074,"score_gpt":0.2557944034789316,"score_spread":0.24200675027568855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964707275","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75839216,0.0013581279,0.20022166,0.00075880444,0.000108953995,0.00006179853,0.0003950795,0.0010269311,0.037676558],"genre_scores_gemma":[0.97912127,0.00030965635,0.018096058,0.00006319523,0.00008139508,0.00003869868,0.00016799942,0.00013567807,0.0019861523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993432,0.00008741865,0.00005996867,0.00019711693,0.00019121157,0.00012114964],"domain_scores_gemma":[0.9951018,0.0031926082,0.0003629092,0.00057335105,0.000562248,0.00020705764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000634506,0.00058725936,0.00057669857,0.0019172016,0.00073142396,0.0027366898,0.00047976966,0.00044087786,0.003067936],"category_scores_gemma":[0.009730497,0.0003334682,0.0003647354,0.0012628272,0.002320261,0.0046038963,0.0013412022,0.0014790933,0.0006331568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038549837,0.00004954513,0.0062176986,0.00029772814,0.000024840641,0.0004639947,0.0010684225,0.008299816,0.022113124,0.90568817,0.0025433796,0.05284767],"study_design_scores_gemma":[0.000043676602,0.00004607866,0.0014136261,0.000090604946,0.000028718268,0.00035324224,0.0001586422,0.040941928,0.022368858,0.92843693,0.006066687,0.000050881998],"about_ca_topic_score_codex":0.00081204384,"about_ca_topic_score_gemma":0.00083770714,"teacher_disagreement_score":0.003067936,"about_ca_system_score_codex":0.0014161168,"about_ca_system_score_gemma":0.0007446354,"threshold_uncertainty_score":0.010274708},"labels":[],"label_agreement":null},{"id":"W1964943343","doi":"10.1016/j.tcs.2004.12.024","title":"The Thue–Morse word contains circular <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mn>5</mml:mn><mml:mo>/</mml:mo><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mo>+</mml:mo></mml:mrow></mml:msup></mml:math> power free words of every length","year":2005,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Word (group theory); Morse code; Mathematics; Scroll; Computer science; Geometry; Theology; Philosophy","score_opus":0.012849458332719037,"score_gpt":0.23156772215589969,"score_spread":0.21871826382318066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964943343","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037940897,0.0019957235,0.18312244,0.009175359,0.015713131,0.00024838667,0.007929038,0.008464362,0.73541063],"genre_scores_gemma":[0.33088067,0.001421346,0.06296286,0.0019358012,0.0025252374,0.00025098346,0.0077648424,0.008218423,0.58403987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996531,0.000065967186,0.00004054593,0.000093086855,0.00008919956,0.000058059315],"domain_scores_gemma":[0.9987276,0.00046756252,0.00007685574,0.00019432478,0.0004080499,0.00012561635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046109266,0.000809167,0.0006153293,0.0010132142,0.0018915938,0.0021600565,0.0005673776,0.0010049231,0.1335784],"category_scores_gemma":[0.0027130316,0.00041457452,0.00051186694,0.00095842965,0.0012320393,0.004000869,0.0012967563,0.0016114679,0.073163666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002997336,0.00003269738,0.00037430308,0.00029128534,0.000015671028,0.00044798618,0.0015081551,0.00019490611,0.0076861535,0.70696104,0.21273668,0.06945135],"study_design_scores_gemma":[0.00001588161,0.000062753235,0.00037474543,0.00007981309,0.000008249201,0.00044104035,0.00039499276,0.0005501912,0.0047017355,0.10248138,0.8908553,0.000033945027],"about_ca_topic_score_codex":0.001154136,"about_ca_topic_score_gemma":0.0012418063,"teacher_disagreement_score":0.1335784,"about_ca_system_score_codex":0.00086115504,"about_ca_system_score_gemma":0.0005174665,"threshold_uncertainty_score":0.4468643},"labels":[],"label_agreement":null},{"id":"W1965168466","doi":"10.1007/s002330010136","title":"Absolutely annihilator-flat monoids","year":2002,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Annihilator; Mathematics; Monoid; Flatness (cosmology); Pure mathematics; Ideal (ethics); Combinatorics; Algebra over a field; Philosophy; Physics","score_opus":0.013389941409006364,"score_gpt":0.20266833429842615,"score_spread":0.18927839288941978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965168466","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5754603,0.0017860654,0.33573192,0.0013952459,0.00074686686,0.00013016482,0.0007649963,0.001504827,0.08247959],"genre_scores_gemma":[0.95314497,0.00037671626,0.01744044,0.00018039205,0.00023133724,0.00008392755,0.0003318997,0.00011526741,0.028095098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844825,0.00032000957,0.00014765593,0.0003793174,0.00035740557,0.00034725253],"domain_scores_gemma":[0.99620134,0.0014526893,0.00032472942,0.0005377678,0.00076829264,0.000715319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019495015,0.00077689055,0.0008789213,0.0026148367,0.0030656545,0.0032860397,0.0010193276,0.0010364595,0.007688389],"category_scores_gemma":[0.0041543497,0.0009398055,0.000742825,0.001258088,0.0026521022,0.0076020476,0.0031700705,0.0019219614,0.0012270742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010526711,0.000028030308,0.00040269236,0.000034744637,0.000005797215,0.00021508407,0.0006486623,0.00027729454,0.0030432607,0.9881342,0.0009073341,0.0061976453],"study_design_scores_gemma":[0.000035172343,0.00006675263,0.0006499064,0.000019383522,0.000028548346,0.00055564207,0.00028990436,0.0031200282,0.0038984367,0.98336154,0.007931307,0.000043384356],"about_ca_topic_score_codex":0.0006183441,"about_ca_topic_score_gemma":0.0007017332,"teacher_disagreement_score":0.007688389,"about_ca_system_score_codex":0.0010119949,"about_ca_system_score_gemma":0.0007751616,"threshold_uncertainty_score":0.025720298},"labels":[],"label_agreement":null},{"id":"W1965205248","doi":"10.1016/j.disc.2007.03.009","title":"p-adic valuations and k-regular sequences","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.016861409466790607,"score_gpt":0.26977123419743393,"score_spread":0.25290982473064333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965205248","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6571923,0.003771318,0.21226199,0.003172054,0.0006888005,0.00007622624,0.00051418185,0.0004132649,0.12190999],"genre_scores_gemma":[0.9790146,0.0006704433,0.009042003,0.00012805975,0.00018421303,0.000037753005,0.00012534927,0.000031973104,0.010765643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924076,0.00016913215,0.00007833665,0.0002302473,0.00015660108,0.00012481792],"domain_scores_gemma":[0.9972836,0.0016209629,0.00028718298,0.00024647903,0.0002443625,0.00031738062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091460755,0.0006383668,0.0008083678,0.0015144013,0.0016275443,0.004671089,0.0008029791,0.00094145985,0.0052399775],"category_scores_gemma":[0.0035334206,0.0005942332,0.00069164496,0.0018806083,0.004883994,0.0065827803,0.0019507656,0.0023518596,0.0007542385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004952588,0.000016031372,0.00019212833,0.000037442293,0.0000064615215,0.0001462847,0.00033001215,0.00060167385,0.00073166005,0.99311286,0.00028865677,0.004487228],"study_design_scores_gemma":[0.00001621481,0.000016100661,0.00012344574,0.000009114492,0.000006430472,0.00023008617,0.00011583457,0.0013321262,0.00041307585,0.9958786,0.0018494626,0.000009573765],"about_ca_topic_score_codex":0.0002926814,"about_ca_topic_score_gemma":0.00027397962,"teacher_disagreement_score":0.0052399775,"about_ca_system_score_codex":0.0011315116,"about_ca_system_score_gemma":0.00046854798,"threshold_uncertainty_score":0.017529428},"labels":[],"label_agreement":null},{"id":"W1965229141","doi":"10.3115/1072228.1072229","title":"Disambiguation of finite-state transducers","year":2002,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Transducer; Computer science; Finite state; State (computer science); Acoustics; Speech recognition; Algorithm; Physics","score_opus":0.01895701556607204,"score_gpt":0.2014175913445515,"score_spread":0.18246057577847946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965229141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056084823,0.00067478843,0.933549,0.00020605259,0.00027440253,0.00011090089,0.00008966641,0.0025488688,0.0064614676],"genre_scores_gemma":[0.48950925,0.0005314312,0.50226545,0.00034302857,0.000168414,0.00013113832,0.0005475218,0.00067606044,0.005827656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957628,0.0009603011,0.00039375285,0.0014730017,0.0010287672,0.00038134953],"domain_scores_gemma":[0.99574184,0.0022255995,0.00027739056,0.0010413605,0.0005070566,0.0002067548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024779602,0.0007368055,0.0012681972,0.0016429683,0.0024956095,0.0031119995,0.0015746542,0.0014445212,0.0037366357],"category_scores_gemma":[0.008232912,0.00081732316,0.0016118062,0.0013247429,0.00396574,0.005287124,0.0045113065,0.0018764249,0.0017572221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085246353,0.00015733103,0.0031418381,0.0005739266,0.00012482662,0.00086289545,0.0026955623,0.051238958,0.05504959,0.5587813,0.0027668087,0.32375443],"study_design_scores_gemma":[0.00005828019,0.00014297159,0.0008500579,0.00013106067,0.00011613292,0.0006290372,0.00088510895,0.124158025,0.11925477,0.7219418,0.031675424,0.00015733972],"about_ca_topic_score_codex":0.0008314783,"about_ca_topic_score_gemma":0.0011420094,"teacher_disagreement_score":0.0037366357,"about_ca_system_score_codex":0.0009335792,"about_ca_system_score_gemma":0.0015971488,"threshold_uncertainty_score":0.013104856},"labels":[],"label_agreement":null},{"id":"W1965233852","doi":"10.1007/s00012-008-2054-4","title":"Centrality in Rees-Sushkevich varieties","year":2008,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Isomorphism (crystallography); Exponent; Center (category theory); Intersection (aeronautics); Discrete mathematics","score_opus":0.012981894218415547,"score_gpt":0.19305694504362014,"score_spread":0.18007505082520459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965233852","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8612356,0.0016139075,0.08579511,0.0017881918,0.000102097656,0.000031537686,0.00024013357,0.00019621705,0.048997182],"genre_scores_gemma":[0.98949206,0.00026537816,0.003217576,0.000053697684,0.00008156915,0.000022612774,0.00006550729,0.00002652849,0.0067749335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990313,0.0002630114,0.000044079214,0.0002475358,0.00022543571,0.00018867411],"domain_scores_gemma":[0.9938769,0.0036029334,0.0006492154,0.000301467,0.00058933534,0.0009801935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013683757,0.00033956376,0.0013320378,0.0030714192,0.002982734,0.004759614,0.0011015828,0.0009238085,0.00559002],"category_scores_gemma":[0.0062593613,0.0003995327,0.00046527694,0.0029720033,0.0045768027,0.006565188,0.0022096068,0.0013219846,0.00051182474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037303096,0.000006597946,0.00041155587,0.000013697689,0.000003876392,0.00004387342,0.00036646432,0.00051442836,0.00040676672,0.99652976,0.00023347566,0.0014322852],"study_design_scores_gemma":[0.000026615096,0.000009284847,0.00041204836,0.0000067301585,0.0000136044255,0.00009539326,0.00025583472,0.0031018814,0.000450847,0.99388945,0.0017273439,0.000010957953],"about_ca_topic_score_codex":0.001970829,"about_ca_topic_score_gemma":0.0018747252,"teacher_disagreement_score":0.00559002,"about_ca_system_score_codex":0.0019526501,"about_ca_system_score_gemma":0.00085960596,"threshold_uncertainty_score":0.01870048},"labels":[],"label_agreement":null},{"id":"W1965531865","doi":"10.1142/s0129054105003364","title":"RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Acadia University","funders":"","keywords":"Decidability; Unary operation; Mathematics; Regular language; Context (archaeology); Set (abstract data type); Discrete mathematics; Context-free language; Combinatorics; Computer science; Automaton; Theoretical computer science; Programming language; Artificial intelligence; Rule-based machine translation","score_opus":0.01234376465392803,"score_gpt":0.30105796547958724,"score_spread":0.28871420082565924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965531865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5341905,0.00053462485,0.45050403,0.0012509455,0.00006002021,0.00015482421,0.0009356995,0.0013138814,0.011055556],"genre_scores_gemma":[0.9365505,0.00032325948,0.054603677,0.00020452724,0.000056626966,0.00022619595,0.0016025451,0.00021340998,0.0062192236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967625,0.0005480944,0.00033536335,0.0010808986,0.0006679051,0.000605267],"domain_scores_gemma":[0.9856397,0.009448631,0.0010495345,0.0022231808,0.00076155673,0.00087749364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028397916,0.0005608356,0.0008453159,0.0012848293,0.0016392347,0.0040454655,0.002099799,0.0013140147,0.0037440672],"category_scores_gemma":[0.010804231,0.0010047699,0.0024294008,0.0009735943,0.004072665,0.010983808,0.0036071215,0.0045076786,0.00040291925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043670562,0.00024713384,0.004376527,0.00022672913,0.00009768271,0.0006241477,0.0017474407,0.04103273,0.012629226,0.91263306,0.001267715,0.024680937],"study_design_scores_gemma":[0.000055370427,0.000054868015,0.00054578343,0.000042981297,0.00003544076,0.00024156067,0.00042577714,0.075545296,0.013437827,0.90685105,0.0027273027,0.00003676434],"about_ca_topic_score_codex":0.001998192,"about_ca_topic_score_gemma":0.0016796195,"teacher_disagreement_score":0.0040454655,"about_ca_system_score_codex":0.0022243846,"about_ca_system_score_gemma":0.0015136517,"threshold_uncertainty_score":0.01613915},"labels":[],"label_agreement":null},{"id":"W1965900383","doi":"10.1142/s0219498809003631","title":"FINITELY GENERATED LIMIT VARIETIES OF APERIODIC MONOIDS WITH CENTRAL IDEMPOTENTS","year":2009,"lang":"en","type":"article","venue":"Journal of Algebra and Its Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Aperiodic graph; Mathematics; Variety (cybernetics); Limit (mathematics); Finitely-generated abelian group; Pure mathematics; Monoid; Combinatorics; Mathematical analysis","score_opus":0.008782462088680417,"score_gpt":0.21014792739494234,"score_spread":0.20136546530626193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965900383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.819174,0.0040462655,0.12894437,0.0007873648,0.00032410712,0.00009193984,0.00031647208,0.0002445811,0.04607093],"genre_scores_gemma":[0.968501,0.00063343585,0.024084372,0.000077543256,0.00012673561,0.00008194638,0.00019643016,0.00002764289,0.006270884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990559,0.0001853897,0.000101118705,0.00023547199,0.0002840746,0.00013802084],"domain_scores_gemma":[0.99831223,0.00066191657,0.00022704071,0.00018236433,0.00031955185,0.00029691888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013893084,0.00042663876,0.0006076819,0.0023772223,0.0020291563,0.003869275,0.0008154969,0.00064114627,0.0017906893],"category_scores_gemma":[0.0024542895,0.00043220588,0.0008449088,0.0012495511,0.004146171,0.005338904,0.0022157128,0.001330567,0.00029388038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007842784,0.000028061226,0.0014991215,0.000073475596,0.000022930291,0.0005928566,0.0013468933,0.00044782952,0.0033725265,0.98657864,0.00030454437,0.005654629],"study_design_scores_gemma":[0.000054484255,0.00008155315,0.0022176155,0.000060942068,0.000049836613,0.0016650661,0.00123921,0.0027177257,0.007822658,0.9688854,0.015147093,0.000058436577],"about_ca_topic_score_codex":0.0002565951,"about_ca_topic_score_gemma":0.00025862877,"teacher_disagreement_score":0.003869275,"about_ca_system_score_codex":0.000946625,"about_ca_system_score_gemma":0.00040190492,"threshold_uncertainty_score":0.0073474646},"labels":[],"label_agreement":null},{"id":"W1966076725","doi":"10.4204/eptcs.31.21","title":"Nondeterministic State Complexity for Suffix-Free Regular Languages","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Nondeterministic finite automaton; Deterministic finite automaton; Catenation; Regular language; Suffix; Upper and lower bounds; Discrete mathematics; Computer science; State (computer science); String (physics); Intersection (aeronautics); Automaton; Mathematics; Theoretical computer science; Algorithm; Automata theory","score_opus":0.006249754356745859,"score_gpt":0.2532547907464555,"score_spread":0.24700503638970966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966076725","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7891127,0.00040116484,0.19867654,0.0010167276,0.000041393112,0.00016310718,0.0007899329,0.00057289,0.009225572],"genre_scores_gemma":[0.96774143,0.00020441375,0.029277785,0.000065462475,0.0000551212,0.00017403999,0.00058649224,0.00012264094,0.0017726144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956975,0.00083331356,0.00043506533,0.00086618843,0.0014189207,0.0007491369],"domain_scores_gemma":[0.95153177,0.03925262,0.0029201417,0.0035233912,0.0017198097,0.0010521355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002562088,0.00066824426,0.0011641091,0.0014114918,0.0014114549,0.004649658,0.0017489643,0.0012329504,0.005303057],"category_scores_gemma":[0.020203061,0.0006134555,0.0018211104,0.0012646213,0.003224393,0.008742652,0.0022873678,0.0028489977,0.00046785976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012321881,0.00043157785,0.008893254,0.00046252072,0.00013386142,0.00050947006,0.0015750162,0.33518586,0.035649016,0.5785578,0.0018818098,0.03548757],"study_design_scores_gemma":[0.000055933575,0.00013496669,0.001188886,0.000014896251,0.00005424878,0.00016301732,0.000119750744,0.5651072,0.012604169,0.41955492,0.0009391548,0.00006279049],"about_ca_topic_score_codex":0.0016002107,"about_ca_topic_score_gemma":0.00163282,"teacher_disagreement_score":0.005303057,"about_ca_system_score_codex":0.0030528014,"about_ca_system_score_gemma":0.0021934363,"threshold_uncertainty_score":0.022149742},"labels":[],"label_agreement":null},{"id":"W1966285206","doi":"10.1016/j.comgeo.2004.12.005","title":"The Erdős–Nagy theorem and its ramifications","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematical economics; Law and economics; Mathematics; Economics","score_opus":0.011067270117584294,"score_gpt":0.2451078317531823,"score_spread":0.234040561635598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966285206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16786367,0.039958365,0.39826936,0.058539104,0.003344675,0.00008520242,0.0010750323,0.00040158763,0.33046302],"genre_scores_gemma":[0.87860864,0.019367399,0.05275516,0.0048219175,0.006509291,0.00028697954,0.00045458187,0.00019520758,0.037000794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836177,0.00044427367,0.00010080349,0.00050993485,0.00042899436,0.0001541972],"domain_scores_gemma":[0.99607,0.002481174,0.0003633943,0.0005059644,0.0003575394,0.00022191403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024078474,0.0010106199,0.002249176,0.0025966638,0.0031928713,0.0044389777,0.0017183529,0.0031056462,0.008054647],"category_scores_gemma":[0.007604116,0.0007896519,0.0013485638,0.003550631,0.013125736,0.017176483,0.0059140595,0.0076442137,0.0013952398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000882119,0.0000047087865,0.000034559023,0.000016007149,0.0000031938696,0.000017661208,0.000061474246,0.00018457187,0.00004870165,0.99717027,0.0007440928,0.0017058626],"study_design_scores_gemma":[0.0000057627217,0.0000021182184,0.000030862764,0.0000037663933,0.0000017169912,0.000022605967,0.000015475338,0.00030308563,0.000022738099,0.99781716,0.0017711422,0.000003444752],"about_ca_topic_score_codex":0.0011270182,"about_ca_topic_score_gemma":0.0005373804,"teacher_disagreement_score":0.008054647,"about_ca_system_score_codex":0.002111825,"about_ca_system_score_gemma":0.0008574341,"threshold_uncertainty_score":0.026945472},"labels":[],"label_agreement":null},{"id":"W1966302050","doi":"10.1007/s00233-003-0008-x","title":"Equalizers and Flatness Properties of Acts, II","year":2004,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Flatness (cosmology); Functor; Homomorphism; Pure mathematics; Morphism; Annihilator; Monoid; Quotient; Commutative property; Torsion (gastropod); Algebra over a field","score_opus":0.011781330185247818,"score_gpt":0.20650251082271578,"score_spread":0.19472118063746796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966302050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64783597,0.0009705197,0.23402992,0.0015789353,0.00036157412,0.0001066343,0.0006300088,0.00063348777,0.11385296],"genre_scores_gemma":[0.97231805,0.00023256459,0.009594087,0.00021540052,0.00024258354,0.000081831386,0.0004260132,0.00011176303,0.016777605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815315,0.00044759674,0.00015583608,0.0005165427,0.00027732502,0.00044942787],"domain_scores_gemma":[0.9945803,0.0028420077,0.00036962368,0.00072814734,0.0006936554,0.0007861469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019351754,0.0006060745,0.0007118956,0.0026526204,0.0035990977,0.0045412397,0.0009011066,0.00090699905,0.0077464604],"category_scores_gemma":[0.0050423676,0.0007129877,0.0011222862,0.0014004083,0.0047939452,0.0074997153,0.0026265087,0.0024195139,0.0008206395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007207179,0.000024862418,0.00049936504,0.000020505719,0.000006885541,0.000098168326,0.00082944235,0.00024377945,0.0013290608,0.9921183,0.000566876,0.004190743],"study_design_scores_gemma":[0.000026030038,0.000054557637,0.0012841885,0.000017627122,0.00001972966,0.00024216583,0.00050944247,0.00233074,0.0021137502,0.9898493,0.0035260834,0.000026331749],"about_ca_topic_score_codex":0.0018031005,"about_ca_topic_score_gemma":0.0012021702,"teacher_disagreement_score":0.0077464604,"about_ca_system_score_codex":0.0012015313,"about_ca_system_score_gemma":0.000588247,"threshold_uncertainty_score":0.02591449},"labels":[],"label_agreement":null},{"id":"W1967306786","doi":"10.1016/j.tcs.2005.01.007","title":"Generalised fine and Wilf's theorem for arbitrary number of periods","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Word (group theory); Divisor (algebraic geometry); Combinatorics; Upper and lower bounds; Word length; Greatest common divisor; Discrete mathematics; Computer science; Geometry","score_opus":0.008713460936695415,"score_gpt":0.25609400636327656,"score_spread":0.24738054542658114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967306786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12336539,0.004839568,0.67736214,0.005463757,0.0014284428,0.00012587433,0.0007660252,0.0012764293,0.1853724],"genre_scores_gemma":[0.84659415,0.002162673,0.063119896,0.001630186,0.0013741256,0.00022385246,0.00041900674,0.0006411099,0.08383492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987112,0.00018987176,0.000072932686,0.00044941696,0.00029578133,0.00028071986],"domain_scores_gemma":[0.996581,0.0017683139,0.0001598728,0.00090520916,0.0003204317,0.0002651635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019168922,0.0010202928,0.002112021,0.0023273781,0.00240793,0.003152816,0.0019282335,0.0022499315,0.011730674],"category_scores_gemma":[0.007962612,0.0009880748,0.0025731202,0.0017164391,0.0045819017,0.012532981,0.0039365324,0.0043195663,0.001510248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005663284,0.000011939066,0.00013389629,0.00007605962,0.000016042926,0.00009405879,0.0002096072,0.0009639908,0.0009327864,0.987525,0.0023372537,0.0076427334],"study_design_scores_gemma":[0.000013314805,0.00000727386,0.00013260043,0.000008663241,0.000010717414,0.000086454675,0.000022010176,0.002018127,0.000413544,0.9929289,0.004343899,0.000014509402],"about_ca_topic_score_codex":0.0010373594,"about_ca_topic_score_gemma":0.00083554635,"teacher_disagreement_score":0.011730674,"about_ca_system_score_codex":0.0017846964,"about_ca_system_score_gemma":0.0006904174,"threshold_uncertainty_score":0.039242983},"labels":[],"label_agreement":null},{"id":"W1967329424","doi":"10.1016/j.jcta.2009.07.010","title":"Extensions and restrictions of Wythoff's game preserving its <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"script\">P</mml:mi></mml:math> positions","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Fibonacci number; Morphism; Set (abstract data type); Computer science; Word (group theory); Discrete mathematics; Mathematics; Combinatorics; Programming language; Geometry","score_opus":0.013300653658497575,"score_gpt":0.23385288848705402,"score_spread":0.22055223482855643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967329424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4034362,0.00041430458,0.27031764,0.0014618096,0.000301551,0.0002647134,0.0007597399,0.00046872618,0.3225753],"genre_scores_gemma":[0.9051988,0.0003188287,0.03177995,0.00028267707,0.00011728236,0.0002404349,0.00065401377,0.00019729993,0.06121066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805886,0.0004646867,0.00017045216,0.00038683935,0.00041186257,0.000507224],"domain_scores_gemma":[0.99653685,0.0012986559,0.00022157108,0.00062808447,0.0005097783,0.0008050955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002099513,0.0005647821,0.00066063856,0.0012087886,0.0020173064,0.0036322316,0.0013244862,0.0008977725,0.008649418],"category_scores_gemma":[0.0052495305,0.0004719945,0.0013734128,0.0008983133,0.002587284,0.0074282987,0.003295262,0.0028039266,0.0013785128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090678746,0.000049839487,0.0001892086,0.000015534299,0.0000070800297,0.0001355022,0.00035542873,0.0011189379,0.00085531507,0.9919891,0.0008551923,0.0043382645],"study_design_scores_gemma":[0.000036930604,0.00004979984,0.0002599323,0.000019280686,0.000015030471,0.00021055884,0.0002496369,0.01100066,0.0013247398,0.97744876,0.0093607055,0.000023994011],"about_ca_topic_score_codex":0.003116636,"about_ca_topic_score_gemma":0.0027726316,"teacher_disagreement_score":0.008649418,"about_ca_system_score_codex":0.0012907363,"about_ca_system_score_gemma":0.0014689806,"threshold_uncertainty_score":0.028935134},"labels":[],"label_agreement":null},{"id":"W1967372194","doi":"10.1016/j.tcs.2007.01.020","title":"On critical exponents in fixed points of non-erasing morphisms","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Morphism; Alphabet; Exponent; Eigenvalues and eigenvectors; Fixed point; Finite field; Degree (music); Combinatorics; Algebraic number; Discrete mathematics; Field (mathematics); Matrix (chemical analysis); Critical exponent; Pure mathematics; Mathematical analysis; Geometry; Scaling","score_opus":0.00930701070768034,"score_gpt":0.27711712124310667,"score_spread":0.2678101105354263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967372194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8271224,0.0037883588,0.120511495,0.0023157399,0.00043980338,0.00014329316,0.00020569829,0.00043335214,0.045039892],"genre_scores_gemma":[0.97993934,0.0010463056,0.0101304855,0.00018740076,0.00032721038,0.00009753333,0.00012485581,0.00014382444,0.008003078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988601,0.00032026158,0.00008180127,0.00019700773,0.00024025724,0.0003005568],"domain_scores_gemma":[0.98305166,0.012402279,0.0011887144,0.0008306545,0.0010860664,0.0014404894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032343687,0.0014256964,0.0022618135,0.0061901323,0.003701903,0.005674456,0.0016161704,0.0025904484,0.0068797134],"category_scores_gemma":[0.01922332,0.0011275988,0.0013867174,0.0022391032,0.007674327,0.009977567,0.0045657107,0.0045616664,0.0005980215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118488395,0.000031319236,0.00076095434,0.00007198442,0.000016103857,0.00040177334,0.0010772253,0.0018849075,0.0014611327,0.99106675,0.00047107635,0.0026382445],"study_design_scores_gemma":[0.00006655852,0.00003321909,0.00042962568,0.000050362654,0.000019524528,0.00015382838,0.0003152476,0.0077389847,0.0007472838,0.9893028,0.0011185962,0.00002398738],"about_ca_topic_score_codex":0.0011686172,"about_ca_topic_score_gemma":0.001073632,"teacher_disagreement_score":0.0068797134,"about_ca_system_score_codex":0.0028358973,"about_ca_system_score_gemma":0.00087420153,"threshold_uncertainty_score":0.023014963},"labels":[],"label_agreement":null},{"id":"W1967415065","doi":"10.1142/s0129054112400709","title":"BOUNDED PARIKH AUTOMATA","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Bounded function; Class (philosophy); Automaton; Set (abstract data type); Discrete mathematics; Affine transformation; Mathematics; Word (group theory); Regular language; Pure mathematics; Computer science; Theoretical computer science; Programming language; Artificial intelligence; Mathematical analysis","score_opus":0.018292456120191078,"score_gpt":0.3058326623659386,"score_spread":0.2875402062457475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967415065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11917433,0.00084462645,0.82421434,0.00084527204,0.0001827262,0.00011883941,0.0007152052,0.0021404785,0.051764227],"genre_scores_gemma":[0.9169998,0.00035569587,0.07187138,0.00024067759,0.00014317984,0.00019462264,0.00044795388,0.00015792334,0.009588693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982723,0.0004159118,0.00012199749,0.0005216277,0.00044975508,0.00021845853],"domain_scores_gemma":[0.99743795,0.0010699445,0.0001792182,0.0009262005,0.0002622653,0.00012438293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009223779,0.00041566868,0.00063867506,0.00050369865,0.00086958037,0.002378264,0.001329008,0.0009393848,0.0047938544],"category_scores_gemma":[0.0038708248,0.00036780618,0.0011642078,0.00065260316,0.0030189941,0.0042168875,0.0023165639,0.002029819,0.0009472742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009199326,0.000021633306,0.0003600109,0.0000787095,0.000012893469,0.00015191619,0.0004381209,0.009937205,0.0064766747,0.96936214,0.0006929264,0.012375753],"study_design_scores_gemma":[0.000024544275,0.00007214837,0.00022737564,0.000026575919,0.000021118249,0.00025036183,0.00007693921,0.09707017,0.0057234615,0.8827312,0.013746883,0.000029194674],"about_ca_topic_score_codex":0.0012060881,"about_ca_topic_score_gemma":0.0006087921,"teacher_disagreement_score":0.0047938544,"about_ca_system_score_codex":0.0010923814,"about_ca_system_score_gemma":0.00080781564,"threshold_uncertainty_score":0.016037047},"labels":[],"label_agreement":null},{"id":"W1967571653","doi":"10.4204/eptcs.151.10","title":"Maximally Atomic Languages","year":2014,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quotient; Mathematics; Regular language; Combinatorics; Semigroup; Rank (graph theory); Discrete mathematics; Physics","score_opus":0.002605956503864343,"score_gpt":0.21704787553788799,"score_spread":0.21444191903402365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967571653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5571766,0.0007803144,0.39276502,0.0010502987,0.000115536546,0.0002786305,0.0023403405,0.0019112108,0.04358208],"genre_scores_gemma":[0.9189552,0.00017980978,0.07212404,0.00019002768,0.00013126692,0.0002284884,0.0010138178,0.00017861479,0.0069988463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978885,0.00042852448,0.00023524978,0.0005776147,0.00054895226,0.0003210375],"domain_scores_gemma":[0.9954383,0.0019639996,0.0006912841,0.0008853605,0.000714826,0.00030630847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095142773,0.00038914246,0.00057034014,0.00087433436,0.0011299691,0.0022762723,0.001070594,0.00054432894,0.0052308384],"category_scores_gemma":[0.004640271,0.00048974017,0.00093956955,0.0005602326,0.0020470414,0.004214155,0.0019071138,0.0010536616,0.00081239175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026670317,0.00004891498,0.0024056567,0.00023596051,0.00003980953,0.00041400353,0.0011940022,0.0024861565,0.021114295,0.94703716,0.0022000724,0.022557367],"study_design_scores_gemma":[0.000048015474,0.000120874,0.001522337,0.000053506315,0.00005998467,0.0010593499,0.00058965746,0.02310115,0.016900431,0.9289891,0.027504856,0.000050794646],"about_ca_topic_score_codex":0.0005822573,"about_ca_topic_score_gemma":0.000704959,"teacher_disagreement_score":0.0052308384,"about_ca_system_score_codex":0.0009142098,"about_ca_system_score_gemma":0.0009437689,"threshold_uncertainty_score":0.01749891},"labels":[],"label_agreement":null},{"id":"W1968402392","doi":"10.1007/s00233-006-0663-9","title":"Null Extensions and Generalized Inflations of Brandt Semigroups","year":2007,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Carleton University","funders":"","keywords":"Semigroup; Mathematics; Null (SQL); Extension (predicate logic); Associative property; Pure mathematics; Inflation (cosmology); Bicyclic semigroup; Cancellative semigroup; Computer science","score_opus":0.0063943663237523065,"score_gpt":0.23113957568149976,"score_spread":0.22474520935774744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968402392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73865736,0.0014016154,0.20020674,0.0019816197,0.00053018384,0.000056029257,0.00033187104,0.0005115234,0.056323126],"genre_scores_gemma":[0.9733752,0.0002975589,0.015593781,0.00017549813,0.00023245868,0.000050773477,0.00016306809,0.000091656206,0.010020155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983746,0.0004395494,0.00014497018,0.00033970719,0.0003993543,0.0003018889],"domain_scores_gemma":[0.9960467,0.0019765962,0.0004353055,0.00046365344,0.00047290916,0.00060480234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002433238,0.0005625501,0.00095583254,0.0021785663,0.0025473284,0.004289882,0.00094422273,0.0012663847,0.0054581743],"category_scores_gemma":[0.00528082,0.000741366,0.0014150775,0.0012652973,0.0043592085,0.007909551,0.003117537,0.002224409,0.0006238257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005137336,0.0000145844215,0.00016839874,0.000017772945,0.0000046400914,0.00010794738,0.0006625475,0.00020912498,0.0009757609,0.99547523,0.00024226347,0.0020702577],"study_design_scores_gemma":[0.000018878367,0.000018508124,0.000167865,0.000009285858,0.000008792604,0.00017004991,0.00017351602,0.0019162954,0.00057221577,0.9954196,0.0015076108,0.000017448616],"about_ca_topic_score_codex":0.00036143637,"about_ca_topic_score_gemma":0.0004803501,"teacher_disagreement_score":0.0054581743,"about_ca_system_score_codex":0.0009537771,"about_ca_system_score_gemma":0.00051473355,"threshold_uncertainty_score":0.018259406},"labels":[],"label_agreement":null},{"id":"W1968405302","doi":"10.1016/j.tcs.2008.03.017","title":"On stabilizers of infinite words","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Word (group theory); Monoid; Mathematics; Alphabet; Invertible matrix; Combinatorics on words; Free monoid; Characterization (materials science); Discrete mathematics; Pure mathematics; Linguistics","score_opus":0.012084624867511811,"score_gpt":0.2342318309442782,"score_spread":0.2221472060767664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968405302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6823422,0.0025805873,0.19193907,0.0025615394,0.000713149,0.00007398274,0.00035837234,0.0007615819,0.11866954],"genre_scores_gemma":[0.9661709,0.00068813044,0.0070453603,0.00021594943,0.000705839,0.00008052075,0.000246854,0.00016160267,0.02468482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912924,0.00022006208,0.000050218143,0.00019775871,0.000215384,0.00018739137],"domain_scores_gemma":[0.9959943,0.0025375395,0.00033100534,0.00030619092,0.00044481957,0.00038612404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000867394,0.0009191139,0.0009966228,0.0024178973,0.002251783,0.0036290868,0.000877225,0.0011708004,0.0075220703],"category_scores_gemma":[0.0042905947,0.00058635615,0.00091995153,0.001315496,0.0035288201,0.005419685,0.0024069347,0.002036841,0.0009713188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005111538,0.000014069164,0.00019977549,0.000023995162,0.000005940964,0.00011424494,0.000577892,0.0010814714,0.0014048993,0.9931219,0.0006022787,0.002802284],"study_design_scores_gemma":[0.000016345986,0.000022872062,0.00016026395,0.00001168886,0.000008640387,0.00004184373,0.00012245201,0.0041299877,0.0005744421,0.99344146,0.001459094,0.000011013736],"about_ca_topic_score_codex":0.0012211307,"about_ca_topic_score_gemma":0.001215094,"teacher_disagreement_score":0.0075220703,"about_ca_system_score_codex":0.0013764828,"about_ca_system_score_gemma":0.0005189691,"threshold_uncertainty_score":0.02516383},"labels":[],"label_agreement":null},{"id":"W1968593409","doi":"10.1142/s0129054112400540","title":"DE BRUIJN SEQUENCES REVISITED","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"De Bruijn sequence; Combinatorics; Sequence (biology); Alphabet; Mathematics; Order (exchange); Word (group theory); Integer (computer science); Word length; Discrete mathematics; Computer science; Geometry","score_opus":0.019679544085339343,"score_gpt":0.31379569095218235,"score_spread":0.294116146866843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968593409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38008007,0.0055922573,0.49008164,0.0027978944,0.0011214254,0.00032346524,0.0009871481,0.0012282726,0.117787726],"genre_scores_gemma":[0.7605224,0.0014769193,0.1955486,0.00056014437,0.0005272228,0.00023530613,0.0006192938,0.00027467238,0.040235505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861324,0.00026932612,0.00013580202,0.0004252445,0.00037911625,0.00017721098],"domain_scores_gemma":[0.99607396,0.002161767,0.00039830376,0.0005718648,0.0005518273,0.0002423403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082632416,0.0005024677,0.0005182958,0.0011214707,0.001683756,0.0014596302,0.00074826716,0.00092341506,0.007519459],"category_scores_gemma":[0.0048856144,0.00037552326,0.0005420199,0.0013181668,0.002298464,0.0039512296,0.001239581,0.001721994,0.0016882416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019697007,0.000059985687,0.00094712863,0.00025844382,0.000011993443,0.00037807238,0.00073202525,0.004826502,0.01381503,0.9074422,0.0025814096,0.06875014],"study_design_scores_gemma":[0.00003372814,0.00013323972,0.0010361971,0.000109009794,0.000020397325,0.0016374511,0.0003027988,0.025705015,0.017685007,0.8749367,0.07835743,0.00004317517],"about_ca_topic_score_codex":0.00084331224,"about_ca_topic_score_gemma":0.0011108514,"teacher_disagreement_score":0.007519459,"about_ca_system_score_codex":0.0010691987,"about_ca_system_score_gemma":0.000979696,"threshold_uncertainty_score":0.025155067},"labels":[],"label_agreement":null},{"id":"W1968754294","doi":"10.1142/s012905410500342x","title":"A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Peano axioms; Arithmetic function; Concatenation (mathematics); Mathematics; Second-order arithmetic; Expressive power; Hierarchy; Class (philosophy); Analytical hierarchy; Discrete mathematics; Characterization (materials science); Property (philosophy); Axiom; Order (exchange); Algebra over a field; Arithmetic; Pure mathematics; Computer science; Theoretical computer science; Analytic hierarchy process","score_opus":0.008621856616376914,"score_gpt":0.27510471527781283,"score_spread":0.2664828586614359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968754294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27923557,0.0013691148,0.6765638,0.0019985933,0.00010648115,0.00013077247,0.000880847,0.0005005144,0.039214272],"genre_scores_gemma":[0.8299405,0.00077290036,0.16001377,0.00033907496,0.00024875486,0.0001695455,0.00084604684,0.000105117884,0.0075644045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880636,0.00026473388,0.000091495,0.0002576467,0.00038978586,0.0001899813],"domain_scores_gemma":[0.9979236,0.0012175819,0.00025346508,0.00020080838,0.00027636948,0.00012812052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010624491,0.00044711764,0.00057133095,0.0014911154,0.0007630083,0.0028347299,0.0011088823,0.0006970074,0.0027255933],"category_scores_gemma":[0.0040564104,0.00041758237,0.0010095956,0.001399659,0.0025743123,0.0048406343,0.0018886179,0.0023739778,0.00043718665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023673962,0.000015220546,0.00033471157,0.000047803616,0.000008033954,0.00008532463,0.0003981542,0.0028191202,0.0031155662,0.98520166,0.00054774823,0.0074028675],"study_design_scores_gemma":[0.000016980455,0.000024901972,0.00041317084,0.00003305967,0.0000138191335,0.00020454435,0.00011384141,0.04399127,0.0018032789,0.94786197,0.0054998607,0.000023334836],"about_ca_topic_score_codex":0.000892622,"about_ca_topic_score_gemma":0.00083573547,"teacher_disagreement_score":0.0028347299,"about_ca_system_score_codex":0.0013739943,"about_ca_system_score_gemma":0.00076247915,"threshold_uncertainty_score":0.009969056},"labels":[],"label_agreement":null},{"id":"W1969137001","doi":"10.1090/s0002-9947-03-03333-6","title":"Non-trivial quadratic approximations to zero of a family of cubic Pisot numbers","year":2003,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Zero (linguistics); Combinatorics; Integer (computer science); Quadratic equation; Function (biology); Sequence (biology); Class (philosophy); Polynomial; Cubic function; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.01263798625731895,"score_gpt":0.25271071931063455,"score_spread":0.24007273305331558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969137001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5099773,0.0015502558,0.35133728,0.0017960127,0.00068152964,0.0000942297,0.00052393286,0.0014070987,0.13263236],"genre_scores_gemma":[0.95276296,0.0005505038,0.024895474,0.00020998626,0.00023670509,0.00009756806,0.00037031158,0.00045351387,0.020422893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809927,0.0003194191,0.000072865136,0.00032580792,0.0007210561,0.0004616156],"domain_scores_gemma":[0.9945557,0.00289815,0.00049353857,0.0006795471,0.0007117892,0.00066114025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017060369,0.0009414353,0.000927853,0.001986025,0.0021541354,0.0029129027,0.0017610104,0.0009822265,0.013853529],"category_scores_gemma":[0.017571928,0.0005333427,0.0013541759,0.0009793045,0.0033875047,0.005208466,0.00272276,0.0042268843,0.0021709742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000201555,0.000026689413,0.0012649863,0.0001449089,0.000018178967,0.00018180953,0.00028939758,0.008273864,0.001652509,0.97516507,0.0028455828,0.009935376],"study_design_scores_gemma":[0.000036025544,0.000096457545,0.0012802964,0.000103942184,0.00003608207,0.0005775384,0.00022518607,0.13115998,0.0045680143,0.853433,0.00839661,0.00008690469],"about_ca_topic_score_codex":0.0030986683,"about_ca_topic_score_gemma":0.0020350697,"teacher_disagreement_score":0.013853529,"about_ca_system_score_codex":0.0030277313,"about_ca_system_score_gemma":0.0015347924,"threshold_uncertainty_score":0.046344638},"labels":[],"label_agreement":null},{"id":"W1969770235","doi":"10.1016/j.tcs.2005.01.004","title":"Pattern avoidance: themes and variations","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Mathematics; Psychology; Artificial intelligence","score_opus":0.00609221224695569,"score_gpt":0.22810185740351413,"score_spread":0.22200964515655844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969770235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2054491,0.047522657,0.45730588,0.0332859,0.0014197279,0.00011289815,0.00043366704,0.0005730271,0.253897],"genre_scores_gemma":[0.9119684,0.012376632,0.052393112,0.0014333762,0.0015391805,0.00019363068,0.00022526529,0.00022994692,0.019640494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845195,0.00042917102,0.0001064914,0.000444767,0.00040586235,0.00016173554],"domain_scores_gemma":[0.99688953,0.0016540785,0.00021928271,0.00059873826,0.00042197446,0.0002163567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019534465,0.0004545661,0.00086215336,0.0020049603,0.002541463,0.0062346794,0.0020960376,0.0019916915,0.0052127372],"category_scores_gemma":[0.0060873,0.00044550732,0.0007108465,0.0030203434,0.010869601,0.011914786,0.0034809671,0.003261338,0.00057737145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009564759,0.000009621334,0.00015879828,0.000032798616,0.00000414814,0.000027906339,0.0005072041,0.00035316404,0.00018408035,0.99062717,0.00089465355,0.0071909856],"study_design_scores_gemma":[0.000004265978,0.000005192261,0.00012900573,0.00001180483,0.0000030076735,0.000077904166,0.00023557302,0.000944102,0.00009227794,0.9924379,0.006053087,0.000005932158],"about_ca_topic_score_codex":0.00089866004,"about_ca_topic_score_gemma":0.00080771407,"teacher_disagreement_score":0.0062346794,"about_ca_system_score_codex":0.0019648296,"about_ca_system_score_gemma":0.0008028915,"threshold_uncertainty_score":0.017438293},"labels":[],"label_agreement":null},{"id":"W1969781575","doi":"10.1515/integers-2012-0005","title":"On Abelian and Additive Complexity in Infinite Words","year":2012,"lang":"en","type":"article","venue":"Integers","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Abelian group; Algebra over a field; Pure mathematics; Discrete mathematics","score_opus":0.03120104898078008,"score_gpt":0.26814006677263424,"score_spread":0.23693901779185417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969781575","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7842179,0.0070136287,0.11754792,0.007700606,0.0005824072,0.000043516906,0.00030933804,0.00011144419,0.08247323],"genre_scores_gemma":[0.98564744,0.00093171274,0.00653736,0.0002655852,0.00083475746,0.00003909276,0.00012995959,0.00002166012,0.0055924603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990042,0.00035735132,0.00006693641,0.0001564619,0.00029901415,0.00011610795],"domain_scores_gemma":[0.990261,0.0077423914,0.0006562403,0.00034957283,0.0005581107,0.00043262696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012271999,0.00051180884,0.0008025492,0.0024813984,0.0018186034,0.0042384746,0.0009347318,0.00095432566,0.0034179515],"category_scores_gemma":[0.006192098,0.00040501432,0.000730737,0.002693148,0.006384714,0.009407593,0.002290575,0.001996025,0.00022096928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020119249,0.000013911789,0.00029956776,0.000029316188,0.0000047053527,0.000063891355,0.0004184082,0.0008814552,0.00034740326,0.99610114,0.00020413884,0.0016159397],"study_design_scores_gemma":[0.000008181456,0.000014497822,0.00033571044,0.0000146425255,0.000007621062,0.000077727345,0.00015991642,0.0027305146,0.00023552708,0.99480444,0.0016000795,0.000011242714],"about_ca_topic_score_codex":0.00090539776,"about_ca_topic_score_gemma":0.0007491719,"teacher_disagreement_score":0.0042384746,"about_ca_system_score_codex":0.001634464,"about_ca_system_score_gemma":0.000630649,"threshold_uncertainty_score":0.01185894},"labels":[],"label_agreement":null},{"id":"W1970242274","doi":"10.1142/9789812702616_0011","title":"RELATIVE REWRITING SYSTEMS","year":2004,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Rewriting; Computer science; Programming language","score_opus":0.01105188728677279,"score_gpt":0.21719763963132743,"score_spread":0.20614575234455465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970242274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062381234,0.0067199855,0.60265553,0.0041657747,0.0016025448,0.00015815394,0.0008904882,0.0021822748,0.3192439],"genre_scores_gemma":[0.7333878,0.0028637443,0.10075837,0.0011053402,0.0012748537,0.00018552045,0.0013876004,0.0007089603,0.15832779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980563,0.00052465283,0.00012735199,0.00062189205,0.0005173584,0.00015254662],"domain_scores_gemma":[0.9984977,0.00057533866,0.000108071385,0.00038761023,0.00032646436,0.00010470772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012499909,0.0006501318,0.00081739674,0.0016515023,0.0018658255,0.0037353688,0.0009766388,0.0010717324,0.021234648],"category_scores_gemma":[0.0031907838,0.0006225695,0.00090025924,0.0014401355,0.002568391,0.007573864,0.001881652,0.0025488276,0.0063816197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011395795,0.000009320894,0.000038532326,0.000029587154,0.000005373181,0.00003614999,0.00020321063,0.00023465476,0.000939761,0.98867583,0.0016048119,0.008211361],"study_design_scores_gemma":[0.000007924407,0.000017274231,0.00007202615,0.000015389754,0.000013381656,0.0001378317,0.00007139173,0.0015126023,0.0014363468,0.9660722,0.030630967,0.000012577881],"about_ca_topic_score_codex":0.00039915336,"about_ca_topic_score_gemma":0.0003370521,"teacher_disagreement_score":0.021234648,"about_ca_system_score_codex":0.0011833925,"about_ca_system_score_gemma":0.0007057949,"threshold_uncertainty_score":0.071036994},"labels":[],"label_agreement":null},{"id":"W1971074104","doi":"10.5555/1756384.1756392","title":"The number of similarity relations and the number of minimal deterministic finite cover automata","year":2002,"lang":"en","type":"article","venue":"International Conference on Implementation and application of automata","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Prince Edward Island","funders":"","keywords":"Deterministic finite automaton; Mathematics; Combinatorics; Unary operation; Quantum finite automata; Nondeterministic finite automaton; Upper and lower bounds; Discrete mathematics; Cover (algebra); Equivalence relation; Finite-state machine; DFA minimization; Integer (computer science); Automaton; Automata theory; Algorithm; Computer science; Theoretical computer science","score_opus":0.031051998932354417,"score_gpt":0.34425009039367155,"score_spread":0.3131980914613171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971074104","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8984618,0.0006063726,0.08177908,0.0021795859,0.000084227126,0.00013110982,0.0010941866,0.00045147422,0.01521224],"genre_scores_gemma":[0.97090244,0.00021561206,0.024472475,0.0001780603,0.00011213887,0.00017855309,0.0007480906,0.000099293364,0.0030932417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994231,0.0014441444,0.0006658931,0.0013952533,0.0015368308,0.0007269631],"domain_scores_gemma":[0.9373088,0.048235036,0.004241183,0.004553207,0.002293139,0.0033686266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029711232,0.0005318401,0.001913223,0.0020913202,0.0032415234,0.0051839827,0.0027464584,0.0031188622,0.008704486],"category_scores_gemma":[0.025787704,0.0012841803,0.0019077965,0.0018411095,0.004099976,0.009909397,0.0027622748,0.0021037282,0.00069005036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023598934,0.00054956693,0.023333276,0.00081934454,0.00038390534,0.000566221,0.0016827016,0.045099217,0.02621559,0.8347661,0.0052442597,0.058979865],"study_design_scores_gemma":[0.00017092403,0.00020934323,0.004524024,0.000060097453,0.000228858,0.00096925604,0.00038495942,0.103973135,0.013663763,0.87218255,0.0035536475,0.00007952012],"about_ca_topic_score_codex":0.0005910297,"about_ca_topic_score_gemma":0.000984838,"teacher_disagreement_score":0.008704486,"about_ca_system_score_codex":0.0023171636,"about_ca_system_score_gemma":0.0016291025,"threshold_uncertainty_score":0.029119372},"labels":[],"label_agreement":null},{"id":"W1972572665","doi":"10.1142/s0129054113400315","title":"THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Edit distance; Context-free language; Regular language; Computer science; String (physics); Nondeterministic finite automaton; Regular expression; Deterministic pushdown automaton; Unary operation; Formal language; Automaton; Theoretical computer science; Discrete mathematics; Mathematics; Algorithm; Programming language; Rule-based machine translation; Artificial intelligence; Automata theory","score_opus":0.007283888517623,"score_gpt":0.2653929551883784,"score_spread":0.2581090666707554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972572665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12567209,0.0005273111,0.8655131,0.0005038406,0.00021050315,0.00015447501,0.0009105117,0.0016164366,0.004891709],"genre_scores_gemma":[0.38889572,0.00036674764,0.60614073,0.00014683754,0.00011280113,0.00016985551,0.00101247,0.00030468506,0.0028502294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731016,0.0006741135,0.00033526708,0.00089817494,0.00063853373,0.00014378091],"domain_scores_gemma":[0.99019593,0.0065643224,0.0005562268,0.0016156564,0.0007722158,0.00029564096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017307469,0.00045056743,0.00073969277,0.0013856357,0.00073333946,0.0017275368,0.0014780471,0.0011028354,0.0029705088],"category_scores_gemma":[0.013860455,0.00043254715,0.0010560041,0.0013764899,0.0014240023,0.0039773667,0.0016663333,0.0010212988,0.00082038343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009922911,0.00036823566,0.007895268,0.001416197,0.00031228084,0.0016493053,0.0021229326,0.06287746,0.060408678,0.4875824,0.008355695,0.36601937],"study_design_scores_gemma":[0.00010669781,0.00063544145,0.00342208,0.00014133194,0.000174762,0.0025800024,0.00059276645,0.21235481,0.036997806,0.7083342,0.03452136,0.00013877505],"about_ca_topic_score_codex":0.0007885773,"about_ca_topic_score_gemma":0.00092957576,"teacher_disagreement_score":0.0029705088,"about_ca_system_score_codex":0.0008900894,"about_ca_system_score_gemma":0.0011546451,"threshold_uncertainty_score":0.009937346},"labels":[],"label_agreement":null},{"id":"W1972975178","doi":"10.1142/s0218196703001316","title":"PRODUCTS OF COMMUTATORS IN FREE GROUPS","year":2003,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Rank (graph theory); Word (group theory); Combinatorics; Product (mathematics); Free product; Free group; Algebraic number; Infinity; Group (periodic table); Mathematical proof; Discrete mathematics; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.009058940401390424,"score_gpt":0.24511721116582721,"score_spread":0.23605827076443678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972975178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54462004,0.0011523289,0.4136892,0.0005420046,0.00028996257,0.00013286842,0.00025108102,0.0010061834,0.03831633],"genre_scores_gemma":[0.89172316,0.00036119914,0.08721587,0.00010755504,0.00019583128,0.00013840137,0.00023219927,0.00015108228,0.019874806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982809,0.0005385215,0.000209424,0.0003688419,0.0003604755,0.00024182953],"domain_scores_gemma":[0.99667144,0.0017461283,0.00036668687,0.00048997765,0.00043702734,0.00028877973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001545106,0.00061502063,0.00051692105,0.0007782503,0.0014006731,0.0025684542,0.00064635725,0.00064333546,0.0063133533],"category_scores_gemma":[0.0036252956,0.0005303634,0.0007762693,0.00059503806,0.0026765498,0.0059953067,0.0019315336,0.0008621484,0.0012462147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001410077,0.000038390393,0.00067090086,0.00011669031,0.000015215707,0.00031717325,0.0018136121,0.0020528524,0.0070477733,0.96857756,0.00085656793,0.01835239],"study_design_scores_gemma":[0.000031071733,0.00014933718,0.00023219902,0.000026731588,0.000023286795,0.00036179586,0.00035609724,0.00956971,0.007578126,0.9680393,0.013600574,0.0000318801],"about_ca_topic_score_codex":0.00039501712,"about_ca_topic_score_gemma":0.00069231965,"teacher_disagreement_score":0.0063133533,"about_ca_system_score_codex":0.00065858726,"about_ca_system_score_gemma":0.0004421401,"threshold_uncertainty_score":0.02112025},"labels":[],"label_agreement":null},{"id":"W1973389329","doi":"10.1080/00927870500274853","title":"Strongly Flat and<i>PO</i>-Flat<i>S</i>-Posets","year":2005,"lang":"en","type":"article","venue":"Communications in Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Windsor","keywords":"Monoid; Mathematics; Flatness (cosmology); Combinatorics; Semigroup; Partially ordered set; Torsion (gastropod); Algebra over a field; Discrete mathematics; Physics; Pure mathematics","score_opus":0.02184093062763629,"score_gpt":0.27574343331299533,"score_spread":0.253902502685359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973389329","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5367873,0.0027428905,0.2625914,0.002103228,0.0006435828,0.00021790247,0.0018302407,0.0009948935,0.1920886],"genre_scores_gemma":[0.95919687,0.00041273917,0.019203657,0.0002976687,0.00017695792,0.00010069411,0.0010632878,0.000093902,0.019454101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982185,0.00038444356,0.00018997146,0.00051009364,0.00033433398,0.0003627085],"domain_scores_gemma":[0.9977083,0.0008256175,0.00023751505,0.00022049583,0.00049788307,0.00051012915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014470057,0.0006012397,0.00052067137,0.0021493789,0.0022607055,0.003903842,0.0005228746,0.00074952823,0.011266482],"category_scores_gemma":[0.0020288485,0.0005589235,0.0011788505,0.0010932669,0.0046295575,0.0046713618,0.0028094463,0.001892188,0.0012001564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096536445,0.00002745941,0.0016613365,0.00005715473,0.000014715733,0.0005609201,0.0011745717,0.0010006732,0.0019817194,0.98367465,0.001480762,0.008269686],"study_design_scores_gemma":[0.000022758491,0.00010478235,0.0026768611,0.00006212295,0.000024310835,0.0011172032,0.001200222,0.0050961953,0.0029578314,0.9665809,0.020107586,0.000049128583],"about_ca_topic_score_codex":0.0020203076,"about_ca_topic_score_gemma":0.0013091562,"teacher_disagreement_score":0.011266482,"about_ca_system_score_codex":0.0014373406,"about_ca_system_score_gemma":0.0007980445,"threshold_uncertainty_score":0.037690103},"labels":[],"label_agreement":null},{"id":"W1973982376","doi":"10.1142/s0129054103002205","title":"EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Automaton; Deterministic context-free grammar; Computer science; Theoretical computer science; Finite-state machine; Discrete mathematics; Context-free language; Embedded pushdown automaton; Rule-based machine translation; Probabilistic automaton; Mathematics; Algorithm; Tree-adjoining grammar; Context-free grammar; Artificial intelligence","score_opus":0.018836019442561434,"score_gpt":0.310194326532439,"score_spread":0.2913583070898776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973982376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034307234,0.000157236,0.956253,0.00016190695,0.00007237868,0.00011790659,0.00019035122,0.004746158,0.0039938325],"genre_scores_gemma":[0.43107536,0.00022332014,0.5628228,0.0001608454,0.00003868541,0.00018886039,0.0009866619,0.00041246612,0.004090983],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887437,0.00026796828,0.00013466211,0.0002659324,0.00032895536,0.00012803238],"domain_scores_gemma":[0.9962192,0.0023677796,0.00019437226,0.0006853979,0.00046840185,0.00006484078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006710719,0.00034730192,0.0006760464,0.00046051134,0.00059257355,0.0017014957,0.0013305678,0.00066806504,0.0049662823],"category_scores_gemma":[0.005213489,0.00037731964,0.0010874014,0.0005845705,0.0010633948,0.0021742492,0.0009193556,0.0009954296,0.0013328957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006711261,0.0003156771,0.001993123,0.0005150828,0.00011716927,0.0008739422,0.0011540726,0.1488141,0.08282178,0.31673843,0.009413467,0.43657213],"study_design_scores_gemma":[0.000057069905,0.0001288376,0.00034695072,0.000030169585,0.00004489094,0.00026994842,0.00015831477,0.8025744,0.046969537,0.14128938,0.008078629,0.0000519614],"about_ca_topic_score_codex":0.0036042898,"about_ca_topic_score_gemma":0.0045440276,"teacher_disagreement_score":0.0049662823,"about_ca_system_score_codex":0.0008360513,"about_ca_system_score_gemma":0.0010005197,"threshold_uncertainty_score":0.0166139},"labels":[],"label_agreement":null},{"id":"W1974278282","doi":"10.1142/s0129054107004917","title":"ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"State (computer science); Nondeterministic algorithm; Computational complexity theory; Estimation; Computer science; Theoretical computer science; Class (philosophy); Algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Engineering","score_opus":0.027416478122629866,"score_gpt":0.29959842707445417,"score_spread":0.2721819489518243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974278282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104323715,0.00057942193,0.89133173,0.00030742478,0.000033237233,0.00006725454,0.00021670524,0.00024005941,0.0029004714],"genre_scores_gemma":[0.83827114,0.0006830705,0.15771656,0.00006666753,0.00014653079,0.0002989215,0.0005643608,0.00021340855,0.0020392728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99521697,0.0013518113,0.00026397052,0.0010931627,0.0016100355,0.00046411404],"domain_scores_gemma":[0.92054915,0.06949817,0.0031233395,0.0039573577,0.002168026,0.0007039974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004228685,0.0011440858,0.0013901475,0.002380206,0.00076715345,0.0027415128,0.0017800913,0.0012281114,0.004175529],"category_scores_gemma":[0.04042499,0.0006638106,0.0016207603,0.0019235545,0.0026521538,0.009001373,0.0026886784,0.0030834223,0.0003647837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006174012,0.00018924547,0.008623551,0.00047604763,0.00022292919,0.00024023328,0.00039684807,0.6326538,0.010075741,0.2585298,0.0010231904,0.08695128],"study_design_scores_gemma":[0.0000073468245,0.000050719733,0.0009642043,0.00001904504,0.000029758752,0.000051958676,0.000026119786,0.8957388,0.0028225249,0.099920385,0.000334048,0.000035112334],"about_ca_topic_score_codex":0.0019718832,"about_ca_topic_score_gemma":0.0011026022,"teacher_disagreement_score":0.004228685,"about_ca_system_score_codex":0.0019880107,"about_ca_system_score_gemma":0.0013532161,"threshold_uncertainty_score":0.022363663},"labels":[],"label_agreement":null},{"id":"W1974623598","doi":"10.1016/j.ejc.2007.03.001","title":"On an involution of Christoffel words and Sturmian morphisms","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Modulo; Morphism; Christoffel symbols; Combinatorics on words; Involution (esoterism); Iterated function; Combinatorics; Automorphism; Endomorphism; Quotient; Palindrome; Discrete mathematics; Pure mathematics; Word (group theory)","score_opus":0.010255622208276069,"score_gpt":0.22606754202962095,"score_spread":0.2158119198213449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974623598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6907412,0.0016206446,0.15725857,0.0015559285,0.0010746985,0.000048715334,0.00016165145,0.0004977343,0.14704086],"genre_scores_gemma":[0.96386683,0.00056158047,0.0122728385,0.00029893316,0.00036800836,0.000038354083,0.000116437164,0.00015234892,0.02232465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989674,0.00022677498,0.00006572614,0.00017895973,0.00023461842,0.00032647033],"domain_scores_gemma":[0.99808097,0.0009291047,0.00018076769,0.00019417304,0.00030117217,0.00031387783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014330973,0.0007616404,0.0010026514,0.003133574,0.004196262,0.003240813,0.00095724745,0.0016848809,0.0057476163],"category_scores_gemma":[0.0030263353,0.0006250464,0.0015139009,0.002739854,0.0056208335,0.00476937,0.003115746,0.0023245995,0.00093027536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035858196,0.000015480566,0.0001372805,0.000011580198,0.000004183192,0.00014010725,0.00053161086,0.00024376345,0.00059256406,0.9950767,0.00030125465,0.0029095768],"study_design_scores_gemma":[0.000008946771,0.000018373066,0.0001787773,0.0000089132855,0.000007819381,0.00011109983,0.00014500464,0.0011573404,0.0004887195,0.99603516,0.001825011,0.000014812561],"about_ca_topic_score_codex":0.0017352824,"about_ca_topic_score_gemma":0.0015749279,"teacher_disagreement_score":0.0057476163,"about_ca_system_score_codex":0.001959137,"about_ca_system_score_gemma":0.00073370145,"threshold_uncertainty_score":0.019227684},"labels":[],"label_agreement":null},{"id":"W1975431188","doi":"10.1142/s0129054113400285","title":"COMPLEXITY OF ATOMS OF REGULAR LANGUAGES","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quotient; Atom (system on chip); Intersection (aeronautics); Mathematics; Regular language; State (computer science); Upper and lower bounds; Combinatorics; Discrete mathematics; Physics; Computer science; Algorithm; Mathematical analysis","score_opus":0.02073960704499473,"score_gpt":0.2991157101043507,"score_spread":0.27837610305935595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975431188","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8916582,0.0002631194,0.09409056,0.0007204808,0.000022803282,0.00011314843,0.0012458151,0.0003862378,0.011499485],"genre_scores_gemma":[0.97246087,0.00011912997,0.022386229,0.00007002595,0.000045859713,0.00014443183,0.0008640567,0.000098822886,0.003810521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791175,0.0003547607,0.00019259955,0.00042842943,0.0007643191,0.0003481071],"domain_scores_gemma":[0.99009097,0.00711718,0.0008415249,0.0007074149,0.0007730439,0.00046976953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000803242,0.00029528124,0.000600111,0.0010328778,0.000851435,0.002892194,0.0011643803,0.00063237373,0.0055399938],"category_scores_gemma":[0.008914998,0.00038305033,0.0011222856,0.00064457057,0.0019948587,0.005156347,0.0016361666,0.0010372013,0.00036649694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014066638,0.00022036389,0.017325033,0.0005849195,0.00014683699,0.0008136465,0.0034061759,0.08638927,0.04687717,0.79841363,0.003977078,0.040439196],"study_design_scores_gemma":[0.000056151104,0.00012601617,0.0039348616,0.000028224506,0.00006064617,0.0005051831,0.00034394753,0.24665508,0.012693333,0.7304646,0.0050734733,0.00005848951],"about_ca_topic_score_codex":0.0021550357,"about_ca_topic_score_gemma":0.0019121369,"teacher_disagreement_score":0.0055399938,"about_ca_system_score_codex":0.002235796,"about_ca_system_score_gemma":0.0011140232,"threshold_uncertainty_score":0.01853311},"labels":[],"label_agreement":null},{"id":"W1975841184","doi":"10.1016/j.ipl.2007.09.005","title":"A note on the Markoff condition and central words","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Mathematics; Natural language processing; Theoretical computer science; Programming language","score_opus":0.005901160824610333,"score_gpt":0.22163953948542195,"score_spread":0.2157383786608116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975841184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08395252,0.012083898,0.6063264,0.03366526,0.012134141,0.00010562977,0.00061900157,0.0008737258,0.25023946],"genre_scores_gemma":[0.80880994,0.006219507,0.11776632,0.009212529,0.012324987,0.0003175847,0.0004907477,0.0008426387,0.044015817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736553,0.0008813759,0.00021532882,0.0006729488,0.00054701406,0.0003178159],"domain_scores_gemma":[0.9816996,0.0141359465,0.000511951,0.0018260704,0.0012417509,0.0005846862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048089335,0.0008230229,0.0019568615,0.002138774,0.0034296205,0.004312253,0.002332032,0.0048102182,0.013414907],"category_scores_gemma":[0.018329225,0.00087763503,0.0016948091,0.0024215209,0.009492171,0.021157173,0.005314274,0.0075414395,0.0023545823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003907841,0.0000066078032,0.00005308737,0.000036384532,0.00000360052,0.000053457275,0.00008934293,0.00018500813,0.000387631,0.99429166,0.0017280511,0.0031260434],"study_design_scores_gemma":[0.000007654792,0.000010589798,0.00004169563,0.000009375145,0.000004720845,0.000044823075,0.000021214297,0.00066382205,0.0003221588,0.99501944,0.0038423324,0.0000121611365],"about_ca_topic_score_codex":0.00089103205,"about_ca_topic_score_gemma":0.00074044673,"teacher_disagreement_score":0.013414907,"about_ca_system_score_codex":0.0015504477,"about_ca_system_score_gemma":0.001483192,"threshold_uncertainty_score":0.04487735},"labels":[],"label_agreement":null},{"id":"W1976140212","doi":"10.1007/978-3-642-00982-2_21","title":"Decision Problems for Convex Languages","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Regular polygon; Mathematical optimization; Theoretical computer science; Mathematics","score_opus":0.013195413668358918,"score_gpt":0.2554913312474427,"score_spread":0.2422959175790838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976140212","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06694774,0.004731145,0.73982453,0.00961021,0.0005759887,0.00034692386,0.0013165215,0.00047162658,0.1761752],"genre_scores_gemma":[0.6396174,0.0052105486,0.22082101,0.0017174651,0.0016216027,0.0012669453,0.0030745917,0.00058757165,0.12608296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976291,0.00093155087,0.00013643775,0.00047727206,0.0005289494,0.0002966546],"domain_scores_gemma":[0.9904689,0.007855926,0.00034267834,0.00041072152,0.00049908616,0.00042269006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029716457,0.0013031457,0.0019970292,0.0009994311,0.0016443463,0.0052683414,0.002103167,0.0019573038,0.019277722],"category_scores_gemma":[0.01175793,0.0011052212,0.0019139324,0.0020337899,0.003794942,0.0079844585,0.0026218137,0.007853258,0.0017785634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052369727,0.00005520005,0.00008519526,0.00011439495,0.000020507849,0.00003510911,0.00014286106,0.009396905,0.0002657972,0.9667553,0.0070089535,0.01606739],"study_design_scores_gemma":[0.000021011601,0.000011529184,0.000040617077,0.000020460628,0.0000070495716,0.000019565212,0.000040759875,0.02256564,0.00014921688,0.9745344,0.002582467,0.000007316301],"about_ca_topic_score_codex":0.0022943278,"about_ca_topic_score_gemma":0.0018337397,"teacher_disagreement_score":0.019277722,"about_ca_system_score_codex":0.0037039926,"about_ca_system_score_gemma":0.0019964562,"threshold_uncertainty_score":0.06449038},"labels":[],"label_agreement":null},{"id":"W1976554601","doi":"10.1016/j.jcta.2013.09.002","title":"Lyndon words and Fibonacci numbers","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Fibonacci number; Combinatorics; Concatenation (mathematics); Word (group theory); Mathematics; Golden ratio; Upper and lower bounds; Closure (psychology); Aperiodic graph; Combinatorics on words; Word length; Discrete mathematics; Computer science; Geometry","score_opus":0.004193574610920123,"score_gpt":0.20143033041803673,"score_spread":0.1972367558071166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976554601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47894293,0.011722846,0.20561829,0.0053583174,0.0018852709,0.000101551,0.00047977417,0.00052806875,0.2953629],"genre_scores_gemma":[0.93990964,0.001756281,0.018782523,0.00051534653,0.000813983,0.00012088454,0.00024956823,0.000088712775,0.03776295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993082,0.00019690166,0.000052477346,0.00012504603,0.00020475002,0.00011254525],"domain_scores_gemma":[0.99772686,0.0014120792,0.00023754733,0.00018508975,0.0002645242,0.00017394937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010420345,0.00062379066,0.00096987066,0.0027795383,0.00333477,0.0049919756,0.0010025626,0.001711357,0.008869104],"category_scores_gemma":[0.0045833834,0.0007144895,0.00075294444,0.0028300835,0.004380608,0.005369667,0.001569673,0.00217446,0.0012495939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020726646,0.000009240641,0.00012958603,0.000015939513,0.000002388845,0.00007647778,0.00029364834,0.00023326243,0.00030124967,0.9949561,0.0007051032,0.0032562176],"study_design_scores_gemma":[0.0000066920124,0.000004893656,0.00007601351,0.00000716386,0.0000037783448,0.00007653521,0.000074512005,0.00069440674,0.00012886287,0.99624455,0.0026737843,0.000008860176],"about_ca_topic_score_codex":0.001031424,"about_ca_topic_score_gemma":0.0014389724,"teacher_disagreement_score":0.008869104,"about_ca_system_score_codex":0.0016806728,"about_ca_system_score_gemma":0.000757149,"threshold_uncertainty_score":0.02967012},"labels":[],"label_agreement":null},{"id":"W1977065097","doi":"10.1016/j.jda.2009.10.001","title":"On the generalized Berge sorting conjecture","year":2009,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Direktion für Entwicklung und Zusammenarbeit; Mitacs; Canada Research Chairs","keywords":"Combinatorics; Conjecture; Sorting; Mathematics; String (physics); Algorithm","score_opus":0.011191178383329208,"score_gpt":0.24998249405102738,"score_spread":0.23879131566769818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977065097","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3572493,0.004157692,0.19069901,0.13238424,0.0033882533,0.00015148328,0.0020542154,0.0015809147,0.30833492],"genre_scores_gemma":[0.89010173,0.0022429067,0.033472665,0.012243608,0.0024070577,0.00022991218,0.0017135352,0.0004912493,0.057097297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720263,0.0007377121,0.00014011656,0.00079489994,0.00058221107,0.0005423575],"domain_scores_gemma":[0.98120075,0.0127372295,0.0006865937,0.0031145012,0.0014513067,0.00080952834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041012415,0.0008256815,0.0025572402,0.0018033863,0.0047646128,0.008159439,0.002724555,0.005782771,0.026244357],"category_scores_gemma":[0.02525836,0.0009819841,0.0013648974,0.0037982645,0.009561608,0.030406564,0.0056111696,0.0071349274,0.0034746279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014947649,0.00005037589,0.000487018,0.00006573489,0.000012162306,0.0000645462,0.00024902666,0.0014031115,0.00024049732,0.9816297,0.009293138,0.006355184],"study_design_scores_gemma":[0.0000275113,0.000005210781,0.00007676124,0.000012546414,0.0000057828734,0.000034749428,0.00010915343,0.0019267092,0.00008922464,0.99487287,0.002831427,0.000007956807],"about_ca_topic_score_codex":0.0024323866,"about_ca_topic_score_gemma":0.0024892278,"teacher_disagreement_score":0.026244357,"about_ca_system_score_codex":0.0026485047,"about_ca_system_score_gemma":0.0020258692,"threshold_uncertainty_score":0.08779615},"labels":[],"label_agreement":null},{"id":"W1977922362","doi":"10.1016/j.jmaa.2010.06.054","title":"A conjugacy criterion for pure <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mi>E</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math>-semigroups","year":2010,"lang":"lv","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Conjugacy class; Semigroup; Mathematics; Class (philosophy); Invariant (physics); Discrete mathematics; Pure mathematics; Artificial intelligence; Computer science; Mathematical physics","score_opus":0.015365472009557405,"score_gpt":0.2551968415981379,"score_spread":0.23983136958858048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977922362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28624368,0.00077186147,0.49343744,0.0038182249,0.0005872096,0.00029969244,0.0006137759,0.0007184002,0.21350984],"genre_scores_gemma":[0.8827348,0.0004303346,0.05699432,0.0008198165,0.000725848,0.00035402612,0.0009416734,0.0005737797,0.05642546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974554,0.00062677055,0.00024137647,0.00064874237,0.0006858512,0.00034187987],"domain_scores_gemma":[0.9837014,0.009867535,0.0006203673,0.0013442646,0.0029694315,0.0014970691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033721288,0.0006274505,0.0009560565,0.0027278038,0.004368394,0.00638629,0.001171246,0.0021290893,0.011608764],"category_scores_gemma":[0.016055733,0.0006360833,0.0012823689,0.0012067144,0.005260069,0.007126063,0.0049315696,0.003479978,0.0040277215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005282831,0.00004347652,0.0007318718,0.000033512213,0.000008315987,0.00011038826,0.00028071477,0.00038712067,0.0014779564,0.9884475,0.001678464,0.006747758],"study_design_scores_gemma":[0.000031365475,0.00005940145,0.0003986038,0.000026565413,0.000014989533,0.00023209346,0.00015998427,0.0066353367,0.0036801107,0.98174345,0.0069897757,0.000028314165],"about_ca_topic_score_codex":0.00083420984,"about_ca_topic_score_gemma":0.0007209483,"teacher_disagreement_score":0.011608764,"about_ca_system_score_codex":0.0029393001,"about_ca_system_score_gemma":0.0019005393,"threshold_uncertainty_score":0.03883511},"labels":[],"label_agreement":null},{"id":"W1978592724","doi":"10.1016/s0304-3975(02)00574-1","title":"Weak repetitions in Sturmian strings","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; String (physics); Quadratic equation; Combinatorics; Encoding (memory); Discrete mathematics; Algorithm; Computer science","score_opus":0.007899106622770134,"score_gpt":0.23426777702779686,"score_spread":0.22636867040502673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978592724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71463454,0.00095557683,0.21828894,0.0016129188,0.00042862713,0.000074333184,0.0002459953,0.0011540083,0.06260512],"genre_scores_gemma":[0.96302396,0.00021799548,0.019784225,0.00032467974,0.00030057106,0.00009702307,0.0001666303,0.00018711801,0.015897853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809545,0.00066131103,0.0001731619,0.00032900774,0.00049354363,0.00024756795],"domain_scores_gemma":[0.9920324,0.0056753834,0.000529895,0.0008230995,0.0005520735,0.0003871183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018739741,0.000568513,0.0010485706,0.0020410176,0.0025477489,0.0029711158,0.0010833034,0.0020088062,0.0067561283],"category_scores_gemma":[0.00875916,0.0008817649,0.0010933751,0.0017638474,0.0036436026,0.006115638,0.002472596,0.0024472508,0.001306865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009440097,0.000019753448,0.0004038184,0.000057028257,0.000009190054,0.00028434512,0.000855231,0.00073052855,0.002747047,0.98806274,0.0005540296,0.006181835],"study_design_scores_gemma":[0.00001967334,0.00004010132,0.00024122828,0.000016623684,0.000016249749,0.00026820158,0.00012384538,0.0038116078,0.0017742036,0.9920935,0.001575049,0.000019753203],"about_ca_topic_score_codex":0.00029227426,"about_ca_topic_score_gemma":0.00039003755,"teacher_disagreement_score":0.0067561283,"about_ca_system_score_codex":0.00075691094,"about_ca_system_score_gemma":0.00042903973,"threshold_uncertainty_score":0.022601485},"labels":[],"label_agreement":null},{"id":"W1978605527","doi":"10.1007/s00224-003-1109-3","title":"Nesting Until and Since in Linear Temporal Logic","year":2003,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decidability; Linear temporal logic; Nesting (process); Characterization (materials science); Temporal logic; Hierarchy; Property (philosophy); Interval temporal logic; Class (philosophy); Mathematics; Computation tree logic; Algebraic number; Semigroup; Discrete mathematics; Substitution (logic); Computer science; Algebra over a field; Pure mathematics; Theoretical computer science; Algorithm; Artificial intelligence; Programming language","score_opus":0.021368154774561464,"score_gpt":0.24649091455748412,"score_spread":0.22512275978292265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978605527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05003611,0.0042864876,0.8929422,0.004173083,0.00081563304,0.00010065223,0.0003855676,0.0015488266,0.04571149],"genre_scores_gemma":[0.74287647,0.0022679255,0.22599189,0.0013909995,0.00087134686,0.00017774255,0.00046865825,0.0006993565,0.025255585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99659437,0.001522722,0.00029305555,0.0006871937,0.0005502396,0.00035228734],"domain_scores_gemma":[0.9913224,0.00580027,0.0006195341,0.0011739017,0.00066772895,0.00041612264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042757555,0.0008174595,0.0013460059,0.00146068,0.003878002,0.006537159,0.0022375858,0.0016200528,0.0055911047],"category_scores_gemma":[0.010536814,0.0016946847,0.0017370064,0.0023619304,0.007977165,0.02039082,0.0034035651,0.004566599,0.0012164592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042766816,0.000013390937,0.00013126568,0.000036182715,0.0000052293935,0.00005271321,0.0005957673,0.0007672935,0.0002583088,0.99022686,0.000716261,0.0071538487],"study_design_scores_gemma":[0.000009368611,0.000008701232,0.000022724524,0.000013173638,0.000015504245,0.000041322062,0.0000567212,0.003624971,0.00024921627,0.99297184,0.002975048,0.000011392627],"about_ca_topic_score_codex":0.00439486,"about_ca_topic_score_gemma":0.0054382407,"teacher_disagreement_score":0.006537159,"about_ca_system_score_codex":0.0026113421,"about_ca_system_score_gemma":0.0022840078,"threshold_uncertainty_score":0.022612631},"labels":[],"label_agreement":null},{"id":"W1978707564","doi":"10.1016/j.tcs.2012.04.011","title":"Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Suffix; Prefix; Regular language; Cardinality (data modeling); Mathematics; Combinatorics; Discrete mathematics; Conjecture; Upper and lower bounds; Computer science; Linguistics; Artificial intelligence; Automaton","score_opus":0.020163731806501314,"score_gpt":0.2615775143125849,"score_spread":0.24141378250608359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978707564","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94087607,0.00039152088,0.038503245,0.0018417687,0.000033472894,0.00003379271,0.0008094703,0.000310158,0.017200572],"genre_scores_gemma":[0.9916865,0.00014396376,0.005039089,0.00010089875,0.00006714028,0.00003506028,0.00067520415,0.00008533491,0.002166667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778855,0.00045674652,0.00019013771,0.00035823652,0.0007665035,0.00043981054],"domain_scores_gemma":[0.98032206,0.015509022,0.0012420375,0.0010158095,0.0012125394,0.00069846393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001717566,0.00037719807,0.001100134,0.00168082,0.0019440859,0.005394017,0.0017070506,0.0014398127,0.008089474],"category_scores_gemma":[0.010783702,0.0006556845,0.0013588914,0.0017865602,0.0030693598,0.010041627,0.0018997497,0.0022409149,0.0005443663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061506574,0.00015844249,0.006446753,0.00021474097,0.000056614033,0.0004996891,0.0021846825,0.019462937,0.0059473305,0.9465096,0.002444142,0.015460025],"study_design_scores_gemma":[0.000044826607,0.000034734323,0.0016951099,0.000015691458,0.000042745673,0.00021295644,0.00034067425,0.040860012,0.0021238613,0.95356363,0.0010218119,0.000044011053],"about_ca_topic_score_codex":0.002276805,"about_ca_topic_score_gemma":0.0021062384,"teacher_disagreement_score":0.008089474,"about_ca_system_score_codex":0.002218106,"about_ca_system_score_gemma":0.0016307265,"threshold_uncertainty_score":0.027061999},"labels":[],"label_agreement":null},{"id":"W1979037305","doi":"10.1142/s0218196706003311","title":"THE SEMIGROUP OF CONJUGATES OF A WORD","year":2006,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University; Royal Society","keywords":"Mathematics; Semigroup; Conjugacy class; Bicyclic semigroup; Alphabet; Monoid; Word (group theory); Cancellative semigroup; Free monoid; Class (philosophy); Syntactic monoid; Word problem (mathematics education); Combinatorics on words; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Arithmetic; Computer science; Linguistics; Artificial intelligence","score_opus":0.00472986314400044,"score_gpt":0.23381544225607148,"score_spread":0.22908557911207103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979037305","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5582774,0.0011791374,0.31383672,0.001398778,0.0016589955,0.00023930454,0.00046659142,0.0006574283,0.12228556],"genre_scores_gemma":[0.92910165,0.00048178885,0.035623673,0.00030118166,0.00060992275,0.0002000727,0.00026827454,0.00017518815,0.033238262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989213,0.00020945643,0.00010030813,0.00032666483,0.0003015632,0.0001408546],"domain_scores_gemma":[0.9984823,0.00048519223,0.00019608876,0.00023444547,0.0002972806,0.00030467744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083011115,0.0005384096,0.0004583378,0.0011515443,0.0016799466,0.003356376,0.00057632214,0.00080455263,0.0069687003],"category_scores_gemma":[0.002079279,0.00033121897,0.00081745366,0.000552391,0.0023822088,0.003765353,0.0023650052,0.0010326992,0.0016828906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006732709,0.00003544506,0.00044352136,0.000040602325,0.000008712502,0.00062265474,0.0007184905,0.00046646275,0.0061216047,0.9828075,0.00056615256,0.008101309],"study_design_scores_gemma":[0.00003908369,0.000193958,0.0005604685,0.000030834177,0.000026244452,0.0013434578,0.00035567515,0.008949427,0.011220966,0.9449407,0.03229433,0.000044967466],"about_ca_topic_score_codex":0.00024992833,"about_ca_topic_score_gemma":0.00015403314,"teacher_disagreement_score":0.0069687003,"about_ca_system_score_codex":0.0008318694,"about_ca_system_score_gemma":0.0007226288,"threshold_uncertainty_score":0.023312628},"labels":[],"label_agreement":null},{"id":"W1979340931","doi":"10.1016/j.laa.2006.03.002","title":"Unitarily achievable zero patterns and traces of words in A and A","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Zero (linguistics); Combinatorics; Pure mathematics; Linguistics","score_opus":0.0064196656218465,"score_gpt":0.21743536230803434,"score_spread":0.21101569668618783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979340931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57497746,0.00041220122,0.36373937,0.0012906719,0.00022198798,0.00016166351,0.00058830413,0.00072237436,0.057885826],"genre_scores_gemma":[0.95393634,0.00017352078,0.03030087,0.00017466203,0.00006782178,0.00023723108,0.00037266186,0.00018691419,0.014549986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99657804,0.0009364791,0.00032998808,0.0007736434,0.00060928735,0.0007724638],"domain_scores_gemma":[0.991269,0.004586635,0.0008317604,0.0012033841,0.0010467164,0.0010624214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018677455,0.0010046513,0.0012080082,0.0017831365,0.0031947615,0.0062063895,0.002195114,0.0022693013,0.0067375824],"category_scores_gemma":[0.010442583,0.0010461316,0.0017230806,0.0015746767,0.0057419734,0.008509468,0.0044003865,0.0036971483,0.0010112677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107059284,0.000044850007,0.0003307762,0.000033489767,0.000013458389,0.00014374193,0.0007497501,0.00063628185,0.001599447,0.9927908,0.00023587423,0.0033143428],"study_design_scores_gemma":[0.0000139167805,0.000029799505,0.00009929123,0.000013385757,0.000009780842,0.00008032166,0.0003052482,0.0031828012,0.0017457061,0.9937955,0.00071055157,0.000013655807],"about_ca_topic_score_codex":0.0011901798,"about_ca_topic_score_gemma":0.0009313142,"teacher_disagreement_score":0.0067375824,"about_ca_system_score_codex":0.0016084402,"about_ca_system_score_gemma":0.001891512,"threshold_uncertainty_score":0.022539496},"labels":[],"label_agreement":null},{"id":"W1979358057","doi":"10.1016/j.tcs.2008.06.009","title":"Rich, Sturmian, and trapezoidal words","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics","score_opus":0.010044828997486724,"score_gpt":0.2248701033556216,"score_spread":0.21482527435813487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979358057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51443845,0.0047538313,0.26638463,0.0039401255,0.0005888283,0.000088635396,0.00063358364,0.0006583947,0.2085135],"genre_scores_gemma":[0.9524329,0.00058897276,0.023955993,0.000330423,0.00014275363,0.000055612578,0.00020970563,0.0000739646,0.022209639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952745,0.00013319057,0.000038721537,0.00010859559,0.00010407306,0.00008806247],"domain_scores_gemma":[0.9984144,0.00078893173,0.00014990775,0.00024049933,0.0002705882,0.00013565889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008416878,0.00034119238,0.0006373388,0.0014790398,0.0018930555,0.0020730884,0.00049864856,0.0007945547,0.008960636],"category_scores_gemma":[0.004007076,0.0003075014,0.0006538573,0.0012241296,0.0031207323,0.004036563,0.0013902693,0.0010982413,0.0010392601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023808947,0.000002788898,0.00008781702,0.0000134083675,0.0000022769052,0.00003615246,0.00019329651,0.00027201086,0.00030106358,0.99594903,0.00057077286,0.00254749],"study_design_scores_gemma":[0.0000063007983,0.000008993771,0.00007700006,0.0000069263197,0.0000054680822,0.00007743794,0.00011268228,0.0014742409,0.00019984948,0.9951427,0.0028810538,0.000007237161],"about_ca_topic_score_codex":0.0012473988,"about_ca_topic_score_gemma":0.0014779043,"teacher_disagreement_score":0.008960636,"about_ca_system_score_codex":0.00088354707,"about_ca_system_score_gemma":0.0005187495,"threshold_uncertainty_score":0.029976308},"labels":[],"label_agreement":null},{"id":"W1979795169","doi":"10.1090/s0002-9947-2011-05379-1","title":"An effective lower bound for group complexity of finite semigroups and automata","year":2011,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Krohn–Rhodes theory; Mathematics; Prime (order theory); Special classes of semigroups; Semigroup; Finite group; Group (periodic table); Discrete mathematics; Finite-state machine; Prime factor; Algebraic number; Decomposition; Algebra over a field; Combinatorics; Pure mathematics; Algorithm","score_opus":0.026718420621851077,"score_gpt":0.2634378449982115,"score_spread":0.2367194243763604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979795169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05876291,0.0140853645,0.72721696,0.018655647,0.0020452428,0.00017375356,0.0013173019,0.001183075,0.17655985],"genre_scores_gemma":[0.7531796,0.009661327,0.18548907,0.005103665,0.0072719874,0.0012302344,0.001998664,0.0013029452,0.034762505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98962855,0.001659355,0.000492949,0.001710276,0.0047710505,0.0017378535],"domain_scores_gemma":[0.9654697,0.02540241,0.0007699865,0.004271993,0.002210124,0.0018758278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006798398,0.0024435765,0.0028098966,0.0073035043,0.00361551,0.0085806325,0.0047341576,0.003635484,0.014630113],"category_scores_gemma":[0.033548262,0.0008423645,0.0027623798,0.0045999447,0.007166163,0.021610301,0.0076100137,0.011126518,0.0036378007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000573745,0.000055242013,0.00032727892,0.00011223797,0.000022468006,0.00008248702,0.0001822214,0.003404456,0.00085831224,0.9764705,0.005731913,0.0126953805],"study_design_scores_gemma":[0.00001592666,0.000033034245,0.00021502326,0.00005748679,0.000035547913,0.0001129734,0.000040606592,0.01919661,0.0014890525,0.9675357,0.011236761,0.000031400497],"about_ca_topic_score_codex":0.0008889274,"about_ca_topic_score_gemma":0.0011452679,"teacher_disagreement_score":0.014630113,"about_ca_system_score_codex":0.0051954524,"about_ca_system_score_gemma":0.0016779876,"threshold_uncertainty_score":0.048942566},"labels":[],"label_agreement":null},{"id":"W1980577621","doi":"10.1142/s012905410400242x","title":"ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS","year":2004,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université du Québec à Montréal","funders":"","keywords":"Palindrome; Mathematics; Combinatorics on words; Set (abstract data type); Product (mathematics); Enumeration; Simple (philosophy); Combinatorics; Existential quantification; Discrete mathematics; Word (group theory); Computer science","score_opus":0.03640076233099542,"score_gpt":0.30195530541704296,"score_spread":0.26555454308604753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980577621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79326206,0.0016974149,0.16892196,0.002312523,0.00006894378,0.00010303283,0.00032350596,0.00018486525,0.033125777],"genre_scores_gemma":[0.9617866,0.0007426891,0.030912125,0.00016339301,0.0002109888,0.000136935,0.00038835697,0.000069232934,0.005589597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862254,0.00034618055,0.00012616861,0.00031972866,0.0004015906,0.00018387349],"domain_scores_gemma":[0.9851665,0.0121941315,0.0011031219,0.0006125353,0.00055508903,0.00036859364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001316542,0.0004778468,0.0009281465,0.0013675563,0.0012938874,0.0036407611,0.0011870781,0.0014180737,0.004308236],"category_scores_gemma":[0.013283758,0.000660231,0.0008240293,0.001351218,0.0036059152,0.006949874,0.0018826687,0.0019640669,0.0004917739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017768741,0.00008867344,0.0019103934,0.00033304893,0.000024102319,0.0004597357,0.0016127812,0.026082031,0.0062848646,0.9439925,0.00081643736,0.018217798],"study_design_scores_gemma":[0.000035077486,0.00007488931,0.00062578206,0.000050449577,0.000018662873,0.00025586225,0.0002448566,0.034224745,0.0024454356,0.95961356,0.002380346,0.000030172892],"about_ca_topic_score_codex":0.00057794957,"about_ca_topic_score_gemma":0.0005203598,"teacher_disagreement_score":0.004308236,"about_ca_system_score_codex":0.0015610824,"about_ca_system_score_gemma":0.0005630857,"threshold_uncertainty_score":0.014412463},"labels":[],"label_agreement":null},{"id":"W1981471007","doi":"10.1016/j.aam.2011.11.002","title":"Toward a language theoretic proof of the four color theorem","year":2011,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Statement (logic); Parsing; Binary tree; Word (group theory); Simple (philosophy); Parse tree","score_opus":0.018778643605686242,"score_gpt":0.2382150284497964,"score_spread":0.21943638484411015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981471007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0221037,0.00079290086,0.8611083,0.011611969,0.0014887195,0.000080830534,0.00035644643,0.0014225009,0.10103467],"genre_scores_gemma":[0.5751301,0.0012438919,0.36016735,0.009581776,0.0013574174,0.00041169478,0.00056976057,0.0015035935,0.050034396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982497,0.0005760642,0.000070124646,0.00035147395,0.0005248056,0.00022786745],"domain_scores_gemma":[0.9947955,0.003005049,0.00020164181,0.00065163197,0.001043291,0.00030285964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024729208,0.0010749383,0.0010455641,0.0018302205,0.0026712397,0.0036321362,0.0033086434,0.0019153256,0.016412444],"category_scores_gemma":[0.0078036883,0.00096680585,0.0026956252,0.0014907243,0.0060417983,0.009744025,0.0063073705,0.007386508,0.0035958367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017246817,0.000019719582,0.000056459066,0.00003804059,0.0000056985973,0.000055034816,0.00019486433,0.0004288463,0.0006546975,0.9927833,0.0026556854,0.0030902873],"study_design_scores_gemma":[0.000014479692,0.000008530083,0.00004718423,0.000013737602,0.00000792549,0.000046608817,0.000060042592,0.0032695157,0.00077132945,0.98801583,0.0077316877,0.000013168856],"about_ca_topic_score_codex":0.002129141,"about_ca_topic_score_gemma":0.0016442608,"teacher_disagreement_score":0.016412444,"about_ca_system_score_codex":0.0025063467,"about_ca_system_score_gemma":0.0017407252,"threshold_uncertainty_score":0.054905057},"labels":[],"label_agreement":null},{"id":"W1981675591","doi":"10.1090/s0025-5718-01-01336-9","title":"Some computations on the spectra of Pisot and Salem numbers","year":2001,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Combinatorics; Computation; Line (geometry); Class (philosophy); Discrete mathematics; Algorithm; Geometry","score_opus":0.019167437485328242,"score_gpt":0.2511285033220414,"score_spread":0.23196106583671317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981675591","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26259005,0.00353188,0.25686663,0.0060071023,0.0011198688,0.0000828609,0.0010249256,0.00086169224,0.46791512],"genre_scores_gemma":[0.88019675,0.0020973291,0.064039394,0.0009088956,0.0010022706,0.00013547846,0.0008385229,0.00060727535,0.05017405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993374,0.0001244863,0.000035853103,0.000109176326,0.00027926627,0.00011384688],"domain_scores_gemma":[0.998558,0.00074215326,0.00014729719,0.00013979773,0.0002440095,0.0001687856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011321299,0.0008233284,0.0006639982,0.002616623,0.0016483386,0.0033786334,0.0010602146,0.00077148696,0.019432787],"category_scores_gemma":[0.006223365,0.0003739061,0.0010317527,0.0020328911,0.0027511457,0.006039387,0.0020456167,0.0022736941,0.003952322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030019719,0.0000087026665,0.00017751349,0.000038269754,0.0000038314183,0.000058216727,0.00021058829,0.00076328707,0.00030337845,0.9876837,0.0028299969,0.007892526],"study_design_scores_gemma":[0.000008327937,0.000010314903,0.00030662084,0.00002989528,0.000004940774,0.00006949064,0.00010621543,0.0050326497,0.000497812,0.9880816,0.0058415597,0.000010586688],"about_ca_topic_score_codex":0.0017624561,"about_ca_topic_score_gemma":0.0016279225,"teacher_disagreement_score":0.019432787,"about_ca_system_score_codex":0.002091153,"about_ca_system_score_gemma":0.0007533212,"threshold_uncertainty_score":0.06500912},"labels":[],"label_agreement":null},{"id":"W1982010621","doi":"10.1007/s00236-006-0030-z","title":"On Abelian 2-avoidable binary patterns","year":2006,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Theory of computation; Binary number; Abelian group; Computer science; Mathematics; Combinatorics; Algorithm; Arithmetic","score_opus":0.00457864365006878,"score_gpt":0.19233578705940937,"score_spread":0.1877571434093406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982010621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63389874,0.00096599525,0.25351638,0.0018511978,0.0007440717,0.00011846309,0.0005720424,0.0006770638,0.10765597],"genre_scores_gemma":[0.91510355,0.00045562835,0.034249537,0.000509942,0.00035234497,0.00017805962,0.00048460148,0.00023865605,0.04842767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870825,0.00030147558,0.00010656091,0.0002721546,0.00031098523,0.0003005423],"domain_scores_gemma":[0.99673444,0.0019012089,0.0003813883,0.00042283608,0.0002931991,0.00026683122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007223268,0.00075857353,0.0009568066,0.0017446248,0.0018117875,0.0027582769,0.0010807357,0.0014601634,0.012422773],"category_scores_gemma":[0.0038275295,0.00070404256,0.00087502075,0.0018641728,0.0021288483,0.0051849536,0.002955326,0.0017633036,0.0015329001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012879616,0.000034147837,0.0003857065,0.000068354544,0.00001043538,0.00039301204,0.0005920791,0.0009634569,0.0024984926,0.9820694,0.0012700093,0.011586124],"study_design_scores_gemma":[0.000024115283,0.000024302544,0.00020429627,0.000015301746,0.000007885187,0.00036632738,0.00012812178,0.0034830435,0.0007331534,0.9921744,0.002824854,0.00001431496],"about_ca_topic_score_codex":0.00049844343,"about_ca_topic_score_gemma":0.00049697043,"teacher_disagreement_score":0.012422773,"about_ca_system_score_codex":0.000725772,"about_ca_system_score_gemma":0.00047918645,"threshold_uncertainty_score":0.041558325},"labels":[],"label_agreement":null},{"id":"W1982284230","doi":"10.1081/agb-120015672","title":"AXIOMATISABILITY OF WEAKLY FLAT, FLAT, AND PROJECTIVE<i>S</i>-ACTS","year":2002,"lang":"en","type":"article","venue":"Communications in Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Wilfrid Laurier University","keywords":"Mathematics; Class (philosophy); Order (exchange); Pure mathematics; Projective test; Computer science; Artificial intelligence","score_opus":0.041138142201751014,"score_gpt":0.2761499688212992,"score_spread":0.2350118266195482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982284230","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83052826,0.00028850394,0.13065475,0.0008531573,0.00010953253,0.000123973,0.0007425898,0.0012976797,0.035401665],"genre_scores_gemma":[0.98707145,0.000052987412,0.0092145745,0.00009991505,0.00003174789,0.00003021776,0.0005492729,0.000042921645,0.0029068675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684036,0.0007520882,0.00044369441,0.00084485795,0.0005888069,0.0005301557],"domain_scores_gemma":[0.991981,0.0031780915,0.00089037477,0.0013357616,0.0013441682,0.0012705881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002029791,0.00039903977,0.0005007164,0.0010888615,0.0016344712,0.0027089925,0.0007167643,0.0006787666,0.004853199],"category_scores_gemma":[0.004558177,0.00050572766,0.0013295169,0.00045547716,0.005047758,0.0031537497,0.0023854054,0.0014527426,0.0005069649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050683785,0.00012294308,0.017405737,0.00019583508,0.00009403315,0.0015162049,0.0027516629,0.0054038013,0.018298749,0.9307958,0.0017988988,0.021109546],"study_design_scores_gemma":[0.00017539701,0.0005701613,0.020725321,0.00011466717,0.00017243484,0.0022180404,0.0025424273,0.03376511,0.049454264,0.8639955,0.026100596,0.00016616886],"about_ca_topic_score_codex":0.0020024143,"about_ca_topic_score_gemma":0.002049451,"teacher_disagreement_score":0.004853199,"about_ca_system_score_codex":0.001157127,"about_ca_system_score_gemma":0.0013690667,"threshold_uncertainty_score":0.01623553},"labels":[],"label_agreement":null},{"id":"W1982678879","doi":"10.1016/j.ic.2008.06.007","title":"Detecting palindromes, patterns and borders in regular languages","year":2009,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Palindrome; Word (group theory); Regular language; Automaton; Computer science; Combinatorics on words; Combinatorics; Matching (statistics); Mathematics; Artificial intelligence; Biology","score_opus":0.00515848780118209,"score_gpt":0.2469158703377372,"score_spread":0.24175738253655513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982678879","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9139327,0.00010995906,0.08311388,0.00013352728,0.000021032738,0.000038619142,0.00018137485,0.0004543754,0.0020145634],"genre_scores_gemma":[0.9747277,0.00002482074,0.02429563,0.00003227309,0.0000095527075,0.000022637529,0.00017663371,0.000051056457,0.00065970566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923325,0.00014666021,0.00007694907,0.00030101568,0.00014312656,0.00009895205],"domain_scores_gemma":[0.9895551,0.006852038,0.0011831868,0.001306339,0.0007079362,0.00039546823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085453974,0.00027727283,0.0006766133,0.0008344297,0.0006605648,0.0015163508,0.0009073962,0.0011650964,0.001567135],"category_scores_gemma":[0.007943787,0.0004907369,0.0004333697,0.0004720501,0.0015155438,0.0030818412,0.0012522277,0.0009135024,0.00029655025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0051901727,0.00072026224,0.097515665,0.0008721351,0.00014902597,0.004443833,0.0053336807,0.04286451,0.30394122,0.31071758,0.00304392,0.22520795],"study_design_scores_gemma":[0.0002398439,0.0007100016,0.012483683,0.000098175384,0.00012741919,0.0024108053,0.0025227645,0.3563802,0.14861712,0.47192934,0.0043588895,0.00012190551],"about_ca_topic_score_codex":0.0004947671,"about_ca_topic_score_gemma":0.0006456886,"teacher_disagreement_score":0.001567135,"about_ca_system_score_codex":0.00033840843,"about_ca_system_score_gemma":0.00041435362,"threshold_uncertainty_score":0.005242586},"labels":[],"label_agreement":null},{"id":"W1982828667","doi":"10.1016/j.endm.2009.07.047","title":"Codings of rotations on two intervals are full","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Combinatorics on words; Binary number; Partition (number theory); Sequence (biology); Unit circle; Discrete mathematics; Arithmetic; Geometry; Word (group theory)","score_opus":0.013119776257716733,"score_gpt":0.2794030656433672,"score_spread":0.2662832893856505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982828667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2564877,0.0010226974,0.53602976,0.0025803377,0.0014839566,0.00022463764,0.0019991167,0.0029043986,0.19726743],"genre_scores_gemma":[0.913454,0.0004733466,0.047490165,0.0005058006,0.00023574632,0.00021848286,0.0010213742,0.0006198349,0.03598123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987501,0.0002559344,0.00008308189,0.00023851341,0.0003445337,0.00032775677],"domain_scores_gemma":[0.9965127,0.0013829152,0.00025575882,0.0010472679,0.0005244733,0.00027689486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059346796,0.00058507326,0.0006305162,0.001014238,0.001232094,0.0025026463,0.0009355382,0.0011479914,0.016922558],"category_scores_gemma":[0.0056586764,0.00049123087,0.0007933283,0.0013728001,0.0018179242,0.004331979,0.002168057,0.002198737,0.0027137774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015889342,0.00002230785,0.00011541379,0.000048470614,0.0000061873693,0.00013838669,0.00037479616,0.001812273,0.0025025795,0.95852387,0.0034164882,0.032880355],"study_design_scores_gemma":[0.000030028294,0.000034098146,0.00019569203,0.000026249432,0.00001012361,0.00013248499,0.00018464637,0.008109458,0.0027990905,0.97924405,0.009205139,0.00002902213],"about_ca_topic_score_codex":0.0010504719,"about_ca_topic_score_gemma":0.0007638966,"teacher_disagreement_score":0.016922558,"about_ca_system_score_codex":0.0006684736,"about_ca_system_score_gemma":0.0007218104,"threshold_uncertainty_score":0.056611598},"labels":[],"label_agreement":null},{"id":"W1982921028","doi":"10.1016/j.disc.2008.01.028","title":"On the fractional chromatic number of monotone self-dual Boolean functions","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Mathematics; Monotone polygon; Chromatic scale; Dual (grammatical number); Discrete mathematics; Combinatorics; Boolean function","score_opus":0.01700502452972911,"score_gpt":0.2437170119604473,"score_spread":0.2267119874307182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982921028","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8694304,0.0009845844,0.06793691,0.0018570181,0.0002566946,0.000035909412,0.00019407207,0.00019641667,0.05910794],"genre_scores_gemma":[0.98506343,0.0003562208,0.006804642,0.00015289016,0.0002000723,0.000041211606,0.000104701554,0.000060470993,0.007216323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993494,0.00019654843,0.000025398522,0.00013333,0.00014557468,0.00014971322],"domain_scores_gemma":[0.9938928,0.004183814,0.00054623734,0.00041486902,0.0003642765,0.00059797114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018371161,0.0007167093,0.0009008976,0.003107937,0.002311785,0.0041769827,0.001554304,0.0015883899,0.0070094587],"category_scores_gemma":[0.0074060457,0.00051454594,0.0006646877,0.0016766214,0.005591102,0.006297283,0.001727036,0.0022600535,0.00039243535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014154859,0.000021582418,0.00046660923,0.000030504954,0.000006063705,0.00003081848,0.00016249718,0.0029909818,0.0013848075,0.9912266,0.000509579,0.0030283679],"study_design_scores_gemma":[0.00003578966,0.000026991069,0.0005729356,0.000022636821,0.0000145331205,0.00007588423,0.00008624499,0.029176248,0.0011467589,0.9673935,0.0014220934,0.000026329337],"about_ca_topic_score_codex":0.0017701834,"about_ca_topic_score_gemma":0.0015327177,"teacher_disagreement_score":0.0070094587,"about_ca_system_score_codex":0.0033656352,"about_ca_system_score_gemma":0.0008106901,"threshold_uncertainty_score":0.024419487},"labels":[],"label_agreement":null},{"id":"W1983278039","doi":"10.1016/j.tcs.2004.03.002","title":"On the number of nonterminals in linear conjunctive grammars","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Terminal and nonterminal symbols; Indexed grammar; Mathematics; Context-sensitive grammar; Disjoint sets; Discrete mathematics; Combinatorics; Rule-based machine translation; Context-free grammar; Computer science; Natural language processing","score_opus":0.00953662867562726,"score_gpt":0.262570027593138,"score_spread":0.25303339891751075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983278039","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5145016,0.0034981146,0.40355238,0.013334417,0.0006960816,0.00018383602,0.0013600467,0.0011428394,0.061730668],"genre_scores_gemma":[0.9090303,0.0013664325,0.072725244,0.0008294462,0.00086655887,0.00034305852,0.0007886874,0.00071525754,0.013334929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9892209,0.004876843,0.00084170327,0.0017549681,0.0022117211,0.0010939034],"domain_scores_gemma":[0.6763392,0.30108488,0.006458285,0.008604023,0.003332574,0.004181043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011161062,0.0012926698,0.0035462673,0.0031913223,0.0038609602,0.008338503,0.005717877,0.0045295283,0.012224116],"category_scores_gemma":[0.07426928,0.002872875,0.0022375986,0.0032537468,0.010598543,0.034174856,0.005441917,0.0068453043,0.0012709778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011270259,0.00023548775,0.005465884,0.0004127452,0.000083803585,0.0005411667,0.0012909363,0.045234002,0.0032578735,0.9109809,0.0041915462,0.027178757],"study_design_scores_gemma":[0.00007556637,0.000056532514,0.0006343683,0.00006366295,0.00005686826,0.00028771523,0.00016700933,0.07675021,0.0012299152,0.91928905,0.0013486941,0.00004046902],"about_ca_topic_score_codex":0.0013068564,"about_ca_topic_score_gemma":0.0018605331,"teacher_disagreement_score":0.012224116,"about_ca_system_score_codex":0.0033035495,"about_ca_system_score_gemma":0.0017905573,"threshold_uncertainty_score":0.059026003},"labels":[],"label_agreement":null},{"id":"W1983564337","doi":"10.1016/s0166-218x(00)00338-3","title":"On the robustness of primitive words","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Prefix; Morphism; Robustness (evolution); Arithmetic; Symbol (formal); Combinatorics; Theoretical computer science; Computer science; Linguistics; Programming language; Biology","score_opus":0.02056261474225464,"score_gpt":0.21674798330922246,"score_spread":0.19618536856696783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983564337","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5795985,0.0022988417,0.35981,0.004206001,0.00028249537,0.00011621726,0.000867633,0.00081570604,0.052004587],"genre_scores_gemma":[0.9792671,0.00060248235,0.013833328,0.00032592987,0.00033149633,0.00009079015,0.0004134408,0.00021325443,0.004922122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99616086,0.0014221692,0.0002782047,0.00082273525,0.00089089974,0.00042513415],"domain_scores_gemma":[0.9185444,0.0641503,0.0049061007,0.0078006224,0.0029266274,0.0016719736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004135311,0.00083916844,0.0016561546,0.002448655,0.0014674063,0.004067645,0.0020040877,0.0023800498,0.005492537],"category_scores_gemma":[0.03923209,0.00079682865,0.0016915335,0.001409206,0.0067410897,0.009893686,0.004224567,0.0034947214,0.00070882245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055765203,0.000036516944,0.0011980325,0.00016364321,0.00007454587,0.00027138184,0.00075990567,0.025339492,0.005819069,0.9510933,0.0012719686,0.013414425],"study_design_scores_gemma":[0.000028408254,0.00006317836,0.00039627755,0.000019567637,0.00002917202,0.00007847677,0.000103665334,0.030808691,0.0016596904,0.9656584,0.0011303952,0.000024042887],"about_ca_topic_score_codex":0.00079460844,"about_ca_topic_score_gemma":0.00033735283,"teacher_disagreement_score":0.005492537,"about_ca_system_score_codex":0.0014337117,"about_ca_system_score_gemma":0.0005777756,"threshold_uncertainty_score":0.021869898},"labels":[],"label_agreement":null},{"id":"W198383578","doi":"10.1007/978-3-642-39310-5_22","title":"Finite Nondeterminism vs. DFAs with Multiple Initial States","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic finite automaton; Nondeterministic algorithm; Deterministic finite automaton; Automaton; Deterministic automaton; Upper and lower bounds; Computer science; Finite-state machine; Branching (polymer chemistry); Discrete mathematics; Combinatorics; Mathematics; Algorithm; Theoretical computer science; Automata theory","score_opus":0.012662829003552407,"score_gpt":0.2283965026510504,"score_spread":0.21573367364749801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198383578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1578382,0.005146004,0.6266427,0.0059176814,0.0009452681,0.00018377975,0.0012355398,0.0022048904,0.19988602],"genre_scores_gemma":[0.9092116,0.0013257099,0.06801264,0.00038619086,0.00022813755,0.00014938228,0.00052431045,0.0002949052,0.019867007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831855,0.00040038378,0.00017402065,0.00046067176,0.00037181453,0.00027464508],"domain_scores_gemma":[0.9917908,0.005225519,0.00026838988,0.0020134484,0.00046356415,0.00023824607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023467634,0.0005105355,0.00088007195,0.0008200231,0.0013525384,0.0036866285,0.0018727784,0.0017622607,0.00933459],"category_scores_gemma":[0.008653041,0.0005662736,0.0016856093,0.0010184369,0.0037212789,0.010168064,0.0021561175,0.0043503717,0.0013503111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014826478,0.00002816955,0.0002043815,0.000112012545,0.000012232825,0.0000682721,0.00013347794,0.0047900025,0.0014201582,0.9660471,0.0011437396,0.025892125],"study_design_scores_gemma":[0.000028166636,0.000032423526,0.00009298736,0.000053704214,0.000027611599,0.00012420096,0.000045142388,0.026626937,0.0030279187,0.9627705,0.0071531804,0.000017216737],"about_ca_topic_score_codex":0.0012931235,"about_ca_topic_score_gemma":0.0015501981,"teacher_disagreement_score":0.00933459,"about_ca_system_score_codex":0.0024850718,"about_ca_system_score_gemma":0.0013668734,"threshold_uncertainty_score":0.03122735},"labels":[],"label_agreement":null},{"id":"W1984007424","doi":"10.1007/pl00013319","title":"Even faster generalized LR parsing","year":2001,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Parsing; LR parser; Parsing expression grammar; Computer science; Property (philosophy); Top-down parsing; Parser combinator; Constant (computer programming); Grammar; Theory of computation; Rule-based machine translation; Symbol (formal); Algorithm; Artificial intelligence; Natural language processing; Programming language; Context-free grammar; L-attributed grammar","score_opus":0.013972496769763204,"score_gpt":0.22945046893613433,"score_spread":0.21547797216637113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984007424","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07113798,0.003672008,0.66576827,0.0100623,0.0037847713,0.00032517064,0.0061185714,0.12271823,0.11641283],"genre_scores_gemma":[0.46712098,0.0011924163,0.4302823,0.005438549,0.0016557091,0.00022003207,0.01186816,0.02583499,0.05638696],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9935644,0.002466763,0.00041046055,0.0016618129,0.0011318474,0.00076478504],"domain_scores_gemma":[0.9820886,0.0053523476,0.000279265,0.010534719,0.0014607803,0.00028440473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029746748,0.002422023,0.0024720046,0.0015669902,0.0016263919,0.0059293127,0.0028960055,0.0036515568,0.06876382],"category_scores_gemma":[0.01280018,0.0014982468,0.002664708,0.0025015124,0.0021074614,0.01492674,0.0056798095,0.0047373446,0.030633977],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012999086,0.0003391422,0.0014608966,0.0016500223,0.00030619928,0.0009872202,0.0012357642,0.010836348,0.042493522,0.28229097,0.22360569,0.4334943],"study_design_scores_gemma":[0.00023496423,0.0001318617,0.001183155,0.00022470855,0.00040827217,0.0011566018,0.0006420787,0.098333284,0.037831094,0.7239553,0.13566932,0.00022937095],"about_ca_topic_score_codex":0.002236115,"about_ca_topic_score_gemma":0.004418231,"teacher_disagreement_score":0.06876382,"about_ca_system_score_codex":0.0013422711,"about_ca_system_score_gemma":0.0022795363,"threshold_uncertainty_score":0.23003793},"labels":[],"label_agreement":null},{"id":"W1984639981","doi":"10.4153/cmb-2000-012-0","title":"Cyclotomic Schur Algebras and Blocks of Cyclic Defect","year":2000,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Schur algebra; Pure mathematics; Valuation (finance); Algebra over a field","score_opus":0.004662022834058795,"score_gpt":0.185368665746441,"score_spread":0.18070664291238223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984639981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9614519,0.0004647457,0.016527347,0.00025157924,0.00006563976,0.000050424027,0.0002848345,0.00014643703,0.02075712],"genre_scores_gemma":[0.9929507,0.00011652525,0.0022003816,0.000026969077,0.00004062903,0.000030412066,0.000212941,0.000014955582,0.0044065383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960834,0.000053376632,0.000024599223,0.000052337244,0.00013979418,0.00012161837],"domain_scores_gemma":[0.9987847,0.0002902857,0.00025023025,0.00017587117,0.00020480949,0.00029401944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030818582,0.00021038738,0.00048450902,0.0012876984,0.0007449797,0.00193185,0.00032981107,0.00039412655,0.0060117883],"category_scores_gemma":[0.0010929046,0.00018057763,0.00026939233,0.00079055043,0.001562356,0.0015916085,0.00074307167,0.0005642424,0.00065153424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026008525,0.000037057176,0.0035453085,0.000050620158,0.000008963921,0.00019651333,0.0004150015,0.0012623555,0.008485584,0.9781497,0.000995948,0.006592864],"study_design_scores_gemma":[0.000102903075,0.00025570634,0.005613396,0.00006549312,0.00003411115,0.0010181039,0.000874629,0.024023507,0.018845713,0.92422783,0.024888137,0.0000503738],"about_ca_topic_score_codex":0.0009643013,"about_ca_topic_score_gemma":0.00096078165,"teacher_disagreement_score":0.0060117883,"about_ca_system_score_codex":0.00060738693,"about_ca_system_score_gemma":0.00047598768,"threshold_uncertainty_score":0.020111442},"labels":[],"label_agreement":null},{"id":"W1984900662","doi":"10.1016/j.tcs.2012.03.045","title":"A study of Jacobi–Perron boundary words for the generation of discrete planes","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Mathematics; Generalization; Simple (philosophy); Dimension (graph theory); Boundary (topology); Focus (optics); Social connectedness; Fraction (chemistry); Plane (geometry); Line (geometry); Complex plane; Duality (order theory); Combinatorics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.028766549078336763,"score_gpt":0.28509171070294637,"score_spread":0.2563251616246096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984900662","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62607354,0.0021977401,0.25072625,0.0023131275,0.00047111424,0.00012120059,0.00018213305,0.0003264156,0.11758846],"genre_scores_gemma":[0.9543571,0.00043587995,0.02687446,0.00021060878,0.00016494683,0.00008095984,0.00014831213,0.00015162378,0.01757605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952495,0.00015985267,0.00003518312,0.00008470367,0.0001078339,0.00008753801],"domain_scores_gemma":[0.99815947,0.0010502958,0.00016100587,0.00019680122,0.00020915484,0.0002232663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087823486,0.0004695692,0.0007619874,0.001433266,0.0016701159,0.0025314328,0.0014944297,0.0018424382,0.01251304],"category_scores_gemma":[0.0046878858,0.00044416563,0.0009927418,0.00080973154,0.0027188626,0.0042330283,0.0015310037,0.0017362301,0.0010983167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014407386,0.000010595383,0.00009444346,0.000025776202,0.0000022312497,0.00006633486,0.00017647626,0.0014490862,0.000613649,0.9952585,0.00031298367,0.0019755904],"study_design_scores_gemma":[0.00001910723,0.000022929484,0.00014817703,0.000021381846,0.000005049661,0.00013667693,0.00020200215,0.020887379,0.00087481993,0.97577876,0.0018883816,0.000015370671],"about_ca_topic_score_codex":0.0005346047,"about_ca_topic_score_gemma":0.0004075799,"teacher_disagreement_score":0.01251304,"about_ca_system_score_codex":0.0012167443,"about_ca_system_score_gemma":0.0006099514,"threshold_uncertainty_score":0.041860282},"labels":[],"label_agreement":null},{"id":"W1986197414","doi":"10.1016/s0304-3975(03)00099-9","title":"Lyndon words, permutations and trees","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.007157902298393804,"score_gpt":0.23160806403191803,"score_spread":0.22445016173352422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986197414","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36433947,0.05897049,0.33598018,0.01243189,0.0021052188,0.000111398986,0.00097521575,0.00077149924,0.2243146],"genre_scores_gemma":[0.90439665,0.010898222,0.032088403,0.00090059347,0.0014989473,0.00014653284,0.00064252684,0.00009884659,0.049329404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992312,0.00027050136,0.000053014126,0.00017813609,0.00016526495,0.00010192676],"domain_scores_gemma":[0.9984919,0.0009892004,0.00017723763,0.00013398708,0.00010062395,0.00010711783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009162906,0.00060575636,0.00083253626,0.0018523602,0.0019879483,0.0040728003,0.0007616252,0.0018799173,0.007358905],"category_scores_gemma":[0.0036892584,0.00052005955,0.00056128955,0.0037356792,0.0056341216,0.007898853,0.0016513051,0.0018607146,0.0010830696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035055822,0.000009497719,0.00019285965,0.000055190852,0.000003588727,0.000067944464,0.00055230694,0.0005088541,0.0004198963,0.9868663,0.0015645636,0.009723861],"study_design_scores_gemma":[0.000005838652,0.000006470705,0.000080294914,0.000010206931,0.0000039182783,0.00006639754,0.00010530096,0.0005767794,0.000088977424,0.9937536,0.0052957945,0.0000064291116],"about_ca_topic_score_codex":0.0017265191,"about_ca_topic_score_gemma":0.0022076124,"teacher_disagreement_score":0.007358905,"about_ca_system_score_codex":0.0012792508,"about_ca_system_score_gemma":0.0007799296,"threshold_uncertainty_score":0.02461803},"labels":[],"label_agreement":null},{"id":"W1986611537","doi":"10.1016/s0195-6698(03)00044-1","title":"The set of k-power free words over Σ is empty or perfect","year":2003,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Alphabet; Combinatorics; Set (abstract data type); Natural number; Finite set; Power (physics); Power set; Discrete mathematics; Generating set of a group; Linguistics; Computer science; Mathematical analysis; Geometry","score_opus":0.014190143730028755,"score_gpt":0.23495079632413993,"score_spread":0.22076065259411118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986611537","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73002905,0.0030837907,0.13231769,0.0025139682,0.0007610345,0.00022682859,0.007419213,0.002446933,0.12120151],"genre_scores_gemma":[0.9577132,0.00087706384,0.01446038,0.00031336027,0.00021865414,0.00020397159,0.0026555448,0.00030634014,0.023251524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99682957,0.0004440636,0.0004166961,0.0009422956,0.0005679235,0.00079937506],"domain_scores_gemma":[0.9921549,0.0038472419,0.001086836,0.0011150362,0.0009122558,0.0008837793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016064438,0.0014143378,0.0018777488,0.002953416,0.004922861,0.011301946,0.0024822154,0.0021564604,0.011082357],"category_scores_gemma":[0.006508674,0.0012657064,0.001461762,0.0025687816,0.0076001487,0.01372809,0.0042863595,0.0018821054,0.0043215333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025482094,0.0001958944,0.009057846,0.0015341208,0.0004166843,0.0033242442,0.007195071,0.0018659417,0.017952323,0.88558143,0.009227318,0.061100855],"study_design_scores_gemma":[0.000066057044,0.00014483689,0.0021234744,0.00030279817,0.00019663431,0.0024043273,0.0022598878,0.0033840854,0.015423784,0.95559144,0.017955748,0.0001469709],"about_ca_topic_score_codex":0.0005273897,"about_ca_topic_score_gemma":0.00036321714,"teacher_disagreement_score":0.011301946,"about_ca_system_score_codex":0.0011090038,"about_ca_system_score_gemma":0.0013204751,"threshold_uncertainty_score":0.03707415},"labels":[],"label_agreement":null},{"id":"W1986652500","doi":"10.1016/j.tcs.2004.01.002","title":"Representing recursively enumerable languages by iterated deletion","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Recursively enumerable language; Iterated function; Decidability; Closure (psychology); Recursively enumerable set; Characterization (materials science); Mathematics; Maximal set; Discrete mathematics; Combinatorics; Algorithm; Computer science; Programming language; Set (abstract data type); Physics","score_opus":0.004844094767187674,"score_gpt":0.23947911913918926,"score_spread":0.2346350243720016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986652500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07271541,0.0003895904,0.91163695,0.00032980207,0.00014602354,0.000054423756,0.00021874995,0.0035482775,0.010960752],"genre_scores_gemma":[0.64567167,0.00047374994,0.33789754,0.00021775607,0.00008535293,0.00017436408,0.00062273344,0.00078592345,0.014071005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911946,0.000304719,0.00007464868,0.00018322542,0.00019089968,0.00012695066],"domain_scores_gemma":[0.9976942,0.0014068116,0.0001583067,0.0004715675,0.00019589474,0.000073223346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011498184,0.0009020134,0.00083058147,0.0009475545,0.0009911971,0.0032179796,0.0024248403,0.0012543328,0.0059096124],"category_scores_gemma":[0.0039315624,0.000703681,0.0010669464,0.0011454953,0.0023762735,0.0064314473,0.002840787,0.0022925145,0.0017474438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003783088,0.00008509493,0.00054993125,0.00019667417,0.000024810108,0.0005384488,0.0016170186,0.047639206,0.013175909,0.8678844,0.0021784687,0.06573187],"study_design_scores_gemma":[0.000065711945,0.000045085697,0.00007852474,0.000049055012,0.000052731837,0.00028254176,0.00021634779,0.116027676,0.013538091,0.856004,0.01359034,0.000049791313],"about_ca_topic_score_codex":0.0007353377,"about_ca_topic_score_gemma":0.0013421312,"teacher_disagreement_score":0.0059096124,"about_ca_system_score_codex":0.0008801713,"about_ca_system_score_gemma":0.0007364517,"threshold_uncertainty_score":0.019769669},"labels":[],"label_agreement":null},{"id":"W1987374824","doi":"10.1016/j.tcs.2005.03.036","title":"Palindromic factors of billiard words","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Dynamical billiards; Palindrome; Dimension (graph theory); Mathematics; Prefix; Fourth Dimension; Combinatorics; Pure mathematics; Physics; Geometry; Linguistics; Philosophy; Spacetime","score_opus":0.009619744018541267,"score_gpt":0.23842521909478898,"score_spread":0.2288054750762477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987374824","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67247564,0.0016413813,0.16935961,0.0013854757,0.00072776765,0.00013379563,0.00032032255,0.0008616684,0.1530944],"genre_scores_gemma":[0.94759154,0.00037862468,0.01591934,0.00023109661,0.00031891587,0.00007776883,0.00022016028,0.0002452171,0.0350173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992748,0.000113669426,0.00005533116,0.0001668794,0.00017689413,0.00021244306],"domain_scores_gemma":[0.99889886,0.0004464849,0.00013990694,0.00015198838,0.00016893019,0.00019376089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062442356,0.0007701203,0.00095277664,0.0016424466,0.0020106416,0.0028531447,0.0007333684,0.0009908652,0.011615218],"category_scores_gemma":[0.0027497737,0.0006739631,0.0009229388,0.0012156623,0.0023113263,0.0039843833,0.0014236614,0.0016672679,0.002618914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078189114,0.00002023044,0.00016297612,0.000021066002,0.000004576125,0.00016791446,0.00042899032,0.00026332264,0.002159091,0.99209386,0.0006554866,0.0039442102],"study_design_scores_gemma":[0.00003515859,0.000036153804,0.00023294849,0.000013850244,0.000011494976,0.00021879541,0.00019218591,0.0016114702,0.0020045377,0.9882569,0.007365465,0.000021051876],"about_ca_topic_score_codex":0.00088079675,"about_ca_topic_score_gemma":0.000879124,"teacher_disagreement_score":0.011615218,"about_ca_system_score_codex":0.0009521808,"about_ca_system_score_gemma":0.0004883843,"threshold_uncertainty_score":0.038856745},"labels":[],"label_agreement":null},{"id":"W1987543317","doi":"10.1016/j.jalgebra.2007.08.025","title":"The submonoid and rational subset membership problems for graph groups","year":2007,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Decidability; Combinatorics; Transitive relation; Finitely-generated abelian group; Graph; Discrete mathematics; Free group; Stallings theorem about ends of groups; Group (periodic table)","score_opus":0.01381376619524257,"score_gpt":0.2361503351207185,"score_spread":0.22233656892547593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987543317","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65071046,0.0020317931,0.29844794,0.014641007,0.000283078,0.00021179121,0.00096644775,0.0005192142,0.032188356],"genre_scores_gemma":[0.95219135,0.0007207521,0.036688823,0.00040801294,0.00037246812,0.00013027675,0.0010557536,0.00010536037,0.008327222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691474,0.0012339725,0.0002582165,0.00070827804,0.00055793696,0.0003268074],"domain_scores_gemma":[0.97402275,0.02162101,0.00083934685,0.001709568,0.00079589535,0.001011319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044849133,0.0006563425,0.0022317118,0.0013124063,0.0035037315,0.007379173,0.0030161464,0.0036302453,0.007707159],"category_scores_gemma":[0.019821849,0.0008864736,0.0016776314,0.0022415442,0.00619476,0.021714948,0.0035729562,0.0040253256,0.000643901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035911478,0.00018842064,0.001248774,0.00023381085,0.000046862886,0.0001927723,0.0024716116,0.009564146,0.0010709057,0.9578976,0.004372405,0.022353627],"study_design_scores_gemma":[0.00003578971,0.0000166457,0.00012518409,0.000015190712,0.000012991928,0.000059054277,0.00047049968,0.015517306,0.00045044252,0.98228157,0.0010022706,0.000013051873],"about_ca_topic_score_codex":0.0022911557,"about_ca_topic_score_gemma":0.0017037878,"teacher_disagreement_score":0.007707159,"about_ca_system_score_codex":0.0024375117,"about_ca_system_score_gemma":0.001374563,"threshold_uncertainty_score":0.025783002},"labels":[],"label_agreement":null},{"id":"W1987608226","doi":"10.1016/j.tcs.2006.07.020","title":"Incremental construction of minimal deterministic finite cover automata","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Deterministic finite automaton; Cover (algebra); DFA minimization; Deterministic automaton; Nondeterministic finite automaton; Automaton; Finite-state machine; Quantum finite automata; Regular language; ω-automaton; Büchi automaton; Two-way deterministic finite automaton; Computer science; Nested word; Algorithm; Mathematics; Discrete mathematics; Automata theory; Theoretical computer science","score_opus":0.005976703962465163,"score_gpt":0.2199071007742895,"score_spread":0.21393039681182432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987608226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19628641,0.00030835994,0.7773628,0.0005303638,0.00010726039,0.00021904857,0.000819237,0.0035782564,0.020788291],"genre_scores_gemma":[0.6638375,0.00018579059,0.32779765,0.000096725016,0.00003984633,0.00028342733,0.0015679753,0.00042813868,0.005762884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919516,0.00015307093,0.00005445943,0.00015713427,0.0003059091,0.00013432898],"domain_scores_gemma":[0.9971577,0.0016817279,0.00008232102,0.00057924964,0.00034926095,0.00014975789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051574304,0.00038485264,0.00067161885,0.0008155622,0.00088843034,0.0012682317,0.0016542122,0.0006690615,0.005288744],"category_scores_gemma":[0.003046844,0.00062726194,0.0011024567,0.00061929156,0.00093942013,0.002133382,0.0028741865,0.0012318181,0.00086891727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000609514,0.00039997086,0.0027187357,0.0006753149,0.00010376862,0.0007204108,0.0014105295,0.039076887,0.06970028,0.67466456,0.008653372,0.20126659],"study_design_scores_gemma":[0.00010269427,0.00014815415,0.0013069817,0.00010624454,0.00019033243,0.00045066854,0.00031607455,0.30671644,0.07141004,0.5891588,0.030021792,0.00007177589],"about_ca_topic_score_codex":0.0008433954,"about_ca_topic_score_gemma":0.0019616324,"teacher_disagreement_score":0.005288744,"about_ca_system_score_codex":0.0008816931,"about_ca_system_score_gemma":0.00075099245,"threshold_uncertainty_score":0.017692626},"labels":[],"label_agreement":null},{"id":"W1987700418","doi":"10.1016/j.aam.2014.08.005","title":"On the asymptotic abelian complexity of morphic words","year":2014,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Carnegie Mellon University; Williams College; National Science Foundation","keywords":"Morphism; Mathematics; Abelian group; Iterated function; Permutation (music); Factorization; Binary number; Combinatorics on words; Discrete mathematics; Combinatorics; Word (group theory); Arithmetic; Algorithm","score_opus":0.018564101112235377,"score_gpt":0.24585175278698648,"score_spread":0.2272876516747511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987700418","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79383254,0.002544765,0.079194166,0.0062604286,0.00032808434,0.0000499303,0.00046786378,0.00032057872,0.117001586],"genre_scores_gemma":[0.9865868,0.000548596,0.004325802,0.00029898615,0.00055216363,0.000058058646,0.00025649235,0.00009284401,0.007280193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977229,0.00071086927,0.00011505555,0.00033583504,0.00072748907,0.0003878469],"domain_scores_gemma":[0.97305435,0.021586608,0.0013984499,0.0013259109,0.0013832203,0.0012514686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018404804,0.00064597576,0.0014128314,0.0038130626,0.0018474804,0.0048422078,0.0019098434,0.001755774,0.010615202],"category_scores_gemma":[0.020833282,0.0005944018,0.0008250177,0.0023847793,0.0058337436,0.013127905,0.004715497,0.0039735776,0.0007456484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093996234,0.000032579785,0.0013195607,0.00006497698,0.000013535269,0.000088785215,0.0003521833,0.0032186927,0.00068443996,0.98877305,0.0010156599,0.004342524],"study_design_scores_gemma":[0.00001328417,0.000014574773,0.00073260884,0.0000141246965,0.000010287348,0.000094752664,0.00009182893,0.011278016,0.0003177689,0.98656577,0.0008512472,0.00001567615],"about_ca_topic_score_codex":0.0011549245,"about_ca_topic_score_gemma":0.0009587676,"teacher_disagreement_score":0.010615202,"about_ca_system_score_codex":0.0024515127,"about_ca_system_score_gemma":0.00084864703,"threshold_uncertainty_score":0.035511374},"labels":[],"label_agreement":null},{"id":"W1988560957","doi":"10.1142/s012905410200100x","title":"UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Concatenation (mathematics); Unary operation; Regular language; Intersection (aeronautics); State (computer science); Mathematics; Symbol (formal); Alphabet; Discrete mathematics; Function (biology); Finite-state machine; Connection (principal bundle); Automaton; Combinatorics; Computer science; Algorithm; Theoretical computer science; Programming language","score_opus":0.02369577806896057,"score_gpt":0.28019506612564216,"score_spread":0.2564992880566816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988560957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5543284,0.002273705,0.38908973,0.0031170547,0.00020618945,0.00014416709,0.0005429266,0.0013953078,0.04890245],"genre_scores_gemma":[0.9194372,0.0008728427,0.07064664,0.00018830375,0.00013883747,0.00017246467,0.00030196153,0.00032787008,0.007913838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779093,0.00036117242,0.00013050855,0.00028136373,0.0008775665,0.00055849075],"domain_scores_gemma":[0.98528254,0.010559061,0.0007553835,0.0023511788,0.00063566363,0.00041620413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001931417,0.000906055,0.0012002136,0.0015653841,0.0012285478,0.00352002,0.002052621,0.0011887964,0.007256537],"category_scores_gemma":[0.009501645,0.0004306402,0.0010288708,0.0018584622,0.0043240087,0.011999156,0.0022717998,0.0023510007,0.0009400007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004055391,0.00010985049,0.0016879021,0.00018793481,0.000022452978,0.000114650764,0.00027042025,0.04996889,0.0048237657,0.89651906,0.0023728488,0.043516662],"study_design_scores_gemma":[0.000037157784,0.0001253168,0.0006677863,0.000034610297,0.00004584376,0.00014185933,0.00009682226,0.16563907,0.010769357,0.8179304,0.004459183,0.000052667307],"about_ca_topic_score_codex":0.0011222226,"about_ca_topic_score_gemma":0.0013248437,"teacher_disagreement_score":0.007256537,"about_ca_system_score_codex":0.0029420909,"about_ca_system_score_gemma":0.0016263678,"threshold_uncertainty_score":0.024275541},"labels":[],"label_agreement":null},{"id":"W1989500448","doi":"10.1017/s0004972700021985","title":"Applications of Fox's derivation in determining the generators of a group","year":2000,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Corollary; Rank (graph theory); Group (periodic table); Quotient; Combinatorics; Set (abstract data type); Exponent; Inverse; Generating set of a group; Normal subgroup; Free group; Function (biology); Pure mathematics; Discrete mathematics; Geometry","score_opus":0.012149415538495275,"score_gpt":0.23323880290840102,"score_spread":0.22108938736990574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989500448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21302304,0.0020714353,0.7159243,0.0025799733,0.00028677087,0.00017464472,0.00014805816,0.0002464784,0.06554519],"genre_scores_gemma":[0.8010831,0.00093289925,0.18341258,0.0005005642,0.00031369005,0.00017213542,0.00016322466,0.00011133449,0.013310483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896026,0.00030359116,0.000080148755,0.00023317512,0.00029059712,0.00013226614],"domain_scores_gemma":[0.9963865,0.0024362127,0.00015259991,0.00024489663,0.0005307914,0.00024889034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002971619,0.00046716814,0.000760542,0.0017884149,0.0015397612,0.00093036174,0.0006838611,0.0009366321,0.0031368048],"category_scores_gemma":[0.007303055,0.00037709973,0.00096532673,0.00078328873,0.0039817216,0.0038690711,0.0033956666,0.0016826495,0.0005300991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040515548,0.000016163196,0.0014199021,0.00004902027,0.000008607317,0.00038428136,0.00069688965,0.0020070476,0.002326446,0.9744236,0.0006586463,0.017968962],"study_design_scores_gemma":[0.00001800996,0.000054826607,0.0004054624,0.000030617248,0.000012794805,0.00032277455,0.00015603834,0.009847129,0.003463272,0.97693074,0.008734913,0.000023354254],"about_ca_topic_score_codex":0.0010758922,"about_ca_topic_score_gemma":0.0010786266,"teacher_disagreement_score":0.0031368048,"about_ca_system_score_codex":0.0010851331,"about_ca_system_score_gemma":0.0008950931,"threshold_uncertainty_score":0.015715599},"labels":[],"label_agreement":null},{"id":"W1989650631","doi":"10.1016/j.jnt.2005.05.009","title":"Littlewood Pisot numbers","year":2005,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Unimodular matrix; Combinatorics; Integer (computer science); Polynomial; Unit disk; Algebraic number; Unit (ring theory); Unit circle; Limit point; Real number; Limit (mathematics); Sequence (biology); Degree (music); Discrete mathematics; Mathematical analysis","score_opus":0.006574619413747264,"score_gpt":0.23967466772785323,"score_spread":0.23310004831410597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989650631","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028828511,0.010723207,0.091148935,0.009561661,0.004164412,0.000043440024,0.00052917557,0.00063684036,0.8543639],"genre_scores_gemma":[0.47259814,0.009627136,0.036789153,0.002218602,0.004493552,0.00018308677,0.00047931698,0.0004601875,0.47315085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950564,0.00008752479,0.00002858736,0.00011513237,0.0002137209,0.000049341135],"domain_scores_gemma":[0.9991566,0.00036309785,0.00006118097,0.00013373034,0.0001626816,0.00012268402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070660014,0.0007586198,0.0008795765,0.0032225056,0.0024139395,0.004459863,0.000827704,0.0009358864,0.023172908],"category_scores_gemma":[0.0028769209,0.00050871336,0.00047148147,0.0033398785,0.0031329587,0.006434882,0.0019171123,0.0038033666,0.0066317767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063418374,0.0000029466896,0.000034225603,0.000017068509,0.0000017921152,0.000013079966,0.0000641262,0.00007175968,0.00009822257,0.9878709,0.004610007,0.0072095175],"study_design_scores_gemma":[0.000004074322,0.000005407668,0.000114985574,0.000014436946,0.0000039817287,0.00006499052,0.000024153574,0.00046829315,0.0001625294,0.9595072,0.039624427,0.000005564246],"about_ca_topic_score_codex":0.00058302446,"about_ca_topic_score_gemma":0.0007127947,"teacher_disagreement_score":0.023172908,"about_ca_system_score_codex":0.0020854443,"about_ca_system_score_gemma":0.00079840154,"threshold_uncertainty_score":0.077521145},"labels":[],"label_agreement":null},{"id":"W1989809437","doi":"10.1007/s10469-006-0003-x","title":"The Word Problem for Polynilpotent Groups with a Single Primitive Defining Relation","year":2006,"lang":"en","type":"article","venue":"Algebra and Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Decidability; Word problem (mathematics education); Word (group theory); Relation (database); Mathematics; Algebra over a field; Group (periodic table); Arithmetic; Discrete mathematics; Pure mathematics; Computer science; Geometry","score_opus":0.008830095110271812,"score_gpt":0.19235040427547537,"score_spread":0.18352030916520357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989809437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52445936,0.0020187069,0.3706553,0.015330641,0.00078637875,0.0001789835,0.0008570136,0.00076658675,0.084946975],"genre_scores_gemma":[0.90674084,0.0008674028,0.05887086,0.0010781556,0.00059558556,0.00020823584,0.00091905036,0.00035828943,0.030361649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982254,0.0005451027,0.00016461874,0.00048494685,0.0002472125,0.00033287314],"domain_scores_gemma":[0.99429023,0.004246358,0.00029597658,0.000530691,0.00033817772,0.00029859314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018323961,0.0006040475,0.0018749054,0.0010110673,0.004626199,0.005756487,0.0019953023,0.0045882915,0.009382955],"category_scores_gemma":[0.008431284,0.00088357105,0.0014620974,0.0016052863,0.0057314066,0.019644946,0.004221251,0.0034936606,0.0018944552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012060178,0.000034371897,0.00013680302,0.00009837299,0.000007307229,0.00011018199,0.000520185,0.0012909268,0.00052314735,0.9882983,0.0018967371,0.0069630817],"study_design_scores_gemma":[0.000008655462,0.0000040285818,0.000011094242,0.000004742377,0.000002825792,0.000021730984,0.000078443074,0.0016943649,0.00021468585,0.997303,0.000650727,0.000005638139],"about_ca_topic_score_codex":0.0010255225,"about_ca_topic_score_gemma":0.00075862126,"teacher_disagreement_score":0.009382955,"about_ca_system_score_codex":0.0014152263,"about_ca_system_score_gemma":0.0013949974,"threshold_uncertainty_score":0.031389117},"labels":[],"label_agreement":null},{"id":"W1990598022","doi":"10.1080/00207160108805105","title":"Morphisms preserving densities","year":2001,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Endomorphism; Mathematics; Morphism; Monoid; Ideal (ethics); Pure mathematics; Permutation (music); Confluence; Free monoid; Algebra over a field; Discrete mathematics","score_opus":0.0162750095180927,"score_gpt":0.25387399568813473,"score_spread":0.23759898617004205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990598022","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.431382,0.0011254181,0.45452243,0.001173017,0.0004619216,0.00018693779,0.0004304224,0.0009887157,0.10972906],"genre_scores_gemma":[0.8938286,0.0007749539,0.07796585,0.00031079663,0.00028532493,0.00018062511,0.00027734507,0.00022995302,0.026146574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984394,0.00030109045,0.00013906074,0.00044980246,0.00040022095,0.00027046676],"domain_scores_gemma":[0.99773824,0.0007999481,0.00022247231,0.00051851,0.00042526473,0.00029568342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001804742,0.00042801013,0.00048320886,0.0014751492,0.0015321479,0.0028789681,0.00049454597,0.0006944673,0.0036066398],"category_scores_gemma":[0.0036133875,0.00044376295,0.0009146852,0.00065679365,0.0045789275,0.0067273783,0.003046285,0.0018766241,0.00068648806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026039119,0.000015603839,0.0003015918,0.000024868536,0.00000515865,0.00009762329,0.00047430512,0.00039246553,0.0025364552,0.98718876,0.00028999674,0.008646953],"study_design_scores_gemma":[0.000018031822,0.00007142225,0.00076050457,0.00003350857,0.000023587692,0.0005426313,0.00039373795,0.004509557,0.008434383,0.9668733,0.018308913,0.000030338655],"about_ca_topic_score_codex":0.00094255403,"about_ca_topic_score_gemma":0.000608178,"teacher_disagreement_score":0.0036066398,"about_ca_system_score_codex":0.0011146951,"about_ca_system_score_gemma":0.00094975403,"threshold_uncertainty_score":0.012065411},"labels":[],"label_agreement":null},{"id":"W1991636160","doi":"10.1016/s0304-3975(02)00070-1","title":"McNaughton families of languages","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Chomsky hierarchy; Rewriting; Abstract family of languages; Formal language; String (physics); Closure (psychology); Hierarchy; Recursively enumerable language; Class (philosophy); Cone (formal languages); Complexity class; Confluence; Computer science; Mathematics; Turing machine; Regular language; Language family; Context (archaeology); Automaton; Linguistics; Discrete mathematics; Theoretical computer science; Programming language; Artificial intelligence; Time complexity; Second-generation programming language","score_opus":0.005738167963395646,"score_gpt":0.23805565448284552,"score_spread":0.23231748651944986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991636160","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25482905,0.005842888,0.34347394,0.011781748,0.0006421947,0.00015615828,0.0011950039,0.0010154477,0.3810636],"genre_scores_gemma":[0.86654544,0.0017011603,0.04297402,0.0014129279,0.0007073906,0.00022269745,0.00049635407,0.00021716802,0.08572277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868566,0.0002662054,0.000071680806,0.00037741716,0.0004072447,0.00019180548],"domain_scores_gemma":[0.99428684,0.003752438,0.00028269485,0.00067156926,0.00055796717,0.00044859713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015769461,0.00065643975,0.0010834334,0.0033837284,0.005080114,0.0043728617,0.0014371393,0.0015431402,0.018786892],"category_scores_gemma":[0.007107511,0.00085267756,0.0011991863,0.002400671,0.0040685744,0.010850644,0.002417758,0.002086971,0.0014709431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018414612,0.0000043270747,0.00010705565,0.0000133396725,0.000003532215,0.000058026075,0.00021127492,0.00017487933,0.00015805046,0.9958047,0.0010773623,0.0023690492],"study_design_scores_gemma":[0.00001701905,0.0000068551944,0.00012474728,0.0000116166575,0.000009077415,0.00025997483,0.00008958847,0.0014504706,0.00027543868,0.98752534,0.01021631,0.0000137075185],"about_ca_topic_score_codex":0.0020857835,"about_ca_topic_score_gemma":0.0024315964,"teacher_disagreement_score":0.018786892,"about_ca_system_score_codex":0.0029863124,"about_ca_system_score_gemma":0.0011555733,"threshold_uncertainty_score":0.06284839},"labels":[],"label_agreement":null},{"id":"W1992572359","doi":"10.1016/j.jsc.2009.04.004","title":"Corrigendum to: “On ordering free groups” [J. Symbolic Comput. 40 (2005) 1285–1290]","year":2009,"lang":"en","type":"erratum","venue":"Journal of Symbolic Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Algebra over a field; Combinatorics; Pure mathematics","score_opus":0.016467723170452926,"score_gpt":0.25548833239834035,"score_spread":0.23902060922788743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992572359","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014319239,0.003119403,0.000853263,0.04794655,0.9358255,0.00004162676,0.00094779127,0.00038330487,0.010739416],"genre_scores_gemma":[0.012061118,0.01775791,0.0040966305,0.08609697,0.37865275,0.0003088631,0.005293204,0.0014549483,0.49427763],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970402,0.00049064326,0.0003948401,0.0005115522,0.0012220178,0.0003408009],"domain_scores_gemma":[0.9859195,0.002469457,0.00043685967,0.0010236986,0.009451687,0.0006988488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020478852,0.0029013404,0.003414396,0.005114695,0.0039597303,0.0039756577,0.00473799,0.0052907662,0.14496751],"category_scores_gemma":[0.023275506,0.0012324948,0.0029050303,0.0037805478,0.002736333,0.005130301,0.003027763,0.0060795275,0.07784173],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020649026,0.000005967297,0.000024858193,0.00009764589,0.000009683912,0.00006901215,0.000011347205,0.00003701483,0.00003180927,0.0011130448,0.99579215,0.0027868785],"study_design_scores_gemma":[0.00005296542,0.000043070027,0.0011838843,0.00023875947,0.00007051736,0.00034885624,0.000077118195,0.0004777283,0.00054356665,0.00785155,0.98903775,0.00007414391],"about_ca_topic_score_codex":0.019851597,"about_ca_topic_score_gemma":0.025612887,"teacher_disagreement_score":0.14496751,"about_ca_system_score_codex":0.0054397215,"about_ca_system_score_gemma":0.002795211,"threshold_uncertainty_score":0.4849646},"labels":[],"label_agreement":null},{"id":"W1992893569","doi":"10.1080/00207160.2012.681305","title":"Composition and orbits of language operations: finiteness and upper bounds","year":2012,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Waterloo","funders":"","keywords":"Closure (psychology); Mathematics; Complement (music); Suffix; Prefix; Equivalence (formal languages); Regular language; Natural number; Bounded function; Discrete mathematics; Set (abstract data type); Monoid; Equivalence relation; Combinatorics; Computer science; Linguistics; Automaton","score_opus":0.010947214938033701,"score_gpt":0.26872210716132505,"score_spread":0.25777489222329136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992893569","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7841524,0.0017421725,0.18634108,0.0007894712,0.00007579433,0.00012484269,0.0006839142,0.000550868,0.025539463],"genre_scores_gemma":[0.959442,0.00083212677,0.034423284,0.000066145796,0.00015527217,0.00015549237,0.0006523909,0.0001206487,0.0041526225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996407,0.00039482684,0.0003636247,0.0008351433,0.0012093488,0.0007901332],"domain_scores_gemma":[0.9682644,0.024396688,0.0025689711,0.002420686,0.0009271853,0.0014221417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024803728,0.0009557569,0.0015288994,0.0026901965,0.0026796102,0.0047667976,0.0017789622,0.0011081657,0.0074700206],"category_scores_gemma":[0.013254342,0.00097499177,0.0025737209,0.0013793154,0.006118491,0.0114904195,0.004350452,0.0026779745,0.00067715195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010791267,0.00025113512,0.010298116,0.0004186342,0.00008616099,0.0007065834,0.0019671672,0.023542153,0.014342194,0.9028709,0.00087642483,0.0435614],"study_design_scores_gemma":[0.00007615071,0.000182425,0.0019235453,0.000109693196,0.00012796775,0.0007101937,0.0004252823,0.08736259,0.026839636,0.8788867,0.0032826748,0.000073062925],"about_ca_topic_score_codex":0.0017423749,"about_ca_topic_score_gemma":0.0010318898,"teacher_disagreement_score":0.0074700206,"about_ca_system_score_codex":0.0027125191,"about_ca_system_score_gemma":0.0017097237,"threshold_uncertainty_score":0.024989665},"labels":[],"label_agreement":null},{"id":"W1993054401","doi":"10.1007/s00026-009-0008-y","title":"Enumeration of Decomposable Combinatorial Structures with Restricted Patterns","year":2009,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Enumeration; Mathematics; Combinatorics; Combinatorial analysis; Class (philosophy); Enumerative combinatorics; Focus (optics); Gravitational singularity; Discrete mathematics; Computer science","score_opus":0.01984716435851521,"score_gpt":0.27020818073847463,"score_spread":0.25036101637995944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993054401","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52296674,0.00043036428,0.41413304,0.0009874157,0.00012612002,0.00019677803,0.0019310171,0.0016072806,0.05762131],"genre_scores_gemma":[0.7470226,0.00044401054,0.22000502,0.00028408165,0.00010965481,0.00028091474,0.0052788365,0.0005323824,0.026042484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989793,0.00026359028,0.000113946066,0.0002142694,0.00027578647,0.00015308031],"domain_scores_gemma":[0.99547833,0.002730809,0.00028373467,0.0009137997,0.00034807652,0.00024526496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054216536,0.0006864772,0.0008624594,0.0012336217,0.001024057,0.0032068945,0.001997473,0.0010389987,0.010801612],"category_scores_gemma":[0.0039733737,0.0008915667,0.0011449624,0.0025784469,0.0012518544,0.0046119313,0.0021358451,0.0021004584,0.0018023932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005278861,0.0005081441,0.003422539,0.00051956193,0.00007741768,0.0010338647,0.0012998269,0.013148322,0.023500053,0.771322,0.007790561,0.17684984],"study_design_scores_gemma":[0.0000527541,0.000056991576,0.0005690481,0.000042947104,0.000046301702,0.000699786,0.0002795329,0.033268113,0.0060693054,0.9530187,0.0058744745,0.00002198707],"about_ca_topic_score_codex":0.00039863543,"about_ca_topic_score_gemma":0.00087105687,"teacher_disagreement_score":0.010801612,"about_ca_system_score_codex":0.0005788537,"about_ca_system_score_gemma":0.00060813216,"threshold_uncertainty_score":0.036135018},"labels":[],"label_agreement":null},{"id":"W1993527583","doi":"10.1007/s11047-010-9179-z","title":"A relation by palindromic subwords","year":2010,"lang":"en","type":"article","venue":"Natural Computing","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Palindrome; Equivalence relation; Mathematics; Relation (database); Alphabet; Combinatorics; Equivalence class (music); Identity function; Idempotence; Combinatorics on words; Discrete mathematics; Pure mathematics; Word (group theory); Computer science; Genetics; Genome; Biology; Linguistics","score_opus":0.0033221391414186424,"score_gpt":0.21989578805717122,"score_spread":0.2165736489157526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993527583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25800613,0.0030556417,0.53421915,0.0041493042,0.0018498838,0.00022271252,0.0006651365,0.0018930943,0.19593897],"genre_scores_gemma":[0.82582945,0.0009955302,0.1157466,0.0011047372,0.00094005786,0.00024215986,0.0004990705,0.0006649817,0.053977333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983455,0.00043394853,0.00016575411,0.00062450074,0.00023581923,0.00019447546],"domain_scores_gemma":[0.99725205,0.0014881565,0.00016879167,0.0005449514,0.0003279159,0.00021815702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009309274,0.000595629,0.0009224245,0.0017909058,0.0039574895,0.0048410133,0.0009828134,0.0016626449,0.01079742],"category_scores_gemma":[0.0031058767,0.00091487466,0.0014160696,0.0020943796,0.003848793,0.012091912,0.002879632,0.0026574414,0.0034296983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042061038,0.000017340732,0.00008963451,0.000032125055,0.000005653692,0.00009748774,0.00058553036,0.00009236681,0.0017729567,0.9896708,0.00097395235,0.0066201477],"study_design_scores_gemma":[0.0000183061,0.000032428336,0.00009967524,0.000018231183,0.000018177001,0.00032454095,0.00023911898,0.0011035317,0.002097391,0.9752465,0.020784056,0.00001803104],"about_ca_topic_score_codex":0.00068463315,"about_ca_topic_score_gemma":0.0007111229,"teacher_disagreement_score":0.01079742,"about_ca_system_score_codex":0.0009804579,"about_ca_system_score_gemma":0.00074044213,"threshold_uncertainty_score":0.03612095},"labels":[],"label_agreement":null},{"id":"W1993598446","doi":"10.1142/s0129054102000960","title":"AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cover (algebra); Nondeterministic finite automaton; DFA minimization; Deterministic finite automaton; Quantum finite automata; Nested word; Regular language; Finite-state machine; Automaton; Deterministic automaton; ω-automaton; Computer science; Time complexity; Algorithm; Formal language; Timed automaton; Mathematics; Theoretical computer science; Automata theory; Two-way deterministic finite automaton","score_opus":0.019626468324232184,"score_gpt":0.3115234385093699,"score_spread":0.2918969701851377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993598446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009152484,0.00011511712,0.98578787,0.00009878543,0.000030021503,0.00017218465,0.00012649268,0.0028013105,0.0017157833],"genre_scores_gemma":[0.10901529,0.000112002235,0.88750935,0.00007677544,0.000027662176,0.000384911,0.0008226099,0.00024749828,0.0018039099],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991192,0.00015093485,0.00007543315,0.00021954253,0.00032223886,0.00011263691],"domain_scores_gemma":[0.99886084,0.0006272778,0.0000636001,0.00023252262,0.0001761461,0.000039645893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005039121,0.0007939643,0.00080632104,0.00092098204,0.0008553406,0.0008279829,0.001200887,0.0010837271,0.0043977136],"category_scores_gemma":[0.002467923,0.0006007711,0.0015228543,0.00073750905,0.00073042157,0.0019402067,0.001491876,0.0011450126,0.0013772643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004886574,0.00030108893,0.001525446,0.0007791431,0.00014111534,0.0006654818,0.0009257435,0.05304085,0.07415262,0.15796883,0.013213188,0.69679785],"study_design_scores_gemma":[0.0002078506,0.00030228012,0.00056268857,0.00008051448,0.00015471502,0.0011854501,0.00018816817,0.6407879,0.058792572,0.2577483,0.03989161,0.00009789594],"about_ca_topic_score_codex":0.0009056765,"about_ca_topic_score_gemma":0.0012538353,"teacher_disagreement_score":0.0043977136,"about_ca_system_score_codex":0.0007086364,"about_ca_system_score_gemma":0.0010998369,"threshold_uncertainty_score":0.014711857},"labels":[],"label_agreement":null},{"id":"W1993691575","doi":"10.1142/s0218196711006194","title":"AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK","year":2011,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Alphabet; Rank (graph theory); Automaton; Combinatorics; Binary number; Construct (python library); Finite-state machine; Free product; Discrete mathematics; Free group; Order (exchange); Deterministic finite automaton; Quantum finite automata; Group (periodic table); Automata theory; Arithmetic; Algorithm; Theoretical computer science; Computer science","score_opus":0.017270216816107443,"score_gpt":0.25289321984143515,"score_spread":0.2356230030253277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993691575","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6110942,0.00050099316,0.34694645,0.00054756127,0.0002669616,0.00020933914,0.00045871412,0.002124273,0.037851524],"genre_scores_gemma":[0.9249049,0.0001744647,0.060367584,0.0001140903,0.0000900236,0.00021996221,0.00043542948,0.00012286416,0.013570801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937785,0.00015748573,0.000054885393,0.00012054267,0.00014693374,0.00014232658],"domain_scores_gemma":[0.99818987,0.00077805953,0.00027687513,0.0003077991,0.00018741509,0.0002599367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005363589,0.0006961829,0.00041409145,0.0007843812,0.0009985998,0.0013722746,0.0007102936,0.000520301,0.004855793],"category_scores_gemma":[0.0018045522,0.00025754387,0.0009225752,0.00043272038,0.0013829765,0.0021527084,0.001687803,0.0006570344,0.0009981674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043904627,0.00022076929,0.002620639,0.00021477835,0.000039452978,0.000704168,0.0022441342,0.020402206,0.027623493,0.902696,0.0026062753,0.04018884],"study_design_scores_gemma":[0.00017272582,0.00036114483,0.0007340018,0.000075860946,0.000056595174,0.00036075586,0.0003942158,0.079001956,0.038682736,0.8607576,0.019280542,0.00012174216],"about_ca_topic_score_codex":0.0006061069,"about_ca_topic_score_gemma":0.0008720979,"teacher_disagreement_score":0.004855793,"about_ca_system_score_codex":0.0005824996,"about_ca_system_score_gemma":0.0006591251,"threshold_uncertainty_score":0.016244233},"labels":[],"label_agreement":null},{"id":"W1994084299","doi":"10.1016/j.tcs.2004.11.003","title":"The generative capacity of block-synchronized context-free grammars","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Language family; Tree-adjoining grammar; Rule-based machine translation; Nesting (process); Computer science; Mathematics; Block (permutation group theory); Context (archaeology); Generative grammar; Context-free language; Programming language; Discrete mathematics; Context-free grammar; Combinatorics; Artificial intelligence; Linguistics; Geography","score_opus":0.010678476020316978,"score_gpt":0.22125262563059822,"score_spread":0.21057414961028123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994084299","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62985337,0.00064787944,0.32007942,0.0018461252,0.00007819454,0.00006832045,0.000887859,0.00084852945,0.04569035],"genre_scores_gemma":[0.98796785,0.00023074789,0.007419219,0.00010536506,0.000087548535,0.00007102274,0.00027625257,0.00013883502,0.0037031656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977188,0.0009785563,0.0001314331,0.00034330986,0.00045879168,0.00036913392],"domain_scores_gemma":[0.96115017,0.033196773,0.0011351699,0.002326813,0.0012405136,0.0009505862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029940212,0.0004488959,0.0011644019,0.0011667991,0.0009179434,0.002896194,0.0016848752,0.0013551462,0.01055504],"category_scores_gemma":[0.018156841,0.000898137,0.0007967857,0.0011122789,0.0041172,0.0062471176,0.0027111215,0.0014972292,0.0011245811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019623143,0.000037187732,0.0005828638,0.00007878591,0.000021049998,0.0001422907,0.00074269285,0.027539654,0.0044339234,0.95940965,0.0007178039,0.0060978835],"study_design_scores_gemma":[0.000032676424,0.000021033318,0.0001766383,0.00001004683,0.000014138553,0.000046674424,0.00005191503,0.07253375,0.0011729379,0.92523855,0.0006816046,0.000019981251],"about_ca_topic_score_codex":0.0016238218,"about_ca_topic_score_gemma":0.0010144317,"teacher_disagreement_score":0.01055504,"about_ca_system_score_codex":0.0010582735,"about_ca_system_score_gemma":0.0014862472,"threshold_uncertainty_score":0.03531009},"labels":[],"label_agreement":null},{"id":"W1994122595","doi":"10.1142/s0129054103002138","title":"COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unary operation; Mathematics; Combinatorics; Deterministic finite automaton; Upper and lower bounds; Alphabet; Discrete mathematics; Integer (computer science); Nondeterministic finite automaton; Quantum finite automata; Regular language; Automaton; Finite-state machine; Algorithm; Automata theory; Computer science; Theoretical computer science","score_opus":0.009420720844945022,"score_gpt":0.2876393450828633,"score_spread":0.2782186242379183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994122595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70964694,0.00069176685,0.2780497,0.0004798714,0.000062235835,0.00025402862,0.0008341997,0.0011916403,0.0087896185],"genre_scores_gemma":[0.7345933,0.00029095728,0.2591752,0.00010468331,0.000046925175,0.00049777946,0.0017051019,0.00025423773,0.0033317707],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681324,0.000681677,0.0004129032,0.000577409,0.0010902865,0.00042444828],"domain_scores_gemma":[0.9836263,0.011398967,0.0011728731,0.0017801403,0.0014719082,0.00054979266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018522419,0.0005531352,0.0009718668,0.0015917275,0.0016130797,0.001396129,0.0018825971,0.0012524639,0.0038569225],"category_scores_gemma":[0.01648417,0.00052606297,0.00126444,0.0015468282,0.0011764326,0.0038480875,0.0016259389,0.00069765205,0.0005452465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027124302,0.00068840495,0.06066976,0.0023126057,0.00051147206,0.0015740932,0.0014529327,0.21932179,0.1395146,0.14375564,0.006098439,0.42138788],"study_design_scores_gemma":[0.00012045482,0.0006287336,0.010815355,0.00018619224,0.0005764631,0.002694991,0.000514516,0.5923606,0.17852198,0.19762306,0.015797867,0.00015970628],"about_ca_topic_score_codex":0.0008024979,"about_ca_topic_score_gemma":0.0016140145,"teacher_disagreement_score":0.0038569225,"about_ca_system_score_codex":0.0011829789,"about_ca_system_score_gemma":0.0012584045,"threshold_uncertainty_score":0.012902677},"labels":[],"label_agreement":null},{"id":"W1994343490","doi":"10.1142/s0129054111008945","title":"SCHEMA FOR PARALLEL INSERTION AND DELETION: REVISITED","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Schema (genetic algorithms); Computer science; Tuple; Inverse; Regular language; Theoretical computer science; Mathematics; Algorithm; Programming language; Discrete mathematics; Automaton","score_opus":0.0348316647130958,"score_gpt":0.2930144194345859,"score_spread":0.2581827547214901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994343490","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008428863,0.0005288794,0.9784864,0.0009959632,0.00020225788,0.00024348752,0.00026540444,0.00086010806,0.009988687],"genre_scores_gemma":[0.09984468,0.00086066604,0.88775086,0.00056928693,0.00012842922,0.0003192769,0.0008614338,0.000517291,0.009148123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952988,0.001168812,0.00053430477,0.0013646369,0.0012680179,0.0003655496],"domain_scores_gemma":[0.99539447,0.0013621856,0.00034150324,0.0017592655,0.00096134393,0.00018125772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003991977,0.0008620979,0.0010831708,0.001475579,0.0019458585,0.0046159783,0.0039363233,0.002179631,0.008531587],"category_scores_gemma":[0.008255638,0.0010354439,0.0030149794,0.0026357912,0.0047445623,0.0144769335,0.004259076,0.0044472925,0.0027688502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007155366,0.00005342751,0.0005863212,0.00020851927,0.000021117701,0.00029156287,0.0006700567,0.0039660963,0.0036345103,0.9390764,0.0026941318,0.04872642],"study_design_scores_gemma":[0.00006282044,0.000107571504,0.00026097838,0.00015014954,0.000074619755,0.0018259288,0.0005770822,0.05710298,0.016004093,0.83187556,0.09187748,0.00008070059],"about_ca_topic_score_codex":0.0027811907,"about_ca_topic_score_gemma":0.0017931175,"teacher_disagreement_score":0.008531587,"about_ca_system_score_codex":0.0018327641,"about_ca_system_score_gemma":0.0039358856,"threshold_uncertainty_score":0.028541028},"labels":[],"label_agreement":null},{"id":"W1994383533","doi":"10.1142/s0129054105003157","title":"STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Monoid; State (computer science); Syntactic monoid; Set (abstract data type); Root (linguistics); Mathematics; Free monoid; Regular language; Finite-state machine; Finite set; Discrete mathematics; Computer science; Algorithm; Theoretical computer science; Automaton; Linguistics","score_opus":0.02362928073566646,"score_gpt":0.2931312758776484,"score_spread":0.269501995141982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994383533","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7149848,0.0011594726,0.25955474,0.0020410377,0.00006530368,0.000118230164,0.00083797576,0.00045791865,0.020780543],"genre_scores_gemma":[0.9715837,0.00038634523,0.023910347,0.00009530913,0.00008877046,0.00011268459,0.00047340928,0.000071898794,0.003277605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666214,0.0007230427,0.0003015255,0.0007278666,0.0011004527,0.0004850554],"domain_scores_gemma":[0.9751559,0.019541718,0.0014618034,0.002127021,0.0010104399,0.00070310076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018621294,0.00039744965,0.0007355476,0.0018797125,0.0013904725,0.005117709,0.0010222986,0.0011092463,0.0058767768],"category_scores_gemma":[0.01177458,0.00041062204,0.0012301046,0.0015391558,0.0033000894,0.010777875,0.0024318772,0.002433428,0.0004580493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039851404,0.00011559976,0.0041172025,0.00022036704,0.000052297848,0.00018724044,0.0012428405,0.030647418,0.007334491,0.93182486,0.0007990925,0.023060003],"study_design_scores_gemma":[0.000035814992,0.00012520766,0.0021275308,0.00003135871,0.00005059575,0.00018974737,0.0002205466,0.09965368,0.0076708174,0.88660485,0.003231109,0.000058768106],"about_ca_topic_score_codex":0.0016763732,"about_ca_topic_score_gemma":0.0012783483,"teacher_disagreement_score":0.0058767768,"about_ca_system_score_codex":0.0027453902,"about_ca_system_score_gemma":0.0013040527,"threshold_uncertainty_score":0.019919276},"labels":[],"label_agreement":null},{"id":"W1994937806","doi":"10.1090/s0025-5718-2012-02532-4","title":"The Prouhet-Tarry-Escott problem for Gaussian integers","year":2012,"lang":"en","type":"preprint","venue":"Mathematics of Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Ideal (ethics); Gaussian; Combinatorics; Gaussian integer; Mathematics; Discrete mathematics; Gaussian elimination; Physics; Quantum mechanics","score_opus":0.023728592431746548,"score_gpt":0.2803132365579818,"score_spread":0.2565846441262353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994937806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21374516,0.0032627329,0.3795214,0.02110984,0.0015469716,0.00027025823,0.0035887924,0.0018065358,0.37514833],"genre_scores_gemma":[0.7474426,0.0024278902,0.109706715,0.003482241,0.00087140256,0.00036523913,0.0041996054,0.0009153801,0.1305889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831665,0.00038130488,0.00011614163,0.0003904543,0.00041071695,0.00038482487],"domain_scores_gemma":[0.99618655,0.0022995076,0.0002466789,0.00046599904,0.0004603816,0.00034088892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023037659,0.000925395,0.001647613,0.0018836125,0.003098013,0.006716175,0.001962232,0.0031748416,0.033528388],"category_scores_gemma":[0.015541496,0.00058218185,0.0014192389,0.0023593924,0.0032479404,0.012434461,0.0048156586,0.004574772,0.005890867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014401216,0.000031247215,0.0003653363,0.00012580612,0.000012917289,0.00010025357,0.00017690113,0.0029909872,0.00018705199,0.96785676,0.012721156,0.015287503],"study_design_scores_gemma":[0.000038359547,0.000013141616,0.000112617854,0.000035321053,0.000010374342,0.00006670803,0.00011436471,0.012593204,0.0002615788,0.9791636,0.007576472,0.0000142638655],"about_ca_topic_score_codex":0.00381409,"about_ca_topic_score_gemma":0.004586976,"teacher_disagreement_score":0.033528388,"about_ca_system_score_codex":0.0033474425,"about_ca_system_score_gemma":0.0028808468,"threshold_uncertainty_score":0.1121636},"labels":[],"label_agreement":null},{"id":"W1995220817","doi":"10.1007/s00236-009-0090-y","title":"On the closure of pattern expressions languages under intersection with regular languages","year":2009,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Abstract family of languages; Intersection (aeronautics); Closure (psychology); Complement (music); Theory of computation; Language family; Cone (formal languages); Computer science; Second-generation programming language; Regular language; Mathematics; Linguistics; Programming language; Artificial intelligence; Fifth-generation programming language; Philosophy","score_opus":0.005861879333243367,"score_gpt":0.22553346134852395,"score_spread":0.2196715820152806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995220817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6447857,0.0017575664,0.2765168,0.0034771205,0.00058378297,0.00020876473,0.00097640854,0.0012408072,0.07045307],"genre_scores_gemma":[0.93618983,0.0009935832,0.04556175,0.00070011296,0.0007833411,0.0003087015,0.0014276543,0.0006802087,0.013354877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918507,0.002109459,0.0007973684,0.0019502011,0.0019342223,0.0013579575],"domain_scores_gemma":[0.97400236,0.01614425,0.0025271275,0.0018102656,0.0030547797,0.0024612392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075916233,0.0009325214,0.002575401,0.0034093913,0.005215161,0.009536231,0.002313422,0.00239034,0.0072893086],"category_scores_gemma":[0.020577244,0.0015178077,0.00362409,0.0025641834,0.008687785,0.021196691,0.0069881994,0.00549254,0.0008850115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059404,0.0001306428,0.0012044262,0.00008907146,0.000042814747,0.0005798774,0.00262038,0.0010200719,0.002696719,0.98196584,0.00082374376,0.008232372],"study_design_scores_gemma":[0.000083062936,0.0001444904,0.00063740916,0.00005770152,0.00005219718,0.00069218286,0.00083715725,0.0065080556,0.0024331529,0.9853477,0.0031558946,0.000050894952],"about_ca_topic_score_codex":0.001360908,"about_ca_topic_score_gemma":0.00059806457,"teacher_disagreement_score":0.009536231,"about_ca_system_score_codex":0.0024365229,"about_ca_system_score_gemma":0.002166436,"threshold_uncertainty_score":0.040148795},"labels":[],"label_agreement":null},{"id":"W1995677215","doi":"10.1002/mana.200310338","title":"Lazard's Theorem for<i>S</i>‐posets","year":2005,"lang":"en","type":"article","venue":"Mathematische Nachrichten","topic":"semigroups and automata theory","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Flatness (cosmology); Functor; Pure mathematics; Tensor product; Indecomposable module; Flat module; Monoid; Property (philosophy); Quotient; Algebra over a field; Discrete mathematics; Finitely-generated abelian group; Projective module","score_opus":0.012549179343731624,"score_gpt":0.24527817056894996,"score_spread":0.23272899122521834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995677215","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48908198,0.0031909747,0.27132654,0.0029192609,0.00047775236,0.0001843517,0.0008456733,0.0008480865,0.2311253],"genre_scores_gemma":[0.9710088,0.00056989066,0.014709943,0.0004088863,0.00036808505,0.00007774553,0.0005255692,0.00007249334,0.012258479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851996,0.0002363015,0.00011016963,0.0004692336,0.00037315357,0.00029115684],"domain_scores_gemma":[0.9976242,0.0010669192,0.00022432888,0.00020934793,0.00044046168,0.00043472278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024534035,0.0005454755,0.0008908644,0.002949951,0.002098784,0.00327395,0.00091645337,0.0007603409,0.007724062],"category_scores_gemma":[0.003270409,0.0005319896,0.0016994892,0.0011043998,0.0052631213,0.0062624584,0.0034853665,0.0026083977,0.00071326125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003219904,0.000015434276,0.00075843884,0.000036988476,0.000013091443,0.00016974086,0.0003896647,0.00043208915,0.000577753,0.99307054,0.00065381353,0.0038502638],"study_design_scores_gemma":[0.000027009957,0.00005136276,0.0013260648,0.00002446762,0.000018732228,0.00023788413,0.000206474,0.003437717,0.0014900584,0.9863876,0.0067693666,0.000023234108],"about_ca_topic_score_codex":0.0024451495,"about_ca_topic_score_gemma":0.0012575842,"teacher_disagreement_score":0.007724062,"about_ca_system_score_codex":0.0020242166,"about_ca_system_score_gemma":0.0007456178,"threshold_uncertainty_score":0.025839627},"labels":[],"label_agreement":null},{"id":"W1995777777","doi":"10.1016/j.tcs.2007.07.034","title":"Transition complexity of language operations","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transition (genetics); Computer science; Programming language; Theoretical computer science; Linguistics; Chemistry; Philosophy","score_opus":0.015023758854855974,"score_gpt":0.26985739425449723,"score_spread":0.25483363539964127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995777777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65214944,0.0012126112,0.29834488,0.0041177347,0.00013373962,0.00009641029,0.0011012874,0.00050175877,0.04234213],"genre_scores_gemma":[0.9855517,0.00035034295,0.009274881,0.00012572046,0.00017456319,0.00008384889,0.00045827377,0.0000701006,0.00391061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99678147,0.00079807895,0.0002088599,0.00070771377,0.00096113957,0.0005426377],"domain_scores_gemma":[0.968765,0.026171006,0.00108214,0.0016418678,0.0012751995,0.0010648576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019713421,0.0005160423,0.0012254496,0.0026711253,0.0014541633,0.0068402844,0.0015153945,0.001595622,0.008665583],"category_scores_gemma":[0.016137263,0.0006115705,0.0015139824,0.0027615288,0.0037586086,0.01605074,0.0026880698,0.004227828,0.00063797424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011466624,0.000035887067,0.00080650894,0.00005111283,0.000014972572,0.00006916285,0.0005004334,0.005806909,0.00082535093,0.9845308,0.00075335667,0.006490764],"study_design_scores_gemma":[0.000012083592,0.000012051207,0.00033605043,0.000006076359,0.00001141301,0.00004889927,0.00006669551,0.019412208,0.00047033236,0.9790508,0.00056203065,0.000011439936],"about_ca_topic_score_codex":0.0014295997,"about_ca_topic_score_gemma":0.0008953515,"teacher_disagreement_score":0.008665583,"about_ca_system_score_codex":0.0026349425,"about_ca_system_score_gemma":0.0013122695,"threshold_uncertainty_score":0.028989315},"labels":[],"label_agreement":null},{"id":"W1996644214","doi":"10.1016/j.tcs.2009.05.002","title":"Operational state complexity of nested word automata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Finite-state machine; Nested word; Quantum finite automata; Discrete mathematics; Mathematics; Automaton; Upper and lower bounds; Word (group theory); Constant (computer programming); Deterministic finite automaton; Combinatorics; State (computer science); Automata theory; Computer science; Theoretical computer science; Algorithm","score_opus":0.019453934358182844,"score_gpt":0.2631941083867752,"score_spread":0.24374017402859235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996644214","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7710022,0.00046375146,0.20454404,0.0018064168,0.00007540739,0.00007951926,0.00079005735,0.00034392902,0.020894647],"genre_scores_gemma":[0.9866216,0.00015900825,0.009344747,0.00007255476,0.000074519776,0.000073967014,0.00040565245,0.00007170893,0.0031762826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644214,0.0008001403,0.00028851433,0.00065556704,0.0012411597,0.00057246804],"domain_scores_gemma":[0.9733611,0.020872176,0.0012653633,0.0018487789,0.0016457798,0.0010068263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019321404,0.00049311284,0.0013498688,0.0014145378,0.0013651528,0.006104557,0.0018227163,0.0013583765,0.008040627],"category_scores_gemma":[0.014761471,0.0006173339,0.0013211884,0.0014449656,0.0034794323,0.013022243,0.002817536,0.003141959,0.00049813685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017719356,0.00008560581,0.0013307716,0.000073547126,0.000024100631,0.00013853371,0.00084364385,0.018147346,0.0022011313,0.96891874,0.000752442,0.007307054],"study_design_scores_gemma":[0.000017190712,0.000019649979,0.00034707604,0.000007960006,0.0000142527815,0.000046663114,0.00010619791,0.07488458,0.0008383927,0.923249,0.0004488451,0.000020132085],"about_ca_topic_score_codex":0.0022948158,"about_ca_topic_score_gemma":0.0018359544,"teacher_disagreement_score":0.008040627,"about_ca_system_score_codex":0.0023870685,"about_ca_system_score_gemma":0.0015749009,"threshold_uncertainty_score":0.026898623},"labels":[],"label_agreement":null},{"id":"W1997031552","doi":"10.1016/j.jalgebra.2009.09.040","title":"Submonoids and rational subsets of groups with infinitely many ends","year":2009,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Pure mathematics","score_opus":0.00683257774827001,"score_gpt":0.20885056648383107,"score_spread":0.20201798873556107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997031552","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78021824,0.0012768795,0.15592547,0.0013792448,0.00030874528,0.00007861147,0.00036507405,0.0005266829,0.059920903],"genre_scores_gemma":[0.97673833,0.00021019501,0.012643174,0.00015387921,0.00015780955,0.00008192815,0.00026655913,0.00006505374,0.009683047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989348,0.0003211413,0.00010296745,0.00020237139,0.00023397665,0.00020461672],"domain_scores_gemma":[0.99700135,0.0015221632,0.00027653304,0.00039607188,0.00027655918,0.0005272486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013934704,0.0006748507,0.0011409764,0.001903532,0.0022578721,0.004697561,0.001138044,0.0009522313,0.004991739],"category_scores_gemma":[0.0026544794,0.0006137664,0.0011543779,0.0010057952,0.0042743064,0.0052894666,0.003122345,0.0014250599,0.0007917397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066782595,0.00001773528,0.00030922043,0.00001979119,0.000008699039,0.00014588288,0.0011476312,0.00020086387,0.0014385511,0.9938905,0.00030161953,0.0024527842],"study_design_scores_gemma":[0.000029640383,0.000026581785,0.00026452195,0.00001355733,0.00001596113,0.00014440947,0.00055022433,0.001408366,0.0009568485,0.99319094,0.0033842279,0.000014553994],"about_ca_topic_score_codex":0.00046820418,"about_ca_topic_score_gemma":0.0004951684,"teacher_disagreement_score":0.004991739,"about_ca_system_score_codex":0.0009784353,"about_ca_system_score_gemma":0.0004425031,"threshold_uncertainty_score":0.016699016},"labels":[],"label_agreement":null},{"id":"W1997415583","doi":"10.1016/j.jcta.2011.07.005","title":"Binary bubble languages and cool-lex order","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Guelph; University of Victoria","funders":"","keywords":"Substring; Mathematics; Combinatorics; Lexicographical order; Binary number; String (physics); Discrete mathematics; Order (exchange); De Bruijn sequence; Set (abstract data type); Computer science; Arithmetic","score_opus":0.010322232063146836,"score_gpt":0.2343718908907133,"score_spread":0.22404965882756647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997415583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47769445,0.0015643642,0.35148278,0.005280449,0.00047899972,0.00012089938,0.0014643616,0.0017730413,0.16014057],"genre_scores_gemma":[0.9339766,0.00034090565,0.02361017,0.0005333175,0.00019474373,0.00010381777,0.0006340515,0.00045252166,0.04015384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994276,0.00013695042,0.000042261472,0.00010989959,0.0001296273,0.00015352441],"domain_scores_gemma":[0.9964982,0.0020580685,0.00024118669,0.00042400247,0.00041593993,0.0003626016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007067167,0.00032732892,0.0007383603,0.0011476392,0.0020174312,0.0038303505,0.0006996305,0.0009580079,0.01434001],"category_scores_gemma":[0.0042239875,0.00062741287,0.0005880105,0.0010914193,0.0029526888,0.008068656,0.0022871394,0.0025909697,0.0014522169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042964413,0.000010982605,0.0001758818,0.000018744075,0.0000020816206,0.00003568777,0.0003427168,0.00027938274,0.0005572475,0.9949633,0.0009161311,0.0026548866],"study_design_scores_gemma":[0.0000134401835,0.0000097665625,0.0001395859,0.000008873436,0.0000049391642,0.000059851525,0.0001854686,0.001804882,0.00058463565,0.9935254,0.0036512057,0.0000120754],"about_ca_topic_score_codex":0.0017570399,"about_ca_topic_score_gemma":0.0021738498,"teacher_disagreement_score":0.01434001,"about_ca_system_score_codex":0.0012176341,"about_ca_system_score_gemma":0.00088944286,"threshold_uncertainty_score":0.047972143},"labels":[],"label_agreement":null},{"id":"W1997591489","doi":"10.1016/j.ic.2014.08.005","title":"Conservative groupoids recognize only regular languages","year":2014,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Class (philosophy); Mathematics; Double groupoid; Hierarchy; Semigroup; Associative property; Regular language; Property (philosophy); Context (archaeology); Conservative extension; Pure mathematics; Algebra over a field; Computer science; Discrete mathematics; Theoretical computer science; Artificial intelligence; Automaton","score_opus":0.006634479812632228,"score_gpt":0.2306338532912243,"score_spread":0.22399937347859206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997591489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5733172,0.00033131233,0.3849023,0.0006666578,0.0004992753,0.00021357957,0.0004504614,0.004780466,0.034838784],"genre_scores_gemma":[0.9525654,0.00009022732,0.03198397,0.00022970169,0.000089244626,0.00011147071,0.00053343613,0.00043155698,0.013965089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906,0.00014114553,0.000068353314,0.00033678033,0.00019107974,0.00020272301],"domain_scores_gemma":[0.99512404,0.0023375568,0.00039950953,0.0013260266,0.00050947105,0.00030330828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006270356,0.00063922646,0.001041313,0.0006498329,0.0010744112,0.0032133732,0.0008336886,0.0013167948,0.005626137],"category_scores_gemma":[0.003470636,0.0005071684,0.00077778543,0.0004687296,0.0021918393,0.005818751,0.0017294111,0.0014613868,0.0027509048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001078957,0.00022706049,0.0047874157,0.00037160437,0.00006233721,0.0008444507,0.006107574,0.0039910297,0.12110541,0.7698134,0.0070894216,0.08452135],"study_design_scores_gemma":[0.000058115747,0.00016859351,0.0008507604,0.000047825095,0.00005075587,0.00043487453,0.0014654554,0.015213488,0.06531334,0.90545154,0.010870868,0.00007444929],"about_ca_topic_score_codex":0.0005480019,"about_ca_topic_score_gemma":0.000694642,"teacher_disagreement_score":0.005626137,"about_ca_system_score_codex":0.0006224369,"about_ca_system_score_gemma":0.0007502954,"threshold_uncertainty_score":0.0188213},"labels":[],"label_agreement":null},{"id":"W1999696434","doi":"10.1016/j.tcs.2005.07.016","title":"A generalization of repetition threshold","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Western University","funders":"","keywords":"Repetition (rhetorical device); Generalization; Alphabet; Mathematics; Word (group theory); Combinatorics on words; Combinatorics; Discrete mathematics; Existential quantification; Arithmetic; Linguistics; Geometry; Mathematical analysis","score_opus":0.00790752423281006,"score_gpt":0.23576885501357725,"score_spread":0.2278613307807672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999696434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06327041,0.0017212257,0.82442623,0.0041314284,0.0011213963,0.00015506122,0.00040145728,0.001793898,0.1029789],"genre_scores_gemma":[0.82368845,0.0012401807,0.12606785,0.0028137516,0.0022615457,0.00033182706,0.00033559802,0.0010006195,0.042260177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99608374,0.0008206733,0.00025019958,0.0013567389,0.0010143872,0.00047417587],"domain_scores_gemma":[0.9857654,0.007703645,0.00080242596,0.0036942656,0.0012322735,0.00080214744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025828604,0.00078121864,0.0018914883,0.002269488,0.0019137028,0.0037026098,0.0031440419,0.0028834338,0.013052983],"category_scores_gemma":[0.016192727,0.00082428375,0.0019537478,0.0020315305,0.0052220006,0.011161241,0.0049039093,0.0051225866,0.0025971085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029085119,0.000014733353,0.0001622346,0.000048645274,0.000011312776,0.00008349935,0.00017325144,0.0014403706,0.0025441116,0.98838556,0.0012868448,0.0058203754],"study_design_scores_gemma":[0.000012083389,0.000022914766,0.00011472329,0.000011794678,0.000014998276,0.00020428383,0.000032975462,0.014093804,0.0011239309,0.9805088,0.0038405217,0.000019059633],"about_ca_topic_score_codex":0.00092188147,"about_ca_topic_score_gemma":0.00053222757,"teacher_disagreement_score":0.013052983,"about_ca_system_score_codex":0.0018134157,"about_ca_system_score_gemma":0.0014514931,"threshold_uncertainty_score":0.04366654},"labels":[],"label_agreement":null},{"id":"W1999769297","doi":"10.1007/s00208-006-0767-2","title":"Varieties of finite supersolvable groups with the M. Hall property","year":2006,"lang":"en","type":"article","venue":"Mathematische Annalen","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Variety (cybernetics); Monoid; Prime (order theory); Abelian group; Decidability; Exponent; Combinatorics; Integer (computer science); Free product; Finitely-generated abelian group; Group (periodic table); Pure mathematics; Product (mathematics); Discrete mathematics; Geometry","score_opus":0.009781479622519029,"score_gpt":0.18378348197055647,"score_spread":0.17400200234803745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999769297","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7717472,0.0018527053,0.06906768,0.0018355264,0.0003021124,0.000040368584,0.00060904515,0.0004581326,0.15408729],"genre_scores_gemma":[0.98449904,0.0002097796,0.0044394396,0.00010716904,0.00013463614,0.000024541592,0.00027519732,0.00003585642,0.010274423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959093,0.00010019815,0.00002419388,0.0000912909,0.00009177371,0.000101694255],"domain_scores_gemma":[0.999252,0.00038087825,0.00009581781,0.00012053427,0.000052296244,0.00009845943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034567888,0.0002776474,0.00042750797,0.0008507364,0.001306913,0.0023215504,0.00051745493,0.000467098,0.007586699],"category_scores_gemma":[0.0009089105,0.0003791273,0.00045284003,0.00078668963,0.0022457275,0.0034479173,0.0019209582,0.00091290637,0.0006645458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001067568,0.000012315184,0.00035615359,0.00003567308,0.000007152649,0.00011646474,0.00042898854,0.0006149198,0.0016741089,0.9899311,0.0016472868,0.0050690724],"study_design_scores_gemma":[0.00004229629,0.000024071102,0.0006285395,0.000013761971,0.000013608113,0.00018297936,0.00036282593,0.0018633037,0.0019533245,0.9857809,0.009117095,0.00001723238],"about_ca_topic_score_codex":0.00049323693,"about_ca_topic_score_gemma":0.0005227697,"teacher_disagreement_score":0.007586699,"about_ca_system_score_codex":0.0005854573,"about_ca_system_score_gemma":0.00031017372,"threshold_uncertainty_score":0.025380015},"labels":[],"label_agreement":null},{"id":"W2000137537","doi":"10.5539/cis.v6n2p134","title":"A Generic Tool for Teaching Compilers","year":2013,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Compiler; Programming language; Parsing; Compiler construction; Compiler correctness; Optimizing compiler; Automaton; Generality; Unification; Syntax; Theoretical computer science; Artificial intelligence","score_opus":0.010235786043284739,"score_gpt":0.22836915222298557,"score_spread":0.21813336617970083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000137537","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029719009,0.00010640695,0.9825104,0.00018974463,0.00007492593,0.00008953658,0.000115858784,0.008995104,0.0049461015],"genre_scores_gemma":[0.059306834,0.00033072545,0.9323312,0.0002140662,0.00006778022,0.00027766204,0.0005303578,0.001764187,0.0051772194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99817705,0.00063492986,0.0001645433,0.00041854827,0.00045022817,0.00015465108],"domain_scores_gemma":[0.9968239,0.001354798,0.00015587914,0.0011125098,0.00035917133,0.00019367012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018719593,0.0010731351,0.0007193767,0.0014462213,0.0008307561,0.0019619844,0.0021854932,0.0016015031,0.013252633],"category_scores_gemma":[0.006449172,0.0006571474,0.0010678581,0.0009611492,0.0015261299,0.0034957214,0.0029540113,0.0025123882,0.0055326507],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016483973,0.00029365282,0.0012281555,0.00080345134,0.00003271566,0.00056242413,0.0019910166,0.015423712,0.028680632,0.5115305,0.022107119,0.41718173],"study_design_scores_gemma":[0.00013618248,0.00034710142,0.0007542831,0.0005131701,0.000060701506,0.0020397482,0.00048387688,0.114632316,0.056757037,0.33392656,0.4902014,0.00014755201],"about_ca_topic_score_codex":0.00031166026,"about_ca_topic_score_gemma":0.00038810534,"teacher_disagreement_score":0.013252633,"about_ca_system_score_codex":0.00094183406,"about_ca_system_score_gemma":0.0016761706,"threshold_uncertainty_score":0.04433453},"labels":[],"label_agreement":null},{"id":"W2000194783","doi":"10.1016/j.tcs.2013.07.005","title":"Linear circuits, two-variable logic and weakly blocked monoids","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Predicate (mathematical logic); Closure (psychology); Discrete mathematics; Class (philosophy); Algebraic number; Predicate logic; First-order logic; Variable (mathematics); Expressive power; Predicate variable; Electronic circuit; Algorithm; Arithmetic; Computer science; Zeroth-order logic; Theoretical computer science; Multimodal logic; Programming language","score_opus":0.00827689966408616,"score_gpt":0.2272841832801425,"score_spread":0.21900728361605634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000194783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.278761,0.0065061017,0.6553374,0.004602439,0.00033935104,0.00011738142,0.000692527,0.00087513897,0.052768588],"genre_scores_gemma":[0.9122042,0.0020823604,0.054740373,0.0006866457,0.0002580759,0.00016542188,0.00050292065,0.00013165698,0.029228311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892396,0.00034117035,0.0000777433,0.00023702488,0.00022531068,0.00019476599],"domain_scores_gemma":[0.99682355,0.0022599727,0.00023060293,0.0002616128,0.0002563664,0.00016796203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012992121,0.000593838,0.0007452023,0.0011816105,0.0011874654,0.00394217,0.0015538054,0.0013576192,0.005772735],"category_scores_gemma":[0.0031644881,0.0006547091,0.0009771413,0.0017264993,0.003220942,0.00757308,0.0019911227,0.002750123,0.000936866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009410046,0.000036410845,0.00020224613,0.0000713306,0.000009893864,0.00007340477,0.00025901617,0.002320585,0.0017585623,0.987711,0.0006831626,0.006780327],"study_design_scores_gemma":[0.000023676044,0.000019044477,0.00008492856,0.000016607119,0.000015253885,0.000059678332,0.00006156879,0.007387044,0.001243865,0.988526,0.0025450652,0.000017240762],"about_ca_topic_score_codex":0.0019114728,"about_ca_topic_score_gemma":0.0017743779,"teacher_disagreement_score":0.005772735,"about_ca_system_score_codex":0.0020788666,"about_ca_system_score_gemma":0.001085977,"threshold_uncertainty_score":0.019311726},"labels":[],"label_agreement":null},{"id":"W2000227786","doi":"10.1007/s00233-008-9095-z","title":"The ideal retraction property for completely regular semigroups","year":2008,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Ideal (ethics); Property (philosophy); Algebra over a field; Minimal ideal; Regular semigroup; Pure mathematics; Semigroup; Arithmetic; Discrete mathematics; Maximal ideal; Special classes of semigroups","score_opus":0.022564038144710474,"score_gpt":0.23146566079528821,"score_spread":0.20890162265057774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000227786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3525259,0.0022562065,0.53038514,0.0051322454,0.0011547585,0.000111716414,0.0005819207,0.0015510704,0.10630111],"genre_scores_gemma":[0.941509,0.0007886601,0.031913545,0.000511936,0.0007721657,0.00012222039,0.00046810057,0.0002742191,0.023640119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768996,0.00045119648,0.00020899046,0.0006951808,0.00056100864,0.00039363853],"domain_scores_gemma":[0.99370605,0.0033586016,0.00045853152,0.0010844042,0.0006777752,0.0007145245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028862872,0.0006421803,0.0012707744,0.001405806,0.0021269256,0.003828668,0.0008653286,0.001328085,0.0059707626],"category_scores_gemma":[0.0078198165,0.00071555015,0.0014013022,0.0009889865,0.004765106,0.012712978,0.0030876612,0.00366624,0.0012871142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014815075,0.000035032514,0.00025174362,0.000071695686,0.000009538053,0.00019768799,0.0007759302,0.0004915161,0.0037461463,0.9828693,0.0014532959,0.00994998],"study_design_scores_gemma":[0.00004604447,0.000046246423,0.00020212731,0.00001305467,0.000011076756,0.0004112397,0.0001331895,0.0031700348,0.0027220806,0.9883195,0.004898493,0.000026977486],"about_ca_topic_score_codex":0.00031953517,"about_ca_topic_score_gemma":0.00023029365,"teacher_disagreement_score":0.0059707626,"about_ca_system_score_codex":0.0006761305,"about_ca_system_score_gemma":0.00087498483,"threshold_uncertainty_score":0.019974232},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W2000777414","doi":"10.1016/s0304-3975(99)00020-1","title":"Efficient implementation of regular languages using reversed alternating finite automata","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Deterministic finite automaton; Finite-state machine; Nondeterministic finite automaton; Automaton; Computer science; Representation (politics); Regular language; Theoretical computer science; Quantum finite automata; Mathematics; Algorithm; Automata theory","score_opus":0.00972641191193077,"score_gpt":0.2902834371344849,"score_spread":0.28055702522255416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000777414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100394726,0.0001550233,0.874931,0.00027267987,0.00020004726,0.00020456579,0.0002127178,0.0153020695,0.00832729],"genre_scores_gemma":[0.6188557,0.000121176905,0.3722105,0.00017623034,0.000048071754,0.00028280067,0.00060883275,0.0009453675,0.006751274],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978284,0.0007059341,0.00021751506,0.00034586038,0.0005256769,0.00037660374],"domain_scores_gemma":[0.9946596,0.002344672,0.00024075339,0.0017869779,0.0008128985,0.00015509025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013893653,0.0006612593,0.00086520496,0.0005538936,0.0007031377,0.0020828082,0.0026489897,0.00084429525,0.0069171246],"category_scores_gemma":[0.0050373753,0.0006176417,0.001070868,0.0005342061,0.00094794953,0.0034508167,0.0016864825,0.0014904687,0.0018448647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028504315,0.0012670727,0.0021698312,0.0008621708,0.00017986739,0.0009386409,0.0013115541,0.065990224,0.18272808,0.36169067,0.013944079,0.36606744],"study_design_scores_gemma":[0.0004188308,0.0004742997,0.00034620022,0.0000692209,0.0001715403,0.00027629736,0.0002728341,0.63162404,0.17386883,0.1694605,0.022880415,0.00013702888],"about_ca_topic_score_codex":0.0011746091,"about_ca_topic_score_gemma":0.0022542719,"teacher_disagreement_score":0.0069171246,"about_ca_system_score_codex":0.00069341774,"about_ca_system_score_gemma":0.0014275652,"threshold_uncertainty_score":0.023140073},"labels":[],"label_agreement":null},{"id":"W2001273190","doi":"10.1142/s0129054112400461","title":"STATE COMPLEXITY AND APPROXIMATION","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Computational complexity theory; Computer science; Theoretical computer science; Quantum complexity theory; Mathematics; Algorithm; Quantum computer","score_opus":0.0314267423021446,"score_gpt":0.3057200336348058,"score_spread":0.2742932913326612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001273190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031670846,0.0051270747,0.89461625,0.00887022,0.00048492683,0.00012030777,0.00034942394,0.00067387376,0.058087118],"genre_scores_gemma":[0.71068984,0.007099994,0.25723925,0.001539963,0.0012060526,0.00041877266,0.0009793773,0.00048460596,0.020342067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935323,0.0017415435,0.00044369543,0.0011659812,0.002230863,0.0008856057],"domain_scores_gemma":[0.9714982,0.020635165,0.0011354503,0.0046592494,0.0015656232,0.00050628034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044674575,0.0010620266,0.0016997181,0.0018555236,0.0015432246,0.005691355,0.002944446,0.001969339,0.010598653],"category_scores_gemma":[0.026524935,0.00061688165,0.0029405707,0.0029264744,0.0056410334,0.017192945,0.004891564,0.007311034,0.00122414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037571466,0.00002511864,0.0004364412,0.000107728105,0.00001880006,0.00003213946,0.00014260798,0.011610646,0.00027515396,0.9715863,0.0014211618,0.0143064195],"study_design_scores_gemma":[0.0000068825348,0.000019374582,0.00014229133,0.000037032853,0.000013502261,0.000050610422,0.000049506354,0.030753301,0.00045747988,0.96364313,0.0048157917,0.000011041622],"about_ca_topic_score_codex":0.0023879886,"about_ca_topic_score_gemma":0.0014815652,"teacher_disagreement_score":0.010598653,"about_ca_system_score_codex":0.004402008,"about_ca_system_score_gemma":0.0016562792,"threshold_uncertainty_score":0.03545606},"labels":[],"label_agreement":null},{"id":"W2001279658","doi":"10.1016/j.tcs.2006.02.003","title":"Synchronizing groups and automata","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Permutation (music); Synchronizing; Mathematics; Combinatorics; Property (philosophy); Word (group theory); Permutation group; Discrete mathematics; Character (mathematics); Prime (order theory); Automaton; Cyclic permutation; Symmetric group; Computer science; Theoretical computer science; Topology (electrical circuits)","score_opus":0.004610918180651434,"score_gpt":0.20743109213955863,"score_spread":0.2028201739589072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001279658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21187954,0.017358204,0.5005787,0.013493066,0.0029107176,0.00016718193,0.00053144037,0.0011458833,0.25193524],"genre_scores_gemma":[0.9168092,0.004089545,0.029298225,0.00093600614,0.0019810053,0.00022166656,0.0004024584,0.00018391687,0.046077937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892235,0.00036552717,0.000067219284,0.00032452453,0.00020345737,0.000116963274],"domain_scores_gemma":[0.99779105,0.0013623956,0.00016810131,0.00033828497,0.00018082932,0.00015943102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010402228,0.0007159966,0.0011005014,0.0019036797,0.0018432487,0.0031635736,0.0007773219,0.0014580528,0.010533409],"category_scores_gemma":[0.00278532,0.000489029,0.00081497565,0.0025441428,0.005522648,0.0071568433,0.0026745675,0.0027001759,0.0014318464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008535042,0.000006361211,0.000043720403,0.000017394075,0.0000024484016,0.000021093994,0.00021170586,0.00028413878,0.00018965648,0.99585754,0.00064268353,0.002714659],"study_design_scores_gemma":[0.000005224056,0.0000055259657,0.000023945191,0.0000046749115,0.0000031522538,0.000024061088,0.00004575635,0.00074249564,0.00012220068,0.99546885,0.0035511255,0.000002914524],"about_ca_topic_score_codex":0.0005253214,"about_ca_topic_score_gemma":0.00036911728,"teacher_disagreement_score":0.010533409,"about_ca_system_score_codex":0.0011014643,"about_ca_system_score_gemma":0.00069609995,"threshold_uncertainty_score":0.03523779},"labels":[],"label_agreement":null},{"id":"W2001772188","doi":"10.1142/s0218196705002761","title":"ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS","year":2005,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Centro de Matemática Universidade do Porto; Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Automaton; Decidability; Class (philosophy); Discrete mathematics; ω-automaton; Finite-state machine; Group (periodic table); Automata theory; Quantum finite automata; Theoretical computer science; Algorithm; Computer science; Artificial intelligence","score_opus":0.011680712921872874,"score_gpt":0.2636204136391523,"score_spread":0.2519397007172794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001772188","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6819102,0.0018251514,0.22348768,0.0015369792,0.00027416972,0.00023835232,0.00042119558,0.00064962625,0.08965667],"genre_scores_gemma":[0.9534869,0.00080024806,0.02226715,0.00031007375,0.00040719844,0.00022658108,0.0005282703,0.00012036855,0.021853277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993661,0.00012335426,0.000037092068,0.00018969245,0.00013697307,0.0001468089],"domain_scores_gemma":[0.998689,0.0005868291,0.00020726178,0.00022436751,0.00009796377,0.00019459304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005730811,0.0006812461,0.00060661376,0.0012409757,0.0017519088,0.001924983,0.0006551335,0.0014034008,0.0051375246],"category_scores_gemma":[0.0020210075,0.0002943478,0.0014550997,0.0008128622,0.0031201788,0.003628535,0.002234337,0.0015140552,0.0007121212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005561687,0.000038207603,0.0007994998,0.000050242204,0.000013831992,0.0005174544,0.0011558799,0.0035132128,0.0040087937,0.9840364,0.00058311643,0.005227702],"study_design_scores_gemma":[0.000040004077,0.00011024769,0.00060226186,0.00002404748,0.000016025628,0.00039574495,0.0003034208,0.013007523,0.0012640617,0.97494817,0.009262713,0.000025749674],"about_ca_topic_score_codex":0.0010935465,"about_ca_topic_score_gemma":0.0007670588,"teacher_disagreement_score":0.0051375246,"about_ca_system_score_codex":0.0008712822,"about_ca_system_score_gemma":0.0005278717,"threshold_uncertainty_score":0.01718676},"labels":[],"label_agreement":null},{"id":"W2002514595","doi":"10.1016/j.jnt.2008.02.010","title":"Beta-expansions for infinite families of Pisot and Salem numbers","year":2008,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; BETA (programming language); Combinatorics; Discrete mathematics; Computer science","score_opus":0.01984462807691147,"score_gpt":0.2536320707184858,"score_spread":0.23378744264157433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002514595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6132464,0.0021194257,0.24693465,0.0024285228,0.00049307407,0.0000663541,0.0002384397,0.0004575652,0.1340156],"genre_scores_gemma":[0.9571559,0.0006017814,0.022869112,0.0002949358,0.00033740883,0.00014538564,0.00013890097,0.000100146935,0.018356536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992914,0.00018650836,0.000039664388,0.0000913853,0.00027821457,0.00011284062],"domain_scores_gemma":[0.9969994,0.002034494,0.0001994916,0.00016430432,0.00031379735,0.00028862778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016497856,0.0005609213,0.0007875084,0.0024449923,0.0022126692,0.0026741808,0.0008143868,0.00090852915,0.005592454],"category_scores_gemma":[0.0062580174,0.0005065717,0.0008551197,0.0015680477,0.0031870885,0.0034337933,0.0016579522,0.0024590972,0.0007072169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023516674,0.0000064211476,0.00016161196,0.000011688789,0.0000024355825,0.00011127465,0.00026976597,0.00031258952,0.00039560773,0.99644715,0.00036219024,0.0018956691],"study_design_scores_gemma":[0.000017380975,0.000014436032,0.00026508496,0.000017159355,0.000007989345,0.00030671756,0.00012454223,0.0055066873,0.0003531038,0.99107575,0.0022985844,0.000012574518],"about_ca_topic_score_codex":0.0004287482,"about_ca_topic_score_gemma":0.0004781532,"teacher_disagreement_score":0.005592454,"about_ca_system_score_codex":0.0013961823,"about_ca_system_score_gemma":0.00057260063,"threshold_uncertainty_score":0.018708646},"labels":[],"label_agreement":null},{"id":"W2002710427","doi":"10.5802/jtnb.476","title":"A contribution to infinite disjoint covering systems","year":2008,"lang":"lv","type":"article","venue":"Journal de Théorie des Nombres de Bordeaux","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PQ Corporation (Canada)","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Conjecture","score_opus":0.01683977683229061,"score_gpt":0.25032044485200905,"score_spread":0.23348066801971845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002710427","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042477116,0.018754378,0.52773505,0.012427286,0.006055603,0.000076828204,0.0010821196,0.0013516363,0.39003995],"genre_scores_gemma":[0.59685296,0.01478728,0.16712713,0.00524597,0.008977228,0.0002749899,0.0036024076,0.0018996737,0.20123236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99595046,0.0012944521,0.00021171109,0.00083887065,0.0011944047,0.0005101091],"domain_scores_gemma":[0.99442434,0.0029205405,0.0002167664,0.0011372456,0.0008143087,0.0004867149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002304839,0.0011648546,0.0012083828,0.0025024894,0.0034531953,0.0042574424,0.0016536714,0.0016579373,0.01731961],"category_scores_gemma":[0.009319143,0.0009222992,0.0024404645,0.0032955315,0.0030931293,0.009566735,0.006805153,0.0056182216,0.0043440587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028379396,0.000019125191,0.0002858585,0.00014053825,0.000023595836,0.00012194814,0.0004937301,0.0012596273,0.0004725675,0.9693272,0.012556035,0.015271318],"study_design_scores_gemma":[0.000006492792,0.000016709502,0.00017591778,0.00007053283,0.000023518734,0.00016800093,0.000110755114,0.0032245938,0.00038346005,0.9062869,0.08951427,0.000018779921],"about_ca_topic_score_codex":0.0024288555,"about_ca_topic_score_gemma":0.0017687263,"teacher_disagreement_score":0.01731961,"about_ca_system_score_codex":0.0037951006,"about_ca_system_score_gemma":0.00145693,"threshold_uncertainty_score":0.057939887},"labels":[],"label_agreement":null},{"id":"W2002992445","doi":"10.1016/s0304-3975(02)00830-7","title":"On the complexity of intersecting finite state automata and NL versus NP","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McMaster University","funders":"","keywords":"Mathematics; Complexity class; Deterministic finite automaton; DFA minimization; Intersection (aeronautics); Finite-state machine; Class (philosophy); Time complexity; Computational complexity theory; Discrete mathematics; Combinatorics; Algorithm; State (computer science); Automaton; Quantum finite automata; Automata theory; Computer science; Theoretical computer science","score_opus":0.035858908373254124,"score_gpt":0.26059878692361255,"score_spread":0.22473987855035843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002992445","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51437956,0.01349984,0.27301356,0.042733286,0.0006362151,0.00020604995,0.0024124708,0.0008451867,0.15227373],"genre_scores_gemma":[0.96417356,0.0028885673,0.023111617,0.0008298843,0.00093901186,0.00012856128,0.0010218616,0.00023129405,0.0066755046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99244505,0.0031155827,0.00048499173,0.0010822547,0.0019929814,0.00087911694],"domain_scores_gemma":[0.80092436,0.18441373,0.00393524,0.00609304,0.0026656045,0.001967988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061819125,0.0007846241,0.0021437928,0.0024014441,0.0031498575,0.009043321,0.0029214823,0.0036306235,0.012544578],"category_scores_gemma":[0.06979717,0.0010702019,0.0020699834,0.0040548407,0.0075029,0.038862135,0.0064123827,0.0069758845,0.000743101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005070958,0.00012308333,0.0031465134,0.00036604423,0.000059556638,0.00018267569,0.0012045592,0.033155873,0.0005681468,0.9275469,0.0054653077,0.027674291],"study_design_scores_gemma":[0.000018037234,0.000014313356,0.000404748,0.000028689148,0.0000166589,0.00008680062,0.00018944195,0.025837757,0.00019606578,0.9718846,0.0013078415,0.000014999883],"about_ca_topic_score_codex":0.0035314318,"about_ca_topic_score_gemma":0.0027177448,"teacher_disagreement_score":0.012544578,"about_ca_system_score_codex":0.00435252,"about_ca_system_score_gemma":0.0024311198,"threshold_uncertainty_score":0.041965783},"labels":[],"label_agreement":null},{"id":"W2003815520","doi":"10.1016/j.tcs.2010.11.021","title":"On the size of inverse semigroups given by generators","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Injective function; Mathematics; Semigroup; Permutation (music); Discrete mathematics; Generator (circuit theory); Regular semigroup; Inverse; Property (philosophy); Domain (mathematical analysis); Combinatorics; Cancellative semigroup; Set (abstract data type); Pure mathematics; Special classes of semigroups; Mathematical analysis; Computer science; Geometry","score_opus":0.004691432277483324,"score_gpt":0.20709051736514558,"score_spread":0.20239908508766224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003815520","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7389752,0.0019441375,0.20568027,0.007656435,0.00035432127,0.00008430608,0.0010764434,0.0007871568,0.043441776],"genre_scores_gemma":[0.9774778,0.0004933245,0.015594886,0.00032708084,0.0004960976,0.00014927372,0.00048033794,0.00027580632,0.004705349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99661475,0.001402286,0.00020612183,0.0005715756,0.0008636812,0.00034157187],"domain_scores_gemma":[0.864823,0.123598106,0.0031804012,0.004065011,0.0020119136,0.0023216489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004571904,0.0007986706,0.0017853982,0.0017116724,0.0010400758,0.005079273,0.0020080798,0.0020922062,0.008863058],"category_scores_gemma":[0.037357997,0.0010614172,0.0010274457,0.0011278362,0.004503886,0.013691204,0.0029057816,0.0029983018,0.0005891639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007991075,0.00008820526,0.0024165236,0.00016772565,0.00004000257,0.0001415682,0.0008342307,0.013060028,0.0057125157,0.9628535,0.0022864777,0.011600187],"study_design_scores_gemma":[0.000092885144,0.00008775774,0.000917095,0.000034623146,0.000032204774,0.00018410018,0.00014703651,0.041271023,0.00280029,0.95321125,0.0011873977,0.00003438311],"about_ca_topic_score_codex":0.0004768671,"about_ca_topic_score_gemma":0.00046839795,"teacher_disagreement_score":0.008863058,"about_ca_system_score_codex":0.0014504637,"about_ca_system_score_gemma":0.0009007431,"threshold_uncertainty_score":0.029649913},"labels":[],"label_agreement":null},{"id":"W2004034154","doi":"10.1007/s00233-008-9057-5","title":"On finitely generated idempotent semigroups","year":2008,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Idempotence; Mathematics; Semigroup; Mathematical proof; Finitely-generated abelian group; Algebra over a field; Pure mathematics; Stallings theorem about ends of groups; Discrete mathematics","score_opus":0.016672583078270138,"score_gpt":0.2150343545220483,"score_spread":0.19836177144377817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004034154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36119816,0.0055490215,0.5277695,0.0030963477,0.0016847029,0.000096104835,0.0005387927,0.0007651375,0.09930224],"genre_scores_gemma":[0.9207367,0.001824944,0.038196966,0.00037317115,0.0011630151,0.0001709899,0.0004632176,0.00018725324,0.0368838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748355,0.0007261045,0.0001655731,0.0004924624,0.00070458313,0.0004278639],"domain_scores_gemma":[0.9925051,0.0048570847,0.0004964048,0.0005867935,0.0007314222,0.0008232357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033871923,0.0012766358,0.0012811633,0.0034589614,0.003372605,0.004885665,0.0014576343,0.0020221071,0.007688797],"category_scores_gemma":[0.0071468954,0.0008956118,0.0015746265,0.0024053943,0.0042019323,0.012478812,0.0041159256,0.0029806315,0.0015499973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006409718,0.000032773652,0.00012122905,0.00003825545,0.0000054025363,0.00021749655,0.00066810154,0.00040711474,0.0014092514,0.9919485,0.00057842786,0.004509357],"study_design_scores_gemma":[0.000023736719,0.000039775106,0.00012798546,0.000018749553,0.0000091823285,0.00022055797,0.00010291966,0.0024556413,0.0007110246,0.9925224,0.0037482036,0.000019864608],"about_ca_topic_score_codex":0.00034052704,"about_ca_topic_score_gemma":0.0003339384,"teacher_disagreement_score":0.007688797,"about_ca_system_score_codex":0.00144264,"about_ca_system_score_gemma":0.0006316286,"threshold_uncertainty_score":0.02572155},"labels":[],"label_agreement":null},{"id":"W2004160537","doi":"10.1023/b:pacs.0000021270.99375.f5","title":"Infinite Strings Generated by Insertions","year":2004,"lang":"en","type":"article","venue":"Programming and Computer Software","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Countable set; Mathematics; Alphabet; String (physics); Discrete mathematics; Set (abstract data type); Combinatorics; Invariant (physics); Computer science","score_opus":0.009043573863573866,"score_gpt":0.20934985237426973,"score_spread":0.20030627851069585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004160537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37541667,0.0009491118,0.49457628,0.0019421411,0.000850419,0.000116541014,0.0008071302,0.0033532842,0.12198846],"genre_scores_gemma":[0.88656247,0.0005159398,0.06519766,0.00055394403,0.00041329695,0.0002215386,0.001217066,0.0012781426,0.044039823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985525,0.00037597166,0.00012632036,0.00031012058,0.00044469134,0.00019039585],"domain_scores_gemma":[0.9942509,0.0039138775,0.00037634297,0.0005581527,0.0006665872,0.00023414246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090512604,0.00072355417,0.0006985741,0.0015764754,0.0016039029,0.0028846313,0.0012551217,0.0017329858,0.009396988],"category_scores_gemma":[0.006093151,0.0006592482,0.00095105614,0.0013918523,0.0021602076,0.0053657205,0.0019376618,0.0025435803,0.003238094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021765489,0.00007653444,0.0006493118,0.00016317835,0.00002023888,0.0012430014,0.0011138341,0.0018992835,0.017195914,0.9479485,0.002472383,0.027000109],"study_design_scores_gemma":[0.000028084874,0.00004045954,0.00026738565,0.000044369925,0.000040448158,0.00079381216,0.00019959832,0.012393945,0.011033853,0.9631414,0.011984137,0.000032640663],"about_ca_topic_score_codex":0.00012258349,"about_ca_topic_score_gemma":0.0001048072,"teacher_disagreement_score":0.009396988,"about_ca_system_score_codex":0.0005947659,"about_ca_system_score_gemma":0.00041545797,"threshold_uncertainty_score":0.031436086},"labels":[],"label_agreement":null},{"id":"W2004699471","doi":"10.1007/s000120050183","title":"Decomposition of the lattice of pseudovarieties of finite semigroups induced by bands","year":2000,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"semigroups and automata theory","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Lattice (music); Combinatorics; Pure mathematics; Physics","score_opus":0.0057382286275087955,"score_gpt":0.2039287937165971,"score_spread":0.1981905650890883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004699471","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49042955,0.0015147876,0.44184425,0.0008056254,0.00045842584,0.00009392581,0.0007988515,0.00057028705,0.06348425],"genre_scores_gemma":[0.9259119,0.00046980308,0.054165304,0.00013187436,0.00025838046,0.00012076707,0.0006128924,0.00019958593,0.018129578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991035,0.0001915652,0.000057258992,0.0001853356,0.0002938329,0.00016843805],"domain_scores_gemma":[0.9989749,0.00025335126,0.00014460998,0.00011340007,0.00021791707,0.0002958761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085190526,0.0004860047,0.0006451421,0.0015862068,0.0011381876,0.00467507,0.0008605706,0.00048230327,0.006202418],"category_scores_gemma":[0.0011167375,0.0004577477,0.00081048196,0.0007408225,0.0023819222,0.0037189214,0.0012473708,0.0015369327,0.0008168793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007069608,0.000026511207,0.00017876107,0.000024060584,0.000008071886,0.000039017887,0.00021116562,0.00068066776,0.0027456821,0.99145836,0.00040840983,0.0041486984],"study_design_scores_gemma":[0.0000316682,0.00005725486,0.00049858727,0.000025094487,0.000017231945,0.0001959873,0.0002897969,0.017169181,0.0038108202,0.9721361,0.0057459273,0.000022329397],"about_ca_topic_score_codex":0.00058416475,"about_ca_topic_score_gemma":0.000535862,"teacher_disagreement_score":0.006202418,"about_ca_system_score_codex":0.0009770432,"about_ca_system_score_gemma":0.0006641957,"threshold_uncertainty_score":0.020749211},"labels":[],"label_agreement":null},{"id":"W2005181510","doi":"10.1016/j.jcss.2003.04.001","title":"Subword histories and Parikh matrices","year":2003,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Decidability; Equivalence (formal languages); Sequence (biology); Type (biology); Word (group theory); Computer science; Mathematics; Discrete mathematics","score_opus":0.01107804895600222,"score_gpt":0.21512534690480742,"score_spread":0.2040472979488052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005181510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48756543,0.001184123,0.41593567,0.0037899849,0.000622206,0.00017667578,0.0008795435,0.0019162827,0.08793001],"genre_scores_gemma":[0.9486861,0.00036123712,0.022831127,0.00023796615,0.0003325677,0.00011538259,0.00028345906,0.00023092289,0.026921118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892277,0.00030456687,0.000092593036,0.00022250334,0.00025360758,0.0002039011],"domain_scores_gemma":[0.9908246,0.005591472,0.00072862627,0.0014176962,0.0006974928,0.00074019545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010698197,0.00039622298,0.00089486456,0.0020652115,0.0032161372,0.004067587,0.0011583202,0.0011585999,0.016708095],"category_scores_gemma":[0.009956483,0.0007115391,0.000703686,0.0018723024,0.0030927057,0.008507027,0.0023298662,0.001965477,0.0023600492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097677264,0.00002467935,0.00027731483,0.0000325541,0.0000057310963,0.00014878105,0.0007009548,0.00075188215,0.0010119267,0.9860706,0.0008832678,0.009994557],"study_design_scores_gemma":[0.000008921359,0.000012615784,0.000069187656,0.000005323662,0.0000049435034,0.00008453266,0.00011550081,0.002798395,0.0005187202,0.9945045,0.0018668541,0.000010506107],"about_ca_topic_score_codex":0.0011173029,"about_ca_topic_score_gemma":0.0009939129,"teacher_disagreement_score":0.016708095,"about_ca_system_score_codex":0.0012461862,"about_ca_system_score_gemma":0.0009838477,"threshold_uncertainty_score":0.055894196},"labels":[],"label_agreement":null},{"id":"W2005868985","doi":"10.1016/j.tcs.2010.10.007","title":"On the superimposition of Christoffel words","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Christoffel symbols; Superimposition; Mathematics; Conjecture; Root (linguistics); Existential quantification; Pure mathematics; Combinatorics; Arithmetic; Algebra over a field; Linguistics; Computer science; Artificial intelligence; Philosophy","score_opus":0.005362706332115055,"score_gpt":0.22263935071596114,"score_spread":0.21727664438384608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005868985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27629763,0.0020780626,0.47961855,0.0022952773,0.0022450814,0.00009530932,0.00021997801,0.0010236813,0.23612645],"genre_scores_gemma":[0.8857213,0.0008397239,0.06403614,0.00063336926,0.00082036405,0.00009221889,0.00027383267,0.0006019636,0.046981107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718934,0.0008735349,0.00017506856,0.0005967308,0.0006992882,0.0004659679],"domain_scores_gemma":[0.9936885,0.0036166527,0.00046092778,0.0008816803,0.0008874639,0.00046477816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019742167,0.00073301455,0.0010379016,0.0025823186,0.0036997858,0.0046116053,0.0017910328,0.0021518234,0.014279409],"category_scores_gemma":[0.012692783,0.0008901508,0.0010783564,0.0021122561,0.0059203417,0.008827828,0.004733596,0.003030914,0.0023746497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057390986,0.000009240652,0.00010283138,0.00001547447,0.0000049860982,0.00016795464,0.000497256,0.00036964266,0.0007686793,0.9899456,0.0005671874,0.00749386],"study_design_scores_gemma":[0.0000120930845,0.000024093266,0.00009426205,0.000017407998,0.000007980131,0.00016299142,0.0002102241,0.0032227368,0.0010388033,0.9886657,0.006525174,0.00001858661],"about_ca_topic_score_codex":0.0010291085,"about_ca_topic_score_gemma":0.00084594556,"teacher_disagreement_score":0.014279409,"about_ca_system_score_codex":0.0012381515,"about_ca_system_score_gemma":0.00077338866,"threshold_uncertainty_score":0.047769308},"labels":[],"label_agreement":null},{"id":"W2006771561","doi":"10.1016/s0022-0000(03)00042-4","title":"Completeness results for graph isomorphism","year":2003,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Combinatorics; Graph isomorphism; Graph automorphism; Mathematics; Discrete mathematics; Isomorphism (crystallography); Graph; Line graph; Voltage graph","score_opus":0.028811575890706785,"score_gpt":0.24963177114746798,"score_spread":0.2208201952567612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006771561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14195526,0.002813536,0.67972594,0.017860016,0.00087026187,0.0005215972,0.0046272096,0.0027302958,0.1488959],"genre_scores_gemma":[0.78050524,0.0035195625,0.15959372,0.004484997,0.0020397445,0.0009844473,0.009099137,0.0018050749,0.037968162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99374133,0.001729977,0.0004991689,0.0017995099,0.0014504376,0.0007795022],"domain_scores_gemma":[0.95243645,0.032852743,0.0010920564,0.0069734845,0.0047476776,0.0018976488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058569782,0.0017089801,0.003404589,0.0049544508,0.007931065,0.008246262,0.0046095327,0.0042115166,0.018323183],"category_scores_gemma":[0.022160718,0.0032762385,0.006268322,0.0062815323,0.0096165165,0.04374237,0.009717498,0.015800213,0.0027670746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013922359,0.00016004851,0.00073738885,0.00026919408,0.000090491245,0.00012264455,0.0011617505,0.0018084171,0.0007591718,0.976004,0.006977018,0.011770536],"study_design_scores_gemma":[0.000022344157,0.000011065559,0.00014703961,0.000012865516,0.00004064583,0.00006761689,0.0001074273,0.0021970752,0.0005125512,0.9946695,0.002195816,0.000016179485],"about_ca_topic_score_codex":0.0031587456,"about_ca_topic_score_gemma":0.003113522,"teacher_disagreement_score":0.018323183,"about_ca_system_score_codex":0.0021479456,"about_ca_system_score_gemma":0.0031473374,"threshold_uncertainty_score":0.06129718},"labels":[],"label_agreement":null},{"id":"W2007236353","doi":"10.4153/cjm-2001-028-4","title":"Avoiding Patterns in the Abelian Sense","year":2001,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Abelian group; Generalization; Mathematics; Sense (electronics); Pure mathematics; Mathematical analysis","score_opus":0.021123877368364567,"score_gpt":0.22232226753243114,"score_spread":0.20119839016406657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007236353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9722563,0.0001789947,0.014713997,0.00012254257,0.000038745442,0.000032795233,0.00014557371,0.00010110114,0.012410028],"genre_scores_gemma":[0.98902446,0.00009502985,0.0067537674,0.00005909091,0.0000250331,0.00003471047,0.00029790535,0.000017627992,0.0036923757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993975,0.00005492428,0.00008023845,0.00011588083,0.000191966,0.00015960548],"domain_scores_gemma":[0.99888545,0.0003106192,0.00031873127,0.00011605231,0.0002535299,0.00011560119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021877521,0.00039980363,0.00037678407,0.0011766338,0.0010800111,0.0018910419,0.0005267966,0.00058373285,0.0026186397],"category_scores_gemma":[0.0012729059,0.00019447536,0.0003756516,0.0009047722,0.0013267127,0.001551468,0.0008906034,0.0005726577,0.00047837658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013483644,0.00023633821,0.04288899,0.00054984173,0.00015530719,0.0034430998,0.004162964,0.010055526,0.1300726,0.6879069,0.004640301,0.11453972],"study_design_scores_gemma":[0.00009501557,0.0004085016,0.013686099,0.00010163358,0.0001323132,0.0033518348,0.0029059655,0.015517014,0.03520131,0.89633363,0.032155573,0.00011117666],"about_ca_topic_score_codex":0.00077664555,"about_ca_topic_score_gemma":0.0007664407,"teacher_disagreement_score":0.0026186397,"about_ca_system_score_codex":0.00041439215,"about_ca_system_score_gemma":0.00039983352,"threshold_uncertainty_score":0.008760214},"labels":[],"label_agreement":null},{"id":"W2007245320","doi":"10.1016/j.tcs.2009.02.022","title":"On the intersection of regex languages with regular languages","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Regular language; Computer science; Regular expression; Intersection (aeronautics); Closure (psychology); Programming language; Pushdown automaton; Automaton; Language family; Semantics (computer science); Formal language; Nondeterministic finite automaton; Theoretical computer science; Class (philosophy); Discrete mathematics; Mathematics; Automata theory; Artificial intelligence; Linguistics","score_opus":0.004291568309149471,"score_gpt":0.2292128165166391,"score_spread":0.22492124820748963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007245320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5206114,0.002244387,0.33290002,0.0035378516,0.0003422174,0.000104441344,0.0005195549,0.0010505697,0.13868964],"genre_scores_gemma":[0.93512666,0.0009517636,0.041365504,0.00053195615,0.0005089868,0.0001666951,0.0007735474,0.00045787045,0.020116994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963586,0.0012679059,0.0002615873,0.0007116969,0.0007718924,0.0006283292],"domain_scores_gemma":[0.9834125,0.011806936,0.001401154,0.0010600155,0.0012775848,0.0010417533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040257364,0.00078424625,0.0017105067,0.0026807676,0.0033712413,0.0067881728,0.0019769536,0.0018509924,0.008797784],"category_scores_gemma":[0.01199203,0.00155032,0.001952543,0.002196601,0.0061014327,0.016680855,0.0061599184,0.0045674904,0.0011925873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015219224,0.00002648814,0.00039694872,0.000032246196,0.00001144233,0.00017717591,0.0007318121,0.0008453847,0.0006370494,0.9927643,0.0005220781,0.0037028862],"study_design_scores_gemma":[0.000021523809,0.000034612414,0.00022788427,0.000030936397,0.00001910014,0.00023155219,0.00034896532,0.0071398057,0.0008298734,0.9883293,0.0027651102,0.00002130919],"about_ca_topic_score_codex":0.00085049844,"about_ca_topic_score_gemma":0.00058065954,"teacher_disagreement_score":0.008797784,"about_ca_system_score_codex":0.0016373886,"about_ca_system_score_gemma":0.00092644093,"threshold_uncertainty_score":0.029431581},"labels":[],"label_agreement":null},{"id":"W2007361403","doi":"10.1016/j.tcs.2007.04.037","title":"Every real number greater than 1 is a critical exponent","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponent; Mathematics; Combinatorics; Critical exponent; Discrete mathematics; Geometry; Scaling; Philosophy","score_opus":0.012511110645053121,"score_gpt":0.2786504745501137,"score_spread":0.2661393639050606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007361403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77058524,0.0057223644,0.08842201,0.0058100563,0.0035388935,0.00033054748,0.00079621986,0.0009799418,0.123814695],"genre_scores_gemma":[0.9695044,0.0013051418,0.014068084,0.00046712172,0.00081543525,0.00017475424,0.00018537375,0.00014496689,0.013334626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951255,0.000067356246,0.000043281136,0.00015510335,0.000088372275,0.00013330397],"domain_scores_gemma":[0.9936598,0.003960516,0.0006991439,0.00047393973,0.00063633797,0.0005702821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008687832,0.0010710352,0.0011122042,0.0021964847,0.0016046392,0.0025347339,0.0006470019,0.001150678,0.009293872],"category_scores_gemma":[0.006053191,0.00035420497,0.0004199298,0.001071398,0.0032813998,0.0039289207,0.0018368781,0.0019044518,0.0016672258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012040643,0.00012581506,0.00388646,0.00072088355,0.00007369572,0.0026334885,0.0012284226,0.00064329297,0.05143366,0.8756044,0.010118944,0.05232692],"study_design_scores_gemma":[0.00029142573,0.0003314705,0.0034068504,0.00030650853,0.00015293875,0.004927373,0.0009094098,0.003538718,0.029118456,0.87235516,0.08455544,0.00010632827],"about_ca_topic_score_codex":0.000071295166,"about_ca_topic_score_gemma":0.00008239118,"teacher_disagreement_score":0.009293872,"about_ca_system_score_codex":0.0005994739,"about_ca_system_score_gemma":0.0004085631,"threshold_uncertainty_score":0.031091154},"labels":[],"label_agreement":null},{"id":"W2007370828","doi":"10.1016/s0304-3975(02)00326-2","title":"Alternating and empty alternating auxiliary stack automata","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Stack (abstract data type); PSPACE; Automaton; Polynomial hierarchy; Bounded function; Hierarchy; Constant (computer programming); Mathematics; Combinatorics; Discrete mathematics; Time complexity; Computer science; Theoretical computer science; Computational complexity theory; Algorithm; Programming language","score_opus":0.00864102512398008,"score_gpt":0.24640921420933193,"score_spread":0.23776818908535186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007370828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41668695,0.00064877974,0.5020107,0.0015484339,0.000562473,0.00011529161,0.00076493365,0.0014350552,0.07622731],"genre_scores_gemma":[0.9195094,0.00029746615,0.049632248,0.00027082174,0.00019402585,0.00015674006,0.0005553172,0.00038446757,0.028999517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981912,0.00042802983,0.0002042954,0.00035032982,0.0004077086,0.00041843887],"domain_scores_gemma":[0.99138874,0.0044266493,0.00052720506,0.0015780784,0.0013071157,0.00077222486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020884601,0.0007657876,0.00082749315,0.0011396908,0.0027513115,0.004823849,0.001840299,0.0018151436,0.011737646],"category_scores_gemma":[0.009943795,0.00077743194,0.0013747234,0.001207827,0.0045437687,0.016124245,0.004218632,0.0036630959,0.001666899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001789695,0.00003933013,0.0003285521,0.000036462923,0.00000664551,0.000119959106,0.0005756085,0.00076996913,0.0018451303,0.9892067,0.0008633074,0.006029427],"study_design_scores_gemma":[0.0000208341,0.000028907136,0.00016970915,0.000011905355,0.00002734934,0.00017361956,0.00019505556,0.008922322,0.0029336622,0.98382044,0.0036741265,0.000022087317],"about_ca_topic_score_codex":0.00053122075,"about_ca_topic_score_gemma":0.0006449165,"teacher_disagreement_score":0.011737646,"about_ca_system_score_codex":0.00076529046,"about_ca_system_score_gemma":0.0011247644,"threshold_uncertainty_score":0.039266348},"labels":[],"label_agreement":null},{"id":"W2007793103","doi":"10.1007/s00454-015-9681-2","title":"A $$d$$ d -dimensional Extension of Christoffel Words","year":2015,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Christoffel symbols; Mathematics; Pure mathematics; Arithmetic","score_opus":0.02211496332905167,"score_gpt":0.26556724424520894,"score_spread":0.24345228091615728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007793103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44248426,0.0019975659,0.30115712,0.0024155336,0.001733336,0.000119077835,0.0010483989,0.0005945622,0.24845009],"genre_scores_gemma":[0.8950153,0.0007305887,0.04191844,0.00047714275,0.00059009914,0.000103611,0.00049891043,0.00013151453,0.060534466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995394,0.00006913194,0.000034605237,0.00016466087,0.00008974383,0.00010259658],"domain_scores_gemma":[0.9992545,0.00017560287,0.00008608658,0.00009030645,0.00017738246,0.00021607187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039459573,0.000494344,0.00051312015,0.0012871829,0.0012899473,0.0017277029,0.000796339,0.00060244196,0.013333827],"category_scores_gemma":[0.0010859505,0.00027463556,0.00063301803,0.00074080453,0.001555539,0.0022935814,0.002204168,0.0012543632,0.0017360531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004671788,0.000023050292,0.00013652659,0.00003265215,0.0000057631387,0.0001314981,0.00012609619,0.00038571228,0.002116396,0.986991,0.0012241387,0.008780374],"study_design_scores_gemma":[0.000024583795,0.00007859225,0.0004938767,0.000027035881,0.000014325549,0.000668867,0.00019907359,0.0054436596,0.0024561335,0.9550564,0.035502374,0.000035108897],"about_ca_topic_score_codex":0.0005792205,"about_ca_topic_score_gemma":0.00041513017,"teacher_disagreement_score":0.013333827,"about_ca_system_score_codex":0.000709667,"about_ca_system_score_gemma":0.00042586125,"threshold_uncertainty_score":0.04460609},"labels":[],"label_agreement":null},{"id":"W2008283002","doi":"10.1142/s0218196708004755","title":"COMBINATORIAL REES–SUSHKEVICH VARIETIES ARE FINITELY BASED","year":2008,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Variety (cybernetics); Finitely-generated abelian group; Pure mathematics; Simple (philosophy); Combinatorics; Algebra over a field","score_opus":0.01664893096638616,"score_gpt":0.24778814730120216,"score_spread":0.231139216334816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008283002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8465689,0.0010171258,0.06439952,0.00022786076,0.00009530627,0.000058330545,0.00036816852,0.00024059114,0.087024115],"genre_scores_gemma":[0.97707707,0.00028982316,0.011987402,0.00004188128,0.000084920845,0.00004653571,0.0003781786,0.000024404499,0.010069781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948394,0.00010476507,0.000041735228,0.00015263798,0.00014138989,0.00007553376],"domain_scores_gemma":[0.99930394,0.00021916699,0.00013846465,0.00011498428,0.00011345203,0.00011003858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004548526,0.00041544484,0.0004918819,0.0014420397,0.0008339543,0.0020392733,0.00056671014,0.00037745075,0.00469018],"category_scores_gemma":[0.00092375255,0.00029587361,0.0005234224,0.0008597784,0.0023397738,0.0025374903,0.0009969301,0.00078547915,0.0007685184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007713826,0.000020604746,0.0009555821,0.00005670574,0.00001833278,0.00025579383,0.0003466582,0.0016342174,0.004572935,0.98278964,0.00046669273,0.008805742],"study_design_scores_gemma":[0.000053285086,0.0001424148,0.003524394,0.00003999136,0.000034946344,0.0011097504,0.00045832858,0.006416498,0.0060735876,0.96846014,0.013637438,0.00004916292],"about_ca_topic_score_codex":0.00019438007,"about_ca_topic_score_gemma":0.00022206885,"teacher_disagreement_score":0.00469018,"about_ca_system_score_codex":0.00041795534,"about_ca_system_score_gemma":0.0002432224,"threshold_uncertainty_score":0.015690207},"labels":[],"label_agreement":null},{"id":"W2008455956","doi":"10.1090/s0025-5718-02-01504-1","title":"Computational investigations of the Prouhet-Tarry-Escott Problem","year":2002,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Simon Fraser University; University of Pennsylvania","keywords":"Ideal (ethics); Mathematics; Applied mathematics","score_opus":0.021962969744656228,"score_gpt":0.2250022095139752,"score_spread":0.20303923976931898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008455956","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75530916,0.0010988435,0.1689146,0.004342269,0.00012546446,0.00021172986,0.0005283329,0.0002486986,0.069220856],"genre_scores_gemma":[0.8446387,0.00037600021,0.14946875,0.00021940478,0.000067816596,0.00019554335,0.00045006062,0.00006984905,0.0045138258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990181,0.00041465042,0.000041382653,0.00011226498,0.00028374785,0.00012988807],"domain_scores_gemma":[0.99163836,0.007024134,0.00031952854,0.0004849186,0.00033601274,0.00019712374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017409273,0.00041532092,0.0007128497,0.0012674134,0.0018467797,0.0013540889,0.001365385,0.0014935234,0.0064627146],"category_scores_gemma":[0.013249067,0.00030211557,0.0008623128,0.001412867,0.0025697506,0.0032317918,0.0015797203,0.0017689242,0.00033919443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006166155,0.00030207378,0.003180442,0.00048945454,0.000077691424,0.0004345237,0.0009914197,0.1720052,0.002446106,0.7732378,0.0071377717,0.03908091],"study_design_scores_gemma":[0.00014222934,0.00014623052,0.00065256946,0.000042065574,0.000037419322,0.00022782004,0.00059802673,0.46269122,0.003204519,0.5249565,0.007270613,0.00003083594],"about_ca_topic_score_codex":0.0012365727,"about_ca_topic_score_gemma":0.0020492754,"teacher_disagreement_score":0.0064627146,"about_ca_system_score_codex":0.0008596211,"about_ca_system_score_gemma":0.00077391864,"threshold_uncertainty_score":0.021619976},"labels":[],"label_agreement":null},{"id":"W2009123487","doi":"10.4153/cmb-2011-030-1","title":"Yet Another Solution to the Burnside Problem for Matrix Semigroups","year":2011,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Pure mathematics; Matrix (chemical analysis); Kernel (algebra); Finitely-generated abelian group; Semigroup; Special classes of semigroups; Algebra over a field; Discrete mathematics","score_opus":0.025004083504398644,"score_gpt":0.22596609078330865,"score_spread":0.20096200727891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009123487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11774371,0.0007142406,0.81229115,0.0042658085,0.0006651381,0.0000701724,0.00011333198,0.0007776987,0.06335881],"genre_scores_gemma":[0.8565823,0.00043529546,0.11069272,0.0007894136,0.00036279604,0.00007830989,0.00010708696,0.00024197936,0.030710189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992719,0.00015585014,0.00005554936,0.00019737994,0.00020260675,0.000116695745],"domain_scores_gemma":[0.998283,0.0007735201,0.000082915074,0.0004086364,0.0002978637,0.00015403307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014046958,0.0002610962,0.00060618547,0.00060468086,0.0015571483,0.0020442691,0.0010093412,0.0012070449,0.010764589],"category_scores_gemma":[0.0035730053,0.0003432969,0.0007855099,0.00037879834,0.0032346454,0.0062810024,0.002893909,0.0023378083,0.0012481088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002809577,0.000007931141,0.00005384147,0.000028383285,0.000004110359,0.00006832584,0.00020045343,0.00033321895,0.0018420464,0.9923233,0.0006844888,0.004425712],"study_design_scores_gemma":[0.000014287102,0.000027103057,0.000053679923,0.000014728174,0.0000066628,0.0001917348,0.00013777411,0.005522489,0.0029610342,0.98385954,0.0071993386,0.000011511254],"about_ca_topic_score_codex":0.0004412386,"about_ca_topic_score_gemma":0.0005964291,"teacher_disagreement_score":0.010764589,"about_ca_system_score_codex":0.00060050806,"about_ca_system_score_gemma":0.0008435585,"threshold_uncertainty_score":0.03601116},"labels":[],"label_agreement":null},{"id":"W2010285287","doi":"10.1016/j.tcs.2007.10.039","title":"Words avoiding repetitions in arithmetic progressions","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arithmetic; Mathematics; Computer science","score_opus":0.009246700703768323,"score_gpt":0.2716644404241367,"score_spread":0.26241773972036836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010285287","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65613014,0.00091026246,0.26748446,0.0011437006,0.0005293365,0.00014142474,0.00029031886,0.0016333521,0.071737],"genre_scores_gemma":[0.922271,0.00030382088,0.04751918,0.00024078785,0.0002582732,0.0001851889,0.0002491849,0.00036838188,0.0286042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801576,0.0006064755,0.00022509639,0.0004100786,0.0004166558,0.0003259463],"domain_scores_gemma":[0.99337715,0.004218604,0.0006258011,0.0008683625,0.0005937025,0.0003163081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011698017,0.00089662353,0.0011598074,0.0014740047,0.0030218759,0.0037850135,0.0013370406,0.0020771201,0.007910134],"category_scores_gemma":[0.0077202357,0.0010073915,0.0011653535,0.0015474337,0.0036890863,0.006799341,0.0026690708,0.0024441774,0.0022093568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024217807,0.00004805781,0.0003681942,0.00011823275,0.000013916941,0.00066864985,0.0016009711,0.0015749895,0.005423911,0.971254,0.0012666511,0.01742029],"study_design_scores_gemma":[0.000030403175,0.000054721437,0.00013104889,0.000022724196,0.000020654461,0.0003591517,0.00017895525,0.0030692036,0.002274908,0.9903323,0.0035005058,0.000025367264],"about_ca_topic_score_codex":0.00031697316,"about_ca_topic_score_gemma":0.0004498297,"teacher_disagreement_score":0.007910134,"about_ca_system_score_codex":0.00066494837,"about_ca_system_score_gemma":0.0006047059,"threshold_uncertainty_score":0.026462018},"labels":[],"label_agreement":null},{"id":"W2011123341","doi":"10.1080/10236198.2013.876422","title":"A case study in meta-automation: automatic generation of congruence automata for combinatorial sequences","year":2014,"lang":"en","type":"article","venue":"The Journal of Difference Equations and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Congruence (geometry); Mathematics; Automaton; Automation; Algebra over a field; Sequence (biology); Theoretical computer science; Discrete mathematics; Computer science; Pure mathematics","score_opus":0.08609220349401839,"score_gpt":0.31234321096492446,"score_spread":0.22625100747090607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011123341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026011687,0.00026135414,0.96358246,0.0009094729,0.00008983356,0.000092940274,0.000061813815,0.0011360646,0.007854418],"genre_scores_gemma":[0.30741656,0.0003830027,0.6855051,0.00032647693,0.000118458185,0.0002285411,0.00015395,0.0006256496,0.0052423025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965784,0.001815785,0.00016775953,0.00050994323,0.0007703335,0.00015778604],"domain_scores_gemma":[0.9894789,0.008074323,0.00016748415,0.0016820553,0.00042928965,0.0001680366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038350476,0.0005903764,0.00070827355,0.0007939299,0.0011861484,0.0021984596,0.0017685452,0.0012970045,0.005876755],"category_scores_gemma":[0.013572322,0.000563577,0.001257083,0.0008329613,0.003797678,0.004991462,0.0022282202,0.0026316065,0.0013163183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001443992,0.00013390093,0.00089933316,0.00026572376,0.000022007067,0.0007637307,0.0018964197,0.013743791,0.008819979,0.9024491,0.0021493586,0.06871227],"study_design_scores_gemma":[0.00015594778,0.0002795359,0.0004952103,0.00014731982,0.000037291433,0.0013098049,0.0007910895,0.13740146,0.04913394,0.73334664,0.07680681,0.00009477871],"about_ca_topic_score_codex":0.00045147134,"about_ca_topic_score_gemma":0.0004423867,"teacher_disagreement_score":0.005876755,"about_ca_system_score_codex":0.00085784803,"about_ca_system_score_gemma":0.0006312705,"threshold_uncertainty_score":0.02028191},"labels":[],"label_agreement":null},{"id":"W2011967700","doi":"10.1090/s0002-9939-2011-11018-9","title":"Monomials as sums of powers: The real binary case","year":2011,"lang":"lv","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Göran Gustafssons Stiftelser","keywords":"Algorithm; Artificial intelligence; Computer science; Annotation","score_opus":0.02588345380878841,"score_gpt":0.25720887769434336,"score_spread":0.23132542388555496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011967700","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07651318,0.0026535087,0.43747842,0.004517248,0.0023231353,0.00013422304,0.00076041877,0.0006892156,0.47493064],"genre_scores_gemma":[0.7894171,0.0040979884,0.0838604,0.0015512487,0.0019890969,0.0001340484,0.00068193587,0.00077367405,0.117494516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988135,0.00020361066,0.00006823161,0.0002177107,0.00042479025,0.00027210906],"domain_scores_gemma":[0.99940896,0.00018025885,0.00007546148,0.00011194982,0.00014865182,0.00007470079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001139032,0.00096486794,0.0006190496,0.0016776322,0.0018045538,0.002940501,0.0009716224,0.0006350611,0.0167652],"category_scores_gemma":[0.0028756834,0.0004206169,0.0012508008,0.0016573203,0.0037094813,0.0062507894,0.002717989,0.00264948,0.006203141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020666806,0.000010082846,0.000080400154,0.000038683364,0.000004861445,0.00015765261,0.00014090509,0.00041048776,0.00039784852,0.98909456,0.0033456308,0.0062981327],"study_design_scores_gemma":[0.000012033196,0.0000139408985,0.00012513816,0.000022897122,0.000011199979,0.0002188914,0.000096770855,0.0031447131,0.0010086737,0.9692226,0.026109496,0.000013515422],"about_ca_topic_score_codex":0.0019200589,"about_ca_topic_score_gemma":0.0019901188,"teacher_disagreement_score":0.0167652,"about_ca_system_score_codex":0.0012939612,"about_ca_system_score_gemma":0.00054734776,"threshold_uncertainty_score":0.05608523},"labels":[],"label_agreement":null},{"id":"W2012328641","doi":"10.4153/cmb-2014-025-1","title":"Combinatorially Factorizable Cryptic Inverse Semigroups","year":2014,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Monoid; Inverse semigroup; Semigroup; Inverse element; Inverse; Bicyclic semigroup; Pure mathematics; Combinatorics; Special classes of semigroups; Algebra over a field","score_opus":0.006134395475508231,"score_gpt":0.18036578869580105,"score_spread":0.17423139322029282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012328641","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5910369,0.0005186121,0.30629957,0.00076006295,0.00023833406,0.00018794811,0.00034661658,0.0007652076,0.09984679],"genre_scores_gemma":[0.9597988,0.0001021675,0.028538058,0.00008736783,0.00011072001,0.000062927,0.00021584393,0.00004219163,0.011041937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897826,0.00016287267,0.00008606639,0.0003054515,0.00031089937,0.00015638178],"domain_scores_gemma":[0.9981476,0.0005296742,0.00025478963,0.00035141053,0.0004367519,0.00027978787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009180737,0.00031152836,0.0003556825,0.0006952361,0.00082425633,0.0020915372,0.00038685088,0.00045888097,0.005505247],"category_scores_gemma":[0.0020303773,0.00020351872,0.0005252135,0.00034552618,0.0025351017,0.0016961205,0.0010394675,0.0007783314,0.0005562649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011788588,0.00005451437,0.0009420034,0.000041749496,0.000007926028,0.00043453384,0.00076137856,0.0015769077,0.008209592,0.9767056,0.0006327621,0.010515278],"study_design_scores_gemma":[0.00007423154,0.00015810423,0.0013387987,0.00004200599,0.00003319349,0.001285406,0.0006424208,0.021527933,0.01831286,0.93009347,0.026439587,0.00005199419],"about_ca_topic_score_codex":0.00076124026,"about_ca_topic_score_gemma":0.00057551556,"teacher_disagreement_score":0.005505247,"about_ca_system_score_codex":0.00090804143,"about_ca_system_score_gemma":0.0006126448,"threshold_uncertainty_score":0.018416822},"labels":[],"label_agreement":null},{"id":"W2012995549","doi":"10.4153/cmb-2006-010-9","title":"A Dynamical Proof of Pisot's Theorem","year":2006,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Algebraic number; Dual (grammatical number); Discrete mathematics; Pure mathematics; Combinatorics; Algebra over a field; Mathematical analysis","score_opus":0.0046600204106121736,"score_gpt":0.18555926847074344,"score_spread":0.18089924806013127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012995549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106185324,0.0007026999,0.5931076,0.005860215,0.001525336,0.000101466845,0.00073082955,0.00086111,0.2909254],"genre_scores_gemma":[0.9092808,0.0004919717,0.057128806,0.0009549511,0.0005969276,0.00014532756,0.00032210583,0.00017989201,0.030899268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993387,0.00009793527,0.00002995269,0.00016730663,0.00025182086,0.00011428291],"domain_scores_gemma":[0.9991406,0.00028153858,0.000056169767,0.00012657762,0.000287284,0.00010779202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006775674,0.00041068465,0.00047259018,0.0010074284,0.0016603345,0.0014929894,0.0010256652,0.00059854554,0.013167538],"category_scores_gemma":[0.0021412044,0.00030849804,0.00071699213,0.0005720854,0.0040985937,0.0026720478,0.0031132987,0.0018636857,0.0010288791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000422727,0.000003516616,0.00004099171,0.000008541935,0.0000015268456,0.000045753983,0.000069809554,0.00027019694,0.00026127865,0.9975775,0.0006414332,0.0010751669],"study_design_scores_gemma":[0.000017026321,0.000018773446,0.00023728205,0.000015030779,0.000006235752,0.00014904702,0.00007253781,0.0052720476,0.0016310483,0.96544635,0.027122611,0.000011969042],"about_ca_topic_score_codex":0.0013516576,"about_ca_topic_score_gemma":0.0010407958,"teacher_disagreement_score":0.013167538,"about_ca_system_score_codex":0.0017283626,"about_ca_system_score_gemma":0.00070693454,"threshold_uncertainty_score":0.0440498},"labels":[],"label_agreement":null},{"id":"W2012996826","doi":"10.1016/j.dam.2009.02.010","title":"There are <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si47.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-uniform cubefree binary morphisms for all <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si48.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi><mml:mo>≥</mml:mo><mml:mn>0</mml:mn></mml:math>","year":2009,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Morphism; Mathematics; Binary number; Word (group theory); Discrete mathematics; Combinatorics; Algorithm; Arithmetic; Geometry","score_opus":0.018514275569914133,"score_gpt":0.24428564184295826,"score_spread":0.22577136627304412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012996826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07224478,0.0014234409,0.44644648,0.0031456845,0.0019914499,0.00026948054,0.011584942,0.017226404,0.44566736],"genre_scores_gemma":[0.45719093,0.0024647538,0.21771462,0.0014839863,0.00075074274,0.00065283565,0.02195448,0.009818429,0.28796917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916506,0.00011718241,0.00008288109,0.00021058021,0.00020278398,0.00022152225],"domain_scores_gemma":[0.9970757,0.000974506,0.0002176177,0.00046235116,0.00071116054,0.000558722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094111817,0.00076233095,0.0007604267,0.0011738306,0.0016416899,0.0023808007,0.0008364373,0.0009808134,0.092390336],"category_scores_gemma":[0.0029160203,0.0009113529,0.0010637089,0.0011793869,0.0015903632,0.0052528754,0.0028280388,0.0017718079,0.057376225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004365305,0.00017573056,0.002608334,0.00053899386,0.000030305038,0.00053117523,0.0012786872,0.0008133689,0.016749796,0.78188413,0.099659026,0.09529404],"study_design_scores_gemma":[0.00008766824,0.00007640896,0.005001149,0.00014912926,0.00003980934,0.0011060643,0.0007570015,0.0026973968,0.022964606,0.45931575,0.5075703,0.00023470301],"about_ca_topic_score_codex":0.0017689982,"about_ca_topic_score_gemma":0.002543065,"teacher_disagreement_score":0.092390336,"about_ca_system_score_codex":0.0011633193,"about_ca_system_score_gemma":0.0010992419,"threshold_uncertainty_score":0.30907643},"labels":[],"label_agreement":null},{"id":"W2013653818","doi":"10.1007/s00233-013-9542-3","title":"Semigroups embeddable in hyperplane face monoids","year":2013,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Hyperplane; Monoid; Semigroup; Decidability; Bicyclic semigroup; Free monoid; Cancellative semigroup; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.004423136839529797,"score_gpt":0.19632996394800034,"score_spread":0.19190682710847054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013653818","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6826631,0.00070068944,0.25738806,0.00051773124,0.0003688182,0.0001020048,0.00061557785,0.0013516836,0.056292336],"genre_scores_gemma":[0.93644965,0.0002860585,0.02395046,0.000101740916,0.00016606176,0.00008555711,0.000495007,0.00015680274,0.038308606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994497,0.00009219785,0.000041045107,0.0001329154,0.000128907,0.00015522174],"domain_scores_gemma":[0.99875474,0.0005029552,0.00014846414,0.00018639094,0.00014378075,0.0002636673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000615181,0.0004518272,0.0006117363,0.0013372661,0.0015656219,0.002541197,0.00071233197,0.00069054373,0.014038017],"category_scores_gemma":[0.001695779,0.0005545985,0.0005701877,0.0007684775,0.0012888801,0.0049604466,0.0021979662,0.001313264,0.002263482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028635905,0.00009938335,0.0005666409,0.00006371803,0.000010712795,0.00064986653,0.0015977143,0.0012661291,0.011086735,0.9675212,0.0016094777,0.015242074],"study_design_scores_gemma":[0.000094079915,0.00012229713,0.00086199347,0.000031788644,0.000028833827,0.00055681186,0.0010295839,0.008344523,0.008616216,0.9667372,0.013530728,0.0000457839],"about_ca_topic_score_codex":0.0004892857,"about_ca_topic_score_gemma":0.00059036206,"teacher_disagreement_score":0.014038017,"about_ca_system_score_codex":0.0006439274,"about_ca_system_score_gemma":0.0002638127,"threshold_uncertainty_score":0.046961904},"labels":[],"label_agreement":null},{"id":"W2013957001","doi":"10.1017/s0960129506005901","title":"Free compact 2-categories","year":2007,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Parsing; Symmetric monoidal category; Meaning (existential); Closed monoidal category; Enriched category; Monoidal category; Sentence; Mathematics; Computer science; Pure mathematics; Linguistics; Rule-based machine translation; Algebra over a field; Natural language processing; Functor; Epistemology; Philosophy","score_opus":0.013652521777377765,"score_gpt":0.2680591647508541,"score_spread":0.25440664297347637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013957001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25484562,0.0015983136,0.66006047,0.0011126469,0.0003946529,0.00019209301,0.0011576518,0.0011970805,0.07944151],"genre_scores_gemma":[0.86567277,0.00032510018,0.11040168,0.0004643897,0.0002496081,0.00018544754,0.00084284286,0.00023391558,0.021624213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986386,0.00031153046,0.0001403214,0.00032814554,0.0003879632,0.00019341633],"domain_scores_gemma":[0.99837923,0.0006794615,0.00012430182,0.00024057482,0.00043515343,0.00014139224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011301021,0.00045131618,0.00037719193,0.0014493611,0.0013174465,0.0023000457,0.0009869048,0.0009981532,0.008713147],"category_scores_gemma":[0.002579716,0.00032745377,0.00069842377,0.0006633413,0.0023655738,0.0056212624,0.00259498,0.00090498035,0.00088323146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019839772,0.000006322628,0.00017666513,0.000032825566,0.0000054317397,0.00010009519,0.00052103633,0.00042045547,0.0014533837,0.98994,0.00063545944,0.006688419],"study_design_scores_gemma":[0.000009397588,0.000024176756,0.00035531717,0.000019390438,0.000008495431,0.0001655222,0.00020541894,0.003482502,0.0021750473,0.975201,0.01833453,0.000019208008],"about_ca_topic_score_codex":0.0009992289,"about_ca_topic_score_gemma":0.0011086705,"teacher_disagreement_score":0.008713147,"about_ca_system_score_codex":0.0008649856,"about_ca_system_score_gemma":0.0004555451,"threshold_uncertainty_score":0.0291484},"labels":[],"label_agreement":null},{"id":"W2015013677","doi":"10.1515/integ.2009.007","title":"Some new van der Waerden numbers and some van der Waerden-type numbers","year":2009,"lang":"en","type":"article","venue":"Integers","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Van der Waerden's theorem; Mathematics; Combinatorics; Type (biology); Biology","score_opus":0.01030300779130207,"score_gpt":0.24600749331596056,"score_spread":0.23570448552465847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015013677","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25370738,0.0078006494,0.29780406,0.008046778,0.009239577,0.00015288708,0.0005845544,0.00032010907,0.42234403],"genre_scores_gemma":[0.84655243,0.0021138936,0.068273626,0.0010586941,0.0021098584,0.00021320391,0.00028096416,0.00018862664,0.07920875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850535,0.00045259608,0.0001383379,0.00033989424,0.00037008044,0.00019384791],"domain_scores_gemma":[0.9977323,0.0012228474,0.00027172687,0.0002534136,0.00027616447,0.00024342115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014196667,0.0005700516,0.0006649259,0.002058538,0.0024036372,0.004610581,0.0014742624,0.0013324147,0.0101373475],"category_scores_gemma":[0.006439167,0.0005364653,0.0007303175,0.0029680948,0.0037785263,0.01020625,0.001923982,0.0035462927,0.0011361863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022164259,0.0000056362783,0.00006606911,0.000023448552,0.0000027260642,0.000041149997,0.00012266495,0.00020332346,0.00030624864,0.99440056,0.0010210036,0.0037849227],"study_design_scores_gemma":[0.000008179014,0.000011501306,0.000099408724,0.000024745283,0.0000072355497,0.00012618717,0.000114454546,0.0011594652,0.00063884235,0.9783564,0.019437607,0.000015916517],"about_ca_topic_score_codex":0.00033008223,"about_ca_topic_score_gemma":0.00047811653,"teacher_disagreement_score":0.0101373475,"about_ca_system_score_codex":0.001436551,"about_ca_system_score_gemma":0.00042837727,"threshold_uncertainty_score":0.033912838},"labels":[],"label_agreement":null},{"id":"W2015046561","doi":"10.1007/s00026-006-0300-z","title":"A Symmetric Function Resolution of the Number of Permutations With Respect to Block-Stable Elements","year":2006,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Block (permutation group theory); Resolution (logic); Discrete mathematics","score_opus":0.019864034384045538,"score_gpt":0.2686542668971128,"score_spread":0.24879023251306726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015046561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19844262,0.0010149146,0.7221344,0.001422284,0.0005421249,0.000106074105,0.0004885259,0.000843498,0.07500549],"genre_scores_gemma":[0.8195525,0.000607147,0.14296679,0.0004640685,0.00078798144,0.00017018028,0.0005654145,0.0004949354,0.03439102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801695,0.0005745951,0.00013644577,0.0004816165,0.00044815324,0.00034221789],"domain_scores_gemma":[0.9958689,0.002152322,0.0003072879,0.00064106565,0.0004669161,0.00056351995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020332558,0.000930402,0.0014595921,0.0024696023,0.0018995663,0.004089258,0.0022210334,0.001445649,0.011655873],"category_scores_gemma":[0.00582044,0.0006847555,0.0016051487,0.0020141667,0.0030440572,0.009055778,0.0028443187,0.0037327395,0.0023275046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009819926,0.000031059928,0.00012993156,0.000037795628,0.00001399264,0.00006901858,0.00015268054,0.0012131664,0.00303336,0.98181677,0.001137292,0.012266798],"study_design_scores_gemma":[0.000023822055,0.000044247972,0.00018245443,0.00001556573,0.000028104301,0.00021184994,0.00008552772,0.010953788,0.0052925856,0.97862124,0.004509705,0.000031164716],"about_ca_topic_score_codex":0.00041712046,"about_ca_topic_score_gemma":0.0003804189,"teacher_disagreement_score":0.011655873,"about_ca_system_score_codex":0.0013237938,"about_ca_system_score_gemma":0.0009532143,"threshold_uncertainty_score":0.038992763},"labels":[],"label_agreement":null},{"id":"W2015132225","doi":"10.1080/0025570x.2002.11953932","title":"Unique Rook Circuits","year":2002,"lang":"en","type":"article","venue":"Mathematics Magazine","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Electronic circuit; Arithmetic; Electrical engineering","score_opus":0.023330487644711448,"score_gpt":0.21508899416680052,"score_spread":0.1917585065220891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015132225","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091505945,0.006935742,0.18154483,0.0037832595,0.0025329504,0.00022078032,0.0020311703,0.0023721412,0.70907325],"genre_scores_gemma":[0.8181243,0.002653845,0.034510594,0.0015550088,0.0006012909,0.00021002883,0.0014433673,0.0005094663,0.14039205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992149,0.00009047958,0.000037026344,0.00020837382,0.00020818431,0.0002409912],"domain_scores_gemma":[0.999236,0.00022825056,0.00005912349,0.00019441555,0.00019960916,0.00008260564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028843727,0.0005266442,0.0006656595,0.0012559742,0.0017638467,0.00214698,0.0010028381,0.0011074133,0.040542427],"category_scores_gemma":[0.002516184,0.00037221416,0.00054872787,0.0008441576,0.0010551236,0.0037577657,0.0024103033,0.0013711584,0.0072658896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011267107,0.000022472319,0.00030866795,0.00014916557,0.000014521028,0.00024031634,0.00020932636,0.0014555656,0.0031509975,0.90318257,0.030793438,0.060360253],"study_design_scores_gemma":[0.000038647573,0.00005739808,0.00029697345,0.000084100844,0.000033600787,0.0008148065,0.00018032426,0.007012368,0.004242744,0.8573768,0.12982304,0.000039082333],"about_ca_topic_score_codex":0.0005311473,"about_ca_topic_score_gemma":0.001156147,"teacher_disagreement_score":0.040542427,"about_ca_system_score_codex":0.001091649,"about_ca_system_score_gemma":0.0005871391,"threshold_uncertainty_score":0.13562793},"labels":[],"label_agreement":null},{"id":"W2015360324","doi":"10.2168/lmcs-3(1:4)2007","title":"Logic Meets Algebra: the Case of Regular Languages","year":2007,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Regular language; Automaton; Complement (music); Computer science; Algebraic number; Monoid; Formalism (music); Mathematics; Formal language; Discrete mathematics; Automata theory; Algebra over a field; Algebraic theory; Theoretical computer science; Algorithm; Pure mathematics","score_opus":0.04414340357003216,"score_gpt":0.3956531001013638,"score_spread":0.35150969653133163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015360324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26109898,0.0071645267,0.45616832,0.013632934,0.0004897428,0.00014433457,0.0005929868,0.00060798886,0.26010007],"genre_scores_gemma":[0.9264912,0.0016685883,0.055164978,0.0006327475,0.0006288121,0.0001624717,0.0001947451,0.0000984923,0.014958062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774444,0.00059060915,0.00016645453,0.0005446909,0.00068751373,0.0002664234],"domain_scores_gemma":[0.99686605,0.0018940684,0.00031242907,0.00041464917,0.00026806124,0.0002446584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017676491,0.0003365799,0.0006740331,0.0012729579,0.002026925,0.0051599904,0.0011000412,0.0017056852,0.00604596],"category_scores_gemma":[0.00576418,0.0004544218,0.0011798858,0.0013448732,0.006757367,0.013326709,0.002317221,0.002199505,0.00091759406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072964476,0.000002970677,0.000057387613,0.000015748143,0.0000018895346,0.000059129838,0.00014087837,0.0002679847,0.00021044836,0.9978739,0.00017233721,0.0011899674],"study_design_scores_gemma":[0.0000056622102,0.000006494505,0.000032988424,0.000006034949,0.0000031181903,0.00012284679,0.00007584809,0.0026935579,0.0002281206,0.993687,0.0031339421,0.000004381864],"about_ca_topic_score_codex":0.0010014261,"about_ca_topic_score_gemma":0.0005859109,"teacher_disagreement_score":0.00604596,"about_ca_system_score_codex":0.001250419,"about_ca_system_score_gemma":0.0007536451,"threshold_uncertainty_score":0.020225763},"labels":[],"label_agreement":null},{"id":"W2015787121","doi":"10.1016/j.tcs.2009.03.026","title":"Estimation of state complexity of combined operations","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; State (computer science); Alphabet; Upper and lower bounds; Mathematics; Regular language; Computational complexity theory; Combined operations; Algorithm; Theoretical computer science; Computer science; Discrete mathematics; Automaton; Linguistics","score_opus":0.01599258895503316,"score_gpt":0.26526173501559713,"score_spread":0.24926914606056397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015787121","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7749575,0.00016300764,0.22206698,0.0001411035,0.00001818132,0.000042900512,0.00034098414,0.00045164058,0.0018177142],"genre_scores_gemma":[0.9778698,0.00004699975,0.021236347,0.0000089141095,0.000020968417,0.000038045306,0.00031355157,0.00003929655,0.0004260232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842995,0.0004280665,0.0000900107,0.0003983986,0.00047324746,0.00018036002],"domain_scores_gemma":[0.9405779,0.051234823,0.0017867805,0.0038657417,0.0017461616,0.0007885364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001454022,0.00061916764,0.0010920335,0.0016643672,0.0004983658,0.0020719247,0.0013329352,0.0011877827,0.0026315677],"category_scores_gemma":[0.023120616,0.0005691056,0.0009766918,0.00092491857,0.0012108848,0.004676124,0.0017188912,0.0014978567,0.00030134118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034057884,0.000656174,0.038922455,0.0003481386,0.00033810298,0.0003313119,0.000480495,0.7310611,0.034965273,0.06592783,0.001190496,0.122372836],"study_design_scores_gemma":[0.000013420099,0.000081493294,0.0029118597,0.000005292833,0.000020540556,0.000038857834,0.000029595245,0.9721824,0.0045570065,0.020056758,0.00008654193,0.000016297696],"about_ca_topic_score_codex":0.0014161067,"about_ca_topic_score_gemma":0.0014054959,"teacher_disagreement_score":0.0026315677,"about_ca_system_score_codex":0.00114456,"about_ca_system_score_gemma":0.0008057411,"threshold_uncertainty_score":0.008803487},"labels":[],"label_agreement":null},{"id":"W2015957628","doi":"10.1016/j.jda.2006.04.002","title":"Two-pattern strings II—frequency of occurrence and substring complexity","year":2007,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Combinatorics; Mathematics; Generalization; Fibonacci number; Prefix; Aperiodic graph; Discrete mathematics; Computer science; Data structure","score_opus":0.02468135140777174,"score_gpt":0.28292771750166096,"score_spread":0.25824636609388923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015957628","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8746937,0.0008980623,0.11283225,0.0009661051,0.00008779344,0.00008002982,0.0014174347,0.0003466577,0.008678039],"genre_scores_gemma":[0.98017234,0.00025339035,0.016626123,0.000055537283,0.00016122023,0.000058545276,0.00083089835,0.00007774347,0.0017642872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968886,0.00054117735,0.00033100788,0.00082967384,0.0010718112,0.0003378469],"domain_scores_gemma":[0.94025826,0.046398558,0.0042442475,0.0050131506,0.0023948497,0.0016909424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021052745,0.000295466,0.0011514418,0.0038517173,0.0012888311,0.0037818558,0.0016658384,0.0013993484,0.006328235],"category_scores_gemma":[0.027955074,0.00047948663,0.0009079441,0.0045607267,0.0020806328,0.0072131986,0.001643009,0.0016049485,0.00060276967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020643768,0.0009034477,0.22613586,0.0006748398,0.00037528874,0.0016558752,0.0018461017,0.055847503,0.026893465,0.43168133,0.006849442,0.2450725],"study_design_scores_gemma":[0.00009310809,0.00028241976,0.04924906,0.0000632685,0.00016430237,0.0042152177,0.0009411819,0.291759,0.011629557,0.63676554,0.0046843346,0.00015298315],"about_ca_topic_score_codex":0.00056144584,"about_ca_topic_score_gemma":0.00041257977,"teacher_disagreement_score":0.006328235,"about_ca_system_score_codex":0.0010907655,"about_ca_system_score_gemma":0.0007909182,"threshold_uncertainty_score":0.02117002},"labels":[],"label_agreement":null},{"id":"W2016420891","doi":"10.1016/j.disc.2013.01.005","title":"The abelian complexity of the paperfolding word","year":2013,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Word (group theory); Abelian group; Linguistics; Computer science; Mathematics; Pure mathematics; Philosophy","score_opus":0.03825754995801239,"score_gpt":0.26032372811973836,"score_spread":0.22206617816172597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016420891","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69790155,0.0024951266,0.09568413,0.009668052,0.0008875851,0.00006329564,0.0008457632,0.00031761796,0.19213681],"genre_scores_gemma":[0.97801745,0.0005646627,0.005635945,0.00038715545,0.0009221466,0.000053342603,0.00029170784,0.00008124201,0.014046509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984876,0.00040942937,0.00011099145,0.00032534555,0.00043035898,0.00023630128],"domain_scores_gemma":[0.99542964,0.0028461725,0.0005069638,0.00047925368,0.00034105737,0.0003969373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083088863,0.00053748075,0.00089873536,0.002256666,0.0018776229,0.0058440925,0.0010286694,0.001552558,0.012364344],"category_scores_gemma":[0.006097111,0.00044548823,0.00082680857,0.0019508194,0.00478765,0.013196332,0.0029102613,0.0023825897,0.0011887391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039365616,0.000012751668,0.00034534492,0.000026827896,0.000005048654,0.000073050105,0.00024387077,0.0006097043,0.00043226877,0.9941004,0.00092242274,0.00318898],"study_design_scores_gemma":[0.00000594306,0.000005790835,0.00016848596,0.0000055180653,0.0000032067771,0.000059980604,0.000057073863,0.0014290555,0.00025488826,0.9967758,0.001225796,0.0000084274725],"about_ca_topic_score_codex":0.0007816561,"about_ca_topic_score_gemma":0.00040607265,"teacher_disagreement_score":0.012364344,"about_ca_system_score_codex":0.0013943432,"about_ca_system_score_gemma":0.00066727155,"threshold_uncertainty_score":0.04136288},"labels":[],"label_agreement":null},{"id":"W2017099638","doi":"10.1145/1273920.1273939","title":"A larger decidable semiunification problem","year":2007,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decidability; Undecidable problem; Computer science; Discrete mathematics; Graph; Inference; Theoretical computer science; Combinatorics; Type inference; Constraint (computer-aided design); Mathematics; Artificial intelligence","score_opus":0.007097889225995919,"score_gpt":0.22805840718819353,"score_spread":0.22096051796219762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017099638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15529548,0.0009011471,0.7993897,0.008309265,0.00024568723,0.00026289382,0.0008234857,0.00068657397,0.034085877],"genre_scores_gemma":[0.7112004,0.0006548511,0.2718008,0.0010857973,0.0004568392,0.0002675996,0.0017968982,0.00022822327,0.012508695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964551,0.0009685699,0.00025627087,0.0013515344,0.00063313247,0.0003354953],"domain_scores_gemma":[0.9872922,0.009820497,0.00067629694,0.0012207566,0.00047075356,0.00051953376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033964994,0.00053935725,0.00087232306,0.0008095915,0.0017027443,0.0031276825,0.0023545676,0.0020433627,0.007328309],"category_scores_gemma":[0.008953554,0.0004788337,0.0017890467,0.0012358121,0.004115046,0.009748433,0.002880959,0.005224575,0.00042223308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006112974,0.00012562818,0.00047758588,0.0001570047,0.000032722975,0.0002918771,0.0004677662,0.016137565,0.0018385465,0.95832294,0.0020887516,0.019998448],"study_design_scores_gemma":[0.000027258015,0.000023263288,0.0001856935,0.000027684786,0.00002344693,0.00023714866,0.0002235608,0.039698627,0.0019380834,0.94893914,0.0086594,0.000016682048],"about_ca_topic_score_codex":0.0021492867,"about_ca_topic_score_gemma":0.001602571,"teacher_disagreement_score":0.007328309,"about_ca_system_score_codex":0.0020370511,"about_ca_system_score_gemma":0.0015292495,"threshold_uncertainty_score":0.024515629},"labels":[],"label_agreement":null},{"id":"W2017325803","doi":"10.1016/j.jcta.2012.01.006","title":"Fixed points avoiding Abelian k-powers","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Morphism; Abelian group; Mathematics; Invertible matrix; Fixed point; Decidability; Pure mathematics; Matrix (chemical analysis); Discrete mathematics; Combinatorics; Mathematical analysis","score_opus":0.009556108663495173,"score_gpt":0.23177425499645135,"score_spread":0.22221814633295617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017325803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8560104,0.00053233263,0.057514265,0.0007539585,0.0004020272,0.000073237636,0.000108616885,0.00034480455,0.08426036],"genre_scores_gemma":[0.97376055,0.00020857484,0.0063709696,0.00008793945,0.00012090408,0.000055153992,0.00006652816,0.000115676616,0.019213693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928147,0.00015926082,0.000046247183,0.00013079279,0.00018509268,0.00019712636],"domain_scores_gemma":[0.99720806,0.0014587868,0.00029773088,0.0003467659,0.0003284357,0.0003601745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065658684,0.0006820802,0.001162931,0.0019655873,0.002893125,0.0039833896,0.0013793914,0.0016060767,0.008164219],"category_scores_gemma":[0.003713962,0.0008140001,0.0012112481,0.0011982295,0.0035808245,0.004722599,0.0032224504,0.0027909027,0.0015615165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001793646,0.000047129466,0.0003772021,0.000048732294,0.000018899427,0.00046282323,0.0007040029,0.0011287419,0.0038129352,0.9886439,0.0007234669,0.0038528587],"study_design_scores_gemma":[0.000065766435,0.00004553076,0.00019973556,0.000022686369,0.000021885096,0.00036480837,0.0003400018,0.00437344,0.0021627832,0.9900802,0.0023013104,0.000021853273],"about_ca_topic_score_codex":0.00046049614,"about_ca_topic_score_gemma":0.00052047905,"teacher_disagreement_score":0.008164219,"about_ca_system_score_codex":0.0010739875,"about_ca_system_score_gemma":0.0003675228,"threshold_uncertainty_score":0.02731204},"labels":[],"label_agreement":null},{"id":"W2018097087","doi":"10.48550/arxiv.0809.3410","title":"Christoffel words and Markoff triples","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Christoffel symbols; Mathematics; Pure mathematics","score_opus":0.03325846319665903,"score_gpt":0.2432918216625095,"score_spread":0.21003335846585047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018097087","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43206173,0.0047486937,0.2470606,0.003241634,0.0011949143,0.0001351216,0.0012391696,0.0011385452,0.30917957],"genre_scores_gemma":[0.9544521,0.00096384226,0.02055487,0.0004735058,0.0005200261,0.00009803687,0.0004828122,0.00016973747,0.022285141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859387,0.0003336766,0.000083592684,0.00033303315,0.00034354578,0.00031232624],"domain_scores_gemma":[0.99843186,0.00061339804,0.00022653864,0.00026515758,0.00025589872,0.00020711338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080678635,0.0005421211,0.000595169,0.0019847758,0.002444112,0.0029956345,0.0006145712,0.0014811173,0.010047558],"category_scores_gemma":[0.0037585262,0.00045198898,0.0005783772,0.0015002927,0.003785873,0.006319342,0.0022914764,0.0016815996,0.0019618594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020857018,0.0000048585007,0.00008654307,0.000012091625,0.0000026150199,0.00007139398,0.00019474326,0.00018632824,0.00048261933,0.9950728,0.0009437061,0.0029214737],"study_design_scores_gemma":[0.0000049849573,0.000006670102,0.00010513391,0.0000093370945,0.0000029816604,0.00010623624,0.00011003901,0.0006906391,0.00054983,0.99199647,0.0064064893,0.00001115335],"about_ca_topic_score_codex":0.0007321973,"about_ca_topic_score_gemma":0.0006377617,"teacher_disagreement_score":0.010047558,"about_ca_system_score_codex":0.0010668708,"about_ca_system_score_gemma":0.0006630935,"threshold_uncertainty_score":0.03361243},"labels":[],"label_agreement":null},{"id":"W2018331071","doi":"10.1142/s0218196704001979","title":"MONOIDS AND COMPUTATIONS","year":2004,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Computation; Boolean circuit; Algebraic number; Point (geometry); Algebra over a field; Theoretical computer science; Discrete mathematics; Boolean function; Pure mathematics; Computer science; Algorithm","score_opus":0.008367005775459506,"score_gpt":0.25854745524928113,"score_spread":0.2501804494738216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018331071","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059267912,0.14369345,0.29775965,0.036495484,0.0031941128,0.00011636264,0.00065749756,0.0005502286,0.4582653],"genre_scores_gemma":[0.8123293,0.04382835,0.081802465,0.005618078,0.00413528,0.0002274224,0.0006161058,0.00021139714,0.051231485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985594,0.0005775148,0.00011116024,0.0003258167,0.00031353126,0.0001125534],"domain_scores_gemma":[0.9973917,0.0018062589,0.00012462055,0.0002559168,0.00029126363,0.00013016503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017988698,0.0005657373,0.0005954471,0.002082089,0.0020492023,0.0046826047,0.0007651763,0.0015067412,0.008235522],"category_scores_gemma":[0.00317344,0.00035087066,0.0007224855,0.0017710952,0.007890129,0.009707917,0.0030133128,0.0030261169,0.0013359218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041672365,0.000002721969,0.000047988455,0.000038847007,0.000002154717,0.000017422619,0.00021260972,0.00012374231,0.000091027796,0.99542576,0.0008193229,0.00321428],"study_design_scores_gemma":[0.0000025769727,0.0000067438014,0.00008463977,0.000031591364,0.0000026235095,0.000063573636,0.00008448243,0.00032392037,0.000091538444,0.9766286,0.02267556,0.000004129045],"about_ca_topic_score_codex":0.0015836157,"about_ca_topic_score_gemma":0.0012351224,"teacher_disagreement_score":0.008235522,"about_ca_system_score_codex":0.0021967764,"about_ca_system_score_gemma":0.0009330044,"threshold_uncertainty_score":0.027550519},"labels":[],"label_agreement":null},{"id":"W2018650645","doi":"10.1016/j.ic.2011.01.001","title":"An extension of the Lyndon–Schützenberger result to pseudoperiodic words","year":2011,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Extension (predicate logic); Computer science; Combinatorics; Linguistics; Mathematics; Mathematical economics; Philosophy; Programming language","score_opus":0.017044988781471898,"score_gpt":0.23565237675886666,"score_spread":0.21860738797739476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018650645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121249296,0.0021970407,0.6828035,0.0035606301,0.0013353617,0.000089095636,0.00035443937,0.0005326365,0.18787804],"genre_scores_gemma":[0.85014915,0.0022802593,0.0875165,0.0017264084,0.0023395559,0.00018099138,0.00035875276,0.00031108846,0.055137306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993648,0.00013711391,0.00004484797,0.00019199579,0.00017749477,0.00008384428],"domain_scores_gemma":[0.9980513,0.0010054527,0.00013140497,0.00039178022,0.00028887775,0.00013123089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094185286,0.0004891859,0.0009134936,0.0014268183,0.0012919676,0.0018623839,0.0011608773,0.0011583577,0.011674624],"category_scores_gemma":[0.004055216,0.00039370204,0.001384674,0.0011581652,0.0024352819,0.0055117724,0.0025129546,0.0017350321,0.0015743761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027817661,0.000014148107,0.00008208981,0.000052650834,0.0000058520013,0.000119566816,0.00015545808,0.0010073837,0.001142944,0.9879032,0.0011526544,0.008336314],"study_design_scores_gemma":[0.000009018369,0.000017134109,0.00009430405,0.00001100647,0.00000573523,0.000093913186,0.000021150214,0.006319903,0.0004760317,0.98877233,0.0041677784,0.000011735874],"about_ca_topic_score_codex":0.0004919073,"about_ca_topic_score_gemma":0.00042785818,"teacher_disagreement_score":0.011674624,"about_ca_system_score_codex":0.0006954753,"about_ca_system_score_gemma":0.0006152713,"threshold_uncertainty_score":0.039055467},"labels":[],"label_agreement":null},{"id":"W2018688081","doi":"10.1081/agb-100107954","title":"NOETHERIAN UNIQUE FACTORIZATION SEMIGROUP ALGEBRAS","year":2001,"lang":"en","type":"article","venue":"Communications in Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Vrije Universiteit Brussel; Fonds Wetenschappelijk Onderzoek","keywords":"Mathematics; Noetherian; Semigroup; Pure mathematics; Algebra over a field; Factorization; Discrete mathematics; Algorithm","score_opus":0.03086573631311417,"score_gpt":0.28720599582075396,"score_spread":0.2563402595076398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018688081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7884692,0.003244204,0.17585267,0.0013351213,0.00023610066,0.00007761413,0.00014323139,0.00025637678,0.030385504],"genre_scores_gemma":[0.98443395,0.0005486721,0.01162054,0.00007925567,0.00012447982,0.000020908694,0.00009769572,0.000010208973,0.0030642028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907696,0.00020686667,0.000068808906,0.00027752927,0.0001640804,0.00020570734],"domain_scores_gemma":[0.99754286,0.0008935628,0.00052922004,0.00024616017,0.00035283828,0.00043542482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015591282,0.00045934442,0.00055813085,0.000600375,0.0014913197,0.0020652844,0.0006025373,0.00073582487,0.0024193157],"category_scores_gemma":[0.003500322,0.00030809123,0.00052876933,0.0005112703,0.0027628609,0.008492865,0.0014799887,0.0009546753,0.000533209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001390117,0.00005627454,0.0015910367,0.000089146175,0.000015103104,0.00039356702,0.0010289281,0.0021253442,0.0037398674,0.98038757,0.00081280497,0.009621198],"study_design_scores_gemma":[0.00003442799,0.00012646492,0.0007820582,0.000026454996,0.000020287813,0.00069735304,0.00068656553,0.012856351,0.005718603,0.97381985,0.005203678,0.00002790982],"about_ca_topic_score_codex":0.00047882777,"about_ca_topic_score_gemma":0.00041744488,"teacher_disagreement_score":0.0024193157,"about_ca_system_score_codex":0.00077777647,"about_ca_system_score_gemma":0.00050833577,"threshold_uncertainty_score":0.008245528},"labels":[],"label_agreement":null},{"id":"W2019028783","doi":"10.1016/j.jpaa.2012.04.014","title":"Effective dimension of finite semigroups","year":2012,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Injective function; Semigroup; Dimension (graph theory); Representation (politics); Pure mathematics; Field (mathematics); Algebra over a field; Krohn–Rhodes theory; Special classes of semigroups","score_opus":0.006271542740502673,"score_gpt":0.21539950457338816,"score_spread":0.20912796183288548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019028783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77654874,0.0028568774,0.121325605,0.0038491231,0.0004917395,0.0000421171,0.0006026407,0.0002888854,0.09399432],"genre_scores_gemma":[0.98809683,0.0004171285,0.00582954,0.0001178157,0.0003723416,0.000037316542,0.000178474,0.000039654817,0.004910915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984432,0.0003569089,0.00010045422,0.00026042678,0.0005407429,0.00029825803],"domain_scores_gemma":[0.99440867,0.002987237,0.0004304557,0.00043869563,0.0006166585,0.0011182487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017690834,0.0005864568,0.0011077415,0.003573199,0.0021974738,0.0060334452,0.0011518428,0.00076351746,0.0061323815],"category_scores_gemma":[0.0042966125,0.00060939905,0.00076302397,0.0014364437,0.004389443,0.008641726,0.0024457788,0.0022790963,0.00038633804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018794344,0.000012799785,0.0001707154,0.000014002553,0.0000054828874,0.000022231505,0.00019431455,0.0002683928,0.00038392562,0.9977858,0.00019628358,0.00092721113],"study_design_scores_gemma":[0.0000138710775,0.000009458711,0.00024002494,0.0000085028805,0.000008425534,0.000055253506,0.000075172786,0.0027580252,0.0003926997,0.99510694,0.0013207108,0.000010863047],"about_ca_topic_score_codex":0.0005403628,"about_ca_topic_score_gemma":0.0006419518,"teacher_disagreement_score":0.0061323815,"about_ca_system_score_codex":0.001841985,"about_ca_system_score_gemma":0.0008029347,"threshold_uncertainty_score":0.020514905},"labels":[],"label_agreement":null},{"id":"W2019168264","doi":"10.1016/j.dam.2011.10.029","title":"Sturmian graphs and integer representations over numeration systems","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Continued fraction; Graph; Integer (computer science); Discrete mathematics; Fraction (chemistry); Natural number; Combinatorics; Representation (politics); Path (computing); Arithmetic","score_opus":0.021773893499408177,"score_gpt":0.24163171360855865,"score_spread":0.21985782010915048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019168264","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43477726,0.0025939136,0.38593045,0.0043360745,0.001069046,0.0000878377,0.0005924665,0.0008611886,0.1697518],"genre_scores_gemma":[0.9465706,0.00069818995,0.030910054,0.0005270878,0.0004399959,0.00008310165,0.00029308413,0.00015530779,0.020322734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922514,0.0002589986,0.000055591274,0.00016530052,0.00016399662,0.00013086152],"domain_scores_gemma":[0.9983089,0.0009541548,0.00023382982,0.00020751926,0.00016629999,0.00012929774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008170238,0.0006538265,0.0008203392,0.0021415346,0.001961429,0.004396064,0.0009625674,0.0016176254,0.009911606],"category_scores_gemma":[0.0031545444,0.000511754,0.000967809,0.0023463771,0.0036807621,0.0061167805,0.0017008843,0.0023793287,0.0009242575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009616638,0.000005051987,0.00003818526,0.000011040006,0.0000016582443,0.000025594914,0.00015999416,0.00037256582,0.00017335992,0.99705887,0.00025964068,0.0018844397],"study_design_scores_gemma":[0.000005316524,0.0000043802656,0.000037956754,0.0000057294646,0.0000032207868,0.00003078631,0.000049731214,0.0015095188,0.00012932824,0.9969156,0.0013023412,0.0000060448647],"about_ca_topic_score_codex":0.00081992196,"about_ca_topic_score_gemma":0.00089572824,"teacher_disagreement_score":0.009911606,"about_ca_system_score_codex":0.0012840916,"about_ca_system_score_gemma":0.0004570466,"threshold_uncertainty_score":0.033157587},"labels":[],"label_agreement":null},{"id":"W2019689997","doi":"10.4153/cjm-2009-013-9","title":"On ℤ-Modules of Algebraic Integers","year":2009,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Rank (graph theory); Integer (computer science); Algebraic number; Multiplicative function; Degree (music); Discrete mathematics","score_opus":0.010081722580178807,"score_gpt":0.21129462245947989,"score_spread":0.20121289987930108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019689997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8968507,0.0011375,0.04119583,0.00042569003,0.00016349887,0.00007990398,0.000253729,0.00017856783,0.05971451],"genre_scores_gemma":[0.9844577,0.00029376795,0.005805669,0.000076816876,0.00015938687,0.000041871295,0.0001802655,0.000018571947,0.008966045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991184,0.00017162881,0.000073642965,0.0001511456,0.0002596713,0.00022558548],"domain_scores_gemma":[0.99823534,0.00062350207,0.00041620433,0.00013634918,0.00023580312,0.0003526168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093275413,0.0005059087,0.00050444726,0.0016553553,0.0012072956,0.001932134,0.00035787805,0.0003341231,0.0050856457],"category_scores_gemma":[0.001996574,0.00037627167,0.00059971074,0.0009315219,0.0019643698,0.0027005197,0.001777712,0.00053919817,0.0006776988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014083833,0.00004477999,0.0014664835,0.00008004158,0.000014132209,0.00037293928,0.0010038717,0.0015714042,0.0038013607,0.97959375,0.0008202682,0.011090161],"study_design_scores_gemma":[0.00010068441,0.00024296099,0.0022262987,0.00006129655,0.000032620457,0.0007777863,0.00042458947,0.011962125,0.0046353587,0.9628932,0.016590195,0.000052816657],"about_ca_topic_score_codex":0.00036571952,"about_ca_topic_score_gemma":0.00033375286,"teacher_disagreement_score":0.0050856457,"about_ca_system_score_codex":0.0010458744,"about_ca_system_score_gemma":0.00039796563,"threshold_uncertainty_score":0.017013192},"labels":[],"label_agreement":null},{"id":"W2020031747","doi":"10.1016/j.tcs.2014.01.033","title":"A note on abelian returns in rotation words","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Abelian group; Prefix; Mathematics; Rotation (mathematics); Connection (principal bundle); Set (abstract data type); Pure mathematics; Discrete mathematics; Computer science; Linguistics; Geometry","score_opus":0.006793204838155968,"score_gpt":0.24547315904204117,"score_spread":0.23867995420388521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020031747","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080506824,0.01970648,0.40732196,0.047735438,0.022879776,0.00011066246,0.00060307886,0.00134384,0.41979197],"genre_scores_gemma":[0.6645245,0.013042214,0.09159063,0.008583292,0.018374005,0.00024875844,0.00052475516,0.0013156057,0.20179616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983821,0.0005612587,0.00011762422,0.00033438945,0.00032384924,0.00028086052],"domain_scores_gemma":[0.9951756,0.00339838,0.00016239758,0.0006906819,0.00034878898,0.00022410034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015693218,0.0009023435,0.0012717672,0.0014232709,0.0028826594,0.0040699,0.0017415888,0.0023009726,0.016715132],"category_scores_gemma":[0.0065931412,0.0005698547,0.001400105,0.0028371706,0.006994152,0.016081221,0.004545464,0.005412,0.0041126157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025862273,0.0000064771957,0.00005271935,0.000030048983,0.0000027568724,0.00006774808,0.00017441735,0.0002505815,0.00036406965,0.9891237,0.004324246,0.0055772155],"study_design_scores_gemma":[0.0000066069806,0.000014054033,0.00008574667,0.000014658968,0.000008005013,0.00009835293,0.00008164265,0.000720497,0.0005549503,0.9663856,0.03201353,0.000016282205],"about_ca_topic_score_codex":0.0016322705,"about_ca_topic_score_gemma":0.0014019455,"teacher_disagreement_score":0.016715132,"about_ca_system_score_codex":0.0014878368,"about_ca_system_score_gemma":0.00086181005,"threshold_uncertainty_score":0.05591774},"labels":[],"label_agreement":null},{"id":"W2020219845","doi":"10.1016/j.jnt.2013.04.004","title":"Approximation simultanée dʼun nombre v -adique et de son carré par des nombres algébriques","year":2013,"lang":"fr","type":"article","venue":"Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Humanities","score_opus":0.01702820851539581,"score_gpt":0.27741434571963036,"score_spread":0.26038613720423454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020219845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24848263,0.0011697363,0.72407514,0.0011184397,0.0008901991,0.00005476353,0.00017372787,0.00089155673,0.023143802],"genre_scores_gemma":[0.7372112,0.0013472317,0.21152483,0.00035469042,0.0005445398,0.0002104315,0.00040660807,0.00058965833,0.047810726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965456,0.0009938542,0.00014270743,0.00078571105,0.0011001042,0.00043214206],"domain_scores_gemma":[0.9913918,0.005538544,0.00045101906,0.0008732591,0.0010868533,0.0006586678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026484432,0.0021307778,0.0019425655,0.0032224138,0.003573596,0.007855492,0.0017729957,0.003227848,0.008121727],"category_scores_gemma":[0.012445391,0.0011125883,0.003581856,0.0016835828,0.003963601,0.005349007,0.0023838559,0.0057991,0.0016191307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024290886,0.00028880357,0.006214708,0.0004295751,0.00036711458,0.0011499996,0.0017859252,0.07860006,0.047517065,0.7578256,0.0035169886,0.09987514],"study_design_scores_gemma":[0.00028054178,0.00045472677,0.0052749678,0.00017579562,0.00014118734,0.0017082391,0.0010802124,0.6429961,0.035543755,0.29128876,0.02085356,0.00020220602],"about_ca_topic_score_codex":0.012672757,"about_ca_topic_score_gemma":0.008506005,"teacher_disagreement_score":0.012672757,"about_ca_system_score_codex":0.0044171386,"about_ca_system_score_gemma":0.0018339115,"threshold_uncertainty_score":0.032048702},"labels":[],"label_agreement":null},{"id":"W2020437202","doi":"10.1145/876638.876642","title":"Definable relations and first-order query languages over strings","year":2003,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"semigroups and automata theory","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; String (physics); First-order logic; Mathematics; Query language; Predicate (mathematical logic); Regular language; Theoretical computer science; Discrete mathematics; Programming language; Database; Automaton","score_opus":0.007487091163718904,"score_gpt":0.22484196362902464,"score_spread":0.21735487246530574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020437202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12652853,0.0013982407,0.83992684,0.0034193953,0.00012922705,0.00018489819,0.0005415824,0.0011703436,0.026701007],"genre_scores_gemma":[0.76479554,0.0013916746,0.22167177,0.0010766707,0.00040996028,0.00034266044,0.00077280495,0.00025969648,0.009279211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99472696,0.0014280765,0.0004018471,0.0011054891,0.0017315078,0.0006060692],"domain_scores_gemma":[0.98482406,0.011009343,0.0012640741,0.0015129043,0.0009208349,0.0004687291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036869508,0.00070110254,0.0008069732,0.0015739774,0.001483144,0.0060557653,0.0023575379,0.0018476634,0.006157507],"category_scores_gemma":[0.014452416,0.00066128327,0.0021167053,0.002482676,0.005977697,0.017450454,0.0023889053,0.0037798116,0.00072712713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018223158,0.000026995594,0.00015049498,0.00003871531,0.000005399083,0.000054848984,0.0002709059,0.0028151928,0.0007319785,0.99257153,0.00024225908,0.0030734001],"study_design_scores_gemma":[0.000012916267,0.000024385494,0.0000877371,0.000011892045,0.000008849748,0.000093543094,0.00008419974,0.020950686,0.0011264259,0.97447157,0.0031146393,0.000013132011],"about_ca_topic_score_codex":0.0031117024,"about_ca_topic_score_gemma":0.0016024848,"teacher_disagreement_score":0.006157507,"about_ca_system_score_codex":0.0036784057,"about_ca_system_score_gemma":0.0016240684,"threshold_uncertainty_score":0.026688874},"labels":[],"label_agreement":null},{"id":"W2020610947","doi":"10.1007/s00010-004-2750-x","title":"On integer sequences whose first iterates are linear","year":2005,"lang":"en","type":"article","venue":"Aequationes Mathematicae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Iterated function; Sequence (biology); Lexicographical order; Integer (computer science); Integer sequence; Combinatorics; Discrete mathematics; Thue equation; Diophantine equation; Mathematical analysis; Diophantine set; Generating function; Computer science","score_opus":0.019160827690642,"score_gpt":0.25219457347890717,"score_spread":0.23303374578826516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020610947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31718746,0.003149427,0.54491097,0.0022517846,0.00073864235,0.00007814045,0.00042970205,0.0009639553,0.13028999],"genre_scores_gemma":[0.84970725,0.0030646278,0.07355194,0.00086899864,0.00112747,0.00025865925,0.0006461232,0.0005521609,0.07022277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998594,0.00039939428,0.00010281175,0.00028427652,0.000331381,0.00028802938],"domain_scores_gemma":[0.9924636,0.0056518293,0.0006084065,0.00048515247,0.00042402506,0.0003669864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016588649,0.0013576781,0.00094696827,0.0026265425,0.0020552776,0.0038871157,0.0011522586,0.0018208363,0.009530621],"category_scores_gemma":[0.008317714,0.0008194591,0.0013459175,0.002889357,0.00441512,0.008421821,0.0027653766,0.0030137654,0.0023860887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080975326,0.000023333574,0.00024863525,0.00007843938,0.000009990544,0.00015334737,0.00064775656,0.0017315145,0.0017687313,0.98521,0.0007100634,0.009337125],"study_design_scores_gemma":[0.00001687176,0.00003446447,0.00020069185,0.000037991373,0.000014343531,0.00017594162,0.00011684369,0.0065191966,0.0013462973,0.98871803,0.002792088,0.000027320482],"about_ca_topic_score_codex":0.000888327,"about_ca_topic_score_gemma":0.0007987132,"teacher_disagreement_score":0.009530621,"about_ca_system_score_codex":0.0016586857,"about_ca_system_score_gemma":0.00064906164,"threshold_uncertainty_score":0.03188312},"labels":[],"label_agreement":null},{"id":"W2021056221","doi":"10.1142/s0129054108005863","title":"AVOIDING APPROXIMATE SQUARES","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Alphabet; Mathematics; Combinatorics; Least-squares function approximation; Word (group theory); Variation (astronomy); Discrete mathematics; Algorithm; Statistics; Physics; Philosophy","score_opus":0.023775864139508048,"score_gpt":0.2867096296032943,"score_spread":0.2629337654637863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021056221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22605102,0.00067597546,0.7487197,0.0012479064,0.00037932568,0.00014903619,0.00022330647,0.0017611951,0.02079256],"genre_scores_gemma":[0.60953814,0.00046043465,0.3580723,0.0009200051,0.0001754876,0.0002265471,0.00058579387,0.0010375322,0.028983818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973623,0.0007562496,0.00026996687,0.00068571337,0.00062874926,0.00029701882],"domain_scores_gemma":[0.99050564,0.0039142985,0.0008159464,0.003374864,0.0010646753,0.00032459587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011735964,0.0007965538,0.0013435149,0.0006006274,0.0018699585,0.0013613604,0.0014471587,0.0017479147,0.005469957],"category_scores_gemma":[0.013109274,0.0007273663,0.0009406212,0.0009667506,0.0023067498,0.005081341,0.0045086197,0.0017617097,0.0023737373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012705754,0.00021023989,0.004834683,0.0010853524,0.00019390097,0.0015068324,0.0034202358,0.057285845,0.05271591,0.55236834,0.016922727,0.30818528],"study_design_scores_gemma":[0.00007760444,0.00039245762,0.0006378337,0.00009970748,0.00009366741,0.0016400306,0.0010968132,0.11119461,0.04849198,0.7901125,0.046049338,0.00011343111],"about_ca_topic_score_codex":0.0005773919,"about_ca_topic_score_gemma":0.0007359091,"teacher_disagreement_score":0.005469957,"about_ca_system_score_codex":0.00050046894,"about_ca_system_score_gemma":0.0009587329,"threshold_uncertainty_score":0.018298805},"labels":[],"label_agreement":null},{"id":"W2021596745","doi":"10.1016/j.tcs.2012.04.001","title":"Algorithmic decomposition of shuffle on words","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Western University","funders":"","keywords":"Sublinear function; Property (philosophy); Decomposition; Mathematics; Time complexity; Combinatorics; Computational complexity theory; Discrete mathematics; Polynomial; Efficient algorithm; Word (group theory); Algorithm","score_opus":0.008221397840494565,"score_gpt":0.2671597439217456,"score_spread":0.258938346081251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021596745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22113833,0.0006442521,0.7128863,0.0008648736,0.00022020281,0.00018561637,0.00054128264,0.0007178168,0.06280144],"genre_scores_gemma":[0.7092594,0.0006099509,0.21611214,0.00042713562,0.00022651018,0.00026834334,0.0016758078,0.00057527225,0.07084543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992606,0.0001587374,0.000055750614,0.00015836183,0.00017932427,0.00018727414],"domain_scores_gemma":[0.9988807,0.00038633042,0.000089813424,0.00026357837,0.000203704,0.00017588219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065498904,0.00063661486,0.0008153368,0.0015385939,0.0013817652,0.0033245268,0.0010136487,0.000965083,0.014562727],"category_scores_gemma":[0.0019978476,0.0005778719,0.0014002483,0.0011059985,0.0018892852,0.00572948,0.0027817832,0.001869946,0.0025683714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069034744,0.000035127192,0.0001946094,0.000046713514,0.000008569266,0.00005267039,0.0002990861,0.0017025819,0.0011181805,0.98431015,0.0012563053,0.0109069515],"study_design_scores_gemma":[0.0000102334525,0.000019193469,0.000106382504,0.0000144238165,0.00000694508,0.00005034781,0.000080619706,0.0064339885,0.00076587696,0.9890838,0.0034194516,0.000008757678],"about_ca_topic_score_codex":0.0006825142,"about_ca_topic_score_gemma":0.0009342862,"teacher_disagreement_score":0.014562727,"about_ca_system_score_codex":0.0009477035,"about_ca_system_score_gemma":0.0008279845,"threshold_uncertainty_score":0.0487172},"labels":[],"label_agreement":null},{"id":"W2021707702","doi":"10.1007/s00605-011-0305-5","title":"Free lattice-ordered groups and the space of left orderings","year":2011,"lang":"de","type":"article","venue":"Monatshefte für Mathematik","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Uncountable set; Mathematics; Combinatorics; Cantor set; Free group; Group (periodic table); Lattice (music); Space (punctuation); Discrete mathematics; Countable set; Physics; Computer science","score_opus":0.018470188455333773,"score_gpt":0.22404076591570182,"score_spread":0.20557057746036805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021707702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5981643,0.008073997,0.23827149,0.009573714,0.00079117215,0.00006475208,0.0013639866,0.00055257004,0.14314398],"genre_scores_gemma":[0.96614987,0.0009759451,0.014829809,0.00031982598,0.00039629138,0.00007387366,0.0003989355,0.000060560287,0.016794762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849594,0.0005295469,0.00008855551,0.00022969727,0.00043832348,0.00021796302],"domain_scores_gemma":[0.9970118,0.0015958811,0.0003797312,0.00024259253,0.00028137414,0.0004886881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012609708,0.0006526094,0.00070538104,0.0022979642,0.001973529,0.0056199804,0.0010067855,0.0009964592,0.0061096624],"category_scores_gemma":[0.002858886,0.00042470905,0.0007221985,0.00198755,0.0053204736,0.0056948154,0.002672982,0.0021479863,0.0008629145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000373399,0.000012818993,0.000120084915,0.000014251213,0.000004479304,0.00003304727,0.00025812146,0.00053396635,0.00028926902,0.99616027,0.0003575281,0.0021788182],"study_design_scores_gemma":[0.000012829596,0.000008024132,0.000055758625,0.0000050795898,0.0000027321857,0.00002194269,0.0000735543,0.0013842571,0.0001730546,0.996798,0.0014580367,0.000006656573],"about_ca_topic_score_codex":0.0013940486,"about_ca_topic_score_gemma":0.0010842222,"teacher_disagreement_score":0.0061096624,"about_ca_system_score_codex":0.0017635705,"about_ca_system_score_gemma":0.0011407601,"threshold_uncertainty_score":0.02043885},"labels":[],"label_agreement":null},{"id":"W2021881883","doi":"10.2478/s12175-014-0242-6","title":"Hooked extended Langford sequences of small and large defects","year":2014,"lang":"en","type":"article","venue":"Mathematica Slovaca","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Set (abstract data type); Mod","score_opus":0.012255135887185459,"score_gpt":0.22295197456331636,"score_spread":0.2106968386761309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021881883","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.916916,0.0004304777,0.041494094,0.0003631546,0.00031295855,0.00003929546,0.00016119253,0.00031879617,0.03996391],"genre_scores_gemma":[0.9856991,0.000093939336,0.005564506,0.000083642895,0.000082576866,0.00003508978,0.000113986505,0.00005371304,0.008273393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934775,0.00012364857,0.00005278138,0.00011694414,0.00018545304,0.00017337801],"domain_scores_gemma":[0.99796367,0.00071407633,0.00029288285,0.00025746002,0.00023829196,0.00053364615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060025457,0.00048207206,0.0005779554,0.002170271,0.000992764,0.001550159,0.00070724625,0.00078529393,0.0064059426],"category_scores_gemma":[0.0034506791,0.00027212556,0.0005585545,0.00065308757,0.0020950893,0.0017846354,0.0019105269,0.0014229795,0.0007029082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020350606,0.00006406399,0.0014728397,0.000069280926,0.000011106481,0.00058933365,0.0004687409,0.003426023,0.00468237,0.9732924,0.0013148984,0.0144054005],"study_design_scores_gemma":[0.00005758654,0.00013230796,0.0019234583,0.000050304767,0.000013482996,0.0004256488,0.000249878,0.022791347,0.0032094272,0.9647484,0.006348375,0.000049754366],"about_ca_topic_score_codex":0.00051817036,"about_ca_topic_score_gemma":0.00060770224,"teacher_disagreement_score":0.0064059426,"about_ca_system_score_codex":0.0012269317,"about_ca_system_score_gemma":0.0003057865,"threshold_uncertainty_score":0.021430016},"labels":[],"label_agreement":null},{"id":"W2022357851","doi":"10.1016/j.aam.2010.05.001","title":"Recurrent words with constant Abelian complexity","year":2010,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Abelian group; Constant (computer programming); Pure mathematics; Combinatorics; Computer science","score_opus":0.013277789470530175,"score_gpt":0.25981982579151397,"score_spread":0.2465420363209838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022357851","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53716606,0.001513463,0.28164682,0.003374623,0.0007233423,0.00017299049,0.0006951673,0.0018209814,0.17288662],"genre_scores_gemma":[0.9365642,0.0003676988,0.017093519,0.00041342143,0.00069124746,0.00015345687,0.0003011341,0.00032041926,0.04409488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979469,0.00042842492,0.00015634405,0.00048377566,0.0006106784,0.00037395372],"domain_scores_gemma":[0.99258125,0.0044485796,0.0006162844,0.00088276895,0.0009409335,0.0005302818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008435915,0.00084523414,0.0014189801,0.001959702,0.0019636482,0.004762386,0.0013001888,0.0018939729,0.0133939525],"category_scores_gemma":[0.0065720337,0.0007248393,0.0012132585,0.0014795574,0.0036127248,0.008799523,0.003172407,0.0032394254,0.0027013677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050265036,0.000019341178,0.00012026248,0.00003439235,0.000010232931,0.00014721762,0.00029792823,0.000634741,0.0015124253,0.99303705,0.0008063887,0.003329669],"study_design_scores_gemma":[0.000020706044,0.000018177338,0.000118810894,0.0000064011906,0.00001728493,0.0002181658,0.00006328223,0.004191577,0.0012247596,0.99135613,0.0027440118,0.00002065955],"about_ca_topic_score_codex":0.00048856775,"about_ca_topic_score_gemma":0.0005132415,"teacher_disagreement_score":0.0133939525,"about_ca_system_score_codex":0.0014612254,"about_ca_system_score_gemma":0.0007528329,"threshold_uncertainty_score":0.044807196},"labels":[],"label_agreement":null},{"id":"W2022733343","doi":"10.1007/s002330010029","title":"Semigroups Generated by Similarity Orbits","year":2000,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Statistics Canada; Dalhousie University","funders":"","keywords":"Mathematics; Similarity (geometry); Algebra over a field; Pure mathematics; Artificial intelligence; Computer science","score_opus":0.00469261697358755,"score_gpt":0.1999972166823348,"score_spread":0.19530459970874725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022733343","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6155107,0.0009464959,0.30427068,0.0010854114,0.00060109,0.0001979539,0.0005640965,0.0010531793,0.075770386],"genre_scores_gemma":[0.96170044,0.0002291339,0.017674033,0.00010517562,0.00028962424,0.00011648054,0.00033143617,0.00008816224,0.019465594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880993,0.00031992348,0.00008965414,0.00022974497,0.00033783884,0.00021294694],"domain_scores_gemma":[0.9968079,0.0013866923,0.00041721828,0.0003657322,0.00045008614,0.0005723435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012110833,0.00048507558,0.00088980235,0.002540901,0.002073703,0.0030518745,0.0007374191,0.0009308685,0.008855479],"category_scores_gemma":[0.004055501,0.00045006556,0.0010352515,0.001289679,0.0020109708,0.0049744416,0.0024174799,0.0010428563,0.0013727766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010231685,0.000038256025,0.00024621174,0.000030465946,0.000008021966,0.00020982386,0.00063304603,0.00041413182,0.0023723193,0.9895503,0.0007524863,0.005642593],"study_design_scores_gemma":[0.00005398773,0.000053868258,0.00031494623,0.000011143601,0.000010799998,0.00037772057,0.00021188759,0.0051663443,0.0020655338,0.98776823,0.003943357,0.00002215033],"about_ca_topic_score_codex":0.00024301077,"about_ca_topic_score_gemma":0.00019660828,"teacher_disagreement_score":0.008855479,"about_ca_system_score_codex":0.0007464265,"about_ca_system_score_gemma":0.00057669147,"threshold_uncertainty_score":0.029624581},"labels":[],"label_agreement":null},{"id":"W2023034313","doi":"10.1016/j.jcta.2005.01.006","title":"A simple proof that a word of length n has at most <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:math> distinct squares","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Word (group theory); Simple (philosophy); Scroll; Mathematics; Computer science; Theology; Philosophy; Geometry","score_opus":0.015236540240838172,"score_gpt":0.2316709412900469,"score_spread":0.21643440104920872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023034313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030683285,0.0008606575,0.72108793,0.012387618,0.004600397,0.00090455497,0.003352564,0.0036870013,0.22243592],"genre_scores_gemma":[0.45445517,0.0010409547,0.3638878,0.00836513,0.0020696723,0.0010405097,0.003583799,0.0013609666,0.16419594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983991,0.0002484345,0.00015685914,0.0005393938,0.0004700461,0.00018622828],"domain_scores_gemma":[0.99495524,0.0021515177,0.0003417972,0.0008536972,0.0013560513,0.0003416476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016462386,0.0012834907,0.00079746783,0.0007116178,0.0024535027,0.0020619035,0.0013210456,0.0013548726,0.047139607],"category_scores_gemma":[0.0061221225,0.0008209007,0.0027004543,0.00074161333,0.0028357382,0.006208493,0.0048865112,0.003278025,0.014594499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005666144,0.00037667181,0.0016994759,0.0014756477,0.00019860845,0.0017854852,0.0025516343,0.0013890357,0.05913178,0.66226983,0.15190825,0.11664694],"study_design_scores_gemma":[0.00017695973,0.000278991,0.002156111,0.0002492419,0.00016169043,0.0024758638,0.00064976205,0.004255858,0.028475692,0.75752884,0.20344679,0.000144224],"about_ca_topic_score_codex":0.0014936045,"about_ca_topic_score_gemma":0.0032456843,"teacher_disagreement_score":0.047139607,"about_ca_system_score_codex":0.00099844,"about_ca_system_score_gemma":0.0019517434,"threshold_uncertainty_score":0.15769774},"labels":[],"label_agreement":null},{"id":"W2023568492","doi":"10.4204/eptcs.63.25","title":"Fife's Theorem for (7/3)-Powers","year":2011,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Automaton; Characterization (materials science); Binary number; Power (physics); Cellular automaton; Mathematics; Discrete mathematics; Finite-state machine; Computer science; Algebra over a field; Pure mathematics; Arithmetic; Theoretical computer science; Algorithm; Physics; Quantum mechanics","score_opus":0.009762890928154543,"score_gpt":0.22897538780698515,"score_spread":0.2192124968788306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023568492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17789035,0.00060959934,0.74206966,0.0013343036,0.0003228205,0.00016692106,0.0007271197,0.0009243562,0.07595477],"genre_scores_gemma":[0.8886817,0.0003583139,0.08756739,0.00074821216,0.0002661108,0.0004421311,0.0004853298,0.00030465293,0.02114611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986319,0.0001540387,0.0001305264,0.00036717064,0.00032789368,0.0003885332],"domain_scores_gemma":[0.9966875,0.0020712027,0.00024321007,0.00047323186,0.00036311275,0.00016176273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001390591,0.00075856195,0.0008238146,0.0011582319,0.0017600743,0.0026648636,0.0010390606,0.0013110702,0.010028973],"category_scores_gemma":[0.004883461,0.00056197617,0.002103345,0.0007209717,0.004314772,0.005955155,0.002121175,0.0029672198,0.001642779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092639835,0.000023167184,0.00070364214,0.0000696338,0.0000117723075,0.0002559483,0.0005839014,0.0026252973,0.0028718403,0.98044467,0.0011305303,0.011187049],"study_design_scores_gemma":[0.000025871497,0.00003680372,0.00032434767,0.000024409572,0.0000147336295,0.0002814984,0.00007824864,0.008730995,0.00499553,0.9781959,0.0072606867,0.000030964187],"about_ca_topic_score_codex":0.001272721,"about_ca_topic_score_gemma":0.0007265934,"teacher_disagreement_score":0.010028973,"about_ca_system_score_codex":0.0010212658,"about_ca_system_score_gemma":0.00065643946,"threshold_uncertainty_score":0.033550322},"labels":[],"label_agreement":null},{"id":"W2023679149","doi":"10.1007/s00012-004-1895-8","title":"Results on the equivalence problem for finite groups","year":2005,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Equivalence (formal languages); Nilpotent; Dihedral group; Nilpotent group; Algebra over a field; Polynomial; Pure mathematics; Group (periodic table); Discrete mathematics; Mathematical analysis","score_opus":0.019179097369652797,"score_gpt":0.22526006977170318,"score_spread":0.2060809724020504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023679149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17584822,0.014883433,0.51293546,0.028308881,0.0024879472,0.0001993956,0.0009857125,0.00090654247,0.26344442],"genre_scores_gemma":[0.8559759,0.010552737,0.06259893,0.0046903114,0.0070139486,0.0003228546,0.0031288413,0.0008193797,0.054897033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995596,0.0010799121,0.00030311462,0.0011883441,0.0010924037,0.00074023486],"domain_scores_gemma":[0.97244215,0.022545822,0.0007034867,0.0019928215,0.0012085858,0.0011070439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005391462,0.0017192462,0.0034720728,0.004010918,0.005805691,0.006998624,0.0043288497,0.0048240344,0.02250994],"category_scores_gemma":[0.02091134,0.0014582583,0.004091923,0.0052550435,0.009590099,0.046751108,0.00817397,0.012431439,0.0022514735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010867339,0.00012201139,0.00037276853,0.00018488892,0.000031123986,0.00010837149,0.00052242505,0.001470738,0.00030870782,0.98386323,0.0034450917,0.00946199],"study_design_scores_gemma":[0.000013840246,0.000008210067,0.00006009727,0.000012885292,0.00000945823,0.000022856972,0.00006133538,0.0012698028,0.00011952704,0.99676114,0.0016550063,0.000005951951],"about_ca_topic_score_codex":0.0019984038,"about_ca_topic_score_gemma":0.0012627292,"teacher_disagreement_score":0.02250994,"about_ca_system_score_codex":0.0035528839,"about_ca_system_score_gemma":0.0018310143,"threshold_uncertainty_score":0.0753032},"labels":[],"label_agreement":null},{"id":"W2023927275","doi":"10.1016/j.ejc.2012.03.016","title":"A bijection between words and multisets of necklaces","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Bijection; Lexicographical order; Mathematics; Combinatorics; Permutation (music); Order (exchange); Set (abstract data type); Inverse; Word (group theory); Discrete mathematics; Computer science","score_opus":0.014712648348581674,"score_gpt":0.22803322308592308,"score_spread":0.2133205747373414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023927275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15106925,0.002031024,0.7391998,0.0018428813,0.0023009626,0.00036399017,0.0012658669,0.00205828,0.09986801],"genre_scores_gemma":[0.58810735,0.0017692096,0.31188673,0.0012497214,0.0009893366,0.0009476971,0.001314859,0.0016450605,0.09208994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807286,0.00043043506,0.00027499127,0.00067551364,0.00031412835,0.00023212038],"domain_scores_gemma":[0.99589264,0.001768157,0.0003607537,0.0007094123,0.0008164585,0.00045253552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012506085,0.0008421122,0.00088658085,0.002919118,0.004263327,0.005329414,0.001386738,0.0025143214,0.015486735],"category_scores_gemma":[0.004862385,0.0013953143,0.0017780808,0.002794216,0.002843337,0.01236509,0.0043436293,0.0029124608,0.0042980304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093602925,0.000053892894,0.0003270559,0.00016184043,0.000020413203,0.00034019465,0.0012942499,0.00035192753,0.004351305,0.9651078,0.0030235616,0.024874138],"study_design_scores_gemma":[0.00003834105,0.000072358016,0.0003527809,0.0000989919,0.000058348935,0.001345025,0.00072091084,0.0025899322,0.0039613396,0.94455147,0.046135202,0.000075299584],"about_ca_topic_score_codex":0.0005170965,"about_ca_topic_score_gemma":0.00048770063,"teacher_disagreement_score":0.015486735,"about_ca_system_score_codex":0.00084809493,"about_ca_system_score_gemma":0.0007545484,"threshold_uncertainty_score":0.051808357},"labels":[],"label_agreement":null},{"id":"W2023968242","doi":"10.1090/s0002-9939-08-09319-2","title":"On patterns occurring in binary algebraic numbers","year":2008,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Algorithm; Annotation; Computer science; Semantics (computer science); Artificial intelligence; Database; Programming language","score_opus":0.01126064086272584,"score_gpt":0.23126106091550425,"score_spread":0.2200004200527784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023968242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17263365,0.001708559,0.66535527,0.005381799,0.0015492486,0.0002955937,0.0012707721,0.0030737452,0.14873134],"genre_scores_gemma":[0.6680467,0.0018448937,0.27189338,0.0022805755,0.0010416606,0.00049068703,0.002380397,0.0014208978,0.05060076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99484503,0.0010149453,0.00054587313,0.0013554214,0.0015927508,0.000645941],"domain_scores_gemma":[0.9897223,0.0051444066,0.001272559,0.0016040603,0.0018262593,0.00043043875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022251278,0.0012104991,0.0010132533,0.0025406217,0.0028959531,0.0040596034,0.001558406,0.0016004888,0.012996711],"category_scores_gemma":[0.020393373,0.0011115872,0.0016042114,0.003593256,0.0051863734,0.013770191,0.005738895,0.003631776,0.0044391737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020000775,0.00008179077,0.0029468136,0.00028476623,0.000028531247,0.001551818,0.0019836698,0.0009690777,0.003964808,0.9400479,0.0073061003,0.040634643],"study_design_scores_gemma":[0.000051262097,0.00006437218,0.00105381,0.0001267934,0.0000513275,0.0016963417,0.0006847954,0.008599721,0.0061204243,0.93588126,0.045607474,0.000062432846],"about_ca_topic_score_codex":0.0025836602,"about_ca_topic_score_gemma":0.0025936856,"teacher_disagreement_score":0.012996711,"about_ca_system_score_codex":0.0018550361,"about_ca_system_score_gemma":0.001126024,"threshold_uncertainty_score":0.04347831},"labels":[],"label_agreement":null},{"id":"W2024425953","doi":"10.1007/s00233-006-0604-7","title":"The Intersection of Pseudovarieties of Central Simple Semigroups","year":2006,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Intersection (aeronautics); Mathematics; Simple (philosophy); Algebra over a field; Pure mathematics; Epistemology; Geography; Philosophy","score_opus":0.0034993091593057374,"score_gpt":0.19209007598552735,"score_spread":0.1885907668262216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024425953","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7845872,0.0013053899,0.16331187,0.0006592485,0.00023829912,0.000057669487,0.00034934576,0.00053421414,0.04895676],"genre_scores_gemma":[0.9786962,0.00031219746,0.0116884075,0.000063101324,0.00015677657,0.00007385753,0.00030366523,0.00008282529,0.008622831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775106,0.00058220193,0.00014506975,0.0004668003,0.0005928797,0.00046193294],"domain_scores_gemma":[0.9938393,0.0032068337,0.00064699684,0.00043454752,0.0006979098,0.0011744067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026449903,0.0006047523,0.0012471753,0.0038528114,0.0037551192,0.0075870687,0.0014052077,0.0011134917,0.007980852],"category_scores_gemma":[0.0059885504,0.00087598467,0.0011762421,0.0023872717,0.004197918,0.0112282755,0.0036239834,0.0018944336,0.0008585598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013831258,0.000027199023,0.0003521096,0.000024620309,0.000010004911,0.00015195156,0.0008043436,0.00025599715,0.0015665232,0.99244094,0.000326827,0.0039012427],"study_design_scores_gemma":[0.00004052145,0.0000602314,0.0006469436,0.000025206356,0.00002526079,0.0005123874,0.0007302182,0.0042684237,0.0027284948,0.98639756,0.0045269984,0.00003787298],"about_ca_topic_score_codex":0.00053578004,"about_ca_topic_score_gemma":0.0003634537,"teacher_disagreement_score":0.007980852,"about_ca_system_score_codex":0.0014726748,"about_ca_system_score_gemma":0.0007929077,"threshold_uncertainty_score":0.02669859},"labels":[],"label_agreement":null},{"id":"W2025521996","doi":"10.1016/j.tcs.2004.02.032","title":"On the state complexity of reversals of regular languages","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Regular language; Variety (cybernetics); Finite-state machine; State (computer science); Deterministic finite automaton; Nondeterministic finite automaton; Mathematics; Automaton; Finite state; Discrete mathematics; Computer science; Theoretical computer science; Algorithm; Automata theory","score_opus":0.015218119819853127,"score_gpt":0.2520598938413013,"score_spread":0.23684177402144815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025521996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.838025,0.0012784093,0.12335008,0.0048771873,0.00015647974,0.00011752934,0.00095311453,0.0005041488,0.030738136],"genre_scores_gemma":[0.98804736,0.0004011449,0.007271347,0.00016595602,0.00017129052,0.00007287613,0.0004305629,0.00014013654,0.0032993963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99658537,0.001097128,0.00024569698,0.000516514,0.0009078889,0.00064740865],"domain_scores_gemma":[0.8886279,0.098631315,0.0038619612,0.004793499,0.0020269,0.0020584383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003786319,0.00070550805,0.0020730698,0.001865988,0.0018489328,0.0065911957,0.002713078,0.002592255,0.010012105],"category_scores_gemma":[0.04039308,0.0011341441,0.001687006,0.001844581,0.0047536585,0.016862785,0.0038225094,0.0054285005,0.00059529894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092307193,0.00022721496,0.004350541,0.00024165025,0.000072448085,0.00026226786,0.0009823656,0.0680748,0.0034835741,0.90120393,0.0030331279,0.017145032],"study_design_scores_gemma":[0.000066321205,0.00006126729,0.00096411654,0.000019724646,0.000037903603,0.00008500362,0.00013711766,0.13776112,0.00091029966,0.8593513,0.00056634884,0.0000394384],"about_ca_topic_score_codex":0.002006033,"about_ca_topic_score_gemma":0.0018323043,"teacher_disagreement_score":0.010012105,"about_ca_system_score_codex":0.0026489268,"about_ca_system_score_gemma":0.0016992149,"threshold_uncertainty_score":0.033493876},"labels":[],"label_agreement":null},{"id":"W2025524923","doi":"10.2178/bsl/1246453975","title":"Enumerating Types of Boolean Functions","year":2009,"lang":"en","type":"article","venue":"Bulletin of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Boolean function; Maximum satisfiability problem; Boolean data type; Boolean expression; Variable (mathematics); Computer science; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.010236405667975979,"score_gpt":0.2189480889604182,"score_spread":0.20871168329244222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025524923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37460643,0.0028090398,0.5650325,0.001820342,0.00060767273,0.00022222391,0.005387408,0.0014673425,0.048047017],"genre_scores_gemma":[0.77356267,0.001379851,0.2053472,0.00033648201,0.00033226926,0.00025111946,0.0047130007,0.0003108352,0.013766591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997148,0.0007520276,0.00036256944,0.0004951447,0.00089913956,0.0003431344],"domain_scores_gemma":[0.9915359,0.0048544984,0.00061864045,0.0012374314,0.0014901203,0.00026338772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018952315,0.0006638308,0.0010296691,0.004115988,0.0014764188,0.004118205,0.0012356833,0.0011853459,0.0043403087],"category_scores_gemma":[0.009837958,0.00057458517,0.0010167054,0.0032811875,0.0030585378,0.0073544546,0.0017910253,0.0021371117,0.0013601668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003194718,0.000065980945,0.0067226575,0.00038404277,0.000056270324,0.0001842297,0.0012244831,0.0077863024,0.007177509,0.8368407,0.0047747265,0.13446361],"study_design_scores_gemma":[0.000024592717,0.00004177884,0.0008135334,0.00012066429,0.000040165327,0.00031837073,0.00034659237,0.0137308575,0.0071629016,0.96117514,0.016186466,0.00003878668],"about_ca_topic_score_codex":0.0011164481,"about_ca_topic_score_gemma":0.0009989566,"teacher_disagreement_score":0.0043403087,"about_ca_system_score_codex":0.0016681467,"about_ca_system_score_gemma":0.0013335409,"threshold_uncertainty_score":0.014519811},"labels":[],"label_agreement":null},{"id":"W2025639547","doi":"10.1016/j.tcs.2006.05.034","title":"Progressive solutions to a parallel automata equation","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Component (thermodynamics); Automaton; Block (permutation group theory); Mathematics; Action (physics); Cellular automaton; Computer science; Algorithm; Applied mathematics; Theoretical computer science; Combinatorics; Physics; Thermodynamics","score_opus":0.015572417817744736,"score_gpt":0.25212270200388376,"score_spread":0.23655028418613902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025639547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26418746,0.0004632474,0.60306746,0.0031762237,0.00043945207,0.0002015809,0.00028314124,0.0004361957,0.12774529],"genre_scores_gemma":[0.77930677,0.00070397067,0.103461556,0.0004957329,0.00030094673,0.00028195884,0.00027352414,0.00019111478,0.11498446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997172,0.000057119913,0.000020401721,0.000054341956,0.00010245632,0.000048497757],"domain_scores_gemma":[0.99911934,0.0005274959,0.00006190173,0.00008763945,0.00012836163,0.000075187374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006438436,0.0005418006,0.00053504616,0.00055617315,0.001230901,0.0013908454,0.0011158314,0.0012103117,0.013044625],"category_scores_gemma":[0.0034527555,0.00035492968,0.0008474293,0.00070831843,0.0015395384,0.0030078741,0.0024378665,0.002494432,0.0009181345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022369151,0.00001700652,0.000059086302,0.000025092144,0.0000049801256,0.00010464337,0.0001694228,0.0025919422,0.0011560039,0.9904773,0.00083591364,0.0045362534],"study_design_scores_gemma":[0.0000497085,0.000017789682,0.00005263514,0.0000065694076,0.000008372453,0.00010088811,0.000073776835,0.026472544,0.00091361196,0.96926796,0.0030293202,0.0000068293575],"about_ca_topic_score_codex":0.0013108898,"about_ca_topic_score_gemma":0.0014001783,"teacher_disagreement_score":0.013044625,"about_ca_system_score_codex":0.0009386775,"about_ca_system_score_gemma":0.0009263865,"threshold_uncertainty_score":0.043638647},"labels":[],"label_agreement":null},{"id":"W2025689196","doi":"10.1142/s0129054105003352","title":"NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Acadia University","funders":"","keywords":"Unary operation; Nondeterministic algorithm; RADIUS; Mathematics; Uniqueness; Regular language; Diophantine equation; Class (philosophy); Combinatorics; Discrete mathematics; Computer science; Mathematical analysis; Theoretical computer science; Automaton; Artificial intelligence","score_opus":0.009417357858932295,"score_gpt":0.28444976987275594,"score_spread":0.27503241201382367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025689196","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69538283,0.0010738355,0.2870651,0.0003797296,0.000039029874,0.000060023765,0.0001494488,0.00038928518,0.015460707],"genre_scores_gemma":[0.95628494,0.00017097603,0.040296234,0.000051279065,0.000028862445,0.000083676656,0.00007347853,0.00011389242,0.0028967368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791175,0.00051048386,0.00022692452,0.00069572433,0.00044352913,0.00021151833],"domain_scores_gemma":[0.9908324,0.006071508,0.0011495767,0.0008641306,0.0007608274,0.0003215726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016081487,0.00024014323,0.00073097623,0.0008059638,0.0012847119,0.0014957194,0.0010546382,0.00072707766,0.00255847],"category_scores_gemma":[0.01040015,0.000423293,0.00080278324,0.00038349754,0.0024362807,0.0040644994,0.0014452855,0.0010843019,0.00046372102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002447562,0.000027874185,0.0041455803,0.00028469678,0.000042180618,0.00051612145,0.0018472701,0.012096026,0.038319834,0.922325,0.00040371376,0.019746935],"study_design_scores_gemma":[0.00004070245,0.00020299102,0.002548636,0.000067534515,0.000072423005,0.002170288,0.0008018236,0.07789548,0.043692455,0.86307985,0.009326738,0.00010104792],"about_ca_topic_score_codex":0.00037429182,"about_ca_topic_score_gemma":0.00031430728,"teacher_disagreement_score":0.00255847,"about_ca_system_score_codex":0.00080288993,"about_ca_system_score_gemma":0.00045941235,"threshold_uncertainty_score":0.008558929},"labels":[],"label_agreement":null},{"id":"W2026211688","doi":"10.1007/s000120200005","title":"Solid varieties of arbitrary type","year":2002,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Arity; Variety (cybernetics); Idempotence; Type (biology); Pure mathematics; Normalization (sociology); Nilpotent; Algebra over a field; Discrete mathematics","score_opus":0.014085530876595632,"score_gpt":0.21931905253514666,"score_spread":0.20523352165855102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026211688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4190234,0.0026199026,0.2166449,0.003314213,0.0010420429,0.000102811064,0.0014990391,0.001203511,0.3545501],"genre_scores_gemma":[0.91548204,0.0007716151,0.018518962,0.00020831134,0.0003283313,0.00006716979,0.00084487186,0.00024343708,0.06353516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925107,0.00013520468,0.000041906795,0.00018681107,0.0002449754,0.0001398945],"domain_scores_gemma":[0.9990393,0.00030309125,0.00011624854,0.00019533336,0.00018114793,0.00016495971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058161776,0.0006106127,0.0012152143,0.0021619701,0.0029063786,0.0052992124,0.0008784412,0.0010138695,0.011411393],"category_scores_gemma":[0.0017299999,0.00072329876,0.0009170788,0.002574354,0.0042546275,0.007275788,0.0033740443,0.0025292581,0.0017539022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017729602,0.0000054511506,0.000059062335,0.000011842764,0.0000026349637,0.000031751206,0.000118084514,0.00015219605,0.00023679431,0.9972938,0.00059739803,0.0014732241],"study_design_scores_gemma":[0.000016373475,0.000009846779,0.000110299894,0.0000111887,0.000008845953,0.00012962625,0.00016179317,0.0010261989,0.00056198443,0.9882102,0.009744558,0.000009092523],"about_ca_topic_score_codex":0.00050690235,"about_ca_topic_score_gemma":0.00050890155,"teacher_disagreement_score":0.011411393,"about_ca_system_score_codex":0.001346579,"about_ca_system_score_gemma":0.0005293271,"threshold_uncertainty_score":0.038174927},"labels":[],"label_agreement":null},{"id":"W2026951311","doi":"10.1016/j.tcs.2009.02.024","title":"Decimations of languages and state complexity","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Context-free language; Context (archaeology); Transformation (genetics); Mathematics; State (computer science); Regular language; Arithmetic; Combinatorics; Upper and lower bounds; Discrete mathematics; Algebra over a field; Computer science; Pure mathematics; Algorithm; Theoretical computer science; Rule-based machine translation","score_opus":0.01166234300292262,"score_gpt":0.2812288733793871,"score_spread":0.2695665303764645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026951311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34134609,0.0034528002,0.591039,0.0057342327,0.00027368302,0.000079033045,0.00054882356,0.0007946826,0.056731727],"genre_scores_gemma":[0.9543078,0.00082941336,0.03275328,0.00036510863,0.00042706696,0.00014212458,0.0002556484,0.00015653291,0.010763108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969326,0.00088018883,0.0002835969,0.0007805965,0.0007101931,0.00041276586],"domain_scores_gemma":[0.9651271,0.028093735,0.0015796956,0.0027457343,0.0014936002,0.0009600797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028145516,0.0006428736,0.0016474985,0.0019490216,0.0016163883,0.0063511604,0.0016206354,0.0015363429,0.008026655],"category_scores_gemma":[0.018125085,0.0009795635,0.0011616352,0.001864856,0.0059795165,0.015609,0.0036967567,0.0055427947,0.0007002405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037087502,0.000015690497,0.00019088597,0.0000308805,0.000005947767,0.000028857148,0.0002512597,0.0035990467,0.00025083878,0.99006,0.0003157411,0.005213705],"study_design_scores_gemma":[0.0000060353573,0.000005256998,0.0000526973,0.000005235125,0.000003328124,0.00002257472,0.000022996228,0.008014372,0.00016262561,0.99123645,0.00046237835,0.0000061033443],"about_ca_topic_score_codex":0.0008147784,"about_ca_topic_score_gemma":0.00070933776,"teacher_disagreement_score":0.008026655,"about_ca_system_score_codex":0.0023160847,"about_ca_system_score_gemma":0.0009968608,"threshold_uncertainty_score":0.026851833},"labels":[],"label_agreement":null},{"id":"W2027264688","doi":"10.1145/2213977.2213998","title":"Short proofs for the determinant identities","year":2012,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Mathematical proof; Polynomial; Combinatorics; Degree (music); Diagonal; Proof complexity; Corollary; Identity (music); Finite field; Discrete mathematics; Arithmetic; Identity matrix; Eigenvalues and eigenvectors; Mathematical analysis","score_opus":0.027559932434384985,"score_gpt":0.2718317100569432,"score_spread":0.2442717776225582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027264688","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08597577,0.0016194002,0.8804885,0.0029135922,0.00035823457,0.00026179702,0.00068693626,0.0027638264,0.02493181],"genre_scores_gemma":[0.67341006,0.0009438884,0.30865568,0.0011634565,0.00046255894,0.00032346265,0.0008459048,0.000761114,0.013433936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962364,0.00080329686,0.00031311883,0.0009140861,0.001258334,0.00047467524],"domain_scores_gemma":[0.98231226,0.011709729,0.0012500447,0.002585895,0.0016865056,0.00045554523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025652142,0.0006561036,0.00059105875,0.0010595598,0.0016608546,0.0032219128,0.0017261598,0.00097109395,0.012825729],"category_scores_gemma":[0.015995324,0.0011970031,0.001213407,0.0011547337,0.00206736,0.009113078,0.0042934883,0.0027220699,0.0022418962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023672989,0.00008731384,0.0014756205,0.00039524675,0.000052485695,0.00030591627,0.00062408095,0.0052903276,0.013948661,0.9028986,0.005987268,0.068697706],"study_design_scores_gemma":[0.00009239042,0.00010703809,0.00066610996,0.00005188206,0.00008391403,0.0006036891,0.000101193385,0.03586993,0.017575474,0.9168955,0.027906718,0.00004626657],"about_ca_topic_score_codex":0.0009139024,"about_ca_topic_score_gemma":0.0010909925,"teacher_disagreement_score":0.012825729,"about_ca_system_score_codex":0.0023830046,"about_ca_system_score_gemma":0.00201297,"threshold_uncertainty_score":0.042906344},"labels":[],"label_agreement":null},{"id":"W2028475750","doi":"10.1016/j.tcs.2012.04.002","title":"One-reversal counter machines and multihead automata: Revisited","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Google (Canada)","funders":"","keywords":"Pushdown automaton; Deterministic pushdown automaton; Deterministic context-free grammar; Computer science; Nested word; Finite-state machine; Embedded pushdown automaton; Deterministic finite automaton; Counterexample; Theoretical computer science; Automaton; Algorithm; Discrete mathematics; Automata theory; Mathematics; Quantum finite automata; Programming language; Nondeterministic finite automaton; Parsing; Context-free grammar","score_opus":0.011368968874612733,"score_gpt":0.2533445139941322,"score_spread":0.2419755451195195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028475750","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19939479,0.040672604,0.34091637,0.06778302,0.0049922746,0.00012868781,0.00048338028,0.00083699473,0.34479186],"genre_scores_gemma":[0.92936504,0.0065691946,0.031692997,0.00402534,0.0021911552,0.000108222106,0.00012172973,0.00014380399,0.025782503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881834,0.00043858067,0.00006864881,0.00027929456,0.0002116782,0.00018341003],"domain_scores_gemma":[0.99255556,0.004676157,0.0005342685,0.0012879771,0.00059798727,0.00034809258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024337682,0.000699977,0.0013030793,0.0016155696,0.0022724506,0.0046971436,0.003442323,0.0060536275,0.013446562],"category_scores_gemma":[0.007794563,0.00068641274,0.0011606213,0.0026729743,0.0074728606,0.013958421,0.0024816226,0.005935828,0.0014319011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012800158,0.000008014284,0.000080308906,0.000026164946,0.000002929185,0.000031063642,0.00008133921,0.00027448506,0.00010365623,0.99492633,0.0009803708,0.0034725259],"study_design_scores_gemma":[0.000007488297,0.0000075395033,0.00009742454,0.00001728333,0.000004799279,0.000057664416,0.000078215504,0.0024568124,0.00012726334,0.9949438,0.0021940088,0.000007663669],"about_ca_topic_score_codex":0.0019472481,"about_ca_topic_score_gemma":0.002749333,"teacher_disagreement_score":0.013446562,"about_ca_system_score_codex":0.002183318,"about_ca_system_score_gemma":0.0014475576,"threshold_uncertainty_score":0.044983268},"labels":[],"label_agreement":null},{"id":"W2029049420","doi":"10.1007/s00493-003-0034-z","title":"The Fixing Block Method in Combinatorics on Words","year":2003,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Block (permutation group theory); Combinatorics on words; Algebraic combinatorics; Discrete mathematics; Word (group theory); Geometry","score_opus":0.010670412091314195,"score_gpt":0.25678029379713985,"score_spread":0.24610988170582565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029049420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010960448,0.002453762,0.94177717,0.0018963419,0.0007133609,0.00006573584,0.00020313691,0.0007460723,0.041183997],"genre_scores_gemma":[0.34142026,0.006272424,0.53390384,0.0015989168,0.0019801916,0.0007924442,0.0007563055,0.0024365634,0.11083909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828315,0.00079342054,0.00007817937,0.00032089296,0.00036007914,0.00016421461],"domain_scores_gemma":[0.997572,0.001315396,0.000090082714,0.00074906315,0.00018250546,0.00009080778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022503831,0.0013013281,0.0016977425,0.0026489748,0.0023750043,0.0027892962,0.0025854253,0.0017952713,0.015929831],"category_scores_gemma":[0.0045820824,0.0012856519,0.002033818,0.0034164006,0.006842825,0.010613013,0.0030344822,0.00584843,0.0049993354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018182849,0.0000059851495,0.000030831296,0.000041623298,0.0000060962443,0.000014844245,0.00009754308,0.0007385555,0.00037903053,0.98536694,0.0017529363,0.0115475375],"study_design_scores_gemma":[0.00001147846,0.000011691286,0.000031047934,0.000016545036,0.000010477423,0.000028329729,0.000019877194,0.0039285943,0.0007037923,0.9838562,0.011365845,0.000016017748],"about_ca_topic_score_codex":0.0024436065,"about_ca_topic_score_gemma":0.002104322,"teacher_disagreement_score":0.015929831,"about_ca_system_score_codex":0.001863588,"about_ca_system_score_gemma":0.0012049474,"threshold_uncertainty_score":0.053290546},"labels":[],"label_agreement":null},{"id":"W2029413222","doi":"10.1016/j.tcs.2003.10.010","title":"From cascade decompositions to bit-vector algorithms","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Algorithm; Automaton; Cascade; Mathematics; Computation; Bit array; Bounded function; Computer science; Theoretical computer science; Type (biology)","score_opus":0.008736864146077434,"score_gpt":0.25412173965813795,"score_spread":0.2453848755120605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029413222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018706542,0.0010497347,0.9501167,0.0011252969,0.0002589768,0.00008655612,0.00022122156,0.0013337552,0.027101217],"genre_scores_gemma":[0.43372625,0.002544751,0.5226532,0.001380731,0.0009257809,0.0004130599,0.0010575403,0.0013295511,0.0359691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990232,0.00029695444,0.00006141457,0.00020984511,0.0002902451,0.00011835237],"domain_scores_gemma":[0.9974995,0.0013590282,0.00012774086,0.00064097333,0.00024694914,0.00012574339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011449778,0.001006695,0.0010067621,0.0016063512,0.0011640482,0.0027180535,0.001477383,0.001365671,0.01798584],"category_scores_gemma":[0.0056413095,0.000754872,0.0010092119,0.002282637,0.0020926322,0.008289019,0.0028705087,0.0033687335,0.0035615936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011566935,0.000041087867,0.00012428292,0.00007892817,0.000011980616,0.000027875407,0.000110514644,0.0060036285,0.0010791582,0.9342799,0.0058507957,0.0522762],"study_design_scores_gemma":[0.000012212028,0.00001405742,0.000029082796,0.000015359208,0.000007325879,0.000025348085,0.000012558915,0.024644917,0.0006432339,0.97140074,0.0031884883,0.0000067532746],"about_ca_topic_score_codex":0.0006997538,"about_ca_topic_score_gemma":0.0010792998,"teacher_disagreement_score":0.01798584,"about_ca_system_score_codex":0.0011263764,"about_ca_system_score_gemma":0.0007798783,"threshold_uncertainty_score":0.060168684},"labels":[],"label_agreement":null},{"id":"W2029618677","doi":"10.4204/eptcs.31.8","title":"State Complexity of Catenation Combined with Star and Reversal","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; Combined operations; State (computer science); Continuation; Star (game theory); Computer science; Algorithm; Mathematics; Political science; Chemistry; Programming language; Law","score_opus":0.005197979451632736,"score_gpt":0.21173049403493127,"score_spread":0.20653251458329855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029618677","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82917446,0.00029087235,0.13759056,0.0010194556,0.00008082003,0.00015279834,0.0008301147,0.00061198714,0.030248877],"genre_scores_gemma":[0.98066807,0.00012351606,0.014643988,0.00005542322,0.00003375534,0.00008160737,0.00046167412,0.00010091898,0.0038310667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978053,0.00040399894,0.0001783662,0.00043838785,0.0006104112,0.0005634501],"domain_scores_gemma":[0.98920983,0.00682623,0.0007814751,0.0019326594,0.00076991104,0.00047994664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011170806,0.00039920054,0.00078185543,0.00087328703,0.0012092924,0.0039844154,0.0012687994,0.00097179273,0.012286937],"category_scores_gemma":[0.0072739767,0.0003644561,0.0017755437,0.0009994522,0.0019354755,0.008350869,0.0026748676,0.0023381428,0.00067384366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010324329,0.00024748372,0.004303677,0.00035252876,0.00008816481,0.00047738597,0.0006975338,0.07117444,0.016153086,0.8689237,0.0029588402,0.033590652],"study_design_scores_gemma":[0.0000744166,0.00020588157,0.0015406411,0.000029915036,0.00010520016,0.00033778406,0.00029487995,0.20929618,0.020497872,0.7632724,0.0042528347,0.000092002025],"about_ca_topic_score_codex":0.0016777073,"about_ca_topic_score_gemma":0.001622923,"teacher_disagreement_score":0.012286937,"about_ca_system_score_codex":0.0016895932,"about_ca_system_score_gemma":0.001567879,"threshold_uncertainty_score":0.0411039},"labels":[],"label_agreement":null},{"id":"W2030468605","doi":"10.4153/cmb-2011-168-5","title":"The Smallest Pisot Element in the Field of Formal Power Series Over a Finite Field","year":2011,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Finite field; Field (mathematics); Formal power series; Power series; Laurent series; Degree (music); Element (criminal law); Combinatorics; Polynomial; Minimal polynomial (linear algebra); Series (stratigraphy); Discrete mathematics; Finite set; Sequence (biology); Pure mathematics; Matrix polynomial; Mathematical analysis; Homogeneous polynomial","score_opus":0.01127131150733368,"score_gpt":0.21334530479339608,"score_spread":0.2020739932860624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030468605","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85933244,0.00054289337,0.115206406,0.00080518547,0.00014071955,0.000042197713,0.00013983103,0.00016580832,0.023624508],"genre_scores_gemma":[0.98122036,0.00022091967,0.0127781825,0.000051802966,0.000098493554,0.000026876383,0.00007579751,0.000032795244,0.005494743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996929,0.00005047359,0.000022153688,0.00007647707,0.00008212206,0.00007585876],"domain_scores_gemma":[0.99873275,0.00063860905,0.00014626741,0.00009139382,0.0001594318,0.00023148947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069447386,0.00031806322,0.0006199934,0.0010704977,0.0011901706,0.0012102794,0.0004321408,0.00040190533,0.002884295],"category_scores_gemma":[0.002568882,0.00019013465,0.0006076498,0.0005020148,0.0026559895,0.0026309984,0.00090485235,0.001287262,0.0004535524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040101513,0.00005003855,0.002982413,0.00013528563,0.000019004197,0.0004845793,0.0009990247,0.005511222,0.01819266,0.9516811,0.000774041,0.018769694],"study_design_scores_gemma":[0.00006163878,0.00021783786,0.0024924208,0.000057495436,0.000035492685,0.0006797271,0.00029669373,0.025109394,0.023101164,0.93868625,0.009206413,0.00005555689],"about_ca_topic_score_codex":0.0007289373,"about_ca_topic_score_gemma":0.00058133405,"teacher_disagreement_score":0.002884295,"about_ca_system_score_codex":0.0011008861,"about_ca_system_score_gemma":0.00074907264,"threshold_uncertainty_score":0.009648919},"labels":[],"label_agreement":null},{"id":"W2030592198","doi":"10.4153/cmb-2001-011-9","title":"Some Semigroup Laws in Groups","year":2001,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Semigroup; Cancellative semigroup; Commutative property; Simple (philosophy); Pure mathematics; Group (periodic table); Law; Discrete mathematics; Political science","score_opus":0.00979554580465301,"score_gpt":0.20501031271253842,"score_spread":0.19521476690788542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030592198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3642386,0.0030828544,0.30189288,0.013840166,0.0016728061,0.00025724838,0.00046422673,0.0010243662,0.3135269],"genre_scores_gemma":[0.9510447,0.00051704503,0.020057047,0.0012542484,0.00055952574,0.0001153722,0.00013713991,0.00007939214,0.026235564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901235,0.0002798015,0.00006299135,0.00020781248,0.00031225875,0.00012475843],"domain_scores_gemma":[0.9978777,0.0011116655,0.00014175722,0.00026748117,0.00041052778,0.00019086363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017742569,0.00018272639,0.00034445137,0.00065436476,0.0015591965,0.0022683514,0.00031445688,0.0008137546,0.004781953],"category_scores_gemma":[0.0030916238,0.00022786725,0.0006889274,0.00039214492,0.004931336,0.0026744276,0.0013022182,0.0013178148,0.00061642233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012424553,0.000010661655,0.00015338008,0.000015183805,0.0000024798394,0.00011228401,0.0007339937,0.00019763861,0.00074417895,0.9949768,0.0010360184,0.002004809],"study_design_scores_gemma":[0.000019314819,0.000017808194,0.00013800868,0.000010527758,0.0000040879318,0.000089647896,0.00010523949,0.0015520192,0.0006243882,0.9813331,0.016100835,0.000005048124],"about_ca_topic_score_codex":0.0020264063,"about_ca_topic_score_gemma":0.001435677,"teacher_disagreement_score":0.004781953,"about_ca_system_score_codex":0.0008856488,"about_ca_system_score_gemma":0.00075266894,"threshold_uncertainty_score":0.015997231},"labels":[],"label_agreement":null},{"id":"W2031779562","doi":"10.1142/s0218196710005686","title":"WEAKLY ITERATED BLOCK PRODUCTS AND APPLICATIONS TO LOGIC AND COMPLEXITY","year":2010,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Alexander von Humboldt-Stiftung","keywords":"Mathematics; Operand; Iterated function; Bracketing (phenomenology); Product (mathematics); Block (permutation group theory); Wreath product; Discrete mathematics; Order (exchange); Bounded function; Arithmetic; Combinatorics","score_opus":0.0204166035587952,"score_gpt":0.28292010656889227,"score_spread":0.26250350301009706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031779562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3162942,0.014994371,0.5398717,0.005685559,0.00025642946,0.00006758815,0.00029196677,0.00056615815,0.12197211],"genre_scores_gemma":[0.923198,0.0031492694,0.058442056,0.0002969956,0.00037173484,0.00010856072,0.00013907618,0.000083889776,0.014210344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999132,0.0002573642,0.00006130211,0.00018872587,0.00027240018,0.000088200984],"domain_scores_gemma":[0.99776745,0.0014967681,0.00018564601,0.00019254029,0.00023377122,0.00012381253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010227239,0.00040465407,0.0006649278,0.0014808627,0.0009315237,0.0025393725,0.00069690414,0.0006164341,0.0030170556],"category_scores_gemma":[0.0027084113,0.00033671307,0.0008841547,0.0015415186,0.0037935528,0.0042695315,0.0017390505,0.0017889666,0.0003275128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000863496,0.000005003082,0.00015202216,0.00003098539,0.0000062525114,0.00003448945,0.00015968336,0.002160588,0.00058316626,0.99235946,0.00021981668,0.0042798454],"study_design_scores_gemma":[0.0000031425222,0.000008471704,0.00008863638,0.000006822218,0.000003951523,0.000030736675,0.00002780452,0.008219657,0.00032860128,0.9889331,0.0023448258,0.0000042520232],"about_ca_topic_score_codex":0.0013642352,"about_ca_topic_score_gemma":0.0010513915,"teacher_disagreement_score":0.0030170556,"about_ca_system_score_codex":0.0024675746,"about_ca_system_score_gemma":0.00060887396,"threshold_uncertainty_score":0.017903566},"labels":[],"label_agreement":null},{"id":"W2032099069","doi":"10.1016/j.tcs.2007.10.032","title":"Shuffle operations on discrete paths","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Mathematics; Algorithm; Theoretical computer science; Combinatorics","score_opus":0.008344515457987482,"score_gpt":0.26066202948367323,"score_spread":0.25231751402568575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032099069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3362443,0.0009355627,0.59585136,0.0016281917,0.00062167214,0.0001472298,0.00075375906,0.0010797074,0.06273816],"genre_scores_gemma":[0.86017126,0.0009360491,0.08243472,0.0003692178,0.00032614102,0.00023561755,0.0005732497,0.0003762803,0.05457733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885476,0.00022869569,0.00009347813,0.00030604994,0.00029994728,0.00021710616],"domain_scores_gemma":[0.9963587,0.0020464188,0.00027777662,0.0005897197,0.0002828563,0.00044448054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094719656,0.00068450073,0.00089283544,0.002039149,0.0019358248,0.0037712927,0.0009888578,0.0012236014,0.01290424],"category_scores_gemma":[0.0040131854,0.0006289698,0.0010820888,0.0022664529,0.0035041245,0.010634686,0.003522212,0.0024122626,0.0019242172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005244045,0.000022052547,0.000075006516,0.000022157576,0.000003301319,0.000066125824,0.00022668095,0.00063242926,0.0009611356,0.9907295,0.0004995723,0.0067095454],"study_design_scores_gemma":[0.00001442483,0.000023139442,0.0000547086,0.000006972592,0.0000047673084,0.00009649686,0.00006964501,0.002689296,0.001338836,0.99257976,0.0031100041,0.000011847913],"about_ca_topic_score_codex":0.0003147637,"about_ca_topic_score_gemma":0.00031645468,"teacher_disagreement_score":0.01290424,"about_ca_system_score_codex":0.0009877138,"about_ca_system_score_gemma":0.00076147635,"threshold_uncertainty_score":0.043168962},"labels":[],"label_agreement":null},{"id":"W2032976034","doi":"10.1007/s00224-010-9302-7","title":"On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas","year":2010,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Isomorphism (crystallography); Equivalence (formal languages); Mathematics; Complexity class; Expression (computer science); Class (philosophy); Pure mathematics; Discrete mathematics; Algebra over a field; Combinatorics; Time complexity; Computer science; Crystal structure; Crystallography","score_opus":0.02611519222703439,"score_gpt":0.24483667776386567,"score_spread":0.21872148553683127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032976034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60507715,0.0032203048,0.30054346,0.014248477,0.000283104,0.00019858225,0.0012945696,0.0005471433,0.07458728],"genre_scores_gemma":[0.9665468,0.0009911099,0.022582134,0.0005431774,0.0004688461,0.00018646137,0.0008416853,0.00020944892,0.007630465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9908336,0.00298972,0.00056931755,0.0014702129,0.0028855419,0.0012515379],"domain_scores_gemma":[0.88639647,0.10320483,0.002452642,0.0037934156,0.002544914,0.001607801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005602633,0.0010390374,0.0030377484,0.0031364483,0.0029403944,0.009340002,0.004627585,0.0035117622,0.011683987],"category_scores_gemma":[0.04730951,0.0013494625,0.0027982367,0.0045782193,0.0073574623,0.03936738,0.006572003,0.009437012,0.0007147681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037321224,0.00018641482,0.002502746,0.00020188624,0.00007320759,0.00021970962,0.000993809,0.015598715,0.0010588984,0.9584355,0.0026087817,0.017747123],"study_design_scores_gemma":[0.000035372716,0.00002407526,0.0005523039,0.000017068105,0.000038241848,0.00008676129,0.00012075805,0.038432747,0.0005283766,0.9593852,0.0007561564,0.000022875924],"about_ca_topic_score_codex":0.0034355023,"about_ca_topic_score_gemma":0.002684235,"teacher_disagreement_score":0.011683987,"about_ca_system_score_codex":0.0054098167,"about_ca_system_score_gemma":0.0023626552,"threshold_uncertainty_score":0.03925121},"labels":[],"label_agreement":null},{"id":"W2033362178","doi":"10.1007/s00605-014-0721-4","title":"Acyclic, connected and tree sets","year":2014,"lang":"de","type":"article","venue":"Monatshefte für Mathematik","topic":"semigroups and automata theory","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Word (group theory); Alphabet; Extension (predicate logic); Discrete mathematics; Tree (set theory); Graph; Directed acyclic graph; Set (abstract data type); Computer science","score_opus":0.011750389798368873,"score_gpt":0.24962506048315322,"score_spread":0.23787467068478435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033362178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4955404,0.0029300982,0.39073327,0.0023382443,0.00026296836,0.00013354093,0.0034946245,0.0009211974,0.10364567],"genre_scores_gemma":[0.895177,0.0016859719,0.063678786,0.00049478054,0.00032914616,0.00027253394,0.0030725081,0.00024023688,0.035049096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989812,0.00019639208,0.00009673198,0.00028363435,0.00032020235,0.00012186915],"domain_scores_gemma":[0.994065,0.0042651533,0.00045289227,0.00041190465,0.00043486347,0.00037022273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007654531,0.0006158078,0.0006110205,0.002901807,0.0021053497,0.0040205247,0.001018253,0.0016027525,0.008008561],"category_scores_gemma":[0.006385936,0.00085089356,0.00081177463,0.0031141527,0.002662219,0.0057196016,0.0017856421,0.0017780411,0.00086691603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005554536,0.000026654312,0.0005784456,0.00007604455,0.000013409788,0.00018871369,0.0006620697,0.0025261126,0.0012263,0.98489535,0.0016355626,0.008115879],"study_design_scores_gemma":[0.000012917645,0.00000978196,0.00036716828,0.000017762864,0.000014738885,0.00026002832,0.00015926636,0.0049402644,0.00044261588,0.9890726,0.00469198,0.000010861379],"about_ca_topic_score_codex":0.0016856671,"about_ca_topic_score_gemma":0.0020717226,"teacher_disagreement_score":0.008008561,"about_ca_system_score_codex":0.0011240446,"about_ca_system_score_gemma":0.00073398126,"threshold_uncertainty_score":0.026791334},"labels":[],"label_agreement":null},{"id":"W2033885916","doi":"10.1142/s0218196704001992","title":"PROFINITE TOPOLOGIES IN FREE PRODUCTS OF GROUPS","year":2004,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Profinite group; Free product; Separable space; Quotient; Finitely-generated abelian group; Combinatorics; Topological group; Normal subgroup; Class (philosophy); Product (mathematics); Group (periodic table); Discrete mathematics; Pure mathematics; Topology (electrical circuits); Computer science","score_opus":0.011986014680431324,"score_gpt":0.2587075825680769,"score_spread":0.2467215678876456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033885916","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78358424,0.00404817,0.1296042,0.0019993088,0.00031480263,0.000090859554,0.0006196743,0.00048857566,0.07925014],"genre_scores_gemma":[0.9722334,0.0006144287,0.016880507,0.0001396871,0.00021747696,0.000090903064,0.00034688582,0.00005936073,0.009417382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867296,0.00037114747,0.00012217443,0.00031926943,0.0003236422,0.00019077233],"domain_scores_gemma":[0.9975164,0.0011273513,0.00032072997,0.00027636843,0.00026413114,0.0004951071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017300452,0.0005835173,0.0005289365,0.0016586337,0.0014753304,0.004681327,0.0005799803,0.00079547596,0.0050631897],"category_scores_gemma":[0.0029085085,0.00060391106,0.00074455276,0.0010999888,0.0038626078,0.01093398,0.002901807,0.0011493537,0.0007998645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078065255,0.000016568161,0.0004959839,0.00005293854,0.000008446983,0.00025976106,0.0016799904,0.00056870835,0.0014595335,0.9902559,0.00036223256,0.0047620954],"study_design_scores_gemma":[0.000029719013,0.00006187238,0.0004672691,0.000022275648,0.000013173164,0.00039660247,0.0005289851,0.002739838,0.0014664948,0.9813887,0.0128690945,0.000015954813],"about_ca_topic_score_codex":0.00038501903,"about_ca_topic_score_gemma":0.00035265306,"teacher_disagreement_score":0.0050631897,"about_ca_system_score_codex":0.000880587,"about_ca_system_score_gemma":0.00035561013,"threshold_uncertainty_score":0.01693803},"labels":[],"label_agreement":null},{"id":"W2034376971","doi":"10.1142/s0218196706002998","title":"SUBVARIETIES OF THE VARIETY GENERATED BY THE FIVE-ELEMENT BRANDT SEMIGROUP","year":2006,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Subvariety; Mathematics; Semigroup; Variety (cybernetics); Element (criminal law); Pure mathematics; Set (abstract data type); Algebra over a field; Discrete mathematics; Computer science; Statistics","score_opus":0.004614855934500324,"score_gpt":0.21672886526042498,"score_spread":0.21211400932592467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034376971","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8317638,0.00043175803,0.13449235,0.00018981496,0.000045454002,0.000059743314,0.00042679792,0.00034151823,0.03224881],"genre_scores_gemma":[0.97009295,0.00018625965,0.022932371,0.000029596402,0.000035619305,0.000051670624,0.00073151034,0.0000438758,0.005896105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964464,0.000049297763,0.000019874493,0.0000976496,0.000117189695,0.00007132434],"domain_scores_gemma":[0.9996728,0.00010551379,0.00004473209,0.000046616464,0.000048131467,0.000082233724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038454382,0.0002765932,0.00035022534,0.0012037267,0.00085289247,0.0022061183,0.00037997382,0.00022642444,0.004476144],"category_scores_gemma":[0.0005893877,0.0001907937,0.0005461122,0.00071988965,0.0013282147,0.001934505,0.0008887969,0.00072821695,0.0006313259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031260488,0.00006149014,0.0031075755,0.00006816191,0.000021780705,0.0005464762,0.001113099,0.0031312243,0.018930657,0.94822276,0.00097583816,0.023508368],"study_design_scores_gemma":[0.000057241396,0.00016197536,0.0069711194,0.000038650363,0.000040428047,0.0017255389,0.0009356173,0.025815692,0.029173348,0.91413087,0.020887686,0.000061778075],"about_ca_topic_score_codex":0.00037331966,"about_ca_topic_score_gemma":0.0002963346,"teacher_disagreement_score":0.004476144,"about_ca_system_score_codex":0.00049914187,"about_ca_system_score_gemma":0.0002424683,"threshold_uncertainty_score":0.014974117},"labels":[],"label_agreement":null},{"id":"W2034920294","doi":"10.1016/j.jcss.2005.08.003","title":"The many faces of a translation","year":2005,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal","funders":"","keywords":"Translation (biology); Computer science; Artificial intelligence; Chemistry","score_opus":0.016951275936972193,"score_gpt":0.24134541833644,"score_spread":0.2243941423994678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034920294","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053878047,0.01129065,0.20359702,0.20837063,0.0123241125,0.000084688785,0.00075062964,0.00081854773,0.50888574],"genre_scores_gemma":[0.73215085,0.007522014,0.082185164,0.01776415,0.011078841,0.000338087,0.00060393976,0.0007611207,0.14759585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974819,0.0010380555,0.00017455136,0.0004739495,0.00059141935,0.00024008894],"domain_scores_gemma":[0.99383634,0.0034315302,0.00023565494,0.0013957601,0.00078655843,0.00031410367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002715427,0.00058333215,0.000821961,0.0011687619,0.004979396,0.008243993,0.0010063282,0.0035750975,0.03243307],"category_scores_gemma":[0.014028174,0.0005521749,0.00084339705,0.0013560724,0.011182819,0.022232782,0.004805085,0.0049039163,0.006515168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022133712,0.0000037375728,0.00004691708,0.000021643225,0.0000034412897,0.000058898688,0.00044072457,0.000076263976,0.00016602312,0.9848045,0.0064839125,0.007871754],"study_design_scores_gemma":[0.000008043751,0.000004077156,0.00003515538,0.000019049014,0.0000032957291,0.00008234296,0.00030797807,0.00040700045,0.000098739016,0.9760395,0.022986246,0.000008472713],"about_ca_topic_score_codex":0.0005885659,"about_ca_topic_score_gemma":0.0005163717,"teacher_disagreement_score":0.03243307,"about_ca_system_score_codex":0.0010497001,"about_ca_system_score_gemma":0.0008043507,"threshold_uncertainty_score":0.10849941},"labels":[],"label_agreement":null},{"id":"W2035311548","doi":"10.1007/978-3-642-14455-4_38","title":"The Averaging Trick and the Černý Conjecture","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Conjecture; Artificial intelligence; Discrete mathematics; Mathematics","score_opus":0.006640741697130185,"score_gpt":0.20873273415921692,"score_spread":0.20209199246208673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035311548","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09365198,0.009551458,0.16736221,0.053870466,0.006440561,0.00003511055,0.00037032695,0.0010008435,0.667717],"genre_scores_gemma":[0.88694763,0.003344728,0.020915864,0.007072538,0.0061178654,0.000091885726,0.00031724136,0.00054616004,0.074646115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876285,0.00034498854,0.000054935063,0.00032627338,0.00031783865,0.0001930812],"domain_scores_gemma":[0.99745184,0.0013505492,0.00014527445,0.00067482784,0.00024787404,0.00012953958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018630516,0.000611266,0.0013075168,0.0008588961,0.002279042,0.002598333,0.0012147438,0.0021730112,0.010291235],"category_scores_gemma":[0.007429705,0.00047138977,0.00093747844,0.0008667426,0.006376793,0.013317452,0.0030547292,0.0055488013,0.0020435727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017046275,0.0000067969327,0.0000529756,0.000022293978,0.0000024973513,0.000026318827,0.00005254299,0.00021871252,0.00010555902,0.99103886,0.0044176322,0.0040386007],"study_design_scores_gemma":[0.0000045581305,0.00000218695,0.000039922965,0.0000051560814,0.0000014664716,0.000028405842,0.000010585111,0.0005808555,0.00007876761,0.9956762,0.003568747,0.0000031892364],"about_ca_topic_score_codex":0.00070850604,"about_ca_topic_score_gemma":0.00069200364,"teacher_disagreement_score":0.010291235,"about_ca_system_score_codex":0.0011247982,"about_ca_system_score_gemma":0.0006150951,"threshold_uncertainty_score":0.034427643},"labels":[],"label_agreement":null},{"id":"W2036162092","doi":"10.1016/s0304-3975(00)00063-3","title":"Repetitions in Sturmian strings","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Fibonacci number; Sequence (biology); Prefix; Reduction (mathematics); String (physics); Combinatorics; Discrete mathematics; Simple (philosophy); Integer (computer science); Exponent; Algorithm; Computer science","score_opus":0.005278285371736694,"score_gpt":0.2255655579966955,"score_spread":0.2202872726249588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036162092","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7342352,0.0012399468,0.17716584,0.0015859054,0.00042643806,0.000069056085,0.00033878558,0.00138605,0.08355276],"genre_scores_gemma":[0.96259,0.0002627172,0.020000283,0.00029801234,0.00024958872,0.00008473077,0.00020850815,0.00021156801,0.01609454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981781,0.0006819301,0.00015637846,0.00034032378,0.00042886188,0.00021441774],"domain_scores_gemma":[0.993544,0.004965652,0.00041329733,0.0005475174,0.00030607943,0.0002234199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011655082,0.0004913105,0.0010663794,0.0017366746,0.002009118,0.0024781288,0.0010625903,0.0021787009,0.007624806],"category_scores_gemma":[0.006487372,0.0008263304,0.0011413818,0.0019018096,0.002866544,0.0045633446,0.0017099915,0.0019764728,0.0014783491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009963823,0.000025517566,0.00035287274,0.0000716323,0.000011013007,0.00043712195,0.0010114304,0.0014549611,0.0029343383,0.98402137,0.00092699385,0.008653039],"study_design_scores_gemma":[0.000022564136,0.000036849262,0.00026902364,0.000018336188,0.00001581343,0.00038513113,0.000091289985,0.0056725047,0.0016401958,0.98984516,0.0019802423,0.000022929788],"about_ca_topic_score_codex":0.00036294488,"about_ca_topic_score_gemma":0.00045121988,"teacher_disagreement_score":0.007624806,"about_ca_system_score_codex":0.0007884638,"about_ca_system_score_gemma":0.00034013184,"threshold_uncertainty_score":0.02550751},"labels":[],"label_agreement":null},{"id":"W2036328331","doi":"10.1016/j.disc.2004.12.004","title":"Self-generating sets, integers with missing blocks, and substitutions","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Sequence (biology); Discrete mathematics; Integer sequence; Enumeration; Generating function; Computer science","score_opus":0.010716206607207889,"score_gpt":0.23314440528652391,"score_spread":0.222428198679316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036328331","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44021395,0.009736607,0.4348954,0.0050586616,0.001029106,0.00010348791,0.0005307266,0.0007221752,0.10770994],"genre_scores_gemma":[0.9240777,0.0017856205,0.054497965,0.0005136044,0.00045594043,0.00012694996,0.00037231517,0.00012238664,0.018047607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904317,0.00036129577,0.000092094975,0.00018240964,0.00020123066,0.000119823424],"domain_scores_gemma":[0.9959447,0.0027275898,0.0003941603,0.00052456546,0.00020827758,0.00020070876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015006391,0.0004806036,0.00071111077,0.0014332229,0.0016787844,0.0025076976,0.00097432884,0.0011892568,0.0036179675],"category_scores_gemma":[0.005677793,0.00052396295,0.000691942,0.0015941521,0.0044057146,0.005714885,0.0016893399,0.0017227142,0.0006812097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003785702,0.000016446793,0.00022315254,0.00003550956,0.000003488801,0.00006560516,0.00031279915,0.0007652004,0.00046035007,0.99033946,0.0007869685,0.0069532106],"study_design_scores_gemma":[0.000009009398,0.000009234245,0.00006343182,0.000010571315,0.0000061543265,0.00011318001,0.00007865204,0.001701274,0.00034053283,0.99508804,0.0025730948,0.000006815298],"about_ca_topic_score_codex":0.0005205557,"about_ca_topic_score_gemma":0.0006739175,"teacher_disagreement_score":0.0036179675,"about_ca_system_score_codex":0.0008349685,"about_ca_system_score_gemma":0.00060086016,"threshold_uncertainty_score":0.012103319},"labels":[],"label_agreement":null},{"id":"W2036576396","doi":"10.1016/j.disc.2014.01.002","title":"Extremal words in morphic subshifts","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Word (group theory); Lexicographical order; Mathematics; Morphism; Closure (psychology); Combinatorics; Alphabet; Simple (philosophy); Binary number; Discrete mathematics; Arithmetic; Linguistics","score_opus":0.012280867258995631,"score_gpt":0.230111695002526,"score_spread":0.21783082774353038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036576396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81939286,0.00088810443,0.13363013,0.0008706106,0.00025932293,0.00004406831,0.00027525052,0.00055388897,0.04408573],"genre_scores_gemma":[0.981979,0.00013477959,0.009222023,0.00008802469,0.00009372216,0.00002674673,0.000117010124,0.00009800534,0.008240652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991898,0.00016140573,0.000077405144,0.00020966785,0.00018595003,0.00017576825],"domain_scores_gemma":[0.9985234,0.00067961897,0.00022602896,0.00016300543,0.00019000284,0.00021791414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005818132,0.000522304,0.0008505166,0.0021028887,0.0018292852,0.0030568647,0.00075725355,0.0012297285,0.007007388],"category_scores_gemma":[0.002625401,0.0006242364,0.00071014906,0.0013428982,0.0029871191,0.0046228496,0.0021165381,0.0015724861,0.0006748703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007688641,0.0000138342675,0.00033457417,0.000028167105,0.0000068843374,0.000197104,0.00047002226,0.00071675854,0.001621846,0.9919647,0.0003877246,0.004181454],"study_design_scores_gemma":[0.00001669269,0.000023735869,0.0003533312,0.000011068943,0.000012273546,0.00020454136,0.00031602947,0.0034013235,0.0010881255,0.99282396,0.0017338792,0.0000150208925],"about_ca_topic_score_codex":0.00041637282,"about_ca_topic_score_gemma":0.0005723848,"teacher_disagreement_score":0.007007388,"about_ca_system_score_codex":0.0010174143,"about_ca_system_score_gemma":0.0002814152,"threshold_uncertainty_score":0.02344203},"labels":[],"label_agreement":null},{"id":"W2037269616","doi":"10.1016/j.aim.2007.12.001","title":"Möbius functions and semigroup representation theory II: Character formulas and multiplicities","year":2008,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Semigroup; Character (mathematics); Idempotence; Irreducible representation; Pure mathematics; Representation theory; Special classes of semigroups; Bicyclic semigroup; Inverse; Representation (politics); Combinatorics","score_opus":0.014742891250432528,"score_gpt":0.2537533366990527,"score_spread":0.23901044544862018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037269616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31933,0.011968384,0.4834723,0.013519563,0.0015108412,0.00007239624,0.0003034396,0.00041874504,0.16940442],"genre_scores_gemma":[0.94810474,0.0020190296,0.020880627,0.00064202916,0.0012015223,0.00009718126,0.00012573742,0.00009967997,0.026829455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994593,0.00019014756,0.000032945085,0.00011675749,0.00011988558,0.000080853875],"domain_scores_gemma":[0.9979771,0.0013218656,0.00018145822,0.00017094822,0.00022127385,0.00012745708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011266174,0.00085369294,0.0008550651,0.0017241333,0.001402513,0.0044944636,0.0010576647,0.0015755796,0.00540918],"category_scores_gemma":[0.004725789,0.0005091315,0.0006607846,0.0019077192,0.0044114515,0.007909301,0.0020699431,0.003433805,0.0007459256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010378558,0.0000064368105,0.000066025365,0.00001533056,0.0000021819446,0.000024679006,0.00020174397,0.00016437747,0.00024034077,0.9957476,0.0005152985,0.0030056497],"study_design_scores_gemma":[0.0000042281613,0.00000636008,0.00005713857,0.000007986995,0.000003920017,0.00005960211,0.00007037688,0.0012315759,0.00021638919,0.99677783,0.0015587059,0.000005876702],"about_ca_topic_score_codex":0.00058045506,"about_ca_topic_score_gemma":0.00034252537,"teacher_disagreement_score":0.00540918,"about_ca_system_score_codex":0.0013602076,"about_ca_system_score_gemma":0.00069697655,"threshold_uncertainty_score":0.018095493},"labels":[],"label_agreement":null},{"id":"W2037840685","doi":"10.1142/s0218196706003177","title":"COMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITY","year":2006,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Semigroup; Type (biology); Pure mathematics; Discrete mathematics; Algebra over a field","score_opus":0.02678779521546516,"score_gpt":0.2609105961594294,"score_spread":0.23412280094396426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037840685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7102164,0.001186937,0.19038707,0.0026212027,0.00037202737,0.000117638054,0.00036474506,0.00070546294,0.09402856],"genre_scores_gemma":[0.9839802,0.00023100509,0.0080319345,0.00016415415,0.00018886334,0.00010052137,0.00015671886,0.000060467773,0.007086207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832064,0.00024665162,0.00012157643,0.00044285523,0.00051168504,0.00035645504],"domain_scores_gemma":[0.99247825,0.003769572,0.00071764784,0.0013166938,0.0005836809,0.0011341322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013613806,0.0005806922,0.0010035837,0.0013324489,0.0022660173,0.003604788,0.0008569346,0.0010768895,0.0063884603],"category_scores_gemma":[0.005012843,0.00045359303,0.0012514157,0.00094965176,0.006480369,0.011851993,0.004280598,0.0034565197,0.0006215693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013398592,0.000030727486,0.0016903239,0.000074680655,0.000014603638,0.0002439031,0.0007940285,0.0011480853,0.0028933536,0.9866219,0.000859458,0.005494892],"study_design_scores_gemma":[0.00006119864,0.00013568037,0.001970966,0.000026531037,0.000036860176,0.00045730898,0.000698461,0.006311911,0.005989643,0.97705305,0.00721273,0.000045689027],"about_ca_topic_score_codex":0.00059062993,"about_ca_topic_score_gemma":0.00039131142,"teacher_disagreement_score":0.0063884603,"about_ca_system_score_codex":0.0011193143,"about_ca_system_score_gemma":0.0005526387,"threshold_uncertainty_score":0.021371484},"labels":[],"label_agreement":null},{"id":"W2037872771","doi":"10.1016/s0304-3975(00)00292-9","title":"Minimal cover-automata for finite languages","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Deterministic automaton; Deterministic finite automaton; Nondeterministic finite automaton; Cover (algebra); Two-way deterministic finite automaton; Büchi automaton; DFA minimization; ω-automaton; Regular language; Quantum finite automata; Finite-state machine; Nested word; Automaton; Mathematics; Discrete mathematics; Computer science; Timed automaton; Automata theory; Theoretical computer science; Algorithm","score_opus":0.010884254074289303,"score_gpt":0.26593739130814764,"score_spread":0.25505313723385836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037872771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31252116,0.003507225,0.6133115,0.004274701,0.00031904547,0.00019133446,0.002053621,0.0022200055,0.061601333],"genre_scores_gemma":[0.9179646,0.000933816,0.06260452,0.00045723817,0.0003987619,0.00034079058,0.0023374206,0.00037165667,0.014591294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986602,0.00027696544,0.00009828229,0.0003225842,0.00043577433,0.0002061214],"domain_scores_gemma":[0.9937237,0.0047809985,0.00028129586,0.00048444467,0.00037093784,0.0003586038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009460466,0.0009874104,0.001682845,0.0018621561,0.0028802524,0.0044868444,0.001537513,0.0020423555,0.008827207],"category_scores_gemma":[0.004923667,0.0010994398,0.0020528282,0.0019126311,0.0029392694,0.008575628,0.0027065985,0.0036088615,0.0010827736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001225765,0.00004471388,0.00038865657,0.000114715825,0.000029158322,0.00016723799,0.0009094427,0.002699685,0.0018590593,0.9827291,0.002038885,0.00889665],"study_design_scores_gemma":[0.0000173487,0.000011201568,0.00010781935,0.000011708016,0.00001675705,0.000072816525,0.000074971795,0.007618218,0.0005443098,0.98976386,0.0017513965,0.000009596938],"about_ca_topic_score_codex":0.0013472211,"about_ca_topic_score_gemma":0.001888459,"teacher_disagreement_score":0.008827207,"about_ca_system_score_codex":0.0021348677,"about_ca_system_score_gemma":0.0009888456,"threshold_uncertainty_score":0.02952993},"labels":[],"label_agreement":null},{"id":"W2039091701","doi":"10.1016/s0304-3975(02)00746-6","title":"A note on differentiable palindromes","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Differentiable function; Mathematics; Palindrome; Combinatorics; Discrete mathematics; Pure mathematics; Genetics; Biology; Genome","score_opus":0.008319133653806859,"score_gpt":0.23765318785784942,"score_spread":0.22933405420404257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039091701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12925634,0.013741808,0.564107,0.013724499,0.00789945,0.000055748696,0.0004834638,0.00093635335,0.26979536],"genre_scores_gemma":[0.7620702,0.010307642,0.12870929,0.0029228944,0.004325113,0.00008751636,0.00029999108,0.00062530785,0.09065208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996284,0.00009196816,0.000027599657,0.00010622747,0.000101171536,0.000044542678],"domain_scores_gemma":[0.9986274,0.0008474993,0.000061745886,0.00025533861,0.000094898984,0.00011314397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074175897,0.00067185005,0.0009634914,0.0010157853,0.001369259,0.0017555142,0.0012076222,0.0015792045,0.009321741],"category_scores_gemma":[0.0028225537,0.00046054073,0.0009655613,0.00147149,0.0026137838,0.0070781847,0.002464289,0.004643882,0.0012797645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021525897,0.000010675184,0.00006533546,0.000047723457,0.0000032566043,0.00016392062,0.00011312061,0.00044340888,0.0009638838,0.9842516,0.002214818,0.011700749],"study_design_scores_gemma":[0.000006181303,0.000026771553,0.000091082446,0.000017109609,0.000006318939,0.00022759616,0.0000418711,0.0021457046,0.0006253266,0.9782063,0.018595539,0.0000101459955],"about_ca_topic_score_codex":0.0003356031,"about_ca_topic_score_gemma":0.00046508448,"teacher_disagreement_score":0.009321741,"about_ca_system_score_codex":0.00072727655,"about_ca_system_score_gemma":0.00029181014,"threshold_uncertainty_score":0.031184375},"labels":[],"label_agreement":null},{"id":"W2039338734","doi":"10.1016/j.jnt.2006.02.003","title":"Comments on the spectra of Pisot numbers","year":2006,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Spectral line; Pure mathematics; Combinatorics; Physics","score_opus":0.008628768251949219,"score_gpt":0.22663085071578523,"score_spread":0.218002082463836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039338734","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011827879,0.0038859642,0.0016131195,0.8937183,0.06935813,0.000018357598,0.0003037652,0.00011587254,0.029803602],"genre_scores_gemma":[0.0628412,0.008375289,0.002266703,0.62321836,0.22355151,0.00013121155,0.0003328649,0.00043280737,0.07885007],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99639857,0.00088986865,0.00027416993,0.0005704418,0.0015172027,0.00034975522],"domain_scores_gemma":[0.97426593,0.01565054,0.0013092262,0.0011034419,0.0067772553,0.00089357066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043961247,0.00097216223,0.0008846241,0.002035866,0.003568852,0.0027088353,0.003141335,0.010108521,0.022833258],"category_scores_gemma":[0.031743824,0.000535225,0.0010148764,0.0018894002,0.005627012,0.007987953,0.0021927352,0.011014714,0.008208195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068656234,0.0000087388225,0.00012133816,0.00014663505,0.0000084683825,0.00027427083,0.0003474955,0.00012355235,0.0002115606,0.06768478,0.9271118,0.0038926802],"study_design_scores_gemma":[0.000038994127,0.000016881728,0.0008060803,0.0002414745,0.000013806784,0.00029477922,0.00034866564,0.00029465245,0.00037320168,0.06423307,0.93329453,0.00004388406],"about_ca_topic_score_codex":0.0068605314,"about_ca_topic_score_gemma":0.0033267855,"teacher_disagreement_score":0.022833258,"about_ca_system_score_codex":0.002810137,"about_ca_system_score_gemma":0.001251641,"threshold_uncertainty_score":0.07638484},"labels":[],"label_agreement":null},{"id":"W2039994929","doi":"10.1080/00927870701451375","title":"Complete Congruences on the Lattice of Rees–Sushkevich Varieties","year":2007,"lang":"en","type":"article","venue":"Communications in Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Aperiodic graph; Mathematics; Congruence relation; Lattice (music); Endomorphism; Simple (philosophy); Exponent; Pure mathematics; Congruence (geometry); Combinatorics; Geometry","score_opus":0.05609291627475321,"score_gpt":0.30326775666361144,"score_spread":0.24717484038885823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039994929","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8492465,0.0016714586,0.072630785,0.00068361935,0.00023593797,0.00009019341,0.00036904903,0.00017578962,0.07489665],"genre_scores_gemma":[0.96371067,0.000512512,0.021727448,0.00011198145,0.00034604344,0.000096433934,0.00041398243,0.00004865614,0.013032221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983789,0.0003302141,0.00011271199,0.0003090561,0.00060328946,0.00026586844],"domain_scores_gemma":[0.99856937,0.00039090903,0.00022551097,0.00011883208,0.00026934998,0.00042597347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013060644,0.0004895535,0.0007367865,0.0015045109,0.0017164832,0.0030412613,0.00056576566,0.00036297433,0.0031478042],"category_scores_gemma":[0.0018081943,0.00035268968,0.00074308476,0.000906897,0.0035670567,0.0033463403,0.0018153285,0.0012317911,0.0005809349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006284898,0.000034433673,0.0004227083,0.000025634215,0.0000068265363,0.00017663302,0.0006100962,0.00084765936,0.0030745016,0.9908698,0.00036617488,0.0035026427],"study_design_scores_gemma":[0.00007030889,0.000092506765,0.0010863867,0.000021863048,0.000009375457,0.00036264348,0.0007183903,0.004858008,0.0028413525,0.97981906,0.010087794,0.00003232123],"about_ca_topic_score_codex":0.00078927685,"about_ca_topic_score_gemma":0.00073366135,"teacher_disagreement_score":0.0031478042,"about_ca_system_score_codex":0.0010656344,"about_ca_system_score_gemma":0.0006630367,"threshold_uncertainty_score":0.010530472},"labels":[],"label_agreement":null},{"id":"W2040106564","doi":"10.3233/fi-2011-519","title":"Transformations Between Different Models of Unranked Bottom-Up Tree Automata","year":2011,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada; Queen's University","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Nondeterministic algorithm; Automaton; Tree (set theory); Tree automaton; Computer science; Theoretical computer science; Nondeterministic finite automaton; Computation; State (computer science); Deterministic automaton; Mathematics; Combinatorics; Automata theory; Algorithm","score_opus":0.0559662170445804,"score_gpt":0.2406667216710299,"score_spread":0.1847005046264495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040106564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2642093,0.00033173084,0.7028442,0.0005290448,0.00026958485,0.00015085441,0.0004877093,0.0015152886,0.029662332],"genre_scores_gemma":[0.9272954,0.00014703324,0.06472909,0.00012840414,0.00007225268,0.000128275,0.00044367052,0.0002747304,0.0067812097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980081,0.0004474587,0.0001883425,0.00038633007,0.0006674737,0.00030236228],"domain_scores_gemma":[0.99684036,0.0014301876,0.0002863103,0.0008795603,0.00037267973,0.0001909571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009127363,0.00056537834,0.00056783773,0.0008796305,0.00092095387,0.003235671,0.0012719557,0.0010523238,0.007859406],"category_scores_gemma":[0.0050798105,0.00041409262,0.0018641859,0.0008096529,0.0021914335,0.0064493245,0.0020223535,0.0020430293,0.00097038684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007092432,0.00005498406,0.0002704506,0.000057591646,0.000021200569,0.0003792359,0.00040813544,0.02349182,0.0048296587,0.9608497,0.0006208898,0.008945449],"study_design_scores_gemma":[0.000019555511,0.000037876565,0.00012822745,0.000014212507,0.00001861725,0.00010136073,0.00008485741,0.08878688,0.0050176918,0.9036835,0.002083731,0.000023475097],"about_ca_topic_score_codex":0.00085837947,"about_ca_topic_score_gemma":0.00095960376,"teacher_disagreement_score":0.007859406,"about_ca_system_score_codex":0.001093043,"about_ca_system_score_gemma":0.00059219694,"threshold_uncertainty_score":0.026292324},"labels":[],"label_agreement":null},{"id":"W2040684427","doi":"10.1142/s0218196710005650","title":"A PROFINITE APPROACH TO STABLE PAIRS","year":2010,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Aperiodic graph; Mathematics; Decidability; Pure mathematics; Idempotence; Profinite group; Combinatorics; Algebra over a field; Discrete mathematics; Group (periodic table)","score_opus":0.010339373780069298,"score_gpt":0.25179290970645424,"score_spread":0.24145353592638494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040684427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0110338805,0.0018305364,0.93012166,0.0017755829,0.00044062993,0.00010733081,0.0002969448,0.0007640292,0.053629365],"genre_scores_gemma":[0.5096229,0.0043077595,0.45104828,0.0022313776,0.0020359838,0.0005662648,0.000706803,0.0004142131,0.029066427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822074,0.00042119622,0.00015744881,0.00042813257,0.00058886874,0.00018358282],"domain_scores_gemma":[0.99633336,0.0020962737,0.00018583234,0.00044104902,0.00071279693,0.00023061442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029035637,0.0011032142,0.0006328841,0.0028852758,0.00218707,0.003117426,0.0016035639,0.0012441019,0.011300075],"category_scores_gemma":[0.004249911,0.00079613,0.0018299774,0.0013303777,0.003909086,0.010265536,0.003642256,0.005198346,0.0026794688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001465144,0.00002448248,0.000099659344,0.000094162024,0.0000061895444,0.00016511125,0.000283421,0.00044483176,0.0014745716,0.98500174,0.0011555968,0.011235518],"study_design_scores_gemma":[0.000009879714,0.000045211513,0.00009347001,0.000039352584,0.000015206857,0.00041274188,0.00008231905,0.003885793,0.0030691552,0.9707182,0.021603756,0.000024807485],"about_ca_topic_score_codex":0.00045732595,"about_ca_topic_score_gemma":0.00040686136,"teacher_disagreement_score":0.011300075,"about_ca_system_score_codex":0.0011295484,"about_ca_system_score_gemma":0.00063472864,"threshold_uncertainty_score":0.037802577},"labels":[],"label_agreement":null},{"id":"W2041354954","doi":"10.1007/s00224-005-1263-x","title":"Algebraic Results on Quantum Automata","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Sherbrooke; University of Waterloo","funders":"","keywords":"Class (philosophy); Automaton; Construct (python library); Quantum finite automata; Algebraic number; Computer science; Algebraic theory; Quantum; Algebra over a field; Cellular automaton; Quantum cellular automaton; Regular language; Theoretical computer science; Boolean function; Discrete mathematics; Mathematics; Automata theory; Pure mathematics; Programming language; Algorithm; Artificial intelligence; Physics; Quantum mechanics","score_opus":0.018560839364263417,"score_gpt":0.2465511724309238,"score_spread":0.2279903330666604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041354954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13575166,0.010358496,0.43035024,0.015882457,0.0029474853,0.00013477003,0.00092348555,0.00059485505,0.40305662],"genre_scores_gemma":[0.90168166,0.0056073642,0.04250741,0.0022612424,0.0040860362,0.00025941955,0.0005695635,0.00024508304,0.0427822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980965,0.00046539743,0.00012204465,0.00037064592,0.0007258297,0.00021956518],"domain_scores_gemma":[0.99521255,0.0029066692,0.00023794213,0.0005047807,0.0007763768,0.00036161178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018648622,0.0010322867,0.0017051558,0.0035796764,0.0040832134,0.004912531,0.0017990873,0.0015089895,0.0109402435],"category_scores_gemma":[0.005104671,0.00086132606,0.0017562547,0.0035188743,0.0074540186,0.0137935495,0.004033673,0.0053750174,0.0011526012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004384145,0.000006192289,0.000020385458,0.000014163401,0.0000021747244,0.000007173672,0.00005871865,0.00017089253,0.00006059859,0.99851626,0.00040424115,0.0007348131],"study_design_scores_gemma":[0.000005752952,0.0000032468954,0.000034110333,0.0000044213184,0.000003955915,0.00001001672,0.000019030704,0.00095624436,0.00005894923,0.9968887,0.002011306,0.000004250736],"about_ca_topic_score_codex":0.0021507998,"about_ca_topic_score_gemma":0.0015505899,"teacher_disagreement_score":0.0109402435,"about_ca_system_score_codex":0.003594064,"about_ca_system_score_gemma":0.0013593523,"threshold_uncertainty_score":0.0365988},"labels":[],"label_agreement":null},{"id":"W2041550783","doi":"10.1007/s00233-006-0644-z","title":"Sequentially Injective Hull of Acts Over Idempotent Semigroups","year":2006,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Wilfrid Laurier University","keywords":"Monomorphism; Injective function; Mathematics; Idempotence; Semigroup; Hull; Pure mathematics; Algebra over a field; Combinatorics","score_opus":0.0036107636998750255,"score_gpt":0.20272450411826548,"score_spread":0.19911374041839044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041550783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5572027,0.0010264678,0.34447348,0.0007242816,0.00041646967,0.00009328433,0.0010589933,0.0015160143,0.09348827],"genre_scores_gemma":[0.9360269,0.00044759834,0.02300067,0.000104382685,0.0002592913,0.00008417386,0.0008807916,0.00026709534,0.038929135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845004,0.00029008827,0.0001226085,0.00032063425,0.000441249,0.0003753751],"domain_scores_gemma":[0.99546164,0.0022502923,0.000369069,0.00043164773,0.0005410808,0.0009461777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016688505,0.0009657793,0.0009036305,0.0026367402,0.0021271058,0.0050914395,0.00093034445,0.0007708656,0.0089822365],"category_scores_gemma":[0.0036054065,0.000776489,0.0010952872,0.0013906508,0.0024953873,0.00949118,0.0031535642,0.0022369174,0.0016775533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003372621,0.000083300096,0.00059923984,0.00006390764,0.000016581065,0.00048711995,0.0014274681,0.0007154252,0.0047491966,0.9790415,0.0010293564,0.011449565],"study_design_scores_gemma":[0.000054431264,0.00018540537,0.001101237,0.00003829714,0.000043899978,0.0007126115,0.00085569953,0.0060405633,0.011138687,0.9670647,0.0127103925,0.00005417435],"about_ca_topic_score_codex":0.00046050118,"about_ca_topic_score_gemma":0.00045135902,"teacher_disagreement_score":0.0089822365,"about_ca_system_score_codex":0.0008957505,"about_ca_system_score_gemma":0.00072177185,"threshold_uncertainty_score":0.030048609},"labels":[],"label_agreement":null},{"id":"W2041801901","doi":"10.1016/j.tcs.2007.11.020","title":"Another proof of Soittola’s theorem","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Mathematical proof; Formal power series; Analytic proof; Power series; Discrete mathematics; Algebraic number; Formal proof; Series (stratigraphy); Algebra over a field; Pure mathematics; Calculus (dental); Mathematical analysis","score_opus":0.008936159004620844,"score_gpt":0.24335869651830644,"score_spread":0.23442253751368558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041801901","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029825792,0.004021012,0.4412382,0.046824884,0.009349313,0.00018444733,0.00089127646,0.0019957488,0.46566936],"genre_scores_gemma":[0.63399786,0.0045507574,0.18462962,0.015126878,0.0033855368,0.0005507188,0.00096787454,0.00095494866,0.1558358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908745,0.0001920998,0.000048072427,0.00022603114,0.00028252465,0.00016379522],"domain_scores_gemma":[0.9977848,0.0010045781,0.000096310985,0.00031341176,0.0006109217,0.00018995014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015793098,0.0011493592,0.00089705986,0.0022709903,0.0032004516,0.0023119664,0.0017851016,0.0017872151,0.025070237],"category_scores_gemma":[0.0051738042,0.00049534277,0.002031602,0.0018436699,0.003335434,0.006518271,0.0040474585,0.004032539,0.0034167059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060522947,0.00003579262,0.00018731112,0.00014481932,0.000027476883,0.00018975638,0.00047721356,0.00032878123,0.0013540199,0.9643332,0.018812796,0.014048289],"study_design_scores_gemma":[0.000059762584,0.000035037752,0.0004343985,0.00005573238,0.000043229305,0.0003697586,0.00015348573,0.0025252865,0.0023759063,0.88204706,0.11186482,0.000035503715],"about_ca_topic_score_codex":0.001567441,"about_ca_topic_score_gemma":0.0012051522,"teacher_disagreement_score":0.025070237,"about_ca_system_score_codex":0.001358447,"about_ca_system_score_gemma":0.00094634865,"threshold_uncertainty_score":0.083868325},"labels":[],"label_agreement":null},{"id":"W2043257491","doi":"10.1007/s11225-005-5057-6","title":"An application of a Theorem of Ash to finite covers","year":2004,"lang":"en","type":"article","venue":"Studia Logica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Semigroup; Inverse semigroup; Unary operation; Pure mathematics; Special classes of semigroups; Group (periodic table); Structured program theorem; Cancellative semigroup; Krohn–Rhodes theory; Subalgebra; Discrete mathematics; Algebra over a field","score_opus":0.011128717335233984,"score_gpt":0.25238099070918846,"score_spread":0.24125227337395447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043257491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065871805,0.007228128,0.6937968,0.015875388,0.0038209711,0.000112806076,0.00060709193,0.00079755427,0.21188949],"genre_scores_gemma":[0.76052517,0.008275992,0.13912499,0.00551226,0.0067449827,0.00035005942,0.00075987726,0.00072397303,0.07798274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882346,0.00026182237,0.00006980455,0.0003413004,0.00035180445,0.00015180599],"domain_scores_gemma":[0.99656576,0.0022592072,0.00011040605,0.00041371802,0.00041063683,0.00024025213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015829215,0.00096941524,0.0015276268,0.0036152694,0.0030704367,0.0033512788,0.0016285039,0.0019146512,0.010912667],"category_scores_gemma":[0.006268019,0.00085843547,0.003162652,0.0032453355,0.004936856,0.012500525,0.0077085453,0.005253456,0.0011003719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002058407,0.000014130221,0.00018080922,0.00006274162,0.000018732539,0.000084253465,0.00024512692,0.00057228626,0.0006121167,0.9866297,0.0024004015,0.0091591645],"study_design_scores_gemma":[0.000008931071,0.000013577785,0.00020300444,0.000014006985,0.000022448214,0.00013345022,0.000051717994,0.0025907974,0.00041881693,0.98552275,0.011011488,0.000009011752],"about_ca_topic_score_codex":0.0015845523,"about_ca_topic_score_gemma":0.001161015,"teacher_disagreement_score":0.010912667,"about_ca_system_score_codex":0.0020337657,"about_ca_system_score_gemma":0.0006900221,"threshold_uncertainty_score":0.036506474},"labels":[],"label_agreement":null},{"id":"W2043304636","doi":"10.1016/j.tcs.2007.04.004","title":"On a zeta function associated with automata and codes","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Simplicity; Automaton; Function (biology); Riemann zeta function; Zero (linguistics); Discrete mathematics; Word (group theory); Combinatorics; Cellular automaton; Pure mathematics; Algorithm; Computer science; Physics; Theoretical computer science; Geometry; Quantum mechanics","score_opus":0.006311545731731295,"score_gpt":0.2193332548910603,"score_spread":0.213021709159329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043304636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6481373,0.0015153248,0.25940606,0.005094147,0.001233778,0.00007762832,0.00032013305,0.00047292744,0.08374276],"genre_scores_gemma":[0.96007144,0.0008453467,0.011293346,0.00042479593,0.00095334835,0.00010078218,0.00018584915,0.00022252143,0.025902515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991147,0.00023897055,0.000045342,0.00016174924,0.00021744554,0.00022174443],"domain_scores_gemma":[0.9953198,0.0027242685,0.00037066688,0.00027466405,0.00045581156,0.00085475435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001541634,0.0013974328,0.001475296,0.0048133396,0.00332819,0.0050869635,0.001388801,0.0019998462,0.007580067],"category_scores_gemma":[0.0072679846,0.00058022304,0.0011627937,0.0029514437,0.005229422,0.0076293685,0.00459428,0.003452513,0.0013857195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038252805,0.000013160342,0.00015704168,0.000016961698,0.0000046066257,0.000067709436,0.00019090722,0.00050903735,0.00040393634,0.9957534,0.00048442621,0.0023606098],"study_design_scores_gemma":[0.000013647445,0.0000113927035,0.00008883412,0.0000123585505,0.000006405469,0.000084065956,0.00006700891,0.003668896,0.00020521843,0.99492645,0.00090285135,0.000012817886],"about_ca_topic_score_codex":0.0008512509,"about_ca_topic_score_gemma":0.0005220576,"teacher_disagreement_score":0.007580067,"about_ca_system_score_codex":0.002009031,"about_ca_system_score_gemma":0.0008362545,"threshold_uncertainty_score":0.025357842},"labels":[],"label_agreement":null},{"id":"W2044138171","doi":"10.1016/j.jcta.2005.08.004","title":"Möbius functions and semigroup representation theory","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Semilattice; Mathematics; Semigroup; Inverse semigroup; Krohn–Rhodes theory; Pure mathematics; Algebra over a field; Representation (politics); Bicyclic semigroup; Inverse; Product (mathematics); Representation theory; Eigenvalues and eigenvectors; Matrix (chemical analysis); Special classes of semigroups","score_opus":0.008332151884208635,"score_gpt":0.23615552530717582,"score_spread":0.22782337342296718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044138171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32947427,0.022383789,0.34315252,0.024301982,0.0026997584,0.000062259904,0.0004776497,0.00059244543,0.27685535],"genre_scores_gemma":[0.94255656,0.0034250026,0.016863195,0.00082028634,0.0017954357,0.000088214576,0.00017942685,0.00009344725,0.034178406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993882,0.00023629799,0.000036719175,0.00010249863,0.00014259326,0.000093691415],"domain_scores_gemma":[0.9976484,0.0016147381,0.0001648946,0.00019922988,0.00022876632,0.00014391556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012668655,0.0006810166,0.0011035117,0.0022365917,0.0020701045,0.00437149,0.0009077473,0.0016091918,0.0071613304],"category_scores_gemma":[0.004121486,0.0005636767,0.0007989659,0.0022000482,0.005255343,0.007533314,0.0015894882,0.00331664,0.00083776703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062681197,0.000004741552,0.00003202726,0.000008105556,0.0000014909486,0.000011412889,0.00011309477,0.00014784605,0.00008568072,0.99765176,0.00038405988,0.001553511],"study_design_scores_gemma":[0.000004322232,0.0000030750282,0.000030628282,0.00000397161,0.0000018712063,0.000022847586,0.00002718009,0.00061130134,0.000052077812,0.99771523,0.0015235574,0.000003961019],"about_ca_topic_score_codex":0.0008596232,"about_ca_topic_score_gemma":0.00067960354,"teacher_disagreement_score":0.0071613304,"about_ca_system_score_codex":0.0018742809,"about_ca_system_score_gemma":0.00077233504,"threshold_uncertainty_score":0.023957014},"labels":[],"label_agreement":null},{"id":"W2044722214","doi":"10.1137/s0097539700369156","title":"The Efficiency of Resolution and Davis--Putnam Procedures","year":2002,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"semigroups and automata theory","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Pigeonhole principle; Mathematical proof; Resolution (logic); Mathematics; Class (philosophy); True quantified Boolean formula; Combinatorics; Discrete mathematics; Upper and lower bounds; Simple (philosophy); Conjunctive normal form; Binary logarithm; Satisfiability; Algorithm; Computer science","score_opus":0.012382062135946685,"score_gpt":0.2277696652962964,"score_spread":0.2153876031603497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044722214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15018663,0.0019771662,0.82000333,0.0027397652,0.00009993261,0.0004930202,0.00041289147,0.0026876372,0.02139957],"genre_scores_gemma":[0.599511,0.000793856,0.39304173,0.0006773879,0.00009044449,0.00053669745,0.0005335561,0.00065086037,0.0041645016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9822687,0.0069785817,0.0010126671,0.0031745322,0.0048840116,0.0016815182],"domain_scores_gemma":[0.901414,0.07960596,0.004047791,0.011811912,0.0023785685,0.00074182724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012764997,0.0012431543,0.0018459951,0.0026125682,0.0017155773,0.00424498,0.0053478396,0.00291092,0.006684665],"category_scores_gemma":[0.083145246,0.0011209617,0.0025969455,0.0030079028,0.004111991,0.008675055,0.003747622,0.0031838634,0.0014503981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019550088,0.00056848984,0.0062287743,0.0009315158,0.0004751428,0.00032884776,0.00088164926,0.22951572,0.02331573,0.45768908,0.007182367,0.2709277],"study_design_scores_gemma":[0.00030441795,0.00024841249,0.00086362497,0.00009219063,0.00016033377,0.00030952308,0.00012452879,0.70735747,0.034413397,0.2520943,0.0039570564,0.000074770265],"about_ca_topic_score_codex":0.0026514854,"about_ca_topic_score_gemma":0.0028985417,"teacher_disagreement_score":0.012764997,"about_ca_system_score_codex":0.0043814545,"about_ca_system_score_gemma":0.0036599578,"threshold_uncertainty_score":0.06750852},"labels":[],"label_agreement":null},{"id":"W2046033718","doi":"10.1142/s0129054103002151","title":"LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Prefix code; Concatenation (mathematics); Prefix; Prime (order theory); Mathematics; Discrete mathematics; Regular language; Combinatorics; Linear code; Automaton; Computer science; Algorithm; Theoretical computer science; Block code; Decoding methods","score_opus":0.009870597442700342,"score_gpt":0.29530844546629664,"score_spread":0.2854378480235963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046033718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111298986,0.00026926835,0.8803105,0.00032262056,0.00003454743,0.00011188394,0.00022200885,0.001958105,0.005472058],"genre_scores_gemma":[0.545537,0.00020289326,0.44689223,0.0001239746,0.00003941951,0.00013355124,0.00088121044,0.00022207154,0.0059676487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992494,0.00014572528,0.000067834495,0.00023872417,0.00018187868,0.00011643466],"domain_scores_gemma":[0.99767524,0.0013108421,0.00020881127,0.00044215212,0.00025576528,0.00010708024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000652393,0.00041421741,0.0006386714,0.000620059,0.0006277499,0.0013498116,0.00056873175,0.00046461323,0.0030791848],"category_scores_gemma":[0.0044375807,0.00035981173,0.0006097499,0.000606771,0.0012693306,0.002581938,0.00126482,0.000898827,0.0007923907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010871415,0.00020105792,0.0033788485,0.00056982,0.000055564717,0.00055095204,0.0011960258,0.103535496,0.052992653,0.49154392,0.006425318,0.33846322],"study_design_scores_gemma":[0.000053387328,0.00014395814,0.00035502212,0.00003353768,0.000037281596,0.00035836324,0.00019283697,0.42108285,0.03446213,0.5355828,0.007668386,0.000029347675],"about_ca_topic_score_codex":0.001165299,"about_ca_topic_score_gemma":0.0012979204,"teacher_disagreement_score":0.0030791848,"about_ca_system_score_codex":0.0010189862,"about_ca_system_score_gemma":0.0012232962,"threshold_uncertainty_score":0.010300875},"labels":[],"label_agreement":null},{"id":"W2048141197","doi":"10.1016/s0022-4049(03)00124-5","title":"On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties","year":2003,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Assertion; Mathematics; Vertex (graph theory); Rank (graph theory); Combinatorics; Basis (linear algebra); Contrast (vision); Computer science; Geometry; Artificial intelligence; Graph","score_opus":0.011406011668432357,"score_gpt":0.2214527526548045,"score_spread":0.21004674098637213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048141197","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110266104,0.016550923,0.20876838,0.27358305,0.01481447,0.00013202953,0.001354074,0.0009141189,0.37361684],"genre_scores_gemma":[0.7955711,0.012048824,0.043230537,0.0325362,0.013823488,0.00021906983,0.0009858825,0.0010596066,0.10052529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844486,0.00051121216,0.00009157744,0.000391197,0.00032781757,0.00023348685],"domain_scores_gemma":[0.9915194,0.006072705,0.0002573886,0.0006846051,0.0010602542,0.0004056118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038601956,0.00068705383,0.0017580881,0.001815751,0.0031380965,0.0029911562,0.0018955664,0.0034401333,0.014173312],"category_scores_gemma":[0.014392147,0.00048780482,0.0015101833,0.0019275151,0.0076613743,0.014100316,0.005798311,0.006634391,0.0020780663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009179473,0.00003185477,0.00018184807,0.00011931165,0.000014486699,0.00015839106,0.0004255097,0.00046554388,0.00044783048,0.96856153,0.024004158,0.0054976474],"study_design_scores_gemma":[0.000024020379,0.000020824733,0.00023006745,0.00005357609,0.000017586677,0.00008462902,0.000170078,0.0011487083,0.0004168499,0.9707931,0.027012326,0.000028239292],"about_ca_topic_score_codex":0.0031844582,"about_ca_topic_score_gemma":0.00217807,"teacher_disagreement_score":0.014173312,"about_ca_system_score_codex":0.0017382328,"about_ca_system_score_gemma":0.0007924488,"threshold_uncertainty_score":0.047414422},"labels":[],"label_agreement":null},{"id":"W2048480664","doi":"10.1006/jabr.1999.8227","title":"Hereditary Semigroup Algebras","year":2000,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Monoid; Bicyclic semigroup; Semigroup; Noetherian; Pure mathematics; Cancellative semigroup; Ideal (ethics); Nilpotent; Prime ideal; Algebra over a field; Prime (order theory); Combinatorics","score_opus":0.006227633009707522,"score_gpt":0.21030926056730118,"score_spread":0.20408162755759365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048480664","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16108747,0.007741741,0.27330408,0.00623175,0.0017505314,0.0000912066,0.0011634554,0.0014973046,0.5471325],"genre_scores_gemma":[0.85365576,0.002877713,0.02746403,0.00054061215,0.001282558,0.000058346537,0.0008727763,0.00019179685,0.11305639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947137,0.0001088406,0.00003680831,0.00012706323,0.00019027249,0.0000656911],"domain_scores_gemma":[0.9990257,0.00035587687,0.00007280816,0.00017699278,0.00022446478,0.00014422754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007635109,0.00037656608,0.00053083175,0.0012879322,0.0016959673,0.0028838085,0.00058722496,0.00049262546,0.019185493],"category_scores_gemma":[0.0015954054,0.0004183512,0.0005181375,0.0015540969,0.0020119145,0.0054965653,0.0012769962,0.0014948138,0.0027554976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007593189,0.000010976987,0.00008523321,0.000014556743,0.000003666413,0.000023406341,0.00010340943,0.00013645463,0.00027732505,0.99258775,0.0023739585,0.004375659],"study_design_scores_gemma":[0.000006783926,0.000008143763,0.00016033759,0.000010427063,0.000010760177,0.00015020565,0.00006450384,0.0015678051,0.0006532275,0.9801326,0.01722844,0.0000066579873],"about_ca_topic_score_codex":0.0005976833,"about_ca_topic_score_gemma":0.0006055139,"teacher_disagreement_score":0.019185493,"about_ca_system_score_codex":0.0011846795,"about_ca_system_score_gemma":0.00096944947,"threshold_uncertainty_score":0.064181864},"labels":[],"label_agreement":null},{"id":"W2048893100","doi":"10.1007/s00233-013-9471-1","title":"Endomorphism monoids in varieties of commutative semigroups","year":2013,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Endomorphism; Mathematics; Semigroup; Subcategory; Morphism; Commutative property; Pure mathematics; Monoid; Constant (computer programming); Special classes of semigroups; Cardinality (data modeling); Discrete mathematics; Identity (music); Algebra over a field","score_opus":0.004363033903384853,"score_gpt":0.19292513508695525,"score_spread":0.1885621011835704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048893100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5760871,0.0050127544,0.356549,0.0021609054,0.0010058017,0.000106475636,0.00065431633,0.00068841263,0.057735216],"genre_scores_gemma":[0.9518964,0.0010941906,0.031005373,0.00019326933,0.000386797,0.000096676566,0.0002524667,0.000100404606,0.014974417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849117,0.00039335285,0.00015363235,0.00042232324,0.00031724988,0.00022230965],"domain_scores_gemma":[0.99736977,0.0013066769,0.00025804795,0.0002800972,0.00035115276,0.00043438812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020904038,0.0005255976,0.00073666964,0.0023226365,0.002363911,0.0051521463,0.0009406705,0.00097315013,0.004256747],"category_scores_gemma":[0.00318474,0.0007186216,0.0009782917,0.0018233957,0.0032674244,0.008836247,0.00286568,0.001939029,0.0006296533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005961153,0.000024838126,0.0004262544,0.00003072943,0.0000062813374,0.00016306019,0.0008512484,0.0002328288,0.0015709546,0.9900096,0.00045148685,0.0061729923],"study_design_scores_gemma":[0.000033023487,0.00005000737,0.00074604584,0.000023394257,0.000021028674,0.00050380506,0.000473804,0.0017746424,0.0018216487,0.9831109,0.011411258,0.000030330108],"about_ca_topic_score_codex":0.00041204915,"about_ca_topic_score_gemma":0.00038096364,"teacher_disagreement_score":0.0051521463,"about_ca_system_score_codex":0.0011280382,"about_ca_system_score_gemma":0.00070649176,"threshold_uncertainty_score":0.014240265},"labels":[],"label_agreement":null},{"id":"W2049256457","doi":"10.1007/s11083-012-9256-2","title":"A Hierarchy of Chains Embeddable into the Lexicographic Power $\\boldsymbol{({\\mathbb{R}}^\\omega,\\prec_{\\rm lex})}$","year":2012,"lang":"en","type":"article","venue":"Order","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Lexicographical order; Combinatorics; Mathematics; Hierarchy; Omega; Tree (set theory); Order (exchange); Transfinite number; Sequence (biology); Branching (polymer chemistry); Chain (unit); Discrete mathematics; Binary tree; Physics","score_opus":0.008076845308624325,"score_gpt":0.23371086798086937,"score_spread":0.22563402267224505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049256457","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49260345,0.0015849456,0.27256885,0.0025144776,0.00021668327,0.0001488971,0.0030783908,0.0030454064,0.22423898],"genre_scores_gemma":[0.8605747,0.00069803937,0.06968793,0.0005373644,0.00017296059,0.00016540318,0.0026285243,0.00063312886,0.0649019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926394,0.00016554704,0.000058008492,0.00018874828,0.00016156262,0.00016222513],"domain_scores_gemma":[0.99724233,0.001499981,0.00023411502,0.00029586643,0.00035196802,0.00037572338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004701369,0.0006532967,0.00065433455,0.0018478753,0.0023182074,0.0038980595,0.00069574354,0.0010897394,0.024993574],"category_scores_gemma":[0.0016452419,0.0010095725,0.0005780642,0.0016205605,0.0024435157,0.004597301,0.0016062679,0.0016497037,0.0045783687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016477208,0.000045707096,0.0005968778,0.000089174086,0.000010536068,0.00036130095,0.0011426121,0.0006465136,0.007438225,0.975523,0.0033537566,0.010627452],"study_design_scores_gemma":[0.000075570446,0.00005506929,0.00076751463,0.00006823361,0.000025317055,0.00040895678,0.0005830744,0.007120552,0.0049971794,0.96214736,0.023711622,0.000039564846],"about_ca_topic_score_codex":0.002142456,"about_ca_topic_score_gemma":0.0041639083,"teacher_disagreement_score":0.024993574,"about_ca_system_score_codex":0.0013253568,"about_ca_system_score_gemma":0.0007519711,"threshold_uncertainty_score":0.083611846},"labels":[],"label_agreement":null},{"id":"W2049709665","doi":"10.1016/j.tcs.2009.04.016","title":"On the uniqueness of shuffle on words and finite languages","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Western University","funders":"","keywords":"Uniqueness; Factorization; Regular language; Mathematics; Decomposition; Finite set; Combinatorics; Discrete mathematics; Combinatorics on words; Computer science; Word (group theory); Theoretical computer science; Algorithm; Automaton","score_opus":0.007427173008570303,"score_gpt":0.24655547753011023,"score_spread":0.23912830452153994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049709665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27744013,0.0070736133,0.6517526,0.0075455867,0.0009913734,0.00010164732,0.0003707662,0.00030474033,0.054419555],"genre_scores_gemma":[0.8937097,0.0035041985,0.07431503,0.0014913637,0.001114524,0.00019569637,0.00044891506,0.00034228934,0.024878379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980374,0.0008155136,0.00016062411,0.000443092,0.0002694274,0.00027389923],"domain_scores_gemma":[0.9818079,0.0142595135,0.0006484388,0.0012337732,0.0012827566,0.00076765823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046928655,0.0007399783,0.0018627687,0.0022887178,0.0034497513,0.00386021,0.0019197197,0.003445775,0.005387631],"category_scores_gemma":[0.02039604,0.0013244824,0.0018751213,0.001983181,0.009155856,0.022491885,0.006774601,0.00511838,0.0008148906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008222484,0.000021322976,0.00047837556,0.00005784495,0.000014930735,0.00010564052,0.00044123852,0.0012542834,0.00042837733,0.9911479,0.00065108977,0.0053168205],"study_design_scores_gemma":[0.000006901173,0.000016274893,0.00009514336,0.0000126296145,0.0000060379493,0.00006846042,0.000096720956,0.0020212433,0.00023123642,0.9965333,0.0009010816,0.000010956966],"about_ca_topic_score_codex":0.00085563527,"about_ca_topic_score_gemma":0.0007198526,"teacher_disagreement_score":0.005387631,"about_ca_system_score_codex":0.0013740662,"about_ca_system_score_gemma":0.0014145223,"threshold_uncertainty_score":0.02481854},"labels":[],"label_agreement":null},{"id":"W2050304496","doi":"10.1016/s1570-8667(03)00037-6","title":"Two-pattern strings I—A recognition algorithm","year":2003,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Generalization; Class (philosophy); Computer science; String searching algorithm; Algorithm; Pattern matching; Mathematics; Combinatorics; Pattern recognition (psychology); Discrete mathematics; Artificial intelligence; Data structure","score_opus":0.015317200453146392,"score_gpt":0.2522856864990134,"score_spread":0.236968486045867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050304496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016959993,0.00018138131,0.96405536,0.0005015196,0.0002911497,0.00018963224,0.00026600045,0.0055077034,0.012047214],"genre_scores_gemma":[0.13853255,0.00016355675,0.84523994,0.00031593235,0.00011390303,0.00023771144,0.00082531304,0.00054462557,0.014026443],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992009,0.00010230619,0.00007826961,0.0003548939,0.00018154441,0.000082205406],"domain_scores_gemma":[0.99890685,0.00029356,0.000054359305,0.00041434477,0.00025403706,0.00007695879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005352811,0.00075740117,0.00092528784,0.0010182342,0.0009196637,0.0023755673,0.0021240665,0.0018694192,0.013783291],"category_scores_gemma":[0.0024809523,0.0005894318,0.0010464091,0.0013098195,0.00089963846,0.0035857295,0.0019889115,0.0017146473,0.007870873],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005954107,0.00025340926,0.0010672591,0.00021431848,0.000055460972,0.0002821366,0.00019944321,0.008788705,0.028824944,0.11289291,0.022312917,0.82451314],"study_design_scores_gemma":[0.00027299928,0.0005488713,0.0008902593,0.0001285199,0.00012675382,0.002299568,0.00035268746,0.5314122,0.096086964,0.30441192,0.06332694,0.0001423822],"about_ca_topic_score_codex":0.0005687626,"about_ca_topic_score_gemma":0.00041253082,"teacher_disagreement_score":0.013783291,"about_ca_system_score_codex":0.00047248972,"about_ca_system_score_gemma":0.0008766965,"threshold_uncertainty_score":0.046109736},"labels":[],"label_agreement":null},{"id":"W2050895508","doi":"10.1142/s1005386706000563","title":"Green's Relations on the Monoid of Regular Hypersubstitutions","year":2006,"lang":"en","type":"article","venue":"Algebra Colloquium","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Semigroup; Galois connection; Monoid; Free monoid; Type (biology); Syntactic monoid; Connection (principal bundle); Pure mathematics; Bicyclic semigroup; Combinatorics; Lattice (music); Discrete mathematics; Algebra over a field","score_opus":0.007327646450769529,"score_gpt":0.18685431453004278,"score_spread":0.17952666807927325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050895508","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7916607,0.0018269226,0.14712341,0.0011654921,0.00022952899,0.000089384775,0.00048173624,0.0004164293,0.057006378],"genre_scores_gemma":[0.9589763,0.00035616374,0.030970676,0.00019142436,0.00013100725,0.0000635954,0.00017872345,0.00004607866,0.009086082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917245,0.00017042848,0.00005766299,0.00020205347,0.00024627722,0.00015113116],"domain_scores_gemma":[0.9987663,0.0004883995,0.00018577161,0.0001443318,0.00016500933,0.00025020415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001075025,0.0002855743,0.00034860295,0.0014817296,0.0017222073,0.0016649328,0.00044497487,0.00036901227,0.0021000588],"category_scores_gemma":[0.0016356909,0.00019752883,0.00060457224,0.0010592167,0.0034282533,0.003141096,0.0015836029,0.00094902987,0.00029179873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038903265,0.000008495467,0.00050726393,0.000018091663,0.0000041722287,0.00011207031,0.00097128033,0.00029283686,0.0030415696,0.9876016,0.00037207972,0.007031632],"study_design_scores_gemma":[0.000017839424,0.000050068655,0.0015403366,0.00001996477,0.0000134607035,0.00030733456,0.0006176778,0.0026536684,0.0043460764,0.97534335,0.015064194,0.000026069703],"about_ca_topic_score_codex":0.0014992958,"about_ca_topic_score_gemma":0.0014460696,"teacher_disagreement_score":0.0021000588,"about_ca_system_score_codex":0.0014169646,"about_ca_system_score_gemma":0.00060701714,"threshold_uncertainty_score":0.010280848},"labels":[],"label_agreement":null},{"id":"W2051714857","doi":"10.1007/s00493-006-0015-0","title":"COLORING SUBGRAPHS OF THE RADO GRAPH","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"semigroups and automata theory","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Partition (number theory); Combinatorics; Countable set; Homogeneous; Element (criminal law); Graph; Binary number; Discrete mathematics; Class (philosophy); Arithmetic; Computer science","score_opus":0.003797364287851082,"score_gpt":0.17083807351288774,"score_spread":0.16704070922503667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051714857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7285327,0.0005366245,0.16834582,0.0013682398,0.00014911994,0.0001250738,0.0012276366,0.00092303276,0.09879175],"genre_scores_gemma":[0.924616,0.00032651678,0.050198223,0.00032220644,0.00006397667,0.000125098,0.001281383,0.00020792412,0.022858826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996929,0.00009955911,0.000013347947,0.0000836534,0.00004568715,0.00006493955],"domain_scores_gemma":[0.99865097,0.0006354598,0.00016519165,0.0002735193,0.00011380601,0.00016106012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023673566,0.00030175145,0.000387302,0.0006957899,0.0010463423,0.0013610332,0.0007035774,0.0005140219,0.006486143],"category_scores_gemma":[0.0011092299,0.00036252354,0.0005279223,0.0007507778,0.00087892637,0.0012272864,0.00068427506,0.00062003837,0.0009216114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019509018,0.00006470371,0.0021433118,0.00011556904,0.00002193781,0.00035345563,0.0007100507,0.0066388096,0.012802872,0.95137435,0.0055888924,0.01999087],"study_design_scores_gemma":[0.000053468422,0.00003214118,0.00199118,0.000025482912,0.00004049448,0.00033254133,0.0003920268,0.026921842,0.00488212,0.95269984,0.012604939,0.000023864988],"about_ca_topic_score_codex":0.0023947787,"about_ca_topic_score_gemma":0.004109287,"teacher_disagreement_score":0.006486143,"about_ca_system_score_codex":0.0007013435,"about_ca_system_score_gemma":0.00046706598,"threshold_uncertainty_score":0.021698296},"labels":[],"label_agreement":null},{"id":"W2052564373","doi":"10.1142/s179304210700081x","title":"A POLYNOMIAL ANALOGUE TO THE STERN SEQUENCE","year":2007,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stern; Mathematics; Sequence (biology); Stirling number; Polynomial; Stirling numbers of the first kind; Stirling numbers of the second kind; Chebyshev polynomials; Mathematical proof; Simple (philosophy); Generating function; Combinatorics; Algebra over a field; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.017536288150535276,"score_gpt":0.30942672289841205,"score_spread":0.2918904347478768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052564373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21959677,0.0010327505,0.6153794,0.0013797659,0.00068433635,0.00010202291,0.00026751487,0.0003769921,0.16118044],"genre_scores_gemma":[0.86645526,0.001109602,0.072111934,0.00047200418,0.0006972312,0.000081429775,0.0001972433,0.00015955846,0.05871586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995524,0.000071865805,0.0000220147,0.000116227304,0.00014864508,0.00008881566],"domain_scores_gemma":[0.99899346,0.0003217224,0.00013322482,0.0001153299,0.00029431965,0.00014196092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048616668,0.00037813847,0.0003122512,0.00084753585,0.0009068608,0.0010219603,0.0004861312,0.00043413465,0.0073676384],"category_scores_gemma":[0.0021322272,0.00015751133,0.00046310984,0.000860555,0.0016779046,0.0024399976,0.0012202285,0.0015301009,0.0018098656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022401835,0.000008569228,0.0001106733,0.000025328238,0.0000020126938,0.00006390014,0.00014086354,0.00080090173,0.0026818125,0.9875365,0.0005207637,0.008086291],"study_design_scores_gemma":[0.000012502088,0.000077171535,0.00034360748,0.000018582721,0.000008004435,0.00034858644,0.000083544095,0.010757168,0.0047221095,0.96452767,0.019081848,0.000019155184],"about_ca_topic_score_codex":0.00061708124,"about_ca_topic_score_gemma":0.00053250557,"teacher_disagreement_score":0.0073676384,"about_ca_system_score_codex":0.000730306,"about_ca_system_score_gemma":0.0006211711,"threshold_uncertainty_score":0.024647236},"labels":[],"label_agreement":null},{"id":"W2052579883","doi":"10.4171/ggd/221","title":"From automatic structures to automatic groups","year":2014,"lang":"en","type":"preprint","venue":"Groups Geometry and Dynamics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Royal Society Te Apārangi; Royal Society; Marsden Fund; National Science Foundation","keywords":"Cayley graph; Decidability; Graph; Voltage graph; Mathematics; Invariant (physics); Computer science; Nilpotent group; Discrete mathematics; Nilpotent; Combinatorics; Line graph","score_opus":0.007822427442506628,"score_gpt":0.23113212779522774,"score_spread":0.2233097003527211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052579883","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20289782,0.008270939,0.56387955,0.0094338255,0.0019970653,0.00010544183,0.00054231763,0.0010128132,0.21186024],"genre_scores_gemma":[0.89445883,0.003152038,0.0688418,0.0016821518,0.0016798289,0.00015882708,0.0005085948,0.00022583657,0.02929203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992854,0.0001874448,0.000031519805,0.0002061067,0.00021552082,0.00007405759],"domain_scores_gemma":[0.9992962,0.00027434962,0.0000710543,0.00013494259,0.00013153373,0.00009198916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051649276,0.00045383483,0.0002841452,0.001127805,0.0009605702,0.0017297422,0.0006522534,0.0008953584,0.0059078275],"category_scores_gemma":[0.0015757716,0.00023325124,0.00041698947,0.00078743557,0.0040192604,0.0053254063,0.0022598184,0.0017817909,0.0009524136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028015897,0.000004021789,0.00006561291,0.000015702708,0.0000012421278,0.000027747938,0.00015146616,0.00029777354,0.00033485645,0.99587786,0.00052064634,0.0027001572],"study_design_scores_gemma":[0.000003554579,0.00000709862,0.00006666009,0.000006895195,0.0000013534652,0.00004288514,0.000052850635,0.0015226906,0.00017456393,0.98645484,0.011662361,0.000004188773],"about_ca_topic_score_codex":0.00080252514,"about_ca_topic_score_gemma":0.00059243717,"teacher_disagreement_score":0.0059078275,"about_ca_system_score_codex":0.0008175627,"about_ca_system_score_gemma":0.00050498004,"threshold_uncertainty_score":0.019763649},"labels":[],"label_agreement":null},{"id":"W2052869910","doi":"10.1016/j.disc.2014.12.010","title":"Maximal bifix decoding","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca; Università degli Studi di Salerno; Agence Nationale de la Recherche","keywords":"Mathematics; Decoding methods; Generalization; Class (philosophy); Tree (set theory); Combinatorics; Discrete mathematics; Interval (graph theory); Natural number; Algorithm; Computer science; Artificial intelligence","score_opus":0.04140851047828288,"score_gpt":0.26999016780454593,"score_spread":0.22858165732626307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052869910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08077095,0.0011795209,0.5096571,0.006557751,0.0014597101,0.00017011346,0.0035700556,0.005239963,0.39139485],"genre_scores_gemma":[0.78279483,0.00093290344,0.10750387,0.0030309623,0.00095092965,0.00026971177,0.0046202247,0.0031636183,0.096733026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963213,0.0009100336,0.00022116453,0.0009274542,0.00079900253,0.00082103425],"domain_scores_gemma":[0.9931987,0.002890167,0.00023125547,0.0020514936,0.0012139475,0.0004144522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020231851,0.0012581587,0.0016571782,0.001985081,0.003865177,0.0061747185,0.001515489,0.0026906636,0.03247865],"category_scores_gemma":[0.011237904,0.0007485746,0.0013030972,0.0022124029,0.0028699096,0.009089988,0.005729505,0.0044958396,0.01166301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013500376,0.000029873141,0.0002470375,0.00006844653,0.0000104789815,0.000073714255,0.00019171713,0.0004905233,0.0016177477,0.9680017,0.00876357,0.020370232],"study_design_scores_gemma":[0.000012703246,0.000011532546,0.00008211698,0.00003041932,0.000013748026,0.00012352804,0.00007493197,0.004197224,0.0041956212,0.98210907,0.009132619,0.000016508002],"about_ca_topic_score_codex":0.0008406718,"about_ca_topic_score_gemma":0.0008765612,"teacher_disagreement_score":0.03247865,"about_ca_system_score_codex":0.0015687817,"about_ca_system_score_gemma":0.0024391783,"threshold_uncertainty_score":0.108651936},"labels":[],"label_agreement":null},{"id":"W2053528079","doi":"10.1016/s0024-3795(99)00229-3","title":"On transitive linear semigroups","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Prince Edward Island","funders":"","keywords":"Transitive relation; Mathematics; Transitive reduction; Class (philosophy); Pure mathematics; Special classes of semigroups; Vector space; Transitive closure; Semigroup; Discrete mathematics; Combinatorics; Computer science","score_opus":0.00748363400812683,"score_gpt":0.2303781849741506,"score_spread":0.22289455096602379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053528079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25509045,0.0123053845,0.42235646,0.005247705,0.001960509,0.00013918268,0.0009453488,0.00089902565,0.30105594],"genre_scores_gemma":[0.89294446,0.0048435056,0.030205166,0.0007600181,0.0019913795,0.00020115748,0.0006429524,0.0002384946,0.068172745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982077,0.0005355659,0.00012573383,0.00036661097,0.0004939335,0.00027040168],"domain_scores_gemma":[0.99640805,0.0021812792,0.0003359671,0.00035346887,0.00034770355,0.00037362924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001352407,0.0012016995,0.0013029191,0.0034448088,0.002517787,0.004934561,0.0012130025,0.0013808373,0.011198262],"category_scores_gemma":[0.0035518243,0.001020598,0.0015959867,0.0037899234,0.005097813,0.008810701,0.0035128603,0.0027928331,0.0017006415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016164637,0.000015778338,0.000070035945,0.000031378462,0.0000050236044,0.00006745055,0.00034253532,0.000454539,0.0005334923,0.9937784,0.0007810613,0.0039041725],"study_design_scores_gemma":[0.000009606846,0.00001567253,0.00009895504,0.000015316864,0.0000087469825,0.00009555326,0.000113993374,0.0027551022,0.00043291668,0.9925069,0.003934959,0.000012223482],"about_ca_topic_score_codex":0.0010637367,"about_ca_topic_score_gemma":0.0009600519,"teacher_disagreement_score":0.011198262,"about_ca_system_score_codex":0.0024690374,"about_ca_system_score_gemma":0.00081928814,"threshold_uncertainty_score":0.037461877},"labels":[],"label_agreement":null},{"id":"W2053695139","doi":"10.1016/j.tcs.2008.08.039","title":"Long binary patterns are Abelian 2-avoidable","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Abelian group; Binary number; Mathematics; Combinatorics; Arithmetic","score_opus":0.012199145243238898,"score_gpt":0.2253280155162436,"score_spread":0.2131288702730047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053695139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78055453,0.00064323377,0.14650111,0.0012017394,0.0004877679,0.00012024909,0.000626756,0.0013019032,0.06856266],"genre_scores_gemma":[0.9403672,0.00021328474,0.021394681,0.0003427849,0.00024500088,0.00019419928,0.00041323743,0.0002931916,0.036536377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998784,0.00017696395,0.00010499968,0.0003140648,0.0003274936,0.00029245458],"domain_scores_gemma":[0.9954991,0.0021767307,0.00083428365,0.00051928376,0.0005545118,0.00041607328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061838474,0.00080650195,0.0009703957,0.0017133573,0.0019958199,0.0033157729,0.0010949007,0.0013312522,0.01120342],"category_scores_gemma":[0.0032412615,0.0009460394,0.00067342474,0.0015997436,0.0021994442,0.005366678,0.00217246,0.00179347,0.0020563134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035135256,0.000079533114,0.0012231692,0.00014984996,0.000026078811,0.00087429717,0.0012461349,0.00085882825,0.0121149495,0.9617601,0.0026376043,0.018678136],"study_design_scores_gemma":[0.000050755574,0.00005476029,0.0005911512,0.000018549908,0.000019560179,0.00073553226,0.0002542362,0.0028560085,0.0031588767,0.9865883,0.0056340946,0.00003813959],"about_ca_topic_score_codex":0.0003126501,"about_ca_topic_score_gemma":0.00048311878,"teacher_disagreement_score":0.01120342,"about_ca_system_score_codex":0.00075061433,"about_ca_system_score_gemma":0.00051621225,"threshold_uncertainty_score":0.037479162},"labels":[],"label_agreement":null},{"id":"W2054220885","doi":"10.1016/j.tcs.2007.04.015","title":"State complexity of combined operations","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"State (computer science); Intersection (aeronautics); Combined operations; Star (game theory); Computer science; Theoretical computer science; Computational complexity theory; Mathematics; Algorithm; Engineering; Political science","score_opus":0.018968664395800354,"score_gpt":0.26799451307674566,"score_spread":0.2490258486809453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054220885","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7962264,0.00043889112,0.17032306,0.0016722006,0.00006850754,0.00008707926,0.00086857687,0.00040102057,0.029914238],"genre_scores_gemma":[0.98753047,0.00014343919,0.007756694,0.000061885585,0.00007091036,0.00008299249,0.00039554533,0.00007798385,0.0038801157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965952,0.00076104293,0.00021044986,0.00060922984,0.00124283,0.0005813547],"domain_scores_gemma":[0.96595806,0.026937747,0.001365397,0.0027972986,0.0018015387,0.0011399237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019051979,0.00056596386,0.0014777706,0.0018884499,0.0017046096,0.0077280677,0.0019261937,0.001902531,0.012460286],"category_scores_gemma":[0.016217213,0.00078603654,0.0017392071,0.0022398012,0.0031619743,0.015326296,0.0034324788,0.003849751,0.0007162648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044217412,0.00012793482,0.0018163612,0.000108918495,0.000046824312,0.0001390726,0.000680519,0.028253498,0.0027811667,0.9516364,0.0012876072,0.012679543],"study_design_scores_gemma":[0.000034101828,0.000037049034,0.0006940136,0.000011960562,0.00003778733,0.0000631021,0.000108951346,0.11836839,0.00199878,0.877999,0.0006202644,0.000026503723],"about_ca_topic_score_codex":0.0017363622,"about_ca_topic_score_gemma":0.0015500601,"teacher_disagreement_score":0.012460286,"about_ca_system_score_codex":0.0025223705,"about_ca_system_score_gemma":0.0016428854,"threshold_uncertainty_score":0.041683853},"labels":[],"label_agreement":null},{"id":"W2055930907","doi":"10.1142/s0129054112400503","title":"CHANNEL SYNTHESIS FOR FINITE TRANSDUCERS","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Undecidable problem; Transducer; Communication source; Computer science; Channel (broadcasting); Encoder; Encoding (memory); ENCODE; Binary number; Relation (database); Algorithm; Topology (electrical circuits); Theoretical computer science; Decidability; Acoustics; Mathematics; Telecommunications; Physics; Arithmetic; Artificial intelligence","score_opus":0.02610543362871547,"score_gpt":0.2999545621229074,"score_spread":0.2738491284941919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055930907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02968286,0.00025107642,0.9613401,0.00061536225,0.00007236851,0.000078886944,0.00009881457,0.0004371098,0.007423359],"genre_scores_gemma":[0.734377,0.0005201732,0.25657377,0.00024927923,0.000092602975,0.0004714314,0.0002814902,0.00023529751,0.007198981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997486,0.0010379677,0.00019101737,0.00056004996,0.0004504933,0.0002744859],"domain_scores_gemma":[0.98772115,0.010400867,0.0004760066,0.000752539,0.00043292023,0.00021642409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021884076,0.00063146127,0.000643028,0.00058730756,0.0010022054,0.0018696114,0.00092069636,0.0016445772,0.0051509906],"category_scores_gemma":[0.009908625,0.0005210802,0.0017126472,0.00042186695,0.003916159,0.0044740895,0.002805255,0.0021613818,0.0006510318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009464974,0.000038829658,0.0003723158,0.00025584866,0.000033417757,0.00034070935,0.0005587348,0.09716931,0.008792052,0.8794842,0.0005587545,0.012301219],"study_design_scores_gemma":[0.000038667506,0.0000798257,0.00006921897,0.000055656998,0.00004040323,0.00013262208,0.00014307818,0.32415316,0.010985052,0.65996456,0.0043053827,0.00003227893],"about_ca_topic_score_codex":0.0008718806,"about_ca_topic_score_gemma":0.00076586386,"teacher_disagreement_score":0.0051509906,"about_ca_system_score_codex":0.0016555042,"about_ca_system_score_gemma":0.0014446795,"threshold_uncertainty_score":0.017231822},"labels":[],"label_agreement":null},{"id":"W2056533610","doi":"10.1016/j.aam.2014.10.006","title":"Some properties of a Rudin–Shapiro-like sequence","year":2014,"lang":"en","type":"preprint","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subsequence; Combinatorics; Sequence (biology); Generating function; Function (biology); Mathematics; Binary number; Arithmetic; Mathematical analysis; Bounded function; Chemistry; Biology","score_opus":0.03021710125596875,"score_gpt":0.2654711575106826,"score_spread":0.23525405625471388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056533610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7200509,0.0009490911,0.18747702,0.0015085852,0.0002442905,0.000067399094,0.00049986696,0.00032116554,0.08888172],"genre_scores_gemma":[0.9625796,0.00041953262,0.021206226,0.00028255137,0.00018694483,0.00007511447,0.00038251138,0.000074520045,0.014792977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997042,0.00008105993,0.000025437139,0.00008313437,0.000070736125,0.000035441954],"domain_scores_gemma":[0.998041,0.0009300936,0.00028209368,0.00012624722,0.00030057764,0.0003201018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006998375,0.00040394146,0.0004114596,0.001112556,0.0011764796,0.0013966284,0.00059758505,0.00095020205,0.0039403224],"category_scores_gemma":[0.0033119237,0.00024245535,0.00043301997,0.0010176464,0.0014188908,0.0020797302,0.0010392121,0.0012625776,0.0006407864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010167927,0.000023358056,0.0007820501,0.00005218952,0.000010335689,0.00022551927,0.00032263444,0.0012360124,0.0053144544,0.9842424,0.0008157161,0.00687372],"study_design_scores_gemma":[0.000035513465,0.000103511215,0.001212375,0.00002243526,0.00001575268,0.0005567264,0.00019747106,0.013419045,0.0032955597,0.9740009,0.0071118,0.000028871389],"about_ca_topic_score_codex":0.00032400127,"about_ca_topic_score_gemma":0.00024415576,"teacher_disagreement_score":0.0039403224,"about_ca_system_score_codex":0.0005567672,"about_ca_system_score_gemma":0.0004150866,"threshold_uncertainty_score":0.013181686},"labels":[],"label_agreement":null},{"id":"W2057158872","doi":"10.1016/j.jda.2012.04.015","title":"Cool-lex order and k-ary Catalan structures","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Victoria; University of Manitoba","funders":"","keywords":"Catalan number; Combinatorics; Lexicographical order; Mathematics; Complement (music); Order (exchange); Precomputation; Binary tree; Sequence (biology); Discrete mathematics; Algorithm; Computer science","score_opus":0.009989566069584637,"score_gpt":0.24947602503031416,"score_spread":0.2394864589607295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057158872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68106407,0.00084863836,0.16228804,0.0040570255,0.00045957635,0.000110437264,0.0012797728,0.000793086,0.14909936],"genre_scores_gemma":[0.9397618,0.00018397534,0.02073795,0.00044971195,0.00012824223,0.00007289711,0.0006737742,0.00018718216,0.03780441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990268,0.00020861453,0.00007807408,0.00020957467,0.00019875387,0.00027816714],"domain_scores_gemma":[0.99652594,0.0017106901,0.0002791251,0.00051564275,0.0005406319,0.00042795445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085008034,0.0004016686,0.0009957834,0.0011860727,0.0032000944,0.005619112,0.0009714395,0.0012190273,0.012524027],"category_scores_gemma":[0.0036996768,0.00050121825,0.0009377429,0.00137359,0.0035655792,0.0064880513,0.0022508265,0.0030336038,0.0017114491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088898654,0.000018363706,0.0003027786,0.000022171062,0.0000044262815,0.00007195931,0.0003854256,0.00059068785,0.0005627416,0.99449337,0.00077696855,0.0026822025],"study_design_scores_gemma":[0.000019052726,0.00001780865,0.00020238734,0.000008917442,0.0000067554447,0.00007103875,0.00025174808,0.0022933031,0.0005304643,0.994212,0.0023707566,0.000015885496],"about_ca_topic_score_codex":0.002126458,"about_ca_topic_score_gemma":0.0030374916,"teacher_disagreement_score":0.012524027,"about_ca_system_score_codex":0.001839137,"about_ca_system_score_gemma":0.0012391302,"threshold_uncertainty_score":0.04189706},"labels":[],"label_agreement":null},{"id":"W2057559629","doi":"10.1006/jcss.2002.1855","title":"Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Deterministic context-free grammar; Embedded pushdown automaton; Deterministic pushdown automaton; Unary operation; Pushdown automaton; Mathematics; Discrete mathematics; Deterministic finite automaton; Nested word; Context-free language; Context-free grammar; Combinatorics; Quantum finite automata; Nondeterministic finite automaton; Automata theory; Finite-state machine; Computer science; Automaton; Rule-based machine translation; Algorithm; Tree-adjoining grammar; Theoretical computer science; Artificial intelligence","score_opus":0.031997160919846224,"score_gpt":0.21991453948585216,"score_spread":0.18791737856600593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057559629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24095936,0.0056209546,0.697873,0.014702872,0.0003083432,0.00015461045,0.0014708113,0.0010694086,0.037840653],"genre_scores_gemma":[0.9055136,0.0027025065,0.07486797,0.0010441019,0.00080730586,0.00051436404,0.0015238003,0.0007700774,0.0122562535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9893154,0.0036878043,0.0006844638,0.0020088733,0.0026668431,0.0016365047],"domain_scores_gemma":[0.8525334,0.1289188,0.003203516,0.010432042,0.0025551594,0.0023571423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007934341,0.0017789156,0.0033640903,0.0035150524,0.0035194445,0.01246558,0.0069581657,0.004235059,0.012137904],"category_scores_gemma":[0.045811195,0.0026011742,0.004526863,0.0059163757,0.009797204,0.04334599,0.009693744,0.017336491,0.0013189574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002622098,0.00018309821,0.0011703414,0.00020877353,0.000061360515,0.00013172119,0.0009320583,0.021977974,0.0012058918,0.95666957,0.002650853,0.014546152],"study_design_scores_gemma":[0.000015020971,0.000016596807,0.00017066397,0.000018276627,0.000029850758,0.00005020671,0.00007688673,0.042418025,0.0005912254,0.9559954,0.00059276866,0.000025030524],"about_ca_topic_score_codex":0.0023943447,"about_ca_topic_score_gemma":0.0023880543,"teacher_disagreement_score":0.01246558,"about_ca_system_score_codex":0.0066153244,"about_ca_system_score_gemma":0.0029686252,"threshold_uncertainty_score":0.047997773},"labels":[],"label_agreement":null},{"id":"W2058703803","doi":"10.1142/s0218196711006169","title":"LIMIT VARIETIES GENERATED BY COMPLETELY 0-SIMPLE SEMIGROUPS","year":2011,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Limit (mathematics); Semigroup; Simple (philosophy); Abelian group; Variety (cybernetics); Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.024250728931586245,"score_gpt":0.24278746655137284,"score_spread":0.2185367376197866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058703803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9190596,0.0010548243,0.050977618,0.00020250386,0.00008899635,0.000048293587,0.00014313379,0.00030127412,0.02812376],"genre_scores_gemma":[0.9822129,0.0002155228,0.010403277,0.000039711063,0.00007292033,0.000046401667,0.00019882762,0.000029828281,0.006780672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995091,0.00010632454,0.000049528895,0.000112595364,0.00015473376,0.00006760913],"domain_scores_gemma":[0.99923074,0.00024052271,0.00009859499,0.00007310109,0.00014132929,0.0002157813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006305306,0.00038031736,0.0004256768,0.0016188024,0.001382999,0.0021821298,0.00052884396,0.00030589118,0.0024409834],"category_scores_gemma":[0.0011819657,0.0002596024,0.00068096304,0.00047256265,0.001963097,0.003053402,0.0016073817,0.00061335205,0.00032191403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017379016,0.000059005088,0.002783438,0.00008560352,0.000029892228,0.0011818069,0.002184812,0.0013263053,0.0168205,0.9608102,0.00070507795,0.013839511],"study_design_scores_gemma":[0.00007428485,0.00026586218,0.003952096,0.00006386677,0.000054196305,0.0028375895,0.0013102568,0.0099677555,0.019776527,0.942271,0.019349832,0.000076754885],"about_ca_topic_score_codex":0.00019242756,"about_ca_topic_score_gemma":0.00020536807,"teacher_disagreement_score":0.0024409834,"about_ca_system_score_codex":0.0006062178,"about_ca_system_score_gemma":0.00023538795,"threshold_uncertainty_score":0.008165896},"labels":[],"label_agreement":null},{"id":"W2060731856","doi":"10.1142/s0129054104002443","title":"SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS","year":2004,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Binary number; Mathematics; Combinatorics; Hierarchy; Cube (algebra); Word (group theory); Discrete mathematics; Arithmetic; Computer science; Geometry","score_opus":0.00849638401482924,"score_gpt":0.28992859198748816,"score_spread":0.28143220797265894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060731856","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77381414,0.0010116823,0.15441822,0.0016659702,0.00027129176,0.00005238789,0.00009100174,0.0003501721,0.06832523],"genre_scores_gemma":[0.95890224,0.00028913538,0.025588483,0.00019916169,0.00009284111,0.000056239922,0.000063981446,0.00010672951,0.014701293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921346,0.00015879821,0.000067622146,0.00017036917,0.00019601575,0.00019368944],"domain_scores_gemma":[0.9978186,0.0012628236,0.00024439665,0.0003051464,0.00016859677,0.00020044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060959073,0.00044573058,0.00067640893,0.00055011484,0.0025748427,0.0023679053,0.00082195585,0.0012878168,0.005098142],"category_scores_gemma":[0.003997889,0.00063806906,0.0007721345,0.0006798367,0.0034739708,0.006454411,0.003225339,0.002099719,0.0009705057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022346276,0.000038536982,0.00065727107,0.00013054757,0.000010825195,0.0010584065,0.0017281332,0.0026260447,0.016749283,0.9591421,0.0010089045,0.016626453],"study_design_scores_gemma":[0.000039323197,0.00006530896,0.0002754544,0.000031183154,0.00001896053,0.000783301,0.00050948287,0.008521404,0.010089594,0.9682372,0.011393099,0.000035650577],"about_ca_topic_score_codex":0.00040484354,"about_ca_topic_score_gemma":0.000623295,"teacher_disagreement_score":0.005098142,"about_ca_system_score_codex":0.0007295475,"about_ca_system_score_gemma":0.00042133324,"threshold_uncertainty_score":0.017054975},"labels":[],"label_agreement":null},{"id":"W2061015906","doi":"10.1142/s0129054102001461","title":"SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Prince Edward Island","funders":"","keywords":"Undecidable problem; Closure (psychology); Regular language; Equivalence (formal languages); Quotient; Decomposition; Mathematics; Context-free language; Abstract family of languages; Discrete mathematics; Context (archaeology); Computer science; Combinatorics; Decidability; Theoretical computer science; Automaton; Programming language; Rule-based machine translation; Natural language processing","score_opus":0.013496929104036635,"score_gpt":0.2898611299835407,"score_spread":0.27636420087950403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061015906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4461584,0.0004677879,0.53670096,0.00027140675,0.000085865046,0.00014989132,0.0002610718,0.00068482856,0.015219784],"genre_scores_gemma":[0.8861941,0.00021831106,0.10442072,0.00010080147,0.00006006842,0.000164968,0.00046850427,0.00023214129,0.008140327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984836,0.0002619558,0.00015746911,0.0003961473,0.00037650435,0.00032431303],"domain_scores_gemma":[0.9971546,0.0011303329,0.00039049445,0.0005190047,0.00043847229,0.0003670438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001630739,0.0004577597,0.0004982812,0.001111385,0.0009568558,0.0021144967,0.0007552832,0.00045318788,0.0026497836],"category_scores_gemma":[0.003964126,0.0004166339,0.0011384451,0.00051549193,0.0026600384,0.0061755674,0.0019066865,0.0014379107,0.00050380215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116928444,0.00006202867,0.0008618561,0.000064710446,0.000013319669,0.00023248633,0.0009232757,0.0041626687,0.010672817,0.9675802,0.0004029496,0.014906707],"study_design_scores_gemma":[0.00002228701,0.000067517394,0.0003987856,0.000025876472,0.000015519317,0.00025611825,0.00028267578,0.028947774,0.014920927,0.94985354,0.0051837936,0.000025177585],"about_ca_topic_score_codex":0.00074605667,"about_ca_topic_score_gemma":0.0007606988,"teacher_disagreement_score":0.0026497836,"about_ca_system_score_codex":0.0011651431,"about_ca_system_score_gemma":0.00073429185,"threshold_uncertainty_score":0.008864403},"labels":[],"label_agreement":null},{"id":"W2061212999","doi":"10.4204/eptcs.31.17","title":"Operational State Complexity of Deterministic Unranked Tree Automata","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Tree (set theory); Tree automaton; Intersection (aeronautics); String (physics); State (computer science); Upper and lower bounds; Regular language; Time complexity","score_opus":0.00859781140142239,"score_gpt":0.2449642404551377,"score_spread":0.23636642905371533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061212999","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79349405,0.00021385672,0.1994924,0.00036778717,0.000038212514,0.000056697474,0.0005830184,0.0006705089,0.005083417],"genre_scores_gemma":[0.9759665,0.000093190254,0.021720463,0.00003314278,0.00002189541,0.000071282106,0.0005731728,0.00006073624,0.001459525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787986,0.0003511203,0.00027128233,0.00046674526,0.00063578406,0.00039511683],"domain_scores_gemma":[0.98931026,0.00704836,0.0010996382,0.0011298319,0.00095463166,0.00045729222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083982275,0.00041533637,0.000622671,0.00064819196,0.00061775505,0.002774073,0.0010386766,0.0006029903,0.0033594416],"category_scores_gemma":[0.007267049,0.0003241709,0.00074726524,0.00059786934,0.001625405,0.0046215462,0.0013370515,0.0012203697,0.00038720825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010786132,0.00033306825,0.008759102,0.0004450061,0.00009235512,0.0006283976,0.0015498718,0.34314018,0.066809125,0.52056843,0.0018405936,0.054755356],"study_design_scores_gemma":[0.000034112705,0.00015668396,0.0014988885,0.000019187282,0.00003783672,0.00013230224,0.00017254612,0.6914617,0.021101434,0.2841376,0.0011851899,0.000062521205],"about_ca_topic_score_codex":0.0014991438,"about_ca_topic_score_gemma":0.0015345928,"teacher_disagreement_score":0.0033594416,"about_ca_system_score_codex":0.0013648876,"about_ca_system_score_gemma":0.0011254546,"threshold_uncertainty_score":0.011238456},"labels":[],"label_agreement":null},{"id":"W2061265323","doi":"10.1016/j.tcs.2009.01.004","title":"Nondeterministic state complexity of nested word automata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Nondeterministic finite automaton; Nested word; Word (group theory); Discrete mathematics; Deterministic finite automaton; Intersection (aeronautics); Mathematics; Upper and lower bounds; Combinatorics; Automaton; Finite-state machine; Automata theory; Computer science; Quantum finite automata; Theoretical computer science; Algorithm","score_opus":0.01999266988656173,"score_gpt":0.26671292319203743,"score_spread":0.2467202533054757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061265323","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74132913,0.00058593106,0.23375446,0.002267277,0.00008020793,0.00009509707,0.00071291556,0.0003695673,0.020805363],"genre_scores_gemma":[0.9832028,0.00017482408,0.012584382,0.00007318194,0.00006743431,0.000095713134,0.00029704082,0.00007973585,0.00342486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99587643,0.0011667982,0.00034511782,0.00079509866,0.0013065607,0.00050997856],"domain_scores_gemma":[0.9542304,0.03853951,0.0015673512,0.0028942858,0.0017678424,0.0010006109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025016645,0.00051198865,0.0015057364,0.0011439644,0.0016643339,0.0060763354,0.0020883419,0.0015170013,0.0063181357],"category_scores_gemma":[0.022572562,0.0008333637,0.0015242608,0.0013654708,0.0032371879,0.013340981,0.0027133345,0.0037459151,0.00044640453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002539579,0.00010836599,0.0019460294,0.00011455285,0.00003898959,0.0001968162,0.0009844246,0.03873389,0.0031156635,0.9445148,0.00081216585,0.009180437],"study_design_scores_gemma":[0.00002022274,0.000015910173,0.00035109394,0.0000072001403,0.000015972184,0.000044134653,0.000065297805,0.11296084,0.0010589963,0.8850876,0.00035416379,0.000018579245],"about_ca_topic_score_codex":0.0021679653,"about_ca_topic_score_gemma":0.0022868132,"teacher_disagreement_score":0.0063181357,"about_ca_system_score_codex":0.0029013183,"about_ca_system_score_gemma":0.0020236697,"threshold_uncertainty_score":0.021136224},"labels":[],"label_agreement":null},{"id":"W2061476943","doi":"10.1016/j.ipl.2005.05.029","title":"Periodic and Sturmian languages","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Bounded function; Mathematics; Complexity class; Discrete mathematics; Function (biology); Regular language; Computational complexity theory; Combinatorics; Formal language; Time complexity; Computer science; Theoretical computer science; Algorithm","score_opus":0.0027857875453301253,"score_gpt":0.1951722247371072,"score_spread":0.1923864371917771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061476943","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4906057,0.002576023,0.27747226,0.0034530517,0.0007566769,0.00009173275,0.00048368654,0.0009817429,0.22357917],"genre_scores_gemma":[0.9457217,0.0005294557,0.022146503,0.0003798717,0.00044491366,0.00008818961,0.00027416088,0.00010246676,0.030312818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951565,0.0001238909,0.00003845076,0.00011219007,0.00013704924,0.00007281005],"domain_scores_gemma":[0.99868304,0.00073556206,0.00013414584,0.00016106298,0.000185877,0.000100314435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065826724,0.00034502632,0.0004890262,0.0012452691,0.0013011235,0.0017704077,0.0005360012,0.000905575,0.009047861],"category_scores_gemma":[0.003379486,0.0003149642,0.00056704326,0.00082827045,0.002089639,0.003371568,0.00097478146,0.0009112265,0.0009614803],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002276722,0.000006772446,0.00006993243,0.000021578075,0.000002569168,0.0000948287,0.0002219362,0.00035778095,0.00058781845,0.99396133,0.00069946307,0.003953267],"study_design_scores_gemma":[0.0000066030943,0.000012721949,0.00009558612,0.000006564806,0.0000038255494,0.00017120666,0.00006192503,0.0034770174,0.00032361323,0.99356705,0.0022661197,0.000007851718],"about_ca_topic_score_codex":0.00035881784,"about_ca_topic_score_gemma":0.00040286046,"teacher_disagreement_score":0.009047861,"about_ca_system_score_codex":0.0005495012,"about_ca_system_score_gemma":0.00048404787,"threshold_uncertainty_score":0.030268133},"labels":[],"label_agreement":null},{"id":"W2061477093","doi":"10.1007/s00233-013-9483-x","title":"On commutation semigroups of dihedral groups","year":2013,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University; Dalhousie University","funders":"","keywords":"Mathematics; Commutation; Semigroup; Dihedral group; Mathematical proof; Order (exchange); Group (periodic table); Combinatorics; Pure mathematics; Algebra over a field; Discrete mathematics; Geometry; Physics; Quantum mechanics","score_opus":0.004984641046770753,"score_gpt":0.20453359973385857,"score_spread":0.1995489586870878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061477093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37456846,0.0061111185,0.52302265,0.0030775925,0.0012345823,0.00013264774,0.00059429253,0.00045768722,0.0908009],"genre_scores_gemma":[0.92194915,0.0021929515,0.046363305,0.0005156115,0.0010585577,0.00022994395,0.00049686874,0.0001336286,0.027059916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983773,0.0005111932,0.00014521951,0.00035983918,0.00035673493,0.00024970653],"domain_scores_gemma":[0.995301,0.0028223973,0.00036670736,0.00040173656,0.000500174,0.00060791057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029694794,0.000898285,0.0010025019,0.0025482578,0.0024550415,0.0033283702,0.0010048279,0.0011013157,0.007210433],"category_scores_gemma":[0.004687087,0.00056557235,0.0011026595,0.0021889566,0.0041059987,0.007413519,0.0027368444,0.0019190155,0.00089319964],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034451947,0.00001991311,0.00016095453,0.000022715647,0.000003823131,0.00008065802,0.000689556,0.00037405334,0.0007232707,0.9935614,0.00044701024,0.0038821688],"study_design_scores_gemma":[0.000015415431,0.00002143029,0.00012238948,0.000011267871,0.0000047051058,0.00007776055,0.000119728786,0.0020629622,0.00028088718,0.9936039,0.003666866,0.000012679518],"about_ca_topic_score_codex":0.00091615133,"about_ca_topic_score_gemma":0.0008475944,"teacher_disagreement_score":0.007210433,"about_ca_system_score_codex":0.001539608,"about_ca_system_score_gemma":0.0007334268,"threshold_uncertainty_score":0.024121284},"labels":[],"label_agreement":null},{"id":"W2062377295","doi":"10.1142/s0129054111008970","title":"THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Conjecture; Simple (philosophy); Automaton; Mathematics; Scheme (mathematics); Computer science; Discrete mathematics; Calculus (dental); Algebra over a field; Pure mathematics; Theoretical computer science; Epistemology; Philosophy","score_opus":0.014411216565540718,"score_gpt":0.25365818394005857,"score_spread":0.23924696737451784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062377295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1615074,0.0068868166,0.49000883,0.031755872,0.0032503405,0.000083037354,0.00034971855,0.0015730117,0.30458495],"genre_scores_gemma":[0.9444965,0.0020742512,0.030513784,0.004864109,0.0017945216,0.00008751598,0.00021984504,0.00029831222,0.015651148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995828,0.0011521324,0.00025425694,0.0011122476,0.0009928432,0.00066050625],"domain_scores_gemma":[0.9914697,0.0050017713,0.00057054154,0.0017832867,0.0009008821,0.0002738728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045653377,0.00051739055,0.0015434192,0.0011270875,0.0025252528,0.003080028,0.0012755382,0.0023488922,0.006514504],"category_scores_gemma":[0.016532766,0.0005153033,0.0015552582,0.0011316097,0.008638177,0.014279436,0.004295499,0.0046372833,0.0010949898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001950348,0.0000066780317,0.00015157787,0.00003442843,0.000004742113,0.000046539706,0.00008561104,0.00039741764,0.00018644593,0.9941803,0.0014115664,0.0034752935],"study_design_scores_gemma":[0.000008116732,0.0000055793776,0.00009251384,0.000012366568,0.0000045261067,0.000056270244,0.000022568032,0.0021532986,0.00037273992,0.99344736,0.0038160942,0.000008612631],"about_ca_topic_score_codex":0.00090329186,"about_ca_topic_score_gemma":0.0006999069,"teacher_disagreement_score":0.006514504,"about_ca_system_score_codex":0.0015302344,"about_ca_system_score_gemma":0.0010643435,"threshold_uncertainty_score":0.024144113},"labels":[],"label_agreement":null},{"id":"W2062558109","doi":"10.4171/owr/2010/37","title":"Mini-Workshop: Combinatorics on Words","year":2011,"lang":"en","type":"article","venue":"Oberwolfach Reports","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algebraic combinatorics; Combinatorics; Computer science; Mathematics","score_opus":0.03434793924279032,"score_gpt":0.23462574342155315,"score_spread":0.20027780417876284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062558109","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033716075,0.048112173,0.06920108,0.08088227,0.23165368,0.0008314431,0.007128397,0.0027588836,0.5257159],"genre_scores_gemma":[0.062762834,0.016586214,0.018518008,0.0034121484,0.050583072,0.0004514471,0.007237751,0.0016172401,0.83883125],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99900526,0.000257985,0.000054478787,0.00027499103,0.00023799262,0.00016942449],"domain_scores_gemma":[0.99796414,0.0003601962,0.000055290322,0.00019444567,0.00053658633,0.0008893314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014359574,0.0014097502,0.00093615655,0.0011253222,0.001568474,0.0038138798,0.0020341354,0.0015136019,0.15332888],"category_scores_gemma":[0.0019388656,0.0003614965,0.001315463,0.0010757641,0.00061027176,0.0033831014,0.0026771037,0.0026399347,0.067241386],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031418775,0.00014486065,0.0003455759,0.00068784924,0.000054611963,0.00026450754,0.0003073047,0.0007304332,0.0053926534,0.04012572,0.83702636,0.114605926],"study_design_scores_gemma":[0.000037950012,0.00014383193,0.0010230115,0.00023533595,0.000032047607,0.0002872185,0.00018694889,0.0010840099,0.0019919605,0.019487185,0.9754625,0.000027839089],"about_ca_topic_score_codex":0.00066688785,"about_ca_topic_score_gemma":0.0015959729,"teacher_disagreement_score":0.15332888,"about_ca_system_score_codex":0.0015153548,"about_ca_system_score_gemma":0.0018421664,"threshold_uncertainty_score":0.51293623},"labels":[],"label_agreement":null},{"id":"W2063737596","doi":"10.1016/j.tcs.2011.12.048","title":"State complexity of the concatenation of regular tree languages","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Regular language; Pumping lemma for regular languages; String (physics); Tree (set theory); Mathematics; Automaton; Combinatorics; State (computer science); Discrete mathematics; Formal language; Time complexity; Finite-state machine; Upper and lower bounds; Computer science; Algorithm; Theoretical computer science","score_opus":0.02546993447421071,"score_gpt":0.24267921759233238,"score_spread":0.21720928311812168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063737596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89953065,0.00036005932,0.08822673,0.0012409833,0.00004118201,0.00004840816,0.0009868972,0.00039977967,0.009165324],"genre_scores_gemma":[0.9896493,0.00013263444,0.0069707856,0.000047324433,0.00006762821,0.00005505254,0.00067146576,0.00007682663,0.0023290948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996819,0.00082227046,0.00028221725,0.0005473888,0.0010512236,0.0004779244],"domain_scores_gemma":[0.9522783,0.039947346,0.0025600002,0.0021049213,0.0017900133,0.0013194502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020935824,0.00039071485,0.0013859853,0.0014252722,0.0015058604,0.0061185663,0.0016247265,0.0014773766,0.0070066117],"category_scores_gemma":[0.019327274,0.0007513343,0.0012013047,0.0015345928,0.0023522791,0.011573947,0.0024514252,0.0025719835,0.00055102195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011855246,0.0002365818,0.008261061,0.00025925928,0.00009944657,0.0005631427,0.002062264,0.09347164,0.009153043,0.8617621,0.0022811522,0.02066472],"study_design_scores_gemma":[0.00004801303,0.000082000784,0.0017275398,0.00001994585,0.000048499234,0.00013903782,0.00018175361,0.31783065,0.003353207,0.67574483,0.000775616,0.000048941845],"about_ca_topic_score_codex":0.0019993866,"about_ca_topic_score_gemma":0.001977363,"teacher_disagreement_score":0.0070066117,"about_ca_system_score_codex":0.0023205634,"about_ca_system_score_gemma":0.0018214266,"threshold_uncertainty_score":0.023439467},"labels":[],"label_agreement":null},{"id":"W2063791259","doi":"10.1016/j.jpaa.2011.02.015","title":"Characterizations of Morita equivalent inverse semigroups","year":2011,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Morita equivalence; Semigroup; Inverse semigroup; Unitary state; Inverse; Pure mathematics; Equivalence (formal languages); Morita therapy; Bicyclic semigroup; Special classes of semigroups; Algebra over a field; Discrete mathematics","score_opus":0.021370342456618542,"score_gpt":0.21771284861544976,"score_spread":0.19634250615883123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063791259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5995236,0.0011319716,0.22503932,0.0013603383,0.00044648422,0.00013870119,0.00031693914,0.00044460336,0.17159814],"genre_scores_gemma":[0.9575524,0.00028487292,0.020332975,0.00033593582,0.00039445897,0.000088886714,0.00045019636,0.00014271786,0.020417497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836904,0.00030711127,0.00013983967,0.00036190124,0.0005640722,0.0002579518],"domain_scores_gemma":[0.99656063,0.0015345989,0.0003097872,0.00032901348,0.0007773984,0.0004884944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015698673,0.00058554666,0.00069981423,0.0028085369,0.0017919436,0.0037743412,0.0010372585,0.0013565174,0.009280833],"category_scores_gemma":[0.003997382,0.00065317686,0.0013526742,0.00080197206,0.0025253117,0.0057276664,0.0026018585,0.0028362845,0.0008828313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007392272,0.000054566746,0.0003750361,0.00003227086,0.000009480099,0.0001875547,0.00072486495,0.0002242393,0.0024346344,0.9914083,0.00041487912,0.0040601916],"study_design_scores_gemma":[0.000027636812,0.00006515797,0.00075525127,0.00002838755,0.000024991077,0.0006822307,0.000475869,0.0062730783,0.0029097155,0.982003,0.0067194165,0.000035173696],"about_ca_topic_score_codex":0.00023696716,"about_ca_topic_score_gemma":0.00025547927,"teacher_disagreement_score":0.009280833,"about_ca_system_score_codex":0.0008724977,"about_ca_system_score_gemma":0.00036239898,"threshold_uncertainty_score":0.031047463},"labels":[],"label_agreement":null},{"id":"W2063858816","doi":"10.1142/s021819670400202x","title":"ON SEMIGROUPS WHOSE IDEMPOTENT-GENERATED SUBSEMIGROUP IS APERIODIC","year":2004,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Centro de Matemática Universidade do Porto; Fundação para a Ciência e a Tecnologia","keywords":"Mathematics; Idempotence; Aperiodic graph; Semigroup; Wreath product; Iterated function; Combinatorics; Pure mathematics; Product (mathematics); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.009276668163932947,"score_gpt":0.2518130665495769,"score_spread":0.24253639838564398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063858816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70358616,0.00088498637,0.26761347,0.00023109687,0.00012776944,0.000065715154,0.00012384336,0.00028220683,0.027084772],"genre_scores_gemma":[0.95694065,0.0005513265,0.033509027,0.000062870546,0.00014351109,0.000069987356,0.00020764415,0.00006500759,0.008449981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992093,0.00014329316,0.00006690317,0.00018361853,0.00023343929,0.00016331853],"domain_scores_gemma":[0.9970348,0.0012375549,0.00061395095,0.0003742792,0.0003650498,0.00037432162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001109871,0.00054170866,0.0004377317,0.00096804975,0.0010968383,0.0014739563,0.0005704511,0.00049110845,0.0022510707],"category_scores_gemma":[0.0029187528,0.0003199476,0.00068143796,0.00055112905,0.0029855699,0.0030149908,0.0015360584,0.000871729,0.00073255535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017453302,0.00007910907,0.0020827006,0.00014915438,0.000017640194,0.001337966,0.002617182,0.0041754358,0.018356306,0.95059097,0.00042196436,0.019996986],"study_design_scores_gemma":[0.000042598323,0.00037536732,0.0019534645,0.000054653057,0.000029113211,0.0010575844,0.0006436662,0.026455263,0.016489392,0.9421444,0.0107033355,0.00005113739],"about_ca_topic_score_codex":0.00038811273,"about_ca_topic_score_gemma":0.00039903444,"teacher_disagreement_score":0.0022510707,"about_ca_system_score_codex":0.00061181246,"about_ca_system_score_gemma":0.0003689433,"threshold_uncertainty_score":0.00753057},"labels":[],"label_agreement":null},{"id":"W2064603234","doi":"10.4236/ojdm.2013.31002","title":"Counting Types of Runs in Classes of Arborescent Words","year":2013,"lang":"en","type":"article","venue":"Open Journal of Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Alphabet; Combinatorics; Word (group theory); Context (archaeology); Type (biology); Root (linguistics); Tree (set theory); Point (geometry); Set (abstract data type); Computer science; Geometry; Biology; Linguistics","score_opus":0.01700377759767581,"score_gpt":0.2718911566169423,"score_spread":0.2548873790192665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064603234","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8308351,0.00091570575,0.14844215,0.0004261043,0.00014619774,0.00014881304,0.0019605826,0.00082171126,0.016303651],"genre_scores_gemma":[0.9444126,0.00045585973,0.044993427,0.00014029842,0.00028633626,0.00031913246,0.0019224413,0.00031729645,0.007152685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99598736,0.00048893335,0.0006548937,0.0012612505,0.00095920864,0.0006482845],"domain_scores_gemma":[0.9760477,0.013825132,0.0030498488,0.0022236316,0.002428979,0.0024246303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00201236,0.00069622934,0.0010282912,0.0051427865,0.0020327072,0.005294856,0.0021686358,0.0016583162,0.006849403],"category_scores_gemma":[0.016701594,0.0010291052,0.00123352,0.0027486624,0.0032077588,0.0088277655,0.0023480745,0.001502656,0.0007759173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000864942,0.00017147511,0.03634464,0.00054476754,0.00015394475,0.0012024916,0.0031028895,0.008473166,0.017146163,0.8826448,0.002874157,0.04647661],"study_design_scores_gemma":[0.000067975714,0.00014685036,0.0067069153,0.00016559463,0.00012251029,0.002007987,0.00095807615,0.035607085,0.008217798,0.9358035,0.010063242,0.00013238488],"about_ca_topic_score_codex":0.00067986426,"about_ca_topic_score_gemma":0.00074373407,"teacher_disagreement_score":0.006849403,"about_ca_system_score_codex":0.0017313535,"about_ca_system_score_gemma":0.00062451226,"threshold_uncertainty_score":0.022913575},"labels":[],"label_agreement":null},{"id":"W2065040823","doi":"10.1016/j.ipl.2006.11.008","title":"On the context-freeness of the set of words containing overlaps","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Context (archaeology); Set (abstract data type); Computer science; Theoretical computer science; Algorithm; Mathematics; Programming language; History","score_opus":0.007714664186438252,"score_gpt":0.20165906239308723,"score_spread":0.19394439820664897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065040823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65214384,0.002399638,0.2980583,0.0035030595,0.00029162737,0.00013255808,0.001872275,0.00067162147,0.040927038],"genre_scores_gemma":[0.9611298,0.0007521576,0.032338854,0.0005670803,0.00059354515,0.0002405097,0.0010875146,0.0002036206,0.0030870603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99287957,0.0018329807,0.000844083,0.0021314272,0.0014286415,0.0008834146],"domain_scores_gemma":[0.9154099,0.06872406,0.0035151786,0.005780833,0.003874378,0.0026956357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00564799,0.000986043,0.0024932174,0.0047570686,0.0058119306,0.007602217,0.0026690874,0.002878103,0.005505059],"category_scores_gemma":[0.031485897,0.0015928084,0.0021931608,0.0034631386,0.008902026,0.014306362,0.0052426327,0.003220419,0.00073177845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039892455,0.00008890724,0.0020391557,0.00018476849,0.00008357895,0.00050772517,0.0017350418,0.005231743,0.003751243,0.97450155,0.0009092708,0.01056807],"study_design_scores_gemma":[0.00003720257,0.000043698437,0.0006212032,0.0000666286,0.000057827398,0.0004446736,0.00024429648,0.012733561,0.0012974879,0.9831513,0.0012589232,0.000043081927],"about_ca_topic_score_codex":0.0010313316,"about_ca_topic_score_gemma":0.00075704325,"teacher_disagreement_score":0.007602217,"about_ca_system_score_codex":0.0011708456,"about_ca_system_score_gemma":0.0017629822,"threshold_uncertainty_score":0.029869795},"labels":[],"label_agreement":null},{"id":"W2066620717","doi":"10.1016/j.ic.2008.03.018","title":"State complexity of basic language operations combined with reversal","year":2008,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Computer science; Theoretical computer science; Programming language; Algorithm","score_opus":0.016258325271429355,"score_gpt":0.2311490287129097,"score_spread":0.21489070344148037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066620717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5143172,0.00068038126,0.44843075,0.0022781682,0.00020527863,0.00016244267,0.0008420839,0.0011892015,0.031894553],"genre_scores_gemma":[0.97327393,0.00024065931,0.021917438,0.00010177958,0.00015594871,0.00010162071,0.000364672,0.00020455797,0.0036394605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720484,0.0007299404,0.00022850961,0.00046154315,0.0008870434,0.00048815753],"domain_scores_gemma":[0.953989,0.03498785,0.0016382922,0.0064444137,0.0018793684,0.0010609676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031009084,0.0006574638,0.0019932361,0.0015221881,0.001343486,0.005875134,0.0024884085,0.0020649433,0.012373181],"category_scores_gemma":[0.0276492,0.00086531416,0.0020450552,0.0018493015,0.0031589393,0.01541734,0.00281572,0.003935843,0.00086019427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046749445,0.00013456408,0.0012006154,0.00015025701,0.000028876679,0.00014406045,0.0003171711,0.03913746,0.004103403,0.93113613,0.0020465318,0.021133482],"study_design_scores_gemma":[0.000031960706,0.00004719056,0.00037371286,0.000011723537,0.00002840197,0.00009248799,0.00005498032,0.17651123,0.0030819466,0.81918347,0.0005471883,0.00003580884],"about_ca_topic_score_codex":0.001531146,"about_ca_topic_score_gemma":0.001352883,"teacher_disagreement_score":0.012373181,"about_ca_system_score_codex":0.002062082,"about_ca_system_score_gemma":0.0021936335,"threshold_uncertainty_score":0.041392386},"labels":[],"label_agreement":null},{"id":"W2066849493","doi":"10.1016/j.tcs.2010.11.009","title":"Block insertion and deletion on trajectories","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Block (permutation group theory); Arithmetic; Mathematics; Algorithm; Combinatorics; Computer science","score_opus":0.005196956732381941,"score_gpt":0.21990452062673832,"score_spread":0.21470756389435638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066849493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26564685,0.000514026,0.6920134,0.0007554597,0.000304532,0.00016310297,0.0010622037,0.0012487168,0.03829171],"genre_scores_gemma":[0.7816876,0.000919446,0.13377991,0.00017388185,0.00013489445,0.00031749625,0.0015305699,0.000734505,0.0807217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879515,0.00018348974,0.00008997924,0.00028779576,0.0003721833,0.00027137506],"domain_scores_gemma":[0.996793,0.0013023699,0.00032058204,0.00075226015,0.0005396057,0.00029218348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066857366,0.00052808033,0.0008898795,0.0011344731,0.0017309488,0.0018585322,0.0013615543,0.0013486268,0.0135195125],"category_scores_gemma":[0.005208965,0.00047040405,0.00096824486,0.0018029081,0.0020193686,0.0053004017,0.0024443076,0.0014644524,0.0026853255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024637766,0.000032984648,0.0006231937,0.00007797276,0.000010699749,0.00043953813,0.0006418934,0.0075583165,0.008732873,0.9560971,0.001412678,0.024126403],"study_design_scores_gemma":[0.00003919453,0.00006995581,0.00042245563,0.000030948555,0.000023930865,0.00042131176,0.0004170376,0.04253739,0.013097642,0.9264849,0.016421052,0.000034188648],"about_ca_topic_score_codex":0.0020440503,"about_ca_topic_score_gemma":0.0013763432,"teacher_disagreement_score":0.0135195125,"about_ca_system_score_codex":0.0011215786,"about_ca_system_score_gemma":0.0010629775,"threshold_uncertainty_score":0.04522729},"labels":[],"label_agreement":null},{"id":"W2067003407","doi":"10.1142/s1793042110002958","title":"THE TRANSCENDENCE OF SERIES RELATED TO STERN'S DIATOMIC SEQUENCE","year":2010,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stern; Sequence (biology); Transcendence (philosophy); Transcendental number; Mathematics; Series (stratigraphy); Power series; Generating function; Function (biology); Pure mathematics; Combinatorics; Mathematical analysis; Philosophy; Epistemology","score_opus":0.006925113414609191,"score_gpt":0.2767197288227818,"score_spread":0.2697946154081726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067003407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5743305,0.0022735037,0.2669127,0.0010808173,0.00061070867,0.000077299715,0.00018423866,0.00030304858,0.1542272],"genre_scores_gemma":[0.9597043,0.0013945533,0.011124666,0.00019971778,0.00058605336,0.000067192916,0.00011091242,0.000094859555,0.026717765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954885,0.000077583005,0.000023099721,0.000097172066,0.0001702433,0.00008298285],"domain_scores_gemma":[0.99779,0.0008633895,0.0002934973,0.00021249165,0.00045606162,0.00038462554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091942307,0.0008836796,0.0006800201,0.0028390181,0.0010136709,0.001699566,0.00094383146,0.00056500983,0.008645911],"category_scores_gemma":[0.0041801296,0.00025588615,0.0008430467,0.0013256933,0.002563119,0.0030621793,0.0013036092,0.0018426864,0.0019335478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027282731,0.000019092517,0.0002275217,0.000047541103,0.000007846007,0.00015213908,0.00036751374,0.0013474342,0.00291204,0.9860194,0.00043536417,0.008437026],"study_design_scores_gemma":[0.000017318269,0.000102103906,0.0005709971,0.00003165509,0.000017995615,0.00055457244,0.00014657462,0.011291084,0.0054053674,0.97372514,0.008109617,0.000027542708],"about_ca_topic_score_codex":0.00044066337,"about_ca_topic_score_gemma":0.00021859027,"teacher_disagreement_score":0.008645911,"about_ca_system_score_codex":0.0011742014,"about_ca_system_score_gemma":0.00054750533,"threshold_uncertainty_score":0.028923512},"labels":[],"label_agreement":null},{"id":"W2070037875","doi":"10.1016/j.ejc.2005.11.005","title":"Dejean’s conjecture and Sturmian words","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"University of Tehran","keywords":"Conjecture; Mathematics; Alphabet; Repetition (rhetorical device); Combinatorics; Word (group theory); Combinatorics on words; Quadratic equation; Discrete mathematics; Geometry; Linguistics","score_opus":0.00414040258297324,"score_gpt":0.17869109342052547,"score_spread":0.17455069083755223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070037875","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.438769,0.0037964014,0.08683373,0.037016198,0.0023380711,0.000063352694,0.00068310817,0.0005597706,0.42994034],"genre_scores_gemma":[0.9521302,0.00072169007,0.011209134,0.002815609,0.0009741939,0.00008596045,0.00044755856,0.00009262704,0.031522956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987986,0.0003113012,0.00007010549,0.00034208733,0.00021980575,0.00025812158],"domain_scores_gemma":[0.9970151,0.0017785345,0.00016973581,0.0004528162,0.0003589563,0.00022490502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018205479,0.0008047382,0.0015768876,0.001964695,0.005162189,0.0034896554,0.001418316,0.003714751,0.01148304],"category_scores_gemma":[0.0061434144,0.00078748097,0.0013556638,0.0022538335,0.006910946,0.011291586,0.0035590914,0.003963433,0.0013692778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043201013,0.000014645903,0.00015415618,0.000021412252,0.00000470024,0.000058235077,0.00024164579,0.00033277227,0.00013307863,0.9948992,0.0020548208,0.002042112],"study_design_scores_gemma":[0.0000102021495,0.0000044862218,0.000082414095,0.0000046655955,0.0000031498084,0.00003333802,0.000056308985,0.00054560596,0.00006877601,0.99684477,0.0023402113,0.000005930703],"about_ca_topic_score_codex":0.0022662492,"about_ca_topic_score_gemma":0.002714845,"teacher_disagreement_score":0.01148304,"about_ca_system_score_codex":0.0020680951,"about_ca_system_score_gemma":0.00085885846,"threshold_uncertainty_score":0.038414598},"labels":[],"label_agreement":null},{"id":"W2071685823","doi":"10.1007/s002360000037","title":"Efficiently building a parse tree from a regular expression","year":2000,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Parse tree; Parsing; Computer science; String (physics); Theory of computation; Tree (set theory); Regular expression; Representation (politics); Time complexity; Parsing expression grammar; Rule-based machine translation; Context (archaeology); Theoretical computer science; S-attributed grammar; Algorithm; Artificial intelligence; Context-free grammar; L-attributed grammar; Mathematics; Programming language; Combinatorics","score_opus":0.005874499761680074,"score_gpt":0.20309901389285406,"score_spread":0.19722451413117398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071685823","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036547083,0.00045899782,0.9146314,0.0011703987,0.00025219723,0.0003196261,0.0033608358,0.035827775,0.0074316673],"genre_scores_gemma":[0.15964986,0.00049376924,0.8175924,0.00039240214,0.0001179027,0.00027491178,0.008401017,0.006201248,0.0068764114],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877053,0.00028639208,0.00009655934,0.00027655708,0.00044387823,0.00012607532],"domain_scores_gemma":[0.9951504,0.0036226935,0.00010968242,0.00046274788,0.000576194,0.00007826204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008835605,0.0011304973,0.0016740797,0.0014850292,0.0010697468,0.002212041,0.0015080208,0.0015141071,0.0092424955],"category_scores_gemma":[0.006677561,0.0011991292,0.002228941,0.0018801544,0.0010184117,0.004365948,0.0024492654,0.0025654205,0.0056803375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006726094,0.00038647035,0.0024169018,0.002081222,0.00021888637,0.002095241,0.001672525,0.038255952,0.04938561,0.1205101,0.09405928,0.6882452],"study_design_scores_gemma":[0.0002501465,0.00022735645,0.0010279133,0.00026293396,0.00033837202,0.0011570081,0.0008379933,0.5001781,0.061229847,0.36092028,0.073418096,0.00015199232],"about_ca_topic_score_codex":0.0017894384,"about_ca_topic_score_gemma":0.003449479,"teacher_disagreement_score":0.0092424955,"about_ca_system_score_codex":0.00070811826,"about_ca_system_score_gemma":0.002172488,"threshold_uncertainty_score":0.030919254},"labels":[],"label_agreement":null},{"id":"W2071784365","doi":"10.1007/s00224-004-1190-2","title":"Complete Classifications for the Communication Complexity of Regular Languages","year":2004,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Programming language; Linguistics; Philosophy","score_opus":0.0637492406813639,"score_gpt":0.2897090998430529,"score_spread":0.22595985916168898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071784365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21820791,0.0053272964,0.65292823,0.010591998,0.0007595194,0.0002569432,0.00400098,0.0011218324,0.10680533],"genre_scores_gemma":[0.8860229,0.0028462012,0.07046929,0.0014725939,0.0024335135,0.0011573153,0.004736301,0.00069879694,0.030163042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99355537,0.0015529579,0.00050050864,0.0012017915,0.0023115615,0.00087765977],"domain_scores_gemma":[0.94605714,0.041303143,0.002352277,0.005250106,0.0033275664,0.0017099263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005276739,0.0016900735,0.0026487894,0.00545179,0.0038155068,0.010681844,0.0045987545,0.00417109,0.018959519],"category_scores_gemma":[0.029261613,0.0012122968,0.0025194497,0.0046977075,0.006186601,0.030812738,0.005119076,0.008994316,0.0022922636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056689834,0.000030086647,0.00034387648,0.000079230645,0.000010875587,0.000020767953,0.00029896514,0.0021787588,0.0002248724,0.9862889,0.003525697,0.006941205],"study_design_scores_gemma":[0.000011247481,0.000008308208,0.00019013969,0.000021376827,0.000009871351,0.000032339853,0.000065866996,0.009814542,0.00017844535,0.98787606,0.0017763105,0.000015425252],"about_ca_topic_score_codex":0.0010741799,"about_ca_topic_score_gemma":0.0007878926,"teacher_disagreement_score":0.018959519,"about_ca_system_score_codex":0.0045255376,"about_ca_system_score_gemma":0.0016737778,"threshold_uncertainty_score":0.0634259},"labels":[],"label_agreement":null},{"id":"W2072220447","doi":"10.1016/j.tcs.2014.07.015","title":"On the maximality of languages with combined types of code properties","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; St. Mary's University; Western University","funders":"","keywords":"Decidability; Property (philosophy); Mathematics; Formal language; Regular language; Suffix; Code (set theory); Type (biology); Discrete mathematics; Computer science; Algorithm; Theoretical computer science; Automaton; Programming language; Linguistics","score_opus":0.009412736562524896,"score_gpt":0.21528818336526637,"score_spread":0.20587544680274147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072220447","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59753054,0.001792217,0.32931843,0.004842245,0.00028408284,0.00013493902,0.0009751217,0.00097496825,0.064147495],"genre_scores_gemma":[0.96393704,0.00038170972,0.0288422,0.0005956291,0.0004050515,0.00015799631,0.0004761653,0.00034115167,0.0048630876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992993,0.002489571,0.00054795796,0.0016512516,0.0011962375,0.0011220059],"domain_scores_gemma":[0.9205425,0.0660642,0.003518493,0.0043579154,0.0027357726,0.0027811218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062150424,0.0009511594,0.0022598784,0.0026702972,0.004302075,0.0070320033,0.0030316503,0.0032131195,0.006146082],"category_scores_gemma":[0.029246861,0.0025487696,0.0034137715,0.0018668808,0.010668136,0.01779221,0.0075262617,0.0059619676,0.0007647619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021509429,0.000047026428,0.0009925746,0.00010078575,0.000031010004,0.00017654592,0.00076309557,0.0022751938,0.0018632923,0.9897316,0.000608802,0.0031948753],"study_design_scores_gemma":[0.00004291996,0.00003593793,0.00028454486,0.00004236446,0.000039202434,0.00024262421,0.0001882013,0.008935725,0.0012156122,0.9878962,0.0010429859,0.00003370359],"about_ca_topic_score_codex":0.0009854748,"about_ca_topic_score_gemma":0.001031913,"teacher_disagreement_score":0.0070320033,"about_ca_system_score_codex":0.0020318746,"about_ca_system_score_gemma":0.0019036426,"threshold_uncertainty_score":0.032868624},"labels":[],"label_agreement":null},{"id":"W2072229649","doi":"10.1007/s11511-011-0065-z","title":"Markoff–Lagrange spectrum and extremal numbers","year":2011,"lang":"en","type":"article","venue":"Acta Mathematica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Irrational number; Bijection; Zero (linguistics); Integer (computer science); Real number; Geometry","score_opus":0.024796783038986494,"score_gpt":0.20577983862229546,"score_spread":0.18098305558330896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072229649","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40983546,0.0061842534,0.13221967,0.008481919,0.00068415655,0.000053567535,0.00040052872,0.00031833825,0.44182208],"genre_scores_gemma":[0.96245503,0.0013886995,0.013209527,0.00048031757,0.00037877882,0.00006956223,0.00014870641,0.000072990115,0.021796443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994654,0.00014970276,0.000017222837,0.000089623434,0.00016040374,0.000117589254],"domain_scores_gemma":[0.999353,0.0002302534,0.00012476169,0.000065295535,0.00009298856,0.00013363434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097190205,0.00067691837,0.0006095774,0.0022793065,0.0015278574,0.0024046618,0.00091232033,0.0010606732,0.0074439044],"category_scores_gemma":[0.0032011576,0.00031402035,0.0005554937,0.0010010059,0.003163843,0.0022799042,0.001440794,0.0019595313,0.0012231866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076108013,0.000004808374,0.000071142946,0.000012221754,0.0000026361668,0.000021107351,0.000031186406,0.0008206816,0.00020792097,0.9968142,0.0005501298,0.0014563858],"study_design_scores_gemma":[0.0000058687,0.000005679981,0.00014888182,0.000014148484,0.0000015864368,0.00003786356,0.00002318605,0.0072891004,0.00016958885,0.99061173,0.0016837794,0.000008506608],"about_ca_topic_score_codex":0.0009842644,"about_ca_topic_score_gemma":0.0007669499,"teacher_disagreement_score":0.0074439044,"about_ca_system_score_codex":0.0022100557,"about_ca_system_score_gemma":0.0006516889,"threshold_uncertainty_score":0.024902344},"labels":[],"label_agreement":null},{"id":"W2072322452","doi":"10.1016/j.tcs.2004.12.027","title":"Constructing divisions into power groups","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Constructive; Modulo; Conjecture; Mathematics; Group (periodic table); Constructive proof; Algebra over a field; Semigroup; Class (philosophy); Group theory; Algebraic number; Block (permutation group theory); Power (physics); Pure mathematics; Discrete mathematics; Computer science; Combinatorics; Programming language; Artificial intelligence; Mathematical analysis","score_opus":0.005845672047779444,"score_gpt":0.23981276081340724,"score_spread":0.2339670887656278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072322452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31521899,0.00042957644,0.5265809,0.0015151852,0.0004141322,0.00017004187,0.00022662533,0.0014525573,0.153992],"genre_scores_gemma":[0.8441218,0.00025074123,0.11053766,0.00034469488,0.00014223723,0.00014417131,0.00035905273,0.00060787593,0.043491792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991466,0.00026490464,0.000045904024,0.00020871576,0.00015100349,0.00018290251],"domain_scores_gemma":[0.998151,0.0010001605,0.00008504302,0.00046782522,0.00011551123,0.00018033439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074766844,0.0006116606,0.0008596477,0.00095031835,0.0020531407,0.0022615155,0.0011714458,0.0008345955,0.013479546],"category_scores_gemma":[0.0026368632,0.0007985123,0.0011392816,0.0011684352,0.0035100454,0.005874198,0.004044396,0.0027344574,0.0032044947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007078961,0.00003368021,0.00021608449,0.00003954407,0.000008200394,0.00010413668,0.0012076236,0.0011533779,0.0027292634,0.9729592,0.0016374675,0.019840611],"study_design_scores_gemma":[0.000023070634,0.000021682716,0.0000852262,0.000012373836,0.000011090533,0.00006494262,0.00024779106,0.0026320748,0.0026383535,0.9834394,0.010815903,0.000008093466],"about_ca_topic_score_codex":0.000337348,"about_ca_topic_score_gemma":0.00048980553,"teacher_disagreement_score":0.013479546,"about_ca_system_score_codex":0.0007792933,"about_ca_system_score_gemma":0.0003721971,"threshold_uncertainty_score":0.045093596},"labels":[],"label_agreement":null},{"id":"W2072570893","doi":"10.1051/ita/2011112","title":"Multi-dimensional sets recognizable in all abstract numeration systems","year":2011,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Arithmetic; Discrete mathematics; Algebra over a field; Combinatorics; Pure mathematics","score_opus":0.03686374755198837,"score_gpt":0.2659644655075115,"score_spread":0.22910071795552314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072570893","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67809844,0.0008536206,0.27630243,0.0006456836,0.00018444384,0.00008047634,0.0005387739,0.00151299,0.041783124],"genre_scores_gemma":[0.9663644,0.00015890179,0.027192296,0.00015453386,0.000071974864,0.00010075773,0.0004329517,0.00007357967,0.0054506687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798054,0.00028217907,0.00018019872,0.0007580807,0.00052177504,0.0002772466],"domain_scores_gemma":[0.99631846,0.0014354107,0.00067311,0.0008570984,0.00048722408,0.00022875066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000741284,0.0004966874,0.0007418671,0.0011923795,0.0011878925,0.0035414214,0.0007605264,0.0011072741,0.0040773614],"category_scores_gemma":[0.0034849176,0.0005631174,0.0009565008,0.0007810285,0.0027604182,0.004086241,0.0023639852,0.0017672832,0.0006443046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024741545,0.00010422735,0.0031802,0.0002372189,0.000050961236,0.00059614104,0.0026815797,0.009332916,0.033875823,0.9129623,0.001011512,0.03571961],"study_design_scores_gemma":[0.00004107296,0.00014195213,0.0029066515,0.000069659814,0.00004084998,0.00082224066,0.00052905316,0.017854588,0.018686272,0.94847554,0.0103630815,0.00006914026],"about_ca_topic_score_codex":0.0004064981,"about_ca_topic_score_gemma":0.00029416042,"teacher_disagreement_score":0.0040773614,"about_ca_system_score_codex":0.0007783296,"about_ca_system_score_gemma":0.0004794656,"threshold_uncertainty_score":0.013640165},"labels":[],"label_agreement":null},{"id":"W2073003100","doi":"10.1007/s002330010066","title":"Tensor products and preservation of limits, for acts over monoids","year":2001,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Functor; Mathematics; Limit (mathematics); Monoid; Pure mathematics; Flatness (cosmology); Tensor product; Algebra over a field; Mathematical analysis","score_opus":0.016759434268917513,"score_gpt":0.24257169445265764,"score_spread":0.22581226018374012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073003100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35204688,0.0074623064,0.58306646,0.002919657,0.0009558422,0.00011722368,0.0008450169,0.0010261204,0.051560514],"genre_scores_gemma":[0.91765517,0.0032290875,0.05512862,0.0004297125,0.00084305904,0.0001925463,0.0007226904,0.000355213,0.021443866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99636286,0.0009798369,0.0005881629,0.0009197263,0.00069328945,0.0004561646],"domain_scores_gemma":[0.9890764,0.0050388505,0.0011940979,0.001925388,0.0016054973,0.0011597803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063424394,0.0010500501,0.0012123719,0.0031665328,0.0036029234,0.007615669,0.0017317769,0.0016480059,0.0032942255],"category_scores_gemma":[0.0144144315,0.0011172657,0.0021531538,0.003204286,0.00922618,0.025320748,0.0051262747,0.0039703064,0.000669831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009363556,0.00002836869,0.0004083344,0.000055926157,0.000013504837,0.00012239988,0.0011752541,0.0005693481,0.00080420583,0.98963416,0.0005106717,0.006584263],"study_design_scores_gemma":[0.000013932375,0.00004090823,0.00022137443,0.00002002141,0.000027059146,0.00018107024,0.00026759857,0.0023640133,0.0009895068,0.9924907,0.0033586987,0.000025040303],"about_ca_topic_score_codex":0.0015253382,"about_ca_topic_score_gemma":0.0010325257,"teacher_disagreement_score":0.007615669,"about_ca_system_score_codex":0.0016438087,"about_ca_system_score_gemma":0.0014256149,"threshold_uncertainty_score":0.033542454},"labels":[],"label_agreement":null},{"id":"W2073231246","doi":"10.1016/j.disc.2011.01.011","title":"Coding discretizations of continuous functions","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Discretization; Subsequence; Coding (social sciences); Sequence (biology); Limit (mathematics); Discrete mathematics; Applied mathematics; Algorithm; Mathematical analysis; Statistics","score_opus":0.0264572524158426,"score_gpt":0.2299051483951956,"score_spread":0.203447895979353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073231246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11439302,0.00071180984,0.8478844,0.0008424722,0.00029942428,0.000045265795,0.00046437257,0.00043477607,0.034924433],"genre_scores_gemma":[0.87285227,0.0006426694,0.10616867,0.00029314792,0.00018882738,0.00013283575,0.0006519952,0.00020637122,0.018863061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999158,0.00026522318,0.000053503918,0.00014678757,0.00027568275,0.00010074073],"domain_scores_gemma":[0.9966614,0.002016647,0.00014821884,0.0006143312,0.0003653909,0.00019404078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087646215,0.00039499768,0.00059301226,0.0010072778,0.0006074087,0.0019549346,0.0009768598,0.00085763336,0.006892927],"category_scores_gemma":[0.0049091126,0.0003480862,0.0008206263,0.0009383556,0.0021070873,0.0025953639,0.0012811951,0.002181589,0.0007056648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025563448,0.000010067431,0.00008773365,0.000025699506,0.0000044087337,0.000027301205,0.00013130836,0.008203702,0.0008445357,0.9835539,0.00061456836,0.006471227],"study_design_scores_gemma":[0.000015828993,0.000016865115,0.00010403717,0.000018213534,0.000005006511,0.000044696055,0.00006679557,0.07304927,0.0008068587,0.9235213,0.0023383175,0.000012838234],"about_ca_topic_score_codex":0.0015763382,"about_ca_topic_score_gemma":0.0013230774,"teacher_disagreement_score":0.006892927,"about_ca_system_score_codex":0.0013547854,"about_ca_system_score_gemma":0.000630036,"threshold_uncertainty_score":0.02305913},"labels":[],"label_agreement":null},{"id":"W2073495011","doi":"10.1142/s0129054110007441","title":"FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME","year":2010,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polynomial; Time complexity; Context (archaeology); Context-free language; Context-free grammar; Rule-based machine translation; Mathematics; Square-free polynomial; Matrix polynomial; Monic polynomial; Order (exchange); Discrete mathematics; Combinatorics; Computer science; Artificial intelligence","score_opus":0.009884880501276559,"score_gpt":0.2769687651552374,"score_spread":0.2670838846539608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073495011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2756659,0.00047940132,0.7033756,0.0022345276,0.00011832814,0.00037366306,0.0013057503,0.005863044,0.010583706],"genre_scores_gemma":[0.53309196,0.00036601027,0.4585104,0.00036027844,0.00010176677,0.000405286,0.001761095,0.00093767233,0.004465559],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738485,0.0004377186,0.0001964882,0.0008792274,0.00057138456,0.00053026935],"domain_scores_gemma":[0.9749961,0.02059214,0.0013773447,0.0013380744,0.0011822878,0.0005141321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018189992,0.0010860991,0.0011599278,0.0011395274,0.0009802983,0.0030206766,0.0015272843,0.0014676662,0.005852648],"category_scores_gemma":[0.015458175,0.00083855406,0.0024439343,0.0011182697,0.0017143085,0.005433528,0.0017035308,0.0025952614,0.0017369626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003945558,0.0007962399,0.024018016,0.002619886,0.00041872068,0.0014604155,0.002114288,0.25896662,0.19995369,0.128629,0.020912621,0.3561649],"study_design_scores_gemma":[0.0003563035,0.0003747156,0.0019337027,0.00012657553,0.0001873043,0.0009668149,0.00055628346,0.6661088,0.061139796,0.26274934,0.005368493,0.00013191707],"about_ca_topic_score_codex":0.0034243441,"about_ca_topic_score_gemma":0.004006115,"teacher_disagreement_score":0.005852648,"about_ca_system_score_codex":0.0018619726,"about_ca_system_score_gemma":0.0026450003,"threshold_uncertainty_score":0.019579053},"labels":[],"label_agreement":null},{"id":"W2073577522","doi":"10.1016/s0304-3975(02)00543-1","title":"On the closure properties of linear conjunctive languages","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Indexed grammar; Context-sensitive grammar; Closure (psychology); Context-free grammar; Definite clause grammar; Mathematics; L-attributed grammar; Phrase structure grammar; Rule-based machine translation; Computer science; Discrete mathematics; Tree-adjoining grammar; Context-free language; Artificial intelligence","score_opus":0.011894322274946273,"score_gpt":0.22842020011947572,"score_spread":0.21652587784452945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073577522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47851112,0.0045749415,0.40168765,0.008472922,0.0005597085,0.00022781007,0.0012901643,0.0011281424,0.10354754],"genre_scores_gemma":[0.9360494,0.0018494605,0.046524394,0.0010175529,0.0009524666,0.00021630374,0.0013337848,0.00043566857,0.011621032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738127,0.00079805666,0.00024221929,0.0005209428,0.0006354013,0.00042212225],"domain_scores_gemma":[0.9550427,0.038547967,0.0016144819,0.0019705803,0.0017258353,0.0010983926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047461977,0.0007699112,0.0015568177,0.0018284478,0.0026315388,0.005187367,0.0019957656,0.0018303223,0.008017726],"category_scores_gemma":[0.017797528,0.0011749073,0.0020365345,0.0020288958,0.006733885,0.018693402,0.0037012573,0.005059024,0.00089786144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005425253,0.00018377365,0.0011635418,0.00021288209,0.00003262275,0.00061316654,0.0022740688,0.003136662,0.004976492,0.967378,0.002735728,0.016750472],"study_design_scores_gemma":[0.00006146884,0.00006757221,0.00035354678,0.000038297836,0.00002307175,0.00020165046,0.00029867617,0.0095102815,0.0013125233,0.9857905,0.002317741,0.000024710771],"about_ca_topic_score_codex":0.002011122,"about_ca_topic_score_gemma":0.001185421,"teacher_disagreement_score":0.008017726,"about_ca_system_score_codex":0.001938159,"about_ca_system_score_gemma":0.0012090667,"threshold_uncertainty_score":0.026821971},"labels":[],"label_agreement":null},{"id":"W2074221742","doi":"10.1142/s0129054108005838","title":"STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Finite-state machine; Deterministic finite automaton; Alphabet; Intersection (aeronautics); Regular language; Nondeterministic finite automaton; Mathematics; Upper and lower bounds; Automaton; State (computer science); Discrete mathematics; Finite state; Quantum finite automata; Combinatorics; Computer science; Automata theory; Theoretical computer science; Algorithm","score_opus":0.029569320463496206,"score_gpt":0.2988042262286668,"score_spread":0.2692349057651706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074221742","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7953647,0.00062990165,0.1871463,0.0019605565,0.00006635665,0.0001560672,0.0016604707,0.0010113637,0.012004196],"genre_scores_gemma":[0.9712154,0.00022685555,0.025066635,0.00008116447,0.000074831434,0.00013604047,0.0010353761,0.00019069042,0.001973136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992782,0.0014424674,0.000651435,0.0015235492,0.002177737,0.001422881],"domain_scores_gemma":[0.92457396,0.06247458,0.0039759395,0.00485176,0.0026403982,0.0014834461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033430199,0.0006863284,0.0018593426,0.0019537786,0.002374834,0.008321833,0.0032990025,0.0018289534,0.008323002],"category_scores_gemma":[0.03480097,0.0010477992,0.0023516472,0.0027528126,0.004277855,0.019439992,0.0046252925,0.0042333337,0.0005032936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019775413,0.00048297204,0.012983159,0.0006730125,0.0001874259,0.00032995484,0.0023751787,0.27928805,0.011985684,0.630232,0.0037277094,0.055757355],"study_design_scores_gemma":[0.00004450223,0.00009671303,0.0013926598,0.000035604164,0.00006656175,0.00012214754,0.0002264114,0.53859323,0.010859729,0.44741675,0.0010742707,0.0000715556],"about_ca_topic_score_codex":0.0042154035,"about_ca_topic_score_gemma":0.0033221105,"teacher_disagreement_score":0.008323002,"about_ca_system_score_codex":0.005017387,"about_ca_system_score_gemma":0.0030733033,"threshold_uncertainty_score":0.036403835},"labels":[],"label_agreement":null},{"id":"W2074534086","doi":"10.1016/j.jalgebra.2011.02.048","title":"Representation theory of finite semigroups over semirings","year":2011,"lang":"en","type":"preprint","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Semiring; Semigroup; Representation (politics); Mathematics; Simple (philosophy); Character (mathematics); Field (mathematics); Finite field; Commutative property; Unit (ring theory); Algebra over a field; Pure mathematics; Discrete mathematics","score_opus":0.02836510203245792,"score_gpt":0.2623783498689101,"score_spread":0.2340132478364522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074534086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3457357,0.0039211544,0.56600815,0.003943492,0.000632355,0.00006729561,0.00058420905,0.00086171785,0.0782459],"genre_scores_gemma":[0.95890605,0.0008316786,0.028948477,0.00022338264,0.0004005219,0.000042887295,0.00033029087,0.000069597154,0.010247066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986914,0.00040233554,0.00009856451,0.00025300754,0.00038219942,0.000172587],"domain_scores_gemma":[0.99801874,0.0010606102,0.00016384845,0.0002616888,0.00030252332,0.00019253683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017036474,0.0005713024,0.00080384844,0.0013814738,0.001087159,0.004944667,0.0011341771,0.0010150529,0.005043837],"category_scores_gemma":[0.0023965186,0.00051674445,0.0011947978,0.0014825467,0.0025157065,0.007213322,0.0016532472,0.0023690523,0.0006341738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020488878,0.000016522383,0.00008383808,0.000022060676,0.0000055693404,0.000033267737,0.00028381703,0.0007688882,0.0006230656,0.99419975,0.00042956506,0.003513174],"study_design_scores_gemma":[0.000010835626,0.000014848206,0.00005256531,0.000010309002,0.0000051587085,0.000049392504,0.00007311841,0.005772366,0.00030839065,0.9920453,0.001649645,0.000008024472],"about_ca_topic_score_codex":0.000772136,"about_ca_topic_score_gemma":0.0004860411,"teacher_disagreement_score":0.005043837,"about_ca_system_score_codex":0.0015336893,"about_ca_system_score_gemma":0.0008463395,"threshold_uncertainty_score":0.0168733},"labels":[],"label_agreement":null},{"id":"W2075116123","doi":"10.1016/j.tcs.2011.02.002","title":"The search for a reduction in combinatory logic equivalent to <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>λ</mml:mi><mml:mi>β</mml:mi></mml:math>-reduction","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Scroll; Reduction (mathematics); Algorithm; Mathematics; Computer science; Artificial intelligence; Theology; Philosophy; Geometry","score_opus":0.025986079673782147,"score_gpt":0.2623358634728863,"score_spread":0.23634978379910415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075116123","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43943775,0.0012824564,0.31469166,0.029526038,0.0010549511,0.00050547405,0.0017518341,0.0043138308,0.20743603],"genre_scores_gemma":[0.7943899,0.00051661103,0.16446151,0.0029451952,0.00032245953,0.00016771728,0.0023930878,0.0010820739,0.03372144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873954,0.00037087113,0.000064986234,0.00037188816,0.00024128718,0.00021140368],"domain_scores_gemma":[0.9955395,0.0035571568,0.000097841265,0.0003441176,0.00027756358,0.00018389065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014779535,0.00052642263,0.0011020609,0.001169073,0.0018481269,0.0031503204,0.0012251642,0.002278345,0.023787972],"category_scores_gemma":[0.0080933515,0.0006578847,0.002635795,0.0010311798,0.0025823738,0.004471455,0.0021395497,0.0035037769,0.003305029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010463226,0.00050597795,0.0018952227,0.00097645435,0.00013793207,0.0009182813,0.0011787986,0.009040025,0.012682715,0.8717149,0.03402844,0.06587498],"study_design_scores_gemma":[0.00021979306,0.00020703113,0.00066291797,0.000100276535,0.00013333755,0.0005335209,0.0008766605,0.030468566,0.007728766,0.9410449,0.017978188,0.00004596457],"about_ca_topic_score_codex":0.0021780522,"about_ca_topic_score_gemma":0.004079027,"teacher_disagreement_score":0.023787972,"about_ca_system_score_codex":0.0015655347,"about_ca_system_score_gemma":0.002101523,"threshold_uncertainty_score":0.0795787},"labels":[],"label_agreement":null},{"id":"W2075422800","doi":"10.1016/s1631-073x(02)00005-5","title":"Approximation simultanée d'un nombre et de son carré","year":2003,"lang":"fr","type":"article","venue":"Comptes Rendus Mathématique","topic":"semigroups and automata theory","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Humanities","score_opus":0.0205988820774089,"score_gpt":0.2677177943406581,"score_spread":0.24711891226324922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075422800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092217825,0.001148139,0.8950594,0.00036671694,0.0003162698,0.000027465147,0.00014507533,0.00068789173,0.010031093],"genre_scores_gemma":[0.501828,0.000943982,0.48223495,0.000121621255,0.00011847849,0.000117975294,0.00028297323,0.0003798949,0.013972171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974184,0.0005202358,0.0001535036,0.00065696705,0.0009330206,0.0003178152],"domain_scores_gemma":[0.994294,0.0033041523,0.0003305572,0.0011521593,0.00074761553,0.00017152156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032278372,0.0012641678,0.0016450987,0.0014193252,0.0012523618,0.0026158106,0.0010912436,0.0013492093,0.006864425],"category_scores_gemma":[0.011874055,0.000692221,0.0019693936,0.0012065736,0.0017577334,0.0036859054,0.001718446,0.0019948331,0.0016911535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021703334,0.00014893846,0.005867883,0.00052592764,0.00020890341,0.00045151805,0.0014746778,0.36948982,0.08123717,0.30610165,0.0031717937,0.22915128],"study_design_scores_gemma":[0.0000765905,0.0003618581,0.0020266727,0.0001287241,0.00008330503,0.00058089296,0.00031008772,0.8146349,0.056593053,0.10255253,0.022565112,0.00008613913],"about_ca_topic_score_codex":0.004670169,"about_ca_topic_score_gemma":0.005688078,"teacher_disagreement_score":0.006864425,"about_ca_system_score_codex":0.0019005239,"about_ca_system_score_gemma":0.0013520059,"threshold_uncertainty_score":0.022963822},"labels":[],"label_agreement":null},{"id":"W2075877008","doi":"10.1142/s0129054110007386","title":"ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES","year":2010,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Communication complexity; Logarithm; Regular language; Time complexity; Constant (computer programming); Cover (algebra); Probabilistic logic; Mathematics; Computer science; Theoretical computer science; Computational complexity theory; Formal language; Range (aeronautics); Discrete mathematics; Algorithm; Automaton; Artificial intelligence; Programming language","score_opus":0.02129091006112265,"score_gpt":0.31408380027596616,"score_spread":0.2927928902148435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075877008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45050892,0.00254407,0.49571615,0.009769731,0.00016019423,0.00020675173,0.00095220795,0.001015961,0.039125998],"genre_scores_gemma":[0.9560696,0.00091899285,0.03347219,0.00048714288,0.000327119,0.0003428861,0.00056249433,0.0003645061,0.0074551986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99007154,0.002878833,0.00055378163,0.001960101,0.002658185,0.0018775258],"domain_scores_gemma":[0.8365181,0.14596139,0.005336857,0.007783653,0.0026657248,0.0017342091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042344616,0.001048708,0.0015570808,0.001374218,0.0024547167,0.005722954,0.003137124,0.0019660916,0.008569176],"category_scores_gemma":[0.04080363,0.0010153122,0.0021273862,0.0020354192,0.006207469,0.019221716,0.0042279884,0.006929691,0.00104383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007058871,0.00024655848,0.004085402,0.00070848496,0.0001341051,0.00047413574,0.0016348707,0.18106043,0.009361956,0.771859,0.00325936,0.02646977],"study_design_scores_gemma":[0.000058450147,0.00008676938,0.00086000754,0.00004119932,0.000055562068,0.00023623373,0.00017519224,0.323156,0.0047212336,0.6682938,0.0022499806,0.0000656421],"about_ca_topic_score_codex":0.0018792608,"about_ca_topic_score_gemma":0.0013981642,"teacher_disagreement_score":0.008569176,"about_ca_system_score_codex":0.0042956867,"about_ca_system_score_gemma":0.0025863121,"threshold_uncertainty_score":0.031167567},"labels":[],"label_agreement":null},{"id":"W2075936685","doi":"10.1142/s0129054104002352","title":"IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES","year":2004,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Deterministic finite automaton; Mathematics; Pairwise comparison; Upper and lower bounds; Quantum finite automata; Finite-state machine; Regular language; DFA minimization; Discrete mathematics; Automaton; Finite set; Nondeterministic finite automaton; Combinatorics; Computer science; Automata theory; Theoretical computer science; Algorithm; Statistics","score_opus":0.015615832947582784,"score_gpt":0.31805585924589436,"score_spread":0.30244002629831157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075936685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1389382,0.0029918542,0.8095402,0.0026139265,0.0005157833,0.00024017833,0.0007667551,0.0041370573,0.040256094],"genre_scores_gemma":[0.67921,0.001626218,0.2984418,0.0009892823,0.00074376434,0.0009792345,0.0016949136,0.0014503725,0.014864397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9899803,0.002259987,0.0007826881,0.0023011835,0.0027860445,0.0018897345],"domain_scores_gemma":[0.9405286,0.04295386,0.0021753903,0.01010462,0.0029537012,0.0012839258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005214772,0.002253634,0.0024554678,0.0022549413,0.00197186,0.004437225,0.005997188,0.0024880748,0.014737141],"category_scores_gemma":[0.036924154,0.001223683,0.0035609738,0.001758505,0.0030251832,0.013550883,0.007027803,0.007943539,0.003848272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037468493,0.00089083274,0.0069022547,0.0015343436,0.0002995259,0.00079527235,0.0011945423,0.18218696,0.068586566,0.50239193,0.01553674,0.21593419],"study_design_scores_gemma":[0.00013808101,0.00041367798,0.0014357916,0.0001525805,0.00028479297,0.0005590525,0.0000984974,0.47437942,0.033757493,0.47641054,0.012233733,0.00013639362],"about_ca_topic_score_codex":0.0011672259,"about_ca_topic_score_gemma":0.0020476796,"teacher_disagreement_score":0.014737141,"about_ca_system_score_codex":0.0030759312,"about_ca_system_score_gemma":0.0019602906,"threshold_uncertainty_score":0.04930061},"labels":[],"label_agreement":null},{"id":"W2076116808","doi":"10.1007/s00233-009-9144-2","title":"Flatness properties of diagonal acts over monoids","year":2009,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Monoid; Flatness (cosmology); Mathematics; Diagonal; Pure mathematics; Projective test; Algebra over a field; Discrete mathematics; Geometry; Physics","score_opus":0.00943579455960058,"score_gpt":0.2115320754355206,"score_spread":0.20209628087592002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076116808","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8502781,0.0005743611,0.10575625,0.00050674775,0.00011013387,0.000059457656,0.00055073557,0.000627089,0.04153719],"genre_scores_gemma":[0.9841548,0.00017167153,0.0052997223,0.00008348279,0.000070556736,0.000033454107,0.00038784335,0.000102984595,0.009695498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985586,0.00029311836,0.00013604996,0.00032628942,0.00031260843,0.00037334187],"domain_scores_gemma":[0.99415636,0.0028612604,0.0004647913,0.0007019792,0.00091316947,0.00090242055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017089067,0.0005508518,0.0006511118,0.0026730835,0.002132012,0.0036027846,0.00095685443,0.0007464347,0.009239138],"category_scores_gemma":[0.0040758727,0.0007379108,0.0007392396,0.0015825401,0.0028151108,0.0054275356,0.0018338967,0.0014311145,0.0010110191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022929427,0.00006657397,0.0016796762,0.000063577514,0.000015040505,0.00038074926,0.0018769755,0.000764135,0.0065388074,0.97920257,0.0009163999,0.008266273],"study_design_scores_gemma":[0.00006263007,0.000119194476,0.0029703628,0.000039904975,0.00004257921,0.00048950774,0.00092444714,0.007222516,0.0061708656,0.9769205,0.004968147,0.00006937854],"about_ca_topic_score_codex":0.002206052,"about_ca_topic_score_gemma":0.001982584,"teacher_disagreement_score":0.009239138,"about_ca_system_score_codex":0.0010781089,"about_ca_system_score_gemma":0.00055944425,"threshold_uncertainty_score":0.030907989},"labels":[],"label_agreement":null},{"id":"W2076752886","doi":"10.1016/s0012-365x(02)00372-2","title":"No iterated morphism generates any Arshon sequence of odd order","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Morphism; Iterated function; Mathematics; Sequence (biology); Order (exchange); Combinatorics; Discrete mathematics","score_opus":0.03221271644476364,"score_gpt":0.24233306495041634,"score_spread":0.2101203485056527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076752886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7853768,0.00047234583,0.11453921,0.00054770504,0.00056483084,0.000056629608,0.0002031666,0.00058927975,0.09765003],"genre_scores_gemma":[0.9343605,0.00034345328,0.025946412,0.00024219451,0.0001502855,0.000079266974,0.0003763424,0.00023601417,0.038265724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925,0.00010543034,0.00004986897,0.00019911649,0.00018124109,0.00021426717],"domain_scores_gemma":[0.99694747,0.001417965,0.00029198642,0.00039352043,0.0004912029,0.00045791396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007687682,0.00085988775,0.000821789,0.0013137319,0.002298233,0.002446023,0.0008747635,0.0010625098,0.0065045194],"category_scores_gemma":[0.0020758938,0.00042836257,0.001032112,0.000611241,0.0022036615,0.0034820738,0.0021125646,0.0019398569,0.0014901338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040789624,0.00010574958,0.0022111046,0.00011529961,0.00003264355,0.00076985586,0.0010248341,0.00074090133,0.014555589,0.9615288,0.0012006367,0.01730664],"study_design_scores_gemma":[0.000048576323,0.00015220598,0.0011819553,0.00004094385,0.000047208257,0.00084764714,0.00046764803,0.0046125613,0.013876266,0.96611285,0.012559263,0.000052731513],"about_ca_topic_score_codex":0.0005218755,"about_ca_topic_score_gemma":0.0007482077,"teacher_disagreement_score":0.0065045194,"about_ca_system_score_codex":0.0008667289,"about_ca_system_score_gemma":0.00068299414,"threshold_uncertainty_score":0.021759748},"labels":[],"label_agreement":null},{"id":"W2076959711","doi":"10.1016/j.tcs.2010.07.005","title":"Equations on palindromes and circular words","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Polyomino; Bijection; Mathematics; Palindrome; Translation (biology); Combinatorics; Boundary (topology); Pure mathematics; Plane (geometry); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.008528305360565884,"score_gpt":0.24131079689579749,"score_spread":0.2327824915352316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076959711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37843716,0.0017596002,0.4749454,0.0048416243,0.0010976028,0.00019875237,0.0010294943,0.00052855717,0.1371618],"genre_scores_gemma":[0.87766194,0.0008561436,0.05700607,0.0008304892,0.00063688547,0.00019900393,0.0006671161,0.00026020658,0.06188204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999042,0.00022311682,0.00012513343,0.00022796133,0.00020778456,0.00017391855],"domain_scores_gemma":[0.99721295,0.0017664114,0.0002469161,0.00024650485,0.0003738947,0.00015332465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010244509,0.00062531926,0.0007935185,0.0011470645,0.0015463473,0.0027025256,0.0011092975,0.0013911302,0.01278397],"category_scores_gemma":[0.00462068,0.0007143973,0.0013567926,0.0012786369,0.0027051547,0.0076060174,0.002372315,0.0025147076,0.0015713644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016240945,0.000009843073,0.00011444094,0.000021015181,0.0000028436045,0.000071902665,0.00029189285,0.00043818096,0.00045405026,0.99558496,0.00074671174,0.0022478907],"study_design_scores_gemma":[0.000020116115,0.000009127052,0.00007967315,0.000006421873,0.0000053509834,0.00007600638,0.00007446217,0.0028802461,0.00045904226,0.99357516,0.002803445,0.000010898874],"about_ca_topic_score_codex":0.0015759307,"about_ca_topic_score_gemma":0.0014660801,"teacher_disagreement_score":0.01278397,"about_ca_system_score_codex":0.0014698502,"about_ca_system_score_gemma":0.00070464367,"threshold_uncertainty_score":0.04276663},"labels":[],"label_agreement":null},{"id":"W2077111268","doi":"10.4153/cjm-2007-009-3","title":"On Two Exponents of Approximation Related to a Real Number and Its Square","year":2007,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Infimum and supremum; Real number; Exponent; Zero (linguistics); Combinatorics; Interval (graph theory); Discrete mathematics","score_opus":0.014640423563506377,"score_gpt":0.2580859016855078,"score_spread":0.24344547812200146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077111268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8365608,0.0020159862,0.13194098,0.0014382536,0.00027894744,0.000044225217,0.00018888662,0.000110667635,0.027421286],"genre_scores_gemma":[0.98026705,0.00034536308,0.016018458,0.00009755376,0.00014863572,0.000029471541,0.00008593635,0.000032670403,0.002974866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989279,0.0002632951,0.00008064728,0.00022350914,0.00031451922,0.00019021909],"domain_scores_gemma":[0.9916455,0.0054824473,0.00108099,0.00045337595,0.00066692557,0.0006708071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015419738,0.0005329936,0.0009301543,0.0014519708,0.000869693,0.0032248315,0.0005691856,0.0006345738,0.0028183374],"category_scores_gemma":[0.012636183,0.00037628904,0.00060484855,0.00090844417,0.003401746,0.004482785,0.002125123,0.0017414661,0.00034913322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041284607,0.000032467826,0.0021879273,0.000082255814,0.000017297209,0.0005359131,0.0014834428,0.0051338263,0.0052002775,0.9760198,0.0006432531,0.008250735],"study_design_scores_gemma":[0.00011271151,0.00017648096,0.0022477806,0.00009082027,0.000031485277,0.000774427,0.0010243276,0.0796393,0.0037971868,0.9030433,0.009005062,0.00005715968],"about_ca_topic_score_codex":0.0007955938,"about_ca_topic_score_gemma":0.00042787183,"teacher_disagreement_score":0.0032248315,"about_ca_system_score_codex":0.0013839818,"about_ca_system_score_gemma":0.0003611961,"threshold_uncertainty_score":0.010041475},"labels":[],"label_agreement":null},{"id":"W2077168540","doi":"10.1051/ita:2007042","title":"On Critical exponents in fixed points of<i>k</i>-uniform binary morphisms","year":2007,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Mathematics; Sketch; Bounded function; Binary number; Fixed point; Extension (predicate logic); Exponent; Discrete mathematics; Critical exponent; Combinatorics; Pure mathematics; Mathematical analysis; Algorithm; Arithmetic; Geometry; Computer science; Scaling","score_opus":0.00819716597446658,"score_gpt":0.2613758560435292,"score_spread":0.25317869006906263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077168540","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8098894,0.0017014906,0.14849652,0.0009182679,0.00014453818,0.00010784068,0.000239683,0.00030543204,0.038196903],"genre_scores_gemma":[0.97699964,0.00053520047,0.017450726,0.000084968306,0.00012386004,0.0001036702,0.00012963053,0.00008165659,0.0044906503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928576,0.00014516519,0.00006467674,0.00014797822,0.00014186981,0.00021456725],"domain_scores_gemma":[0.9943346,0.0036874504,0.00057696714,0.0002961742,0.0005860137,0.0005187149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018901773,0.0008029906,0.0008859463,0.0034818288,0.0016227367,0.00302236,0.0007786582,0.0010259363,0.004762332],"category_scores_gemma":[0.009586544,0.0005157312,0.0008452555,0.0010456707,0.0034027903,0.0046525835,0.0022626314,0.0019880787,0.00050667697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013113208,0.00002981045,0.0028012875,0.00009722741,0.000013922423,0.00053138257,0.0010010981,0.0030111005,0.0053768074,0.98041785,0.0004644853,0.0061238892],"study_design_scores_gemma":[0.000058145677,0.00006906379,0.001649127,0.00012435633,0.000022973814,0.000286566,0.00050033274,0.025689311,0.0050464463,0.9634777,0.0030296876,0.000046411693],"about_ca_topic_score_codex":0.0009797581,"about_ca_topic_score_gemma":0.0008547564,"teacher_disagreement_score":0.004762332,"about_ca_system_score_codex":0.0023464006,"about_ca_system_score_gemma":0.0005336338,"threshold_uncertainty_score":0.017024398},"labels":[],"label_agreement":null},{"id":"W2077220764","doi":"10.1142/s0129054110007155","title":"SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES","year":2010,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Ambiguity; Word (group theory); Matrix (chemical analysis); Alphabet; Image (mathematics); Combinatorics; Binary number; Mathematics; Palindrome; Variance (accounting); Logical matrix; Characterization (materials science); Computer science; Algorithm; Discrete mathematics; Artificial intelligence; Arithmetic; Linguistics; Geometry","score_opus":0.008635601422458672,"score_gpt":0.28601269267096646,"score_spread":0.2773770912485078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077220764","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7529564,0.0013069777,0.22670244,0.000471388,0.0001573268,0.00007376593,0.00030501798,0.00026093214,0.017765826],"genre_scores_gemma":[0.95282507,0.0004327042,0.04169648,0.000076058896,0.0001699777,0.00011557341,0.00022351542,0.000094646,0.004366009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975212,0.00050066866,0.00027228854,0.0007230099,0.0006546849,0.0003280301],"domain_scores_gemma":[0.9894577,0.0064249244,0.0018419956,0.00096498535,0.00065802515,0.00065238937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013110109,0.00044948896,0.0008360581,0.0023315195,0.0012541667,0.0025780937,0.001066606,0.0010153257,0.004644795],"category_scores_gemma":[0.012128176,0.0004293789,0.0005672173,0.0018050729,0.0032249896,0.0065238,0.0018053022,0.0010727012,0.0007092212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083435635,0.00014304755,0.010515215,0.0003887123,0.00006089815,0.0012870549,0.0025471235,0.004741656,0.027306642,0.85361344,0.001142294,0.09741958],"study_design_scores_gemma":[0.00003335968,0.0002719368,0.0045717782,0.00007263889,0.000060097722,0.0016903267,0.0010540435,0.023358164,0.01521403,0.9454548,0.008133173,0.00008558169],"about_ca_topic_score_codex":0.00030670268,"about_ca_topic_score_gemma":0.00026107207,"teacher_disagreement_score":0.004644795,"about_ca_system_score_codex":0.00077329244,"about_ca_system_score_gemma":0.000339612,"threshold_uncertainty_score":0.015538335},"labels":[],"label_agreement":null},{"id":"W2077507544","doi":"10.1515/integ.2011.059","title":"On Some Conjectures Concerning Stern's Sequence and Its Twist","year":2011,"lang":"en","type":"preprint","venue":"Integers","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stern; Sequence (biology); Twist; Value (mathematics); Mathematics; Combinatorics; Binary number; Computer science; Arithmetic; Geometry; Biology; Statistics; Genetics; History","score_opus":0.055814729536462195,"score_gpt":0.27818102930257754,"score_spread":0.22236629976611536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077507544","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70680887,0.0020587433,0.11539549,0.014062203,0.0014287308,0.00010284437,0.00056503917,0.00051224645,0.15906589],"genre_scores_gemma":[0.9802757,0.00048209916,0.008564479,0.00054181175,0.000423013,0.000043953998,0.00018014626,0.00003661328,0.009452262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998415,0.00037599873,0.000111347865,0.00030358176,0.00046455913,0.00032945693],"domain_scores_gemma":[0.9948515,0.00270827,0.00063053024,0.0005834908,0.00060934504,0.00061682746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031031643,0.00042518688,0.0008246039,0.0012882001,0.002351373,0.003068022,0.0008661716,0.001544074,0.008455452],"category_scores_gemma":[0.01077077,0.00028974316,0.0007174012,0.0012957377,0.005738438,0.0068467376,0.0032315229,0.002774453,0.0012147478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011825971,0.000014058073,0.00073560583,0.000029148874,0.0000024462956,0.00010592264,0.00044797332,0.00063222286,0.0006148483,0.99286544,0.0011928214,0.0032411679],"study_design_scores_gemma":[0.000018708468,0.00003127222,0.00031664074,0.00002395313,0.0000048311836,0.00011382186,0.00033537703,0.002623839,0.0012434575,0.99049205,0.004778318,0.000017623333],"about_ca_topic_score_codex":0.0009192852,"about_ca_topic_score_gemma":0.0005732059,"teacher_disagreement_score":0.008455452,"about_ca_system_score_codex":0.001809875,"about_ca_system_score_gemma":0.0009453358,"threshold_uncertainty_score":0.028286338},"labels":[],"label_agreement":null},{"id":"W2077566826","doi":"10.1145/369836.369849","title":"Half century of automata theory","year":2000,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Citation; Computer science; Automaton; World Wide Web; Information retrieval; Theoretical computer science","score_opus":0.01063045978310218,"score_gpt":0.23367709942396253,"score_spread":0.22304663964086036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077566826","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008617339,0.08062619,0.066419646,0.14903274,0.025320798,0.00005474111,0.0011053459,0.0014680823,0.6673551],"genre_scores_gemma":[0.28192154,0.06809297,0.018278176,0.026263224,0.02900573,0.0001968382,0.0011098813,0.0017812961,0.57335037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976434,0.000763129,0.000111493166,0.0004968077,0.00079432776,0.00019083775],"domain_scores_gemma":[0.99485105,0.0022517738,0.00010958127,0.0012555488,0.0010433189,0.0004887934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002189747,0.00057240226,0.0007513368,0.0019506216,0.0024063634,0.0058832243,0.00096589205,0.0022038952,0.059691567],"category_scores_gemma":[0.007920522,0.0004780338,0.0009565149,0.0016457333,0.006486391,0.013124063,0.0037517245,0.004258255,0.015238063],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003533692,0.000014894328,0.0001564748,0.00010832565,0.000013025414,0.00005107819,0.0005105289,0.00038623097,0.0003729144,0.7948702,0.15490265,0.04857828],"study_design_scores_gemma":[0.000006264517,0.000011036012,0.000143749,0.00010740972,0.000004731105,0.000082273975,0.00015554184,0.0007039576,0.00014934907,0.46570355,0.53291994,0.000012132011],"about_ca_topic_score_codex":0.002180487,"about_ca_topic_score_gemma":0.0016866785,"teacher_disagreement_score":0.059691567,"about_ca_system_score_codex":0.003306122,"about_ca_system_score_gemma":0.0018742826,"threshold_uncertainty_score":0.1996882},"labels":[],"label_agreement":null},{"id":"W2077748761","doi":"10.1016/j.ic.2006.09.003","title":"Subword conditions and subword histories","year":2006,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Decidability; Computer science; Automaton; Characterization (materials science); Sequence (biology); Word (group theory); Event (particle physics); Inference; Natural language processing; Artificial intelligence; Theoretical computer science; Linguistics","score_opus":0.0045984480673415705,"score_gpt":0.20736270920620134,"score_spread":0.20276426113885976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077748761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17462514,0.0024236396,0.70364016,0.004148192,0.00096606085,0.00029605374,0.0016018439,0.0017395099,0.1105594],"genre_scores_gemma":[0.8674085,0.0015725719,0.08485999,0.0008714259,0.0010692973,0.0005005739,0.0014407196,0.0008061648,0.04147072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969049,0.0008828318,0.00036851707,0.00077377644,0.0006605087,0.00040943432],"domain_scores_gemma":[0.9839728,0.010763066,0.000675018,0.001980732,0.0017610114,0.00084733876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025808096,0.00081687735,0.0012881149,0.0028485158,0.0033888556,0.006229951,0.0014236368,0.0022941488,0.018102162],"category_scores_gemma":[0.012016461,0.0011478027,0.0013619472,0.002512337,0.0063863355,0.019723557,0.0038909488,0.003145626,0.00333823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006979105,0.000015667452,0.00018310637,0.000049357808,0.0000066591747,0.00021068299,0.0005566406,0.00028763083,0.0011145619,0.98954624,0.0008761171,0.007083472],"study_design_scores_gemma":[0.000009843101,0.000013550745,0.00007684022,0.000016228933,0.000010875606,0.000103600985,0.00014518909,0.0016596499,0.0014348103,0.9921416,0.004372428,0.000015329166],"about_ca_topic_score_codex":0.0011567897,"about_ca_topic_score_gemma":0.00094028015,"teacher_disagreement_score":0.018102162,"about_ca_system_score_codex":0.0017179555,"about_ca_system_score_gemma":0.0015920526,"threshold_uncertainty_score":0.060557783},"labels":[],"label_agreement":null},{"id":"W2078594408","doi":"10.1016/j.jnt.2006.06.001","title":"Summation of series defined by counting blocks of digits","year":2006,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Series (stratigraphy); Integer (computer science); Base (topology); Combinatorics; Arithmetic; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.00428322637736832,"score_gpt":0.20377535364454075,"score_spread":0.19949212726717241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078594408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19429,0.0017007833,0.69892573,0.00046355434,0.0019642059,0.000119437645,0.00043666255,0.0014003277,0.10069934],"genre_scores_gemma":[0.7492271,0.0015873975,0.1767455,0.00057468045,0.0013164079,0.0003947179,0.0008496168,0.0012170325,0.06808755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841654,0.0003274833,0.00014899432,0.00029569716,0.0006318092,0.00017954911],"domain_scores_gemma":[0.99600035,0.0018938897,0.00038888917,0.0005612665,0.0007257664,0.00042979672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015423541,0.001101386,0.0013382686,0.0026382466,0.000998772,0.002931457,0.00197981,0.00096387876,0.010066604],"category_scores_gemma":[0.0071193855,0.0005394115,0.00080271816,0.0017689689,0.0013826875,0.0047437362,0.0015119812,0.001611793,0.0026938412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012723688,0.00008266617,0.00046441297,0.00015599235,0.000041256037,0.00029406423,0.000209851,0.002458929,0.017124068,0.94180423,0.0027012813,0.034536052],"study_design_scores_gemma":[0.000027995728,0.0001178164,0.0008808264,0.00008138978,0.000070040434,0.0012530218,0.0000778652,0.06997255,0.015357682,0.8998931,0.012206774,0.000061075785],"about_ca_topic_score_codex":0.0001540612,"about_ca_topic_score_gemma":0.00034838315,"teacher_disagreement_score":0.010066604,"about_ca_system_score_codex":0.0007029313,"about_ca_system_score_gemma":0.00069591263,"threshold_uncertainty_score":0.033676147},"labels":[],"label_agreement":null},{"id":"W2078614146","doi":"10.1007/s00233-005-0506-0","title":"Levi’s Commutator Theorems for Cancellative Semigroups","year":2005,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Commutator; Mathematics; Mathematical proof; Conjecture; Cancellative semigroup; Pure mathematics; Algebra over a field; Discrete mathematics; Semigroup","score_opus":0.008527195923852666,"score_gpt":0.24261879206204526,"score_spread":0.23409159613819258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078614146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08519077,0.0029614088,0.71137977,0.0040029516,0.0013715569,0.000084274594,0.00048957893,0.0010323782,0.19348729],"genre_scores_gemma":[0.7944299,0.0020218517,0.12744217,0.0021968582,0.0015633674,0.0003915961,0.0006867946,0.0006284328,0.070639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986492,0.00037292612,0.00011954497,0.00029515094,0.00035681776,0.00020643842],"domain_scores_gemma":[0.99707496,0.0017510091,0.00012648542,0.000361518,0.00046648667,0.00021952378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003798941,0.0007727292,0.00095136475,0.002158498,0.0030374597,0.0030696369,0.0010276429,0.0012691366,0.011036859],"category_scores_gemma":[0.004025551,0.00068751106,0.0018543873,0.0013251139,0.003831286,0.010380391,0.0028075583,0.0039202273,0.0021580288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021795273,0.000013127113,0.000058754824,0.000025189578,0.000005880939,0.0000315927,0.00033850895,0.00012399479,0.00075314986,0.99306494,0.001345483,0.004217648],"study_design_scores_gemma":[0.00001195394,0.000009760337,0.000052780495,0.000006638716,0.000006200854,0.000041587173,0.000043653825,0.00076328235,0.00076443335,0.9921652,0.006123556,0.000010871261],"about_ca_topic_score_codex":0.00074065314,"about_ca_topic_score_gemma":0.0009529137,"teacher_disagreement_score":0.011036859,"about_ca_system_score_codex":0.0015321275,"about_ca_system_score_gemma":0.0008080297,"threshold_uncertainty_score":0.036922038},"labels":[],"label_agreement":null},{"id":"W2079567772","doi":"10.1016/j.tcs.2014.11.015","title":"Descriptional complexity of unambiguous input-driven pushdown automata","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Academy of Finland","keywords":"Pushdown automaton; Deterministic pushdown automaton; Nondeterministic algorithm; Embedded pushdown automaton; Discrete mathematics; Homomorphism; Büchi automaton; Two-way deterministic finite automaton; Nested word; Nondeterministic finite automaton; Deterministic automaton; Mathematics; Deterministic context-free grammar; Combinatorics; Automaton; Computer science; Theoretical computer science; Automata theory; Quantum finite automata; Rule-based machine translation; Context-free grammar; Artificial intelligence","score_opus":0.02080017538274525,"score_gpt":0.24438166321694996,"score_spread":0.2235814878342047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079567772","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5827055,0.0011019408,0.38367224,0.0057670483,0.000120024815,0.00014742593,0.001857509,0.00072134763,0.023906875],"genre_scores_gemma":[0.9812201,0.00035072715,0.014109846,0.00020672489,0.00007766353,0.00010806603,0.0006178068,0.000115390925,0.0031936932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930507,0.0018567131,0.0006065419,0.0010854229,0.0023690313,0.0010315988],"domain_scores_gemma":[0.96304035,0.029820789,0.0016352794,0.0023116195,0.0021385213,0.001053437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032652216,0.00077143434,0.0017604571,0.0016542879,0.0020498878,0.009366083,0.0034038238,0.0025722573,0.0067500453],"category_scores_gemma":[0.020014858,0.0012261373,0.0024940523,0.002409038,0.0040821275,0.016233113,0.005013554,0.0054805786,0.00047541386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024704708,0.00013696845,0.0018196778,0.00022541072,0.00006863496,0.00040258147,0.0010432394,0.04103806,0.0021879033,0.9414989,0.0012922098,0.010039488],"study_design_scores_gemma":[0.000028312545,0.000015589276,0.00023240373,0.000014345621,0.00002611736,0.00009100801,0.0001340941,0.06853805,0.0011070014,0.9293107,0.00047750754,0.000024836916],"about_ca_topic_score_codex":0.0026441377,"about_ca_topic_score_gemma":0.0021156662,"teacher_disagreement_score":0.009366083,"about_ca_system_score_codex":0.0042292173,"about_ca_system_score_gemma":0.0027073054,"threshold_uncertainty_score":0.030685246},"labels":[],"label_agreement":null},{"id":"W2079923544","doi":"10.1016/j.disc.2009.06.004","title":"Avoiding squares and overlaps over the natural numbers","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Natural number; Combinatorics; Discrete mathematics; Natural (archaeology); Geography","score_opus":0.00740418815523247,"score_gpt":0.23990761968987745,"score_spread":0.23250343153464498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079923544","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46835008,0.0010510931,0.42359576,0.0012304026,0.0003540943,0.00007547818,0.00016537333,0.00062187907,0.104555845],"genre_scores_gemma":[0.8999559,0.00047475426,0.065616034,0.00026228337,0.00019374545,0.00011861982,0.00017230236,0.0002419962,0.032964393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804723,0.0006534391,0.00011795125,0.0004995735,0.00043311447,0.0002488052],"domain_scores_gemma":[0.9946293,0.0033278405,0.0004428027,0.0008483269,0.00038230236,0.0003693716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012117582,0.0004950266,0.0007057778,0.0008627048,0.0021655413,0.0025266502,0.0009676661,0.0010540432,0.005417958],"category_scores_gemma":[0.006665814,0.0006153009,0.00069571764,0.0009246326,0.003661281,0.006164538,0.0033062685,0.0014941756,0.0010168024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075583856,0.000013746478,0.00031999932,0.000035791887,0.000005818244,0.00016624366,0.00066942425,0.0012484731,0.0016366739,0.985824,0.0006484224,0.009355833],"study_design_scores_gemma":[0.000012064834,0.000023082852,0.00015119716,0.000010979395,0.0000079755855,0.00019426655,0.0002269617,0.0032972258,0.0015483467,0.987866,0.006650354,0.000011553425],"about_ca_topic_score_codex":0.0006140858,"about_ca_topic_score_gemma":0.0010004696,"teacher_disagreement_score":0.005417958,"about_ca_system_score_codex":0.00054822315,"about_ca_system_score_gemma":0.000718588,"threshold_uncertainty_score":0.018124938},"labels":[],"label_agreement":null},{"id":"W2079999463","doi":"10.1006/jnth.2001.2669","title":"Transcendence of Sturmian or Morphic Continued Fractions","year":2001,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Mathematics; Quotient; Sequence (biology); Continued fraction; Transcendental number; Morphism; Combinatorics; Pure mathematics; Discrete mathematics; Arithmetic; Mathematical analysis","score_opus":0.020115378591276493,"score_gpt":0.2793692237711556,"score_spread":0.2592538451798791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079999463","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5300359,0.0047467356,0.14322148,0.0035787981,0.0013523655,0.00006978361,0.00030231755,0.0005621299,0.31613052],"genre_scores_gemma":[0.9664692,0.0009535069,0.007855765,0.00038331002,0.00077275065,0.000052190324,0.000101537895,0.00008962927,0.023322046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993599,0.00014931512,0.00003757121,0.00014036224,0.00017368495,0.00013916213],"domain_scores_gemma":[0.998099,0.0009722736,0.00020254773,0.00018914993,0.0002452179,0.00029188299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013347416,0.0011286568,0.0011629997,0.0037777906,0.0019326764,0.0038427026,0.0009548677,0.0013439205,0.007890864],"category_scores_gemma":[0.0052407132,0.00051891594,0.0011284143,0.0015654579,0.005216376,0.0065111844,0.0024264315,0.0024985098,0.0010623493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002832271,0.00000664676,0.00006639003,0.000013347924,0.0000041687767,0.00006447525,0.0001935709,0.00018359516,0.0002689422,0.9969625,0.00026121197,0.0019467187],"study_design_scores_gemma":[0.000012746483,0.000015095724,0.00008335081,0.0000084467365,0.000007469491,0.000106923246,0.000041464475,0.0009358001,0.00025278833,0.996797,0.0017307507,0.000008192763],"about_ca_topic_score_codex":0.0005966372,"about_ca_topic_score_gemma":0.00045499852,"teacher_disagreement_score":0.007890864,"about_ca_system_score_codex":0.0017467787,"about_ca_system_score_gemma":0.0006443175,"threshold_uncertainty_score":0.026397526},"labels":[],"label_agreement":null},{"id":"W2080845342","doi":"10.1017/s0004972709000616","title":"COMBINATORIAL REES–SUSHKEVICH VARIETIES THAT ARE CROSS, FINITELY GENERATED, OR SMALL","year":2009,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Subvariety; Mathematics; Variety (cybernetics); Combinatorics; Finitely-generated abelian group; Set (abstract data type); Generating set of a group; Lattice (music); Discrete mathematics; Pure mathematics; Computer science; Geometry","score_opus":0.045881738060110366,"score_gpt":0.2660268186568844,"score_spread":0.220145080596774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080845342","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90757984,0.0002469072,0.082650185,0.00010811355,0.000016435202,0.00008925431,0.00016085079,0.00029168482,0.008856683],"genre_scores_gemma":[0.9582715,0.00009094543,0.039077356,0.0000274778,0.000017572882,0.000055656958,0.00055213325,0.00002757072,0.0018798204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937636,0.00010608801,0.00006886025,0.00019890629,0.00016631073,0.00008347361],"domain_scores_gemma":[0.9976138,0.001217843,0.00032285464,0.00035245807,0.00020853414,0.00028459044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086228194,0.00028980392,0.00054290687,0.00084138947,0.0006250416,0.001958957,0.0005215038,0.0002935877,0.0035539474],"category_scores_gemma":[0.0023104127,0.000261428,0.00053512806,0.0005197062,0.0014209895,0.0021406035,0.0011332639,0.00050246506,0.00034926477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025741905,0.00027438306,0.039005995,0.00058313436,0.00013917641,0.0012152741,0.0028773616,0.04898101,0.09266499,0.65211713,0.003204142,0.15636311],"study_design_scores_gemma":[0.00021376161,0.0007500172,0.018231185,0.00013324924,0.00015625835,0.0019121206,0.0024229514,0.20188616,0.10970313,0.6451113,0.019320378,0.00015945398],"about_ca_topic_score_codex":0.0002525727,"about_ca_topic_score_gemma":0.00036866186,"teacher_disagreement_score":0.0035539474,"about_ca_system_score_codex":0.00037889028,"about_ca_system_score_gemma":0.00030301846,"threshold_uncertainty_score":0.01188916},"labels":[],"label_agreement":null},{"id":"W2081090714","doi":"10.1051/ita:2005038","title":"On Christoffel classes","year":2005,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Christoffel symbols; Mathematics; Computer science; Arithmetic; Pure mathematics","score_opus":0.005503843000699254,"score_gpt":0.23442778575729287,"score_spread":0.2289239427565936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081090714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69391876,0.0010179764,0.13417386,0.0012135603,0.0002612112,0.00011072345,0.00037545277,0.00028292474,0.1686455],"genre_scores_gemma":[0.9682898,0.00053768756,0.012653024,0.00023280752,0.00028570346,0.000082582745,0.0002611063,0.00008722792,0.017570144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901557,0.0001369377,0.000057521036,0.00025925488,0.00028162444,0.00024910146],"domain_scores_gemma":[0.9985025,0.0005649994,0.00025504117,0.00019679526,0.00023034569,0.00025037673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007122549,0.0006220802,0.0004758282,0.002143135,0.0017132292,0.0022698187,0.0006211835,0.0006992152,0.011733089],"category_scores_gemma":[0.0026015476,0.00020388603,0.00060557394,0.0014682435,0.0037874917,0.0047887564,0.0018368816,0.0011917992,0.0012633451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027340386,0.000017514842,0.00048447668,0.000020330985,0.0000030738727,0.000044037726,0.00015363746,0.00041332844,0.0015171001,0.9887243,0.0006029232,0.0079917805],"study_design_scores_gemma":[0.000014169505,0.00006110206,0.0016211332,0.000018438162,0.000010285231,0.00024182124,0.0002174969,0.004524419,0.0036881182,0.9779544,0.011625073,0.000023679519],"about_ca_topic_score_codex":0.00064892654,"about_ca_topic_score_gemma":0.00038865808,"teacher_disagreement_score":0.011733089,"about_ca_system_score_codex":0.0017212639,"about_ca_system_score_gemma":0.00029078007,"threshold_uncertainty_score":0.03925109},"labels":[],"label_agreement":null},{"id":"W2081745941","doi":"10.1016/j.tcs.2012.03.043","title":"Lower bounds for the size of deterministic unranked tree automata","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic finite automaton; Nondeterministic algorithm; Automaton; Deterministic finite automaton; Deterministic automaton; Mathematics; Combinatorics; Upper and lower bounds; Tree (set theory); Discrete mathematics; Regular language; Computer science; Automata theory; Theoretical computer science","score_opus":0.013030139263550754,"score_gpt":0.2616167939493669,"score_spread":0.24858665468581612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081745941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36605018,0.008539893,0.53156215,0.017083565,0.0011793269,0.0003367476,0.0050400677,0.0057921847,0.06441579],"genre_scores_gemma":[0.8881777,0.002391325,0.08862635,0.0014571501,0.0014442394,0.00068503275,0.002669482,0.0014394124,0.013109381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919308,0.0021784112,0.00051735085,0.0014682022,0.0026143698,0.0012908998],"domain_scores_gemma":[0.8418501,0.13507333,0.0038110435,0.010623374,0.004633711,0.004008334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051589403,0.0018596002,0.002698607,0.0027398278,0.0022167135,0.006498889,0.0056168293,0.0040183617,0.014680682],"category_scores_gemma":[0.05119228,0.001589564,0.00214784,0.0025709695,0.0043658027,0.015794335,0.004732637,0.006316073,0.002375174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024066188,0.0006644548,0.005156788,0.0016263644,0.00026246,0.00049580046,0.0011650485,0.18066996,0.033542432,0.6813336,0.023522202,0.069154225],"study_design_scores_gemma":[0.00012895915,0.00012700837,0.0006965186,0.000093476556,0.00009107062,0.00019528672,0.00010481835,0.26964852,0.0071827797,0.7186316,0.0030260421,0.00007383055],"about_ca_topic_score_codex":0.00092107855,"about_ca_topic_score_gemma":0.0019442424,"teacher_disagreement_score":0.014680682,"about_ca_system_score_codex":0.003817931,"about_ca_system_score_gemma":0.002769389,"threshold_uncertainty_score":0.049111784},"labels":[],"label_agreement":null},{"id":"W2082135431","doi":"10.1016/j.ipl.2004.09.007","title":"Pattern expressions and pattern automata","year":2004,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Prince Edward Island","funders":"","keywords":"Automaton; Computer science; Regular expression; Theoretical computer science; Mathematics; Programming language","score_opus":0.006898938926469907,"score_gpt":0.20985433685877816,"score_spread":0.20295539793230827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082135431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027358506,0.0021721446,0.9086885,0.0033602687,0.0005973503,0.00012643493,0.0006846467,0.0011581617,0.055853948],"genre_scores_gemma":[0.57931834,0.0033901518,0.34901258,0.00165692,0.0010258285,0.0007786273,0.0021825691,0.00082594546,0.061809048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976641,0.0006056244,0.00029147827,0.00067273725,0.0005822109,0.00018384056],"domain_scores_gemma":[0.99642664,0.0017870787,0.00024884436,0.00094919314,0.00046143593,0.00012672278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012878549,0.00087498565,0.0012978319,0.0019157971,0.001858233,0.005521839,0.0012371918,0.0018390811,0.013012245],"category_scores_gemma":[0.0070543,0.00088030554,0.0014774329,0.002989159,0.0038813783,0.014729666,0.0032737914,0.0027409913,0.0034152854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017986904,0.000010955472,0.00014737582,0.000040582458,0.0000072932426,0.00008686595,0.0002388077,0.0006299442,0.0004379981,0.98004353,0.0016084677,0.016730173],"study_design_scores_gemma":[0.0000037630205,0.000005603773,0.000029537625,0.000009305166,0.0000060537977,0.00009842007,0.000047015354,0.003610256,0.0003940029,0.98944664,0.006344087,0.000005360596],"about_ca_topic_score_codex":0.0007450634,"about_ca_topic_score_gemma":0.0004318822,"teacher_disagreement_score":0.013012245,"about_ca_system_score_codex":0.00089824176,"about_ca_system_score_gemma":0.00078250834,"threshold_uncertainty_score":0.043530345},"labels":[],"label_agreement":null},{"id":"W2082407347","doi":"10.1016/j.tcs.2010.06.016","title":"On the number of episturmian palindromes","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Euler's totient function; Palindrome; Mathematics; Alphabet; Combinatorics; Function (biology); Euler's formula; Prefix; Enumeration; Generalization; Discrete mathematics; Mathematical analysis","score_opus":0.006382837415070408,"score_gpt":0.2457086827320534,"score_spread":0.239325845316983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082407347","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88053983,0.0014814566,0.07211269,0.0039827256,0.0003141723,0.00007370464,0.0008177729,0.00038318706,0.040294446],"genre_scores_gemma":[0.98197144,0.00034360398,0.012581104,0.00023228931,0.00034418597,0.00010960762,0.00031557019,0.000087155524,0.0040151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964359,0.00112145,0.00031541576,0.000913443,0.0007637654,0.00045001926],"domain_scores_gemma":[0.94825107,0.041383103,0.0032727746,0.0028694689,0.0016790044,0.0025447044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003809585,0.0007776423,0.0018286365,0.0027830482,0.0028546916,0.005622939,0.003262724,0.0027943235,0.0099147605],"category_scores_gemma":[0.0227082,0.0011360873,0.00105777,0.0016769727,0.0054502646,0.010375224,0.003069488,0.0032392992,0.0008594986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014368776,0.00020355484,0.0065856706,0.0003335987,0.00009445402,0.00050640083,0.0008774687,0.008574655,0.008197168,0.9483566,0.0030181808,0.021815315],"study_design_scores_gemma":[0.00016942728,0.00014944008,0.0018915089,0.00006892693,0.000086493485,0.0008805155,0.00026995045,0.030790849,0.0029473274,0.9603083,0.002373099,0.000064169755],"about_ca_topic_score_codex":0.0002841918,"about_ca_topic_score_gemma":0.00039416508,"teacher_disagreement_score":0.0099147605,"about_ca_system_score_codex":0.001287447,"about_ca_system_score_gemma":0.00081347354,"threshold_uncertainty_score":0.033168137},"labels":[],"label_agreement":null},{"id":"W2082599205","doi":"10.2478/s11533-010-0080-x","title":"Finite basis problem for 2-testable monoids","year":2010,"lang":"en","type":"article","venue":"Open Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Basis (linear algebra); Mathematics; Computer science; Algebra over a field; Pure mathematics; Geometry","score_opus":0.02438132521933019,"score_gpt":0.2764024682013677,"score_spread":0.25202114298203754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082599205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75547963,0.00066894095,0.22430643,0.0018790037,0.00019907442,0.00016884175,0.0009617786,0.00122648,0.015109892],"genre_scores_gemma":[0.96481943,0.000119870725,0.030171925,0.000125119,0.000052821266,0.000060632112,0.00074708444,0.000069283546,0.003833766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827397,0.00046575195,0.00014129403,0.0004163695,0.00040801466,0.00029461633],"domain_scores_gemma":[0.9910467,0.0070950147,0.00039744977,0.00054926216,0.00059151376,0.00031997566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017972685,0.00037227303,0.0007249594,0.0008994657,0.0010618258,0.0027757764,0.0011974928,0.0013279225,0.0059229108],"category_scores_gemma":[0.006357492,0.00041928585,0.0011986049,0.0006419359,0.0022395977,0.004917846,0.0018106124,0.0016512099,0.0005306314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011594312,0.00046622605,0.0050297296,0.00079433183,0.00014311375,0.001917864,0.0017924897,0.030617567,0.02613161,0.8388598,0.00445918,0.088628665],"study_design_scores_gemma":[0.00010227229,0.00016974226,0.00090975274,0.00007730718,0.000048794285,0.00049460155,0.0005953578,0.07275362,0.017241534,0.9024639,0.0050859535,0.000057062138],"about_ca_topic_score_codex":0.0010229489,"about_ca_topic_score_gemma":0.0010681571,"teacher_disagreement_score":0.0059229108,"about_ca_system_score_codex":0.0011155902,"about_ca_system_score_gemma":0.00077926915,"threshold_uncertainty_score":0.019814134},"labels":[],"label_agreement":null},{"id":"W2082624313","doi":"10.2478/s11533-010-0014-7","title":"The isomorphism relation between tree-automatic Structures","year":2010,"lang":"en","type":"article","venue":"Open Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Commutative property; Isomorphism (crystallography); Nilpotent; Class (philosophy); Axiom; Relation (database); Tree (set theory)","score_opus":0.021309936758154693,"score_gpt":0.2735118164798898,"score_spread":0.25220187972173513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082624313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7246592,0.0003536804,0.24039239,0.0005147866,0.000064746004,0.000064900436,0.00021035422,0.00034417314,0.033395775],"genre_scores_gemma":[0.9802509,0.0000822151,0.017078986,0.000063219406,0.000036823156,0.000037140675,0.00017863962,0.00003015222,0.0022420257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723285,0.0008612245,0.00025310274,0.000641503,0.00071163435,0.00029967708],"domain_scores_gemma":[0.9941896,0.003253765,0.00054135296,0.00089163665,0.00075573486,0.00036783784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015446115,0.00018051256,0.0002951276,0.0011766965,0.0014370045,0.0024422004,0.0006345922,0.0007942943,0.0040858667],"category_scores_gemma":[0.005207856,0.00034675718,0.00061001995,0.0008068786,0.002955922,0.006093414,0.0025242164,0.0010827205,0.0004405231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004834937,0.00003989152,0.0016761429,0.00002682116,0.000013900471,0.00021664303,0.00079822895,0.0010975183,0.0047499635,0.982141,0.00031603008,0.008875477],"study_design_scores_gemma":[0.00001882809,0.000045858826,0.0012740484,0.000019523968,0.000017999124,0.00035197666,0.000548548,0.008651857,0.0057264636,0.9782005,0.0051216087,0.000022911892],"about_ca_topic_score_codex":0.0006235235,"about_ca_topic_score_gemma":0.00043444763,"teacher_disagreement_score":0.0040858667,"about_ca_system_score_codex":0.0010911308,"about_ca_system_score_gemma":0.0005451626,"threshold_uncertainty_score":0.013668597},"labels":[],"label_agreement":null},{"id":"W2083006134","doi":"10.1016/j.tcs.2013.03.001","title":"Infinite ternary square-free words concatenated from permutations of a single word","year":2013,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Ternary operation; Square-free integer; Morphism; Combinatorics; Word (group theory); Square (algebra); Mathematics; Factorization; Discrete mathematics; Arithmetic; Computer science; Algorithm; Geometry","score_opus":0.0166314847851349,"score_gpt":0.24482904076071738,"score_spread":0.22819755597558247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083006134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43686214,0.0010642043,0.4954075,0.0010070414,0.0011684509,0.00015768777,0.0013408716,0.0039742473,0.059017852],"genre_scores_gemma":[0.8587386,0.00038090922,0.09959131,0.0003784526,0.0003095782,0.00017298786,0.0012372362,0.000819888,0.03837096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990459,0.00016260557,0.00010516261,0.00025481376,0.0002629909,0.00016858277],"domain_scores_gemma":[0.99785304,0.00081762066,0.00031104148,0.00042192556,0.00038698333,0.0002094189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051460066,0.00063045614,0.00066046097,0.0008016301,0.0013031431,0.0020475083,0.00081699376,0.00088345446,0.010246812],"category_scores_gemma":[0.0033093418,0.00052277563,0.00068930205,0.0010451991,0.0015643955,0.003507878,0.0024461558,0.0010298608,0.0037209147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001144894,0.00010918285,0.0017469829,0.0004795015,0.00006475203,0.00298349,0.0017026502,0.0062728166,0.08760883,0.81455,0.00639664,0.07694029],"study_design_scores_gemma":[0.00008757024,0.00027620487,0.0011445296,0.0001786784,0.00013572823,0.0015545056,0.00040879688,0.0283504,0.091379896,0.81906116,0.057308808,0.0001137249],"about_ca_topic_score_codex":0.0003353562,"about_ca_topic_score_gemma":0.0005769358,"teacher_disagreement_score":0.010246812,"about_ca_system_score_codex":0.0005011659,"about_ca_system_score_gemma":0.0010927629,"threshold_uncertainty_score":0.03427899},"labels":[],"label_agreement":null},{"id":"W2083734106","doi":"10.2168/lmcs-8(2:8)2012","title":"Width and size of regular resolution proofs","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Resolution (logic); Mathematical proof; Set (abstract data type); Mathematics; Contrast (vision); Discrete mathematics; Computer science; Combinatorics; Geometry; Programming language; Artificial intelligence","score_opus":0.045881018830954245,"score_gpt":0.36079444825693907,"score_spread":0.3149134294259848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083734106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54552215,0.0044400566,0.4269903,0.0037940026,0.00015145399,0.00015381866,0.0014839005,0.0017129031,0.015751317],"genre_scores_gemma":[0.8954797,0.0012802753,0.099066965,0.00025876195,0.00023869956,0.00016169547,0.00089473906,0.00053083117,0.0020883768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99179244,0.00245713,0.001030188,0.0016943723,0.0022832248,0.000742703],"domain_scores_gemma":[0.9125918,0.06902482,0.0054988707,0.0077043334,0.0030109007,0.002169237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00702414,0.00051130104,0.0017158607,0.0027374444,0.0011920705,0.0047012386,0.003006603,0.0017984478,0.004789647],"category_scores_gemma":[0.052737363,0.0013949057,0.0014819376,0.0021953834,0.003127278,0.013308264,0.0036764946,0.0023876044,0.00059620745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002210838,0.0003179685,0.010790471,0.0024282057,0.00043980993,0.0010525618,0.0031342583,0.049937394,0.030575573,0.75653255,0.0045277006,0.13805257],"study_design_scores_gemma":[0.00012889238,0.000118458345,0.0015477503,0.00015497753,0.00018294126,0.0007610749,0.00032607053,0.04563584,0.016383609,0.9302818,0.0044217953,0.000056765],"about_ca_topic_score_codex":0.00022160458,"about_ca_topic_score_gemma":0.0002301277,"teacher_disagreement_score":0.00702414,"about_ca_system_score_codex":0.00091065065,"about_ca_system_score_gemma":0.000708837,"threshold_uncertainty_score":0.03714764},"labels":[],"label_agreement":null},{"id":"W2083735143","doi":"10.1142/s012905410300214x","title":"A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University; University of Prince Edward Island","funders":"","keywords":"Regular expression; Regular language; Computer science; Pumping lemma for regular languages; Context-free language; Context (archaeology); Theoretical computer science; Programming language; Artificial intelligence; Automaton; Biology; Rule-based machine translation; Programming paradigm; Fifth-generation programming language","score_opus":0.02637070741872171,"score_gpt":0.3423945622337794,"score_spread":0.3160238548150577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083735143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026336238,0.0032547456,0.90507704,0.0055413344,0.0003069598,0.0002196946,0.00028162813,0.00057453726,0.058407772],"genre_scores_gemma":[0.5367483,0.0039413203,0.4287268,0.001731754,0.000957115,0.00075198035,0.00062759366,0.0004339858,0.026081176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939721,0.0023239944,0.000564099,0.0013023249,0.0013922189,0.00044508534],"domain_scores_gemma":[0.985837,0.009533812,0.0011071675,0.0018046875,0.001398354,0.00031897338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062852036,0.0009480452,0.00069592753,0.0014800148,0.0019515286,0.0043050237,0.0017027671,0.0015312224,0.005449885],"category_scores_gemma":[0.013433278,0.001023704,0.0014516818,0.0023361803,0.011763604,0.0127826575,0.002627136,0.0044923984,0.0009879364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005847624,0.000007816318,0.00005758181,0.00004747744,0.000002822125,0.00008797855,0.00033357958,0.00068101654,0.00032663753,0.99556535,0.00034715948,0.0025368216],"study_design_scores_gemma":[0.000018252706,0.000041718748,0.000117768395,0.000112612914,0.00001781715,0.00049462623,0.00041573486,0.010486422,0.0019855744,0.91077834,0.07550994,0.00002114673],"about_ca_topic_score_codex":0.0012824185,"about_ca_topic_score_gemma":0.00067390595,"teacher_disagreement_score":0.0062852036,"about_ca_system_score_codex":0.0024432614,"about_ca_system_score_gemma":0.0016416141,"threshold_uncertainty_score":0.033239722},"labels":[],"label_agreement":null},{"id":"W2083770519","doi":"10.1016/s0304-3975(03)00090-2","title":"The ring of k-regular sequences, II","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":227,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ring (chemistry); Mathematics; State (computer science); Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm","score_opus":0.007250582662101844,"score_gpt":0.22411700245009575,"score_spread":0.2168664197879939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083770519","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25286928,0.042887196,0.20010994,0.011412212,0.003491667,0.0000976608,0.0017682862,0.00078596233,0.4865778],"genre_scores_gemma":[0.90871865,0.0054527377,0.026541576,0.00068785966,0.0015465312,0.000074178686,0.00043357123,0.000085567444,0.056459423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954385,0.00010018168,0.00003343253,0.00015619732,0.000098900535,0.00006741183],"domain_scores_gemma":[0.99935144,0.00026746345,0.00008833234,0.00010893948,0.00009243792,0.000091391834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000634659,0.00027738017,0.0005482268,0.00086209335,0.0010544775,0.0036169724,0.00049406156,0.00039078004,0.0040262127],"category_scores_gemma":[0.0014053977,0.00026207187,0.000452995,0.00094021746,0.0030143731,0.005375158,0.00095653767,0.0015493887,0.0013089771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040008115,0.000006069088,0.00014107226,0.000045966044,0.0000042373026,0.000023579949,0.00021027564,0.00035983464,0.00074236456,0.98967427,0.0023388918,0.006413431],"study_design_scores_gemma":[0.000008964042,0.000022900023,0.00032786897,0.000018157109,0.000005897517,0.00011130972,0.00011139457,0.0010894054,0.00053593295,0.97647583,0.021283574,0.000008809115],"about_ca_topic_score_codex":0.00042417174,"about_ca_topic_score_gemma":0.00021617253,"teacher_disagreement_score":0.0040262127,"about_ca_system_score_codex":0.0009831791,"about_ca_system_score_gemma":0.00052679185,"threshold_uncertainty_score":0.013468981},"labels":[],"label_agreement":null},{"id":"W2083810917","doi":"10.1016/j.tcs.2011.06.021","title":"Finite state complexity","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Finite-state machine; Upper and lower bounds; Turing machine; Descriptive complexity theory; Deterministic finite automaton; Prefix; Finite set; State (computer science); Kolmogorov complexity; Finite state; Complexity class; Discrete mathematics; Time complexity; Algorithm","score_opus":0.0383737367207392,"score_gpt":0.24576939112310286,"score_spread":0.20739565440236366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083810917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106567755,0.0051248074,0.4705296,0.013717121,0.00078515726,0.00018418505,0.0022197983,0.00108674,0.3997848],"genre_scores_gemma":[0.895148,0.0024515102,0.033526365,0.0008391615,0.0009476735,0.00026937705,0.0014130517,0.00028484006,0.06512009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997983,0.00037629335,0.00012170651,0.0005507908,0.0007462452,0.00022186893],"domain_scores_gemma":[0.9928965,0.004743697,0.00021705573,0.0012024363,0.00069548876,0.00024480128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010082389,0.00068918715,0.001514818,0.0015413037,0.0020922578,0.0055245706,0.0014298836,0.0016226819,0.021802425],"category_scores_gemma":[0.0072106654,0.0005590511,0.0014739782,0.0022127104,0.0038279314,0.011608507,0.0028187367,0.004807249,0.0027379366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008116908,0.0000097522425,0.000083186766,0.000028379658,0.0000057832167,0.000017260707,0.00010976025,0.00094049424,0.00015765191,0.9922069,0.0015625278,0.0048703244],"study_design_scores_gemma":[0.0000021813673,0.0000022812208,0.000045327943,0.000004397721,0.0000033432148,0.000017873475,0.000015178036,0.0021599093,0.00012714391,0.99445564,0.0031637577,0.0000030406372],"about_ca_topic_score_codex":0.0011493711,"about_ca_topic_score_gemma":0.00063697144,"teacher_disagreement_score":0.021802425,"about_ca_system_score_codex":0.0026999975,"about_ca_system_score_gemma":0.0014637107,"threshold_uncertainty_score":0.072936356},"labels":[],"label_agreement":null},{"id":"W2083924351","doi":"10.1016/j.jpaa.2009.12.014","title":"A combinatorial property of ideals in free profinite monoids","year":2010,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Profinite group; Property (philosophy); Pure mathematics; Group (periodic table); Epistemology","score_opus":0.007533398024884377,"score_gpt":0.215091121964385,"score_spread":0.20755772393950064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083924351","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.806652,0.0010759359,0.13279204,0.0009920279,0.00022535557,0.00009709,0.0006995602,0.0006209255,0.056845076],"genre_scores_gemma":[0.97823197,0.00026101485,0.01400613,0.00013005422,0.00029786635,0.00005657922,0.00039949783,0.00013371928,0.006483244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982192,0.00036421677,0.00019782539,0.00047811784,0.0004610566,0.0002795831],"domain_scores_gemma":[0.98945963,0.0062188734,0.0011549484,0.0011323525,0.0008080043,0.0012262008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016943652,0.00057165616,0.001370471,0.0031688667,0.0029416084,0.007851568,0.001704505,0.0010708021,0.0061097457],"category_scores_gemma":[0.00539011,0.0014929092,0.0014710845,0.0026677193,0.005533356,0.011100767,0.002445368,0.0024981557,0.0007363675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002231471,0.000068205336,0.001531555,0.00007737047,0.000018123254,0.00027735083,0.00091702223,0.000855815,0.0043278253,0.98604244,0.0006024955,0.0050586523],"study_design_scores_gemma":[0.0000657265,0.00009824041,0.0012604105,0.000025499747,0.0000522314,0.00088379125,0.00042564276,0.004490812,0.0044181133,0.9840566,0.0041655833,0.000057418387],"about_ca_topic_score_codex":0.000515999,"about_ca_topic_score_gemma":0.0005571781,"teacher_disagreement_score":0.007851568,"about_ca_system_score_codex":0.0011125994,"about_ca_system_score_gemma":0.0005882521,"threshold_uncertainty_score":0.020439148},"labels":[],"label_agreement":null},{"id":"W2084344766","doi":"10.1007/s00153-009-0136-4","title":"The equivalence of theories that characterize ALogTime","year":2009,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Word problem (mathematics education); Permutation (music); Equivalence (formal languages); Combinatorics; Equivalence relation; Discrete mathematics; Characterization (materials science); Algebra over a field; Pure mathematics; Arithmetic","score_opus":0.0286124315755724,"score_gpt":0.26472884710453476,"score_spread":0.23611641552896237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084344766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3063827,0.0015797019,0.49933434,0.009704258,0.0009036163,0.00042012805,0.0037944585,0.0025380459,0.17534281],"genre_scores_gemma":[0.94343805,0.00035956266,0.040142078,0.001185462,0.00048219765,0.00026759293,0.002526687,0.0005014693,0.01109683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942848,0.0015299909,0.0005135675,0.0013219278,0.001239749,0.001109921],"domain_scores_gemma":[0.9810311,0.010410221,0.0014319939,0.0036899678,0.0022035253,0.0012331252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035505195,0.0007719395,0.0016158812,0.003407611,0.004559824,0.009455827,0.002985641,0.0029600621,0.01571176],"category_scores_gemma":[0.018596679,0.001145473,0.0026288459,0.0031995072,0.007861678,0.030232271,0.0052934997,0.007923265,0.0019171323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008030273,0.00009959043,0.00045308843,0.000035129808,0.000014046248,0.000068830894,0.0007014306,0.00054418284,0.00039368705,0.99062073,0.00119363,0.0057953387],"study_design_scores_gemma":[0.000026060156,0.000020225376,0.00023401657,0.000014325345,0.000014567375,0.00007645435,0.00025683243,0.002163506,0.0005433623,0.99364626,0.0029930063,0.000011348763],"about_ca_topic_score_codex":0.0014770614,"about_ca_topic_score_gemma":0.0013178424,"teacher_disagreement_score":0.01571176,"about_ca_system_score_codex":0.0024023764,"about_ca_system_score_gemma":0.0018146702,"threshold_uncertainty_score":0.052561045},"labels":[],"label_agreement":null},{"id":"W2084532813","doi":"10.1016/j.ic.2009.03.004","title":"Variants of codes and indecomposable languages","year":2009,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Catenation; Extension (predicate logic); Indecomposable module; Computer science; Prefix code; Regular language; Code (set theory); Prime (order theory); Decomposition; Mathematics; Programming language; Discrete mathematics; Algebra over a field; Pure mathematics; Automaton; Combinatorics; Theoretical computer science; Algorithm; Decoding methods; Linear code; Set (abstract data type)","score_opus":0.005621339309925413,"score_gpt":0.243609034690517,"score_spread":0.23798769538059159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084532813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3220483,0.0047354535,0.53581107,0.0041674776,0.0014409975,0.00012622632,0.0010813894,0.00074866647,0.12984046],"genre_scores_gemma":[0.9034597,0.0013885226,0.058734033,0.00059427676,0.00089648296,0.00013444995,0.0006445417,0.00026806098,0.03387983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794716,0.0005035238,0.00014308323,0.0005297694,0.00058604457,0.00029044197],"domain_scores_gemma":[0.9956203,0.002186258,0.0003493621,0.00074057636,0.0007094084,0.0003940391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013385479,0.0008049561,0.00083194626,0.0016923606,0.0015280399,0.003948091,0.0015284205,0.0011763911,0.00501196],"category_scores_gemma":[0.005186462,0.000550413,0.0011038086,0.0017543824,0.004273669,0.0056113023,0.002368125,0.003412771,0.0008702327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018357992,0.0000057346842,0.000061821294,0.000012619092,0.0000021696421,0.00005061843,0.00014872663,0.0003896078,0.0003045822,0.99649435,0.0003484263,0.002163122],"study_design_scores_gemma":[0.000006661342,0.000007642986,0.000045889592,0.0000066697075,0.0000038024348,0.000091636146,0.000033785884,0.0020877125,0.00031729596,0.99484915,0.002541451,0.000008259972],"about_ca_topic_score_codex":0.0014842142,"about_ca_topic_score_gemma":0.0012009649,"teacher_disagreement_score":0.00501196,"about_ca_system_score_codex":0.0015347265,"about_ca_system_score_gemma":0.0010285137,"threshold_uncertainty_score":0.016766608},"labels":[],"label_agreement":null},{"id":"W2084593271","doi":"10.1016/j.jcta.2003.12.004","title":"Polynomial versus exponential growth in repetition-free binary words","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Exponential growth; Binary number; Mathematics; Exponential function; Polynomial; Repetition (rhetorical device); Combinatorics; Discrete mathematics; Exponential polynomial; Arithmetic; Mathematical analysis","score_opus":0.007989040553793911,"score_gpt":0.22204206467397514,"score_spread":0.21405302412018123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084593271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.834541,0.0015053896,0.1137201,0.0043477425,0.00022673598,0.00007046659,0.0005966977,0.00082681736,0.04416498],"genre_scores_gemma":[0.97616756,0.0005575229,0.0101158945,0.0002420352,0.00034471604,0.000062288505,0.00023079201,0.00021278877,0.0120664695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980094,0.00050843984,0.00011147706,0.00033296362,0.0005388517,0.0004989889],"domain_scores_gemma":[0.9518539,0.039346844,0.0021321285,0.0028378495,0.0022059376,0.0016234089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023433496,0.0005858171,0.00093188713,0.0015555434,0.0014197971,0.004008056,0.0016196959,0.0013295651,0.009559363],"category_scores_gemma":[0.029917177,0.0007396667,0.0007625329,0.0015490205,0.0036115563,0.009077644,0.002267141,0.0024637063,0.0014071019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072141265,0.00009463417,0.0025511794,0.00015804078,0.000014366198,0.0003587131,0.0012002271,0.014749254,0.005429684,0.9520447,0.002804898,0.019872893],"study_design_scores_gemma":[0.000055437285,0.00005962398,0.00079398474,0.000033396616,0.000026220507,0.00033818933,0.0001928121,0.051287938,0.0033162253,0.9419506,0.001908406,0.00003705705],"about_ca_topic_score_codex":0.0015211231,"about_ca_topic_score_gemma":0.0015386648,"teacher_disagreement_score":0.009559363,"about_ca_system_score_codex":0.0016399606,"about_ca_system_score_gemma":0.0013307432,"threshold_uncertainty_score":0.031979263},"labels":[],"label_agreement":null},{"id":"W2084661883","doi":"10.1016/j.tcs.2009.02.025","title":"State complexity of power","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Academy of Finland","keywords":"Combinatorics; Nondeterministic algorithm; Alphabet; Regular language; Nondeterministic finite automaton; Deterministic finite automaton; State (computer science); Upper and lower bounds; Mathematics; Finite-state machine; Function (biology); Discrete mathematics; Time complexity; Constant (computer programming); Automaton; Computer science; Algorithm; Automata theory; Theoretical computer science","score_opus":0.014499479140722055,"score_gpt":0.25283446374698176,"score_spread":0.2383349846062597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084661883","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61607915,0.0012602025,0.21025968,0.0063762995,0.00015162013,0.00010444836,0.0012173855,0.0005679861,0.16398332],"genre_scores_gemma":[0.98803234,0.0002075062,0.0037435724,0.00009664256,0.00011742956,0.000059929174,0.00023056936,0.00007372378,0.007438301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976265,0.0005455138,0.00011688754,0.0004955682,0.00077657984,0.00043900622],"domain_scores_gemma":[0.9813448,0.0132487975,0.0007930216,0.0025897603,0.0012123664,0.00081131095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001624701,0.0004874102,0.0013942643,0.0018716484,0.0021841335,0.0068139085,0.0016159096,0.0015132697,0.017676188],"category_scores_gemma":[0.015345587,0.00065457966,0.0012444467,0.002235061,0.0045685507,0.016861426,0.0032433032,0.00390947,0.0009522394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003913016,0.000015214552,0.00033442583,0.000020506597,0.000006988806,0.000024640349,0.00028164982,0.0025298218,0.0002234803,0.9930565,0.0006761466,0.002791469],"study_design_scores_gemma":[0.000008288669,0.000005753463,0.00019502817,0.0000042343745,0.000007046971,0.000023238412,0.0000605721,0.011613966,0.00024834843,0.9870964,0.0007301737,0.000007025833],"about_ca_topic_score_codex":0.0017393586,"about_ca_topic_score_gemma":0.0009193986,"teacher_disagreement_score":0.017676188,"about_ca_system_score_codex":0.0022961241,"about_ca_system_score_gemma":0.0011349699,"threshold_uncertainty_score":0.059132695},"labels":[],"label_agreement":null},{"id":"W2084802325","doi":"10.1016/j.ejc.2007.01.002","title":"Characterizations of finite and infinite episturmian words via lexicographic orderings","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Lexicographical order; Mathematics; Alphabet; Finite set; Combinatorics on words; Order (exchange); Characterization (materials science); Combinatorics; Skew; Set (abstract data type); Infinite set; Infinite product; Discrete mathematics; Word (group theory); Mathematical analysis; Linguistics; Computer science","score_opus":0.007909369142483323,"score_gpt":0.2068976660720896,"score_spread":0.19898829692960626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084802325","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6349702,0.0008247761,0.24551982,0.0014427513,0.00021678377,0.00011681649,0.00078964734,0.0006335311,0.11548566],"genre_scores_gemma":[0.94398624,0.00028025347,0.039796546,0.00028457126,0.00021324544,0.00009945399,0.0007984485,0.00018956895,0.014351653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988404,0.0002926103,0.00013792343,0.00022204239,0.00029216942,0.00021487003],"domain_scores_gemma":[0.9964142,0.0020817546,0.00037984183,0.00028455906,0.000482629,0.00035702868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008346424,0.00053519994,0.0006382783,0.0025817072,0.001780982,0.0045199962,0.0008336048,0.0010380123,0.0070951246],"category_scores_gemma":[0.0037769454,0.00056075485,0.0007749183,0.0017971557,0.0031554396,0.004975653,0.0019345916,0.0017289354,0.0009735164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069748414,0.000031662865,0.00053404213,0.000047479443,0.0000063031575,0.00020843153,0.00082504,0.000482442,0.0029770364,0.9874536,0.0005810231,0.0067831026],"study_design_scores_gemma":[0.000019934962,0.000030573545,0.00055758376,0.000029032568,0.000016935339,0.00044039782,0.00051751314,0.005701387,0.0018509931,0.9855456,0.0052596196,0.000030411336],"about_ca_topic_score_codex":0.0004338548,"about_ca_topic_score_gemma":0.00068488304,"teacher_disagreement_score":0.0070951246,"about_ca_system_score_codex":0.0008924893,"about_ca_system_score_gemma":0.0005121368,"threshold_uncertainty_score":0.023735583},"labels":[],"label_agreement":null},{"id":"W2084807618","doi":"10.1016/j.tcs.2004.02.031","title":"Deletion along trajectories","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Decidability; Closure (psychology); Regular language; Mathematical proof; Formal language; Mathematics; Inverse; Discrete mathematics; Combinatorics; Computer science; Theoretical computer science; Algorithm; Automaton","score_opus":0.007075571221615482,"score_gpt":0.22688505009427937,"score_spread":0.2198094788726639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084807618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20498171,0.00064114976,0.5843671,0.0026683589,0.00081662985,0.0002713947,0.0021621066,0.0027064504,0.20138508],"genre_scores_gemma":[0.6719773,0.00097097724,0.103610456,0.0006215268,0.00023865157,0.0003412845,0.0041605127,0.0024723157,0.21560706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980484,0.00026999135,0.00012588724,0.000675976,0.0005168538,0.00036287055],"domain_scores_gemma":[0.9949797,0.0015751016,0.0003048516,0.0014884232,0.0012366617,0.00041534766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010046987,0.0008908292,0.0011224343,0.0016780427,0.0038514538,0.0035732244,0.0018289611,0.0017721048,0.026602412],"category_scores_gemma":[0.006993387,0.00071897334,0.0013485112,0.001895403,0.002706206,0.008393473,0.0045072245,0.0037665265,0.007781181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001432812,0.000034653953,0.000666487,0.00007860744,0.0000114730765,0.0005852988,0.00097392703,0.0015478119,0.004499225,0.96325374,0.00380698,0.024398535],"study_design_scores_gemma":[0.000020963642,0.000031128206,0.00029545111,0.00004053121,0.000020361993,0.00054297433,0.00065126107,0.005406213,0.0068325987,0.9501979,0.03593421,0.000026408341],"about_ca_topic_score_codex":0.0018750866,"about_ca_topic_score_gemma":0.0011619803,"teacher_disagreement_score":0.026602412,"about_ca_system_score_codex":0.001389544,"about_ca_system_score_gemma":0.0015229747,"threshold_uncertainty_score":0.08899397},"labels":[],"label_agreement":null},{"id":"W2084869467","doi":"10.1016/j.tcs.2009.02.035","title":"State complexity of unique rational operations","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; State (computer science); Regular language; Theoretical computer science; Computational complexity theory; Time complexity; Algorithm; Automaton","score_opus":0.019159765986843016,"score_gpt":0.2675043142512131,"score_spread":0.2483445482643701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084869467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84790367,0.00062488863,0.118761085,0.002010637,0.00006522887,0.00005380743,0.000566901,0.0002643012,0.029749464],"genre_scores_gemma":[0.992687,0.00021008847,0.0038113426,0.000053669333,0.00006467895,0.000037803467,0.00021741491,0.000039202427,0.0028786995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760145,0.00054193893,0.00014810135,0.00044169227,0.0007935618,0.00047334612],"domain_scores_gemma":[0.9768513,0.01860655,0.0011126786,0.0015945768,0.0010568295,0.0007780708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001868922,0.00053301064,0.0014102034,0.0017538179,0.0017073812,0.007297028,0.0016140398,0.0015186223,0.00893812],"category_scores_gemma":[0.013713592,0.0006771678,0.0013264107,0.0018603703,0.0036093981,0.013875721,0.003067958,0.0036144296,0.00047907868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001370685,0.000043722746,0.00089428923,0.000053307765,0.00001542999,0.000055885455,0.00052794773,0.009701556,0.0007888151,0.9816964,0.0005576756,0.0055277664],"study_design_scores_gemma":[0.000017731372,0.000016459411,0.00039778254,0.000008568397,0.000017080984,0.00003615358,0.00010733867,0.03837544,0.0007499577,0.9598572,0.00039801895,0.000018233648],"about_ca_topic_score_codex":0.0016774645,"about_ca_topic_score_gemma":0.0013662232,"teacher_disagreement_score":0.00893812,"about_ca_system_score_codex":0.0024490743,"about_ca_system_score_gemma":0.0013769639,"threshold_uncertainty_score":0.029901028},"labels":[],"label_agreement":null},{"id":"W2085042840","doi":"10.1142/s0129054105003200","title":"THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"","keywords":"Hierarchy; Conjecture; Mathematics; Upper and lower bounds; Polynomial; Combinatorics; Polynomial hierarchy; Discrete mathematics; Time complexity; Mathematical analysis","score_opus":0.018719036039273374,"score_gpt":0.28599908382975253,"score_spread":0.26728004779047915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085042840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44589722,0.0009361173,0.38520733,0.0023116255,0.00023038917,0.00014580526,0.0009132291,0.0014466431,0.16291168],"genre_scores_gemma":[0.9196153,0.00051274896,0.05860893,0.0005817687,0.00009347582,0.00013711794,0.00026817498,0.00024531418,0.01993707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999321,0.00006373745,0.000035850844,0.00015721627,0.00022012615,0.00020211069],"domain_scores_gemma":[0.9969049,0.0014480366,0.00023388074,0.0004637404,0.00047464375,0.00047475056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063770066,0.00033423622,0.00047854442,0.0011565468,0.0014935525,0.0035288,0.0010009963,0.0010089139,0.012683775],"category_scores_gemma":[0.0048497505,0.0004387778,0.00059775,0.000840826,0.0024226152,0.0052903323,0.0021138529,0.002782298,0.0026574766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009705556,0.000030495936,0.00093677134,0.00008358274,0.0000038531934,0.00013357567,0.0004958656,0.00089855376,0.0064049955,0.9709335,0.0015113613,0.018470371],"study_design_scores_gemma":[0.000027654072,0.000059426373,0.0016065785,0.0000538909,0.000015332183,0.00042080155,0.00040083507,0.016194485,0.005728175,0.9633664,0.012091429,0.00003508467],"about_ca_topic_score_codex":0.0021445225,"about_ca_topic_score_gemma":0.0027487525,"teacher_disagreement_score":0.012683775,"about_ca_system_score_codex":0.0018032109,"about_ca_system_score_gemma":0.00093041314,"threshold_uncertainty_score":0.042431474},"labels":[],"label_agreement":null},{"id":"W2085182681","doi":"10.4153/cmb-2004-033-2","title":"Combinatorics of Words and Semigroup Algebras Which Are Sums of Locally Nilpotent Subalgebras","year":2004,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Semigroup; Nilpotent; Locally nilpotent; Construct (python library); Pure mathematics; Algebra over a field; Nilpotent group; Discrete mathematics","score_opus":0.006508806281306019,"score_gpt":0.1886395039348699,"score_spread":0.18213069765356388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085182681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8069901,0.0009839488,0.15945669,0.0006662069,0.000116458716,0.00011523703,0.0002524458,0.00043417027,0.03098472],"genre_scores_gemma":[0.96001947,0.00030448483,0.030589487,0.00011760248,0.00011344742,0.00015421845,0.0002569444,0.00008646903,0.008357939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988335,0.00031900266,0.00013421697,0.00015851088,0.00041144565,0.00014339508],"domain_scores_gemma":[0.9976636,0.0010391624,0.00040806286,0.0002585596,0.00028707876,0.0003435552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009950892,0.00040122907,0.0007492619,0.0021572239,0.0020043058,0.0038090893,0.00092882017,0.0005472038,0.0051458906],"category_scores_gemma":[0.0028001706,0.0004480272,0.0007622688,0.00159751,0.003554564,0.006107013,0.0022089763,0.00088611007,0.0005686838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000770508,0.000028228973,0.00083948317,0.0000806415,0.000015477248,0.0005575147,0.0006272767,0.0012374797,0.0031132542,0.9881743,0.00043443954,0.0048147156],"study_design_scores_gemma":[0.000020671408,0.000026788675,0.00050941826,0.000024064337,0.000026220827,0.0006780713,0.0005224829,0.0071205213,0.0048054582,0.97978836,0.006451012,0.000027079108],"about_ca_topic_score_codex":0.0004166996,"about_ca_topic_score_gemma":0.00076640997,"teacher_disagreement_score":0.0051458906,"about_ca_system_score_codex":0.0009875849,"about_ca_system_score_gemma":0.00057772105,"threshold_uncertainty_score":0.017214656},"labels":[],"label_agreement":null},{"id":"W2086306425","doi":"10.1016/j.tcs.2007.09.015","title":"Palindrome positions in ternary square-free words","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Palindrome; Ternary operation; Mathematics; Sequence (biology); Word (group theory); Combinatorics; Integer (computer science); Position (finance); Arbitrariness; Word length; Binary number; Square (algebra); Arithmetic; Discrete mathematics; Computer science; Linguistics; Natural language processing; Philosophy; Geometry","score_opus":0.006775379402386871,"score_gpt":0.24749328958025793,"score_spread":0.24071791017787106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086306425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92915374,0.00039602525,0.04350531,0.0005304146,0.00022402564,0.000045608984,0.00025314503,0.00040838568,0.025483275],"genre_scores_gemma":[0.9860736,0.00007610003,0.0066884956,0.00007585563,0.000057123565,0.000026987327,0.000107758824,0.000053236945,0.0068408656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995372,0.00008005353,0.000048293354,0.00011826159,0.000096968666,0.00011925598],"domain_scores_gemma":[0.9982256,0.0010470506,0.00020165497,0.00017615668,0.00018449727,0.00016505801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004009274,0.00036051084,0.00044485464,0.0007679288,0.0017424579,0.0027165017,0.00062675215,0.0010163434,0.0071028015],"category_scores_gemma":[0.0024433436,0.0005452803,0.0003416116,0.00094167166,0.0017295378,0.002653085,0.0010650322,0.0010052042,0.0014025779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072319485,0.00011009583,0.0017201039,0.00011459144,0.000009369424,0.001598065,0.0029852681,0.002113071,0.02258081,0.94340765,0.0011571636,0.023480617],"study_design_scores_gemma":[0.00015266087,0.00023204286,0.0011668821,0.000046041663,0.00003260664,0.00093750976,0.001214829,0.009927577,0.01834624,0.9605788,0.0073044365,0.000060378807],"about_ca_topic_score_codex":0.00070482434,"about_ca_topic_score_gemma":0.0010390616,"teacher_disagreement_score":0.0071028015,"about_ca_system_score_codex":0.0006737014,"about_ca_system_score_gemma":0.00064142677,"threshold_uncertainty_score":0.023761213},"labels":[],"label_agreement":null},{"id":"W2086380781","doi":"10.1142/s0129054107005078","title":"ON THE EXISTENCE OF LOOKAHEAD DELEGATORS FOR NFA","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nondeterministic algorithm; Computer science; Decidability; Delegation; Property (philosophy); Nondeterministic finite automaton; Deterministic finite automaton; Finite-state machine; Automaton; Theoretical computer science; Büchi automaton; Discrete mathematics; Deterministic automaton; Programming language; Mathematics; Automata theory","score_opus":0.02257258117667414,"score_gpt":0.31746810412455884,"score_spread":0.2948955229478847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086380781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06932744,0.000458267,0.92407775,0.0011056871,0.00004541991,0.00013883747,0.00009561499,0.00073922926,0.0040117693],"genre_scores_gemma":[0.65037936,0.00065558555,0.34339988,0.000443128,0.00012135929,0.00048946013,0.0002534314,0.00030627384,0.003951491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992019,0.003131244,0.000835505,0.0019248143,0.0011352479,0.0009541112],"domain_scores_gemma":[0.8875273,0.099227585,0.0034219602,0.0066478355,0.001837769,0.0013375474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010251268,0.0011062662,0.0018818948,0.0011917691,0.0026251962,0.0041701575,0.002293663,0.0030071607,0.0047900113],"category_scores_gemma":[0.056776643,0.0014702814,0.0034947132,0.0010967039,0.0072229714,0.013741377,0.005358697,0.0042824904,0.0006767816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006155554,0.0002573047,0.0034453399,0.0006062728,0.00010567411,0.0005184297,0.0025377788,0.14860643,0.008810204,0.78848755,0.0009865116,0.045022994],"study_design_scores_gemma":[0.00009531608,0.00015380238,0.00023842446,0.00009946434,0.000086332104,0.00030715697,0.0002776364,0.280428,0.0104072215,0.7042568,0.003574807,0.000075012926],"about_ca_topic_score_codex":0.0015292502,"about_ca_topic_score_gemma":0.0010929003,"teacher_disagreement_score":0.010251268,"about_ca_system_score_codex":0.0023539236,"about_ca_system_score_gemma":0.0021211507,"threshold_uncertainty_score":0.054214537},"labels":[],"label_agreement":null},{"id":"W2086603341","doi":"10.1016/j.tcs.2010.11.025","title":"Complexity and palindromic defect of infinite words","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Palindrome; Conjecture; Mathematics; State (computer science); Combinatorics; Palindromic sequence; Algorithm; CRISPR; Genetics","score_opus":0.011621170060287709,"score_gpt":0.24605559810753605,"score_spread":0.23443442804724834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086603341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93708575,0.00042809983,0.03782664,0.0014464163,0.00006919725,0.000027936041,0.00022006911,0.00008381264,0.022812067],"genre_scores_gemma":[0.99266654,0.00014590193,0.0037967188,0.00006832126,0.0001255492,0.000032894764,0.00016875811,0.000024535186,0.0029707318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856806,0.00030710103,0.00011722123,0.00028971667,0.0005055226,0.0002123406],"domain_scores_gemma":[0.98664385,0.009332891,0.0013302501,0.001028738,0.00075554143,0.0009086263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011407889,0.00041672244,0.0011114012,0.002324531,0.0014776876,0.005049332,0.0014757196,0.0013747095,0.0047357534],"category_scores_gemma":[0.009796782,0.0005099635,0.0009292039,0.001513875,0.0048541063,0.009085879,0.0024896706,0.0026426732,0.00037132192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010395473,0.000036448764,0.0013604792,0.00004850276,0.00000972226,0.00013226834,0.0005936067,0.0022286887,0.0015190832,0.9903854,0.00035178536,0.0032301303],"study_design_scores_gemma":[0.000023196728,0.000021887328,0.00056147284,0.000007491421,0.000007150566,0.0001486901,0.00012480974,0.0057614967,0.0005532645,0.9922597,0.00051546545,0.000015360245],"about_ca_topic_score_codex":0.0005566183,"about_ca_topic_score_gemma":0.00040305522,"teacher_disagreement_score":0.005049332,"about_ca_system_score_codex":0.0014654561,"about_ca_system_score_gemma":0.0005737317,"threshold_uncertainty_score":0.015842736},"labels":[],"label_agreement":null},{"id":"W2086666778","doi":"10.1016/j.tcs.2005.01.005","title":"Avoiding large squares in infinite binary words","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Binary number; Mathematics; Construct (python library); Word (group theory); Least-squares function approximation; Combinatorics; Discrete mathematics; Arithmetic; Statistics; Computer science; Geometry","score_opus":0.00866029022211975,"score_gpt":0.24990594008600098,"score_spread":0.24124564986388122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086666778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73235464,0.00042556287,0.21568182,0.0011584448,0.00023460791,0.00006562116,0.0001274646,0.00072819844,0.04922367],"genre_scores_gemma":[0.93174726,0.00016942252,0.036578912,0.00024253568,0.000094477145,0.00008620605,0.0001345352,0.0002654222,0.030681133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943596,0.00017603888,0.000036695477,0.00012424048,0.00012423728,0.00010280918],"domain_scores_gemma":[0.9947108,0.0036335278,0.0004287798,0.00047075184,0.00035619424,0.0003998985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005906124,0.0005176419,0.0008284296,0.000741243,0.0019745615,0.0021643445,0.00078596204,0.0014951328,0.0064160447],"category_scores_gemma":[0.0053426605,0.00080689054,0.0005968596,0.0008304359,0.002161681,0.0040048193,0.0024274567,0.0017124629,0.0012495731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018292313,0.000045487162,0.0006819767,0.00011628899,0.000010777772,0.00041983242,0.0009990714,0.004721775,0.006735842,0.9732002,0.0018236742,0.011062224],"study_design_scores_gemma":[0.000025077681,0.000031438205,0.00018116938,0.000011705069,0.0000079847905,0.00018173021,0.00019095505,0.01099286,0.0017631578,0.9844648,0.002136904,0.000012167771],"about_ca_topic_score_codex":0.0005677533,"about_ca_topic_score_gemma":0.0011717957,"teacher_disagreement_score":0.0064160447,"about_ca_system_score_codex":0.00052572764,"about_ca_system_score_gemma":0.00046012536,"threshold_uncertainty_score":0.021463811},"labels":[],"label_agreement":null},{"id":"W2087362034","doi":"10.1016/s0022-4049(98)00145-5","title":"Tensor products of semilattices with zero, revisited","year":2000,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Zero (linguistics); Tensor (intrinsic definition); Tensor product; Pure mathematics; Tensor product of Hilbert spaces; Algebra over a field; Tensor contraction; Linguistics","score_opus":0.007308643815852981,"score_gpt":0.20547951336395145,"score_spread":0.19817086954809848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087362034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31259835,0.00582528,0.49642196,0.004461268,0.0014332498,0.00008747717,0.00044493857,0.00094725704,0.17778029],"genre_scores_gemma":[0.892678,0.0013750028,0.07118043,0.0005597255,0.0008520214,0.000084302264,0.00025125177,0.00034707182,0.032672003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960453,0.0012471557,0.00044940185,0.0006967233,0.0010761442,0.00048522232],"domain_scores_gemma":[0.9906555,0.0037843918,0.0008697156,0.0016544533,0.0018041622,0.0012317499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056558927,0.000802079,0.001274577,0.0022494562,0.0040371073,0.0072133145,0.0021560467,0.00139342,0.008372999],"category_scores_gemma":[0.0075129704,0.0012854132,0.0017369484,0.0020861954,0.007856814,0.016970666,0.0041013393,0.0033128385,0.0013267214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019677964,0.000007522806,0.0001030166,0.000019769719,0.0000040943905,0.00004480937,0.0002681912,0.0000644308,0.00022142462,0.99732363,0.00032973077,0.0015937557],"study_design_scores_gemma":[0.00000993207,0.00002187692,0.00011564714,0.000019533274,0.000011953816,0.00022836134,0.000267406,0.0012547993,0.00043639052,0.99349374,0.0041275,0.000012823655],"about_ca_topic_score_codex":0.0015324528,"about_ca_topic_score_gemma":0.00164594,"teacher_disagreement_score":0.008372999,"about_ca_system_score_codex":0.0018156612,"about_ca_system_score_gemma":0.001430989,"threshold_uncertainty_score":0.029911637},"labels":[],"label_agreement":null},{"id":"W2087402722","doi":"10.1007/978-3-642-31606-7_16","title":"Automatic Theorem-Proving in Combinatorics on Words","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Shuffling; Combinatorics on words; Computer science; Automaton; Function (biology); Combinatorics; Computation; Discrete mathematics; Extremal combinatorics; Algorithm; Mathematics; Theoretical computer science; Word (group theory); Programming language","score_opus":0.0130593615674536,"score_gpt":0.23081741752669982,"score_spread":0.21775805595924622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087402722","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024123695,0.009850468,0.80407536,0.0042028977,0.0013749206,0.00018686468,0.0004215269,0.0018315177,0.15393274],"genre_scores_gemma":[0.5521667,0.010201174,0.3647658,0.001131936,0.0028260981,0.00047121,0.0014508311,0.0013249118,0.0656613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99659014,0.0013659514,0.00028561073,0.00046561687,0.0010340649,0.00025867924],"domain_scores_gemma":[0.9921029,0.0063206544,0.00016861789,0.0008509386,0.00041831072,0.00013852601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025847207,0.0015162432,0.0015042265,0.003065315,0.0024522685,0.0062572914,0.0035399022,0.0015391096,0.011957582],"category_scores_gemma":[0.007961799,0.0017360267,0.0029544916,0.0039080926,0.0076993657,0.015950115,0.0042557125,0.005124249,0.0032475789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031262596,0.00002813925,0.00013745892,0.00033625273,0.000027597198,0.00007871395,0.00034898176,0.0018978587,0.0007410312,0.9601866,0.0046543106,0.031531673],"study_design_scores_gemma":[0.000008735426,0.0000064409273,0.00005453449,0.000041750845,0.000012069578,0.00004932159,0.000028128467,0.0026694993,0.0006477181,0.9860064,0.010465047,0.000010240329],"about_ca_topic_score_codex":0.000958395,"about_ca_topic_score_gemma":0.0009322198,"teacher_disagreement_score":0.011957582,"about_ca_system_score_codex":0.0027667538,"about_ca_system_score_gemma":0.0013515855,"threshold_uncertainty_score":0.040002108},"labels":[],"label_agreement":null},{"id":"W2087404611","doi":"10.1016/s0304-3975(98)00047-4","title":"Alternating finite automata and star-free languages","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Star (game theory); Automaton; Two-way deterministic finite automaton; Deterministic automaton; Regular language; Regular expression; Nondeterministic finite automaton; Mathematics; Class (philosophy); Finite-state machine; Construct (python library); Discrete mathematics; Representation (politics); Loop (graph theory); Deterministic finite automaton; Computer science; Combinatorics; Automata theory; Algorithm; Theoretical computer science; Programming language; Mathematical analysis; Artificial intelligence","score_opus":0.005757112725756986,"score_gpt":0.23699416293092448,"score_spread":0.2312370502051675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087404611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24490969,0.024673708,0.59460694,0.010257867,0.0016717522,0.000106868785,0.0010555119,0.0008354892,0.12188222],"genre_scores_gemma":[0.89496356,0.0068018413,0.05433737,0.001002878,0.0015931451,0.00021134899,0.000999113,0.00014818035,0.039942477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988945,0.0003703755,0.00008870381,0.00029627298,0.00023996187,0.0001102345],"domain_scores_gemma":[0.9960491,0.0028808536,0.00027462977,0.00028455438,0.00031854358,0.00019233211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011396327,0.00077829254,0.001032928,0.0013852608,0.0015188365,0.0033940726,0.0010724744,0.0018700359,0.0072878357],"category_scores_gemma":[0.0047153584,0.00058703223,0.0009342368,0.0025752883,0.004127493,0.00890347,0.0014867405,0.0026090925,0.0011833294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002747244,0.000012775799,0.00012098589,0.000041583906,0.0000046736545,0.00005252108,0.0002386104,0.0009972431,0.00037635202,0.9926456,0.0010928096,0.0043892805],"study_design_scores_gemma":[0.0000051987518,0.0000050284766,0.000040066036,0.00000469198,0.0000035552694,0.000038985287,0.000030263684,0.0018563585,0.000096662574,0.9953715,0.002543187,0.0000045270563],"about_ca_topic_score_codex":0.0010864012,"about_ca_topic_score_gemma":0.0010019434,"teacher_disagreement_score":0.0072878357,"about_ca_system_score_codex":0.0012307123,"about_ca_system_score_gemma":0.0010453555,"threshold_uncertainty_score":0.024380207},"labels":[],"label_agreement":null},{"id":"W2088999425","doi":"10.1016/j.tcs.2009.02.043","title":"State-complexity hierarchies of uniform languages of alphabet-size length","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; University of Waterloo","funders":"","keywords":"Alphabet; Regular language; Mathematics; Hierarchy; Combinatorics; Class (philosophy); State (computer science); Formal language; Discrete mathematics; Simple (philosophy); Complexity class; Chomsky hierarchy; Set (abstract data type); Finite-state machine; Automaton; Computer science; Time complexity; Theoretical computer science; Algorithm; Linguistics; Programming language; Artificial intelligence","score_opus":0.010043604494926939,"score_gpt":0.2575917261567074,"score_spread":0.24754812166178045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088999425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86704844,0.0010213715,0.10673762,0.0018092728,0.00003324317,0.000106828105,0.0018349225,0.001020484,0.020387722],"genre_scores_gemma":[0.97638285,0.00037064587,0.017666312,0.00016169126,0.000099523,0.00013222152,0.0010347482,0.00021276632,0.003939262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770206,0.00045635906,0.00015208551,0.00036683542,0.00072477246,0.00059788907],"domain_scores_gemma":[0.95482624,0.03551633,0.002707631,0.0025935366,0.0021570027,0.002199293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001731172,0.0006361697,0.0015819917,0.0033561096,0.0024795837,0.00692319,0.0020059624,0.0017274151,0.009402724],"category_scores_gemma":[0.017813805,0.0013412545,0.0013328558,0.0024151108,0.002411987,0.009066798,0.0021205018,0.002695675,0.0006476463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054474926,0.00019391188,0.006871119,0.00028937514,0.00006519139,0.00025181592,0.0022149922,0.036903836,0.0111503275,0.91851187,0.0032438906,0.019758938],"study_design_scores_gemma":[0.0000695414,0.00007004486,0.0049097463,0.000043006137,0.00005192411,0.00022424616,0.00035069202,0.19631955,0.0032619815,0.7928681,0.001756504,0.00007457857],"about_ca_topic_score_codex":0.0029081588,"about_ca_topic_score_gemma":0.004687868,"teacher_disagreement_score":0.009402724,"about_ca_system_score_codex":0.0037376338,"about_ca_system_score_gemma":0.0020088656,"threshold_uncertainty_score":0.03145522},"labels":[],"label_agreement":null},{"id":"W2089081951","doi":"10.1016/j.tcs.2011.08.007","title":"Palindromic complexity of codings of rotations","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Palindrome; Mathematics; Computer science; Artificial intelligence; Algorithm; Biology","score_opus":0.04530645399952978,"score_gpt":0.2533063429209016,"score_spread":0.2079998889213718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089081951","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7832548,0.0008995852,0.13850383,0.0037505925,0.00018740894,0.00011465741,0.0010973263,0.00034394846,0.0718479],"genre_scores_gemma":[0.9835504,0.00029261518,0.008673772,0.00023686534,0.00020879364,0.00009268458,0.00059833424,0.00008118613,0.0062652314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746597,0.00064723403,0.00017158633,0.0004400358,0.0007753953,0.0004998297],"domain_scores_gemma":[0.9847472,0.01075856,0.0013455917,0.0014527638,0.0009189918,0.0007770643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014340032,0.000568347,0.0011612428,0.0018292441,0.0016990426,0.0047390894,0.0019725778,0.002001615,0.012500443],"category_scores_gemma":[0.012976915,0.00062497606,0.0011633143,0.0021464578,0.003298634,0.008018409,0.0025329478,0.0033305509,0.0011391498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009437425,0.000033633012,0.00043990498,0.000041907046,0.0000070466895,0.00007506848,0.00029860364,0.0051207957,0.0006272338,0.9879451,0.00089520245,0.004421162],"study_design_scores_gemma":[0.000024170726,0.000018879698,0.00020938388,0.000009011171,0.0000063417287,0.000068611946,0.00006572013,0.010675945,0.00048767804,0.98776823,0.0006532604,0.000012741208],"about_ca_topic_score_codex":0.0012585891,"about_ca_topic_score_gemma":0.0010700867,"teacher_disagreement_score":0.012500443,"about_ca_system_score_codex":0.0019729421,"about_ca_system_score_gemma":0.0012927116,"threshold_uncertainty_score":0.041818142},"labels":[],"label_agreement":null},{"id":"W2089455626","doi":"10.1142/s0129054112400047","title":"STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-STAR AND CATENATION-REVERSAL","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; Combined operations; Continuation; State (computer science); Star (game theory); Computer science; Mathematics; Algorithm; Programming language; History","score_opus":0.03211804920181332,"score_gpt":0.3122282846005669,"score_spread":0.28011023539875357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089455626","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75569504,0.0003709313,0.2132387,0.0012748376,0.00009423871,0.00022731867,0.0010798388,0.0006280209,0.027391044],"genre_scores_gemma":[0.9689066,0.00018444884,0.025249936,0.00006334748,0.000043853834,0.00015409852,0.0006478578,0.00016847196,0.004581465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736565,0.0005085741,0.00021710961,0.0005327944,0.00077134365,0.00060450134],"domain_scores_gemma":[0.9807896,0.013778364,0.0011976765,0.002472268,0.001090254,0.0006717524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00134057,0.00055792317,0.00080574374,0.0010159338,0.0013585627,0.004679887,0.0015937536,0.0011783278,0.014451403],"category_scores_gemma":[0.011402853,0.00044657497,0.0018649634,0.0011729655,0.0021250611,0.010126673,0.0028988393,0.0029503272,0.00070809736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014630319,0.00041529353,0.0071452106,0.0005433115,0.00013593685,0.00046423878,0.0010844804,0.09672843,0.017612636,0.8164917,0.0034838251,0.05443184],"study_design_scores_gemma":[0.00008434532,0.00024832966,0.002128559,0.000040973828,0.00016852269,0.00034349164,0.00042969087,0.30886242,0.022502406,0.6613394,0.003743085,0.00010881265],"about_ca_topic_score_codex":0.0017468226,"about_ca_topic_score_gemma":0.0020485404,"teacher_disagreement_score":0.014451403,"about_ca_system_score_codex":0.0020577603,"about_ca_system_score_gemma":0.0021642025,"threshold_uncertainty_score":0.04834479},"labels":[],"label_agreement":null},{"id":"W2089487135","doi":"10.1090/s0002-9939-09-10126-0","title":"An automata theoretic approach to the generalized word problem in graphs of groups","year":2009,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Quasiconvex function; Mathematics; Chordal graph; Combinatorics; Word problem (mathematics education); Decidability; Vertex (graph theory); Discrete mathematics; Graph; Regular polygon; Arithmetic","score_opus":0.009655529450554501,"score_gpt":0.23989920257874073,"score_spread":0.23024367312818622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089487135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05249156,0.0007872816,0.9080533,0.0071359873,0.0008396352,0.00018595454,0.00057983614,0.0009418654,0.028984563],"genre_scores_gemma":[0.7253216,0.0014504631,0.24694005,0.0041249767,0.001844021,0.000734677,0.0013145648,0.00057130714,0.017698355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973463,0.00066504796,0.000242524,0.00083132234,0.0005534347,0.00036132385],"domain_scores_gemma":[0.9910903,0.0059398985,0.00036525298,0.0014447421,0.00081510504,0.00034467998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025386924,0.0010679227,0.0011483014,0.0018393472,0.0028232115,0.0040653646,0.0032392808,0.0025602293,0.007711934],"category_scores_gemma":[0.00783418,0.0007208405,0.0042254035,0.0017990934,0.008376642,0.015607886,0.006812127,0.007624746,0.00089411973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000152917,0.000017050375,0.00018835295,0.000059882794,0.000014727696,0.00011882285,0.00033327553,0.0024530247,0.0006387503,0.9907064,0.0011640704,0.0042904983],"study_design_scores_gemma":[0.000009654799,0.000009744043,0.000042118423,0.000009991189,0.000011171878,0.00004694896,0.00006227704,0.008134853,0.0004899202,0.9890119,0.0021604733,0.000010965882],"about_ca_topic_score_codex":0.003122345,"about_ca_topic_score_gemma":0.003051671,"teacher_disagreement_score":0.007711934,"about_ca_system_score_codex":0.0024967217,"about_ca_system_score_gemma":0.0019333572,"threshold_uncertainty_score":0.025799036},"labels":[],"label_agreement":null},{"id":"W2090113296","doi":"10.1016/j.aam.2014.11.001","title":"Factor complexity of S-adic words generated by the Arnoux–Rauzy–Poincaré algorithm","year":2014,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Agence Nationale de la Recherche","keywords":"Piecewise linear function; Upper and lower bounds; Fraction (chemistry); Convergence (economics); Factor (programming language); Piecewise; Euclidean algorithm","score_opus":0.016324273096377247,"score_gpt":0.2521384388042421,"score_spread":0.23581416570786484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090113296","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8274917,0.00095216266,0.14182022,0.0015466737,0.000110349836,0.00005866641,0.0006715193,0.0003787378,0.026969891],"genre_scores_gemma":[0.97969246,0.0002455673,0.012127746,0.00010967388,0.00011928967,0.000053627286,0.00049382227,0.00009411568,0.0070636733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894375,0.00024127233,0.0000640782,0.0002121144,0.0003412302,0.00019762131],"domain_scores_gemma":[0.99543107,0.0032654847,0.0002765811,0.0002695667,0.0005069554,0.00025040266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007321293,0.0005518813,0.0010976404,0.0014120357,0.0010003404,0.0033782593,0.0011118784,0.0011210932,0.009632542],"category_scores_gemma":[0.0071730637,0.0003252516,0.0007908051,0.001181547,0.00179143,0.0038963065,0.0010664689,0.0011577548,0.00088035956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005022503,0.000057431553,0.0021376256,0.00012282704,0.000037811045,0.00018911889,0.0004944353,0.031587586,0.0041681677,0.94331545,0.0027828321,0.0146044465],"study_design_scores_gemma":[0.00005644017,0.000047238864,0.00064435747,0.000016525819,0.00002043841,0.00011441267,0.00007631485,0.13209055,0.0022088499,0.8631145,0.0015815172,0.000028909497],"about_ca_topic_score_codex":0.00205499,"about_ca_topic_score_gemma":0.0014965985,"teacher_disagreement_score":0.009632542,"about_ca_system_score_codex":0.0017050008,"about_ca_system_score_gemma":0.0009556282,"threshold_uncertainty_score":0.032224},"labels":[],"label_agreement":null},{"id":"W2090562519","doi":"10.1016/j.tcs.2008.02.051","title":"Extension of Brzozowski’s derivation calculus of rational expressions to series over the free partially commutative monoids","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Noncommutative geometry; Extension (predicate logic); Mathematics; Power series; Commutative property; Formal power series; Series (stratigraphy); Expression (computer science); Pure mathematics; Finitely-generated abelian group; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.015476486358449839,"score_gpt":0.25462773357631596,"score_spread":0.23915124721786613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090562519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1501521,0.0032546811,0.6116763,0.003031673,0.0011013852,0.00014753919,0.0004598057,0.00072292966,0.22945356],"genre_scores_gemma":[0.8564018,0.0027119203,0.09965738,0.0006426162,0.00074928196,0.00009876205,0.00021649644,0.00028862318,0.03923318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993643,0.00015341166,0.000047687245,0.00013710928,0.00021127908,0.00008628978],"domain_scores_gemma":[0.9993237,0.00022638882,0.000039522107,0.00014262676,0.00020114901,0.000066500135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013661048,0.00045002226,0.00071821216,0.001444652,0.0012000815,0.002001578,0.00098512,0.00059504766,0.0040509566],"category_scores_gemma":[0.0018768741,0.00048986904,0.0011493487,0.0011848615,0.002855934,0.005582466,0.0020518787,0.0022598065,0.0008969637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011374601,0.000011606348,0.00005207183,0.000024005443,0.0000056169233,0.0000794021,0.00031870435,0.0005105651,0.00105176,0.9920827,0.000434141,0.005418103],"study_design_scores_gemma":[0.000015933188,0.0000127966,0.00017117464,0.000015110322,0.00001428073,0.00011663126,0.000053338084,0.0037322573,0.0010723821,0.9771608,0.01761879,0.000016577063],"about_ca_topic_score_codex":0.0012173012,"about_ca_topic_score_gemma":0.0009969705,"teacher_disagreement_score":0.0040509566,"about_ca_system_score_codex":0.0015684352,"about_ca_system_score_gemma":0.00088877615,"threshold_uncertainty_score":0.013551831},"labels":[],"label_agreement":null},{"id":"W2090639626","doi":"10.1080/00207160701779541","title":"On the definition of stochastic λ-transducers","year":2008,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transducer; Automaton; Probabilistic logic; Computer science; Probabilistic automaton; Stochastic process; Algorithm; Mathematics; Theoretical computer science; Artificial intelligence; Acoustics; Statistics","score_opus":0.032405734837814476,"score_gpt":0.24453514536068305,"score_spread":0.21212941052286857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090639626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004524,0.0008449797,0.9822923,0.00090054737,0.00036315637,0.000065269356,0.00017026471,0.00018616805,0.01065335],"genre_scores_gemma":[0.25382632,0.0031896061,0.719425,0.0029323355,0.0012649109,0.0012670654,0.00069034693,0.00045760226,0.016946694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99564385,0.0010743409,0.0005107659,0.0011061609,0.001327951,0.00033705455],"domain_scores_gemma":[0.9955942,0.0023154048,0.00036136154,0.00043807892,0.0010462587,0.0002447313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004096418,0.0009586009,0.0010887728,0.0015713307,0.0015985614,0.0031040998,0.0024453632,0.002404686,0.0051045865],"category_scores_gemma":[0.0060894093,0.0008022494,0.0018546714,0.0019837664,0.008043929,0.008012153,0.0033587054,0.005223435,0.0016131741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071470477,0.0000068983013,0.000058407626,0.000038287093,0.0000052366822,0.0000713819,0.00020683659,0.0015243184,0.00065386685,0.9936991,0.00042681166,0.0033016163],"study_design_scores_gemma":[0.000009368504,0.000038738755,0.000068506575,0.0000479369,0.000015771726,0.00023780725,0.00007036826,0.018017115,0.0010118183,0.9423332,0.038117178,0.00003206292],"about_ca_topic_score_codex":0.0010960537,"about_ca_topic_score_gemma":0.0007201161,"teacher_disagreement_score":0.0051045865,"about_ca_system_score_codex":0.0015020437,"about_ca_system_score_gemma":0.001621763,"threshold_uncertainty_score":0.021664202},"labels":[],"label_agreement":null},{"id":"W2090863119","doi":"10.1016/j.tcs.2007.07.032","title":"On the existence of regular approximations","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; McGill University","funders":"","keywords":"Closure (psychology); Measure (data warehouse); Degree (music); Mathematics; Context (archaeology); Automaton; Regular language; Approximations of π; Discrete mathematics; Approximation algorithm; Combinatorics; Applied mathematics; Computer science; Theoretical computer science","score_opus":0.011196178193247025,"score_gpt":0.24015798834140104,"score_spread":0.228961810148154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090863119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35666007,0.002396562,0.55033183,0.007531284,0.00043758366,0.00009334401,0.00031839887,0.0005705255,0.08166043],"genre_scores_gemma":[0.92494076,0.00096480065,0.05744432,0.00067831145,0.0002621996,0.00012278106,0.0003122602,0.00018659064,0.015087976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965861,0.0012182585,0.00021000365,0.00070764386,0.0008119377,0.0004660539],"domain_scores_gemma":[0.9517306,0.03994527,0.0013367254,0.0031752875,0.002521594,0.0012905495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045008683,0.00066066335,0.0019582766,0.001499183,0.002319046,0.0045325714,0.0020726703,0.002487618,0.00565404],"category_scores_gemma":[0.037967317,0.0011551572,0.0015971899,0.0012524805,0.007963159,0.011449152,0.006017039,0.0055313054,0.00064731005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000127741,0.000025585727,0.00032317507,0.00005710622,0.00001527916,0.000083497755,0.0006273234,0.0034342362,0.00072063186,0.98999584,0.0006417702,0.003947724],"study_design_scores_gemma":[0.000023985218,0.000024930194,0.00011045517,0.000024870802,0.0000144863425,0.00007242342,0.0002053472,0.020760037,0.0005084002,0.9769582,0.0012850269,0.000011845698],"about_ca_topic_score_codex":0.0012266483,"about_ca_topic_score_gemma":0.00091249374,"teacher_disagreement_score":0.00565404,"about_ca_system_score_codex":0.0025536509,"about_ca_system_score_gemma":0.001239842,"threshold_uncertainty_score":0.023803115},"labels":[],"label_agreement":null},{"id":"W2091155243","doi":"10.1142/s0129054112400679","title":"UNARY PATTERNS WITH INVOLUTION","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Unary operation; Involution (esoterism); Mathematics; Alphabet; Combinatorics; Existential quantification; Discrete mathematics; Biology; Linguistics","score_opus":0.014145822113634738,"score_gpt":0.2763654520099963,"score_spread":0.26221962989636155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091155243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21926655,0.0015472852,0.6992473,0.0006370681,0.0008190858,0.00021878553,0.0006144479,0.0021765912,0.07547288],"genre_scores_gemma":[0.81733817,0.00078295026,0.15604027,0.0003754903,0.0004446636,0.0003060693,0.0006095018,0.0005793244,0.02352346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798954,0.00025370382,0.00031580575,0.000525052,0.0005415668,0.0003742601],"domain_scores_gemma":[0.9969236,0.00086344854,0.00045135495,0.00091224996,0.00063382054,0.0002154844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009182649,0.0008213589,0.0007121979,0.0011376386,0.0012879095,0.0025944717,0.0009806878,0.0010298402,0.0041809194],"category_scores_gemma":[0.0036128913,0.0005068262,0.0008693827,0.0011199713,0.0026432164,0.004005259,0.0018937167,0.0015392973,0.001843326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017789987,0.000066530294,0.001282185,0.00019186169,0.000026122405,0.00086266163,0.0011643094,0.0015640095,0.016028512,0.9166179,0.0024659927,0.05955197],"study_design_scores_gemma":[0.000036984882,0.00014181594,0.0006422414,0.00007070132,0.00005409661,0.0016886091,0.00025116667,0.0105266115,0.019475928,0.9249534,0.042100165,0.00005829191],"about_ca_topic_score_codex":0.00036003703,"about_ca_topic_score_gemma":0.00042117023,"teacher_disagreement_score":0.0041809194,"about_ca_system_score_codex":0.0006032009,"about_ca_system_score_gemma":0.000648123,"threshold_uncertainty_score":0.013986528},"labels":[],"label_agreement":null},{"id":"W2091665273","doi":"10.1142/s0218196711006947","title":"ON ITERATED MAL'CEV PRODUCTS WITH A PSEUDOVARIETY OF GROUPS","year":2011,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Mathematics; Iterated function; Pure mathematics; Algebra over a field; Combinatorics; Mathematical analysis","score_opus":0.014421554238940155,"score_gpt":0.22727958137694076,"score_spread":0.21285802713800062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091665273","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7611036,0.00093194057,0.19352257,0.0009718697,0.00016873711,0.0000866686,0.00019513628,0.00021737968,0.042802192],"genre_scores_gemma":[0.97697395,0.00023031396,0.013595881,0.00009555953,0.00020514888,0.00008133733,0.00013546446,0.000048885388,0.008633454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875295,0.0003233793,0.00009541505,0.00020889794,0.00036426607,0.00025510273],"domain_scores_gemma":[0.997414,0.0010411176,0.0005347859,0.00022280657,0.00034926194,0.00043798028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016872148,0.00065928843,0.00064487313,0.001644091,0.0016376575,0.0029605338,0.00072855706,0.00086157065,0.003922786],"category_scores_gemma":[0.00277158,0.00034525633,0.001169904,0.000850494,0.0041400245,0.005069165,0.0022886677,0.0012886635,0.0005083181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004665054,0.000024581606,0.00057627045,0.000029850024,0.0000089641835,0.00024300563,0.0008881007,0.00096777326,0.0022136713,0.9920155,0.0002061725,0.002779378],"study_design_scores_gemma":[0.000030136187,0.00013428938,0.0007234444,0.000025965988,0.00001488771,0.00047869777,0.0005627481,0.01064163,0.003022869,0.97991276,0.0044254283,0.000027008906],"about_ca_topic_score_codex":0.0006377818,"about_ca_topic_score_gemma":0.00039266548,"teacher_disagreement_score":0.003922786,"about_ca_system_score_codex":0.0011832116,"about_ca_system_score_gemma":0.0005322265,"threshold_uncertainty_score":0.013123035},"labels":[],"label_agreement":null},{"id":"W2091741450","doi":"10.1016/j.jcss.2008.02.007","title":"Lower bounds for the transition complexity of NFAs","year":2008,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Manitoba","funders":"","keywords":"Nondeterministic algorithm; Constant (computer programming); State (computer science); Combinatorics; Mathematics; Discrete mathematics; Computer science; Algorithm","score_opus":0.052486422567526995,"score_gpt":0.2577307109255387,"score_spread":0.20524428835801167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091741450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28409514,0.0056185494,0.62142915,0.010557989,0.0006456256,0.00032654405,0.0033195296,0.0030145757,0.07099292],"genre_scores_gemma":[0.9062748,0.0022781524,0.07193753,0.00092008564,0.0011912511,0.00060564117,0.002423824,0.0009856807,0.013383152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922426,0.0015529692,0.0004150038,0.0015062899,0.0025760666,0.0017070415],"domain_scores_gemma":[0.8658396,0.11762593,0.0027298813,0.0073306034,0.0032449046,0.0032291266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005051342,0.0018987465,0.00259837,0.0049480163,0.0026614303,0.008570453,0.005048623,0.0035998689,0.01760105],"category_scores_gemma":[0.048217192,0.0014371722,0.003820716,0.0033922037,0.0042719524,0.016525595,0.005096251,0.011548185,0.0017557591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011981695,0.000505853,0.0051387246,0.0009130175,0.00024771297,0.00033330213,0.0011934072,0.15725276,0.010526416,0.7427444,0.012521726,0.0674245],"study_design_scores_gemma":[0.000046027493,0.00007524455,0.0011118393,0.00008160345,0.000090353155,0.00017805195,0.00010238646,0.27060854,0.0025492047,0.7227895,0.0023050867,0.00006217383],"about_ca_topic_score_codex":0.0021917454,"about_ca_topic_score_gemma":0.003450779,"teacher_disagreement_score":0.01760105,"about_ca_system_score_codex":0.005858022,"about_ca_system_score_gemma":0.0023989517,"threshold_uncertainty_score":0.058881342},"labels":[],"label_agreement":null},{"id":"W2091767797","doi":"10.1080/00927872.2010.509748","title":"Representation Extension and Amalgamation in Pomonoids","year":2011,"lang":"en","type":"article","venue":"Communications in Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monoid; Flatness (cosmology); Semigroup; Pure mathematics; Extension (predicate logic); Bicyclic semigroup; Algebra over a field; Computer science","score_opus":0.08203625130470472,"score_gpt":0.30504607997179606,"score_spread":0.22300982866709135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091767797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33159918,0.0021248655,0.59890115,0.00090935547,0.0003943936,0.00011690316,0.000323579,0.0004889109,0.06514167],"genre_scores_gemma":[0.9515436,0.00048404906,0.035728272,0.00018582672,0.00022094592,0.000068710724,0.00021872489,0.00006851619,0.011481336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984652,0.00041863756,0.00014413426,0.00037378416,0.00034088234,0.00025744794],"domain_scores_gemma":[0.998287,0.00073991367,0.00020101739,0.00030420214,0.0003118443,0.00015606238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016832832,0.00044048284,0.00046373342,0.0011707073,0.0011452772,0.0018873258,0.0005839324,0.0005651706,0.005550007],"category_scores_gemma":[0.002895451,0.00032190635,0.0014654889,0.00077711313,0.0038775748,0.0041079023,0.002310871,0.0014141572,0.0006802379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035119345,0.000011259135,0.00029965793,0.00004736432,0.000006910359,0.00020002243,0.00085772946,0.0005877986,0.0028045082,0.98527074,0.00023250413,0.009646403],"study_design_scores_gemma":[0.000023092045,0.0001346131,0.00085735077,0.000043631808,0.000020369893,0.00044759954,0.00040729262,0.00597293,0.004387729,0.9761815,0.011486579,0.000037400463],"about_ca_topic_score_codex":0.0010537319,"about_ca_topic_score_gemma":0.00048471044,"teacher_disagreement_score":0.005550007,"about_ca_system_score_codex":0.0009591641,"about_ca_system_score_gemma":0.0003976958,"threshold_uncertainty_score":0.018566608},"labels":[],"label_agreement":null},{"id":"W2092385955","doi":"10.1007/s10485-008-9147-2","title":"The Universal Covering of an Inverse Semigroup","year":2008,"lang":"en","type":"article","venue":"Applied Categorical Structures","topic":"semigroups and automata theory","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Instituto Superior Técnico; Tobacco Settlement Endowment Trust","keywords":"Mathematics; Inverse semigroup; Morphism; Inverse; Decidability; Covering space; Semigroup; Unitary state; Pure mathematics; Inverse element; Group (periodic table); Topos theory; Discrete mathematics; Special classes of semigroups; Geometry","score_opus":0.010015702500567386,"score_gpt":0.20216501215902485,"score_spread":0.19214930965845747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092385955","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59872854,0.0011491661,0.28180686,0.0011057716,0.0004947664,0.000039052404,0.0001722644,0.00067285105,0.11583073],"genre_scores_gemma":[0.9702229,0.00023367866,0.014845653,0.00013168112,0.00017584975,0.000027479315,0.0001092256,0.000108518536,0.014145032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914,0.00018731228,0.00004683285,0.0002499235,0.00020077093,0.00017508029],"domain_scores_gemma":[0.9984213,0.00074913475,0.000095888376,0.00027743998,0.0001831117,0.00027309102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008018169,0.00039852428,0.00062404573,0.0010947213,0.0016870204,0.0027061624,0.00046785534,0.00090336497,0.0039302125],"category_scores_gemma":[0.002078707,0.00044365303,0.00090174703,0.0006024325,0.0030295367,0.0037541757,0.002327201,0.0015405092,0.0005194581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004349654,0.000013932991,0.00024297168,0.000022510836,0.0000055566825,0.00017664518,0.00068556226,0.00043033296,0.0026265746,0.9901502,0.00041797818,0.00518414],"study_design_scores_gemma":[0.000011902516,0.000039707003,0.0005032135,0.000016381562,0.000019043364,0.0006240694,0.0002616936,0.0057773953,0.0035089548,0.98008955,0.00912746,0.000020679203],"about_ca_topic_score_codex":0.00058277335,"about_ca_topic_score_gemma":0.00029908548,"teacher_disagreement_score":0.0039302125,"about_ca_system_score_codex":0.00068344444,"about_ca_system_score_gemma":0.00047247842,"threshold_uncertainty_score":0.013147891},"labels":[],"label_agreement":null},{"id":"W2092435018","doi":"10.1112/blms/bdm030","title":"The complexity of the equivalence problem for nonsolvable groups","year":2007,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Equivalence (formal languages); Cardinality (data modeling); Combinatorics; Discrete mathematics; Nilpotent group; Nilpotent","score_opus":0.02737374476136478,"score_gpt":0.25231730437640193,"score_spread":0.22494355961503715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092435018","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.710537,0.001394114,0.22547069,0.017316591,0.00030673508,0.00046894184,0.0041053244,0.0012449878,0.039155617],"genre_scores_gemma":[0.940014,0.00081253104,0.044622563,0.00076468475,0.0004886187,0.00033373074,0.0044948272,0.00030564572,0.008163396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995654,0.0011569636,0.00031029776,0.0011711476,0.0009402746,0.0007673186],"domain_scores_gemma":[0.96124333,0.03264266,0.0016895435,0.0022970026,0.0011295395,0.0009980378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024647133,0.0007895341,0.0015001113,0.0010410611,0.0023268887,0.0062745567,0.003065433,0.0026782101,0.010062823],"category_scores_gemma":[0.018836172,0.0007297915,0.0020337773,0.001734085,0.0042397184,0.015135389,0.0034719591,0.0058356435,0.0009732465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023792235,0.0013270678,0.008945752,0.0014223653,0.00032889756,0.0008834709,0.0034971922,0.14748256,0.01021205,0.7040767,0.02613165,0.09331311],"study_design_scores_gemma":[0.00014174066,0.000044326032,0.0008785511,0.000027143185,0.000042468862,0.00016801567,0.00027414432,0.09657731,0.0025345925,0.8962154,0.0030636338,0.000032698867],"about_ca_topic_score_codex":0.0044115935,"about_ca_topic_score_gemma":0.0029934263,"teacher_disagreement_score":0.010062823,"about_ca_system_score_codex":0.004361655,"about_ca_system_score_gemma":0.0030915167,"threshold_uncertainty_score":0.03366345},"labels":[],"label_agreement":null},{"id":"W2094091116","doi":"10.4153/cmb-2010-028-7","title":"Pisot Numbers from {0, 1}-Polynomials","year":2009,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Polynomial; Algebraic number; Limit point; Unit (ring theory); Unit disk; Real number; Limit (mathematics); Sequence (biology); Discrete mathematics; Mathematical analysis","score_opus":0.006932058332731388,"score_gpt":0.1987675174161305,"score_spread":0.1918354590833991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094091116","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6949619,0.0006317855,0.21940407,0.0009981823,0.0003087491,0.000164389,0.0005389532,0.0005876841,0.08240424],"genre_scores_gemma":[0.9200955,0.00032248325,0.06349046,0.00018431192,0.00018241792,0.00015057655,0.0005562703,0.000112981266,0.01490504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993304,0.00012451866,0.000050366445,0.00013249154,0.00027443175,0.00008769742],"domain_scores_gemma":[0.99822956,0.0009157621,0.00021425137,0.00019727486,0.00024903347,0.00019415768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005598966,0.00031854026,0.00041600442,0.0010983454,0.0012887359,0.00149965,0.000540096,0.00046805406,0.0061764335],"category_scores_gemma":[0.00437648,0.00021949477,0.00053940405,0.00062954106,0.0020289614,0.0022605506,0.001581537,0.0013181927,0.0011479143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001377198,0.000026815838,0.0006935651,0.00007645812,0.0000053443073,0.00023573791,0.00065596827,0.0027255018,0.0073652966,0.9684018,0.0012815609,0.018394295],"study_design_scores_gemma":[0.00003730065,0.00007174033,0.00064355624,0.00004400509,0.000010503727,0.000491854,0.00018543135,0.017573357,0.0072462317,0.9578071,0.015858999,0.000029865743],"about_ca_topic_score_codex":0.00037863356,"about_ca_topic_score_gemma":0.00058956834,"teacher_disagreement_score":0.0061764335,"about_ca_system_score_codex":0.0008515526,"about_ca_system_score_gemma":0.00060379313,"threshold_uncertainty_score":0.020662248},"labels":[],"label_agreement":null},{"id":"W2094709030","doi":"10.1142/s0218196701000711","title":"ON THE ROOT OF LANGUAGES","year":2001,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Università degli Studi di Milano; McMaster University","keywords":"Root (linguistics); Mathematics; Undecidable problem; Decidability; Context (archaeology); Regular language; Context-free language; Discrete mathematics; Linguistics; Automaton; Computer science; Natural language processing; Rule-based machine translation; Theoretical computer science","score_opus":0.009275104858219805,"score_gpt":0.2694619149082258,"score_spread":0.260186810050006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094709030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14557452,0.006243175,0.76410526,0.008478741,0.0005338937,0.00026147912,0.0005126172,0.0019454722,0.07234483],"genre_scores_gemma":[0.74891984,0.0040287087,0.20444348,0.0015952897,0.0009362738,0.00026941305,0.0010488525,0.0011255377,0.037632503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996203,0.0010488392,0.00029079668,0.0012011429,0.0008467029,0.00040948525],"domain_scores_gemma":[0.98822916,0.008861448,0.00053174415,0.0012159151,0.00085991446,0.00030185923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027886848,0.00072700664,0.0014444621,0.0012608238,0.0026168372,0.0042118644,0.0015097248,0.0023946967,0.010210567],"category_scores_gemma":[0.015553435,0.0008749061,0.0018206829,0.0011150807,0.0073448075,0.019033682,0.005614686,0.0053852675,0.0023835702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005315591,0.000016771051,0.00025061026,0.00020450096,0.000010515805,0.00019605261,0.0011827005,0.0025654156,0.0019414199,0.9803423,0.0013556851,0.011880731],"study_design_scores_gemma":[0.000019973402,0.000028207067,0.000059194143,0.000049983464,0.000011660076,0.00016366143,0.00032618127,0.006509841,0.0016390439,0.9780738,0.01310432,0.000014191075],"about_ca_topic_score_codex":0.001251032,"about_ca_topic_score_gemma":0.0008516886,"teacher_disagreement_score":0.010210567,"about_ca_system_score_codex":0.0017802608,"about_ca_system_score_gemma":0.0011835418,"threshold_uncertainty_score":0.034157753},"labels":[],"label_agreement":null},{"id":"W2096032355","doi":"10.1007/s11083-010-9142-8","title":"Small Semigroups Generating Varieties with Continuum Many Subvarieties","year":2010,"lang":"en","type":"article","venue":"Order","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Mount Saint Vincent University","funders":"","keywords":"Mathematics; Isomorphism (crystallography); Semigroup; Variety (cybernetics); Monoid; Pure mathematics; Order (exchange); Algebra over a field","score_opus":0.008059683917308876,"score_gpt":0.1874648852515281,"score_spread":0.17940520133421922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096032355","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.618788,0.001263483,0.3252162,0.0011934993,0.0002528525,0.000087533626,0.00028443686,0.001000815,0.05191314],"genre_scores_gemma":[0.96506417,0.00023709652,0.022104902,0.00010853466,0.00017255245,0.00006816362,0.00013529853,0.000103913226,0.0120054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924797,0.00020592414,0.000045673565,0.00020059719,0.000207721,0.00009216552],"domain_scores_gemma":[0.9965796,0.002068324,0.00022604206,0.00034432503,0.00021503156,0.0005666597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009964876,0.00061439147,0.0009540701,0.002221824,0.0018982379,0.0036469274,0.00088433415,0.0006438264,0.0060364082],"category_scores_gemma":[0.0023997803,0.00061142305,0.00085072906,0.0014144313,0.0038796733,0.004627192,0.0027539623,0.0018932635,0.00064184266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006405097,0.000034572844,0.00047665616,0.000026810645,0.000008024445,0.00015091212,0.00057336723,0.0007000635,0.0029266672,0.9902734,0.0005026694,0.004262879],"study_design_scores_gemma":[0.000047475845,0.00004606426,0.00055986707,0.000010155082,0.000021791153,0.00044504408,0.00028701368,0.008021309,0.0026694664,0.983384,0.004485988,0.000021802294],"about_ca_topic_score_codex":0.00028203567,"about_ca_topic_score_gemma":0.00043135305,"teacher_disagreement_score":0.0060364082,"about_ca_system_score_codex":0.00089128216,"about_ca_system_score_gemma":0.00037278034,"threshold_uncertainty_score":0.020193756},"labels":[],"label_agreement":null},{"id":"W2096361394","doi":"10.1142/s0129054114400267","title":"ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Queen's University","funders":"Russian Foundation for Basic Research","keywords":"Bijection, injection and surjection; Abelian group; Connection (principal bundle); Combinatorics on words; Mathematics; Alphabet; Combinatorics; Lattice (music); Word (group theory); Discrete mathematics; Bijection; Geometry; Linguistics","score_opus":0.017819204113933944,"score_gpt":0.28490041943164074,"score_spread":0.2670812153177068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096361394","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77875364,0.0014461686,0.1854628,0.0014284952,0.0001893836,0.00010681281,0.00057076,0.00046239854,0.031579535],"genre_scores_gemma":[0.9269978,0.00040058806,0.067570366,0.00016744412,0.00014606211,0.00014273956,0.00031893622,0.0001233716,0.0041327314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756384,0.0005887464,0.00024808943,0.0006954277,0.0005943375,0.00030960087],"domain_scores_gemma":[0.98439366,0.0107885925,0.0019248166,0.0010562678,0.0011649845,0.00067153206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024676425,0.0005096948,0.0008432046,0.0025517985,0.0026832626,0.003302904,0.0018235085,0.0015439241,0.0076636947],"category_scores_gemma":[0.0119381,0.00042880277,0.00094659755,0.0019178815,0.00499321,0.006987588,0.0020740752,0.001295784,0.0007838659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023093361,0.000063903106,0.003272138,0.0002264121,0.000027947644,0.00040799796,0.00083833106,0.0030255911,0.0052776053,0.96831256,0.0007864067,0.017530078],"study_design_scores_gemma":[0.000030923464,0.000085443586,0.0012208377,0.00006206687,0.000036862024,0.0005017375,0.0002595063,0.013484122,0.00728573,0.97179675,0.0051885527,0.000047449197],"about_ca_topic_score_codex":0.0003577174,"about_ca_topic_score_gemma":0.0002788882,"teacher_disagreement_score":0.0076636947,"about_ca_system_score_codex":0.0014396878,"about_ca_system_score_gemma":0.0008011536,"threshold_uncertainty_score":0.025637627},"labels":[],"label_agreement":null},{"id":"W2096648167","doi":"10.1016/j.jcss.2004.07.004","title":"First-order expressibility of languages with neutral letters or: The Crane Beach conjecture","year":2004,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"Conjecture; First-order logic; Predicate (mathematical logic); Iterated function; Mathematics; Alphabet; Order (exchange); Logarithm; Discrete mathematics; Combinatorics; Computer science; Linguistics; Programming language; Philosophy","score_opus":0.009808816728811886,"score_gpt":0.23353575833276194,"score_spread":0.22372694160395004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096648167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63769925,0.0016300952,0.18434761,0.011047136,0.00034266792,0.00009801379,0.0011459667,0.0016655409,0.1620238],"genre_scores_gemma":[0.96321803,0.0005255469,0.014248829,0.0009344686,0.0002134886,0.00006237213,0.0006235012,0.00020188074,0.019971885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771726,0.0004081735,0.00017145794,0.0007268684,0.00044293763,0.0005333221],"domain_scores_gemma":[0.9913163,0.005256878,0.0004985898,0.0017511826,0.000811963,0.0003650173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018733221,0.00065235875,0.0010921484,0.0008335356,0.0017938424,0.007637521,0.0017533186,0.0017780623,0.007926106],"category_scores_gemma":[0.007615561,0.0009433635,0.0014784442,0.000975865,0.0044946508,0.014325001,0.002512215,0.0053002504,0.0013086331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019744522,0.000042932785,0.000396612,0.00007828635,0.000017600936,0.00013655152,0.0008581694,0.0013490957,0.0020162964,0.98675144,0.0017009549,0.0064545297],"study_design_scores_gemma":[0.000030655574,0.0000132620125,0.000095734686,0.000016742435,0.000015851343,0.000092803224,0.00019282015,0.0036448357,0.0016031214,0.99196374,0.0023100637,0.000020290423],"about_ca_topic_score_codex":0.00272138,"about_ca_topic_score_gemma":0.0022479927,"teacher_disagreement_score":0.007926106,"about_ca_system_score_codex":0.0017898243,"about_ca_system_score_gemma":0.0016445881,"threshold_uncertainty_score":0.026515484},"labels":[],"label_agreement":null},{"id":"W2097354710","doi":"10.1142/s0218196704001967","title":"THE GLOBALS OF SOME SUBPSEUDOVARIETIES OF $\\mathsf{DA}$","year":2004,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; Universidade do Porto; McGill University","keywords":"Mathematics; Semidirect product; Combinatorics; Pure mathematics; Group (periodic table); Physics","score_opus":0.0087214518467257,"score_gpt":0.25861110264183396,"score_spread":0.24988965079510825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097354710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.731273,0.00088648347,0.1927594,0.0005795375,0.0001377513,0.00011152132,0.0008021533,0.0007439851,0.0727062],"genre_scores_gemma":[0.93282884,0.00034343384,0.028295735,0.00012194001,0.00019060615,0.00022200163,0.0006734588,0.00034274248,0.03698131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992131,0.00011802733,0.000049036833,0.0002578581,0.00020615352,0.00015575776],"domain_scores_gemma":[0.9986985,0.0004036066,0.00018730183,0.00017673698,0.00026420114,0.00026970822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008587685,0.0004951452,0.000462537,0.0017772203,0.0013718056,0.0031604609,0.0005682492,0.00043180602,0.009272357],"category_scores_gemma":[0.0018931682,0.00047412966,0.00065824686,0.0007397484,0.0032590881,0.005262357,0.00243381,0.0014937659,0.0010776637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016460143,0.000039431812,0.0011718539,0.00007395537,0.00002210526,0.0002633825,0.0013366492,0.0007906985,0.0069549163,0.9734352,0.0007368922,0.015010361],"study_design_scores_gemma":[0.000049664803,0.00013629891,0.0023056632,0.00003075047,0.000046425852,0.0004992604,0.0011980078,0.005789363,0.015318933,0.9547377,0.01984217,0.000045732682],"about_ca_topic_score_codex":0.00038315388,"about_ca_topic_score_gemma":0.00048915023,"teacher_disagreement_score":0.009272357,"about_ca_system_score_codex":0.0010568112,"about_ca_system_score_gemma":0.00051403046,"threshold_uncertainty_score":0.031019151},"labels":[],"label_agreement":null},{"id":"W2097650550","doi":"10.1080/17459730902916545","title":"Interlocking and Euclidean rhythms","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematics and Music","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for Interdisciplinary Research in Music Media and Technology; McGill University","funders":"Queensland University of Technology","keywords":"Interlocking; Alternation (linguistics); Euclidean geometry; Mathematics; Rhythm; Euclidean distance; Combinatorics; Computer science; Geometry; Engineering","score_opus":0.01542097981143119,"score_gpt":0.22870632866087492,"score_spread":0.21328534884944372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097650550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23886235,0.0031972378,0.6246876,0.0007869879,0.0009389697,0.00009289354,0.0002509549,0.0004562936,0.13072665],"genre_scores_gemma":[0.86466974,0.0012103461,0.11093751,0.00030777056,0.00035782353,0.00014759897,0.00023803995,0.00017429034,0.021956973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900585,0.0002541662,0.00008677476,0.0002980788,0.00020067142,0.00015441517],"domain_scores_gemma":[0.99888617,0.0003729435,0.00018830966,0.00021178686,0.00019837143,0.00014246536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066992803,0.00043983373,0.00030975824,0.00084022933,0.0009132522,0.0019737019,0.00055875705,0.00054629234,0.005496164],"category_scores_gemma":[0.002357521,0.00015228112,0.0005388118,0.0007134648,0.0034164477,0.0036003087,0.0018375419,0.0011958901,0.0009895962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034959994,0.0000071074323,0.00011444263,0.000030760802,0.0000027805725,0.000066296874,0.00029815861,0.0005915827,0.0035758463,0.9837857,0.00031276417,0.011179531],"study_design_scores_gemma":[0.000018792578,0.0001260793,0.0004665731,0.00004062911,0.000011227032,0.00045979954,0.0005354125,0.0071943062,0.0058387704,0.9518683,0.03340422,0.000035880654],"about_ca_topic_score_codex":0.00035926077,"about_ca_topic_score_gemma":0.00037443367,"teacher_disagreement_score":0.005496164,"about_ca_system_score_codex":0.00049805635,"about_ca_system_score_gemma":0.00040330464,"threshold_uncertainty_score":0.018386543},"labels":[],"label_agreement":null},{"id":"W2097880459","doi":"10.1142/s0129054112400035","title":"STATE-SIZE HIERARCHY FOR FINITE-STATE COMPLEXITY","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Hierarchy; Finite-state machine; State (computer science); Turing machine; Encoding (memory); Mathematics; Time hierarchy theorem; Computable function; Deterministic finite automaton; Computational complexity theory; Finite state; Theoretical computer science; Discrete mathematics; Computer science; Algorithm; Universal Turing machine; Computation; Artificial intelligence","score_opus":0.03892250258857448,"score_gpt":0.3235433376829667,"score_spread":0.28462083509439223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097880459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23803918,0.0033015173,0.67784756,0.005263126,0.0002080777,0.00012658956,0.0010762943,0.0010767815,0.07306079],"genre_scores_gemma":[0.9272112,0.0009868463,0.06598047,0.00033082883,0.00040071277,0.00021200808,0.0004695461,0.00012806852,0.0042803884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976279,0.00044440586,0.00019526233,0.00042289373,0.0010039675,0.00030560757],"domain_scores_gemma":[0.9837605,0.0121138,0.0005525617,0.0018886332,0.0009838827,0.0007006291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019181719,0.00043551868,0.0008121251,0.001672986,0.0013630722,0.0032243885,0.0012244694,0.0014558024,0.003944384],"category_scores_gemma":[0.010401824,0.00040874234,0.0011512432,0.00148097,0.004357621,0.009095925,0.0023237152,0.00419923,0.00047867015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000146810535,0.000012324664,0.00019651276,0.000042271895,0.000003919002,0.000028014112,0.00012664364,0.0023431503,0.0010415147,0.9926091,0.00036254598,0.0032193346],"study_design_scores_gemma":[0.0000063574153,0.000013076231,0.00025875916,0.000014318024,0.000005750889,0.00003909739,0.000023863817,0.019467903,0.00060681603,0.9782525,0.0012978439,0.000013821938],"about_ca_topic_score_codex":0.00089070265,"about_ca_topic_score_gemma":0.0007807498,"teacher_disagreement_score":0.003944384,"about_ca_system_score_codex":0.0026365821,"about_ca_system_score_gemma":0.0008541022,"threshold_uncertainty_score":0.019129813},"labels":[],"label_agreement":null},{"id":"W2097927392","doi":"10.1142/s0218196710005674","title":"A STRUCTURAL APPROACH TO THE LOCALITY OF PSEUDOVARIETIES OF THE FORM LH ⓜ V","year":2010,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monoid; Locality; Extension (predicate logic); Pure mathematics; Combinatorics; Algebra over a field; Linguistics","score_opus":0.009443461778471886,"score_gpt":0.24565702684049587,"score_spread":0.23621356506202398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097927392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18337327,0.00090806227,0.7484778,0.0026926226,0.00019650337,0.00010978494,0.00021516444,0.00057527475,0.06345152],"genre_scores_gemma":[0.9110963,0.00034794895,0.07438187,0.00037961034,0.0002891026,0.00013588063,0.00014404001,0.00011692124,0.013108422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989655,0.00031207383,0.00006509479,0.00025801998,0.00021830274,0.00018098035],"domain_scores_gemma":[0.99796677,0.00079328445,0.00022611892,0.0005104214,0.00025826303,0.0002451466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013146701,0.00032365767,0.000504203,0.0014824106,0.0023245509,0.002804352,0.0015673424,0.0010153871,0.008905801],"category_scores_gemma":[0.0033205491,0.0005414253,0.0010598692,0.00120678,0.006947235,0.010342575,0.005049576,0.0024524224,0.0009763904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010213727,0.0000098008495,0.00020132576,0.000016959433,0.0000025746397,0.00007209687,0.00049963937,0.00029330773,0.0009675315,0.9953318,0.0001847631,0.0024097909],"study_design_scores_gemma":[0.0000152160355,0.000060217906,0.00028555398,0.0000181628,0.0000141000455,0.00037601576,0.0005869632,0.0050168075,0.0021502185,0.9830751,0.008382591,0.000019081128],"about_ca_topic_score_codex":0.00086142664,"about_ca_topic_score_gemma":0.000706344,"teacher_disagreement_score":0.008905801,"about_ca_system_score_codex":0.0012747506,"about_ca_system_score_gemma":0.0006390343,"threshold_uncertainty_score":0.029792845},"labels":[],"label_agreement":null},{"id":"W2098375093","doi":"10.1007/978-3-642-27654-5_30","title":"State Complexity of Kleene-Star Operations on Trees","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Star (game theory); Iterated function; String (physics); Computer science; State (computer science); Tree (set theory); Algorithm; Regular language; Discrete mathematics; Extension (predicate logic); Combinatorics; Mathematics; Theoretical computer science; Automaton","score_opus":0.03429629418638434,"score_gpt":0.25736712697763525,"score_spread":0.2230708327912509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098375093","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82321763,0.0010148714,0.12365782,0.0017017646,0.00007610097,0.000070791924,0.001252844,0.00034393626,0.048664305],"genre_scores_gemma":[0.98136044,0.00048332626,0.009587483,0.000054770837,0.0000950875,0.00007085399,0.0007416178,0.00010972124,0.0074967025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984285,0.00027009493,0.00010589767,0.00024203675,0.00063939276,0.0003140189],"domain_scores_gemma":[0.9904944,0.00722934,0.00050034764,0.00074781786,0.0006472331,0.00038080578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009419211,0.00042670403,0.0010806961,0.0011596676,0.0012819995,0.0054818294,0.0014652635,0.0012706788,0.009012155],"category_scores_gemma":[0.0070984787,0.0006142468,0.0012173171,0.0021572588,0.0020351084,0.010556037,0.0016615767,0.0028337422,0.0006158342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026716894,0.0001168587,0.0013155572,0.0001330984,0.00003079884,0.00009220037,0.00064822915,0.02863388,0.003614565,0.9468491,0.0019525306,0.01634601],"study_design_scores_gemma":[0.00002255728,0.000026687909,0.0006683406,0.000011172032,0.000018816243,0.000049004397,0.00010562523,0.065684155,0.0016291402,0.93094295,0.0008213966,0.000020157968],"about_ca_topic_score_codex":0.0022147063,"about_ca_topic_score_gemma":0.002588867,"teacher_disagreement_score":0.009012155,"about_ca_system_score_codex":0.0022706913,"about_ca_system_score_gemma":0.0013507149,"threshold_uncertainty_score":0.030148685},"labels":[],"label_agreement":null},{"id":"W2098447376","doi":"10.5802/jtnb.457","title":"On the binary expansions of algebraic numbers","year":2009,"lang":"lv","type":"article","venue":"Journal de Théorie des Nombres de Bordeaux","topic":"semigroups and automata theory","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Mathematics; Algebraic number; Binary number; Degree (music); Series (stratigraphy); Number theory; Discrete mathematics; Combinatorics; Arithmetic; Mathematical analysis","score_opus":0.013772224113300193,"score_gpt":0.25912966391925685,"score_spread":0.24535743980595665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098447376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32834515,0.0043032775,0.52120197,0.0046577123,0.0004020703,0.00007623898,0.0007464601,0.00061922683,0.13964793],"genre_scores_gemma":[0.94804734,0.0025345508,0.030104106,0.0006146712,0.00055552373,0.00015506768,0.00042289472,0.00018281443,0.017383074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968136,0.0009846061,0.0001083776,0.00051573804,0.0011277593,0.0004498699],"domain_scores_gemma":[0.9816166,0.014082432,0.0011851789,0.00086168275,0.001449928,0.00080414466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033868544,0.00081599475,0.0012354779,0.0039481455,0.0019258684,0.004337608,0.0014633866,0.00095353584,0.009248371],"category_scores_gemma":[0.029086126,0.00076944986,0.00085892394,0.0024293212,0.005497454,0.0080968505,0.004201326,0.0036161456,0.0013769161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039127648,0.000010072096,0.00041139484,0.000056437224,0.0000060150805,0.00004679261,0.00016844801,0.0024599573,0.0004238051,0.9890884,0.0008894187,0.0064002424],"study_design_scores_gemma":[0.000010558949,0.000028991772,0.00079025887,0.00007789554,0.00001366883,0.00021592712,0.0001102547,0.026295422,0.00075220026,0.9682386,0.003440113,0.000026146212],"about_ca_topic_score_codex":0.0015867038,"about_ca_topic_score_gemma":0.0009208004,"teacher_disagreement_score":0.009248371,"about_ca_system_score_codex":0.0020837619,"about_ca_system_score_gemma":0.0008541934,"threshold_uncertainty_score":0.030938923},"labels":[],"label_agreement":null},{"id":"W2098464356","doi":"10.1016/j.aam.2008.03.005","title":"A connection between palindromic and factor complexity using return words","year":2008,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Palindrome; Mathematics; Combinatorics; Word (group theory); Connection (principal bundle); Function (biology); Set (abstract data type); Word length; Factor (programming language); Discrete mathematics; Geometry; Linguistics","score_opus":0.0587870870588243,"score_gpt":0.291506953157473,"score_spread":0.2327198660986487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098464356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2912375,0.0021370552,0.6104122,0.004294077,0.00044025847,0.00011634213,0.0006452499,0.00076132553,0.089956164],"genre_scores_gemma":[0.94158417,0.00077173515,0.04214958,0.00054538535,0.0007077475,0.00010544073,0.00030748968,0.00027586916,0.013552637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975242,0.0005184475,0.0002121249,0.00079307554,0.0006094687,0.00034265194],"domain_scores_gemma":[0.9875731,0.008355605,0.00093472993,0.0017020977,0.0007936703,0.0006406626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015131653,0.00075885403,0.0017520247,0.0024520867,0.001957806,0.005286833,0.0019904303,0.0020091638,0.011676082],"category_scores_gemma":[0.0121244285,0.0007319221,0.0016631118,0.0031442363,0.006389377,0.0190976,0.0036067513,0.003997249,0.0010545553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022312239,0.00001051224,0.00016214435,0.00003216433,0.000004174993,0.000026822196,0.00017177414,0.0005774291,0.000295198,0.9952436,0.0002941419,0.0031596662],"study_design_scores_gemma":[0.000008558131,0.000011518114,0.00008843874,0.0000053794365,0.0000065018785,0.00006869995,0.000031576357,0.00208038,0.00026524678,0.9963314,0.0010901097,0.000012282279],"about_ca_topic_score_codex":0.0009378966,"about_ca_topic_score_gemma":0.0006445275,"teacher_disagreement_score":0.011676082,"about_ca_system_score_codex":0.0017331814,"about_ca_system_score_gemma":0.00074951036,"threshold_uncertainty_score":0.039060354},"labels":[],"label_agreement":null},{"id":"W2098631512","doi":"10.1142/s1005386707000119","title":"Generalized Inflations of Completely Simple Semigroups","year":2007,"lang":"en","type":"article","venue":"Algebra Colloquium","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Carleton University","funders":"","keywords":"Mathematics; Simple (philosophy); Semigroup; Pure mathematics; Associative property; Null (SQL); Inflation (cosmology); Computer science; Theoretical physics","score_opus":0.013907936285853377,"score_gpt":0.2513397610490686,"score_spread":0.2374318247632152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098631512","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78798515,0.00078193186,0.18511496,0.0004205957,0.00015264434,0.000065618275,0.00016670255,0.0004272488,0.02488513],"genre_scores_gemma":[0.96908927,0.00015867109,0.025393667,0.00009066502,0.000088178014,0.000049393333,0.00012730433,0.000052120078,0.004950817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989563,0.00024564395,0.00009659084,0.0002456034,0.00028770827,0.00016806988],"domain_scores_gemma":[0.998552,0.000429256,0.00022106101,0.000300526,0.00024406951,0.0002530707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088104437,0.00031213366,0.00046438145,0.00083905127,0.0009807233,0.0013573244,0.00038143116,0.00038329395,0.0017798642],"category_scores_gemma":[0.0021445958,0.0003968448,0.0008968901,0.00045056545,0.0025775824,0.002842646,0.0021548704,0.0010028013,0.0003068495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012047298,0.000023366783,0.0010921628,0.00006182804,0.00001842646,0.00035291995,0.0014689104,0.0011278907,0.013080637,0.97204643,0.00036316534,0.010243725],"study_design_scores_gemma":[0.000030873867,0.0001227919,0.0016900479,0.00003141424,0.00002763296,0.00056402717,0.0004589313,0.007269395,0.008240675,0.9717755,0.009747539,0.00004116294],"about_ca_topic_score_codex":0.00028844993,"about_ca_topic_score_gemma":0.00034822297,"teacher_disagreement_score":0.0017798642,"about_ca_system_score_codex":0.0005540821,"about_ca_system_score_gemma":0.00030578766,"threshold_uncertainty_score":0.005954206},"labels":[],"label_agreement":null},{"id":"W2099027386","doi":"10.1109/cdc.1988.194536","title":"A combinatorial approach to nonlinear functional expansions: an introduction with an example","year":2003,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Nonlinear system; Theoretical computer science; Applied mathematics; Mathematical optimization; Mathematics; Physics","score_opus":0.028402911276217822,"score_gpt":0.22381410156300216,"score_spread":0.19541119028678433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099027386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006559451,0.083254375,0.707588,0.009761548,0.0060200775,0.00013808641,0.0003765596,0.0006360516,0.18566589],"genre_scores_gemma":[0.15941456,0.12448195,0.54307383,0.009541573,0.013406114,0.0009796675,0.00076123176,0.0010439662,0.14729711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994479,0.0001772186,0.00004901375,0.000103262806,0.00018177764,0.000040890864],"domain_scores_gemma":[0.9995528,0.00026594102,0.000024893292,0.000045270088,0.00007667205,0.000034439996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072784955,0.0012608039,0.0008210588,0.002279569,0.001174552,0.002009227,0.0012667822,0.0016594527,0.009791816],"category_scores_gemma":[0.0012706637,0.0006219732,0.0012807967,0.002128195,0.0028416838,0.0045188526,0.0018437015,0.0031531833,0.0035056316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014402674,0.000054207536,0.00010346248,0.0002874454,0.000010779947,0.00035257998,0.00022090883,0.0019601905,0.0012194435,0.951413,0.013844467,0.030519111],"study_design_scores_gemma":[0.0000069087832,0.0000569117,0.00026934623,0.00018636121,0.000012482886,0.0009443777,0.0000855909,0.0065046884,0.0005630992,0.7150435,0.2762769,0.0000498049],"about_ca_topic_score_codex":0.00090983324,"about_ca_topic_score_gemma":0.001069246,"teacher_disagreement_score":0.009791816,"about_ca_system_score_codex":0.0010684055,"about_ca_system_score_gemma":0.000410108,"threshold_uncertainty_score":0.032756925},"labels":[],"label_agreement":null},{"id":"W2099119688","doi":"10.1007/978-3-319-09698-8_4","title":"State Complexity of Deletion","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Regular language; Upper and lower bounds; State (computer science); Finite-state machine; Computer science; Deterministic finite automaton; Automaton; Matching (statistics); Time complexity; Computational complexity theory; Combinatorics; Discrete mathematics; Algorithm; Theoretical computer science; Mathematics","score_opus":0.022515380925277356,"score_gpt":0.23972131822434914,"score_spread":0.21720593729907178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099119688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48200706,0.001887372,0.19915922,0.00622883,0.00032574357,0.00011388411,0.0022611583,0.00074768165,0.30726913],"genre_scores_gemma":[0.9664883,0.00065973884,0.00832323,0.00016969514,0.00019632635,0.00010039329,0.00094222947,0.000197546,0.022922581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813724,0.0003346561,0.00010195848,0.00035616226,0.00075006206,0.000319905],"domain_scores_gemma":[0.9920765,0.005502922,0.0003848187,0.0010281464,0.00066692696,0.00034065844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096275134,0.00049875764,0.000968535,0.0013118228,0.0015648477,0.004922195,0.0016451621,0.0013888592,0.01600962],"category_scores_gemma":[0.007867627,0.00058885536,0.001191065,0.0020246587,0.002565097,0.008822193,0.0026445414,0.003910789,0.00141046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000799939,0.000025708738,0.00038522657,0.00005888286,0.000008982979,0.00004410488,0.000260586,0.0066341786,0.0007934475,0.9787385,0.0023242517,0.010646204],"study_design_scores_gemma":[0.00001090897,0.000009119176,0.00029180906,0.000011371197,0.000011814592,0.00005714556,0.00005929416,0.01629067,0.00081238116,0.9801152,0.0023186149,0.0000117203035],"about_ca_topic_score_codex":0.0015399277,"about_ca_topic_score_gemma":0.001158548,"teacher_disagreement_score":0.01600962,"about_ca_system_score_codex":0.002522138,"about_ca_system_score_gemma":0.001424766,"threshold_uncertainty_score":0.053557515},"labels":[],"label_agreement":null},{"id":"W2100901057","doi":"10.1109/ismvl.2011.36","title":"Maximal Centralizing Monoids and their Relation to Minimal Clones","year":2011,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Monoid; Unary operation; Mathematics; Set (abstract data type); Relation (database); Free monoid; Syntactic monoid; Combinatorics; Constant (computer programming); Element (criminal law); Discrete mathematics; Maximal element; Focus (optics); Pure mathematics; Algebra over a field; Computer science","score_opus":0.027630243592160087,"score_gpt":0.21098950346698908,"score_spread":0.18335925987482898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100901057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8722931,0.0011152877,0.11218051,0.00029966448,0.000043567732,0.00006465994,0.0002365223,0.0002827,0.01348401],"genre_scores_gemma":[0.96339095,0.0002734762,0.03171849,0.00011065531,0.000050594044,0.000100624995,0.0002206717,0.000045003264,0.0040895576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880815,0.00020395024,0.00012746434,0.0004571038,0.00022109704,0.00018218628],"domain_scores_gemma":[0.994023,0.0033724557,0.0006873687,0.00057867344,0.00085326144,0.00048512095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011766467,0.0003279546,0.000677466,0.001830169,0.002158193,0.0024049457,0.0007627735,0.0009035609,0.0021323692],"category_scores_gemma":[0.004814308,0.0004854563,0.00084714557,0.0011839726,0.003322188,0.0027907807,0.0022499347,0.0011539106,0.00033298437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013995185,0.00003627156,0.0052651344,0.00012048933,0.000034563793,0.00045346367,0.0017826181,0.0015841135,0.011286264,0.9601467,0.0003985044,0.018751845],"study_design_scores_gemma":[0.000034704975,0.000121738405,0.0034660953,0.000058217083,0.00007843684,0.0011012334,0.0007070456,0.0075301197,0.01707015,0.96129423,0.008486498,0.000051603358],"about_ca_topic_score_codex":0.001105652,"about_ca_topic_score_gemma":0.0007538879,"teacher_disagreement_score":0.0024049457,"about_ca_system_score_codex":0.0015367446,"about_ca_system_score_gemma":0.0009968869,"threshold_uncertainty_score":0.011149883},"labels":[],"label_agreement":null},{"id":"W2101596584","doi":"10.1051/ita:2008006","title":"Least Periods of Factors of Infinite Words","year":2008,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Fibonacci number; Word (group theory); Mathematics; Mathematical proof; Set (abstract data type); Integer (computer science); Combinatorics; Product (mathematics); Factor (programming language); Infinite set; Discrete mathematics; Arithmetic; Computer science","score_opus":0.011671359484466765,"score_gpt":0.23001026543767186,"score_spread":0.2183389059532051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101596584","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72235197,0.002141586,0.20687665,0.0004928974,0.00022550978,0.000059910086,0.00075554295,0.0006083836,0.066487454],"genre_scores_gemma":[0.9667641,0.00051425816,0.026764436,0.00010631807,0.0002662794,0.000086144,0.00034967766,0.00014702666,0.005001675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993806,0.00009605449,0.000061097424,0.00018485964,0.00014303453,0.00013428972],"domain_scores_gemma":[0.99821657,0.0009511867,0.00031195677,0.0001737346,0.00018078915,0.00016571075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062600116,0.0005162359,0.0006253437,0.0013169352,0.00095731084,0.0024168498,0.000473267,0.0004399002,0.0050832336],"category_scores_gemma":[0.0032570749,0.000451721,0.0007520384,0.00079894497,0.0015347828,0.002997166,0.0011384538,0.0009830362,0.0007645783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023403122,0.00002942821,0.0020843474,0.00018454726,0.000032442735,0.00037751364,0.000778665,0.003072043,0.020506714,0.94933504,0.0014334632,0.02193183],"study_design_scores_gemma":[0.000040878764,0.00013772395,0.0029880702,0.00007442152,0.000054853484,0.000976684,0.00034856756,0.0146705,0.014713978,0.95009744,0.015832389,0.0000645618],"about_ca_topic_score_codex":0.00031867574,"about_ca_topic_score_gemma":0.0003688649,"teacher_disagreement_score":0.0050832336,"about_ca_system_score_codex":0.00068862975,"about_ca_system_score_gemma":0.00032233048,"threshold_uncertainty_score":0.017005086},"labels":[],"label_agreement":null},{"id":"W2101621888","doi":"10.1007/978-3-642-37064-9_28","title":"Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences","year":2013,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Waterloo","funders":"","keywords":"Sequence (biology); Factorization; Combinatorics; Mathematics; Generating function; Bounded function; Function (biology); Word (group theory); Discrete mathematics; Algorithm; Biology; Genetics; Geometry","score_opus":0.014585523774755393,"score_gpt":0.26000766732399133,"score_spread":0.24542214354923594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101621888","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5938246,0.0021896707,0.31386483,0.0016358949,0.00065471156,0.00011121422,0.0006014277,0.0006406672,0.086476944],"genre_scores_gemma":[0.95366144,0.00045251712,0.025091585,0.0002669105,0.00036507,0.00014308644,0.0003625478,0.00013909845,0.019517785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987129,0.00034728344,0.00012196568,0.00029242845,0.00030809405,0.00021741947],"domain_scores_gemma":[0.997138,0.0015711592,0.00037218144,0.00028785362,0.00038153437,0.00024917736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012213681,0.0006611673,0.0008031272,0.0016765482,0.0021821703,0.0039833975,0.0010528283,0.0016735849,0.007164525],"category_scores_gemma":[0.004931649,0.00067175523,0.0008794499,0.0016401995,0.0040383134,0.0050077937,0.0019137621,0.0021995238,0.0012328341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053823638,0.000012625309,0.00021862156,0.000028957664,0.000004372512,0.00015925714,0.00059640413,0.0003255908,0.0015334295,0.99285877,0.00038713843,0.003820876],"study_design_scores_gemma":[0.000014955864,0.000018455597,0.00014326286,0.00000937751,0.000006930532,0.00014408046,0.00013740677,0.0021598367,0.0006393711,0.9947836,0.0019283055,0.000014338377],"about_ca_topic_score_codex":0.00062363286,"about_ca_topic_score_gemma":0.0008013181,"teacher_disagreement_score":0.007164525,"about_ca_system_score_codex":0.0012337697,"about_ca_system_score_gemma":0.00080708857,"threshold_uncertainty_score":0.023967743},"labels":[],"label_agreement":null},{"id":"W2102041446","doi":"10.1090/s0002-9939-08-09737-2","title":"Transcendence of power series for some number theoretic functions","year":2008,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Transcendence (philosophy); Series (stratigraphy); Power (physics); Power series; Mathematics; Philosophy; Mathematical analysis; Epistemology; Physics; Geology","score_opus":0.010890729639968401,"score_gpt":0.23246953181101346,"score_spread":0.22157880217104506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102041446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10838041,0.003556531,0.51823825,0.003702258,0.0016857543,0.000059038706,0.00032821778,0.0007629178,0.3632866],"genre_scores_gemma":[0.84866786,0.0037673197,0.06346195,0.0011603103,0.001961501,0.00012739781,0.00031893462,0.00060017005,0.07993468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993304,0.00014494771,0.000031914784,0.0001485551,0.00024278318,0.00010138919],"domain_scores_gemma":[0.9986853,0.0006663827,0.000080299724,0.00014729067,0.0003249851,0.000095731506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010636309,0.0009553258,0.00060197845,0.0024285826,0.000831367,0.002201818,0.0006433336,0.0005023836,0.012232843],"category_scores_gemma":[0.003838206,0.00024858513,0.001224939,0.0011945633,0.002561185,0.0046008397,0.0016596982,0.003133842,0.0029096706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012312436,0.000007733283,0.000058261623,0.000036159046,0.0000045734105,0.000076740136,0.00016580596,0.00045421542,0.00077562424,0.9880505,0.0011875349,0.009170413],"study_design_scores_gemma":[0.000008558249,0.000020724014,0.0001422974,0.000021461477,0.0000079095325,0.00019074394,0.000056457084,0.0044271457,0.0017250646,0.9718364,0.021551648,0.000011540108],"about_ca_topic_score_codex":0.0006252701,"about_ca_topic_score_gemma":0.00037035818,"teacher_disagreement_score":0.012232843,"about_ca_system_score_codex":0.0012730015,"about_ca_system_score_gemma":0.00041857077,"threshold_uncertainty_score":0.04092294},"labels":[],"label_agreement":null},{"id":"W2104755092","doi":"10.1142/s0218196705002463","title":"UNAVOIDABLE AND ALMOST UNAVOIDABLE SETS OF WORDS","year":2005,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Alphabet; Set (abstract data type); Word (group theory); Automaton; Discrete mathematics; Finite set; Set theory; Theoretical computer science; Computer science; Linguistics","score_opus":0.00804054867491937,"score_gpt":0.2612491853130127,"score_spread":0.25320863663809334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104755092","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60791254,0.001019193,0.36991557,0.0006780347,0.00013120906,0.00007975821,0.0008642448,0.00057089276,0.018828483],"genre_scores_gemma":[0.93185604,0.00050100783,0.061261892,0.00022902685,0.0003735918,0.0003103154,0.000864307,0.00020249537,0.004401299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963224,0.0006565638,0.00038763613,0.0009090665,0.0012665052,0.0004578434],"domain_scores_gemma":[0.9602569,0.027573004,0.0028953152,0.0048505953,0.0025335187,0.0018907827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025542644,0.0006164725,0.00083783333,0.0020042611,0.0016752364,0.0024601303,0.001994557,0.0010127958,0.004850162],"category_scores_gemma":[0.02097143,0.0008680286,0.0012425611,0.0013825374,0.004391444,0.008632124,0.0033510844,0.0023104828,0.0004939549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030188198,0.000067941866,0.0039616656,0.00025013933,0.000064074426,0.00036379186,0.0009629014,0.010754853,0.012036045,0.9569945,0.0010577299,0.013184449],"study_design_scores_gemma":[0.00003165988,0.00012363173,0.0026477114,0.00006121452,0.00005027965,0.00079497916,0.00036199501,0.04273479,0.011083906,0.93667924,0.005370392,0.000060202634],"about_ca_topic_score_codex":0.00026129317,"about_ca_topic_score_gemma":0.0002898393,"teacher_disagreement_score":0.004850162,"about_ca_system_score_codex":0.0012315542,"about_ca_system_score_gemma":0.0007244536,"threshold_uncertainty_score":0.016225338},"labels":[],"label_agreement":null},{"id":"W2105217716","doi":"10.1007/978-3-642-23211-4_10","title":"Approximate Bit Vectors for Fast Unification","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Manitoba","funders":"","keywords":"Unification; Bit (key); Computer science; Bit array; Algorithm; Parsing; Theoretical computer science; Artificial intelligence; Programming language; Type (biology)","score_opus":0.022249397841903044,"score_gpt":0.23346618057427146,"score_spread":0.2112167827323684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105217716","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020350413,0.002107121,0.9561233,0.00056434673,0.00055123813,0.00014657373,0.0008628545,0.006830345,0.0124637885],"genre_scores_gemma":[0.2856481,0.0016870967,0.6806455,0.0005754097,0.00045559954,0.0007600132,0.0027734083,0.002113011,0.025341827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723417,0.00075263216,0.00027827112,0.00041383997,0.0010133734,0.00030780895],"domain_scores_gemma":[0.995375,0.0018487485,0.00015937537,0.0020011156,0.00051908835,0.00009664226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018501705,0.0012128102,0.0017922941,0.0020422244,0.0013175482,0.0031043123,0.0023812752,0.0015234142,0.022390557],"category_scores_gemma":[0.008968299,0.0010180934,0.0011941708,0.0041106087,0.001585331,0.009612258,0.004295008,0.0029496427,0.0070264754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066866,0.00011012301,0.00036193756,0.00034992216,0.000067193825,0.00006868005,0.00021207999,0.020337053,0.005266442,0.41325113,0.020210233,0.53909653],"study_design_scores_gemma":[0.00005515767,0.00006429309,0.00011564879,0.000087024484,0.000045679066,0.000080927435,0.00007187278,0.12753206,0.0076287207,0.8478738,0.016402079,0.000042757016],"about_ca_topic_score_codex":0.001397088,"about_ca_topic_score_gemma":0.0021190122,"teacher_disagreement_score":0.022390557,"about_ca_system_score_codex":0.0013852793,"about_ca_system_score_gemma":0.0014094885,"threshold_uncertainty_score":0.074903846},"labels":[],"label_agreement":null},{"id":"W2106154414","doi":"","title":"Nondeterministic Bimachines and Rational Relations with Finite Codomain","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Nondeterministic algorithm; Mathematics; Rational function; Finite set; Discrete mathematics; Pure mathematics","score_opus":0.004265870775491289,"score_gpt":0.19047498247860684,"score_spread":0.18620911170311555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106154414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18237525,0.0013131712,0.7869897,0.00042773376,0.0001424088,0.000089525434,0.00019328865,0.00047075897,0.02799816],"genre_scores_gemma":[0.85989565,0.0006104703,0.1297237,0.00016991833,0.000104348255,0.00016946829,0.00021287042,0.00011178067,0.009001763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981831,0.00041310056,0.0001713704,0.00058269233,0.0004227401,0.00022701437],"domain_scores_gemma":[0.997761,0.0011560764,0.00029519768,0.00047030195,0.0002196899,0.000097687735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012213761,0.00046875974,0.00046426238,0.00076556834,0.0009856794,0.0020643983,0.00060152455,0.00066956994,0.0031113208],"category_scores_gemma":[0.0035328383,0.00039079084,0.00094423664,0.00054462114,0.005013454,0.004553601,0.0019304289,0.0019031008,0.0005502771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025200556,0.000009412181,0.00032181185,0.000038581366,0.000004666763,0.000076030316,0.00034528633,0.0013213741,0.0035152647,0.98831534,0.00011313596,0.0059139566],"study_design_scores_gemma":[0.0000137911375,0.000059977832,0.0005073111,0.00003141581,0.000014750408,0.0003291669,0.00020939189,0.0123599265,0.014796896,0.95744735,0.014195648,0.000034351764],"about_ca_topic_score_codex":0.00045329958,"about_ca_topic_score_gemma":0.0004435826,"teacher_disagreement_score":0.0031113208,"about_ca_system_score_codex":0.0008346846,"about_ca_system_score_gemma":0.00063756056,"threshold_uncertainty_score":0.010408461},"labels":[],"label_agreement":null},{"id":"W2106865935","doi":"10.1007/978-3-642-22012-8_27","title":"Generic Expression Hardness Results for Primitive Positive Formula Comparison","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Trichotomy (philosophy); Equivalence (formal languages); Expression (computer science); Computer science; Containment (computer programming); Algorithm; Mathematics; Discrete mathematics; Programming language","score_opus":0.03159664891861386,"score_gpt":0.2631389996122832,"score_spread":0.23154235069366935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106865935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11654682,0.00362913,0.6520361,0.0081799,0.0010503264,0.00040565044,0.0018284647,0.0030130504,0.2133106],"genre_scores_gemma":[0.78533006,0.0024207197,0.14767668,0.002592705,0.0016386884,0.00065366784,0.0029852495,0.0017660802,0.054936126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946896,0.0008463419,0.00029166453,0.0014709448,0.0021050898,0.00059634197],"domain_scores_gemma":[0.98910064,0.007728167,0.00031575028,0.0019270529,0.00062751095,0.000300918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025886588,0.0016433157,0.0026021851,0.0018155057,0.0028651142,0.005325255,0.006150613,0.002644095,0.022880211],"category_scores_gemma":[0.011136408,0.0013387799,0.003981576,0.0043302495,0.005773285,0.022752179,0.006989252,0.013311951,0.0023261032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028982942,0.00015699957,0.0004609838,0.0005699305,0.00008537506,0.00019217195,0.0004374948,0.0066184667,0.0027146633,0.93538696,0.010776308,0.04231093],"study_design_scores_gemma":[0.000040017043,0.000037311624,0.0003037245,0.000037168673,0.00007481447,0.00016547106,0.000054592485,0.010216928,0.0016944939,0.98023796,0.0071113706,0.000026210379],"about_ca_topic_score_codex":0.00097391853,"about_ca_topic_score_gemma":0.0011830493,"teacher_disagreement_score":0.022880211,"about_ca_system_score_codex":0.0036323746,"about_ca_system_score_gemma":0.0014678122,"threshold_uncertainty_score":0.07654196},"labels":[],"label_agreement":null},{"id":"W2106875872","doi":"10.1016/j.tcs.2012.10.055","title":"Quotient complexity of ideal languages","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ideal (ethics); Mathematics; Regular language; Concatenation (mathematics); Quotient; Discrete mathematics; Intersection (aeronautics); Generator (circuit theory); Combinatorics; Computer science; Theoretical computer science; Automaton","score_opus":0.020154317981563488,"score_gpt":0.2752687244087085,"score_spread":0.255114406427145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106875872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72519916,0.0013469431,0.1652901,0.0064508105,0.00020627576,0.00007783664,0.00072639965,0.00054939295,0.100153126],"genre_scores_gemma":[0.98107845,0.00034384363,0.00734483,0.00021852864,0.0002625847,0.00007223732,0.00046619438,0.00010189893,0.010111582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997629,0.0006173744,0.00015323117,0.00040393104,0.00075822056,0.00043833756],"domain_scores_gemma":[0.99067783,0.00615962,0.00058858015,0.0007563889,0.0008614716,0.00095600873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019180942,0.0005914428,0.0012415366,0.0020252264,0.0020239411,0.00582352,0.0016907259,0.0010628429,0.010824594],"category_scores_gemma":[0.008733174,0.0005498522,0.0013250029,0.0015380768,0.0045180186,0.015942873,0.0034570226,0.003622749,0.00079700025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008080471,0.00002702121,0.00041818531,0.000026560458,0.000006463905,0.000048629227,0.0004098621,0.001219365,0.00047427637,0.99460924,0.0005558393,0.0021237293],"study_design_scores_gemma":[0.00001393583,0.000008728841,0.00015870528,0.0000040168343,0.0000060483267,0.00004126129,0.00006448898,0.0054383893,0.00033415417,0.993233,0.00068829086,0.000008918573],"about_ca_topic_score_codex":0.0016082122,"about_ca_topic_score_gemma":0.0010923087,"teacher_disagreement_score":0.010824594,"about_ca_system_score_codex":0.0030126928,"about_ca_system_score_gemma":0.0011236024,"threshold_uncertainty_score":0.03621185},"labels":[],"label_agreement":null},{"id":"W2107000858","doi":"10.1007/s00224-007-9049-y","title":"Incremental Branching Programs","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"McGill University","keywords":"Branching (polymer chemistry); Nondeterministic algorithm; Computation; Computer science; Exponential function; Mathematics; Combinatorics; Discrete mathematics; Algorithm","score_opus":0.0161668605177624,"score_gpt":0.24632149893553537,"score_spread":0.23015463841777298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107000858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06041007,0.0017535156,0.6896561,0.0031981405,0.00041697038,0.00016519077,0.0007661605,0.0020405916,0.24159332],"genre_scores_gemma":[0.7881413,0.0013165046,0.13479617,0.00077166973,0.00051659375,0.0002472384,0.0011388122,0.00054277567,0.07252906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923086,0.00017605061,0.00003674769,0.00018264986,0.00027435887,0.000099459394],"domain_scores_gemma":[0.9979875,0.001166519,0.00006895375,0.00030906696,0.00031872425,0.00014912173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007118579,0.00060134596,0.0006487404,0.0012592047,0.0014888629,0.002937755,0.0013676345,0.00096270314,0.015349954],"category_scores_gemma":[0.0035703105,0.00047442853,0.00086790696,0.0017092932,0.0022853613,0.0061293687,0.0023082572,0.0032233251,0.0016948413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000214367,0.000018462415,0.00010241342,0.000027975448,0.0000044408234,0.000026975818,0.00011946492,0.0009197171,0.0004639227,0.98439145,0.0020183485,0.011885457],"study_design_scores_gemma":[0.00000871098,0.0000071296236,0.00008733719,0.000009091254,0.000011950421,0.000037267808,0.000030818763,0.007599052,0.000563389,0.9839197,0.0077199014,0.0000056298986],"about_ca_topic_score_codex":0.0012917639,"about_ca_topic_score_gemma":0.0014324875,"teacher_disagreement_score":0.015349954,"about_ca_system_score_codex":0.001715917,"about_ca_system_score_gemma":0.0009692102,"threshold_uncertainty_score":0.051350713},"labels":[],"label_agreement":null},{"id":"W2107552967","doi":"10.1016/j.tcs.2011.12.028","title":"State complexity of union and intersection of star on regular languages","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Intersection (aeronautics); Regular language; State (computer science); Star (game theory); Component (thermodynamics); Mathematics; Discrete mathematics; Computer science; Theoretical computer science; Algorithm; Automaton","score_opus":0.02220350129067516,"score_gpt":0.24425759313541612,"score_spread":0.22205409184474095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107552967","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92217183,0.00028684156,0.063296594,0.0017905873,0.000038347658,0.00007082886,0.0011751449,0.00041412428,0.010755703],"genre_scores_gemma":[0.99125403,0.000107572916,0.005367859,0.000056311277,0.000050134466,0.00004553073,0.0006715752,0.00009809525,0.0023489934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99619484,0.0009650253,0.00029682365,0.0006885214,0.0009806271,0.00087411137],"domain_scores_gemma":[0.931561,0.056383282,0.00296428,0.0040427065,0.0023736584,0.0026750644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030099342,0.00051181886,0.0020943575,0.0017313871,0.0026069393,0.00895697,0.002514832,0.002375279,0.012750997],"category_scores_gemma":[0.026616193,0.0011532914,0.0022276328,0.0020639708,0.0039836755,0.018170014,0.004107705,0.0040246625,0.0005469303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017484489,0.00030080313,0.009669343,0.0002446925,0.000116475865,0.00027257408,0.0020717655,0.08984633,0.0040662372,0.87194073,0.0035290786,0.016193543],"study_design_scores_gemma":[0.000095457006,0.00007674804,0.0018767153,0.000020703608,0.0000728906,0.000105906634,0.00042576174,0.29505345,0.003046676,0.6984658,0.0007052948,0.00005459353],"about_ca_topic_score_codex":0.005626721,"about_ca_topic_score_gemma":0.0055914572,"teacher_disagreement_score":0.012750997,"about_ca_system_score_codex":0.0039903787,"about_ca_system_score_gemma":0.003211083,"threshold_uncertainty_score":0.042656302},"labels":[],"label_agreement":null},{"id":"W2107671423","doi":"10.1515/integers-2012-0006","title":"Approximations of Additive Squares in Infinite Words","year":2012,"lang":"en","type":"article","venue":"Integers","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Word (group theory); Least-squares function approximation; Algebra over a field; Applied mathematics; Pure mathematics; Statistics; Geometry","score_opus":0.013048876581785144,"score_gpt":0.2491160081136246,"score_spread":0.23606713153183947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107671423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4687648,0.0005326321,0.49709246,0.00071778137,0.0002909726,0.0000452584,0.0001615485,0.00068092014,0.03171369],"genre_scores_gemma":[0.9199142,0.00015940229,0.06440129,0.00017274266,0.00007074985,0.00005318289,0.00016315158,0.00014348346,0.014921907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986173,0.00032002866,0.00010880402,0.00035173638,0.0004332691,0.00016882767],"domain_scores_gemma":[0.99640274,0.0021336507,0.0002525681,0.00056025037,0.00043372862,0.00021707134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067078986,0.0005232403,0.0007828933,0.0005816812,0.0010626013,0.0026475075,0.0009186968,0.0006914068,0.0054788045],"category_scores_gemma":[0.0059310975,0.00053333916,0.0008759767,0.00066849845,0.0023368283,0.0047594532,0.0025081197,0.0018426059,0.00075032224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022507495,0.00003956041,0.0008567943,0.00010054442,0.000023143793,0.00027493673,0.0012649508,0.012007479,0.006021575,0.967015,0.0008055856,0.011365336],"study_design_scores_gemma":[0.000032217373,0.00006233231,0.00036438945,0.000041913714,0.0000350929,0.0002514142,0.000531463,0.06330695,0.0062455814,0.9221112,0.006991232,0.00002616787],"about_ca_topic_score_codex":0.0011668269,"about_ca_topic_score_gemma":0.0014374597,"teacher_disagreement_score":0.0054788045,"about_ca_system_score_codex":0.0010106537,"about_ca_system_score_gemma":0.00047530304,"threshold_uncertainty_score":0.018328428},"labels":[],"label_agreement":null},{"id":"W2108918469","doi":"10.1016/j.jcta.2003.12.005","title":"A class of prototiles with doubly generated level semigroups","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Class (philosophy); Mathematics; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.013825378483179678,"score_gpt":0.2232447927371347,"score_spread":0.20941941425395502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108918469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79376554,0.0007046893,0.118044145,0.0006594754,0.00035921214,0.0001343561,0.0006410376,0.0011048674,0.08458668],"genre_scores_gemma":[0.96423674,0.00018741013,0.014177382,0.0001351824,0.00015733158,0.00007813572,0.0004153278,0.00011112348,0.02050128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963117,0.00004587271,0.000022244049,0.00008735899,0.000098541976,0.000114752394],"domain_scores_gemma":[0.9989988,0.00030521466,0.00013955592,0.00014280684,0.00012339847,0.00029027043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030797758,0.00044712276,0.0008183222,0.0014416702,0.0026088879,0.0031649033,0.0007485985,0.0010448566,0.0074110003],"category_scores_gemma":[0.0010229767,0.00052208797,0.00092101365,0.0008518204,0.0018025496,0.0016226843,0.0015392321,0.0009867455,0.00092593924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016053226,0.000039311093,0.0012593342,0.00005566661,0.000019856909,0.0009282769,0.00072533044,0.0007136999,0.006053501,0.9812562,0.0016955206,0.0070927422],"study_design_scores_gemma":[0.00009128899,0.0001348464,0.0022364298,0.00003310199,0.000037941416,0.002336598,0.00057550875,0.0094494205,0.003704321,0.9642335,0.017108902,0.00005810916],"about_ca_topic_score_codex":0.0006276482,"about_ca_topic_score_gemma":0.000590517,"teacher_disagreement_score":0.0074110003,"about_ca_system_score_codex":0.000674266,"about_ca_system_score_gemma":0.0004910729,"threshold_uncertainty_score":0.024792254},"labels":[],"label_agreement":null},{"id":"W2109036808","doi":"10.1016/j.tcs.2008.12.054","title":"State complexity of basic operations on suffix-free regular languages","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Catenation; Regular language; Suffix; Deterministic finite automaton; State (computer science); Abstract family of languages; Regular expression; Computer science; Nondeterministic finite automaton; Automaton; Cone (formal languages); Finite-state machine; Combined operations; Deterministic automaton; Pumping lemma for regular languages; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; Programming language; Automata theory; Second-generation programming language; Fifth-generation programming language; Linguistics","score_opus":0.015094532963450848,"score_gpt":0.26196869014037016,"score_spread":0.24687415717691932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109036808","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9209095,0.0002011775,0.06808453,0.00081736915,0.000031959877,0.00006497258,0.00086551695,0.00043371186,0.008591223],"genre_scores_gemma":[0.9903054,0.00011673311,0.0063640457,0.000048097107,0.00005279563,0.00005635474,0.0006121635,0.00008749353,0.0023568426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974954,0.0004793327,0.00021545874,0.0004397656,0.00076942274,0.00060052966],"domain_scores_gemma":[0.9609974,0.0316106,0.0017707425,0.0027771348,0.0015922349,0.0012517706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017973302,0.00053408137,0.0014569827,0.0012100771,0.0014475666,0.006524659,0.0019574156,0.0016668617,0.010024718],"category_scores_gemma":[0.015903234,0.000764378,0.0014301649,0.0016800753,0.0027560452,0.0133164115,0.0025658316,0.0028002372,0.0006607213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020163455,0.00039599015,0.0060998793,0.00027374073,0.000087049695,0.00030487048,0.0019537155,0.07114,0.01240842,0.87819004,0.0028115585,0.024318349],"study_design_scores_gemma":[0.00010088773,0.0001143825,0.0015180288,0.000016198708,0.00005461707,0.00010028579,0.00024292954,0.20489375,0.005347736,0.78698343,0.0005775558,0.000050196835],"about_ca_topic_score_codex":0.0021933133,"about_ca_topic_score_gemma":0.0024192366,"teacher_disagreement_score":0.010024718,"about_ca_system_score_codex":0.0023530605,"about_ca_system_score_gemma":0.002054681,"threshold_uncertainty_score":0.033536077},"labels":[],"label_agreement":null},{"id":"W2109787457","doi":"10.3233/fi-2009-0008","title":"Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Prefix; Computer science; Regular language; State (computer science); Theoretical computer science; Programming language; Arithmetic; Mathematics; Automaton; Linguistics","score_opus":0.028182085055141262,"score_gpt":0.28112743774300314,"score_spread":0.2529453526878619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109787457","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7848661,0.00034781365,0.20390181,0.0006500295,0.000043847984,0.0001589841,0.00059749524,0.00038034748,0.00905352],"genre_scores_gemma":[0.968072,0.0001759356,0.029388981,0.000042111056,0.000044581844,0.00016691755,0.0004620747,0.0000936594,0.0015537617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960608,0.00072937977,0.00043452377,0.0008101932,0.001280552,0.0006845609],"domain_scores_gemma":[0.9563838,0.034542497,0.0026349055,0.0034207257,0.0020650115,0.0009529662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481428,0.00064104487,0.0010005039,0.001382607,0.0016225775,0.004690788,0.0015849967,0.001109392,0.004652574],"category_scores_gemma":[0.018210346,0.00056373177,0.001826994,0.0011444303,0.0039799027,0.009116131,0.0024586187,0.0029267166,0.00041949053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087359024,0.00027968577,0.006844654,0.00035816428,0.00009338783,0.00048467063,0.0016161829,0.13647822,0.02242806,0.8051473,0.001035707,0.024360437],"study_design_scores_gemma":[0.000046804547,0.00015996798,0.0011193289,0.000020453632,0.000060235245,0.0002450739,0.00020283113,0.2787619,0.016211761,0.7018655,0.0012336513,0.000072504605],"about_ca_topic_score_codex":0.0012344115,"about_ca_topic_score_gemma":0.0012268563,"teacher_disagreement_score":0.004690788,"about_ca_system_score_codex":0.0023363037,"about_ca_system_score_gemma":0.0020676258,"threshold_uncertainty_score":0.016951203},"labels":[],"label_agreement":null},{"id":"W2109887555","doi":"10.1017/s0004972714000197","title":"THE MINIMAL GROWTH OF A -REGULAR SEQUENCE","year":2014,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Multiplicative function; Sequence (biology); Combinatorics; Constant (computer programming); Discrete mathematics; Mathematical analysis","score_opus":0.018353452857412137,"score_gpt":0.2389289914033845,"score_spread":0.22057553854597237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109887555","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91470206,0.00040996596,0.06296563,0.00068557455,0.00007717886,0.000033359014,0.00026237118,0.00037803975,0.02048591],"genre_scores_gemma":[0.9872547,0.000086158085,0.00824523,0.00006991915,0.000035946017,0.000040024683,0.00017497811,0.0000706507,0.0040223952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990773,0.00016424608,0.000061193045,0.00025900645,0.00026336667,0.0001748874],"domain_scores_gemma":[0.9944992,0.0026553823,0.00042467358,0.00045852,0.0009145478,0.0010477395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010143385,0.00039079715,0.0007205204,0.0010454083,0.0011685153,0.0016637612,0.00096420577,0.0006162696,0.0035457218],"category_scores_gemma":[0.008039779,0.00030022912,0.00046199915,0.0003826007,0.0018470768,0.002410653,0.0017088255,0.0011669708,0.00051765965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091474253,0.00011766979,0.0062802047,0.0003067176,0.00004461529,0.0008192981,0.0014453914,0.017016165,0.06175549,0.88536924,0.002498718,0.02343161],"study_design_scores_gemma":[0.000062864056,0.00030574828,0.0035256078,0.00010752356,0.000046490513,0.0012604013,0.0006905942,0.2150845,0.027042747,0.74308366,0.008717592,0.00007226416],"about_ca_topic_score_codex":0.0008735941,"about_ca_topic_score_gemma":0.0005484957,"teacher_disagreement_score":0.0035457218,"about_ca_system_score_codex":0.0010758323,"about_ca_system_score_gemma":0.0005849517,"threshold_uncertainty_score":0.011861682},"labels":[],"label_agreement":null},{"id":"W2111476730","doi":"10.1142/s0129054113400248","title":"GOODBY TO THE KINDHEARTED DRAGON PROF. SHENG YU, 1950–2012","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Generosity; Diligence; Wife; Computer science; Friendship; Sociology; Conversation; Law; Psychology; Political science; Social science","score_opus":0.012607172487750945,"score_gpt":0.2786848954411714,"score_spread":0.26607772295342047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111476730","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010794055,0.055419013,0.009349409,0.6874209,0.17263317,0.00011159367,0.0007208224,0.0012739846,0.062277116],"genre_scores_gemma":[0.071122184,0.015126578,0.0051315436,0.116615936,0.029144133,0.00013475881,0.0010312004,0.0009464217,0.7607473],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99900717,0.00019155277,0.00004803584,0.0003138556,0.00029384717,0.00014568772],"domain_scores_gemma":[0.9971771,0.00031686467,0.00012614696,0.00012421102,0.0009776092,0.0012781002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015695295,0.0007614183,0.0006954203,0.00093238323,0.0039008618,0.0033897948,0.00051152357,0.0016970517,0.027521325],"category_scores_gemma":[0.0048783356,0.00027768605,0.00046374905,0.0009493107,0.0016745405,0.0031329705,0.0021488143,0.0041879695,0.015285188],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047774585,0.0000133344865,0.0006643987,0.00005830094,0.000008645569,0.00016860012,0.00072938576,0.00004813207,0.000561473,0.007257067,0.95848864,0.031954207],"study_design_scores_gemma":[0.0000040215873,0.000017864117,0.0006089041,0.000028730205,0.000003584393,0.00015315096,0.0006345486,0.0000990754,0.0002791126,0.0018235011,0.9963313,0.000016110804],"about_ca_topic_score_codex":0.0028160736,"about_ca_topic_score_gemma":0.0057339156,"teacher_disagreement_score":0.027521325,"about_ca_system_score_codex":0.002300755,"about_ca_system_score_gemma":0.002455218,"threshold_uncertainty_score":0.09206796},"labels":[],"label_agreement":null},{"id":"W2112448133","doi":"10.1007/978-3-642-38771-5_14","title":"Extremal Words in the Shift Orbit Closure of a Morphic Sequence","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Lexicographical order; Morphism; Word (group theory); Closure (psychology); Combinatorics; Alphabet; Mathematics; Sequence (biology); Omega; Orbit (dynamics); Binary number; Simple (philosophy); Arithmetic; Discrete mathematics; Physics; Geometry; Linguistics; Quantum mechanics; Philosophy","score_opus":0.023976390785037844,"score_gpt":0.24207488351782636,"score_spread":0.2180984927327885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112448133","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7982462,0.0010401778,0.093647026,0.0007328887,0.0002634477,0.00004369912,0.00025817775,0.00030179895,0.105466455],"genre_scores_gemma":[0.9744573,0.0002419056,0.008858114,0.0000900054,0.00015372262,0.000030181227,0.00016901201,0.00010297719,0.015896764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964154,0.00005859469,0.00002936399,0.00008824429,0.00010370891,0.0000785998],"domain_scores_gemma":[0.9994137,0.00026009337,0.000080158985,0.000058002912,0.00009378777,0.000094209456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034799628,0.0003882524,0.0005913219,0.0013909109,0.0014346985,0.0022362715,0.00049108296,0.00090576574,0.0061429488],"category_scores_gemma":[0.0015335754,0.0003514046,0.00046729442,0.0007899499,0.0020972725,0.0032132952,0.0013661673,0.0014258493,0.00058865314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007253033,0.000011540707,0.00017579237,0.00003059122,0.0000046752375,0.00021181608,0.00038097816,0.00060873805,0.0028083466,0.99036026,0.00047478112,0.0048599252],"study_design_scores_gemma":[0.000014063475,0.000032123044,0.0003993913,0.000019760484,0.00000950921,0.00028701787,0.00029271483,0.0040053506,0.0017412866,0.9899985,0.0031848238,0.000015479636],"about_ca_topic_score_codex":0.00042599728,"about_ca_topic_score_gemma":0.00048059193,"teacher_disagreement_score":0.0061429488,"about_ca_system_score_codex":0.0008252292,"about_ca_system_score_gemma":0.00030227433,"threshold_uncertainty_score":0.020550191},"labels":[],"label_agreement":null},{"id":"W2114449751","doi":"10.1112/jlms/jdn083","title":"Rational codes and free profinite monoids","year":2009,"lang":"en","type":"article","venue":"Journal of the London Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Profinite group; Closure (psychology); Finitely-generated abelian group; Free product; Pure mathematics; Discrete mathematics; Group (periodic table); Law; Physics; Political science","score_opus":0.010372184524660271,"score_gpt":0.23310519290175175,"score_spread":0.22273300837709148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114449751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77486414,0.005101834,0.13395354,0.0014462642,0.00020932683,0.00008668503,0.0004465428,0.00045640976,0.083435215],"genre_scores_gemma":[0.9800178,0.00072180794,0.0097228065,0.00009912142,0.00011593885,0.000037607148,0.00022156087,0.000024106244,0.009039359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945074,0.00009728241,0.000039326682,0.00010456267,0.0002149712,0.000093138595],"domain_scores_gemma":[0.998681,0.0005799437,0.00017495765,0.00012917654,0.00021039233,0.00022450184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052374223,0.0003295939,0.0002854812,0.0011741493,0.00078621303,0.001612272,0.000387815,0.00045155914,0.003628616],"category_scores_gemma":[0.0017129177,0.00019208567,0.00039778493,0.0005151373,0.002706363,0.003130608,0.001632028,0.0008749782,0.00047501954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004604205,0.000016976022,0.000530878,0.00005248077,0.000004531161,0.00024179541,0.0009880261,0.00065513724,0.0032789148,0.9846305,0.00045299323,0.009101733],"study_design_scores_gemma":[0.00003198949,0.00006194663,0.0009753873,0.00004297892,0.000011235635,0.0007284519,0.0005634854,0.0058378587,0.0051624803,0.9688464,0.01770533,0.000032479187],"about_ca_topic_score_codex":0.0011325689,"about_ca_topic_score_gemma":0.0009183935,"teacher_disagreement_score":0.003628616,"about_ca_system_score_codex":0.00075418246,"about_ca_system_score_gemma":0.00042375972,"threshold_uncertainty_score":0.012138903},"labels":[],"label_agreement":null},{"id":"W2114920334","doi":"10.46298/dmtcs.282","title":"Sums of Digits, Overlaps, and Palindromes","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Palindrome; Combinatorics; Word (group theory); Base (topology); Symbol (formal); Arithmetic; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.007898847532994717,"score_gpt":0.23463548952621338,"score_spread":0.22673664199321866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114920334","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.820321,0.001854072,0.11814364,0.000502483,0.00024257672,0.000040556926,0.00024306534,0.00046184016,0.058190607],"genre_scores_gemma":[0.967208,0.00041752687,0.020623075,0.00015373612,0.00020540057,0.00006595086,0.00022348709,0.000105250365,0.010997609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991967,0.00011629059,0.0001032026,0.00022085171,0.00020492836,0.0001581104],"domain_scores_gemma":[0.9984376,0.00073154,0.00029221544,0.00020089344,0.00015258437,0.0001851529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005151898,0.000423517,0.00039784348,0.0012013018,0.0012804766,0.0016425147,0.0005271736,0.00045991398,0.003328187],"category_scores_gemma":[0.0022411763,0.00048673723,0.0004872495,0.0006441876,0.0024838392,0.0026964443,0.0022497901,0.00086365064,0.0006988239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034833842,0.000055057302,0.0023258233,0.00015233213,0.00002232703,0.0010975945,0.001438145,0.0022032312,0.018206855,0.93787926,0.0012339463,0.03503713],"study_design_scores_gemma":[0.00003603711,0.00016897157,0.0015736708,0.000060211903,0.0000377999,0.0016722284,0.00047968165,0.007864724,0.013266013,0.96116114,0.013622721,0.000056659414],"about_ca_topic_score_codex":0.00029660566,"about_ca_topic_score_gemma":0.00037351635,"teacher_disagreement_score":0.003328187,"about_ca_system_score_codex":0.00035259774,"about_ca_system_score_gemma":0.00029185216,"threshold_uncertainty_score":0.01113385},"labels":[],"label_agreement":null},{"id":"W2115974696","doi":"","title":"A GENERALIZATION OF COBHAM'S THEOREM FOR REGULAR SEQUENCES","year":2005,"lang":"en","type":"article","venue":"Séminaire Lotharingien de Combinatoire [electronic only]","topic":"semigroups and automata theory","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Sequence (biology); Generalization; Mathematics; Combinatorics; Discrete mathematics; State (computer science); Algorithm; Mathematical analysis","score_opus":0.006126340661898675,"score_gpt":0.2345454554971801,"score_spread":0.2284191148352814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115974696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13289711,0.0016376611,0.79829913,0.0016558476,0.0007070224,0.00028467714,0.0004164327,0.0008553479,0.06324679],"genre_scores_gemma":[0.8394085,0.0010003762,0.13808343,0.0011245447,0.0009531648,0.0004601737,0.00026626245,0.0002035661,0.0185001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809986,0.00022040782,0.00017770733,0.0009078294,0.00039013394,0.00020404678],"domain_scores_gemma":[0.9972216,0.0012609481,0.00024051665,0.00069003116,0.0004564165,0.00013061907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020175395,0.00049640844,0.0007889276,0.0012566377,0.0015924734,0.0013471338,0.0011215819,0.0010194014,0.003225448],"category_scores_gemma":[0.005381971,0.00037048123,0.0012811206,0.0008306337,0.0042059086,0.0040563024,0.0018357149,0.0018876196,0.00093672005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004850271,0.00001932693,0.00047685922,0.000109188775,0.000014560197,0.00027495224,0.00081705843,0.0017939298,0.005300478,0.9718346,0.0011451456,0.018165411],"study_design_scores_gemma":[0.000026150637,0.00014468227,0.0006715047,0.000042235046,0.000022491227,0.0010221583,0.000121674,0.014425091,0.0076442463,0.95259255,0.023234272,0.00005300509],"about_ca_topic_score_codex":0.0010264424,"about_ca_topic_score_gemma":0.0006014683,"teacher_disagreement_score":0.003225448,"about_ca_system_score_codex":0.0010742198,"about_ca_system_score_gemma":0.00082144333,"threshold_uncertainty_score":0.010790169},"labels":[],"label_agreement":null},{"id":"W2117110932","doi":"10.1016/j.jalgebra.2007.06.039","title":"Function fields in positive characteristic: Expansions and Cobham's theorem","year":2008,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Generalization; Extension (predicate logic); Rational function; Pure mathematics; Function (biology); Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.00895996210807634,"score_gpt":0.20858952057490174,"score_spread":0.1996295584668254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117110932","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39561102,0.0068754707,0.34916186,0.011781846,0.00084316515,0.00006737622,0.0002921295,0.0005112646,0.23485593],"genre_scores_gemma":[0.951427,0.0015100518,0.024466667,0.00074047217,0.00062123174,0.00006848088,0.00007063381,0.00008596343,0.021009581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992619,0.00019521634,0.000029865165,0.0001432906,0.00022156994,0.00014813466],"domain_scores_gemma":[0.99771345,0.0016082925,0.0001346328,0.00017302383,0.00023080815,0.0001398029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019703337,0.0005062623,0.0011903617,0.0022593604,0.0021237119,0.0026281967,0.0009870309,0.0013935501,0.0031904564],"category_scores_gemma":[0.005327564,0.0005031636,0.0006637075,0.0024291188,0.00628275,0.0094208,0.0026165908,0.004015519,0.00043183277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015829786,0.0000068765353,0.00009247043,0.000012982602,0.0000017346822,0.00004058946,0.00022465162,0.00021429929,0.00021756339,0.9953762,0.0005388154,0.0032579824],"study_design_scores_gemma":[0.000009627359,0.000005738319,0.00008733606,0.000005159203,0.0000037177144,0.000069785136,0.00005647429,0.001302139,0.00013799127,0.9965289,0.001786975,0.0000062285358],"about_ca_topic_score_codex":0.0011976565,"about_ca_topic_score_gemma":0.00081715843,"teacher_disagreement_score":0.0031904564,"about_ca_system_score_codex":0.0016926844,"about_ca_system_score_gemma":0.00076322135,"threshold_uncertainty_score":0.012281358},"labels":[],"label_agreement":null},{"id":"W2117973853","doi":"10.37236/951","title":"A Characterization of Balanced Episturmian Sequences","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Aperiodic graph; Alphabet; Generalization; Mathematics; Conjecture; Combinatorics; Characterization (materials science); Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.005130220948648043,"score_gpt":0.22026096969268613,"score_spread":0.2151307487440381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117973853","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89352304,0.00048656756,0.07302747,0.00019827415,0.000049182745,0.00004848733,0.00034177932,0.00014618997,0.03217899],"genre_scores_gemma":[0.9809106,0.0002272994,0.012605318,0.00006552731,0.00006381141,0.000048259473,0.00045478047,0.00002265894,0.0056016557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997241,0.000032224594,0.00002205875,0.000081855556,0.000089773945,0.000049981925],"domain_scores_gemma":[0.99940705,0.00017688228,0.0001445895,0.000048867994,0.0001291678,0.00009339567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018199938,0.00022211902,0.0002464682,0.0010925386,0.00067955005,0.00070020446,0.00026461802,0.00040149523,0.003208756],"category_scores_gemma":[0.0013341601,0.00013450721,0.00015550535,0.00061992905,0.0006325404,0.0009507522,0.0004718483,0.0003014633,0.00047854078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002660192,0.0000654986,0.009636479,0.00016026349,0.000016723538,0.0012243192,0.0018108999,0.005790311,0.10866776,0.79499495,0.0021587336,0.07520795],"study_design_scores_gemma":[0.000038789232,0.00040972314,0.019206967,0.00011960043,0.000044423155,0.005665592,0.0010188777,0.0945472,0.041508824,0.76600516,0.07133223,0.000102574275],"about_ca_topic_score_codex":0.0003467445,"about_ca_topic_score_gemma":0.00037329725,"teacher_disagreement_score":0.003208756,"about_ca_system_score_codex":0.0004084313,"about_ca_system_score_gemma":0.00022726125,"threshold_uncertainty_score":0.010734379},"labels":[],"label_agreement":null},{"id":"W2117977979","doi":"10.1007/s10231-006-0008-z","title":"Sturmian morphisms, the braid group B 4, Christoffel words and bases of F 2","year":2006,"lang":"en","type":"article","venue":"Annali di Matematica Pura ed Applicata (1923 -)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Morphism; Basis (linear algebra); Free group; Group (periodic table); Rank (graph theory); Braid group; Monoid; Free monoid; Automorphism; Combinatorics; Pure mathematics; Abelian group; Christoffel symbols; Algebra over a field","score_opus":0.00701646514828947,"score_gpt":0.2142175822928445,"score_spread":0.20720111714455502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117977979","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6963586,0.007118307,0.10938659,0.003027595,0.0012080384,0.00008032636,0.00041148774,0.0004172238,0.18199183],"genre_scores_gemma":[0.95086306,0.0013991215,0.017054148,0.00035676084,0.00046678833,0.00008897908,0.00026922967,0.000066594286,0.029435312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996625,0.000092621056,0.000020550653,0.00007440878,0.00007387409,0.00007605879],"domain_scores_gemma":[0.9995097,0.00020104222,0.00007825453,0.00003468757,0.0000714448,0.000104756386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077587366,0.0008681804,0.00071222946,0.0033917334,0.0028423693,0.0023866382,0.000641657,0.0014403838,0.0052299234],"category_scores_gemma":[0.0014070758,0.00043706872,0.0005399681,0.0020657454,0.0031732847,0.0024209747,0.0012558558,0.0020426696,0.0007483313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000488399,0.000018317214,0.00013623555,0.000026393396,0.0000049761234,0.00008083414,0.00036135374,0.00036595375,0.0007046873,0.99191135,0.0007436567,0.0055973358],"study_design_scores_gemma":[0.00001356116,0.000030424653,0.000276479,0.000009125961,0.000005522046,0.00008349463,0.00012740945,0.0008788018,0.00027581293,0.9950493,0.0032358598,0.000014320939],"about_ca_topic_score_codex":0.0019667326,"about_ca_topic_score_gemma":0.001796362,"teacher_disagreement_score":0.0052299234,"about_ca_system_score_codex":0.0013416492,"about_ca_system_score_gemma":0.0006545559,"threshold_uncertainty_score":0.017495811},"labels":[],"label_agreement":null},{"id":"W2118432320","doi":"10.1080/17459730902819566","title":"Structural properties of Euclidean rhythms","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematics and Music","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Centre for Interdisciplinary Research in Music Media and Technology","funders":"","keywords":"Euclidean geometry; Euclidean distance; Rhythm; Euclidean algorithm; Euclidean distance matrix; Mathematics; Euclidean group; Combinatorics; Non-Euclidean geometry; Algorithm; Pure mathematics; Geometry; Affine space; Physics","score_opus":0.028429372577182182,"score_gpt":0.22218797355503817,"score_spread":0.193758600977856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118432320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46604145,0.0009725757,0.48452765,0.00026530566,0.00017062514,0.00009490281,0.00038487688,0.0003133841,0.04722924],"genre_scores_gemma":[0.92085433,0.00034469765,0.06938369,0.00008982145,0.00015640419,0.00009475154,0.00044246443,0.00013397197,0.008499842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991147,0.00015988476,0.0000845986,0.00028792818,0.00021864081,0.0001342056],"domain_scores_gemma":[0.9983925,0.0005038225,0.0003348914,0.00026779177,0.00031629414,0.00018463233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005660434,0.00029581608,0.00037751286,0.00083069026,0.00088580494,0.001369497,0.00060308195,0.0004453188,0.0052671316],"category_scores_gemma":[0.0034063205,0.0002921762,0.00053195417,0.0006164652,0.0018948872,0.002131002,0.001126304,0.00073537027,0.0008909629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010305494,0.000017239003,0.0013616415,0.00011505461,0.000015567502,0.000246142,0.0008309909,0.002774862,0.014781874,0.9584348,0.00045239084,0.02086639],"study_design_scores_gemma":[0.0000732369,0.00028528733,0.004326709,0.000068802125,0.000042323132,0.0011484368,0.0006233501,0.02413447,0.014024455,0.9274866,0.027714655,0.00007171038],"about_ca_topic_score_codex":0.0003274675,"about_ca_topic_score_gemma":0.00031956015,"teacher_disagreement_score":0.0052671316,"about_ca_system_score_codex":0.00045015075,"about_ca_system_score_gemma":0.00031174973,"threshold_uncertainty_score":0.017620325},"labels":[],"label_agreement":null},{"id":"W2118804107","doi":"10.1002/rsa.20095","title":"The Boolean functions computed by random Boolean formulas or how to grow the right function","year":2005,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","funders":"","keywords":"Boolean function; Probabilistic logic; Monotone polygon; Function (biology); Mathematics; Discrete mathematics; Convergence (economics); Combinatorics; Computer science; Theoretical computer science; Statistics","score_opus":0.005735867594603812,"score_gpt":0.21022642284365153,"score_spread":0.20449055524904772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118804107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3725602,0.0004544094,0.5998454,0.002548166,0.000109260625,0.00008989891,0.0002235401,0.0005032579,0.02366585],"genre_scores_gemma":[0.92054427,0.00028838599,0.07222049,0.00028736034,0.00006335169,0.00012603891,0.00016755122,0.00019085908,0.0061116884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990772,0.0002893744,0.000058454207,0.00018174367,0.00025715606,0.00013599696],"domain_scores_gemma":[0.9867987,0.0097595565,0.000607908,0.001022423,0.001318349,0.00049300137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022821582,0.0004756849,0.0004938669,0.0011019076,0.00072905223,0.0029861478,0.000812923,0.0011062705,0.0057023265],"category_scores_gemma":[0.018930404,0.00034551215,0.0006859694,0.00057592354,0.002550563,0.0064394567,0.0012461523,0.0016216742,0.0007735526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013930319,0.000031923704,0.001280002,0.00008858871,0.00001911611,0.00011920824,0.0003547941,0.02574957,0.008233767,0.94082046,0.0014330762,0.021730205],"study_design_scores_gemma":[0.000022738897,0.000029327257,0.00035200812,0.000036193887,0.000021205577,0.0001097023,0.00012436388,0.2808333,0.013914546,0.7020178,0.0025119681,0.000026885318],"about_ca_topic_score_codex":0.00092930836,"about_ca_topic_score_gemma":0.00070104876,"teacher_disagreement_score":0.0057023265,"about_ca_system_score_codex":0.0011306378,"about_ca_system_score_gemma":0.000698628,"threshold_uncertainty_score":0.019076169},"labels":[],"label_agreement":null},{"id":"W2120230527","doi":"10.2178/jsl/1208359065","title":"Generic complexity of undecidable problems","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Undecidable problem; Construct (python library); Decidability; Word problem (mathematics education); Mathematics; Halting problem; Discrete mathematics; Computational complexity theory; Computer science; Algorithm; Turing machine; Arithmetic; Programming language","score_opus":0.0957049011215074,"score_gpt":0.2547248305775202,"score_spread":0.15901992945601282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120230527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4756246,0.0009986475,0.48334226,0.0041542454,0.00009409403,0.00042630846,0.0008843819,0.0009627255,0.033512738],"genre_scores_gemma":[0.94943106,0.0003664813,0.044635747,0.00036928768,0.00015800708,0.00031865857,0.0009584391,0.00012240655,0.0036399486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911396,0.0020715732,0.00070211396,0.0018863947,0.0030894415,0.0011109136],"domain_scores_gemma":[0.9656032,0.025264615,0.0023080856,0.0036020202,0.0020144135,0.001207785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004172237,0.0009304628,0.0013494169,0.002447104,0.0016629859,0.0049974998,0.0030833243,0.002208327,0.005766624],"category_scores_gemma":[0.02479538,0.00084996904,0.002916331,0.002135905,0.006260367,0.010826065,0.004968703,0.005398076,0.00027511304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022604883,0.00019755686,0.004172351,0.0005367802,0.00015651227,0.00035195114,0.0006765432,0.06527114,0.004846855,0.89932066,0.0017030165,0.022540523],"study_design_scores_gemma":[0.000044647993,0.000053044772,0.0008838275,0.000035944162,0.000059440994,0.0002771013,0.0001339457,0.11934748,0.0044414336,0.8721403,0.002554466,0.00002847561],"about_ca_topic_score_codex":0.0009772843,"about_ca_topic_score_gemma":0.00070583733,"teacher_disagreement_score":0.005766624,"about_ca_system_score_codex":0.0045298142,"about_ca_system_score_gemma":0.001447056,"threshold_uncertainty_score":0.0328663},"labels":[],"label_agreement":null},{"id":"W2123245038","doi":"10.1007/978-1-4612-1388-8_12","title":"Multiparty Communication Complexity of Finite Monoids","year":2000,"lang":"en","type":"book-chapter","venue":"Birkhäuser Boston eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Conjecture; Algebraic number; Monoid; Extension (predicate logic); Computer science; Bounded function; Communication complexity; Discrete mathematics; Mathematics; Theoretical computer science; Programming language","score_opus":0.05070096997711134,"score_gpt":0.24293958032864224,"score_spread":0.1922386103515309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123245038","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7612672,0.0008474716,0.21064189,0.0023192659,0.000058463855,0.00020487496,0.0005135616,0.00022384658,0.023923453],"genre_scores_gemma":[0.9785902,0.00031171797,0.017017975,0.00011134954,0.00009033318,0.00020766974,0.0002607792,0.000037573678,0.0033724445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959229,0.0011216544,0.00029244286,0.0007481986,0.0013139016,0.0006009039],"domain_scores_gemma":[0.9492061,0.04221818,0.0029612829,0.0030756046,0.0013221162,0.0012167855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026546852,0.00054183835,0.0009839709,0.0011440221,0.001583614,0.004877433,0.0018351935,0.0013522235,0.0037740814],"category_scores_gemma":[0.018787708,0.0006605693,0.0012761087,0.0014777755,0.0035024963,0.011009785,0.002740418,0.0037214432,0.00034158427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022050667,0.00014058077,0.0019006772,0.00013987867,0.000040389383,0.00015850451,0.0009186924,0.04516976,0.0043808725,0.9359611,0.0008034575,0.010165435],"study_design_scores_gemma":[0.00005395363,0.00006604708,0.0010434536,0.000021682836,0.000027237718,0.00018370239,0.0001461266,0.2025251,0.004247321,0.78980505,0.0018409895,0.000039331688],"about_ca_topic_score_codex":0.0010637844,"about_ca_topic_score_gemma":0.00067983905,"teacher_disagreement_score":0.004877433,"about_ca_system_score_codex":0.0034393673,"about_ca_system_score_gemma":0.0013476773,"threshold_uncertainty_score":0.024954498},"labels":[],"label_agreement":null},{"id":"W2123754314","doi":"10.1007/s00373-010-0937-6","title":"Enumerative Properties of Rooted Circuit Maps","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Planar graph; Combinatorics; Mathematics; Chordal graph; 1-planar graph; Planar; Pathwidth; Outerplanar graph; Indifference graph; Discrete mathematics; Planar straight-line graph; Vertex (graph theory); Graph; Computer science; Line graph","score_opus":0.011269198459668003,"score_gpt":0.18570217661450686,"score_spread":0.17443297815483885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123754314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8627747,0.0005116582,0.10224326,0.0005336364,0.00004259382,0.000055603537,0.0006127029,0.00050327956,0.03272248],"genre_scores_gemma":[0.98015964,0.00027847843,0.012061751,0.00009886009,0.000062567335,0.0000576106,0.00056618993,0.00012210572,0.0065928227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991186,0.00020842807,0.00005887922,0.00020471508,0.00023512548,0.00017422225],"domain_scores_gemma":[0.98806787,0.009304722,0.0007693072,0.00086225144,0.00055249076,0.00044337093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006742275,0.0004448468,0.00064976665,0.0018288061,0.0015239067,0.003374625,0.0015261517,0.0010001904,0.0063643875],"category_scores_gemma":[0.007054614,0.00043642777,0.0006570773,0.0021877508,0.0019621497,0.004954999,0.0015328928,0.0016100568,0.0005116257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015002218,0.00012075827,0.0026053493,0.000128852,0.000023260665,0.0003379163,0.0012564678,0.0075091263,0.008675388,0.9567875,0.001355766,0.02104945],"study_design_scores_gemma":[0.000024708414,0.000024591884,0.00074876583,0.000020162495,0.000029175662,0.00020851691,0.00019999783,0.020295413,0.0035280848,0.97319216,0.0017107006,0.000017767346],"about_ca_topic_score_codex":0.001059038,"about_ca_topic_score_gemma":0.0017326155,"teacher_disagreement_score":0.0063643875,"about_ca_system_score_codex":0.001325141,"about_ca_system_score_gemma":0.00069902634,"threshold_uncertainty_score":0.021290958},"labels":[],"label_agreement":null},{"id":"W2123879058","doi":"10.1109/isit.2006.262113","title":"On the Shannon Covers of Certain Irreducible Constrained Systems of Finite Type","year":2006,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Cover (algebra); Presentation (obstetrics); FTCS scheme; Mathematics; Type (biology); Automaton; Discrete mathematics; Computer science; Theoretical computer science; Ordinary differential equation; Differential equation; Mathematical analysis; Engineering","score_opus":0.014173927031049418,"score_gpt":0.21521488661426388,"score_spread":0.20104095958321447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123879058","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8054298,0.00024974247,0.1677855,0.00029260278,0.000029075021,0.000055357952,0.00019073258,0.00023818598,0.025728967],"genre_scores_gemma":[0.9846363,0.0001061372,0.011881794,0.000044246255,0.000040143812,0.00006820479,0.00013035205,0.000041430598,0.0030515175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893636,0.00025965495,0.000054767832,0.00011969584,0.0003754392,0.00025407],"domain_scores_gemma":[0.99776447,0.0014076201,0.0002602862,0.00022203114,0.00016879886,0.00017683054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075959926,0.0004304297,0.0005653999,0.0012674219,0.0012750219,0.0015171444,0.00047521447,0.00066884095,0.0039412417],"category_scores_gemma":[0.0038110674,0.00042449392,0.000871254,0.00080063957,0.0019289945,0.0021955883,0.001721945,0.0012050271,0.00027735796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016477161,0.000035554625,0.0013164663,0.0000899734,0.000030579988,0.0005817328,0.0014029162,0.02163697,0.009330089,0.95243365,0.0005402926,0.0124368975],"study_design_scores_gemma":[0.000026772479,0.00010510078,0.0014402879,0.000036912,0.000036856247,0.00044102172,0.00038321034,0.07919614,0.007854202,0.90725327,0.0031668826,0.00005930016],"about_ca_topic_score_codex":0.00075084646,"about_ca_topic_score_gemma":0.00069626316,"teacher_disagreement_score":0.0039412417,"about_ca_system_score_codex":0.0010463494,"about_ca_system_score_gemma":0.000546583,"threshold_uncertainty_score":0.013184726},"labels":[],"label_agreement":null},{"id":"W2124322517","doi":"10.1112/s0010437x1200022x","title":"Quivers of monoids with basic algebras","year":2012,"lang":"en","type":"article","venue":"Compositio Mathematica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; City University of New York","keywords":"Quiver; Mathematics; Monoid; Semigroup; Algebraically closed field; Pure mathematics; Bicyclic semigroup; Cartan matrix; Field (mathematics); Representation theory; Class (philosophy); Computation; Group (periodic table); Algebra over a field; Algebra representation; Non-associative algebra","score_opus":0.01029314512718816,"score_gpt":0.21637504301014132,"score_spread":0.20608189788295317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124322517","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83596987,0.000372766,0.13660526,0.0002843281,0.00008859932,0.00012180002,0.0003313327,0.00059032906,0.025635604],"genre_scores_gemma":[0.96009344,0.00011337591,0.032687772,0.00007633069,0.000037660306,0.000036194702,0.00036591,0.00008213522,0.006507313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995165,0.00009943177,0.00003589207,0.000103296974,0.0001423804,0.000102538484],"domain_scores_gemma":[0.99903214,0.00040912873,0.00007785263,0.00010275117,0.00023101845,0.00014702798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076143246,0.00030979427,0.00050765154,0.0015640447,0.0011827,0.0027584985,0.0007641798,0.0005088443,0.008741916],"category_scores_gemma":[0.002978201,0.00032096406,0.00071474735,0.0010204415,0.0013547047,0.0032815805,0.0011365202,0.0006342376,0.00068024825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018002816,0.000093619965,0.0070869587,0.00015953262,0.000050918257,0.0005071162,0.00080218696,0.015535844,0.005479504,0.936516,0.0026521964,0.030936157],"study_design_scores_gemma":[0.000024395853,0.0000841309,0.0017398422,0.000050540173,0.00004549082,0.0002610118,0.00037284527,0.07896024,0.009522327,0.89891297,0.009993227,0.0000329385],"about_ca_topic_score_codex":0.0018507114,"about_ca_topic_score_gemma":0.0025310789,"teacher_disagreement_score":0.008741916,"about_ca_system_score_codex":0.0011098402,"about_ca_system_score_gemma":0.0005328732,"threshold_uncertainty_score":0.029244602},"labels":[],"label_agreement":null},{"id":"W2125204297","doi":"10.1016/j.tcs.2010.12.034","title":"Two infinite families of polyominoes that tile the plane by translation in two distinct ways","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Polyomino; Tile; Plane (geometry); Focus (optics); Mathematics; Translation (biology); Fibonacci number; Combinatorics; Fractal; Geometry; Mathematical analysis; Physics; Optics","score_opus":0.012861044561188799,"score_gpt":0.2507726794940887,"score_spread":0.2379116349328999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125204297","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7384198,0.0008991187,0.18706581,0.0011806019,0.00032212146,0.00008452212,0.00036347966,0.00037410491,0.07129054],"genre_scores_gemma":[0.94014853,0.0002936038,0.034994476,0.0002095568,0.00006829564,0.00020954182,0.00045128714,0.00016372898,0.023460988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993204,0.00010863554,0.000040455354,0.00017420859,0.00019527803,0.0001610186],"domain_scores_gemma":[0.99814606,0.00090794463,0.00024288936,0.00025345632,0.00015575519,0.0002939539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004115006,0.00049426017,0.00054110336,0.0010146478,0.002318436,0.0029017916,0.0009077715,0.0012720423,0.005061792],"category_scores_gemma":[0.002564186,0.0006924615,0.00085478614,0.0007824099,0.003136684,0.0027463627,0.0018119566,0.0016509946,0.00044657392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000391927,0.000063259664,0.001140817,0.00008572887,0.000021769247,0.00091432524,0.0015997951,0.0023179587,0.00912838,0.9709465,0.0017185259,0.011670952],"study_design_scores_gemma":[0.0002247787,0.0001332311,0.0029305168,0.000108505934,0.000056113277,0.0018700103,0.0019881318,0.023311626,0.010086092,0.93496066,0.024227615,0.00010272353],"about_ca_topic_score_codex":0.00066677,"about_ca_topic_score_gemma":0.0008684514,"teacher_disagreement_score":0.005061792,"about_ca_system_score_codex":0.00085103913,"about_ca_system_score_gemma":0.0004602206,"threshold_uncertainty_score":0.016933441},"labels":[],"label_agreement":null},{"id":"W2125388232","doi":"10.1109/icsmc.1993.384935","title":"On modelling non-stationary random environments using switching techniques","year":2002,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Automaton; Markov chain; Computer science; Learning automata; Continuous-time Markov chain; Stochastic matrix; Stationary distribution; State (computer science); Chain (unit); Theoretical computer science; Stochastic process; Markov process; Artificial intelligence; Markov model; Mathematics; Algorithm; Markov property; Machine learning","score_opus":0.02515297446667359,"score_gpt":0.2244084694841082,"score_spread":0.19925549501743461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125388232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006360783,0.0005241056,0.9888376,0.00021658238,0.00004368378,0.000030596668,0.000034061675,0.00013773773,0.0038148065],"genre_scores_gemma":[0.49361652,0.0041120974,0.48601246,0.0004590214,0.0004572938,0.00053900696,0.00034595694,0.00027172707,0.014185952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858487,0.0006962564,0.0000795364,0.0002527647,0.0002658122,0.00012078947],"domain_scores_gemma":[0.99610484,0.0030301106,0.00028649112,0.000313059,0.0001532209,0.00011225886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016972714,0.0010740708,0.001119196,0.0010449203,0.0006134456,0.001530963,0.0015491741,0.001610362,0.0032696135],"category_scores_gemma":[0.0042286166,0.00054472336,0.0017612444,0.0011616079,0.0030860002,0.0037472642,0.0016540705,0.0018036437,0.00075406604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035719015,0.00005037198,0.00045841362,0.00013049308,0.000051713327,0.00016205193,0.0003768911,0.27728534,0.00198742,0.70015997,0.0006815283,0.01862002],"study_design_scores_gemma":[0.000014101404,0.00005368579,0.00011102207,0.000028057659,0.000016199518,0.000070133014,0.000031721775,0.51970536,0.0005695611,0.4753095,0.004068894,0.000021740829],"about_ca_topic_score_codex":0.001479161,"about_ca_topic_score_gemma":0.0013673778,"teacher_disagreement_score":0.0032696135,"about_ca_system_score_codex":0.00092876353,"about_ca_system_score_gemma":0.00072863454,"threshold_uncertainty_score":0.010937929},"labels":[],"label_agreement":null},{"id":"W2126071774","doi":"10.1090/proc/12848","title":"An unusual continued fraction","year":2015,"lang":"en","type":"preprint","venue":"Proceedings of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Sigma; Conjecture; Fraction (chemistry); Mathematics; Quotient; Transcendental number; Continued fraction; Combinatorics; Logarithm; Physics; Mathematical analysis; Arithmetic; Quantum mechanics","score_opus":0.018003505059312006,"score_gpt":0.28150130431641984,"score_spread":0.2634977992571078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126071774","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06501458,0.002789808,0.2654782,0.008225724,0.005467529,0.00014589263,0.0009935185,0.0030096339,0.6488751],"genre_scores_gemma":[0.68723416,0.001519785,0.08825512,0.0032663622,0.002223237,0.0002902212,0.0008791605,0.0049605514,0.21137139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914277,0.00016181087,0.000041952073,0.0002087112,0.00026527833,0.00017950639],"domain_scores_gemma":[0.99908245,0.0003482967,0.000078895726,0.00016534881,0.00023752575,0.00008761356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073057367,0.0011028433,0.00072114274,0.0020394525,0.0026268647,0.003430442,0.00093086803,0.0013302256,0.041516148],"category_scores_gemma":[0.0061742445,0.00040048143,0.0011899162,0.001149501,0.002619716,0.0049463944,0.0019296325,0.002282764,0.010611997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060241015,0.000018822106,0.0003139376,0.0000788133,0.000008870471,0.00051396206,0.00040628947,0.00056089525,0.0014339861,0.9652846,0.013815159,0.017504383],"study_design_scores_gemma":[0.00002862617,0.000032693697,0.0004012468,0.00008680239,0.000017591003,0.0007523877,0.00020482496,0.007070323,0.0026009497,0.8678487,0.12091442,0.0000413829],"about_ca_topic_score_codex":0.002665632,"about_ca_topic_score_gemma":0.0022696091,"teacher_disagreement_score":0.041516148,"about_ca_system_score_codex":0.0021093003,"about_ca_system_score_gemma":0.00090378907,"threshold_uncertainty_score":0.13888538},"labels":[],"label_agreement":null},{"id":"W2126946720","doi":"10.1142/s0218196708004913","title":"EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM","year":2008,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Variety (cybernetics); Mathematics; Signature (topology); Function (biology); Algebra over a field; Finite-state machine; Discrete mathematics; Pure mathematics; Algorithm","score_opus":0.04422240327387793,"score_gpt":0.2675585111768122,"score_spread":0.22333610790293423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126946720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46141824,0.0012633664,0.48556858,0.007879346,0.00014559492,0.00013383495,0.0005538028,0.00036314322,0.042674117],"genre_scores_gemma":[0.9550781,0.0003748525,0.038498756,0.00024364267,0.00032906773,0.00011325424,0.00041770167,0.00007864278,0.0048658503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99469936,0.0015211134,0.00034186477,0.0012992539,0.001531854,0.0006065514],"domain_scores_gemma":[0.94952154,0.04152457,0.0019075193,0.0031720106,0.0025423428,0.0013320327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046060774,0.00045611907,0.0010852612,0.0017885274,0.0022603343,0.007136316,0.00235414,0.0019992352,0.0053871707],"category_scores_gemma":[0.037357006,0.0005849476,0.0015211145,0.0023146868,0.0074476856,0.022327477,0.004488453,0.0055522863,0.0006072802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007194095,0.00004260491,0.0019081645,0.000075316784,0.00002032139,0.00008566533,0.00057568046,0.00952247,0.0007578971,0.9742639,0.000987792,0.011688099],"study_design_scores_gemma":[0.000006650325,0.00000861654,0.00039796095,0.0000090708045,0.000008409541,0.00006470805,0.00008616495,0.028763462,0.0008607449,0.96884537,0.0009339489,0.000014935046],"about_ca_topic_score_codex":0.0011882778,"about_ca_topic_score_gemma":0.00067855057,"teacher_disagreement_score":0.007136316,"about_ca_system_score_codex":0.0030929572,"about_ca_system_score_gemma":0.0014176996,"threshold_uncertainty_score":0.024359584},"labels":[],"label_agreement":null},{"id":"W2127978939","doi":"10.1016/j.jalgebra.2012.07.013","title":"Bifix codes and Sturmian words","year":2012,"lang":"en","type":"preprint","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Alphabet; Word (group theory); Mathematics; Degree (music); Code (set theory); Combinatorics; Set (abstract data type); Discrete mathematics; Arithmetic; Linguistics; Computer science; Physics","score_opus":0.015545204969675857,"score_gpt":0.2516857723966816,"score_spread":0.23614056742700576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127978939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60873944,0.0039691306,0.26263437,0.0058541223,0.0013133911,0.00007362867,0.00079085457,0.0008462675,0.11577883],"genre_scores_gemma":[0.9501958,0.00082171237,0.026238065,0.00071108394,0.00061860547,0.000086476284,0.0004187968,0.0001440096,0.020765388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913955,0.00019510069,0.000059486916,0.00019565258,0.00024836118,0.00016189106],"domain_scores_gemma":[0.99814487,0.0008964538,0.00020973622,0.00022128593,0.00032574765,0.00020189284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084615767,0.00061873964,0.00090623973,0.0025303625,0.0025392058,0.0032476084,0.0008060437,0.0017618496,0.0066239215],"category_scores_gemma":[0.0033817673,0.0005157969,0.0006677725,0.0021415306,0.003009253,0.0038959698,0.0016947597,0.0024582772,0.0010995729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025959194,0.000007457469,0.00014734751,0.000014593694,0.0000024136716,0.00005480347,0.00017042624,0.00033003066,0.00033318932,0.9945381,0.00069893384,0.003676704],"study_design_scores_gemma":[0.0000052713062,0.0000051879492,0.000053806303,0.0000054910015,0.0000023668927,0.000046604393,0.000034894627,0.0012684116,0.00019296806,0.9970644,0.0013133626,0.0000071482627],"about_ca_topic_score_codex":0.00093611155,"about_ca_topic_score_gemma":0.0009899989,"teacher_disagreement_score":0.0066239215,"about_ca_system_score_codex":0.001304539,"about_ca_system_score_gemma":0.000677232,"threshold_uncertainty_score":0.022159219},"labels":[],"label_agreement":null},{"id":"W2128534664","doi":"10.4230/lipics.mfcs.2017.24","title":"Better Complexity Bounds for Cost Register Automata","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft; Natural Sciences and Engineering Research Council of Canada; McGill University; National Science Foundation","keywords":"Nondeterministic algorithm; Parameterized complexity; Computer science; Finite-state machine; Automaton; Theory of computation; Theoretical computer science; Nondeterministic finite automaton; Automata theory; Mathematics; Algorithm","score_opus":0.19704830979027357,"score_gpt":0.21352947838471356,"score_spread":0.016481168594439988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128534664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32625324,0.0064347177,0.50712466,0.02368922,0.00086630427,0.0002754308,0.0025375036,0.002667264,0.13015172],"genre_scores_gemma":[0.91515106,0.001715418,0.06332113,0.0014288826,0.0010737417,0.00030754635,0.0013331771,0.00067223073,0.014996813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940037,0.0011714323,0.00033063628,0.0015309302,0.0020728856,0.00089034793],"domain_scores_gemma":[0.9599516,0.029830992,0.0013179252,0.0060576065,0.0017520286,0.001089882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038649144,0.0010894488,0.0014658106,0.002205495,0.0015726755,0.006934309,0.002763623,0.0021002637,0.015663583],"category_scores_gemma":[0.025340095,0.0006799997,0.0027079233,0.0021100151,0.003840841,0.01974069,0.0046277167,0.008555123,0.0017957987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002608459,0.000116135896,0.0013579093,0.00026338434,0.000040375584,0.000090697045,0.00039239362,0.02258723,0.0030390222,0.94889396,0.0058066067,0.017151436],"study_design_scores_gemma":[0.00003238782,0.000051142415,0.000478357,0.00004046188,0.00003689775,0.00007440844,0.00008625326,0.09174505,0.002005499,0.8997364,0.0056807003,0.000032313586],"about_ca_topic_score_codex":0.0023610294,"about_ca_topic_score_gemma":0.0023526005,"teacher_disagreement_score":0.015663583,"about_ca_system_score_codex":0.005623934,"about_ca_system_score_gemma":0.002044415,"threshold_uncertainty_score":0.052399933},"labels":[],"label_agreement":null},{"id":"W2129329247","doi":"10.1007/s00012-004-1823-y","title":"Semigroups that are factors of subdirectly irreducible semigroups by their monolith","year":2004,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; Wilfrid Laurier University","funders":"","keywords":"Semigroup; Mathematics; Intersection (aeronautics); Ideal (ethics); Pure mathematics; Semilattice; Monolith; Binary number; Binary operation; Algebra over a field; Discrete mathematics; Arithmetic; Chemistry","score_opus":0.011979141763910595,"score_gpt":0.18864766927466084,"score_spread":0.17666852751075024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129329247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47324204,0.0017248074,0.44480827,0.000620329,0.00039261844,0.00025473797,0.00062406936,0.00234794,0.07598524],"genre_scores_gemma":[0.9049895,0.0005144874,0.056999106,0.00021012475,0.00035277946,0.0001913016,0.0007226756,0.00030460226,0.035715483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988913,0.00015402671,0.00007558428,0.00036092714,0.0002897604,0.00022846796],"domain_scores_gemma":[0.99773896,0.00072802504,0.00030570952,0.0004317153,0.00035267312,0.00044302034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011326056,0.0006707592,0.0008882449,0.0011925753,0.0013558296,0.003452126,0.000647772,0.00074865017,0.008000026],"category_scores_gemma":[0.003004513,0.0008031383,0.0010129315,0.00079491286,0.0026825964,0.0048162667,0.0019176973,0.0014175788,0.0017831511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018127332,0.00008681762,0.0009234357,0.000070553346,0.00003886343,0.0003610084,0.0010939529,0.0006337983,0.011689258,0.97240686,0.0010417528,0.011472469],"study_design_scores_gemma":[0.00007772173,0.00012537188,0.0017138632,0.000045876426,0.000087400054,0.00083260954,0.0005739683,0.008805767,0.010450213,0.9554852,0.021758,0.00004389306],"about_ca_topic_score_codex":0.00031174615,"about_ca_topic_score_gemma":0.0005535315,"teacher_disagreement_score":0.008000026,"about_ca_system_score_codex":0.0005190357,"about_ca_system_score_gemma":0.0006713908,"threshold_uncertainty_score":0.026762724},"labels":[],"label_agreement":null},{"id":"W2129749965","doi":"10.1016/j.tcs.2010.09.006","title":"On the complexity of deciding avoidability of sets of partial words","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Combinatorics on words; Set (abstract data type); Word (group theory); Alphabet; Space (punctuation); Discrete mathematics; Decidability; Finite set; Polynomial; De Bruijn sequence; Time complexity; Upper and lower bounds; Existential quantification; Computer science","score_opus":0.025403499655608456,"score_gpt":0.2698010805531539,"score_spread":0.24439758089754543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129749965","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78214204,0.0016139486,0.16273008,0.017722962,0.00036018246,0.0005397255,0.0038069217,0.001611338,0.0294728],"genre_scores_gemma":[0.94275665,0.0007375228,0.04451127,0.0009423399,0.00063334644,0.00030633263,0.003924417,0.00042405617,0.0057641007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9873871,0.0037686436,0.0010658756,0.0024522375,0.003484279,0.0018418769],"domain_scores_gemma":[0.7628587,0.21983285,0.0050839633,0.006088544,0.0028230723,0.003312882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069900397,0.0014302799,0.0036688538,0.0021907361,0.0039237347,0.014057222,0.0053836866,0.004445937,0.015265959],"category_scores_gemma":[0.06360253,0.0020280434,0.004911249,0.0037877294,0.007270552,0.027726384,0.006919493,0.0089491885,0.0009775488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008064088,0.0015768434,0.019048132,0.002271704,0.001028234,0.0017254348,0.0045420025,0.26564777,0.009796284,0.5659232,0.022064198,0.09831208],"study_design_scores_gemma":[0.0004432144,0.00014024744,0.0015905091,0.000055917935,0.00019680185,0.00029767817,0.0006617212,0.2036054,0.0018750306,0.7896697,0.0013852413,0.00007852246],"about_ca_topic_score_codex":0.009719081,"about_ca_topic_score_gemma":0.011645588,"teacher_disagreement_score":0.015265959,"about_ca_system_score_codex":0.0065098642,"about_ca_system_score_gemma":0.005929846,"threshold_uncertainty_score":0.051069736},"labels":[],"label_agreement":null},{"id":"W2129836340","doi":"10.1344/cm.v55i3.4061","title":"On equivalent conditions to quasi-perfectness of abelian *-semigroups","year":2004,"lang":"en","type":"article","venue":"Collectanea mathematica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Abelian group; Semigroup; Pure mathematics; Moment (physics); Function (biology); Measure (data warehouse); Set (abstract data type); Discrete mathematics; Combinatorics; Algebra over a field","score_opus":0.013708513478281626,"score_gpt":0.2629432933670337,"score_spread":0.2492347798887521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129836340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62785333,0.0015852725,0.21993376,0.0057620187,0.0011469441,0.00022293851,0.001632694,0.0009656203,0.1408974],"genre_scores_gemma":[0.97458434,0.00040123673,0.015632166,0.0006053643,0.00064477086,0.000121404206,0.0010122504,0.0001530367,0.00684539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959461,0.0010666243,0.0005596058,0.0009249431,0.00074878254,0.0007539172],"domain_scores_gemma":[0.9784814,0.013038474,0.0011989934,0.0019962692,0.0027823965,0.0025024728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053952606,0.0008104912,0.0015014661,0.0028645003,0.003586149,0.0060044406,0.0018459168,0.0023182353,0.012958268],"category_scores_gemma":[0.015148375,0.0013866865,0.0023668772,0.0019607672,0.007453849,0.014719558,0.00521791,0.0042318325,0.0011185793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014050874,0.00004215817,0.00048958237,0.00004963185,0.000020008476,0.00021342596,0.0005491838,0.0003700153,0.0011575231,0.9946115,0.00056722475,0.0017892122],"study_design_scores_gemma":[0.00006860575,0.000057866953,0.00062416523,0.000023734898,0.000026023696,0.00023496407,0.00043168417,0.0019938452,0.0010658186,0.9931185,0.0023268345,0.000027859425],"about_ca_topic_score_codex":0.0008862545,"about_ca_topic_score_gemma":0.00093467894,"teacher_disagreement_score":0.012958268,"about_ca_system_score_codex":0.0017464368,"about_ca_system_score_gemma":0.0013269186,"threshold_uncertainty_score":0.043349683},"labels":[],"label_agreement":null},{"id":"W2131311370","doi":"10.1017/s0013091508000473","title":"Independence algebras, basis algebras and semigroups of quotients","year":2010,"lang":"en","type":"article","venue":"Proceedings of the Edinburgh Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada; Universidade de Lisboa; Wilfrid Laurier University","keywords":"Endomorphism; Mathematics; Basis (linear algebra); Quotient; Monoid; Rank (graph theory); Independence (probability theory); Pure mathematics; Distributivity; Algebra over a field; Combinatorics; Distributive property","score_opus":0.007348634326920981,"score_gpt":0.2178260721708983,"score_spread":0.21047743784397732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131311370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73830676,0.0008511224,0.20990506,0.0007935927,0.00015966491,0.00013081488,0.00038961667,0.00056152866,0.04890178],"genre_scores_gemma":[0.97980314,0.00016894413,0.013489552,0.000057017583,0.00010540019,0.00004600327,0.00024042872,0.000037566257,0.00605196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987337,0.000296123,0.000089372,0.00020031985,0.0004833806,0.00019704047],"domain_scores_gemma":[0.99751616,0.00071214203,0.00027489057,0.00039034034,0.0005500278,0.0005564679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016735205,0.00028174784,0.0005255906,0.0009617579,0.001307355,0.0021912062,0.00056265516,0.00034478874,0.003755965],"category_scores_gemma":[0.0028380936,0.0002567128,0.0006781957,0.00051949424,0.002874095,0.0035920867,0.0017567597,0.0011808481,0.00063685124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009653907,0.000071013805,0.00081358623,0.00004070442,0.000012487789,0.00020235352,0.00049783045,0.001097519,0.004783552,0.9844823,0.0006130475,0.0072890706],"study_design_scores_gemma":[0.00003291494,0.000053569584,0.0006952265,0.000010610749,0.000013573736,0.0002452918,0.00020417372,0.010044403,0.0039847842,0.9808873,0.0038089023,0.000019292536],"about_ca_topic_score_codex":0.0012725808,"about_ca_topic_score_gemma":0.0009877726,"teacher_disagreement_score":0.003755965,"about_ca_system_score_codex":0.000730123,"about_ca_system_score_gemma":0.00077432184,"threshold_uncertainty_score":0.012564957},"labels":[],"label_agreement":null},{"id":"W2131975287","doi":"10.1137/100795425","title":"Nested Recurrence Relations with Conolly-like Solutions","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Fibonacci number; Sequence (biology); BETA (programming language); Integer (computer science); Discrete mathematics","score_opus":0.026111741299510324,"score_gpt":0.25227672015041924,"score_spread":0.22616497885090892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131975287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39488888,0.0012982299,0.4679482,0.0015799585,0.00048821428,0.0003393314,0.00066903286,0.0012564344,0.13153173],"genre_scores_gemma":[0.81554216,0.00046252625,0.1417001,0.0006941547,0.00017102476,0.00039742648,0.00073948357,0.00030596874,0.039987147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988444,0.00024034124,0.0001287598,0.00028110205,0.00025202995,0.00025337545],"domain_scores_gemma":[0.9980428,0.000875975,0.00032413183,0.00019182026,0.0004095859,0.00015560025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006250464,0.0005365591,0.0004925782,0.0009774622,0.0016699662,0.0018850189,0.00080839475,0.0010717624,0.010208977],"category_scores_gemma":[0.006964986,0.00040604535,0.0007804567,0.0010913471,0.0016842328,0.002316534,0.0013562532,0.0017296497,0.0015679148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004605476,0.000037082486,0.0007956802,0.00009769935,0.000009647233,0.0005749694,0.0010010401,0.0038227246,0.00569328,0.9669531,0.0028769614,0.018091679],"study_design_scores_gemma":[0.000048562633,0.00007415383,0.0005493937,0.000089861875,0.000035827277,0.00092952594,0.0006219091,0.036296517,0.00946623,0.92621887,0.025592694,0.000076329175],"about_ca_topic_score_codex":0.0026479496,"about_ca_topic_score_gemma":0.0054687276,"teacher_disagreement_score":0.010208977,"about_ca_system_score_codex":0.0015273802,"about_ca_system_score_gemma":0.00092856225,"threshold_uncertainty_score":0.03415239},"labels":[],"label_agreement":null},{"id":"W2132962549","doi":"10.1016/j.disc.2011.07.029","title":"A pattern sequence approach to Stern’s sequence","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Sequence (biology); Complement (music); Base (topology); Word (group theory); Integer (computer science); Binary number; Discrete mathematics; Arithmetic; Geometry","score_opus":0.09206309257501788,"score_gpt":0.2726519713867397,"score_spread":0.1805888788117218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132962549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017443592,0.0004419388,0.9229342,0.0009437819,0.0004403265,0.00006375247,0.00011982237,0.0002490007,0.057363555],"genre_scores_gemma":[0.47816706,0.0013522389,0.41924697,0.0009427697,0.0008147981,0.00027785607,0.00034406292,0.0005129198,0.09834151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999382,0.00017554857,0.00005121101,0.00014123574,0.00018890637,0.00006102251],"domain_scores_gemma":[0.9990871,0.00029957504,0.000059792168,0.0001978877,0.000261211,0.000094415096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082602346,0.0005687995,0.00057938416,0.0016046048,0.0011488721,0.0018231388,0.0010877055,0.0010403066,0.0124870585],"category_scores_gemma":[0.0029097176,0.0003310507,0.0007720554,0.0016117478,0.002212746,0.0053344085,0.0016103121,0.0017400135,0.0028938171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008423307,0.00000532617,0.00004010278,0.000012149407,0.0000020261064,0.000027633507,0.000112931135,0.00042074954,0.0005098944,0.9910864,0.00053148676,0.0072428626],"study_design_scores_gemma":[0.0000043087593,0.000017200358,0.00003917889,0.0000072176385,0.0000030263654,0.00008142362,0.000047257457,0.0058534704,0.00049915776,0.98242074,0.011020483,0.0000064582964],"about_ca_topic_score_codex":0.0007371162,"about_ca_topic_score_gemma":0.00055177615,"teacher_disagreement_score":0.0124870585,"about_ca_system_score_codex":0.0009009869,"about_ca_system_score_gemma":0.00068274,"threshold_uncertainty_score":0.04177338},"labels":[],"label_agreement":null},{"id":"W2133087912","doi":"10.46298/dmtcs.397","title":"On the critical exponent of generalized Thue-Morse words","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Infimum and supremum; Exponent; Mathematics; Morse code; Set (abstract data type); Critical exponent; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.01614136682013868,"score_gpt":0.2813352824947019,"score_spread":0.26519391567456324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133087912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9482401,0.0006542462,0.043795414,0.00019419748,0.000036332058,0.000031578424,0.00008184527,0.00012516002,0.0068412498],"genre_scores_gemma":[0.986684,0.00024226755,0.011752184,0.00003371872,0.000050362592,0.000024958721,0.00007059196,0.000037404177,0.0011045125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997546,0.000041247462,0.000021819147,0.00005657168,0.00005619089,0.00006966882],"domain_scores_gemma":[0.99839824,0.00093443075,0.00019073497,0.000117782605,0.0002026102,0.00015621528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057938613,0.000488957,0.00064412283,0.0019912159,0.0007614455,0.0020211278,0.0004598351,0.0004378381,0.0021556662],"category_scores_gemma":[0.004149462,0.0002167903,0.0004786439,0.00081458624,0.0023148982,0.0027771508,0.0010926994,0.00075096986,0.00026958916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042633727,0.000052202195,0.009580777,0.00018060798,0.000030889278,0.0013483843,0.0020016013,0.01641551,0.017222492,0.93083304,0.0008263704,0.02108184],"study_design_scores_gemma":[0.000043427484,0.00006628162,0.001942766,0.000069825175,0.000029481991,0.000509486,0.0004971508,0.08005125,0.007910257,0.90562904,0.0032083762,0.00004266097],"about_ca_topic_score_codex":0.00093471276,"about_ca_topic_score_gemma":0.00089680817,"teacher_disagreement_score":0.0021556662,"about_ca_system_score_codex":0.00076527335,"about_ca_system_score_gemma":0.00030282323,"threshold_uncertainty_score":0.007211387},"labels":[],"label_agreement":null},{"id":"W2133379784","doi":"10.1090/s0002-9939-09-09857-8","title":"On the irreducible representations of a finite semigroup","year":2009,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Vetenskapsrådet; Swedish Foundation for International Cooperation in Research and Higher Education","keywords":"Mathematics; Semigroup; Isomorphism (crystallography); Lemma (botany); Irreducible representation; Simple (philosophy); Parameterized complexity; Pure mathematics; Ring (chemistry); (g,K)-module; Algebra over a field; Combinatorics","score_opus":0.0136250332330557,"score_gpt":0.25862107988260713,"score_spread":0.24499604664955144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133379784","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42503503,0.0063513895,0.33712378,0.0037546747,0.0006411927,0.000074595955,0.00026652776,0.0003401794,0.22641256],"genre_scores_gemma":[0.94984895,0.0017118936,0.030116733,0.00036761662,0.0005902244,0.000046427747,0.0001372015,0.0000713551,0.017109593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993876,0.00019821963,0.000033226694,0.000120030156,0.00015481989,0.00010604358],"domain_scores_gemma":[0.99916136,0.00041464844,0.000070057955,0.00015464098,0.00010631208,0.000092911614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013305431,0.00048520137,0.0004358416,0.0012847278,0.0010970075,0.0019173804,0.00049205194,0.0006026007,0.0023167965],"category_scores_gemma":[0.0026818146,0.00028880103,0.0007630083,0.00078735524,0.004606429,0.003946175,0.0020426258,0.0017379599,0.00040838966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065013965,0.000003894524,0.00003917831,0.000007926546,0.0000011429119,0.000022676115,0.00021835096,0.0002568219,0.00037466225,0.99688953,0.00016373066,0.0020155634],"study_design_scores_gemma":[0.000004539389,0.000011883727,0.00008223367,0.000011238601,0.0000027859965,0.00005783853,0.000045306726,0.0013069932,0.00046414952,0.99349445,0.0045128474,0.0000058789174],"about_ca_topic_score_codex":0.0005662285,"about_ca_topic_score_gemma":0.00027788442,"teacher_disagreement_score":0.0023167965,"about_ca_system_score_codex":0.0010561494,"about_ca_system_score_gemma":0.000578536,"threshold_uncertainty_score":0.0077504516},"labels":[],"label_agreement":null},{"id":"W2134684788","doi":"10.1109/sct.1990.113968","title":"Extensions to Barrington's M-program model","year":2002,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Nondeterministic algorithm; Monoid; Abelian group; Logarithm; Polynomial; Computer science; Algebra over a field; Space (punctuation); Theoretical computer science; Computation; Discrete mathematics; Mathematics; Programming language; Pure mathematics","score_opus":0.030752279288144422,"score_gpt":0.250632414631065,"score_spread":0.21988013534292059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134684788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18511246,0.0006129909,0.7095883,0.0018687556,0.00012216989,0.00019647442,0.000627084,0.0011961324,0.100675695],"genre_scores_gemma":[0.86251837,0.00027706914,0.11027163,0.0003594741,0.0000714036,0.00023782095,0.00037815268,0.00012225778,0.025763812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994155,0.0001313441,0.000032892753,0.00017168903,0.00015086893,0.00009775393],"domain_scores_gemma":[0.99909115,0.00033650044,0.0000637324,0.00029196782,0.000103240316,0.000113385366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006923506,0.00031054774,0.00033996103,0.00049904746,0.0009013819,0.0014062204,0.0014063449,0.0008119058,0.0056217024],"category_scores_gemma":[0.0019573877,0.00023579539,0.00090342824,0.00069264765,0.0015360344,0.004213993,0.0021283086,0.0018567637,0.0007244346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006341044,0.000031996107,0.00042115085,0.000029603727,0.0000049195487,0.00021531986,0.00035062621,0.007852179,0.0016384319,0.98052007,0.0012559994,0.007616329],"study_design_scores_gemma":[0.000034533994,0.000060498176,0.00029263418,0.00002457971,0.000012305646,0.00022142443,0.00015827404,0.114646055,0.002810655,0.8586104,0.02310824,0.000020424766],"about_ca_topic_score_codex":0.003594796,"about_ca_topic_score_gemma":0.0037654906,"teacher_disagreement_score":0.0056217024,"about_ca_system_score_codex":0.0015019637,"about_ca_system_score_gemma":0.0011025391,"threshold_uncertainty_score":0.018806458},"labels":[],"label_agreement":null},{"id":"W2134765710","doi":"10.48550/arxiv.1103.2147","title":"Beta Expansions for Regular Pisot Numbers","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Rogers Communications (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Mathematics; Base (topology); Conjecture; Integer (computer science); Combinatorics; BETA (programming language); Representation (politics); Variety (cybernetics); Series (stratigraphy); Discrete mathematics; Computer science; Mathematical analysis; Statistics","score_opus":0.08249476611587321,"score_gpt":0.18695021517599886,"score_spread":0.10445544906012565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134765710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7053037,0.0028324495,0.11797276,0.0019464132,0.00045452022,0.00006218461,0.00048463824,0.0007431584,0.17020021],"genre_scores_gemma":[0.96520543,0.0008584423,0.02091654,0.00027798483,0.00028850298,0.00006346145,0.00021076472,0.00009373773,0.012085091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996513,0.00005562867,0.000019779516,0.00008497159,0.00010420125,0.00008418733],"domain_scores_gemma":[0.9992774,0.00039308355,0.00009045116,0.00009273313,0.00007139476,0.000074980286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033179953,0.00030927785,0.00027799307,0.0009885856,0.0009121365,0.001173536,0.00025113436,0.00047193153,0.0056915847],"category_scores_gemma":[0.0022265087,0.00022642897,0.00041436788,0.0007644646,0.0017335314,0.0018406494,0.00084529456,0.0011807161,0.00094287744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005252316,0.000008901469,0.00056740077,0.000045307595,0.0000027811627,0.00023585603,0.00052409054,0.0006830334,0.0038960439,0.9748038,0.001693349,0.017486753],"study_design_scores_gemma":[0.000014018078,0.000039910294,0.00087409315,0.00004344547,0.000007953481,0.0008340719,0.0002823105,0.0036510725,0.0028009661,0.9700577,0.021369481,0.000024926445],"about_ca_topic_score_codex":0.00025656648,"about_ca_topic_score_gemma":0.0002576038,"teacher_disagreement_score":0.0056915847,"about_ca_system_score_codex":0.00047859893,"about_ca_system_score_gemma":0.00021575473,"threshold_uncertainty_score":0.019040287},"labels":[],"label_agreement":null},{"id":"W2136210216","doi":"10.37236/1571","title":"A One&amp;ndash;Sided Zimin Construction","year":2001,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Abelian group; Substring; Combinatorics; Square (algebra); Alphabet; String (physics); Discrete mathematics; Geometry; Computer science; Linguistics; Data structure","score_opus":0.01286402042136128,"score_gpt":0.22879972740132148,"score_spread":0.2159357069799602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136210216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119157605,0.000793038,0.7634265,0.0010519876,0.0008128108,0.00031779276,0.0013251067,0.0028889729,0.11022618],"genre_scores_gemma":[0.56486106,0.00070314074,0.36788392,0.00062289764,0.00016470789,0.00056885736,0.0015604472,0.0007180497,0.06291692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938595,0.00006670334,0.000046843747,0.00020401063,0.00016649067,0.00013011943],"domain_scores_gemma":[0.9995196,0.00010546463,0.000068485984,0.00017233012,0.00008256347,0.000051600033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045674783,0.00046119484,0.000544516,0.00079400855,0.0011042604,0.0010619628,0.0014010279,0.0006156769,0.0137155205],"category_scores_gemma":[0.0010928113,0.00052583916,0.0009087447,0.0008510379,0.0012226601,0.0023247965,0.002768729,0.0013145806,0.0042455043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004685294,0.000118591764,0.0011248155,0.00042639548,0.000052983978,0.00030418206,0.0006582823,0.0023421994,0.08315664,0.7492055,0.009302518,0.15283927],"study_design_scores_gemma":[0.0001771607,0.00043245652,0.0021997076,0.00012336888,0.00018291902,0.0012050192,0.00032402627,0.027738769,0.19565594,0.49606583,0.27568445,0.00021028565],"about_ca_topic_score_codex":0.00031624842,"about_ca_topic_score_gemma":0.0005200184,"teacher_disagreement_score":0.0137155205,"about_ca_system_score_codex":0.0006831758,"about_ca_system_score_gemma":0.00056608336,"threshold_uncertainty_score":0.04588306},"labels":[],"label_agreement":null},{"id":"W2136499814","doi":"10.1016/j.tcs.2009.02.032","title":"Twin-roots of words and their properties","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Involution (esoterism); Mathematics; Catenation; Combinatorics; Uniqueness; Word (group theory); Primitive root modulo n; Factorization; Pure mathematics; Modulo; Algorithm; Geometry; Biology; Mathematical analysis","score_opus":0.010737442766716497,"score_gpt":0.21839386871214253,"score_spread":0.20765642594542602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136499814","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60360086,0.0021990591,0.33696648,0.0014164397,0.0004462552,0.00010661906,0.00052685343,0.0004648893,0.054272596],"genre_scores_gemma":[0.9513463,0.00053030235,0.034336686,0.00013006658,0.0002402105,0.00010243313,0.0002460413,0.00018716017,0.012880885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905056,0.00021220226,0.000091939975,0.00030157462,0.00020413053,0.0001396336],"domain_scores_gemma":[0.9932914,0.004352444,0.00062694476,0.00060160056,0.0005801739,0.00054742914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095925236,0.0005521954,0.0012507031,0.0020323687,0.0020630548,0.0033940242,0.00088010466,0.0014040285,0.0068507004],"category_scores_gemma":[0.008400957,0.0006867007,0.00079005945,0.0022724345,0.0037316105,0.008221894,0.002457709,0.002542937,0.0011272491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005561881,0.0000118993585,0.00024281692,0.0000359519,0.00000593355,0.00014356207,0.0005263651,0.00037711175,0.0011234966,0.99201113,0.00032574,0.0051402356],"study_design_scores_gemma":[0.000013438379,0.0000124810995,0.00009859705,0.000009162824,0.0000065824865,0.00017677553,0.00011719973,0.0018131739,0.00037106822,0.99569017,0.0016823283,0.000009126936],"about_ca_topic_score_codex":0.0003536845,"about_ca_topic_score_gemma":0.00041576024,"teacher_disagreement_score":0.0068507004,"about_ca_system_score_codex":0.0006415041,"about_ca_system_score_gemma":0.0005931106,"threshold_uncertainty_score":0.022917867},"labels":[],"label_agreement":null},{"id":"W2136501818","doi":"10.1007/978-3-642-40579-2_12","title":"Suffix Conjugates for a Class of Morphic Subshifts","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Bijection; Conjugacy class; Morphism; Alphabet; Closure (psychology); Mathematics; Discrete mathematics","score_opus":0.01596543641131196,"score_gpt":0.23155511198402745,"score_spread":0.2155896755727155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136501818","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52832544,0.0016530901,0.26271883,0.0010537831,0.0010129027,0.00016035452,0.00070452417,0.0015359432,0.2028352],"genre_scores_gemma":[0.9076654,0.00055068353,0.037375238,0.00029145984,0.0003337937,0.000115771734,0.0005651664,0.00046433846,0.052638166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953735,0.00006721488,0.000046980334,0.00013182471,0.00013902049,0.00007765822],"domain_scores_gemma":[0.9995347,0.00014250865,0.00006339719,0.00010401368,0.00008663666,0.00006878321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003608084,0.0005236267,0.0005438697,0.0010681185,0.0014691945,0.0025788415,0.0005168944,0.0011248961,0.009085162],"category_scores_gemma":[0.0011173924,0.00037025262,0.00078929565,0.0010371859,0.0016366668,0.0024554445,0.0013313377,0.0014114059,0.0021167658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061506995,0.000020401816,0.00017900077,0.000030469611,0.0000055760192,0.00026768915,0.00030034248,0.0003089189,0.0039284895,0.9806817,0.00121842,0.0129974345],"study_design_scores_gemma":[0.000033389202,0.00006346046,0.00040542494,0.000020104866,0.000018501345,0.0010454063,0.0002326027,0.0035449637,0.004964652,0.96396583,0.025675213,0.000030416937],"about_ca_topic_score_codex":0.00017945645,"about_ca_topic_score_gemma":0.00019319345,"teacher_disagreement_score":0.009085162,"about_ca_system_score_codex":0.0006683841,"about_ca_system_score_gemma":0.00039175575,"threshold_uncertainty_score":0.030392826},"labels":[],"label_agreement":null},{"id":"W2137547347","doi":"10.1007/s10485-006-9013-z","title":"A General View of Approximation","year":2006,"lang":"en","type":"article","venue":"Applied Categorical Structures","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Theory of computation; Mathematics; Category theory; Calculus (dental); Pure mathematics; Algorithm","score_opus":0.006711144074672512,"score_gpt":0.20955944418273773,"score_spread":0.2028483001080652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137547347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018888246,0.004727952,0.674848,0.017763507,0.0011887942,0.00007341364,0.00041874318,0.0005547774,0.28153655],"genre_scores_gemma":[0.7782799,0.00401926,0.13776532,0.0045679025,0.0032438606,0.00048131932,0.00061484415,0.00030548775,0.070722096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972934,0.0007976942,0.00016631234,0.00071656425,0.00077484205,0.00025116175],"domain_scores_gemma":[0.9972006,0.0012801798,0.00012003002,0.00083999406,0.00038042542,0.00017871155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022550216,0.0007285536,0.0013420314,0.0022456592,0.0028889794,0.0067548235,0.0029543005,0.0026810125,0.013192469],"category_scores_gemma":[0.0049267495,0.0006174407,0.0016671061,0.0028595973,0.013952437,0.017083228,0.0043298695,0.0058270185,0.0014174923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012530468,0.0000011121971,0.000009155871,0.000004254823,8.856314e-7,0.0000031161148,0.000032798664,0.000084639745,0.000019551479,0.99919456,0.00021068708,0.00043801087],"study_design_scores_gemma":[0.0000034064628,0.0000032581725,0.000016475604,0.000003239774,0.0000022901863,0.000015725343,0.000024385894,0.0007864978,0.000042020518,0.994266,0.0048344065,0.000002319309],"about_ca_topic_score_codex":0.0024472647,"about_ca_topic_score_gemma":0.0012565335,"teacher_disagreement_score":0.013192469,"about_ca_system_score_codex":0.0036052559,"about_ca_system_score_gemma":0.0011273667,"threshold_uncertainty_score":0.044133246},"labels":[],"label_agreement":null},{"id":"W2138769606","doi":"10.1145/2490818","title":"Algebra-coalgebra duality in brzozowski's minimization algorithm","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fundação para a Ciência e a Tecnologia; Centre National de la Recherche Scientifique; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Agence Nationale de la Recherche","keywords":"Coalgebra; Duality (order theory); Mathematics; Automaton; Correctness; Algebra over a field; Reachability; Discrete mathematics; Computer science; Algorithm; Pure mathematics; Theoretical computer science","score_opus":0.016456805134547968,"score_gpt":0.2515546325590415,"score_spread":0.2350978274244935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138769606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010881068,0.00007986724,0.9825283,0.00023034154,0.00004433951,0.000050234627,0.00007707585,0.00056889997,0.005539757],"genre_scores_gemma":[0.1954401,0.0001745645,0.79287565,0.00021554234,0.000033865213,0.00025790447,0.00028734416,0.00048688048,0.010228092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933416,0.000115934934,0.00006109598,0.00019701009,0.0002048864,0.000086877386],"domain_scores_gemma":[0.9997185,0.00011693911,0.000015946523,0.00006222696,0.000068781424,0.00001764069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008469889,0.00044483342,0.0006271465,0.00063299236,0.00063162314,0.0012000683,0.002087863,0.0007569004,0.006072032],"category_scores_gemma":[0.0021041438,0.0004236725,0.0008213941,0.0006580192,0.001027244,0.0024903598,0.0017313698,0.0013406178,0.0013787518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014536509,0.00009975469,0.00052194245,0.00017346482,0.0000402713,0.00007342505,0.00028930936,0.04189232,0.010999367,0.8141315,0.0036891538,0.12794411],"study_design_scores_gemma":[0.00006286461,0.00006559878,0.00025453075,0.00003379571,0.000042345357,0.00009470932,0.00008795618,0.27254248,0.016845573,0.69582397,0.014110699,0.00003553551],"about_ca_topic_score_codex":0.002326424,"about_ca_topic_score_gemma":0.004450927,"teacher_disagreement_score":0.006072032,"about_ca_system_score_codex":0.0011368803,"about_ca_system_score_gemma":0.0014256353,"threshold_uncertainty_score":0.020313025},"labels":[],"label_agreement":null},{"id":"W2141385438","doi":"10.1016/j.tcs.2012.03.046","title":"State complexity of union and intersection of square and reversal on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math> regular languages","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Intersection (aeronautics); Component (thermodynamics); Mathematics; Discrete mathematics; Computer science; Algorithm; Engineering; Physics","score_opus":0.014212729719191937,"score_gpt":0.24482203627869006,"score_spread":0.23060930655949813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141385438","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89920753,0.00036844966,0.06335511,0.002660342,0.00007432578,0.00011603617,0.004059041,0.0009365372,0.029222636],"genre_scores_gemma":[0.98254967,0.00010450948,0.009110152,0.000097295364,0.000047451267,0.000069072994,0.0023415936,0.00015878207,0.0055215964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970963,0.0005424797,0.00023313923,0.00070816453,0.00069278094,0.00072724506],"domain_scores_gemma":[0.96615434,0.02635246,0.0016906984,0.0023123329,0.0018678346,0.0016223819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001715716,0.00045136787,0.0012258529,0.0014144179,0.0023857835,0.006797786,0.0019378719,0.0020309116,0.02566034],"category_scores_gemma":[0.018672602,0.0006784646,0.0020050826,0.0015325813,0.0027061442,0.011496374,0.0029420308,0.0027243788,0.0011564333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025122932,0.0003946157,0.013992474,0.0005911284,0.00015245387,0.00057102775,0.0016731044,0.114671744,0.0055185393,0.80706775,0.015026148,0.037828773],"study_design_scores_gemma":[0.00014555009,0.00011636813,0.0032547975,0.00004734517,0.00010660805,0.00024265221,0.0005700778,0.30949238,0.005604225,0.6780177,0.0023239672,0.000078306904],"about_ca_topic_score_codex":0.009574852,"about_ca_topic_score_gemma":0.010659121,"teacher_disagreement_score":0.02566034,"about_ca_system_score_codex":0.0037878677,"about_ca_system_score_gemma":0.003293333,"threshold_uncertainty_score":0.08584237},"labels":[],"label_agreement":null},{"id":"W2141718869","doi":"10.1007/s00236-006-0027-7","title":"Representation and uniformization of algebraic transductions","year":2006,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Waterloo; Saint Mary's University","funders":"","keywords":"Algebraic number; Formalism (music); Computer science; Representation (politics); Stack (abstract data type); Theory of computation; Context (archaeology); Mathematics; Algebra over a field; Theoretical computer science; Programming language; Pure mathematics","score_opus":0.004762714598113413,"score_gpt":0.19911530751033274,"score_spread":0.19435259291221932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141718869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14339982,0.0006988019,0.817077,0.00086230575,0.00025068925,0.00006792622,0.00048813812,0.0012080175,0.03594732],"genre_scores_gemma":[0.88281643,0.0005384885,0.09877397,0.0002876788,0.0003883914,0.00015285268,0.00084920094,0.00036908122,0.015823897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643964,0.0010218264,0.00043627428,0.0010091899,0.0005332567,0.0005598143],"domain_scores_gemma":[0.9946339,0.0021763793,0.000445837,0.0014113272,0.0010139227,0.00031871014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026547306,0.00060505467,0.0010086289,0.0020549626,0.0015992594,0.004900941,0.0016936436,0.0010735103,0.0070968787],"category_scores_gemma":[0.0058809184,0.00072554033,0.0017855272,0.0025248239,0.0038901174,0.009858115,0.0050416575,0.0029295147,0.00093625736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004360062,0.000022854601,0.00013224233,0.000025728683,0.000007071651,0.00003808659,0.0003681275,0.0008065908,0.0010196127,0.9876802,0.00038742725,0.009468535],"study_design_scores_gemma":[0.000019247616,0.000041910283,0.00024487224,0.000016965581,0.0000239901,0.00010062867,0.00017336276,0.009851759,0.0020164456,0.9833213,0.004167173,0.000022210588],"about_ca_topic_score_codex":0.00079821976,"about_ca_topic_score_gemma":0.00061555253,"teacher_disagreement_score":0.0070968787,"about_ca_system_score_codex":0.0014198769,"about_ca_system_score_gemma":0.00070870563,"threshold_uncertainty_score":0.023741424},"labels":[],"label_agreement":null},{"id":"W2142901839","doi":"10.1142/s0129054115500197","title":"Automatic Sets of Rational Numbers","year":2015,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Closure (psychology); Rational number; Set (abstract data type); Set theory; Rational point; Algebra over a field","score_opus":0.027225692747738194,"score_gpt":0.31808074829621114,"score_spread":0.29085505554847296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142901839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30805027,0.0021180278,0.4608425,0.0027976467,0.00082553213,0.00022656801,0.0013245221,0.0021202913,0.22169462],"genre_scores_gemma":[0.9020367,0.00057947525,0.08062494,0.00046064312,0.0005680605,0.00025914525,0.00091390754,0.00031631035,0.014240816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961146,0.0007152745,0.00026465196,0.0008589775,0.0017050792,0.00034132556],"domain_scores_gemma":[0.99409544,0.0032347364,0.00058056193,0.0008668772,0.0009433476,0.0002791132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014454908,0.00058668206,0.0006828874,0.0022635886,0.0024024495,0.004529107,0.0012813489,0.00093978766,0.0064371387],"category_scores_gemma":[0.007835979,0.00061257096,0.0014326505,0.0011567615,0.0052548894,0.009751416,0.0029710806,0.0023445417,0.001069571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024653695,0.000013715306,0.00016701334,0.000039011324,0.000005814819,0.00007266864,0.00021079309,0.0005872151,0.0013174845,0.9921182,0.0005402142,0.004903314],"study_design_scores_gemma":[0.000016885744,0.000015056438,0.00017387324,0.000023418686,0.000011439969,0.00017181889,0.000075982636,0.006210323,0.002368026,0.9816442,0.009263765,0.000025288118],"about_ca_topic_score_codex":0.00062391703,"about_ca_topic_score_gemma":0.0005220894,"teacher_disagreement_score":0.0064371387,"about_ca_system_score_codex":0.001561402,"about_ca_system_score_gemma":0.0011491681,"threshold_uncertainty_score":0.021534443},"labels":[],"label_agreement":null},{"id":"W2143147654","doi":"10.1016/j.jpaa.2004.10.012","title":"Decidable locally finite discriminator varieties arising from dihedral varieties of groups","year":2004,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Decidability; Dihedral group; Discriminator; Class (philosophy); Variety (cybernetics); Order (exchange); Pure mathematics; Combinatorics; Discrete mathematics; Group (periodic table); Statistics; Artificial intelligence; Computer science","score_opus":0.008434117271399946,"score_gpt":0.20577376792626156,"score_spread":0.19733965065486161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143147654","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5761533,0.0016613954,0.35527715,0.003989732,0.00028998152,0.00022130189,0.0015307756,0.0022614896,0.05861486],"genre_scores_gemma":[0.96752363,0.0001949438,0.023489447,0.0002955876,0.00008867375,0.00006269127,0.0007743783,0.00020891911,0.007361707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979317,0.00040444816,0.00018860669,0.00073443,0.00033814332,0.0004027145],"domain_scores_gemma":[0.9904066,0.0077556507,0.00034144474,0.00072566315,0.00038364448,0.0003870386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019571874,0.00055728777,0.0010612882,0.00087634067,0.0019782616,0.0053120796,0.0020116773,0.0018259517,0.006994963],"category_scores_gemma":[0.006152913,0.0011004359,0.0016385528,0.00091320527,0.0041980436,0.013210677,0.0041913074,0.0052715107,0.00048793197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015739881,0.00007131599,0.0014064778,0.00016449603,0.000023613027,0.00042691786,0.0018435625,0.0024909216,0.0027143217,0.98159343,0.0013871037,0.007720494],"study_design_scores_gemma":[0.00004529423,0.000014582883,0.00026007945,0.000021762857,0.000025255686,0.00022318111,0.00036888538,0.0074867317,0.0025004572,0.9855467,0.0034862654,0.00002074813],"about_ca_topic_score_codex":0.00095436565,"about_ca_topic_score_gemma":0.0012590117,"teacher_disagreement_score":0.006994963,"about_ca_system_score_codex":0.002796114,"about_ca_system_score_gemma":0.0010433159,"threshold_uncertainty_score":0.023400486},"labels":[],"label_agreement":null},{"id":"W2143276068","doi":"10.3233/fun-2007-761-208","title":"Intercode Regular Languages","year":2007,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Programming language; Linguistics; Philosophy","score_opus":0.006680356628731117,"score_gpt":0.25572964456291125,"score_spread":0.24904928793418013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143276068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11778607,0.0011783349,0.81864464,0.001085561,0.00047482707,0.00029864348,0.0013872108,0.0027070255,0.05643769],"genre_scores_gemma":[0.74550956,0.0007757677,0.22103482,0.0007635851,0.0003821679,0.00045823125,0.0020233386,0.0006618022,0.028390693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975961,0.00044724965,0.00019579088,0.00080969854,0.0006397428,0.00031150575],"domain_scores_gemma":[0.9956566,0.0016414105,0.00070982473,0.0009007106,0.00087459607,0.00021688563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084413827,0.00060878776,0.00048853934,0.0015202472,0.0010927124,0.0019866053,0.0010377399,0.00088323944,0.0072285538],"category_scores_gemma":[0.00434124,0.0004403428,0.0011288379,0.0009820496,0.0030861848,0.0037334315,0.0016813972,0.0019059731,0.0018254771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119276294,0.000034426444,0.0009712055,0.00015836829,0.000019913423,0.00041041584,0.0008213998,0.0038304373,0.007310323,0.95533323,0.0030385202,0.027952485],"study_design_scores_gemma":[0.000028473727,0.00008287121,0.00074709207,0.00007482372,0.000028794228,0.000938288,0.00030191196,0.024001861,0.010340997,0.9043386,0.059057154,0.00005906288],"about_ca_topic_score_codex":0.0009116451,"about_ca_topic_score_gemma":0.0009021122,"teacher_disagreement_score":0.0072285538,"about_ca_system_score_codex":0.00092917157,"about_ca_system_score_gemma":0.0010429497,"threshold_uncertainty_score":0.024181902},"labels":[],"label_agreement":null},{"id":"W2143645603","doi":"10.1016/j.aam.2005.05.007","title":"On the Stanley–Wilf limit of 4231-avoiding permutations and a conjecture of Arratia","year":2005,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Conjecture; Permutation (music); Mathematics; Combinatorics; Limit (mathematics); Class (philosophy); Parity of a permutation; Sequence (biology); Discrete mathematics; Cyclic permutation; Symmetric group; Computer science; Physics; Mathematical analysis","score_opus":0.009003227470727602,"score_gpt":0.23913186602539935,"score_spread":0.23012863855467175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143645603","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7261763,0.0017888772,0.068505995,0.011115948,0.0007540183,0.00005994751,0.00030217576,0.00041955913,0.19087721],"genre_scores_gemma":[0.9592828,0.0007768819,0.01174881,0.0012314601,0.0005309849,0.00008207637,0.00031835056,0.00015445559,0.025874168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867684,0.00032183333,0.0000682983,0.00030160384,0.00030674634,0.00032462025],"domain_scores_gemma":[0.9954971,0.0026113081,0.00033967945,0.00055535533,0.00047862067,0.000517972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023295272,0.00063953514,0.0017116048,0.0019700872,0.005662748,0.00447611,0.0016798531,0.0032733292,0.008380382],"category_scores_gemma":[0.010376679,0.00070045004,0.0016142221,0.0021417998,0.00638191,0.008259844,0.0035773555,0.0047630956,0.0014132216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006392227,0.000030291307,0.00029118184,0.000029664061,0.0000056812314,0.00009726545,0.00036843325,0.00086244394,0.00040727586,0.9941332,0.0011949842,0.002515623],"study_design_scores_gemma":[0.000014781221,0.000012218843,0.00012979661,0.000009212919,0.0000042180463,0.000078328645,0.00010715234,0.0017628105,0.00018846217,0.99633443,0.0013460675,0.0000125533115],"about_ca_topic_score_codex":0.0020552159,"about_ca_topic_score_gemma":0.0013583428,"teacher_disagreement_score":0.008380382,"about_ca_system_score_codex":0.0017740543,"about_ca_system_score_gemma":0.0014192227,"threshold_uncertainty_score":0.028035164},"labels":[],"label_agreement":null},{"id":"W2144782101","doi":"10.1142/s0129054111008647","title":"OVERLAP-FREE LANGUAGES AND SOLID CODES","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Undecidable problem; Decidability; Prefix code; Property (philosophy); Computer science; Linear code; Mathematics; Prime (order theory); Regular language; Discrete mathematics; Block code; Algorithm; Theoretical computer science; Combinatorics; Automaton","score_opus":0.018678284295213607,"score_gpt":0.30702943961086426,"score_spread":0.28835115531565064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144782101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14083245,0.00034746923,0.843371,0.00068865274,0.000064834094,0.000098848686,0.00024774316,0.00068632193,0.013662613],"genre_scores_gemma":[0.7744266,0.00032777945,0.21287003,0.00025295204,0.000104109036,0.0002548645,0.000569523,0.00023356387,0.010960661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808276,0.00035337146,0.00016790305,0.00056088256,0.0005090238,0.00032614046],"domain_scores_gemma":[0.99442554,0.0033530344,0.00061645516,0.0007259587,0.0006085955,0.00027042936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011212251,0.0004646099,0.0004896118,0.0007673363,0.0011794621,0.001832287,0.00080545014,0.0007839219,0.004144405],"category_scores_gemma":[0.0050390246,0.00046787676,0.0009608434,0.0009439835,0.0040189284,0.004196051,0.0021969394,0.0019417123,0.0006139559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007360492,0.000022365042,0.0004345663,0.00008241583,0.0000094357165,0.0001524725,0.00058866275,0.007979824,0.0036976694,0.9714026,0.0007103483,0.014846032],"study_design_scores_gemma":[0.000025541503,0.00003444043,0.00012668046,0.000024202674,0.0000112305315,0.00021981972,0.0002007815,0.027909694,0.005395259,0.9576783,0.008353468,0.00002052754],"about_ca_topic_score_codex":0.0013626497,"about_ca_topic_score_gemma":0.0010748826,"teacher_disagreement_score":0.004144405,"about_ca_system_score_codex":0.0011183278,"about_ca_system_score_gemma":0.0013641196,"threshold_uncertainty_score":0.013864398},"labels":[],"label_agreement":null},{"id":"W2144860383","doi":"10.25596/jalc-2004-121","title":"Bimachines and Structurally-Reversed Automata","year":2004,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Rational function; Nondeterministic algorithm; Computer science; Finite-state machine; Automaton; Function (biology); Word (group theory); Simple (philosophy); Trigonometric functions; Point (geometry); Range (aeronautics); Preprocessor; Power (physics); Algorithm; Theoretical computer science; Mathematics; Pure mathematics; Artificial intelligence; Engineering","score_opus":0.004140554167445769,"score_gpt":0.18249941646308462,"score_spread":0.17835886229563885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144860383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09221281,0.00074016256,0.8730214,0.0006029798,0.00019068137,0.00010438557,0.00015559072,0.00080621196,0.03216564],"genre_scores_gemma":[0.75567794,0.00067688635,0.2261056,0.0005428276,0.00018469288,0.00029156002,0.0002879086,0.00018303744,0.01604948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831945,0.00045644163,0.00016515226,0.00052781124,0.0003744013,0.00015663449],"domain_scores_gemma":[0.99834013,0.0006872142,0.00019475319,0.0004682011,0.00021943997,0.0000902393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084990537,0.00038799713,0.00032595344,0.00052752794,0.00074036734,0.0015878751,0.00071815774,0.0010817724,0.004554972],"category_scores_gemma":[0.002506841,0.00034902708,0.00083572394,0.0003524109,0.0046761353,0.003589935,0.0017518395,0.0018249281,0.0010549453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014186904,0.0000073090077,0.00013049667,0.00002264956,0.0000036597648,0.00007769636,0.00021652787,0.0015328367,0.0024093713,0.9908125,0.00017110772,0.0046016276],"study_design_scores_gemma":[0.000013086438,0.00006408284,0.00013368817,0.000021306025,0.000011569873,0.0002800433,0.000121784964,0.01628257,0.0077424967,0.96248573,0.0128226755,0.000020777607],"about_ca_topic_score_codex":0.00039946495,"about_ca_topic_score_gemma":0.0003823437,"teacher_disagreement_score":0.004554972,"about_ca_system_score_codex":0.00065156963,"about_ca_system_score_gemma":0.00054374867,"threshold_uncertainty_score":0.015237868},"labels":[],"label_agreement":null},{"id":"W2145436131","doi":"10.1080/00207160.2012.704994","title":"Undecidability of state complexity","year":2012,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Undecidable problem; Alphabet; Mathematics; State (computer science); Regular language; Computational complexity theory; Discrete mathematics; Algebra over a field; Automaton; Algorithm; Theoretical computer science; Pure mathematics; Computer science; Decidability; Linguistics","score_opus":0.038232645543636395,"score_gpt":0.2957965192233195,"score_spread":0.25756387367968314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145436131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60055375,0.00048288112,0.3754602,0.005542258,0.00015809538,0.00029150952,0.0013847997,0.0014281449,0.014698398],"genre_scores_gemma":[0.9497259,0.0003199525,0.04367675,0.0003643394,0.00019446969,0.00023482501,0.0009436781,0.0002732951,0.004266729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99252105,0.0013105005,0.00047225825,0.0020428512,0.0021760073,0.0014774625],"domain_scores_gemma":[0.9279216,0.058552057,0.0027876934,0.005573893,0.0034409242,0.0017238725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004285796,0.00088712637,0.0014424443,0.0013751279,0.00237237,0.006692309,0.0038716504,0.0021370975,0.0067767925],"category_scores_gemma":[0.029040396,0.0008121507,0.0032706792,0.0013776289,0.0069971127,0.01407873,0.0038560578,0.0074548437,0.00040697286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008816615,0.0005675254,0.010941722,0.0005913034,0.00019425376,0.00066889747,0.0014210878,0.13443668,0.01256944,0.7953691,0.00411573,0.0382426],"study_design_scores_gemma":[0.00007721754,0.00009190532,0.0010027762,0.000032047607,0.000066941655,0.000122876,0.0002191611,0.20894478,0.011003122,0.77687925,0.0015015737,0.000058360944],"about_ca_topic_score_codex":0.004105948,"about_ca_topic_score_gemma":0.0032492806,"teacher_disagreement_score":0.0067767925,"about_ca_system_score_codex":0.004138863,"about_ca_system_score_gemma":0.0046473634,"threshold_uncertainty_score":0.030029655},"labels":[],"label_agreement":null},{"id":"W2146148441","doi":"10.1142/s0129054112400059","title":"FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Decidability; Property (philosophy); Formal language; Computer science; Regular language; Programming language; Code (set theory); Coding (social sciences); Mathematics; Theoretical computer science; Automaton","score_opus":0.07281263454795484,"score_gpt":0.35218667728933695,"score_spread":0.2793740427413821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146148441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015508206,0.00028449052,0.9747447,0.002088636,0.000049227874,0.00012586672,0.00023797611,0.0007459295,0.0062149144],"genre_scores_gemma":[0.38553876,0.0007629092,0.60514605,0.0005534714,0.00028203064,0.0007573618,0.0011242582,0.000548837,0.0052863304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99508023,0.0013338361,0.0006031625,0.00078878243,0.0017751092,0.00041888483],"domain_scores_gemma":[0.97627866,0.01774593,0.0010265103,0.0033861387,0.0012663458,0.00029647746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050982265,0.00071844424,0.00073965365,0.0015790382,0.0015775379,0.0055423505,0.002842976,0.0013747822,0.005610653],"category_scores_gemma":[0.021194624,0.0009729489,0.0024207619,0.0014821402,0.0074990564,0.013116271,0.002773626,0.0048838067,0.00069878786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031409818,0.00004818664,0.00036672957,0.00015914055,0.000014760849,0.000083446415,0.00042329094,0.014217325,0.0015248882,0.96191174,0.0010879847,0.020131204],"study_design_scores_gemma":[0.000025076313,0.000013094358,0.0000835054,0.00003865648,0.000015574944,0.0000748654,0.000098972,0.07288582,0.0037280149,0.9183004,0.0047175763,0.000018392102],"about_ca_topic_score_codex":0.0023115813,"about_ca_topic_score_gemma":0.0028107853,"teacher_disagreement_score":0.005610653,"about_ca_system_score_codex":0.0035000807,"about_ca_system_score_gemma":0.0030214235,"threshold_uncertainty_score":0.02696228},"labels":[],"label_agreement":null},{"id":"W2146441371","doi":"10.1142/s0129054114400103","title":"NONDETERMINISTIC STATE COMPLEXITY OF PROPORTIONAL REMOVALS","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Waterloo","funders":"","keywords":"Nondeterministic algorithm; Monomial; Mathematics; Combinatorics; Upper and lower bounds; Time complexity; Polynomial; State (computer science); PSPACE; Matching (statistics); Discrete mathematics; Constant (computer programming); Regular language; NP; Computational complexity theory; Automaton; Computer science; Algorithm; Turing machine; Theoretical computer science","score_opus":0.029026363745375795,"score_gpt":0.3105459000499086,"score_spread":0.2815195363045328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146441371","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75821036,0.00026565685,0.21887776,0.0013838606,0.00009101152,0.00017503057,0.00083399186,0.0012292239,0.01893307],"genre_scores_gemma":[0.95724994,0.00016673045,0.033193685,0.00016859995,0.00007457892,0.00015800422,0.000745241,0.00029148688,0.007951591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645376,0.00054221216,0.0002877538,0.00086836336,0.0010306834,0.0008173151],"domain_scores_gemma":[0.9865031,0.008910816,0.00093195535,0.0024362719,0.0007805402,0.0004372567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015176805,0.00044425164,0.0009405777,0.00075141486,0.0014861751,0.0033933953,0.0019187168,0.0010834514,0.007981237],"category_scores_gemma":[0.0104645025,0.00048771323,0.0018522287,0.0009093154,0.002504217,0.005610401,0.0027014923,0.002388545,0.0007846424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019000049,0.00045792933,0.0065648826,0.00058243563,0.00011746984,0.00047416234,0.0013238252,0.17327975,0.051370397,0.6769068,0.0053942595,0.08162808],"study_design_scores_gemma":[0.00008590267,0.0001418603,0.0016738559,0.000023061966,0.000097769276,0.00024331371,0.0001506989,0.36310858,0.032660592,0.59750015,0.004221879,0.000092330505],"about_ca_topic_score_codex":0.0017724625,"about_ca_topic_score_gemma":0.0018128786,"teacher_disagreement_score":0.007981237,"about_ca_system_score_codex":0.0018575275,"about_ca_system_score_gemma":0.0024692512,"threshold_uncertainty_score":0.0266999},"labels":[],"label_agreement":null},{"id":"W2146748072","doi":"10.1145/2590775","title":"Avoiding Three Consecutive Blocks of the Same Size and Same Sum","year":2014,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"semigroups and automata theory","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Alphabet; Combinatorics; Block size; Mathematics; Word (group theory); Discrete mathematics; Computer science; Linguistics; Geometry","score_opus":0.01285349044668734,"score_gpt":0.22524436285073757,"score_spread":0.21239087240405022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146748072","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7428551,0.000360698,0.19933695,0.000804747,0.0005068375,0.000088248344,0.00027112942,0.00066291506,0.055113368],"genre_scores_gemma":[0.8897981,0.0002476094,0.08476414,0.00026933916,0.000059457885,0.00020579013,0.00033806675,0.00037479098,0.023942724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992736,0.00013670501,0.000080226746,0.00018393478,0.00014429499,0.00018130812],"domain_scores_gemma":[0.996837,0.0013086782,0.0005309782,0.00061815814,0.00038606508,0.00031908392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003703098,0.0005456055,0.00080354855,0.00041476364,0.0023572193,0.0015929366,0.0012439566,0.0011219911,0.010047558],"category_scores_gemma":[0.0031090216,0.00048118734,0.00086860853,0.0005607591,0.0017863418,0.0031626201,0.0020582527,0.0010767786,0.0025561384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016295222,0.00028605317,0.0037987002,0.0009024257,0.00010624947,0.0038405599,0.0031447476,0.010948011,0.17112933,0.7495317,0.005740033,0.048942763],"study_design_scores_gemma":[0.00017587005,0.0004704409,0.0015507318,0.00018546762,0.00022331507,0.0025258777,0.0010901619,0.04007656,0.11545174,0.7921139,0.045966305,0.00016963981],"about_ca_topic_score_codex":0.0009613685,"about_ca_topic_score_gemma":0.0014463547,"teacher_disagreement_score":0.010047558,"about_ca_system_score_codex":0.0005040265,"about_ca_system_score_gemma":0.00097237667,"threshold_uncertainty_score":0.03361243},"labels":[],"label_agreement":null},{"id":"W2146755739","doi":"10.1016/j.jalgebra.2011.10.006","title":"Primitive orthogonal idempotents for R-trivial monoids","year":2011,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University; Université du Québec à Montréal","funders":"","keywords":"Monoid; Mathematics; Free monoid; Equivalence (formal languages); Syntactic monoid; Pure mathematics; Construct (python library); Combinatorics; Algebra over a field; Computer science","score_opus":0.03445370049432931,"score_gpt":0.23481080704051682,"score_spread":0.20035710654618752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146755739","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5310644,0.0010176644,0.37708506,0.0008495894,0.000856466,0.00020608553,0.00050923886,0.0011893535,0.087222114],"genre_scores_gemma":[0.9282965,0.00049561315,0.05320595,0.00030048788,0.00040320258,0.00015865707,0.00040629265,0.0002568298,0.016476352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785346,0.00042440015,0.000302436,0.00042296757,0.00049503025,0.00050167344],"domain_scores_gemma":[0.9964271,0.0017212166,0.00035196432,0.00050117425,0.0005065628,0.00049188064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025624915,0.0008051574,0.0009504456,0.0019567478,0.0024242315,0.0053470815,0.0010920089,0.001433969,0.0057003424],"category_scores_gemma":[0.003886503,0.0010216535,0.0015018772,0.0012628483,0.0041196896,0.007007627,0.003559577,0.0026232991,0.0019587863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000127395,0.000050995168,0.00025368962,0.000047411257,0.000009795985,0.00027338564,0.0006192098,0.00019225106,0.0047613913,0.9848241,0.0005323418,0.008308026],"study_design_scores_gemma":[0.000057092035,0.00008638203,0.00026388039,0.000021542066,0.000026783262,0.00042448955,0.00022824905,0.0019007273,0.005113363,0.98703617,0.004785811,0.000055523473],"about_ca_topic_score_codex":0.00032929334,"about_ca_topic_score_gemma":0.00039021327,"teacher_disagreement_score":0.0057003424,"about_ca_system_score_codex":0.0008482481,"about_ca_system_score_gemma":0.00094392267,"threshold_uncertainty_score":0.019069552},"labels":[],"label_agreement":null},{"id":"W2147060737","doi":"10.1007/978-3-642-14455-4_25","title":"Schema for Parallel Insertion and Deletion","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; Computer science; Schema (genetic algorithms); Parallel computing; Regular language; Theoretical computer science; Genetics; Information retrieval; Automaton","score_opus":0.013283973227594005,"score_gpt":0.2348000085035534,"score_spread":0.2215160352759594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147060737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041348115,0.00041162016,0.92193985,0.0009351734,0.0006736283,0.00047542143,0.006182643,0.014856823,0.050390113],"genre_scores_gemma":[0.069847964,0.0014044439,0.83950126,0.0010218354,0.00032458955,0.0010262512,0.018284898,0.0061947466,0.06239413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820876,0.00030573594,0.00031434913,0.00048187652,0.0005289295,0.00016030476],"domain_scores_gemma":[0.9981371,0.0004062319,0.000074599746,0.000868637,0.00044890147,0.00006441838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020455439,0.0010698482,0.0011745817,0.0013111283,0.001405814,0.0039581754,0.0026210407,0.0016647849,0.0359033],"category_scores_gemma":[0.0028470287,0.0014421399,0.0019896529,0.0024531307,0.001689376,0.008990343,0.0029720298,0.0030892764,0.019597515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018919978,0.00010396916,0.0004500599,0.00048927026,0.000040064806,0.0003141211,0.0007940813,0.0017265028,0.005792137,0.7819617,0.05927017,0.14886868],"study_design_scores_gemma":[0.00008386744,0.00005219445,0.00016943789,0.00013924083,0.000083098756,0.0010009739,0.00030479833,0.008417024,0.01458351,0.457711,0.5173906,0.00006416611],"about_ca_topic_score_codex":0.0018357133,"about_ca_topic_score_gemma":0.0016322177,"teacher_disagreement_score":0.0359033,"about_ca_system_score_codex":0.0010397587,"about_ca_system_score_gemma":0.0025739989,"threshold_uncertainty_score":0.120108545},"labels":[],"label_agreement":null},{"id":"W2147763027","doi":"10.1016/j.tcs.2008.09.056","title":"Quasiperiodic and Lyndon episturmian words","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Quasiperiodic function; Mathematics; Generalization; Morphism; Word (group theory); Characterization (materials science); Class (philosophy); Directive; Pure mathematics; Combinatorics; Computer science; Artificial intelligence; Mathematical analysis; Physics; Geometry","score_opus":0.008835510490404727,"score_gpt":0.2206555159525293,"score_spread":0.21182000546212457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147763027","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80258256,0.0009446497,0.090965495,0.0014480373,0.0005970179,0.000061413004,0.00031352192,0.0002588678,0.10282843],"genre_scores_gemma":[0.97109985,0.00017629679,0.007990475,0.00020186599,0.00021286249,0.00006606718,0.00015473676,0.000049124028,0.020048749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960977,0.00009429257,0.000030804513,0.00009135585,0.000091177506,0.00008256439],"domain_scores_gemma":[0.9991841,0.00036545683,0.00012228872,0.00009795944,0.00010746589,0.00012275156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054926187,0.00035689733,0.0005541917,0.0010349626,0.0020181704,0.0020808834,0.0004762341,0.0009843343,0.0061381035],"category_scores_gemma":[0.0019813585,0.00033218472,0.00049892045,0.0008368001,0.002340561,0.002325385,0.0013126195,0.0010691854,0.00063117815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048583035,0.000008440903,0.00020323323,0.000013905023,0.0000028242682,0.00016040837,0.0003488597,0.00020748192,0.001251479,0.99438876,0.00051053957,0.0028555687],"study_design_scores_gemma":[0.000022246688,0.000020802767,0.00038679788,0.000006503277,0.0000059092067,0.0002700817,0.00018071526,0.0021574595,0.00047420672,0.9930715,0.003390687,0.000013130005],"about_ca_topic_score_codex":0.00040244457,"about_ca_topic_score_gemma":0.0005861947,"teacher_disagreement_score":0.0061381035,"about_ca_system_score_codex":0.0007764461,"about_ca_system_score_gemma":0.0003571638,"threshold_uncertainty_score":0.020534039},"labels":[],"label_agreement":null},{"id":"W2148956539","doi":"10.2178/jsl/1278682213","title":"Quantifier elimination in valued Ore modules","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantifier elimination; Valuation (finance); Mathematics; Quantifier (linguistics); Residue field; Property (philosophy); Independence (probability theory); Field (mathematics); Pure mathematics; Discrete mathematics; Computer science; Statistics; Artificial intelligence","score_opus":0.015861606892785717,"score_gpt":0.2604011465616606,"score_spread":0.24453953966887487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148956539","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7774672,0.00027349906,0.20291193,0.00059130584,0.00007035441,0.000050572362,0.00006399283,0.000338821,0.01823242],"genre_scores_gemma":[0.9807171,0.00008947942,0.013251908,0.00011730549,0.00004692464,0.000019470386,0.00004762824,0.000042992026,0.005667257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880135,0.00022934261,0.00007622633,0.00018682107,0.00045889633,0.0002474184],"domain_scores_gemma":[0.9983754,0.0008298561,0.00015953777,0.0001385644,0.00035587218,0.00014084867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019009254,0.0003372657,0.00053995446,0.00090819714,0.0009750554,0.0016492333,0.00070267887,0.0004977678,0.0020281388],"category_scores_gemma":[0.0021293883,0.0003618775,0.0009993388,0.00042970176,0.0025071632,0.0039661033,0.0016743595,0.0014283655,0.0003589234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007530779,0.00006841164,0.00087145215,0.000073332274,0.00002770049,0.00059298996,0.0010194913,0.002089944,0.01356756,0.9733628,0.00033797784,0.007913047],"study_design_scores_gemma":[0.000058716574,0.00011716865,0.00073322165,0.000025649219,0.000040721497,0.00061681826,0.00030524065,0.021517692,0.026926486,0.9441174,0.005496986,0.000043896693],"about_ca_topic_score_codex":0.00046401154,"about_ca_topic_score_gemma":0.00039500016,"teacher_disagreement_score":0.0020281388,"about_ca_system_score_codex":0.0007843419,"about_ca_system_score_gemma":0.0006852389,"threshold_uncertainty_score":0.010053158},"labels":[],"label_agreement":null},{"id":"W2149642761","doi":"10.2307/2695103","title":"Number of variables is equivalent to space","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arity; Mathematics; Set (abstract data type); Sequence (biology); PSPACE; Discrete mathematics; Space (punctuation); Turing; Quantifier (linguistics); DSPACE; Universe; Combinatorics; Computational complexity theory; Algorithm; Computer science; Artificial intelligence","score_opus":0.02309942492369837,"score_gpt":0.28764868821992434,"score_spread":0.26454926329622597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149642761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69515157,0.0008670338,0.27507222,0.0020839912,0.00013000137,0.00008505598,0.00052990223,0.0009616332,0.025118649],"genre_scores_gemma":[0.9824746,0.000096451135,0.015453265,0.00014460043,0.000051428,0.00004631653,0.00009506744,0.00007399546,0.0015644155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954332,0.0010969031,0.00042201555,0.0011914017,0.0012707709,0.0005858072],"domain_scores_gemma":[0.9616841,0.028377661,0.0026829995,0.004379753,0.0017578055,0.0011176995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023062692,0.00047370192,0.00091667223,0.0010714,0.0012777542,0.004273811,0.001421177,0.0011296221,0.0049215155],"category_scores_gemma":[0.01638693,0.0005905851,0.0010272949,0.0006934918,0.005278516,0.011293972,0.0029572179,0.0022660193,0.000328192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006560197,0.00012773533,0.0054903924,0.00027615947,0.00009741447,0.000424746,0.0008357378,0.03389703,0.019922668,0.911728,0.0010327639,0.02551134],"study_design_scores_gemma":[0.0000723091,0.00014996044,0.0018883187,0.000053879805,0.000089190755,0.00055613974,0.00028016887,0.058946718,0.02019186,0.91251725,0.0051990384,0.000055138804],"about_ca_topic_score_codex":0.00051911187,"about_ca_topic_score_gemma":0.0005350357,"teacher_disagreement_score":0.0049215155,"about_ca_system_score_codex":0.0014908059,"about_ca_system_score_gemma":0.0007062925,"threshold_uncertainty_score":0.016464114},"labels":[],"label_agreement":null},{"id":"W2149893488","doi":"10.26493/1855-3974.46.b2f","title":"Deciding the deterministic property for soliton graphs","year":2009,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Deutscher Akademischer Austauschdienst","keywords":"Mathematics; Automaton; Discrete mathematics; Combinatorics; Matching (statistics); Deterministic automaton; Algorithm; Finite-state machine; Theoretical computer science; Computer science","score_opus":0.031894086918758995,"score_gpt":0.26342375152607067,"score_spread":0.23152966460731167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149893488","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4327442,0.00015131262,0.55314964,0.0018207246,0.00008972657,0.00028546934,0.000847203,0.002058672,0.00885306],"genre_scores_gemma":[0.85336816,0.00011023724,0.14171077,0.00035189968,0.00007867542,0.00020049684,0.0014663425,0.00023156058,0.0024818634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99546105,0.00090917153,0.0005096507,0.001658456,0.000849293,0.0006123508],"domain_scores_gemma":[0.970063,0.022611769,0.0015296784,0.0034236843,0.0018342832,0.00053756963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024746424,0.00042079776,0.0007921378,0.00067012024,0.0017182808,0.0028580856,0.0015285471,0.0017164013,0.0034871208],"category_scores_gemma":[0.022170398,0.00080670486,0.001567479,0.0007625017,0.002964404,0.0043419697,0.0018716877,0.0020766992,0.00054343545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014374168,0.00040496184,0.01110614,0.000585092,0.0001538439,0.0008410506,0.0013707067,0.09693086,0.046945855,0.7281016,0.007595125,0.10452737],"study_design_scores_gemma":[0.00013487718,0.00012577788,0.0009916665,0.0000266766,0.000060576705,0.00031149865,0.00025823963,0.21881548,0.033046827,0.742559,0.0036179337,0.000051412895],"about_ca_topic_score_codex":0.0019066074,"about_ca_topic_score_gemma":0.0020999159,"teacher_disagreement_score":0.0034871208,"about_ca_system_score_codex":0.0019405439,"about_ca_system_score_gemma":0.002184697,"threshold_uncertainty_score":0.01407975},"labels":[],"label_agreement":null},{"id":"W2152005431","doi":"10.1109/12.862220","title":"Continuous learning automata solutions to the capacity assignment problem","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"semigroups and automata theory","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Network packet; Computer science; Heuristic; Simulated annealing; Automaton; Learning automata; Set (abstract data type); Mathematical optimization; Class (philosophy); Assignment problem; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Computer network","score_opus":0.01753760132844699,"score_gpt":0.21251788692109483,"score_spread":0.19498028559264785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152005431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025410153,0.00050795544,0.963569,0.0003917578,0.00009394094,0.000060964703,0.000116450254,0.0004838906,0.009365875],"genre_scores_gemma":[0.59708023,0.0007009833,0.39165634,0.00015692262,0.0001218163,0.000400493,0.00036263006,0.00013067012,0.009389971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945503,0.00017068199,0.000036885474,0.00014561077,0.0001151138,0.00007669652],"domain_scores_gemma":[0.9976739,0.0016851978,0.00012188843,0.00019634694,0.00021783654,0.00010476671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006357527,0.00082685036,0.00093289244,0.0006240812,0.00064758,0.0014156476,0.0016258297,0.0015832591,0.0051582283],"category_scores_gemma":[0.0032827926,0.00043240326,0.0008410921,0.00073650153,0.0014271872,0.001111341,0.0012926069,0.0017535541,0.000604961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009576975,0.00008697104,0.00033840988,0.00017861577,0.000040997358,0.00011379405,0.00018167718,0.8169832,0.001683957,0.12753145,0.0019795366,0.050785623],"study_design_scores_gemma":[0.000020096368,0.000021357531,0.0000332042,0.0000074017034,0.000005552043,0.000015299669,0.00001763766,0.9511563,0.0004162782,0.04734706,0.0009529743,0.0000067677443],"about_ca_topic_score_codex":0.0027433815,"about_ca_topic_score_gemma":0.0034284617,"teacher_disagreement_score":0.0051582283,"about_ca_system_score_codex":0.0010818647,"about_ca_system_score_gemma":0.0014531673,"threshold_uncertainty_score":0.017255962},"labels":[],"label_agreement":null},{"id":"W2152857032","doi":"10.3233/fi-2012-750","title":"Sheng Yu (1950–2012) In Memoriam","year":2012,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Computer science; Philosophy","score_opus":0.01328618173797886,"score_gpt":0.23743671798966437,"score_spread":0.22415053625168552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152857032","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004865008,0.02973055,0.0012808357,0.17619623,0.78659326,0.000019347015,0.00033913902,0.00012464864,0.005229489],"genre_scores_gemma":[0.021551767,0.024572289,0.0015951149,0.11976039,0.64560103,0.00014552976,0.00060334156,0.00030985606,0.18586063],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984126,0.0003163159,0.00015110498,0.00049584405,0.00050077215,0.00012335661],"domain_scores_gemma":[0.99635845,0.00096666504,0.0002992776,0.00018499815,0.0016278231,0.0005626818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022406068,0.0013992086,0.0014343297,0.0016013919,0.0020023077,0.002855411,0.0012623401,0.0032475854,0.02123627],"category_scores_gemma":[0.016801221,0.00035376052,0.0009056476,0.0010803981,0.001398599,0.0031209146,0.0038797304,0.0058505316,0.013907388],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064723085,0.0000072002854,0.00022909744,0.00015703017,0.000023858796,0.00029494983,0.00011551481,0.000058033333,0.0002020232,0.0029961364,0.9736067,0.022244686],"study_design_scores_gemma":[0.000011179826,0.00001526643,0.00037939937,0.00011083397,0.00001801029,0.00029897192,0.00006611808,0.000077575256,0.00023675538,0.0017667932,0.99700147,0.000017663575],"about_ca_topic_score_codex":0.001612619,"about_ca_topic_score_gemma":0.0022568754,"teacher_disagreement_score":0.02123627,"about_ca_system_score_codex":0.0028208552,"about_ca_system_score_gemma":0.0016176084,"threshold_uncertainty_score":0.07104242},"labels":[],"label_agreement":null},{"id":"W2153168967","doi":"10.1016/s0019-3577(08)80005-5","title":"On the ring of approximation triples attached to a class of extremal real numbers","year":2008,"lang":"en","type":"preprint","venue":"Indagationes Mathematicae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Ring (chemistry); Class (philosophy); Point (geometry); Quotient; Dimension (graph theory); Algebraic number; Space (punctuation); Quotient ring; Polynomial; Discrete mathematics; Combinatorics; Pure mathematics; Polynomial ring; Mathematical analysis; Computer science; Geometry","score_opus":0.04345749382971566,"score_gpt":0.2784454634665455,"score_spread":0.23498796963682983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153168967","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8733338,0.00082395144,0.07618282,0.00097602204,0.00028405376,0.000032252537,0.00027830104,0.00027155803,0.04781732],"genre_scores_gemma":[0.9851715,0.00035597087,0.0063037463,0.000094473406,0.00024228843,0.000026999278,0.00015979078,0.000044439552,0.007600866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934083,0.00016865988,0.000028354965,0.00015971155,0.00017843432,0.00012393885],"domain_scores_gemma":[0.9981121,0.0008588068,0.00034620558,0.00019565056,0.00016692033,0.0003202614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001012642,0.00052341487,0.0009332831,0.0019064242,0.0022153524,0.0037130003,0.00086059433,0.00092032464,0.0059311087],"category_scores_gemma":[0.0024015172,0.00037525594,0.0006098104,0.0013776243,0.0027343677,0.0032792343,0.001767056,0.0017943257,0.0007084416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009364028,0.000014918199,0.0004197035,0.00003051604,0.000009651582,0.00014951691,0.0003325518,0.0012090376,0.001267008,0.9924988,0.000547609,0.0034270277],"study_design_scores_gemma":[0.00003630479,0.000062589825,0.0008748278,0.000022126105,0.00002767011,0.00044975046,0.0002559405,0.010951008,0.0013286234,0.98187065,0.0040893545,0.00003108988],"about_ca_topic_score_codex":0.00041299156,"about_ca_topic_score_gemma":0.00025355883,"teacher_disagreement_score":0.0059311087,"about_ca_system_score_codex":0.0010069659,"about_ca_system_score_gemma":0.00032802683,"threshold_uncertainty_score":0.019841552},"labels":[],"label_agreement":null},{"id":"W2153607460","doi":"10.1017/s1446788700002354","title":"Remarks concerning finitely generated semigroups having regular sets of unique normal forms","year":2001,"lang":"en","type":"article","venue":"Journal of the Australian Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Mitacs; European Commission","keywords":"Mathematics; Decidability; Automaticity; Special classes of semigroups; Closure (psychology); Class (philosophy); Semigroup; Pure mathematics; Finitely-generated abelian group; Krohn–Rhodes theory; Task (project management); Inverse semigroup; Discrete mathematics; Inverse; Algebra over a field; Computer science; Artificial intelligence","score_opus":0.027377457301323772,"score_gpt":0.2660028107670802,"score_spread":0.23862535346575645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153607460","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81548065,0.0017092553,0.10361059,0.010956393,0.0004036267,0.00008435841,0.00032004737,0.000586678,0.06684832],"genre_scores_gemma":[0.9858584,0.00027487963,0.009835696,0.00029437005,0.00028265372,0.00004420196,0.00017593888,0.000038693088,0.0031952348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981421,0.0005996001,0.000100933954,0.00044431913,0.0005327997,0.00018027672],"domain_scores_gemma":[0.9729857,0.023438677,0.0009675893,0.001157968,0.0008723142,0.00057771645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00334254,0.00040982346,0.0005551121,0.0008664589,0.0014510646,0.0026670725,0.0009805,0.0012177681,0.0031289388],"category_scores_gemma":[0.013498671,0.00036147822,0.0009107079,0.00048159578,0.006664264,0.0043399273,0.0010868557,0.0022491768,0.00020133542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021822177,0.00006352148,0.0027766442,0.00016717018,0.000021589703,0.0014129967,0.0027807718,0.004180608,0.005359229,0.9724912,0.0014984389,0.009029627],"study_design_scores_gemma":[0.000024684417,0.00006801035,0.0012660774,0.000027504124,0.000013393603,0.00070571125,0.0006527857,0.0060261395,0.004284531,0.9825815,0.0043270537,0.000022526445],"about_ca_topic_score_codex":0.0005724762,"about_ca_topic_score_gemma":0.00043199642,"teacher_disagreement_score":0.00334254,"about_ca_system_score_codex":0.00073421386,"about_ca_system_score_gemma":0.0003281172,"threshold_uncertainty_score":0.017677248},"labels":[],"label_agreement":null},{"id":"W2153808094","doi":"10.1016/j.disc.2011.12.019","title":"Avoiding 3/2-powers over the natural numbers","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Natural number; Mathematics; Lexicographical order; Sequence (biology); Combinatorics; Discrete mathematics; Natural (archaeology); Arithmetic","score_opus":0.011964409503328352,"score_gpt":0.25287049316825305,"score_spread":0.2409060836649247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153808094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5500071,0.00064441474,0.2623972,0.0012266617,0.00081858714,0.00011990251,0.00017583916,0.000770651,0.18383965],"genre_scores_gemma":[0.9173255,0.00027757813,0.03083138,0.00032093248,0.00021314787,0.00009910813,0.000130132,0.00026277464,0.050539434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878734,0.0003102083,0.00009941771,0.00024173889,0.00028823022,0.00027304114],"domain_scores_gemma":[0.99753284,0.0009925809,0.00034389726,0.000451966,0.00033296467,0.00034575065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009302177,0.00063955184,0.0005559222,0.0009766932,0.002093139,0.003130818,0.00091489346,0.0011390776,0.0092308875],"category_scores_gemma":[0.0033402422,0.0005071582,0.0009969492,0.0006557479,0.00281862,0.005531523,0.002741325,0.0020702258,0.0021275461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009484468,0.000032558055,0.00028355117,0.000038544807,0.0000091660795,0.00029129477,0.00055457774,0.00073094637,0.0037081828,0.98660326,0.001033924,0.006619171],"study_design_scores_gemma":[0.000022078828,0.000030011515,0.000086460575,0.000013996225,0.00000798822,0.00027122753,0.00017091674,0.0022245948,0.0033371535,0.987169,0.0066533317,0.000013237895],"about_ca_topic_score_codex":0.0003316003,"about_ca_topic_score_gemma":0.0005892759,"teacher_disagreement_score":0.0092308875,"about_ca_system_score_codex":0.0006549325,"about_ca_system_score_gemma":0.00048952876,"threshold_uncertainty_score":0.030880392},"labels":[],"label_agreement":null},{"id":"W2154524081","doi":"10.1017/s001309150002099x","title":"Primitive inverse congruences on categorical semigroups","year":2000,"lang":"en","type":"article","venue":"Proceedings of the Edinburgh Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; Wilfrid Laurier University","keywords":"Congruence relation; Inverse semigroup; Categorical variable; Mathematics; Congruence (geometry); Semigroup; Pure mathematics; Inverse; Unitary state; Bicyclic semigroup; Inverse element; Special classes of semigroups; Geometry","score_opus":0.010711778495540654,"score_gpt":0.22031567048570366,"score_spread":0.20960389199016302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154524081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4822324,0.000673159,0.42435345,0.0010868583,0.00033668434,0.00017648637,0.00025213964,0.0006701306,0.09021862],"genre_scores_gemma":[0.9568088,0.0001212307,0.035309557,0.00009433033,0.00019810925,0.00007998171,0.00016474565,0.000060781233,0.007162435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978217,0.00041922845,0.00019974794,0.00039494256,0.0008616722,0.00030274753],"domain_scores_gemma":[0.99812156,0.00054953876,0.00018244881,0.00030552794,0.0004607781,0.0003801182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016627595,0.00030626936,0.00056360546,0.0011427794,0.0010748744,0.0025371318,0.00055538095,0.0006061479,0.0035377704],"category_scores_gemma":[0.0023664345,0.00030926897,0.00067201623,0.00047634487,0.0038227816,0.0037518258,0.0022285455,0.0017291124,0.0005063424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038181097,0.000023214856,0.00025830127,0.000021654685,0.0000027339818,0.00012637254,0.00057920226,0.0003139615,0.004469669,0.9911929,0.00016445848,0.0028094305],"study_design_scores_gemma":[0.00004063879,0.00007624383,0.0007579763,0.00001832459,0.000007807449,0.00032551383,0.00042287997,0.0071846484,0.005101719,0.97625023,0.009791826,0.000022199776],"about_ca_topic_score_codex":0.00050210976,"about_ca_topic_score_gemma":0.0003944861,"teacher_disagreement_score":0.0035377704,"about_ca_system_score_codex":0.0008297402,"about_ca_system_score_gemma":0.00058200344,"threshold_uncertainty_score":0.011835039},"labels":[],"label_agreement":null},{"id":"W2155195622","doi":"10.1016/j.tcs.2005.12.003","title":"Combinatorial properties of smooth infinite words","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Bijection; Mathematics; Combinatorics; Mixing (physics); Monoid; Class (philosophy); Fixed point; Palindrome; Combinatorial algorithms; Computation; Free monoid; Point (geometry); Discrete mathematics; Computer science; Algorithm","score_opus":0.008293644474209383,"score_gpt":0.20828282649396776,"score_spread":0.19998918201975838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155195622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9087008,0.0008561078,0.0528062,0.0008015757,0.00006129063,0.000038122584,0.00031391744,0.00016582564,0.036256026],"genre_scores_gemma":[0.98470217,0.00036281327,0.0077579184,0.000079049416,0.00017682917,0.00005397389,0.0003943051,0.00006357447,0.0064093755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938107,0.00015526867,0.000056217374,0.00014027154,0.00018386758,0.000083299456],"domain_scores_gemma":[0.99494874,0.0033127067,0.0006341427,0.00031101916,0.00037153243,0.0004218001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070642645,0.0006299066,0.0007322814,0.0036741234,0.0016611819,0.0047875633,0.0010839443,0.0008608379,0.005451278],"category_scores_gemma":[0.003967068,0.00073236274,0.00076978205,0.0027751666,0.004035775,0.004977412,0.0015609398,0.0018451578,0.00040062313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007361806,0.00002801639,0.0010306983,0.00006644814,0.000014746685,0.00024682996,0.0005916777,0.0012758262,0.003274511,0.9878093,0.00042283078,0.005165508],"study_design_scores_gemma":[0.00002061824,0.000025412726,0.0011015371,0.0000132098,0.000020745854,0.00028211332,0.00026705468,0.0044239676,0.0009921567,0.991135,0.0016962803,0.000021860975],"about_ca_topic_score_codex":0.000528179,"about_ca_topic_score_gemma":0.00054470316,"teacher_disagreement_score":0.005451278,"about_ca_system_score_codex":0.0009859712,"about_ca_system_score_gemma":0.00035807528,"threshold_uncertainty_score":0.018236399},"labels":[],"label_agreement":null},{"id":"W2156139008","doi":"10.1016/j.tcs.2012.02.030","title":"State complexity of combined operations with two basic operations","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Component (thermodynamics); Upper and lower bounds; Computer science; Computational complexity theory; Mathematics; Theoretical computer science; Algorithm","score_opus":0.020934576738689207,"score_gpt":0.2652000572899269,"score_spread":0.2442654805512377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156139008","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78378123,0.0002854152,0.1955146,0.0009941731,0.000073540854,0.00010270842,0.00084958825,0.00042410585,0.017974779],"genre_scores_gemma":[0.98273736,0.000094947056,0.013737904,0.00004946242,0.00006461232,0.000086808,0.00040843114,0.00007595098,0.0027444132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972012,0.0005816575,0.00021313321,0.00053021894,0.0009231054,0.0005507469],"domain_scores_gemma":[0.97518075,0.019739697,0.00092524453,0.0020182042,0.0011750854,0.0009610961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014916684,0.0005777855,0.0012156223,0.0013264392,0.0012784292,0.005558253,0.0017634598,0.0017629126,0.010792725],"category_scores_gemma":[0.012277385,0.000599128,0.0016780277,0.0016725631,0.0025301906,0.011633482,0.0029096734,0.002515856,0.00055360544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001676141,0.00035162905,0.0037871,0.0002818302,0.000108435146,0.00032640056,0.0009398212,0.08513379,0.010387863,0.86427987,0.0028359403,0.029891193],"study_design_scores_gemma":[0.00007847373,0.00011935543,0.0013649461,0.000017288572,0.000074951735,0.0001267162,0.00015709248,0.313154,0.0056531136,0.6783517,0.0008486656,0.000053626212],"about_ca_topic_score_codex":0.0017446473,"about_ca_topic_score_gemma":0.0015955293,"teacher_disagreement_score":0.010792725,"about_ca_system_score_codex":0.0019548147,"about_ca_system_score_gemma":0.001647333,"threshold_uncertainty_score":0.036105275},"labels":[],"label_agreement":null},{"id":"W2156285174","doi":"10.2168/lmcs-3(2:6)2007","title":"On tractability and congruence distributivity","year":2007,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Division of Mathematical Sciences; Hungarian Scientific Research Fund; Natural Sciences and Engineering Research Council of Canada; Isaac Newton Institute for Mathematical Sciences","keywords":"Distributivity; Distributive property; Congruence (geometry); Mathematics; Bounded function; Variety (cybernetics); Term (time); Conjecture; Sequence (biology); Pure mathematics; Class (philosophy); Discrete mathematics; Invariant (physics); Computer science","score_opus":0.03957083179911924,"score_gpt":0.38527557279438834,"score_spread":0.3457047409952691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156285174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17404859,0.0032561456,0.6775802,0.016964504,0.0002165427,0.0003732787,0.001948024,0.0027844384,0.122828305],"genre_scores_gemma":[0.8362867,0.0023374956,0.13678913,0.0028303368,0.00088688923,0.0011933704,0.002952122,0.0018967888,0.01482721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98725677,0.0055342275,0.00071577664,0.0028979972,0.0023408488,0.0012543447],"domain_scores_gemma":[0.849464,0.13012303,0.0037725172,0.012698142,0.0027103734,0.0012320525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010528842,0.0012622854,0.0022957318,0.002287268,0.0031530603,0.007888192,0.003503297,0.0025113858,0.015758833],"category_scores_gemma":[0.07381305,0.0015207097,0.0044563455,0.0035216042,0.010542154,0.025636187,0.0078579895,0.008763256,0.0023503876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014703078,0.00013301948,0.0013984004,0.00027735118,0.00006112828,0.00024831557,0.0006979208,0.01911561,0.0014710112,0.9631313,0.0028630474,0.010455777],"study_design_scores_gemma":[0.000024601532,0.000016655898,0.00016857868,0.000030793824,0.000016110707,0.00006257944,0.000042945216,0.020218339,0.0005432909,0.9770965,0.0017674302,0.0000121720805],"about_ca_topic_score_codex":0.0029292475,"about_ca_topic_score_gemma":0.003545688,"teacher_disagreement_score":0.015758833,"about_ca_system_score_codex":0.005667296,"about_ca_system_score_gemma":0.0025412163,"threshold_uncertainty_score":0.05568254},"labels":[],"label_agreement":null},{"id":"W2157637221","doi":"10.1016/j.tcs.2004.09.008","title":"Mergible states in large NFA","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Prince Edward Island","funders":"","keywords":"Parameterized complexity; Regular language; Constant (computer programming); Automaton; Deterministic finite automaton; Nondeterministic finite automaton; Mathematics; Finite-state machine; Deterministic automaton; Discrete mathematics; Büchi automaton; State (computer science); Computer science; Combinatorics; Algorithm; Theoretical computer science; Automata theory; Programming language","score_opus":0.005756027207093133,"score_gpt":0.23843631340741395,"score_spread":0.2326802862003208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157637221","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6709726,0.00051378075,0.29068506,0.0015707391,0.00012015867,0.0001065275,0.0004477392,0.0013582426,0.03422513],"genre_scores_gemma":[0.9642668,0.0001138164,0.027587853,0.00012851156,0.00006251445,0.00012066271,0.00023783397,0.00015623168,0.0073256795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988644,0.00031985942,0.00011096983,0.00025905945,0.0002502674,0.00019544768],"domain_scores_gemma":[0.9851467,0.0108488295,0.0008196963,0.0015740681,0.0008979631,0.0007127563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017004336,0.00040116502,0.0010436976,0.0017119412,0.002778736,0.0035954334,0.0010543122,0.001695319,0.0076587903],"category_scores_gemma":[0.010676942,0.00078138465,0.0009339533,0.001091854,0.004654896,0.00902314,0.002578562,0.0023607363,0.00059887796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007417554,0.000035248522,0.0009972815,0.00003979907,0.00000768777,0.00024325143,0.0008678954,0.0032374968,0.0013173559,0.9882377,0.00046665163,0.0044754385],"study_design_scores_gemma":[0.000013098722,0.000007732124,0.00012654191,0.000009134419,0.000007697823,0.00006792512,0.00015701559,0.010672881,0.00043601388,0.9877517,0.0007411578,0.000009074734],"about_ca_topic_score_codex":0.0021785744,"about_ca_topic_score_gemma":0.0031648038,"teacher_disagreement_score":0.0076587903,"about_ca_system_score_codex":0.0014070892,"about_ca_system_score_gemma":0.0008600738,"threshold_uncertainty_score":0.025621176},"labels":[],"label_agreement":null},{"id":"W2158592145","doi":"10.1016/j.tcs.2007.10.029","title":"A characterization of fine words over a finite alphabet","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Lexicographical order; Word (group theory); Prefix; Characterization (materials science); Mathematics; Alphabet; Combinatorics; Aperiodic graph; Combinatorics on words; Discrete mathematics; Linguistics","score_opus":0.006842940091432575,"score_gpt":0.23709594725084926,"score_spread":0.23025300715941668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158592145","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5419572,0.0009549468,0.38735285,0.0015648697,0.00022132376,0.00011645865,0.0011001049,0.0010621803,0.065670095],"genre_scores_gemma":[0.9480259,0.00027105043,0.03284175,0.0002973936,0.00022241211,0.0000924137,0.0008225836,0.00022117134,0.017205281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927384,0.00011586339,0.000068728536,0.00023155237,0.00015875783,0.00015124526],"domain_scores_gemma":[0.9954336,0.0025338242,0.0005926314,0.00050501083,0.00044074992,0.0004942327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005746054,0.0005255272,0.00073605106,0.0022696361,0.0019254147,0.003612795,0.00091702555,0.0012480227,0.0077202213],"category_scores_gemma":[0.004260267,0.0006098002,0.00070471247,0.0018010939,0.0025992424,0.005459852,0.002026979,0.0018597993,0.0010816539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001322949,0.000041967658,0.0014576067,0.00010305761,0.000010384981,0.0003834459,0.0011587836,0.0013661733,0.0073742764,0.9718056,0.0013376503,0.014828915],"study_design_scores_gemma":[0.000015466538,0.000070018534,0.0010702298,0.00004856527,0.000018427127,0.0006723514,0.0005418538,0.008706481,0.0024146517,0.9763248,0.010082877,0.00003427444],"about_ca_topic_score_codex":0.00046909612,"about_ca_topic_score_gemma":0.00041438444,"teacher_disagreement_score":0.0077202213,"about_ca_system_score_codex":0.0007471431,"about_ca_system_score_gemma":0.00039877417,"threshold_uncertainty_score":0.025826752},"labels":[],"label_agreement":null},{"id":"W2159207128","doi":"","title":"On the Behavior of a Variant of Hofstadter's Q-Sequence","year":2007,"lang":"en","type":"article","venue":"Journal of integer sequences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Fibonacci number; Combinatorics; Sequence (biology); Mathematics; Recursion (computer science); Integer (computer science); Partition (number theory); Monotone polygon; Integer sequence; Block (permutation group theory); Discrete mathematics; Algorithm; Generating function; Computer science","score_opus":0.02733554516420093,"score_gpt":0.28144379421011856,"score_spread":0.2541082490459176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159207128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53734756,0.00039648524,0.43478364,0.00045351256,0.00012482292,0.00006389952,0.00006573818,0.0002923397,0.026471995],"genre_scores_gemma":[0.92498875,0.00014194964,0.06895386,0.000106250096,0.00003016621,0.00006481238,0.000060996197,0.00006300173,0.0055902633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997143,0.000089722394,0.000012711296,0.000042905907,0.000075028234,0.00006516478],"domain_scores_gemma":[0.99907744,0.00053211174,0.00009376641,0.0001078144,0.000117730175,0.00007107785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089153525,0.0003316297,0.00034103502,0.00058633124,0.00096161093,0.0008843287,0.00082048733,0.00085547427,0.0036209074],"category_scores_gemma":[0.004253684,0.0001985356,0.0005636522,0.00039801974,0.0017334092,0.0014123854,0.0005730742,0.00074225635,0.000503355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008165225,0.000023728238,0.0010350487,0.000044033386,0.000014554443,0.000282838,0.000428624,0.040159963,0.009009523,0.9389196,0.00051544455,0.009484976],"study_design_scores_gemma":[0.00004063017,0.00008366303,0.0003999822,0.000030832933,0.0000122879555,0.00023529443,0.00016345487,0.41377637,0.0058952156,0.5769192,0.0024075015,0.00003564197],"about_ca_topic_score_codex":0.0019067916,"about_ca_topic_score_gemma":0.0015667285,"teacher_disagreement_score":0.0036209074,"about_ca_system_score_codex":0.0008508154,"about_ca_system_score_gemma":0.0005261014,"threshold_uncertainty_score":0.012113094},"labels":[],"label_agreement":null},{"id":"W2159447498","doi":"10.1007/978-3-319-09704-6_9","title":"Most Complex Regular Right-Ideal Languages","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ideal (ethics); Quotient; Semigroup; Regular language; Mathematics; Alphabet; Discrete mathematics; State (computer science); Combinatorics; Computer science; Algorithm; Automaton; Linguistics; Theoretical computer science; Law","score_opus":0.011298781156436755,"score_gpt":0.23732970020095248,"score_spread":0.22603091904451572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159447498","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1669521,0.0025093257,0.20467152,0.0030727957,0.00041648038,0.00013234843,0.001175786,0.0013638921,0.61970574],"genre_scores_gemma":[0.80872416,0.0016064611,0.037355207,0.0006434954,0.00053233193,0.00015439943,0.001062079,0.00076983566,0.14915194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928826,0.0001002176,0.000046273966,0.0001711222,0.00027005258,0.00012414122],"domain_scores_gemma":[0.9991032,0.00040804842,0.00007447396,0.00016852237,0.00015516866,0.000090679365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006769248,0.0005735819,0.0006579073,0.0009176435,0.0013792069,0.0037322592,0.00079356163,0.000622695,0.018781768],"category_scores_gemma":[0.0014719681,0.00063408917,0.0005972913,0.0008084964,0.0025020048,0.0064448374,0.0015826826,0.00202005,0.0056527853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000465764,0.000014400472,0.00008177337,0.00007514086,0.000005453161,0.00006134257,0.00035736608,0.00032925387,0.0024085848,0.9841427,0.002780789,0.009696567],"study_design_scores_gemma":[0.000015670419,0.000012404434,0.00013329169,0.000025198913,0.000008160054,0.0002597726,0.00013171606,0.0011097129,0.0026653232,0.9704451,0.025177091,0.000016592638],"about_ca_topic_score_codex":0.00027207937,"about_ca_topic_score_gemma":0.00035032537,"teacher_disagreement_score":0.018781768,"about_ca_system_score_codex":0.00083388964,"about_ca_system_score_gemma":0.00043970149,"threshold_uncertainty_score":0.06283134},"labels":[],"label_agreement":null},{"id":"W2159509242","doi":"10.1016/j.ic.2007.02.004","title":"Exponential lower bounds for the number of words of uniform length avoiding a pattern","year":2007,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Alphabet; Exponential growth; Mathematics; Exponential function; Combinatorics; Combinatorics on words; Finite set; Upper and lower bounds; Word length; Discrete mathematics; Word (group theory); Computer science; Natural language processing; Linguistics; Mathematical analysis; Geometry","score_opus":0.01120924040276972,"score_gpt":0.26443390570068526,"score_spread":0.25322466529791554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159509242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32002833,0.009981264,0.5339245,0.019084362,0.001552552,0.0003791672,0.004710548,0.0034103007,0.10692896],"genre_scores_gemma":[0.852554,0.004190317,0.09999193,0.002512694,0.002632023,0.0010775744,0.0033585636,0.001735812,0.031947244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906881,0.001708113,0.00067865226,0.0020855975,0.0027765047,0.0020630811],"domain_scores_gemma":[0.88502765,0.094589524,0.0035928898,0.009810133,0.0037526027,0.0032270777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006647013,0.0028881566,0.0035851286,0.0040373565,0.0033988147,0.011011535,0.008425167,0.004852858,0.02370249],"category_scores_gemma":[0.058933835,0.0021252048,0.0028139413,0.0043785037,0.0066107535,0.025655566,0.007196305,0.00834576,0.0041339993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00442238,0.0006970793,0.005272193,0.0016545,0.00031112524,0.00065427227,0.001189439,0.06909447,0.019455573,0.79440635,0.02477756,0.07806503],"study_design_scores_gemma":[0.00020336635,0.0001376409,0.0009469728,0.00014778702,0.00018551307,0.000637572,0.00013137105,0.14441681,0.0066871764,0.840969,0.005432974,0.0001037475],"about_ca_topic_score_codex":0.0010004529,"about_ca_topic_score_gemma":0.001529787,"teacher_disagreement_score":0.02370249,"about_ca_system_score_codex":0.0055110715,"about_ca_system_score_gemma":0.0030758216,"threshold_uncertainty_score":0.079292774},"labels":[],"label_agreement":null},{"id":"W2160340816","doi":"10.1007/978-3-642-31653-1_22","title":"Unambiguous Constrained Automata","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Decidability; Automaton; Computer science; Class (philosophy); Bounded function; Closure (psychology); Set (abstract data type); Discrete mathematics; Tree automaton; Theoretical computer science; Mathematics; Programming language; Artificial intelligence","score_opus":0.014430594525762862,"score_gpt":0.23289091132539946,"score_spread":0.2184603167996366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160340816","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020451134,0.0055071716,0.31377783,0.0014699163,0.0011247841,0.00016346473,0.0008289408,0.0013808745,0.65529585],"genre_scores_gemma":[0.54569584,0.0066626254,0.108871534,0.0009664343,0.0007351508,0.00043196604,0.0020404349,0.0012235659,0.33337247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994791,0.00008833165,0.000036187026,0.00013486242,0.00020331079,0.000058230908],"domain_scores_gemma":[0.9994885,0.00018144243,0.000025639083,0.0001594198,0.00010961226,0.00003536382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002966625,0.0007655129,0.00052024965,0.00085785124,0.0012956643,0.0025510653,0.0008253267,0.0007844065,0.028009623],"category_scores_gemma":[0.0016052703,0.000538464,0.00047293352,0.0013967715,0.0016498899,0.004242596,0.002070213,0.001670577,0.005781474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018065844,0.000016389013,0.00004180908,0.00008954375,0.00000360968,0.000056738623,0.0001700782,0.0009122133,0.0015941556,0.9510456,0.006733903,0.039317887],"study_design_scores_gemma":[0.0000054135535,0.00000940778,0.00007183543,0.00004817847,0.0000067978276,0.00010450179,0.00006197009,0.0021357425,0.0020765853,0.88645905,0.10900787,0.000012638683],"about_ca_topic_score_codex":0.0008143415,"about_ca_topic_score_gemma":0.0010253233,"teacher_disagreement_score":0.028009623,"about_ca_system_score_codex":0.0009434439,"about_ca_system_score_gemma":0.0008732067,"threshold_uncertainty_score":0.09370154},"labels":[],"label_agreement":null},{"id":"W2161035123","doi":"10.1007/978-3-642-13675-7_8","title":"A Characterization of Combined Traces Using Labeled Stratified Order Structures","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Characterization (materials science); Quotient; Representation (politics); Dependency (UML); Graph; Mathematics; Order (exchange); Class (philosophy); Computer science; Pure mathematics; Discrete mathematics; Artificial intelligence; Materials science; Nanotechnology","score_opus":0.01463442094236324,"score_gpt":0.23834881888907516,"score_spread":0.2237143979467119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161035123","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1546427,0.0002529558,0.8165854,0.0004029971,0.00010684931,0.00018320695,0.0005731415,0.0014935364,0.025759194],"genre_scores_gemma":[0.8059675,0.00036573858,0.1651862,0.00020796414,0.00024018042,0.00025361334,0.0011088209,0.00079418364,0.025875717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99760485,0.00035139266,0.00024249274,0.00052747974,0.00089869654,0.00037503266],"domain_scores_gemma":[0.99317366,0.0030158698,0.00062307704,0.0013082707,0.0012283128,0.0006507787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014189829,0.00090369734,0.0009444949,0.0028977396,0.0020604813,0.0059240563,0.0021556201,0.0014177117,0.008462647],"category_scores_gemma":[0.0064303293,0.0011816539,0.0018446003,0.0031522946,0.0035413273,0.012147215,0.0036736014,0.0029459596,0.0015909978],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014670173,0.0000762701,0.0014533801,0.00008392288,0.000030097806,0.00037973915,0.0010954656,0.0037595506,0.006740211,0.9671689,0.00085780554,0.018207831],"study_design_scores_gemma":[0.000031002808,0.00011673678,0.00074275513,0.00007091634,0.000085621665,0.0004487301,0.0006215736,0.057022367,0.009052631,0.9217396,0.0100074485,0.000060651826],"about_ca_topic_score_codex":0.0019197791,"about_ca_topic_score_gemma":0.0021371727,"teacher_disagreement_score":0.008462647,"about_ca_system_score_codex":0.0015252496,"about_ca_system_score_gemma":0.0014156664,"threshold_uncertainty_score":0.028310359},"labels":[],"label_agreement":null},{"id":"W2161721062","doi":"10.1016/j.jnt.2014.05.003","title":"On the fractional parts of powers of Pisot numbers of length at most 4","year":2014,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Lietuvos Mokslo Taryba","keywords":"Mathematics; Degree (music); Combinatorics; Interval (graph theory); Sequence (biology); Limit point; Limit (mathematics); Discrete mathematics; Mathematical analysis","score_opus":0.00852299512625204,"score_gpt":0.2303911730282221,"score_spread":0.22186817790197005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161721062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51708794,0.0039437097,0.30008382,0.0032707024,0.0019060108,0.00008732347,0.00028093462,0.00042174273,0.1729178],"genre_scores_gemma":[0.9549006,0.001024084,0.022288041,0.00054643495,0.0008766349,0.000093478564,0.00020828239,0.00029819235,0.019764306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987295,0.00039257924,0.0000727036,0.0001822013,0.00034386717,0.00027906313],"domain_scores_gemma":[0.99067396,0.006890954,0.00068659056,0.0006043607,0.00054860755,0.00059558253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023775152,0.0012895095,0.0014531252,0.0026543809,0.0022081598,0.0040286244,0.0017091834,0.0016690412,0.011212547],"category_scores_gemma":[0.01581609,0.0009085533,0.0013068925,0.0017288036,0.0059858453,0.0075380993,0.0022634766,0.00287998,0.0014218687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001880731,0.000019441704,0.0003374255,0.000043989745,0.000011274919,0.0002308761,0.00035254663,0.0027735534,0.0012157204,0.98785895,0.0010618427,0.005906303],"study_design_scores_gemma":[0.000013326529,0.00001937675,0.00019412661,0.000036766614,0.000010888295,0.00011427297,0.00007087802,0.011033526,0.00047216698,0.98616725,0.0018530282,0.000014394374],"about_ca_topic_score_codex":0.0007780919,"about_ca_topic_score_gemma":0.00064760126,"teacher_disagreement_score":0.011212547,"about_ca_system_score_codex":0.0014872695,"about_ca_system_score_gemma":0.0007309912,"threshold_uncertainty_score":0.03750974},"labels":[],"label_agreement":null},{"id":"W2161913867","doi":"10.1016/j.jalgebra.2006.05.020","title":"On the rational subset problem for groups","year":2006,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Centro de Matemática Universidade do Porto; Natural Sciences and Engineering Research Council of Canada; European Science Foundation","keywords":"Decidability; Mathematics; Free product; Monoid; Abelian group; Combinatorics; Discrete mathematics; Free monoid; Commutative property; Group (periodic table); Direct product","score_opus":0.009193522760611693,"score_gpt":0.2132131024672273,"score_spread":0.2040195797066156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161913867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40305772,0.0070404164,0.3746838,0.051014993,0.0010255935,0.00020833492,0.0009014087,0.00072096294,0.16134678],"genre_scores_gemma":[0.91006285,0.0037128783,0.055021297,0.0016499636,0.0013829457,0.00016503356,0.0013826726,0.00032014493,0.026302226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811184,0.0007540946,0.0001260435,0.00036720105,0.00033071567,0.0003101564],"domain_scores_gemma":[0.98714685,0.011055249,0.00029973447,0.0007108212,0.0003687669,0.00041860374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003312712,0.000905205,0.002948528,0.0015474579,0.003414948,0.0068879775,0.0019491013,0.0038302778,0.013829667],"category_scores_gemma":[0.013255508,0.0009072566,0.0017153878,0.0026113507,0.006305016,0.0219959,0.004081188,0.0048722588,0.0011414308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001822003,0.000062326646,0.00037082014,0.0001248906,0.000024814724,0.00012300645,0.0005850073,0.0042590867,0.00039444017,0.9766797,0.0064387186,0.010755141],"study_design_scores_gemma":[0.000029545152,0.0000089033965,0.00006236489,0.000015949332,0.000008291989,0.000038289767,0.00020188387,0.0057886117,0.00013774927,0.99178785,0.0019130001,0.0000076826855],"about_ca_topic_score_codex":0.001918348,"about_ca_topic_score_gemma":0.0015653893,"teacher_disagreement_score":0.013829667,"about_ca_system_score_codex":0.0022694566,"about_ca_system_score_gemma":0.0012101255,"threshold_uncertainty_score":0.046264887},"labels":[],"label_agreement":null},{"id":"W2162199371","doi":"10.1007/3-540-44685-0_17","title":"An Algebraic Characterization of Data and Timed Languages","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decidability; Computer science; Automaton; Closure (psychology); Abstract family of languages; Regular language; Programming language; Characterization (materials science); Class (philosophy); Algebraic number; Theoretical computer science; Algebra over a field; Second-generation programming language; Artificial intelligence; Mathematics; Fifth-generation programming language; Pure mathematics","score_opus":0.016158389950387916,"score_gpt":0.2599235246412766,"score_spread":0.24376513469088867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162199371","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04978241,0.0016515474,0.87520516,0.0019623977,0.00049930654,0.000139204,0.0009229732,0.00078000035,0.06905707],"genre_scores_gemma":[0.70214885,0.0026064825,0.25376633,0.00081356394,0.0016069907,0.0005203845,0.0014674738,0.0005825085,0.036487453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985506,0.00021593159,0.00020562996,0.00036776767,0.0004766369,0.0001834469],"domain_scores_gemma":[0.9963218,0.0018603507,0.00035992888,0.0005313913,0.00066824164,0.00025842688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014036308,0.00082253094,0.00092182576,0.0024552587,0.0019687384,0.006160829,0.0016795243,0.00090306083,0.006238562],"category_scores_gemma":[0.0046601677,0.00096057524,0.0016354425,0.003396832,0.004875112,0.013506012,0.0033823377,0.0038951135,0.0013192684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001925653,0.000008270867,0.00007756001,0.000032558317,0.0000033150213,0.000039038245,0.00018953258,0.00045442875,0.00060702703,0.9930443,0.00055143953,0.004973204],"study_design_scores_gemma":[0.00001386967,0.000018856077,0.000075489355,0.000019336218,0.00001587526,0.00015911371,0.00011531684,0.0058300234,0.0009493533,0.9790213,0.013767637,0.000013841946],"about_ca_topic_score_codex":0.0012707568,"about_ca_topic_score_gemma":0.0008983001,"teacher_disagreement_score":0.006238562,"about_ca_system_score_codex":0.0017206232,"about_ca_system_score_gemma":0.0010988414,"threshold_uncertainty_score":0.02087003},"labels":[],"label_agreement":null},{"id":"W2163125260","doi":"10.1142/s0129054113400339","title":"UNAMBIGUOUS CONSTRAINED AUTOMATA","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Decidability; Class (philosophy); Automaton; Closure (psychology); Set (abstract data type); Bounded function; Discrete mathematics; Mathematics; Tree automaton; Computer science; Combinatorics; Theoretical computer science; Programming language","score_opus":0.011032883667456058,"score_gpt":0.2731136558638009,"score_spread":0.2620807721963448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163125260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08829412,0.0008049485,0.86348134,0.0008140425,0.00022329878,0.00032153155,0.0016733393,0.002249374,0.042138096],"genre_scores_gemma":[0.81058306,0.0007520307,0.17480117,0.000582156,0.00016269079,0.00045178918,0.0014242008,0.00031092088,0.010932001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972446,0.0004478833,0.00028664063,0.0008587558,0.00080453785,0.0003575867],"domain_scores_gemma":[0.9932313,0.0029447572,0.0008949256,0.0017235639,0.0008910286,0.00031455644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010751836,0.0006881305,0.00067492406,0.00068606914,0.0013254117,0.0033582489,0.0016922478,0.0010525394,0.00642074],"category_scores_gemma":[0.007505685,0.00051425764,0.0011604471,0.0010221316,0.0024791062,0.0045308033,0.0025141754,0.0019124355,0.0010436286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010508206,0.00006624574,0.0007850138,0.00016416474,0.000019856312,0.00041350236,0.0004022545,0.01394763,0.009526296,0.95219916,0.001928226,0.020442516],"study_design_scores_gemma":[0.00004540919,0.00006546067,0.000468116,0.00006389849,0.00004740036,0.00045638005,0.00023621,0.06630538,0.0115346005,0.8930016,0.027710719,0.00006474926],"about_ca_topic_score_codex":0.0028671927,"about_ca_topic_score_gemma":0.0034223837,"teacher_disagreement_score":0.00642074,"about_ca_system_score_codex":0.0009609629,"about_ca_system_score_gemma":0.0021728363,"threshold_uncertainty_score":0.021479487},"labels":[],"label_agreement":null},{"id":"W2163285607","doi":"10.1016/s0304-3975(02)00398-5","title":"Periodicity, morphisms, and matrices","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Mathematics; Conjecture; Iterated function; Combinatorics; Constant (computer programming); Word (group theory); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.006621511833063064,"score_gpt":0.22147273379972024,"score_spread":0.21485122196665718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163285607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38838091,0.014803793,0.47517875,0.0058220997,0.0012884843,0.00007241009,0.0005610585,0.0007285468,0.113163956],"genre_scores_gemma":[0.91671854,0.003066133,0.053779934,0.0003931616,0.0010349813,0.00011348539,0.00029224635,0.000093009214,0.024508419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913114,0.00028044602,0.000063377694,0.00025962386,0.00016964681,0.000095874224],"domain_scores_gemma":[0.99751943,0.0015187118,0.00025266482,0.0003694496,0.00017053643,0.00016921993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010929015,0.0004119604,0.00068348314,0.001298799,0.0013696745,0.002277218,0.00047375314,0.0009843905,0.005056473],"category_scores_gemma":[0.0036670973,0.00045909648,0.00058709737,0.001352664,0.004265319,0.0061969617,0.0014149062,0.0015540288,0.00079324027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003652347,0.000012685952,0.00022401797,0.000033185202,0.000003496564,0.00004989249,0.00027207128,0.00051153963,0.00067836826,0.9861123,0.00098927,0.011076663],"study_design_scores_gemma":[0.000006321171,0.00001323298,0.0001318313,0.0000063337043,0.0000029279056,0.00007298622,0.000050232687,0.0012817755,0.00018900393,0.9956524,0.0025862334,0.0000067796473],"about_ca_topic_score_codex":0.0006452245,"about_ca_topic_score_gemma":0.0006351365,"teacher_disagreement_score":0.005056473,"about_ca_system_score_codex":0.00073593465,"about_ca_system_score_gemma":0.00056874036,"threshold_uncertainty_score":0.01691556},"labels":[],"label_agreement":null},{"id":"W2163424543","doi":"10.1016/j.disc.2009.01.022","title":"Packing and covering <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mstyle mathvariant=\"bold\"><mml:mi>k</mml:mi></mml:mstyle></mml:math>-chain free subsets in Boolean lattices","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Chain (unit); Hypergraph; Center (category theory); Discrete mathematics; Crystallography; Physics","score_opus":0.014458789890085151,"score_gpt":0.23765184926040478,"score_spread":0.22319305937031964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163424543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21963246,0.002641616,0.554376,0.0018414159,0.00050997984,0.00012720408,0.00178637,0.0010539944,0.21803094],"genre_scores_gemma":[0.83542305,0.0017305256,0.103396855,0.00029968016,0.00033160864,0.00012268296,0.0020002164,0.00056978036,0.056125525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910223,0.00022746797,0.00007901513,0.00019849061,0.000234649,0.0001582469],"domain_scores_gemma":[0.9983392,0.0008029675,0.00014952323,0.00039228305,0.00015247712,0.00016365568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006145103,0.0004428141,0.0007759616,0.0012615877,0.0015676259,0.003056683,0.0005058101,0.00076262304,0.015277231],"category_scores_gemma":[0.003164387,0.00053199066,0.0009303236,0.0017785397,0.002154612,0.0048882626,0.0020450028,0.0011365348,0.0025324286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007872755,0.000022482223,0.0003636359,0.0000879353,0.0000094248135,0.00014336758,0.0004251497,0.002387864,0.0016828488,0.96396226,0.0066658007,0.0241704],"study_design_scores_gemma":[0.000011388646,0.00002770466,0.00044171492,0.000029053375,0.000010758569,0.00024144062,0.00020491131,0.008379906,0.0026538202,0.9710226,0.016959807,0.000016954022],"about_ca_topic_score_codex":0.0014826484,"about_ca_topic_score_gemma":0.0016466532,"teacher_disagreement_score":0.015277231,"about_ca_system_score_codex":0.0010521875,"about_ca_system_score_gemma":0.0004752684,"threshold_uncertainty_score":0.051107466},"labels":[],"label_agreement":null},{"id":"W2164278564","doi":"10.1007/3-540-36285-1_16","title":"New Rewritings and Optimizations for Regular Path Queries","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Path (computing); Conjunctive query; Regular expression; Path expression; Database query; Theoretical computer science; Query language; Algorithm; Relational database; Database; Programming language","score_opus":0.011993411357859278,"score_gpt":0.2162608945504441,"score_spread":0.2042674831925848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164278564","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022471817,0.0012626644,0.94365925,0.000909929,0.0005173787,0.00030325976,0.00059541804,0.0077932617,0.02248698],"genre_scores_gemma":[0.16748607,0.0010730467,0.80031466,0.0005052302,0.0006430674,0.00032402508,0.0014812733,0.0043204376,0.02385214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99535805,0.0008712167,0.0005238211,0.0008180695,0.0019615719,0.00046713033],"domain_scores_gemma":[0.9951767,0.0020630853,0.00020708686,0.0018325389,0.0005929261,0.00012767014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001829932,0.0010798255,0.0014442806,0.001510243,0.0011825733,0.0027460742,0.0027335212,0.0011458113,0.0108743645],"category_scores_gemma":[0.008488133,0.0012302211,0.002297173,0.0027142614,0.0020284343,0.008470477,0.0025136347,0.0041527837,0.0029079681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045595653,0.00033819795,0.0006265583,0.0006246861,0.00011902881,0.0004237303,0.0009858792,0.014426927,0.023473995,0.4996734,0.025936509,0.43291506],"study_design_scores_gemma":[0.0001309443,0.00012172396,0.0006073419,0.00009104826,0.00028377815,0.0006904687,0.00025240873,0.10947312,0.028632652,0.8000177,0.05957147,0.00012744451],"about_ca_topic_score_codex":0.0012736627,"about_ca_topic_score_gemma":0.0029324288,"teacher_disagreement_score":0.0108743645,"about_ca_system_score_codex":0.001396951,"about_ca_system_score_gemma":0.00093921745,"threshold_uncertainty_score":0.036378384},"labels":[],"label_agreement":null},{"id":"W2164513665","doi":"10.1145/773153.773165","title":"Query containment and rewriting using views for regular path queries under constraints","year":2003,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Rewriting; Containment (computer programming); Computer science; Path (computing); Query optimization; Path expression; Query language; Theoretical computer science; Programming language; Information retrieval","score_opus":0.039757499225684785,"score_gpt":0.2718654214188744,"score_spread":0.2321079221931896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164513665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045413557,0.00042621218,0.94927466,0.0004175537,0.00004279046,0.00022827357,0.0002306725,0.00085573737,0.0031106651],"genre_scores_gemma":[0.48391443,0.0005185332,0.5113562,0.0002640117,0.00010289454,0.00025235346,0.000849972,0.00033320888,0.0024084088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927303,0.002603354,0.0007919473,0.0014041557,0.001982923,0.00048729585],"domain_scores_gemma":[0.98402786,0.011333086,0.0008227275,0.002445093,0.0011039763,0.00026725238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037046948,0.00054527324,0.0012477041,0.00081106485,0.0008276859,0.0030334191,0.001333819,0.0010822348,0.002023599],"category_scores_gemma":[0.017656684,0.00058564486,0.0016787826,0.001280732,0.0025573424,0.0063577904,0.0020866184,0.0017080171,0.00032899177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033472883,0.00015935072,0.002342506,0.00086329225,0.00017683623,0.0010588563,0.0024249298,0.09106976,0.032145403,0.73051125,0.00286634,0.13604675],"study_design_scores_gemma":[0.00006787912,0.00016724344,0.00051138626,0.00008406922,0.00013623221,0.0007329201,0.0007000312,0.3369616,0.035900008,0.6109358,0.013726928,0.000075904376],"about_ca_topic_score_codex":0.0028445798,"about_ca_topic_score_gemma":0.0027937866,"teacher_disagreement_score":0.0037046948,"about_ca_system_score_codex":0.0011727789,"about_ca_system_score_gemma":0.0015813103,"threshold_uncertainty_score":0.019592524},"labels":[],"label_agreement":null},{"id":"W2166588729","doi":"10.1145/1017074.1017096","title":"On validation of XML streams using finite state machines","year":2004,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Finite-state machine; XML; STREAMS; State (computer science); Programming language; Finite state; Database; Operating system; Machine learning","score_opus":0.016053622204277765,"score_gpt":0.25164660744798417,"score_spread":0.23559298524370642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166588729","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059475172,0.0005289485,0.93544126,0.0006312147,0.000060096234,0.00014252923,0.0001031351,0.0009904015,0.0026272337],"genre_scores_gemma":[0.6920629,0.0012594449,0.30070055,0.0003805536,0.00021467778,0.0005369036,0.0005553252,0.0005135223,0.003776132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98796046,0.005833512,0.0010914453,0.0018042586,0.0023892582,0.00092112046],"domain_scores_gemma":[0.85679525,0.12652713,0.004453417,0.00791454,0.003611619,0.0006980608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010666929,0.001522515,0.0016676657,0.0021230693,0.0020921563,0.0031298418,0.0025473263,0.0029922968,0.0025657876],"category_scores_gemma":[0.059470695,0.0011620297,0.003174733,0.0022925036,0.007832594,0.01141772,0.0041364166,0.003043293,0.00049580267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075582345,0.00023529216,0.0034138612,0.00061911874,0.000118868986,0.0011368305,0.0015515392,0.4497584,0.0145484125,0.4783252,0.0011483679,0.048388295],"study_design_scores_gemma":[0.00006460241,0.00014202972,0.00026562164,0.00011078716,0.000054148146,0.00022975191,0.00008880782,0.68234867,0.015308331,0.29943344,0.0018931065,0.000060707047],"about_ca_topic_score_codex":0.0029262018,"about_ca_topic_score_gemma":0.0015224484,"teacher_disagreement_score":0.010666929,"about_ca_system_score_codex":0.00306374,"about_ca_system_score_gemma":0.002026465,"threshold_uncertainty_score":0.056412756},"labels":[],"label_agreement":null},{"id":"W2166846151","doi":"10.1016/j.tcs.2013.06.003","title":"State complexity of star of union and square of union on k regular languages","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Star (game theory); Square (algebra); Regular language; Mathematics; Component (thermodynamics); Discrete mathematics; Combinatorics; Computer science; Theoretical computer science; Algorithm; Automaton; Geometry; Physics","score_opus":0.011941278949197592,"score_gpt":0.24203050426044778,"score_spread":0.2300892253112502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166846151","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95428795,0.00018999954,0.03504146,0.0012231009,0.000028090088,0.000046176894,0.0008564694,0.0003137122,0.008013001],"genre_scores_gemma":[0.994369,0.00005983087,0.00309196,0.000041624648,0.000027469427,0.00002957654,0.0004341874,0.000057133933,0.0018892231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768806,0.0005005547,0.00016996541,0.00048601054,0.0005097584,0.000645661],"domain_scores_gemma":[0.96395695,0.028426193,0.0018754499,0.002215154,0.001626004,0.0019001828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016340332,0.000407375,0.001463563,0.0010758645,0.0019547215,0.006220172,0.0018653326,0.0017927507,0.012558928],"category_scores_gemma":[0.017324544,0.00072591763,0.0015291848,0.0013788228,0.0028301924,0.010826432,0.0030480057,0.0026246621,0.00056382315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003387987,0.0003358082,0.015817411,0.00035535925,0.0001226876,0.00050778885,0.003094336,0.119728565,0.007453255,0.82337475,0.00511845,0.020703629],"study_design_scores_gemma":[0.0001254991,0.00012083294,0.003083996,0.000022843988,0.000069852555,0.00015171798,0.0005970209,0.39914373,0.0034389128,0.5924264,0.00075321714,0.00006592431],"about_ca_topic_score_codex":0.006528023,"about_ca_topic_score_gemma":0.006073799,"teacher_disagreement_score":0.012558928,"about_ca_system_score_codex":0.0031825108,"about_ca_system_score_gemma":0.0028157923,"threshold_uncertainty_score":0.042013824},"labels":[],"label_agreement":null},{"id":"W2167520368","doi":"10.37236/1108","title":"Binary Words Containing Infinitely Many Overlaps","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Binary number; Discrete mathematics; Arithmetic","score_opus":0.005592234311851341,"score_gpt":0.21008657108623313,"score_spread":0.20449433677438178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167520368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76196116,0.0006351023,0.20028025,0.00055351463,0.0001986213,0.000056372726,0.00028647014,0.00041709718,0.035611413],"genre_scores_gemma":[0.953468,0.0002191242,0.03321981,0.00017716759,0.00012191691,0.000095569085,0.000298657,0.0001341013,0.012265676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993586,0.000108370026,0.00005108099,0.00014953753,0.00019004791,0.00014232453],"domain_scores_gemma":[0.99780375,0.0010894253,0.00029567044,0.00023657108,0.00033538567,0.00023909187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039024375,0.00065772387,0.00052769843,0.0006569815,0.0014090133,0.0011762724,0.0006302696,0.00052885356,0.0040110475],"category_scores_gemma":[0.002322631,0.00034208645,0.00038460927,0.00077168876,0.0016385918,0.002970058,0.0018030796,0.00097018265,0.00093417586],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041170392,0.00008059714,0.0022398208,0.00024346635,0.00002444457,0.0014287807,0.0017491068,0.0033178495,0.036518604,0.9213838,0.0017248607,0.030876912],"study_design_scores_gemma":[0.000043429936,0.00010243446,0.0013247082,0.00006674716,0.00005743297,0.0011599521,0.0006766499,0.016016869,0.038539924,0.92049813,0.021442374,0.00007131368],"about_ca_topic_score_codex":0.00029991614,"about_ca_topic_score_gemma":0.0003699781,"teacher_disagreement_score":0.0040110475,"about_ca_system_score_codex":0.00040931025,"about_ca_system_score_gemma":0.00033160913,"threshold_uncertainty_score":0.013418257},"labels":[],"label_agreement":null},{"id":"W2168854371","doi":"10.1142/s0129054107005443","title":"STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Deterministic finite automaton; Nondeterministic finite automaton; Finite-state machine; Quantum finite automata; Automaton; Mathematics; Regular language; DFA minimization; ω-automaton; Simple (philosophy); Upper and lower bounds; State (computer science); Discrete mathematics; Finite state; Automata theory; Combinatorics; Theoretical computer science; Computer science; Algorithm","score_opus":0.02620600082371652,"score_gpt":0.3086807984164208,"score_spread":0.28247479759270433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168854371","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6778781,0.00020348668,0.3122821,0.00046957293,0.00003981297,0.00006315156,0.000502984,0.0006286646,0.007932081],"genre_scores_gemma":[0.96566355,0.00011995454,0.030377062,0.00005368302,0.00002298447,0.00010044892,0.00045290796,0.000059599093,0.0031497974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806935,0.00037046144,0.00023798787,0.00050638756,0.00060419075,0.00021166375],"domain_scores_gemma":[0.9944383,0.0035520955,0.000507168,0.0008410027,0.00042628867,0.00023518658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083681924,0.00035989736,0.00071547955,0.00075607933,0.0006161703,0.0027296336,0.0014477838,0.0007222693,0.0034690797],"category_scores_gemma":[0.0058365124,0.00037126773,0.0012443673,0.00073091564,0.0014089221,0.004610156,0.0020554673,0.0014924237,0.00035860908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047913057,0.0001741547,0.0036897091,0.00029363544,0.000108979904,0.00047113138,0.0010474978,0.18397899,0.02699163,0.73768765,0.0010965719,0.043980997],"study_design_scores_gemma":[0.000025305435,0.00008852349,0.0008342102,0.000015984448,0.000062353,0.00013519246,0.00010977011,0.3734566,0.012838097,0.6109838,0.0014137647,0.00003652618],"about_ca_topic_score_codex":0.0013110902,"about_ca_topic_score_gemma":0.0011444739,"teacher_disagreement_score":0.0034690797,"about_ca_system_score_codex":0.0010404295,"about_ca_system_score_gemma":0.0005767219,"threshold_uncertainty_score":0.011605203},"labels":[],"label_agreement":null},{"id":"W2169267790","doi":"10.1142/s0129054111009045","title":"STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; Intersection (aeronautics); State (computer science); Combined operations; Mathematics; Computer science; Algorithm; Engineering; Law","score_opus":0.041020828804904735,"score_gpt":0.29559549966654275,"score_spread":0.254574670861638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169267790","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67782956,0.0005595358,0.2931658,0.001492642,0.00011030466,0.00027086286,0.0011679335,0.0009481279,0.024455244],"genre_scores_gemma":[0.95962113,0.00022532101,0.035039008,0.00006815096,0.00004602336,0.00022595559,0.0006715088,0.00023019186,0.0038727168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99563295,0.0008042256,0.0003178159,0.0009132637,0.0014714723,0.0008601541],"domain_scores_gemma":[0.9673524,0.024808945,0.001849733,0.0033910284,0.0018256722,0.0007722439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020091503,0.00062341447,0.00095214596,0.001380884,0.0018221196,0.0056914142,0.0016900115,0.0013598235,0.011622532],"category_scores_gemma":[0.022056995,0.0006251745,0.0018866758,0.0013649423,0.0027901425,0.01293034,0.0033371116,0.0029683276,0.00071822375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018160283,0.00050183694,0.012237429,0.0008018567,0.00025666447,0.0004944705,0.001416153,0.12084978,0.023201939,0.77169836,0.003197071,0.06352846],"study_design_scores_gemma":[0.00009901859,0.0003254789,0.0037953886,0.00006275293,0.000299448,0.0004776261,0.000649473,0.42027918,0.046352178,0.52192926,0.005559968,0.0001701358],"about_ca_topic_score_codex":0.001933558,"about_ca_topic_score_gemma":0.0019284087,"teacher_disagreement_score":0.011622532,"about_ca_system_score_codex":0.0030591208,"about_ca_system_score_gemma":0.0032169553,"threshold_uncertainty_score":0.038881183},"labels":[],"label_agreement":null},{"id":"W2170001390","doi":"10.1016/j.ic.2017.06.003","title":"Space proof complexity for random 3-CNFs","year":2017,"lang":"en","type":"preprint","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"European Research Council; Seventh Framework Programme; Sapienza Università di Roma; European Commission; Simons Foundation","keywords":"Lemma (botany); Mathematics; Combinatorics; Omega; Bipartite graph; Resolution (logic); Monomial; Upper and lower bounds; Discrete mathematics; Space (punctuation); Algebraic number; Disjoint sets; Physics; Computer science; Mathematical analysis; Graph","score_opus":0.03906740328881324,"score_gpt":0.29528677347701904,"score_spread":0.2562193701882058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170001390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33335438,0.0024885032,0.59984744,0.012446426,0.0005023463,0.00046700053,0.003961657,0.0026046704,0.044327527],"genre_scores_gemma":[0.9252646,0.00068113056,0.058859173,0.0008119564,0.0003554452,0.0003252917,0.0014731319,0.0005850604,0.011644174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99135685,0.0024387978,0.0004723688,0.001308906,0.0029785235,0.0014444411],"domain_scores_gemma":[0.95100117,0.038234703,0.0016395039,0.0056287744,0.0021738664,0.0013219701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004919099,0.0010823405,0.0021901296,0.0016290118,0.0023657435,0.0070055034,0.003166006,0.0029367427,0.025940761],"category_scores_gemma":[0.031899855,0.0009165294,0.002519627,0.002221178,0.0034981822,0.014525372,0.0043548536,0.00450438,0.001906025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006758948,0.00017438205,0.0017195649,0.00047832634,0.00009756978,0.00018405246,0.00071326544,0.04944695,0.0028305422,0.8967043,0.010677001,0.036298085],"study_design_scores_gemma":[0.00006797593,0.000021367354,0.00018653163,0.000028875282,0.000036823058,0.00006825806,0.00005692475,0.08275544,0.0011008284,0.9141338,0.0015210727,0.00002217078],"about_ca_topic_score_codex":0.0044975723,"about_ca_topic_score_gemma":0.0057116454,"teacher_disagreement_score":0.025940761,"about_ca_system_score_codex":0.005395846,"about_ca_system_score_gemma":0.006568772,"threshold_uncertainty_score":0.08678043},"labels":[],"label_agreement":null},{"id":"W2170271350","doi":"10.1007/978-3-540-85238-4_21","title":"On a Special Class of Primitive Words","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Complement (music); Word (group theory); Complementarity (molecular biology); Mathematics; Combinatorics; Class (philosophy); Sequence (biology); Combinatorics on words; Discrete mathematics; Computer science; Biology; Artificial intelligence; Genetics","score_opus":0.013332276532949107,"score_gpt":0.2273662514768892,"score_spread":0.21403397494394008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170271350","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26065555,0.004410755,0.26447254,0.0026745542,0.0017163954,0.00012717793,0.000635903,0.0007569712,0.4645501],"genre_scores_gemma":[0.8494706,0.0025579866,0.043824162,0.0006598157,0.0017859814,0.00021463777,0.0007569565,0.00035203327,0.10037786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958414,0.000071142116,0.000023778139,0.000113675014,0.00010920589,0.000098064855],"domain_scores_gemma":[0.9990677,0.0004891304,0.00006197994,0.00017334182,0.00010332301,0.00010452618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040774353,0.0006198768,0.00092925964,0.0012826675,0.0021285028,0.0025674785,0.0008904863,0.001281928,0.008441934],"category_scores_gemma":[0.00173937,0.0004920501,0.0009959836,0.0014815002,0.003000221,0.006004313,0.0019653076,0.0023020608,0.0014181776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015243068,0.00000465845,0.000061134015,0.000028219585,0.0000025715074,0.000068404785,0.00014049732,0.00011424323,0.0005321974,0.9917139,0.001222745,0.00609621],"study_design_scores_gemma":[0.000006238534,0.000009257577,0.00009608559,0.0000115811235,0.0000049771666,0.00021363515,0.00004388907,0.0008440877,0.00036366115,0.9904847,0.007916558,0.000005464904],"about_ca_topic_score_codex":0.00038545276,"about_ca_topic_score_gemma":0.00034422695,"teacher_disagreement_score":0.008441934,"about_ca_system_score_codex":0.0007165246,"about_ca_system_score_gemma":0.00048448783,"threshold_uncertainty_score":0.028241038},"labels":[],"label_agreement":null},{"id":"W2171278552","doi":"10.1016/j.tcs.2011.06.012","title":"The Černý conjecture for one-cluster automata with prime length cycle","year":2011,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Conjecture; Prime (order theory); Combinatorics; Cluster (spacecraft); Automaton; Mathematics; Computer science; Theoretical computer science","score_opus":0.013767798483434209,"score_gpt":0.23932951504386277,"score_spread":0.22556171656042856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171278552","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60718673,0.0020394726,0.22133838,0.029104393,0.0018475465,0.00019056088,0.0013522161,0.0019451153,0.1349956],"genre_scores_gemma":[0.96741307,0.0004739261,0.013535321,0.0015827796,0.00053292495,0.00013664727,0.0005682993,0.00024199476,0.015515036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760133,0.00044126218,0.00013890374,0.0009048108,0.00040848707,0.0005052394],"domain_scores_gemma":[0.9847075,0.009083053,0.00084580696,0.0030851061,0.0012832395,0.000995348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021932016,0.0006872418,0.0020642378,0.0009746468,0.004019967,0.0062641297,0.002021752,0.004310288,0.010143177],"category_scores_gemma":[0.0143958125,0.0009294894,0.0015968888,0.0012328323,0.0071038175,0.015872406,0.0039261733,0.005920575,0.0016243753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018020938,0.000044588745,0.00063877035,0.00013513982,0.000011788054,0.00012867196,0.00043886976,0.0034337977,0.00091542746,0.98532975,0.004356503,0.004386375],"study_design_scores_gemma":[0.000025826992,0.000009223734,0.000073152165,0.000011391138,0.0000056657273,0.000054342632,0.00008225872,0.0042160028,0.00043216202,0.99356294,0.0015155479,0.000011528052],"about_ca_topic_score_codex":0.0015686578,"about_ca_topic_score_gemma":0.0013774931,"teacher_disagreement_score":0.010143177,"about_ca_system_score_codex":0.0022448536,"about_ca_system_score_gemma":0.0020773297,"threshold_uncertainty_score":0.03393233},"labels":[],"label_agreement":null},{"id":"W2172381877","doi":"10.1090/proc/13297","title":"Transcendence tests for Mahler functions","year":2016,"lang":"en","type":"preprint","venue":"Proceedings of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transcendence (philosophy); Eigenvalues and eigenvectors; Rank (graph theory); Mathematics; Lambda; Pure mathematics; Matrix (chemical analysis); Function (biology); Combinatorics; Physics; Philosophy; Quantum mechanics; Theology","score_opus":0.022991557692708768,"score_gpt":0.27299402095358244,"score_spread":0.25000246326087366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172381877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24667023,0.0014782954,0.47015795,0.0037808956,0.0020086267,0.00023071373,0.0008678355,0.0031130386,0.2716924],"genre_scores_gemma":[0.94166017,0.0005402774,0.031481728,0.0011454761,0.0011543216,0.00020209054,0.0007998547,0.0009664887,0.022049636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917753,0.001419677,0.0006697751,0.0017029116,0.0030999654,0.0013323721],"domain_scores_gemma":[0.9653927,0.018622044,0.0017648351,0.0039467993,0.0077906055,0.002483055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004650009,0.0018319591,0.0014936869,0.007633102,0.0019296583,0.0048134835,0.0028619447,0.0026434613,0.025965521],"category_scores_gemma":[0.040679123,0.00053241674,0.0033513901,0.0024384325,0.00896332,0.013030348,0.007338976,0.00715768,0.004294139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002465494,0.000078509074,0.0014129161,0.0001290063,0.00003446793,0.0004853839,0.000469775,0.0009918521,0.0020944101,0.9648738,0.0029980605,0.026185246],"study_design_scores_gemma":[0.000035443187,0.00018034983,0.0006013955,0.00005670983,0.000030204712,0.00061888515,0.00029361658,0.005588619,0.008110373,0.97715944,0.0072505698,0.000074361895],"about_ca_topic_score_codex":0.0009146921,"about_ca_topic_score_gemma":0.00041228373,"teacher_disagreement_score":0.025965521,"about_ca_system_score_codex":0.0026107845,"about_ca_system_score_gemma":0.0008558937,"threshold_uncertainty_score":0.08686328},"labels":[],"label_agreement":null},{"id":"W2174018860","doi":"10.1016/j.tcs.2015.04.017","title":"State complexity of inversion operations","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea; Yonsei University","keywords":"Substring; Inversion (geology); Nondeterministic algorithm; Prefix; Upper and lower bounds; Computational complexity theory; Mathematics; Combinatorics; Algorithm; Computer science; Discrete mathematics; Data structure","score_opus":0.04010833710941971,"score_gpt":0.2705048822927333,"score_spread":0.23039654518331357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174018860","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79878193,0.0004928241,0.15647843,0.0029947977,0.00009093936,0.00007677744,0.0008897104,0.00040552567,0.039789043],"genre_scores_gemma":[0.98985505,0.00017815178,0.005319376,0.00008968215,0.00008160079,0.00005497437,0.00039889003,0.00008308778,0.003939085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972441,0.0006430047,0.00017172002,0.00046143698,0.0008744998,0.0006053395],"domain_scores_gemma":[0.97465056,0.020235315,0.0010950214,0.0020276085,0.0012789449,0.00071242475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017137057,0.00053396454,0.0013263198,0.001527181,0.0015199946,0.0065498156,0.0018188683,0.0018434804,0.013432205],"category_scores_gemma":[0.016042434,0.0006999196,0.0015182456,0.0018192858,0.0029895015,0.0142524,0.0028981266,0.003940467,0.0007544858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002807246,0.00011061691,0.0016004697,0.00008163025,0.000026339725,0.00009923033,0.00058376,0.019527784,0.002211119,0.96172404,0.0014608146,0.012293424],"study_design_scores_gemma":[0.000025695892,0.00002704457,0.0005484026,0.000010487924,0.000023270251,0.00004698945,0.00009789885,0.07418456,0.0013797665,0.92312545,0.00050846365,0.000021907732],"about_ca_topic_score_codex":0.0021417232,"about_ca_topic_score_gemma":0.0017679066,"teacher_disagreement_score":0.013432205,"about_ca_system_score_codex":0.002361763,"about_ca_system_score_gemma":0.001878557,"threshold_uncertainty_score":0.044935226},"labels":[],"label_agreement":null},{"id":"W2176863542","doi":"10.1016/j.tcs.2007.03.023","title":"Powers in a class of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi mathvariant=\"script\">A</mml:mi></mml:math>-strict standard episturmian words","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Scroll; Class (philosophy); Mathematics; Algorithm; Computer science; Artificial intelligence; Theology; Philosophy","score_opus":0.010309950302254896,"score_gpt":0.2403761296158783,"score_spread":0.2300661793136234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176863542","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16487244,0.0010308032,0.33948538,0.0020891044,0.0013273191,0.00022073113,0.0017777887,0.0015002146,0.48769617],"genre_scores_gemma":[0.7876108,0.00049521466,0.043541256,0.00056374137,0.0007040561,0.00022292312,0.0016598492,0.00079694984,0.1644051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986778,0.0002960765,0.00015700949,0.00035670446,0.00029388085,0.00021847393],"domain_scores_gemma":[0.9981723,0.0006330362,0.00016011922,0.00039300526,0.0004698784,0.00017160796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009527666,0.00059049565,0.0005058981,0.0011277787,0.002821137,0.0035000308,0.00070738746,0.000745296,0.02088369],"category_scores_gemma":[0.0027127839,0.0004356885,0.0007896801,0.0009944447,0.003519095,0.004851456,0.0020375194,0.0019276353,0.0060853907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040059655,0.000012445707,0.00020833727,0.00004123577,0.000005688786,0.00018139865,0.00053267315,0.00009658424,0.0012915788,0.9874164,0.0034212386,0.0067522554],"study_design_scores_gemma":[0.000024007339,0.000030425435,0.00049742253,0.000037278984,0.000015537096,0.0004973139,0.00037541083,0.0013682663,0.0030292748,0.9115572,0.08254065,0.000027076485],"about_ca_topic_score_codex":0.0008037572,"about_ca_topic_score_gemma":0.0010358233,"teacher_disagreement_score":0.02088369,"about_ca_system_score_codex":0.0008872709,"about_ca_system_score_gemma":0.0005312488,"threshold_uncertainty_score":0.06986284},"labels":[],"label_agreement":null},{"id":"W2177646325","doi":"10.1007/978-3-642-30642-6_4","title":"The Complexity of Intersecting Finite Automata Having Few Final States","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Intersection (aeronautics); Automaton; Commutative property; Quantum finite automata; Computer science; Limiting; Finite-state machine; Deterministic finite automaton; Transformation (genetics); DFA minimization; Computational complexity theory; Discrete mathematics; ω-automaton; Automata theory; Theoretical computer science; Algebra over a field; Mathematics; Algorithm; Pure mathematics","score_opus":0.04821360167386302,"score_gpt":0.2649948956859152,"score_spread":0.2167812940120522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177646325","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7233971,0.004119705,0.16050507,0.008072547,0.0003019966,0.00010306655,0.0022794085,0.00062609115,0.10059511],"genre_scores_gemma":[0.967747,0.0011929213,0.019772705,0.0002673921,0.00045915702,0.00013827793,0.0011720943,0.0002131047,0.009037445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965437,0.0009089069,0.00026342605,0.0006614142,0.0011560905,0.00046643158],"domain_scores_gemma":[0.96256536,0.03166277,0.0015831161,0.0023076837,0.00090261275,0.000978387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016580257,0.00085142965,0.0016132032,0.0013983101,0.002182351,0.00788627,0.0034074555,0.0030072837,0.00919405],"category_scores_gemma":[0.020376557,0.0014382093,0.0020210643,0.002622133,0.0050282828,0.019396624,0.0033810586,0.0057448647,0.0008580302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003396762,0.00010298161,0.0021437926,0.0002761461,0.0000612472,0.0002514286,0.0009136896,0.041276757,0.001915321,0.9319173,0.0033658426,0.017435798],"study_design_scores_gemma":[0.00002319106,0.000014330363,0.0003126085,0.000013545065,0.000015840225,0.00009365894,0.00008956503,0.028767683,0.00042089546,0.96939564,0.00083417975,0.000018834842],"about_ca_topic_score_codex":0.0019165741,"about_ca_topic_score_gemma":0.0014836766,"teacher_disagreement_score":0.00919405,"about_ca_system_score_codex":0.0029906228,"about_ca_system_score_gemma":0.001546036,"threshold_uncertainty_score":0.03075713},"labels":[],"label_agreement":null},{"id":"W2178095809","doi":"10.1142/s0129054115500124","title":"State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages","year":2015,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regular language; Prefix; Intersection (aeronautics); Upper and lower bounds; Alphabet; Combinatorics; Mathematics; State (computer science); Discrete mathematics; Deterministic finite automaton; Nondeterministic finite automaton; Finite-state machine; Binary number; Automaton; Automata theory; Computer science; Arithmetic; Theoretical computer science; Algorithm","score_opus":0.03549565474146355,"score_gpt":0.3102429891193492,"score_spread":0.2747473343778857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178095809","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67407954,0.0005064074,0.30596206,0.0018939438,0.00007718099,0.00015621915,0.0013297598,0.0017136509,0.014281224],"genre_scores_gemma":[0.9524801,0.00018444716,0.04307509,0.000118623415,0.000056372537,0.00018867468,0.00090357824,0.00027264046,0.0027205956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99631554,0.0004642096,0.00035687606,0.0009821273,0.0009644678,0.00091682695],"domain_scores_gemma":[0.9754322,0.018208642,0.0020208561,0.0023651626,0.0011266124,0.00084646966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017168042,0.00071837334,0.001416048,0.0011574781,0.0018089932,0.0049021365,0.0023563348,0.0011242608,0.006135588],"category_scores_gemma":[0.012127365,0.00079632615,0.002209794,0.0013411867,0.003059432,0.009092084,0.0036206238,0.0035017626,0.0005909762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020483057,0.00056449615,0.015711855,0.0010124808,0.00019972886,0.00053460157,0.0027211546,0.40146127,0.04044217,0.4526996,0.005112898,0.077491455],"study_design_scores_gemma":[0.000042509735,0.00015144433,0.0018608404,0.000047708774,0.00009978092,0.00019461644,0.00024528705,0.6586707,0.03462986,0.30225983,0.0016992702,0.00009808941],"about_ca_topic_score_codex":0.0033168714,"about_ca_topic_score_gemma":0.0035006232,"teacher_disagreement_score":0.006135588,"about_ca_system_score_codex":0.0042160684,"about_ca_system_score_gemma":0.0031350132,"threshold_uncertainty_score":0.030589879},"labels":[],"label_agreement":null},{"id":"W2179921374","doi":"10.1007/978-3-642-39310-5_11","title":"Nondeterministic State Complexity of Proportional Removals","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Waterloo","funders":"","keywords":"Nondeterministic algorithm; State (computer science); Computer science; Mathematics; Theoretical computer science; Algorithm","score_opus":0.030457535285911327,"score_gpt":0.25548739443683566,"score_spread":0.22502985915092433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179921374","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47060022,0.0010785683,0.42750818,0.0037182902,0.00030055296,0.00015707404,0.00096031313,0.0012276525,0.0944492],"genre_scores_gemma":[0.95855695,0.00038607777,0.025141897,0.00015583236,0.00019202176,0.0001468185,0.0004826529,0.00034460472,0.014593202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99554706,0.0010938476,0.0002841767,0.0006730935,0.0016966725,0.00070511847],"domain_scores_gemma":[0.9759532,0.018283052,0.00072098034,0.003382422,0.0011073503,0.00055294536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024712957,0.0006230067,0.0013922235,0.0010192057,0.0015932043,0.0050097164,0.003008897,0.0015994947,0.011905023],"category_scores_gemma":[0.01972157,0.0008553426,0.0017832095,0.0014965857,0.0031250669,0.009608182,0.0029577385,0.0048111062,0.0010795529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026411368,0.000092903276,0.00051640824,0.000134191,0.000028974433,0.00009305569,0.00034658122,0.05083657,0.002835363,0.918522,0.0024072034,0.02392266],"study_design_scores_gemma":[0.000026947751,0.000015907972,0.00023166447,0.000009489378,0.000017930268,0.0000437947,0.00003774288,0.10879024,0.0015295536,0.8882331,0.0010440326,0.000019544294],"about_ca_topic_score_codex":0.0017179153,"about_ca_topic_score_gemma":0.0017691576,"teacher_disagreement_score":0.011905023,"about_ca_system_score_codex":0.0026974024,"about_ca_system_score_gemma":0.00206594,"threshold_uncertainty_score":0.039826214},"labels":[],"label_agreement":null},{"id":"W2183545083","doi":"10.1007/978-3-662-07003-1_11","title":"Finite Variable Logics","year":2004,"lang":"en","type":"book-chapter","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"T-norm fuzzy logics; Variable (mathematics); Mathematics; Monoidal t-norm logic; Fixed point; Expressive power; Discrete mathematics; Point (geometry); Pure mathematics; Computer science; Theoretical computer science; Mathematical analysis; Artificial intelligence; Geometry; Fuzzy logic","score_opus":0.018183411809687536,"score_gpt":0.2031866667813785,"score_spread":0.18500325497169096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183545083","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024491672,0.012837713,0.06194591,0.0023351791,0.00078393606,0.000034568413,0.0003301309,0.0005410557,0.9187423],"genre_scores_gemma":[0.08010534,0.011665071,0.027145911,0.0012401066,0.0007189284,0.00010336493,0.0009844971,0.00038806902,0.87764865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977726,0.000047457375,0.000008998783,0.00005074157,0.000094277704,0.00002121308],"domain_scores_gemma":[0.99983656,0.00007697579,0.0000058063624,0.000030484794,0.000036435693,0.000013631564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026807617,0.0006867484,0.00045164264,0.0010456025,0.0010484817,0.0026788637,0.0007069555,0.00053805095,0.033161633],"category_scores_gemma":[0.0005978973,0.0003826784,0.0003389379,0.0016475329,0.0017476103,0.0041175224,0.00086607755,0.0016811083,0.0075536296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011259118,0.00002013708,0.000040611892,0.00009428394,0.00000453654,0.000025756652,0.00029020358,0.00042113924,0.00048519814,0.83899724,0.07237969,0.0872299],"study_design_scores_gemma":[0.0000044017297,0.000005741234,0.00007177744,0.00007538225,0.000005828659,0.00007784586,0.00008463509,0.00070302497,0.00049332925,0.51198846,0.48648337,0.0000062575577],"about_ca_topic_score_codex":0.001385336,"about_ca_topic_score_gemma":0.0024898886,"teacher_disagreement_score":0.033161633,"about_ca_system_score_codex":0.0019486822,"about_ca_system_score_gemma":0.00094251486,"threshold_uncertainty_score":0.11093676},"labels":[],"label_agreement":null},{"id":"W2187598595","doi":"","title":"The Least Self-Shuffle of the Thue-Morse Sequence","year":2014,"lang":"en","type":"article","venue":"J. Integer Seq.","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Morse code; Sequence (biology); Mathematics; Directive; Combinatorics; Computer science; Genetics; Biology; Telecommunications","score_opus":0.007924220440223888,"score_gpt":0.21584797314105525,"score_spread":0.20792375270083135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187598595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64274967,0.000911984,0.31408325,0.00071138557,0.00043019425,0.00006239231,0.00040969168,0.00052034843,0.0401211],"genre_scores_gemma":[0.9420279,0.00026115307,0.04629865,0.00019507804,0.00007950467,0.000037229627,0.00031941017,0.00010142101,0.010679655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996094,0.00009288016,0.000028008715,0.00011061985,0.0000692174,0.00008992061],"domain_scores_gemma":[0.99909866,0.0002767643,0.00010397743,0.00020100725,0.00016658369,0.0001530503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042559762,0.00021990223,0.00025429166,0.00049906695,0.00077239465,0.0010141133,0.00030112895,0.0004159632,0.0050183013],"category_scores_gemma":[0.0022130252,0.00014597138,0.0003445622,0.000366209,0.00092618755,0.0012715292,0.0008359959,0.0006307506,0.00090663956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035008744,0.00006919906,0.0026873155,0.00015365797,0.000017540786,0.0003463761,0.00067104347,0.0054904297,0.01881384,0.9198047,0.0030031924,0.0485926],"study_design_scores_gemma":[0.00004553008,0.0002526752,0.0014400826,0.00005949522,0.000023806453,0.0008623845,0.00036406144,0.039781727,0.033084985,0.8938246,0.03020153,0.000059177764],"about_ca_topic_score_codex":0.00031382192,"about_ca_topic_score_gemma":0.0005658886,"teacher_disagreement_score":0.0050183013,"about_ca_system_score_codex":0.00032842485,"about_ca_system_score_gemma":0.00045929127,"threshold_uncertainty_score":0.016787887},"labels":[],"label_agreement":null},{"id":"W2188416243","doi":"10.1007/3-540-45007-6_32","title":"Boolean Grammars","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Tree-adjoining grammar; L-attributed grammar; Indexed grammar; Computer science; Context-sensitive grammar; Phrase structure grammar; Context-free grammar; Programming language; Rule-based machine translation; Definite clause grammar; Extended Affix Grammar; Parsing; Theoretical computer science; Artificial intelligence","score_opus":0.01178501727695145,"score_gpt":0.22222122782973502,"score_spread":0.21043621055278358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188416243","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006044461,0.0022467193,0.11705822,0.0021244101,0.00053084735,0.000068587455,0.0013286639,0.0015662588,0.86903185],"genre_scores_gemma":[0.22958559,0.0043376056,0.058960076,0.0012264205,0.0005209479,0.00021662787,0.004373475,0.0013694749,0.69940984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997441,0.000047714377,0.000014233143,0.000058992264,0.00010593775,0.000029050316],"domain_scores_gemma":[0.99981457,0.00006671756,0.000007831898,0.000048041205,0.000044667115,0.000018081942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021642826,0.000556324,0.00046167604,0.0008733627,0.0010033771,0.002409471,0.00066609104,0.00058140326,0.061506566],"category_scores_gemma":[0.0009159427,0.00036467196,0.0004632231,0.0012360405,0.0013746624,0.003012176,0.0011841541,0.0013709924,0.019083442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008773406,0.00001010227,0.000038093844,0.000048668895,0.0000028206978,0.00003479254,0.00015178509,0.0002673264,0.00077858876,0.93642926,0.02180097,0.04042889],"study_design_scores_gemma":[0.000007134486,0.000005005091,0.00006137219,0.000027482993,0.000006402097,0.00012030586,0.00006118781,0.0008458603,0.0010657299,0.7760475,0.2217449,0.0000070999918],"about_ca_topic_score_codex":0.0012601046,"about_ca_topic_score_gemma":0.0014866982,"teacher_disagreement_score":0.061506566,"about_ca_system_score_codex":0.0011054112,"about_ca_system_score_gemma":0.0006417393,"threshold_uncertainty_score":0.20576},"labels":[],"label_agreement":null},{"id":"W2188978818","doi":"10.1080/00150517.2004.12428402","title":"On Tribonacci Sequences","year":2004,"lang":"en","type":"article","venue":"˜The œFibonacci quarterly","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Morphism; Generalization; Mathematics; Simple (philosophy); Point (geometry); Word (group theory); Combinatorics; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.009219202777209468,"score_gpt":0.22692072989398276,"score_spread":0.2177015271167733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188978818","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.271458,0.011105793,0.33177695,0.0023231746,0.0028715269,0.00021224681,0.0002922034,0.0005141696,0.37944597],"genre_scores_gemma":[0.85975903,0.0044734785,0.072498165,0.0012281914,0.0012159497,0.00032381766,0.00033667404,0.00023138693,0.05993335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991731,0.00019719072,0.000053925243,0.00016362563,0.00026057244,0.00015145834],"domain_scores_gemma":[0.99922204,0.00033145442,0.00006339718,0.00010157455,0.00016297813,0.0001185689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083893054,0.0006801316,0.0006105254,0.0020422486,0.0028331277,0.0019554948,0.00067164167,0.0011605992,0.005585882],"category_scores_gemma":[0.0025606467,0.00041541716,0.00059446064,0.0020117816,0.003207349,0.003075757,0.001546092,0.001728579,0.0017458892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013446422,0.00000583065,0.00007388533,0.000028579125,0.0000013481148,0.00011386539,0.000421059,0.0004804526,0.001257752,0.98880357,0.0006076601,0.008192607],"study_design_scores_gemma":[0.000008137469,0.000031921,0.00016925613,0.000034317705,0.0000034274644,0.00029641675,0.00010285954,0.0026009472,0.00095249404,0.9688885,0.026893893,0.000017902337],"about_ca_topic_score_codex":0.0012855785,"about_ca_topic_score_gemma":0.0011564603,"teacher_disagreement_score":0.005585882,"about_ca_system_score_codex":0.001162798,"about_ca_system_score_gemma":0.0005247466,"threshold_uncertainty_score":0.018686652},"labels":[],"label_agreement":null},{"id":"W2192618602","doi":"10.1017/cbo9780511546563.005","title":"Finite Automata and Other Models of Computation","year":2003,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computation; Automaton; Simple (philosophy); Computer science; Quantum finite automata; Finite-state machine; Theoretical computer science; Deterministic finite automaton; Automata theory; Algorithm; Philosophy","score_opus":0.028115674526389908,"score_gpt":0.19919486829276206,"score_spread":0.17107919376637215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2192618602","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021828078,0.072224595,0.47656816,0.012323173,0.003662588,0.00019088354,0.0008735441,0.0011780822,0.4111509],"genre_scores_gemma":[0.48613364,0.06250024,0.2619863,0.004009241,0.0053850585,0.0007746069,0.001371304,0.0005135331,0.17732616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920255,0.00023492513,0.00005295177,0.0001672202,0.00026681047,0.00007545397],"domain_scores_gemma":[0.99911946,0.00055254536,0.000050628503,0.00012338112,0.000106249645,0.00004779803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007912272,0.0009487311,0.0008592997,0.0011642239,0.0014316904,0.003957305,0.001218426,0.0018934628,0.011127982],"category_scores_gemma":[0.0024323438,0.00047424537,0.0014947199,0.0015958438,0.003987817,0.009396765,0.0011759027,0.0028562597,0.0023984918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004055645,0.0000062278227,0.000034800134,0.000050715516,0.0000033808392,0.000036150057,0.00017032986,0.00054984936,0.00018487175,0.9939652,0.0017788752,0.0032155225],"study_design_scores_gemma":[0.0000035319565,0.000009283148,0.000040857576,0.00004164312,0.0000039338665,0.000069663525,0.00006306331,0.0017419935,0.0001351465,0.9478895,0.049994867,0.0000064562464],"about_ca_topic_score_codex":0.0024401718,"about_ca_topic_score_gemma":0.0023980252,"teacher_disagreement_score":0.011127982,"about_ca_system_score_codex":0.0020088188,"about_ca_system_score_gemma":0.0009124454,"threshold_uncertainty_score":0.037226796},"labels":[],"label_agreement":null},{"id":"W2209966527","doi":"10.1016/j.crma.2015.12.015","title":"Ensembles reconnaissables de séries formelles sur un corps fini","year":2016,"lang":"fr","type":"article","venue":"Comptes Rendus Mathématique","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Alphabet; Decidability; Natural number; Humanities; Combinatorics; Automaton; Regular language; Field (mathematics); Discrete mathematics; Pure mathematics; Linguistics; Philosophy; Artificial intelligence; Computer science","score_opus":0.028751956643565533,"score_gpt":0.23837286666834578,"score_spread":0.20962091002478025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209966527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31264082,0.00047940743,0.6414839,0.0005307769,0.00027037755,0.00008908295,0.0008383334,0.0021677145,0.04149953],"genre_scores_gemma":[0.8014668,0.00057713524,0.14633828,0.00025150683,0.00021624086,0.00018311931,0.0018612779,0.0007145408,0.048391115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998314,0.00034852902,0.00014605251,0.0004756874,0.0005397791,0.00017593888],"domain_scores_gemma":[0.99427766,0.0038472714,0.0004115973,0.00056379905,0.0007287058,0.00017095404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013608568,0.0007292201,0.00063412363,0.0010503317,0.0016695585,0.002578957,0.0008627105,0.00076672115,0.00910728],"category_scores_gemma":[0.0059328913,0.000556608,0.0015952035,0.0007137875,0.0022934177,0.0036019958,0.0011019134,0.0018973715,0.001799865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046030967,0.00011821031,0.005367977,0.0003310772,0.00007908914,0.001464349,0.0028780869,0.02390577,0.021756567,0.8718545,0.0032644689,0.0685196],"study_design_scores_gemma":[0.00010074259,0.00022338702,0.0040135244,0.00019680247,0.00007221017,0.0015311551,0.0012197826,0.10651439,0.0691673,0.7594761,0.057393357,0.00009132696],"about_ca_topic_score_codex":0.0023512768,"about_ca_topic_score_gemma":0.0027170326,"teacher_disagreement_score":0.00910728,"about_ca_system_score_codex":0.0012453295,"about_ca_system_score_gemma":0.0006483701,"threshold_uncertainty_score":0.030466914},"labels":[],"label_agreement":null},{"id":"W221348902","doi":"10.1109/ccc.2007.32","title":"The Communication Complexity of Correlation","year":2007,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Alice and Bob; Alice (programming language); String (physics); Distribution (mathematics); Order (exchange); Combinatorics; Communication complexity; Discrete mathematics; Mathematics; Random variable; Computer science; Statistics","score_opus":0.029656031206740936,"score_gpt":0.26550561563762315,"score_spread":0.23584958443088222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W221348902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16822934,0.005423203,0.7053111,0.02395319,0.0007214006,0.0003955193,0.005522442,0.0014947397,0.08894911],"genre_scores_gemma":[0.92639905,0.0032358079,0.04379788,0.0021124722,0.0015621433,0.0007546607,0.0025413316,0.00040610423,0.019190608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9781798,0.00883732,0.0011320589,0.0040769326,0.005010496,0.0027633458],"domain_scores_gemma":[0.8150369,0.14338034,0.009357623,0.020678895,0.008230429,0.0033158432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010896416,0.0014408255,0.003630537,0.0029950961,0.0042933784,0.009771646,0.0040600104,0.00396176,0.015701188],"category_scores_gemma":[0.107764214,0.0015647872,0.0022506006,0.0049698395,0.0056677256,0.01907398,0.0084889475,0.0062566777,0.0027420917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004241388,0.000072293034,0.0029227838,0.0002774901,0.000118301425,0.00041348467,0.0004900239,0.04288747,0.00057500356,0.90683067,0.013928717,0.03105957],"study_design_scores_gemma":[0.000064102685,0.00004242371,0.0007241014,0.000061548846,0.000048066722,0.0002537468,0.0000914054,0.15755229,0.0006060841,0.8357252,0.0047767134,0.00005440459],"about_ca_topic_score_codex":0.0042351573,"about_ca_topic_score_gemma":0.0022270351,"teacher_disagreement_score":0.015701188,"about_ca_system_score_codex":0.006934188,"about_ca_system_score_gemma":0.0055169286,"threshold_uncertainty_score":0.057626426},"labels":[],"label_agreement":null},{"id":"W2216859873","doi":"10.1007/978-3-319-66396-8","title":"Combinatorics on Words","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences; Université de La Réunion; Università di Bologna; Université de Liège; Università degli Studi di Firenze; University of Waterloo; Christian-Albrechts-Universität zu Kiel; Freie Universität Berlin; Université de Bordeaux; Grantová Agentura České Republiky; Université du Québec à Montréal; King's College London; Aix-Marseille Université; Université de Lyon; Université Savoie Mont Blanc; Dartmouth College; Université Paris Diderot; Murdoch University; Università degli Studi di Napoli Federico II","keywords":"Computer science; Combinatorics; Artificial intelligence; Mathematics","score_opus":0.013754323225868849,"score_gpt":0.25010344606168783,"score_spread":0.236349122835819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216859873","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011433883,0.012846856,0.040529747,0.0030903046,0.0018146826,0.000042748936,0.00049925526,0.00040473032,0.9293378],"genre_scores_gemma":[0.26236004,0.02036438,0.018872323,0.0014536605,0.0035233367,0.00027050308,0.0017424168,0.0010660371,0.6903473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957746,0.00009214739,0.000025892206,0.00008172126,0.0001685374,0.000054327622],"domain_scores_gemma":[0.99972016,0.00009333098,0.000022020324,0.00007091889,0.00006116564,0.00003239301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020322244,0.0010246998,0.0008017791,0.0020956823,0.0017094933,0.0042788666,0.0006523914,0.0005092237,0.03068743],"category_scores_gemma":[0.00093693915,0.00049288495,0.000701139,0.0026924505,0.0030365228,0.005914567,0.0022789596,0.0021215,0.012922826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009654004,0.0000056311524,0.00003028221,0.00006988497,0.000004389408,0.000021624077,0.0001945553,0.0002225628,0.0003217586,0.9639531,0.01350043,0.021666113],"study_design_scores_gemma":[0.0000037119592,0.0000045938887,0.00005379476,0.00003484525,0.0000045417805,0.00006375937,0.00008186224,0.00022487732,0.00020787878,0.87086684,0.12844826,0.000005100596],"about_ca_topic_score_codex":0.0009201067,"about_ca_topic_score_gemma":0.00086366956,"teacher_disagreement_score":0.03068743,"about_ca_system_score_codex":0.00179716,"about_ca_system_score_gemma":0.0008554967,"threshold_uncertainty_score":0.10265964},"labels":[],"label_agreement":null},{"id":"W2220261572","doi":"10.1007/978-0-387-21690-4_15","title":"The Fundamental Theorem of Abelian Extensions","year":2001,"lang":"en","type":"book-chapter","venue":"Universitext","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Abelian group; Mathematics; Section (typography); Extension (predicate logic); Pure mathematics; Field (mathematics); Abelian extension; Discrete mathematics; Computer science","score_opus":0.010116691329333473,"score_gpt":0.1868905009920641,"score_spread":0.17677380966273065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220261572","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011772555,0.014548844,0.07706385,0.0073974305,0.0022497915,0.000032013635,0.00024421408,0.0002980883,0.8863933],"genre_scores_gemma":[0.58675927,0.015399922,0.04331668,0.0047452226,0.0076172897,0.00030552008,0.0005957279,0.00034740154,0.34091297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953365,0.0001315148,0.00002242879,0.00010691038,0.00013831287,0.0000671619],"domain_scores_gemma":[0.9993383,0.00037098982,0.000026855249,0.0001167497,0.00010473952,0.00004236471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076304935,0.0006092672,0.000652559,0.0011970567,0.0018723427,0.003462971,0.000711956,0.001368939,0.009443013],"category_scores_gemma":[0.0016274429,0.00048747013,0.0006987379,0.001223887,0.0066263727,0.008587328,0.0016896968,0.0040542763,0.0029980168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003446269,0.0000031638615,0.000011223573,0.000013852656,0.0000013231444,0.0000063129946,0.00011751882,0.000047192752,0.00011357427,0.99194556,0.003643243,0.004093594],"study_design_scores_gemma":[0.0000036734116,0.0000025549637,0.000026264548,0.00000906949,0.0000014628345,0.000030860112,0.000019158335,0.00010571367,0.000090266956,0.9662996,0.033408973,0.000002460109],"about_ca_topic_score_codex":0.0006998335,"about_ca_topic_score_gemma":0.00057803525,"teacher_disagreement_score":0.009443013,"about_ca_system_score_codex":0.0016477909,"about_ca_system_score_gemma":0.00091183017,"threshold_uncertainty_score":0.031590044},"labels":[],"label_agreement":null},{"id":"W2231646746","doi":"10.1093/oxfordhb/9780195307344.013.0011","title":"The Syntax and Semantics of Floating Numeral Quantifiers","year":2008,"lang":"en","type":"book","venue":"Oxford University Press eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Numeral system; Syntax; Locality; Computer science; Semantics (computer science); Dependency (UML); Linguistics; Relation (database); Artificial intelligence; Programming language; Philosophy","score_opus":0.01432814268329649,"score_gpt":0.18468433776234733,"score_spread":0.17035619507905084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2231646746","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25182614,0.027819572,0.32739896,0.009386203,0.00090195664,0.000059861522,0.00082543853,0.0010065523,0.38077533],"genre_scores_gemma":[0.94388276,0.0036390072,0.024780992,0.00031587973,0.0002307625,0.000039893846,0.00020596207,0.00016272784,0.026742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962723,0.000108329405,0.00003139945,0.000086232256,0.00010973312,0.000037145306],"domain_scores_gemma":[0.9996846,0.0001686164,0.000032786873,0.000044296128,0.00005152313,0.000018334855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059962954,0.0003758669,0.0003002234,0.00081650773,0.0012045893,0.0035547733,0.00055780297,0.00064316223,0.0031010748],"category_scores_gemma":[0.0010342726,0.00026878354,0.0005210345,0.0009527476,0.0052263965,0.00485955,0.0011755454,0.0012149347,0.0006289282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005638119,0.0000015109146,0.00009254525,0.000027908598,0.0000017599322,0.000051705163,0.0010083197,0.00027969843,0.0005601624,0.99264234,0.00060276623,0.004725652],"study_design_scores_gemma":[0.0000064623623,0.0000078088615,0.0004955929,0.00004108787,0.0000068828826,0.00018988695,0.00041583087,0.0024280278,0.0005233104,0.9662529,0.029618831,0.000013233049],"about_ca_topic_score_codex":0.0028022698,"about_ca_topic_score_gemma":0.001960064,"teacher_disagreement_score":0.0035547733,"about_ca_system_score_codex":0.0016953972,"about_ca_system_score_gemma":0.00073150196,"threshold_uncertainty_score":0.012301028},"labels":[],"label_agreement":null},{"id":"W2232191914","doi":"10.46298/dmtcs.1302","title":"Asymptotic Density of Zimin Words","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Word (group theory); Alphabet; Combinatorics; Homomorphism; Limit (mathematics); Mathematics; Physics; Discrete mathematics; Philosophy; Geometry; Mathematical analysis; Linguistics","score_opus":0.01017574878256319,"score_gpt":0.2404286828056132,"score_spread":0.23025293402305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2232191914","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7828931,0.001302031,0.15711863,0.0017241988,0.00013231677,0.000087808716,0.0011205947,0.0015583033,0.05406291],"genre_scores_gemma":[0.9769233,0.00036758892,0.01216313,0.00028683068,0.0001242712,0.00021721619,0.0009989896,0.00034850594,0.008570172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985127,0.00030874636,0.00006464501,0.00037606116,0.0004258904,0.00031195825],"domain_scores_gemma":[0.99018574,0.0062170606,0.00068468455,0.0012635344,0.00092623767,0.00072273664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002160957,0.00043338977,0.001072436,0.0019777196,0.0015403383,0.0029084822,0.0025035988,0.0012422629,0.010826835],"category_scores_gemma":[0.026696395,0.0006671781,0.00063353404,0.00086622074,0.0032540034,0.0051739076,0.0025570723,0.002017843,0.0013442752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022862518,0.000054788576,0.005429809,0.00016860224,0.000033437267,0.00020571706,0.0005966061,0.011865268,0.0032821414,0.96350104,0.005331065,0.009302944],"study_design_scores_gemma":[0.000047210793,0.00005890829,0.004909314,0.00013446537,0.00003775959,0.0005946043,0.00046516195,0.23811348,0.004213759,0.74701506,0.004326507,0.00008372827],"about_ca_topic_score_codex":0.001907299,"about_ca_topic_score_gemma":0.0021414277,"teacher_disagreement_score":0.010826835,"about_ca_system_score_codex":0.0030527464,"about_ca_system_score_gemma":0.000990515,"threshold_uncertainty_score":0.03621936},"labels":[],"label_agreement":null},{"id":"W2236411098","doi":"10.1093/analys/anv076","title":"A solution to the donkey sentence problem","year":2015,"lang":"en","type":"article","venue":"Analysis","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Donkey; Sentence; Media studies; Computer science; Art; Library science; History; Sociology; Artificial intelligence; Archaeology","score_opus":0.02266169962045956,"score_gpt":0.24652172867639469,"score_spread":0.22386002905593513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2236411098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04046446,0.0037686392,0.5152955,0.1824494,0.01236727,0.00020485953,0.0019604543,0.004213314,0.23927605],"genre_scores_gemma":[0.65440243,0.0018760585,0.15971227,0.033412956,0.0055173514,0.00049762207,0.0021187,0.00437769,0.13808495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902672,0.0044648456,0.00045258415,0.002636638,0.0013983961,0.00078024575],"domain_scores_gemma":[0.9867198,0.007478949,0.00045977638,0.0020796298,0.0027777848,0.00048412822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008452134,0.0012205499,0.0017362903,0.002258796,0.0062233387,0.0050369785,0.0026453566,0.0058605326,0.051202025],"category_scores_gemma":[0.02983971,0.0016672934,0.0031308492,0.0018025031,0.008403265,0.017275209,0.007905515,0.007959517,0.009077022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052580996,0.00001678099,0.00017786378,0.00007760621,0.000022174434,0.00017236963,0.000554354,0.00027141377,0.00021020988,0.94968593,0.04090787,0.007850891],"study_design_scores_gemma":[0.000033957695,0.000015835349,0.0001136556,0.00006596244,0.000025511434,0.0004215945,0.00041389107,0.0036613853,0.0005152559,0.92572135,0.068977654,0.000034089397],"about_ca_topic_score_codex":0.0031001256,"about_ca_topic_score_gemma":0.0022550463,"teacher_disagreement_score":0.051202025,"about_ca_system_score_codex":0.0039547533,"about_ca_system_score_gemma":0.0035983163,"threshold_uncertainty_score":0.17128783},"labels":[],"label_agreement":null},{"id":"W2239741161","doi":"10.1016/j.jalgebra.2016.04.006","title":"Automata, reduced words and Garside shadows in Coxeter groups","year":2016,"lang":"en","type":"preprint","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Coxeter group; Mathematics; Class (philosophy); Automaton; Shadow (psychology); Combinatorics; Regular language; Discrete mathematics; Büchi automaton; Order (exchange); Deterministic automaton; Finite-state machine; Pure mathematics; Computer science; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.012023465967148355,"score_gpt":0.24497971571705573,"score_spread":0.2329562497499074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2239741161","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7320983,0.0026965875,0.18466456,0.00363892,0.00090714986,0.00008095222,0.00046088317,0.00056491746,0.074887805],"genre_scores_gemma":[0.9709456,0.00057556026,0.010865832,0.00028598646,0.00038920832,0.00007076913,0.00020924892,0.000110843575,0.016546836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905425,0.00024309043,0.00008754612,0.00024030599,0.00019552675,0.00017923562],"domain_scores_gemma":[0.99807906,0.0010089925,0.00019429493,0.00031372881,0.00018372646,0.00022025991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009921257,0.0006850825,0.00090828113,0.0016845834,0.0021947422,0.0046721376,0.0008584252,0.0015421485,0.0074160495],"category_scores_gemma":[0.0037773903,0.00062495645,0.00095282425,0.0015437852,0.0047452156,0.006090125,0.0024903219,0.0025012612,0.0009478204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042566884,0.00001454899,0.00022874057,0.000023084822,0.000003624408,0.00008066181,0.0005829008,0.0005107176,0.00051873183,0.9942622,0.00048794682,0.003244202],"study_design_scores_gemma":[0.000009378517,0.000006843681,0.00005467262,0.000005138709,0.0000035999408,0.000035354817,0.0000838369,0.0012398795,0.00021182124,0.99731284,0.001030566,0.0000059946137],"about_ca_topic_score_codex":0.0010150886,"about_ca_topic_score_gemma":0.000985158,"teacher_disagreement_score":0.0074160495,"about_ca_system_score_codex":0.0011747199,"about_ca_system_score_gemma":0.00074261473,"threshold_uncertainty_score":0.024809122},"labels":[],"label_agreement":null},{"id":"W2244935559","doi":"10.1016/j.dam.2016.03.010","title":"Initial non-repetitive complexity of infinite words","year":2016,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fibonacci number; Repetition (rhetorical device); Word (group theory); Function (biology); Mathematics; Word length; Combinatorics; Computer science; Linguistics; Natural language processing; Biology; Philosophy; Geometry","score_opus":0.03674040037245721,"score_gpt":0.2879595770724118,"score_spread":0.25121917669995464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244935559","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74143547,0.00064979016,0.17911622,0.0016196953,0.0001381379,0.000065517044,0.0005475073,0.00036534178,0.07606238],"genre_scores_gemma":[0.9829297,0.0001730092,0.0062454706,0.000118789154,0.0001684015,0.00005100957,0.0003441856,0.00008669022,0.009882864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981438,0.0003750154,0.0001407788,0.00044870714,0.000582026,0.00030972032],"domain_scores_gemma":[0.98874515,0.007159706,0.0008691245,0.001060406,0.00127904,0.000886602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091974245,0.0005850259,0.0008523604,0.0021536066,0.0016893084,0.005806968,0.0017555635,0.0013422909,0.010193137],"category_scores_gemma":[0.01035514,0.0005434176,0.0010568127,0.00134602,0.0036646274,0.009653462,0.002831241,0.002978398,0.0009270492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005925784,0.000029412999,0.0006085342,0.000057516885,0.000008608108,0.00018556023,0.00073093007,0.0018221351,0.0013834913,0.9909561,0.00044479658,0.0037135768],"study_design_scores_gemma":[0.000007024901,0.000010071136,0.00023956614,0.00000783579,0.000005570074,0.00008287021,0.00009953884,0.0065623038,0.00065888895,0.99182105,0.00049486256,0.000010478789],"about_ca_topic_score_codex":0.00081268675,"about_ca_topic_score_gemma":0.0007439031,"teacher_disagreement_score":0.010193137,"about_ca_system_score_codex":0.0019205249,"about_ca_system_score_gemma":0.0008472295,"threshold_uncertainty_score":0.03409946},"labels":[],"label_agreement":null},{"id":"W2246477806","doi":"10.1007/978-1-4612-1200-3_2","title":"Semigroups of Matrices","year":2000,"lang":"en","type":"book-chapter","venue":"Universitext","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Dalhousie University","funders":"","keywords":"Pure mathematics; Mathematics; Algebra over a field; Computer science","score_opus":0.006489637637958679,"score_gpt":0.16920474278433917,"score_spread":0.1627151051463805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2246477806","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011543697,0.014584745,0.09065131,0.0027083072,0.0018469922,0.000054085853,0.0005285324,0.0005404736,0.8775419],"genre_scores_gemma":[0.3859209,0.013508855,0.06498476,0.0012797193,0.0032632588,0.00023836055,0.0010719378,0.00036297648,0.52936924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970824,0.00008087224,0.00001750727,0.00006169386,0.00010623929,0.00002551499],"domain_scores_gemma":[0.9996222,0.00016919026,0.000024949662,0.00005775677,0.000085428765,0.00004047587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003904421,0.0007133948,0.00044368027,0.0015608907,0.0011284482,0.0034273444,0.00050778926,0.0005186615,0.017611748],"category_scores_gemma":[0.0010856295,0.00039999495,0.00041481547,0.0015684136,0.0017743626,0.003528153,0.0008884655,0.0014868624,0.0047263457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034457232,0.0000037101565,0.000018313376,0.000021453427,0.0000013787501,0.000011385422,0.00015961676,0.000094045994,0.000274301,0.985637,0.0058305287,0.007944635],"study_design_scores_gemma":[0.0000038988837,0.000007883671,0.00007486992,0.00001768249,0.0000022923982,0.00007913083,0.000051757263,0.00059070135,0.00024926095,0.90993434,0.08898421,0.000003947661],"about_ca_topic_score_codex":0.0005628231,"about_ca_topic_score_gemma":0.0006619393,"teacher_disagreement_score":0.017611748,"about_ca_system_score_codex":0.0010259374,"about_ca_system_score_gemma":0.000578181,"threshold_uncertainty_score":0.058917165},"labels":[],"label_agreement":null},{"id":"W2250555305","doi":"","title":"On Panini and the Generative Capacity of Contextualized Replacement Systems","year":2012,"lang":"en","type":"article","venue":"International Conference on Computational Linguistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Generative grammar; Formalism (music); Sanskrit; Computer science; Grammar; Rewriting; Linguistics; Mildly context-sensitive grammar formalism; Adaptive grammar; Emergent grammar; Natural language processing; Programming language; Mathematics; Artificial intelligence; Philosophy; Literature","score_opus":0.0576393092193052,"score_gpt":0.3040569194395782,"score_spread":0.24641761022027298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2250555305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18101883,0.009895286,0.418433,0.0118607255,0.00030506204,0.00010005495,0.00028881812,0.001163764,0.3769344],"genre_scores_gemma":[0.957053,0.0016270387,0.030915545,0.00051056425,0.00022170803,0.00006525363,0.0001187373,0.00024627824,0.009241823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815565,0.0009180547,0.00009165303,0.00037254902,0.00026723644,0.00019485893],"domain_scores_gemma":[0.99333584,0.0050632465,0.00024203025,0.0009512084,0.00026441625,0.00014322542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033299648,0.00043638019,0.00059623644,0.001246851,0.001790991,0.0029051213,0.000925817,0.0010897544,0.0068511353],"category_scores_gemma":[0.008463288,0.0005263391,0.00079232955,0.0011026915,0.011467322,0.0076781223,0.0034558561,0.0024184645,0.00065408694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061161295,0.0000022625948,0.00009789485,0.000012736669,0.0000014974033,0.00003437573,0.0006199578,0.00094407273,0.0001159211,0.99521494,0.0001450193,0.0028052053],"study_design_scores_gemma":[0.000004595683,0.000007798799,0.00007862467,0.000017510038,0.0000032970713,0.00005562307,0.0001171713,0.003432595,0.0002509713,0.98856527,0.007458364,0.000008149916],"about_ca_topic_score_codex":0.002062083,"about_ca_topic_score_gemma":0.0017655585,"teacher_disagreement_score":0.0068511353,"about_ca_system_score_codex":0.0018133362,"about_ca_system_score_gemma":0.00076681987,"threshold_uncertainty_score":0.022919357},"labels":[],"label_agreement":null},{"id":"W2250680610","doi":"10.1016/j.tcs.2015.05.003","title":"Studies on finite Sturmian words","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Christoffel symbols; Mathematics; Bijection; Closure (psychology); Combinatorics; Palindrome; Extension (predicate logic); Word (group theory); Inverse; Combinatorics on words; Pure mathematics; Discrete mathematics; Geometry","score_opus":0.03992175234996239,"score_gpt":0.30067441099862086,"score_spread":0.2607526586486585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2250680610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56951886,0.020562002,0.10842102,0.0040618884,0.0007800666,0.00005974884,0.00030825514,0.00027890006,0.29600924],"genre_scores_gemma":[0.9548609,0.004466188,0.011876976,0.000458877,0.0006908158,0.000060968523,0.00030720275,0.00012045917,0.02715758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893934,0.0003837404,0.0000838097,0.00018120358,0.000248949,0.00016292816],"domain_scores_gemma":[0.99572206,0.0031072202,0.00025711162,0.00024999044,0.00044729034,0.00021638274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014801705,0.00079706486,0.0011441758,0.004182659,0.002643249,0.0028641257,0.0010829134,0.0012181255,0.011661895],"category_scores_gemma":[0.0056715244,0.0004708145,0.0013975198,0.004878998,0.0052945344,0.006981158,0.0016177131,0.0019028744,0.0011795829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017934557,0.000012450363,0.00017866163,0.00009060566,0.000006275475,0.00008760613,0.00055773114,0.00044497047,0.0004817065,0.994493,0.00040252536,0.0032266155],"study_design_scores_gemma":[0.000008437053,0.000036610425,0.0004150436,0.000040297444,0.00001889431,0.00020754397,0.00029863114,0.0015286785,0.0006913912,0.98957026,0.0071711875,0.000013054223],"about_ca_topic_score_codex":0.0010246617,"about_ca_topic_score_gemma":0.0010248843,"teacher_disagreement_score":0.011661895,"about_ca_system_score_codex":0.0021930097,"about_ca_system_score_gemma":0.00079226313,"threshold_uncertainty_score":0.03901291},"labels":[],"label_agreement":null},{"id":"W2256344519","doi":"10.37236/5752","title":"Closed, Palindromic, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Palindrome; Sequence (biology); Fibonacci number; Palindromic sequence; Function (biology); Order (exchange); Mathematics; Generating function; Prefix; Property (philosophy); Combinatorics; Discrete mathematics; Algorithm; Arithmetic","score_opus":0.007368100112925745,"score_gpt":0.2320644672937312,"score_spread":0.22469636718080546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256344519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8215463,0.00028207715,0.16463122,0.00019495992,0.000040490537,0.000029491672,0.00019121695,0.00020227743,0.012882153],"genre_scores_gemma":[0.9816798,0.000122010155,0.015368711,0.00003067117,0.00003991453,0.00003082077,0.00010488424,0.00004096435,0.0025823135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995351,0.00006942817,0.000040864332,0.00013587231,0.000120303324,0.00009842619],"domain_scores_gemma":[0.99786395,0.0010184026,0.00043800427,0.00023069177,0.00026653538,0.00018236242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005634143,0.00037049482,0.00032081874,0.0012444011,0.00088565727,0.0017634402,0.0004148722,0.0004240422,0.0031175506],"category_scores_gemma":[0.0035996244,0.00021405994,0.0006752531,0.00086297153,0.0020867514,0.0031822762,0.0009447712,0.00072855287,0.0004466556],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001410965,0.000032404565,0.004186588,0.000080054444,0.000011108381,0.00028047332,0.0010252569,0.0037063267,0.013034723,0.95851755,0.00042219274,0.018562209],"study_design_scores_gemma":[0.000026245501,0.00010561617,0.0032227705,0.000034388628,0.0000322843,0.00096363976,0.0004942137,0.036685333,0.01681938,0.9352704,0.0062888972,0.000056820405],"about_ca_topic_score_codex":0.00080528244,"about_ca_topic_score_gemma":0.0008376261,"teacher_disagreement_score":0.0031175506,"about_ca_system_score_codex":0.001053346,"about_ca_system_score_gemma":0.0005138671,"threshold_uncertainty_score":0.010429263},"labels":[],"label_agreement":null},{"id":"W2260622622","doi":"10.1007/978-3-319-41114-9_6","title":"On the State Complexity of the Shuffle of Regular Languages","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular language; Alphabet; Upper and lower bounds; Deterministic finite automaton; State (computer science); Finite-state machine; Nondeterministic finite automaton; Automaton","score_opus":0.01866464202560329,"score_gpt":0.23776755254319934,"score_spread":0.21910291051759606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2260622622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71155965,0.00090392027,0.26044807,0.0016103438,0.00006439198,0.000117218915,0.000565448,0.00054716656,0.024183853],"genre_scores_gemma":[0.9608136,0.0005065819,0.031244121,0.00010682074,0.00009184782,0.00013168079,0.0004704503,0.00015974334,0.0064751613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980665,0.0004364799,0.00012966662,0.00043233606,0.0005575496,0.00037744732],"domain_scores_gemma":[0.9820608,0.015180246,0.00077136466,0.0012219191,0.00042023847,0.00034542498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013844881,0.00056058704,0.000845481,0.0007743709,0.0009466386,0.002897967,0.0013793198,0.00086969015,0.005418066],"category_scores_gemma":[0.008252414,0.0005906772,0.001629966,0.0008771694,0.0024582902,0.008781283,0.0021535892,0.0027248415,0.00048790313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092169293,0.00026337052,0.0050756414,0.0005206348,0.00011648662,0.00038350766,0.0013937562,0.23525202,0.028992249,0.6708879,0.0022499503,0.053942833],"study_design_scores_gemma":[0.000037944075,0.00020720389,0.0020562827,0.00004370578,0.00006187898,0.00019409411,0.00016436414,0.42820787,0.01726224,0.5488703,0.0028267985,0.00006725521],"about_ca_topic_score_codex":0.001614146,"about_ca_topic_score_gemma":0.0015524278,"teacher_disagreement_score":0.005418066,"about_ca_system_score_codex":0.0022918393,"about_ca_system_score_gemma":0.0010982387,"threshold_uncertainty_score":0.018125236},"labels":[],"label_agreement":null},{"id":"W2261193143","doi":"","title":"Longest path starting at a vertex","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Path (computing); Combinatorics; Computer science; Graph; Computer network","score_opus":0.007865656827534644,"score_gpt":0.20364350290230418,"score_spread":0.19577784607476953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261193143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3582,0.0012148595,0.4271065,0.0033095977,0.0016228727,0.0008194728,0.014145314,0.0051895115,0.18839195],"genre_scores_gemma":[0.5901473,0.0013147561,0.29096967,0.00046209007,0.00021151302,0.00038542593,0.008887207,0.0011019132,0.106520005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945146,0.000063030624,0.00004155975,0.00019165277,0.00010582708,0.00014643576],"domain_scores_gemma":[0.9981534,0.0007514553,0.00018502944,0.00024137198,0.00032568982,0.0003430453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035188196,0.00093685085,0.00078037195,0.002054557,0.0031231483,0.002730802,0.0014933521,0.002030018,0.03251406],"category_scores_gemma":[0.001943135,0.0006240886,0.00093027134,0.0019140381,0.00090677006,0.0033507321,0.0021448499,0.0016085797,0.009470335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013075296,0.0004443812,0.0032741642,0.0018484012,0.0001939864,0.004807714,0.0028191297,0.004429682,0.08808664,0.74634683,0.02254022,0.12390126],"study_design_scores_gemma":[0.00017141608,0.00040680516,0.0019290874,0.00042523025,0.00024835768,0.0033588181,0.001707153,0.013112797,0.053979065,0.7788673,0.14565644,0.00013755843],"about_ca_topic_score_codex":0.0014678604,"about_ca_topic_score_gemma":0.0022175848,"teacher_disagreement_score":0.03251406,"about_ca_system_score_codex":0.0010989928,"about_ca_system_score_gemma":0.0018090137,"threshold_uncertainty_score":0.10877037},"labels":[],"label_agreement":null},{"id":"W2273670553","doi":"10.1007/s00236-016-0258-1","title":"Disjunctivity and other properties of sets of pseudo-bordered words","year":2016,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Combinatorics on words; Mathematics; Combinatorics; Morphism; Suffix; Theta function; Prefix; Word (group theory); Discrete mathematics; Pure mathematics; Geometry; Linguistics","score_opus":0.01445349805396633,"score_gpt":0.21664548021450866,"score_spread":0.20219198216054232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273670553","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60642135,0.0011027124,0.3286216,0.0013104196,0.00021211596,0.0001163489,0.0011815279,0.000394562,0.06063941],"genre_scores_gemma":[0.9401403,0.0003101624,0.050961837,0.00030255996,0.00021322232,0.00019106254,0.0011484012,0.00012399015,0.006608366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702924,0.00068666204,0.0003365968,0.0008776387,0.0007536661,0.00031618687],"domain_scores_gemma":[0.98652786,0.009351639,0.0009572219,0.0010501007,0.0012475024,0.0008657025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023923158,0.0004572039,0.00093190983,0.0026641376,0.0029509165,0.006603005,0.0016274877,0.0010559014,0.0054361834],"category_scores_gemma":[0.010744819,0.0009263592,0.0014585666,0.0022892524,0.0053875255,0.008095648,0.0026404508,0.0023694388,0.0005547524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017474838,0.000039025785,0.0012735028,0.000085265514,0.000032737415,0.00032270083,0.0013079895,0.00102054,0.0036493181,0.9856793,0.0004830694,0.0059319017],"study_design_scores_gemma":[0.000039845072,0.000041557843,0.0008463837,0.000027271253,0.00003131887,0.0005447295,0.00046926635,0.006810581,0.0029346957,0.98463124,0.003595738,0.000027404085],"about_ca_topic_score_codex":0.0005175235,"about_ca_topic_score_gemma":0.00042693372,"teacher_disagreement_score":0.006603005,"about_ca_system_score_codex":0.0010325103,"about_ca_system_score_gemma":0.00046692684,"threshold_uncertainty_score":0.018185854},"labels":[],"label_agreement":null},{"id":"W2275529993","doi":"10.1007/978-3-319-09704-6_29","title":"State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Unary operation; Computer science; State (computer science); Programming language; Theoretical computer science; Discrete mathematics; Mathematics","score_opus":0.022607566690483857,"score_gpt":0.2554334232022315,"score_spread":0.23282585651174764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275529993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6906768,0.0012587997,0.26444492,0.002114169,0.00013763571,0.0001325781,0.0011343193,0.0006257219,0.03947504],"genre_scores_gemma":[0.97297364,0.00042812957,0.019348541,0.0000772107,0.00011939096,0.00011446752,0.00058945315,0.00020894899,0.006140219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712926,0.0005743357,0.0001970841,0.0005143343,0.001004538,0.00058049284],"domain_scores_gemma":[0.97960657,0.01659495,0.0007980182,0.0017279856,0.0008328612,0.00043958967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001666031,0.0005804805,0.0012493969,0.0011014789,0.0012716249,0.0058810185,0.0020608609,0.0012974011,0.008699817],"category_scores_gemma":[0.012960818,0.000715015,0.0021360647,0.0013473969,0.002423023,0.0120101,0.0021171044,0.0038021852,0.00060260564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005929338,0.000189128,0.0021797698,0.00036096037,0.000081265636,0.00019790337,0.0011494589,0.072603874,0.007103487,0.87156636,0.0032831326,0.04069169],"study_design_scores_gemma":[0.00002721973,0.000033497578,0.000516604,0.000022966651,0.000032250147,0.00006872562,0.00009843683,0.14309636,0.0021832013,0.8530788,0.0008112095,0.000030709747],"about_ca_topic_score_codex":0.0029033853,"about_ca_topic_score_gemma":0.0031030846,"teacher_disagreement_score":0.008699817,"about_ca_system_score_codex":0.0032907939,"about_ca_system_score_gemma":0.0020297389,"threshold_uncertainty_score":0.029103756},"labels":[],"label_agreement":null},{"id":"W2278164876","doi":"10.1142/s012905411540016x","title":"Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words","year":2015,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Word (group theory); Complement (music); Generalization; Combinatorics; Binary number; Measure (data warehouse); Similarity (geometry); Natural number; Discrete mathematics; Morse code; Arithmetic; Artificial intelligence; Computer science; Mathematical analysis","score_opus":0.01973837594558339,"score_gpt":0.2763361209495411,"score_spread":0.2565977450039577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278164876","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51834244,0.0039250352,0.42927703,0.0024929706,0.0002546375,0.00012753098,0.00029789665,0.00064605003,0.04463643],"genre_scores_gemma":[0.94365066,0.0006615611,0.050515823,0.00033292657,0.0003826708,0.00017847666,0.00021407704,0.00021512838,0.003848691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99508506,0.0012691476,0.0002694766,0.0009561145,0.0018191043,0.00060103164],"domain_scores_gemma":[0.9611421,0.028718984,0.0016509888,0.0029871122,0.002306037,0.0031947617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006081827,0.0010931039,0.0024876487,0.0032890956,0.0018235052,0.004616526,0.0033767892,0.0021202073,0.0054030446],"category_scores_gemma":[0.051210128,0.001070467,0.0011826876,0.0021685904,0.00552048,0.011962305,0.008271661,0.0032944228,0.00088908616],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005385023,0.00016882464,0.0026654124,0.00027972937,0.00007232549,0.00016671621,0.0007793585,0.028960038,0.0045680595,0.93654644,0.0015455335,0.023709098],"study_design_scores_gemma":[0.000038691494,0.0001645624,0.0013659919,0.000072401825,0.000044384942,0.00024083404,0.00024003175,0.17757386,0.003736117,0.81441003,0.0020430416,0.0000699691],"about_ca_topic_score_codex":0.0010106378,"about_ca_topic_score_gemma":0.0009946858,"teacher_disagreement_score":0.006081827,"about_ca_system_score_codex":0.003939475,"about_ca_system_score_gemma":0.0012814966,"threshold_uncertainty_score":0.032164216},"labels":[],"label_agreement":null},{"id":"W2286338935","doi":"","title":"Journal of Automata, Languages and Combinatorics, Vol. 11(1)","year":2006,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Automaton; Computer science; Mathematics; Programming language; Theoretical computer science","score_opus":0.006748540952273422,"score_gpt":0.22309632727071768,"score_spread":0.21634778631844426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286338935","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015939463,0.28755882,0.18419291,0.027960928,0.065137,0.00019290476,0.0063093673,0.0021180797,0.41059056],"genre_scores_gemma":[0.27445987,0.19241543,0.12213794,0.0067956992,0.049695883,0.0005409392,0.0087787,0.0026756837,0.3424998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99864215,0.00021663745,0.00016116179,0.00044697057,0.00045563502,0.000077442666],"domain_scores_gemma":[0.9968514,0.0011632208,0.00021180743,0.0007365308,0.0007485787,0.00028861684],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012562404,0.0011698261,0.00240918,0.002462994,0.0018544595,0.010106598,0.0010660427,0.0011928208,0.05670591],"category_scores_gemma":[0.0045289886,0.0008335667,0.0010791323,0.0040691695,0.0025104303,0.0059580263,0.0018685466,0.0044861436,0.013163164],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011373657,0.00014999132,0.0019650334,0.0015534965,0.00016856499,0.00022894623,0.00047186084,0.0017477353,0.002036147,0.49461424,0.2894699,0.20748043],"study_design_scores_gemma":[0.000029781058,0.000042145115,0.001967497,0.00024869404,0.00010179067,0.0008672728,0.00016364251,0.0026097195,0.00063453696,0.47309107,0.52020943,0.00003438095],"about_ca_topic_score_codex":0.001629408,"about_ca_topic_score_gemma":0.001980088,"teacher_disagreement_score":0.9432941,"about_ca_system_score_codex":0.0022072732,"about_ca_system_score_gemma":0.0028575256,"threshold_uncertainty_score":0.18970019},"labels":[],"label_agreement":null},{"id":"W2287420140","doi":"","title":"Abstract numeration systems or decimation of languages","year":2011,"lang":"en","type":"article","venue":"Open Repository and Bibliography (University of Liège)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decimation; Integer (computer science); Combinatorics; Mathematics; Sequence (biology); Discrete mathematics; Bounded function; Word (group theory); Arithmetic; Computer science; Programming language; Telecommunications; Geometry","score_opus":0.029082824484588557,"score_gpt":0.22757069856101855,"score_spread":0.19848787407642998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287420140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118026674,0.021482538,0.596145,0.005417535,0.0021236818,0.00015619137,0.0015491833,0.002483243,0.25261602],"genre_scores_gemma":[0.8303721,0.004172471,0.10734388,0.0010485423,0.0013850967,0.0001858233,0.0011750445,0.00034718815,0.053969897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984843,0.00037442925,0.00015671208,0.0005351503,0.00030182535,0.00014753177],"domain_scores_gemma":[0.99775773,0.0010028547,0.00025406468,0.00045709015,0.00038276086,0.00014554632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008467106,0.00054861984,0.00057130127,0.0010312088,0.000717084,0.0030516915,0.00061923283,0.00060797046,0.009200542],"category_scores_gemma":[0.0031704216,0.0003106952,0.00054290274,0.0014193815,0.0032337136,0.004617628,0.0018618194,0.001665369,0.0017078716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067956404,0.0000119301385,0.00025712137,0.00018020578,0.000008841181,0.00010717432,0.0004557157,0.0019082079,0.0017645977,0.96209913,0.0034486798,0.02969043],"study_design_scores_gemma":[0.000017627606,0.00003783604,0.00020382834,0.00009212295,0.000008218036,0.00028313368,0.00014795605,0.0046665673,0.0020227947,0.9147024,0.0777958,0.000021651826],"about_ca_topic_score_codex":0.00041919813,"about_ca_topic_score_gemma":0.0002793414,"teacher_disagreement_score":0.009200542,"about_ca_system_score_codex":0.0013625413,"about_ca_system_score_gemma":0.00060158904,"threshold_uncertainty_score":0.030778885},"labels":[],"label_agreement":null},{"id":"W2288306272","doi":"10.1016/j.tcs.2016.02.034","title":"The effect of end-markers on counter machines and commutativity","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Commutative property; Nondeterministic algorithm; Mathematics; Decidability; Deterministic pushdown automaton; Finite-state machine; Discrete mathematics; Bounded function; Nested word; Closure (psychology); Regular language; Pushdown automaton; Class (philosophy); Quotient; Automaton; Quantum finite automata; Nondeterministic finite automaton; Combinatorics; Automata theory; Computer science; Algorithm; Theoretical computer science","score_opus":0.0032313319446241667,"score_gpt":0.23135244729608526,"score_spread":0.2281211153514611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288306272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6430867,0.0011043769,0.26863638,0.0031632343,0.00077422755,0.00009810893,0.00034306862,0.0019480392,0.080845885],"genre_scores_gemma":[0.97938377,0.00019703616,0.013734906,0.00022010275,0.00012480622,0.000057167377,0.00006256433,0.0003658466,0.005853769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99476385,0.0022698354,0.00039268695,0.0009713276,0.0007241551,0.000878089],"domain_scores_gemma":[0.89360785,0.08386366,0.0027962683,0.013108104,0.003190646,0.00343337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006747651,0.00083317753,0.0016761611,0.0012748276,0.003997591,0.005504524,0.0023926913,0.0031258988,0.019556684],"category_scores_gemma":[0.04550185,0.001239842,0.0018036693,0.0010382002,0.009225705,0.01886707,0.005851478,0.0032587533,0.0012073881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013745544,0.0001879328,0.0021537275,0.00020473448,0.000042062926,0.0005072657,0.0013710451,0.007155868,0.00791598,0.9627567,0.0013861452,0.014944044],"study_design_scores_gemma":[0.00014186557,0.00015133027,0.00095461705,0.000042489148,0.00012650776,0.00032928726,0.0005216002,0.019030888,0.016012302,0.9597734,0.002837784,0.000077942736],"about_ca_topic_score_codex":0.0010491967,"about_ca_topic_score_gemma":0.0011486133,"teacher_disagreement_score":0.019556684,"about_ca_system_score_codex":0.0010518337,"about_ca_system_score_gemma":0.001427538,"threshold_uncertainty_score":0.06542361},"labels":[],"label_agreement":null},{"id":"W2291478302","doi":"","title":"Image texture analysis using weighted finite automata","year":2003,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Automaton; Nondeterministic finite automaton; Mathematics; Texture (cosmology); Finite-state machine; DFA minimization; ENCODE; Image texture; Algorithm; Image (mathematics); Hausdorff space; Quantum finite automata; Computer science; Theoretical computer science; Artificial intelligence; Pattern recognition (psychology); Discrete mathematics; Automata theory; Image processing","score_opus":0.012314661173251884,"score_gpt":0.24611262213043758,"score_spread":0.2337979609571857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291478302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10435341,0.00016541316,0.89371437,0.00006873445,0.00002493617,0.000028333989,0.000041741467,0.00025990774,0.0013430762],"genre_scores_gemma":[0.77019626,0.00019071047,0.22800384,0.000024659073,0.000026029058,0.000061544975,0.00008688848,0.000074193886,0.0013358989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970347,0.00006555501,0.000021506994,0.00007720711,0.00009866835,0.000033595803],"domain_scores_gemma":[0.9983015,0.0010639599,0.00017896038,0.00020942911,0.00018925649,0.00005684104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004606867,0.00033004888,0.00043924438,0.00093728874,0.00030144665,0.0009453627,0.00052634964,0.00040264777,0.001414789],"category_scores_gemma":[0.0034516663,0.00018930975,0.00067633286,0.00055683433,0.0009995379,0.0014019608,0.000517766,0.00045249978,0.00019238997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003942554,0.00007089646,0.0040647048,0.00031064416,0.00010939102,0.0004978647,0.00056964223,0.48307288,0.14147593,0.1891221,0.00062067417,0.17969091],"study_design_scores_gemma":[0.000008040807,0.0000698069,0.0006206649,0.000009891096,0.00001906346,0.0000737004,0.000050815634,0.93194765,0.013458289,0.052965768,0.00075911486,0.000017181683],"about_ca_topic_score_codex":0.0010459018,"about_ca_topic_score_gemma":0.00076941727,"teacher_disagreement_score":0.001414789,"about_ca_system_score_codex":0.00046004183,"about_ca_system_score_gemma":0.00019382023,"threshold_uncertainty_score":0.004732907},"labels":[],"label_agreement":null},{"id":"W2293608128","doi":"10.1007/978-3-319-21500-6_31","title":"State Complexity of Neighbourhoods and Approximate Pattern Matching","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Substring; Neighbourhood (mathematics); Upper and lower bounds; Alphabet; Nondeterministic algorithm; Deterministic finite automaton; Combinatorics; Edit distance; State (computer science); Automaton; String searching algorithm; String (physics); Time complexity; Finite-state machine; Computer science; Approximate string matching; Discrete mathematics; Mathematics; Pattern matching; Algorithm; Set (abstract data type); Theoretical computer science; Artificial intelligence","score_opus":0.03395389298181168,"score_gpt":0.2580642488607614,"score_spread":0.22411035587894973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293608128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43075085,0.001679652,0.51966774,0.003140521,0.00014636827,0.00015929835,0.0018198359,0.0008498468,0.04178587],"genre_scores_gemma":[0.9453736,0.0007889088,0.041902915,0.00014135652,0.0001557087,0.00017933775,0.0011518488,0.00021654925,0.010089832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971836,0.0006179498,0.00022535959,0.0005716641,0.0010383286,0.00036298097],"domain_scores_gemma":[0.9790846,0.015638804,0.0011926444,0.0026098625,0.000945399,0.00052875147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016914449,0.00053335365,0.0018311066,0.0014297747,0.0012886138,0.005030332,0.0029380932,0.002098839,0.012084458],"category_scores_gemma":[0.020487608,0.00082966156,0.0017282788,0.0028259044,0.0025603387,0.01177575,0.0035359615,0.0028882995,0.00088021957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038685574,0.00012180806,0.0017573722,0.00030698747,0.000062476145,0.00012337348,0.0004284133,0.09783499,0.0023730579,0.85013694,0.0032180047,0.043249704],"study_design_scores_gemma":[0.000018215447,0.000020886762,0.00027032485,0.000014372194,0.000020525933,0.00006137281,0.000055602184,0.17370807,0.00077664154,0.82435,0.00068981724,0.000014005868],"about_ca_topic_score_codex":0.0019519178,"about_ca_topic_score_gemma":0.0015955232,"teacher_disagreement_score":0.012084458,"about_ca_system_score_codex":0.0025414447,"about_ca_system_score_gemma":0.0014107568,"threshold_uncertainty_score":0.040426552},"labels":[],"label_agreement":null},{"id":"W2296004905","doi":"10.37236/6003","title":"A Ternary Square-free Sequence Avoiding Factors Equivalent to $abcacba$","year":2016,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ternary operation; Square-free integer; Lexicographical order; Square (algebra); Mathematics; Combinatorics; Word (group theory); Sequence (biology); Arithmetic; Discrete mathematics; Computer science; Geometry; Chemistry","score_opus":0.01972710738274241,"score_gpt":0.2509052272474111,"score_spread":0.23117811986466869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296004905","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5408065,0.0009481771,0.33854213,0.0013171822,0.0012775323,0.00013158857,0.00073678663,0.0010473138,0.115192726],"genre_scores_gemma":[0.89733624,0.00034852247,0.06337519,0.0005318107,0.0002621666,0.00011224747,0.00069866644,0.00038442435,0.036950696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926037,0.00007375647,0.000060839604,0.00028702014,0.00017156613,0.00014647188],"domain_scores_gemma":[0.99874604,0.00044573442,0.00014863568,0.00020481582,0.0002997085,0.00015512489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029179512,0.0005401444,0.00051821186,0.00054810976,0.001558473,0.0018271854,0.00043061373,0.0009437438,0.016046643],"category_scores_gemma":[0.0022264398,0.00028701028,0.0007557765,0.00056358427,0.0015745814,0.0020222045,0.0009762992,0.0012108462,0.0032207265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041760533,0.00007202147,0.0011377924,0.00028907112,0.000024697718,0.0008260307,0.0009806335,0.0023058588,0.027673459,0.9192714,0.005739725,0.04126171],"study_design_scores_gemma":[0.000054794902,0.0001625538,0.00096412445,0.0000739855,0.00004946994,0.0013843267,0.00041572755,0.01270154,0.019382743,0.9083033,0.05644308,0.00006431093],"about_ca_topic_score_codex":0.0014153328,"about_ca_topic_score_gemma":0.0011029578,"teacher_disagreement_score":0.016046643,"about_ca_system_score_codex":0.00054213096,"about_ca_system_score_gemma":0.0008316324,"threshold_uncertainty_score":0.053681374},"labels":[],"label_agreement":null},{"id":"W2308068944","doi":"10.71781/15641","title":"Homologie de morse et théorème de la signature","year":2009,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Morse code; Mathematics; Computer science","score_opus":0.028355987454048884,"score_gpt":0.3452112124085911,"score_spread":0.3168552249545422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2308068944","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29101145,0.013788836,0.3042041,0.009963289,0.0032675047,0.000078831275,0.0011418038,0.0010082709,0.37553596],"genre_scores_gemma":[0.8800156,0.004055216,0.03936482,0.0009613164,0.0020431762,0.000114306815,0.00063489465,0.00031871942,0.07249194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991021,0.00022479729,0.000037879196,0.00018963746,0.000314434,0.00013117488],"domain_scores_gemma":[0.999003,0.00041773348,0.000094166426,0.00012233105,0.00023914628,0.00012360945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001229889,0.00061375526,0.0010734705,0.0023424726,0.0018205937,0.0035356747,0.00091294287,0.0013253979,0.008952285],"category_scores_gemma":[0.0032286658,0.0003701882,0.0014438542,0.001791079,0.0038945319,0.004918803,0.0022560325,0.004073301,0.0015922785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029831204,0.000007366572,0.0001469705,0.000039002553,0.000012111949,0.00007767028,0.00029183258,0.00032600426,0.0009371068,0.9906538,0.001300278,0.006178061],"study_design_scores_gemma":[0.00003328197,0.000035454636,0.0009083855,0.00002397988,0.000014468746,0.00049103296,0.00022544818,0.002380466,0.0012267327,0.9720647,0.02256733,0.000028757993],"about_ca_topic_score_codex":0.0071493387,"about_ca_topic_score_gemma":0.0036753437,"teacher_disagreement_score":0.008952285,"about_ca_system_score_codex":0.0037674175,"about_ca_system_score_gemma":0.0014759367,"threshold_uncertainty_score":0.029948413},"labels":[],"label_agreement":null},{"id":"W2308274958","doi":"","title":"On a Semigroup Variety of György Pollák","year":2010,"lang":"en","type":"article","venue":"NSUWorks (Nova Southeastern University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Subvariety; Mathematics; Semigroup; Variety (cybernetics); Pure mathematics; Discrete mathematics; Statistics","score_opus":0.007572177382830552,"score_gpt":0.18747951257728251,"score_spread":0.17990733519445196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2308274958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.672953,0.005750464,0.15562534,0.0028091858,0.0002987451,0.0001451276,0.0007372487,0.00052782934,0.16115299],"genre_scores_gemma":[0.96822417,0.0008626699,0.018790664,0.00013403376,0.00011604026,0.000108231165,0.00044394226,0.000048116413,0.011272178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991559,0.0002055571,0.000047702317,0.00022176604,0.00021036614,0.00015886009],"domain_scores_gemma":[0.99933606,0.00038184554,0.0000631694,0.00005416377,0.00006523885,0.00009949054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008164863,0.00036660963,0.00072478055,0.0015354633,0.002085077,0.003333824,0.00041023837,0.00043979497,0.0030997999],"category_scores_gemma":[0.0016083469,0.00034856255,0.0010462138,0.0012417359,0.004184705,0.0040718988,0.002435079,0.0014339001,0.00049806613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008867575,0.000015283624,0.0005082664,0.000041319185,0.000006575311,0.0004174698,0.00091853517,0.0012493209,0.0018962666,0.99079144,0.00046223844,0.0036045716],"study_design_scores_gemma":[0.00006802362,0.00005814846,0.0013624026,0.000047428755,0.00001931157,0.00046473186,0.00054163276,0.0064843567,0.002031747,0.97144115,0.017447826,0.000033262717],"about_ca_topic_score_codex":0.0027552173,"about_ca_topic_score_gemma":0.0013044942,"teacher_disagreement_score":0.003333824,"about_ca_system_score_codex":0.002153986,"about_ca_system_score_gemma":0.000719304,"threshold_uncertainty_score":0.015628397},"labels":[],"label_agreement":null},{"id":"W2313822457","doi":"10.1142/9789812776884_0008","title":"PROFINITE GROUPS AND APPLICATIONS TO FINITE SEMIGROUPS","year":2002,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Profinite group; Computer science; Algebra over a field; Pure mathematics; Mathematics; Group (periodic table); Physics","score_opus":0.01896540230934599,"score_gpt":0.2250850562541717,"score_spread":0.2061196539448257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313822457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14119764,0.04805013,0.5939768,0.011999403,0.0029492306,0.00008999495,0.00048159694,0.00078535173,0.20046988],"genre_scores_gemma":[0.83342606,0.019918023,0.0931666,0.0013619363,0.0049713906,0.00019333763,0.00035616808,0.00022583055,0.046380717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926776,0.00028178876,0.000050251503,0.00015765245,0.00018043409,0.000062054634],"domain_scores_gemma":[0.99628395,0.0027406546,0.00018094333,0.00026134157,0.00027873335,0.00025437164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011765144,0.0008692485,0.00095998833,0.0029371518,0.0018321361,0.0033698587,0.0009239959,0.001625093,0.008126046],"category_scores_gemma":[0.0049126875,0.00063622853,0.0011143226,0.0027382167,0.00487863,0.0063654496,0.0025131651,0.0032800634,0.001208388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011955395,0.000009792602,0.00006944767,0.000040726663,0.000004206648,0.000054061507,0.0002765014,0.00064680976,0.0003126864,0.99139684,0.00064193114,0.006535189],"study_design_scores_gemma":[0.000004598171,0.0000056965105,0.00003555854,0.000008761859,0.000003460447,0.0000556544,0.00004339055,0.0013313562,0.00011625653,0.9941883,0.0042019603,0.000004878863],"about_ca_topic_score_codex":0.0006731389,"about_ca_topic_score_gemma":0.0007312068,"teacher_disagreement_score":0.008126046,"about_ca_system_score_codex":0.0011662607,"about_ca_system_score_gemma":0.00039400917,"threshold_uncertainty_score":0.027184367},"labels":[],"label_agreement":null},{"id":"W2315867495","doi":"10.1142/s0218196716500612","title":"The subpower membership problem for semigroups","year":2016,"lang":"en","type":"preprint","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Semigroup; Mathematics; Commutative property; Direct product; Cancellative semigroup; Nilpotent; Polynomial; Combinatorics; Discrete mathematics","score_opus":0.015184544212072722,"score_gpt":0.2838025573647477,"score_spread":0.268618013152675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2315867495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3853266,0.0015976843,0.5566664,0.011854704,0.00040352624,0.00040955693,0.0019256173,0.0031771336,0.03863884],"genre_scores_gemma":[0.8726577,0.00072833453,0.10430234,0.0011314151,0.0005852246,0.00031986978,0.0024092803,0.0004922481,0.017373564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99490345,0.0014192514,0.00042995787,0.00149506,0.0011497868,0.000602473],"domain_scores_gemma":[0.98061013,0.014160478,0.0006964699,0.0023448835,0.0012064739,0.0009814502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040824087,0.00062427117,0.0013318793,0.0010354582,0.0024778282,0.00449781,0.002238116,0.001985013,0.010214727],"category_scores_gemma":[0.01702684,0.0009474769,0.0021166913,0.0011145445,0.003940895,0.019797832,0.004593266,0.0047297315,0.0021309764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093685876,0.0004466695,0.0030236894,0.00069592684,0.00008825722,0.0009511485,0.0035274485,0.01532983,0.010063501,0.8555898,0.010488584,0.09885834],"study_design_scores_gemma":[0.000052311298,0.00005438824,0.00022466337,0.000026246938,0.000021465237,0.0002790203,0.00029501406,0.02674689,0.0042084414,0.9624734,0.005594786,0.000023397246],"about_ca_topic_score_codex":0.0011554565,"about_ca_topic_score_gemma":0.00084359717,"teacher_disagreement_score":0.010214727,"about_ca_system_score_codex":0.0021036752,"about_ca_system_score_gemma":0.0015562692,"threshold_uncertainty_score":0.03417164},"labels":[],"label_agreement":null},{"id":"W2324179043","doi":"10.7151/dmgaa.1036","title":"The semantical hyperunification problem","year":2001,"lang":"en","type":"article","venue":"Discussiones Mathematicae - General Algebra and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Kernel (algebra); Variety (cybernetics); Homomorphism; Invariant (physics); Discrete mathematics; Congruence (geometry); Type (biology); Algebra over a field; Pure mathematics","score_opus":0.00875509974983129,"score_gpt":0.23510693301893817,"score_spread":0.22635183326910688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2324179043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18013127,0.002142701,0.75750285,0.009726143,0.0003380447,0.00023690287,0.0009507118,0.0007127302,0.048258666],"genre_scores_gemma":[0.81313896,0.0009232617,0.17078385,0.000991211,0.0006714175,0.00034861744,0.0014558505,0.00023439858,0.011452434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98763627,0.0029500048,0.001076136,0.003782306,0.0031727976,0.0013824285],"domain_scores_gemma":[0.98900944,0.0055832095,0.0008303886,0.0028453574,0.0012213705,0.0005102978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008108171,0.0008422221,0.0020419843,0.003027308,0.004775621,0.007193308,0.0046323603,0.0037988003,0.005440307],"category_scores_gemma":[0.016382288,0.0013224757,0.0032146776,0.0036283263,0.014105627,0.030897398,0.01320261,0.009085325,0.00074563845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039299295,0.000028503806,0.0003489099,0.00006327441,0.000022079495,0.00009101632,0.00064752536,0.001016608,0.00050717645,0.9848104,0.0005951773,0.011830059],"study_design_scores_gemma":[0.000018527202,0.000008496718,0.0001850445,0.000023248911,0.000017974879,0.00009770997,0.00028290553,0.0043662405,0.00091935456,0.9909378,0.0031229863,0.000019723046],"about_ca_topic_score_codex":0.0023553418,"about_ca_topic_score_gemma":0.0010394412,"teacher_disagreement_score":0.008108171,"about_ca_system_score_codex":0.0052133105,"about_ca_system_score_gemma":0.0028381557,"threshold_uncertainty_score":0.042880595},"labels":[],"label_agreement":null},{"id":"W2328055175","doi":"10.4153/cmb-2002-062-3","title":"Pure Discrete Spectrum for One-dimensional Substitution Systems of Pisot Type","year":2002,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Washington; National Science Foundation","keywords":"Mathematics; Substitution (logic); Action (physics); Spectrum (functional analysis); Type (biology); Corollary; Dynamical systems theory; Sequence (biology); Dynamical system (definition); Pure mathematics; Scheme (mathematics); Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.022303565074726913,"score_gpt":0.2107680713134128,"score_spread":0.18846450623868588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2328055175","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8437466,0.0000722838,0.1472185,0.00012281309,0.000038522106,0.000035504203,0.00004225269,0.00021590518,0.008507643],"genre_scores_gemma":[0.98380893,0.00002270661,0.014752587,0.000021819122,0.000009914656,0.00003421064,0.000038085098,0.000023684004,0.0012880424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907696,0.00020290383,0.0000911423,0.00017897015,0.00030573292,0.00014427236],"domain_scores_gemma":[0.99780184,0.0010216678,0.0002533003,0.00029934375,0.00033460488,0.00028921815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007142656,0.00026657063,0.00050458283,0.00082300924,0.0009821146,0.0017390101,0.0005193648,0.0008010788,0.003521161],"category_scores_gemma":[0.0028085394,0.00023741946,0.00044079806,0.000322191,0.002835307,0.0016386714,0.0014447661,0.0005918164,0.00030963423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023667423,0.000098524535,0.0037011346,0.00007223135,0.0000260539,0.00076751993,0.0010831783,0.012339945,0.029516941,0.9429492,0.00024348297,0.008965199],"study_design_scores_gemma":[0.00007954547,0.00018123457,0.0014953293,0.000031127525,0.000031974647,0.0005969809,0.0006273124,0.22049166,0.030775448,0.7426499,0.0029776515,0.00006183474],"about_ca_topic_score_codex":0.0005154909,"about_ca_topic_score_gemma":0.0004256857,"teacher_disagreement_score":0.003521161,"about_ca_system_score_codex":0.00076131994,"about_ca_system_score_gemma":0.0004423011,"threshold_uncertainty_score":0.011779487},"labels":[],"label_agreement":null},{"id":"W2331097733","doi":"10.1142/9789812778857_0005","title":"BETA-EXPANSIONS OF PISOT AND SALEM NUMBERS","year":2007,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"BETA (programming language); Mathematics; Computer science; Programming language","score_opus":0.010357235088151768,"score_gpt":0.24017431000621525,"score_spread":0.2298170749180635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331097733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4768655,0.0027101848,0.24544393,0.0026057544,0.0009613779,0.00006206858,0.00029526456,0.00047861194,0.2705773],"genre_scores_gemma":[0.9308935,0.00065845397,0.028115096,0.00038446748,0.00047339627,0.00008863521,0.0001526389,0.00012658905,0.039107207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994715,0.00012705804,0.000026220632,0.000091936614,0.00019774024,0.00008554101],"domain_scores_gemma":[0.99867237,0.0007498307,0.00009747929,0.00012585211,0.00020767165,0.00014687736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085191533,0.0004367337,0.0006439783,0.0016179988,0.0013223522,0.0019847692,0.00062483764,0.00068558904,0.007693626],"category_scores_gemma":[0.003840854,0.0003663373,0.00053373276,0.0013309618,0.0026306966,0.0031799779,0.0013475001,0.0017763992,0.0011322626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020978006,0.0000048336688,0.00008639201,0.000009883034,0.0000013125791,0.00006202492,0.0001785535,0.00020708048,0.0005042157,0.99559397,0.0004896812,0.0028410922],"study_design_scores_gemma":[0.000011346564,0.00001091536,0.0001765951,0.000009148925,0.000004210566,0.00017660673,0.00007450145,0.0023024557,0.00048700473,0.99282867,0.0039112116,0.000007427603],"about_ca_topic_score_codex":0.00039537592,"about_ca_topic_score_gemma":0.0005074324,"teacher_disagreement_score":0.007693626,"about_ca_system_score_codex":0.0008956865,"about_ca_system_score_gemma":0.00041627834,"threshold_uncertainty_score":0.025737703},"labels":[],"label_agreement":null},{"id":"W233362823","doi":"","title":"Approximations de Séries Génératrices et Quelques Conjectures","year":2014,"lang":"fr","type":"preprint","venue":"viXra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Physics; Calculus (dental)","score_opus":0.022888260170104407,"score_gpt":0.2795945388202295,"score_spread":0.2567062786501251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W233362823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5089253,0.010296112,0.14909425,0.024975896,0.002250191,0.00013490148,0.0021539964,0.0013055213,0.30086377],"genre_scores_gemma":[0.8986078,0.004922912,0.02728522,0.0017369997,0.0023192873,0.00026605447,0.0020515684,0.00028818834,0.06252197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954332,0.0013453887,0.0001841632,0.0008623875,0.0014876978,0.00068722153],"domain_scores_gemma":[0.97813696,0.015249138,0.0010806964,0.0020195248,0.0027026648,0.0008110728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049457327,0.0023214226,0.0028014586,0.003674958,0.005640007,0.011671368,0.0022595096,0.00409095,0.015385937],"category_scores_gemma":[0.030166999,0.0013304935,0.0025964426,0.0041544465,0.010958646,0.010448832,0.0023391987,0.01174382,0.0023866654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002270288,0.00006902671,0.0013298321,0.00012248498,0.00003595757,0.00024860224,0.0007411541,0.0065725856,0.00056674954,0.97558993,0.0038158982,0.010680692],"study_design_scores_gemma":[0.00009230047,0.000037987415,0.0013998117,0.00006538209,0.000029710021,0.00021098313,0.00059181557,0.026029775,0.00078977813,0.9619212,0.008796424,0.000034782628],"about_ca_topic_score_codex":0.054437462,"about_ca_topic_score_gemma":0.048503693,"teacher_disagreement_score":0.054437462,"about_ca_system_score_codex":0.016391434,"about_ca_system_score_gemma":0.0028975704,"threshold_uncertainty_score":0.11892873},"labels":[],"label_agreement":null},{"id":"W2336446049","doi":"10.1142/s0129054115400067","title":"Large Aperiodic Semigroups","year":2015,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Aperiodic graph; Semigroup; Mathematics; Unitary state; Special classes of semigroups; Tree (set theory); Quotient; Krohn–Rhodes theory; Discrete mathematics; State (computer science); Bicyclic semigroup; Pure mathematics; Combinatorics; Monoid; Algorithm","score_opus":0.02200527659450329,"score_gpt":0.30170178542708187,"score_spread":0.27969650883257857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336446049","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7380623,0.0006375374,0.24502374,0.00033313184,0.000051534826,0.00006717224,0.00015736574,0.00028649493,0.01538075],"genre_scores_gemma":[0.95105636,0.00018513754,0.045853097,0.000040757302,0.000057893347,0.000058977792,0.00014984362,0.000032482225,0.002565458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994205,0.00011407905,0.000041477968,0.00021095331,0.0001491103,0.00006381509],"domain_scores_gemma":[0.99692434,0.0018824836,0.0003428105,0.000306697,0.00025527223,0.00028833203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008170253,0.00019793832,0.00034924742,0.0006002365,0.0007045738,0.00095931767,0.00041810144,0.00029387392,0.0019509204],"category_scores_gemma":[0.002722185,0.00020620492,0.00048856286,0.00033752606,0.0015070115,0.001776247,0.0008255415,0.0004986661,0.00020358997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010850298,0.000049820992,0.0021198632,0.00015746974,0.0000157705,0.00048763357,0.0006357221,0.008291957,0.024777425,0.9420847,0.00063408125,0.020637007],"study_design_scores_gemma":[0.000027583186,0.000119741766,0.0013796502,0.000031367257,0.000019864963,0.00068280014,0.00030613077,0.051793102,0.010380715,0.92708594,0.008147956,0.000025272222],"about_ca_topic_score_codex":0.0001634658,"about_ca_topic_score_gemma":0.00019497926,"teacher_disagreement_score":0.0019509204,"about_ca_system_score_codex":0.00037467753,"about_ca_system_score_gemma":0.0004702998,"threshold_uncertainty_score":0.00652647},"labels":[],"label_agreement":null},{"id":"W2342016401","doi":"","title":"State Complexity of Unranked Tree Automata","year":2010,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Tree (set theory); Tree automaton; Automaton; State (computer science); String (physics); Nondeterministic finite automaton; Computer science; Mathematics; Combinatorics; Deterministic finite automaton; Discrete mathematics; Theoretical computer science; Automata theory; Algorithm","score_opus":0.023916768631599115,"score_gpt":0.24900218605603927,"score_spread":0.22508541742444016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342016401","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5858249,0.0005384499,0.39668456,0.00094178366,0.00009071381,0.00008720227,0.0008736034,0.0009455996,0.014013192],"genre_scores_gemma":[0.9616765,0.00022148222,0.032762863,0.0000771521,0.000049791197,0.00008472183,0.0006681417,0.00008901875,0.004370503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974866,0.0005186747,0.00023884315,0.0005149884,0.00089854974,0.00034219524],"domain_scores_gemma":[0.989813,0.0071387775,0.00078488037,0.0010792589,0.000881721,0.00030225454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001044472,0.00043709978,0.0006705432,0.0010816678,0.0007543079,0.0035367196,0.0012898713,0.0008974278,0.0058733234],"category_scores_gemma":[0.00820495,0.00036313423,0.0011164955,0.000985418,0.0019060902,0.0065858024,0.0016647911,0.0018291476,0.00051572704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000250709,0.000114022085,0.002061818,0.00027481772,0.000051191168,0.00035882968,0.00070526986,0.1312271,0.009716253,0.82627946,0.0013779342,0.027582586],"study_design_scores_gemma":[0.000019896795,0.000044710025,0.0003653125,0.00001725141,0.000025594276,0.0000887706,0.00005796224,0.34495863,0.004796983,0.64836437,0.0012320224,0.000028512426],"about_ca_topic_score_codex":0.0013398073,"about_ca_topic_score_gemma":0.0013942351,"teacher_disagreement_score":0.0058733234,"about_ca_system_score_codex":0.0018411005,"about_ca_system_score_gemma":0.0007520531,"threshold_uncertainty_score":0.019648194},"labels":[],"label_agreement":null},{"id":"W2344606806","doi":"10.1016/j.tcs.2016.04.015","title":"On Sillke's bijection","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Cardinality (data modeling); Indecomposable module; Combinatorics; Mathematics; Group (periodic table); Discrete mathematics; Computer science; Chemistry; Database","score_opus":0.005954904830763786,"score_gpt":0.223660163684643,"score_spread":0.21770525885387923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344606806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08765749,0.004523948,0.4723934,0.011673258,0.0033973285,0.00011840965,0.0005486345,0.0011380364,0.41854954],"genre_scores_gemma":[0.7513572,0.002869065,0.08646727,0.0042794547,0.0013207664,0.00027736826,0.0005315447,0.001118066,0.15177917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987469,0.00043441312,0.0000877968,0.00028024355,0.0002595473,0.0001911343],"domain_scores_gemma":[0.9982773,0.0010163726,0.00007125566,0.00021171814,0.0002786852,0.00014457598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014889495,0.00078981515,0.0011408145,0.0029244937,0.004491279,0.0038332683,0.0012396767,0.0022585778,0.018828064],"category_scores_gemma":[0.004545555,0.00079533196,0.0013507155,0.002464234,0.0054724636,0.011980352,0.005045443,0.004871202,0.0043079103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016276543,0.000009296037,0.000028119965,0.000019760297,0.0000028217949,0.000032812735,0.00029799662,0.00011889524,0.00020280154,0.99417096,0.0014575353,0.003642798],"study_design_scores_gemma":[0.00000854659,0.000007822801,0.000025931899,0.0000105172985,0.0000046539203,0.00006861045,0.00007674426,0.0005285281,0.00021517469,0.98987496,0.009168302,0.000010328936],"about_ca_topic_score_codex":0.0010709327,"about_ca_topic_score_gemma":0.0008899184,"teacher_disagreement_score":0.018828064,"about_ca_system_score_codex":0.0015251356,"about_ca_system_score_gemma":0.0007127832,"threshold_uncertainty_score":0.062986135},"labels":[],"label_agreement":null},{"id":"W2345399371","doi":"10.1023/a:1022845202361","title":"Counting Endomorphisms of Crown-like Orders","year":2002,"lang":"en","type":"article","venue":"Order","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Algebra over a field; Combinatorics; Pure mathematics","score_opus":0.014556372211343415,"score_gpt":0.20391724787052304,"score_spread":0.1893608756591796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345399371","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71401256,0.00072217925,0.2462441,0.0009406771,0.00020951337,0.000080345824,0.00036365926,0.00049265166,0.03693438],"genre_scores_gemma":[0.94742936,0.0003883985,0.040402707,0.00016084238,0.00018534236,0.00007582549,0.00030122107,0.00012745989,0.010928736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985474,0.00025667727,0.00014905307,0.00030055354,0.00048078824,0.00026559344],"domain_scores_gemma":[0.9917121,0.004385489,0.00084497407,0.0010342427,0.0010275902,0.0009957177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018090663,0.0005620348,0.0011013944,0.0030984022,0.0020461446,0.0054360875,0.0012588996,0.001440469,0.0044282163],"category_scores_gemma":[0.0075190663,0.00067115686,0.0009838354,0.0027299633,0.0034335258,0.009709443,0.0021336116,0.0020873067,0.00043389344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049435086,0.00002657191,0.0012220999,0.000029056842,0.000006529624,0.000091902744,0.0003521276,0.0005940462,0.0016383381,0.98989874,0.00055121403,0.005540006],"study_design_scores_gemma":[0.0000114325785,0.00002049804,0.0007424395,0.000015195329,0.000019438014,0.00024256435,0.00016481112,0.006162396,0.0017124763,0.9882216,0.002669767,0.000017375238],"about_ca_topic_score_codex":0.0010128311,"about_ca_topic_score_gemma":0.0018343359,"teacher_disagreement_score":0.0054360875,"about_ca_system_score_codex":0.0018354879,"about_ca_system_score_gemma":0.00084019254,"threshold_uncertainty_score":0.01481384},"labels":[],"label_agreement":null},{"id":"W2374151057","doi":"","title":"On residual finiteness of π-inverse semigroup","year":2003,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Residual; Mathematics; Semigroup; Inverse; Inverse semigroup; Cancellative semigroup; Inverse element; Pure mathematics; Special classes of semigroups; Algorithm; Geometry","score_opus":0.011848445623595069,"score_gpt":0.2190495794780286,"score_spread":0.20720113385443353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2374151057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4892686,0.0077775423,0.40512568,0.0034817106,0.00043118602,0.00011696045,0.00060663617,0.0005088613,0.092682876],"genre_scores_gemma":[0.94867986,0.0021368423,0.03940347,0.0004872824,0.000636141,0.000099031844,0.0007031963,0.00010071366,0.007753413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980609,0.0004772196,0.00019348961,0.0006107225,0.00042311542,0.00023458376],"domain_scores_gemma":[0.9918651,0.0049438095,0.0005621841,0.0007925832,0.0013497707,0.00048646107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031164463,0.000613393,0.000804813,0.0018660484,0.0011012165,0.0018113944,0.00065074494,0.0012459933,0.004160499],"category_scores_gemma":[0.0076303356,0.00043624538,0.001438099,0.00076088303,0.0047673676,0.0062303287,0.0017749952,0.0028151162,0.00065047236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009384863,0.000038304337,0.0011085502,0.00016466565,0.000021102804,0.00038839437,0.00093407615,0.0022826898,0.0067397375,0.97919774,0.0006801206,0.008350816],"study_design_scores_gemma":[0.000027900396,0.00017999006,0.00090160477,0.00006329058,0.00002802603,0.0005181655,0.00028615326,0.011860011,0.004107377,0.9773068,0.0046732156,0.000047491325],"about_ca_topic_score_codex":0.00080839667,"about_ca_topic_score_gemma":0.00046198268,"teacher_disagreement_score":0.004160499,"about_ca_system_score_codex":0.0012410193,"about_ca_system_score_gemma":0.00066852616,"threshold_uncertainty_score":0.016481519},"labels":[],"label_agreement":null},{"id":"W2395596657","doi":"","title":"Operational State Complexity of Nested Word Automata.","year":2008,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Nested word; Quantum finite automata; Finite-state machine; Mathematics; Discrete mathematics; Constant (computer programming); Upper and lower bounds; Automaton; Word (group theory); Deterministic finite automaton; Automata theory; Combinatorics; Computer science; Theoretical computer science; Algorithm","score_opus":0.04680536913484907,"score_gpt":0.24967884068656124,"score_spread":0.20287347155171218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395596657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14791864,0.0015342181,0.8118414,0.0024931272,0.00027089493,0.0002689204,0.0019699882,0.0015232204,0.032179516],"genre_scores_gemma":[0.84957993,0.0011294269,0.13577023,0.0005268311,0.0003536997,0.00069393567,0.0025774727,0.0006734032,0.008695088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932575,0.0009935761,0.00055125967,0.001450667,0.0025594807,0.0011874415],"domain_scores_gemma":[0.95823485,0.032162838,0.0016451897,0.0045547346,0.0022235122,0.0011789675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003250771,0.0015379076,0.0016411375,0.0019858086,0.0018474769,0.0058026393,0.00412884,0.0017295083,0.013888247],"category_scores_gemma":[0.027160892,0.0010535462,0.0028704458,0.0018946409,0.003752393,0.018100858,0.004365987,0.007750353,0.0018853068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003866084,0.00029831094,0.0026602354,0.0004682892,0.000098819044,0.00021612467,0.00091530714,0.07368003,0.014883505,0.8610468,0.0044724904,0.04087351],"study_design_scores_gemma":[0.00002241112,0.00006514577,0.00044209202,0.00003529108,0.000055885834,0.00011744346,0.000083066196,0.22395302,0.006725053,0.765282,0.0031834543,0.000035201265],"about_ca_topic_score_codex":0.0028233405,"about_ca_topic_score_gemma":0.0028854308,"teacher_disagreement_score":0.013888247,"about_ca_system_score_codex":0.004447362,"about_ca_system_score_gemma":0.002611753,"threshold_uncertainty_score":0.046460807},"labels":[],"label_agreement":null},{"id":"W2396102698","doi":"","title":"Utility And Expandabilty Of Channel Assignments.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Channel (broadcasting); Mathematics; Computer science; Telecommunications","score_opus":0.011071127851217293,"score_gpt":0.2243109670607269,"score_spread":0.2132398392095096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396102698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2074977,0.0018926538,0.6133688,0.0047910362,0.00038715202,0.00015041091,0.0016146518,0.0010033463,0.16929428],"genre_scores_gemma":[0.9548166,0.00054715655,0.027869903,0.0003663255,0.00031667502,0.00015749047,0.0004269863,0.00017914045,0.015319775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955954,0.0018360454,0.0002918853,0.0008740012,0.00078912074,0.0006136063],"domain_scores_gemma":[0.97182894,0.02225682,0.0010565316,0.0021816583,0.0015801756,0.001095753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037676594,0.0006324259,0.00080135744,0.00206841,0.0018522984,0.0045545157,0.0014560318,0.0012529739,0.012590935],"category_scores_gemma":[0.024456935,0.00070957805,0.0013219827,0.0016394453,0.0060810572,0.0113782715,0.0032124354,0.0030409966,0.0014507594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006404158,0.000029853703,0.0002718666,0.00004787106,0.000013739731,0.00008864504,0.00031263524,0.0022908913,0.00073139666,0.9874182,0.0012325956,0.0074982597],"study_design_scores_gemma":[0.000013703195,0.000014571458,0.00015793814,0.000019431676,0.000015271995,0.00011655449,0.00007547582,0.0087880995,0.00070708204,0.98793334,0.002144255,0.00001421942],"about_ca_topic_score_codex":0.00145847,"about_ca_topic_score_gemma":0.0014801007,"teacher_disagreement_score":0.012590935,"about_ca_system_score_codex":0.0017320943,"about_ca_system_score_gemma":0.0011923948,"threshold_uncertainty_score":0.042120934},"labels":[],"label_agreement":null},{"id":"W2397866482","doi":"10.1016/j.tcs.2016.05.018","title":"State complexity of prefix distance","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Substring; Suffix; Generalized suffix tree; Prefix; Combinatorics; Regular language; Mathematics; Deterministic finite automaton; Nondeterministic algorithm; Nondeterministic finite automaton; Discrete mathematics; State (computer science); Suffix tree; Set (abstract data type); Finite-state machine; Automaton; Computer science; Algorithm; Theoretical computer science; Automata theory","score_opus":0.016784463291252882,"score_gpt":0.24484974529758166,"score_spread":0.22806528200632878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397866482","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72300076,0.00091137725,0.23085961,0.005316833,0.00012363297,0.000095296025,0.0016899448,0.00050724286,0.037495323],"genre_scores_gemma":[0.982771,0.00033673708,0.009901714,0.00015711701,0.00015028744,0.00010589997,0.00066725624,0.000110133464,0.005799839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610907,0.0010137623,0.00027842302,0.00080565567,0.0011200744,0.00067290245],"domain_scores_gemma":[0.95981735,0.03243057,0.0016850152,0.0029373835,0.0017052923,0.001424361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023690804,0.0005519718,0.0018503212,0.001942572,0.0020278126,0.007423308,0.0028300202,0.002711565,0.015405649],"category_scores_gemma":[0.023922447,0.0007602858,0.0014212014,0.002983263,0.0039219256,0.018130975,0.0047612675,0.004204904,0.00094354595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022345629,0.00006374798,0.0012069419,0.00009478822,0.000023748977,0.00007931522,0.00045726763,0.018713556,0.0009347717,0.9687353,0.001237398,0.008229746],"study_design_scores_gemma":[0.000022249978,0.00002147612,0.0002750375,0.000009929893,0.000015678586,0.000044358545,0.000060995335,0.062428165,0.000560836,0.93609935,0.00044455167,0.000017310827],"about_ca_topic_score_codex":0.0019447865,"about_ca_topic_score_gemma":0.0013925876,"teacher_disagreement_score":0.015405649,"about_ca_system_score_codex":0.003360262,"about_ca_system_score_gemma":0.0021780967,"threshold_uncertainty_score":0.051537037},"labels":[],"label_agreement":null},{"id":"W2398698927","doi":"","title":"L-Presheaves and Their Stalks.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.009951069302425022,"score_gpt":0.21683104187285565,"score_spread":0.20687997257043061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398698927","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2185002,0.011813853,0.35268405,0.004068028,0.0009268211,0.00012824415,0.0017925248,0.0013724517,0.4087138],"genre_scores_gemma":[0.89080185,0.001691968,0.039098058,0.00062397926,0.0003418141,0.00014286814,0.00057624147,0.00016151562,0.06656167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993919,0.00015741662,0.000054175274,0.00012676485,0.0001658894,0.00010388086],"domain_scores_gemma":[0.9988961,0.0004885453,0.00013172983,0.00013191841,0.00019259805,0.00015909545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056907715,0.000457715,0.00040577954,0.0017678012,0.001580049,0.0032218364,0.0005640002,0.0007739972,0.009740344],"category_scores_gemma":[0.0021358572,0.0004950586,0.0006282503,0.0009796792,0.0027202878,0.0044858754,0.0019183069,0.0016737125,0.0031567044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019971452,0.000009979837,0.00016625943,0.000030392916,0.000006966638,0.000117343036,0.0004076339,0.00024733515,0.00058715127,0.991891,0.0012398583,0.005276143],"study_design_scores_gemma":[0.0000074805403,0.000012599316,0.00020939109,0.000025065576,0.0000070154383,0.00018782122,0.00020436448,0.0013962241,0.00061579567,0.98025995,0.017062237,0.000012075255],"about_ca_topic_score_codex":0.00089967396,"about_ca_topic_score_gemma":0.001159765,"teacher_disagreement_score":0.009740344,"about_ca_system_score_codex":0.0010250098,"about_ca_system_score_gemma":0.00053511735,"threshold_uncertainty_score":0.032584727},"labels":[],"label_agreement":null},{"id":"W2399095305","doi":"","title":"A combinatorial proof of a general two-term recurrence.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Term (time); Mathematics; Combinatorial proof; Combinatorics; Physics; Astronomy","score_opus":0.020140550437565602,"score_gpt":0.26238613102318215,"score_spread":0.24224558058561654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399095305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036720257,0.002173238,0.675425,0.008233437,0.0028694333,0.00020257327,0.0013148604,0.001733344,0.27132794],"genre_scores_gemma":[0.7493874,0.0014915543,0.17115587,0.00491696,0.00209819,0.00046578885,0.001415877,0.00090179086,0.06816658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989373,0.00026381412,0.0000859668,0.00026886348,0.00030804044,0.00013602566],"domain_scores_gemma":[0.9972907,0.0015836988,0.00016485812,0.0004221024,0.00037932378,0.00015920462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001198472,0.0008311424,0.00079832436,0.001046451,0.002070866,0.0026047742,0.0021495423,0.0015744299,0.02416209],"category_scores_gemma":[0.005738272,0.00064705097,0.0023066357,0.0014280465,0.0030803736,0.0056174733,0.0032853012,0.0036406487,0.004298994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020666423,0.000023274939,0.00009864694,0.00009984774,0.000013047793,0.00032582082,0.00018005105,0.00057937566,0.0010192078,0.9852483,0.0063482895,0.0060435524],"study_design_scores_gemma":[0.000022288767,0.000014268321,0.00014802186,0.00003299021,0.000024194414,0.00040075215,0.000054281805,0.0034086728,0.0008256359,0.98010856,0.014939354,0.000020981497],"about_ca_topic_score_codex":0.0013988802,"about_ca_topic_score_gemma":0.0019849355,"teacher_disagreement_score":0.02416209,"about_ca_system_score_codex":0.001559901,"about_ca_system_score_gemma":0.0009234753,"threshold_uncertainty_score":0.08083022},"labels":[],"label_agreement":null},{"id":"W2399262470","doi":"10.48550/arxiv.1012.3962","title":"Quotient Complexity of Star-Free Languages","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quotient; Concatenation (mathematics); Mathematics; Regular language; Discrete mathematics; Star (game theory); Combinatorics; Intersection (aeronautics); Computer science; Theoretical computer science; Automaton","score_opus":0.06936346238571205,"score_gpt":0.19577833256891503,"score_spread":0.12641487018320297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399262470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79225206,0.0005567757,0.17922603,0.001224461,0.00006064323,0.00012069896,0.0010657078,0.00055552827,0.02493818],"genre_scores_gemma":[0.9787507,0.00021508962,0.015551957,0.000107058986,0.000081088736,0.00011164598,0.0007589151,0.0001202665,0.004303239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708503,0.0004567872,0.00033105447,0.00063957454,0.0010143018,0.00047335023],"domain_scores_gemma":[0.98647565,0.009009345,0.00078610104,0.0013302555,0.001441267,0.0009573123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014026626,0.00047493892,0.00090633985,0.0013604091,0.0011746236,0.0039709457,0.0011614818,0.00066762266,0.007040526],"category_scores_gemma":[0.011453168,0.00044079762,0.0014415352,0.0009385886,0.0033276805,0.0094288,0.0031488244,0.0020328397,0.0005964709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044293344,0.00008472782,0.0038347172,0.00019892107,0.000043353055,0.0002854488,0.0017054593,0.026259137,0.010753721,0.9378016,0.001723198,0.016866876],"study_design_scores_gemma":[0.000023746514,0.000042659954,0.0008633696,0.000013356574,0.000023242064,0.00016557207,0.00012762246,0.07615769,0.0051980256,0.9152205,0.002134735,0.000029493098],"about_ca_topic_score_codex":0.0017178286,"about_ca_topic_score_gemma":0.001136779,"teacher_disagreement_score":0.007040526,"about_ca_system_score_codex":0.0028461937,"about_ca_system_score_gemma":0.0014009519,"threshold_uncertainty_score":0.023552895},"labels":[],"label_agreement":null},{"id":"W2399517370","doi":"","title":"Completely Regular Endomorphisms of Split Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Endomorphism; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.010185618288861076,"score_gpt":0.20782741922918171,"score_spread":0.19764180094032063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399517370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5214669,0.0019091452,0.30415323,0.0014040784,0.0005932632,0.00007739364,0.00079787313,0.0009497554,0.16864824],"genre_scores_gemma":[0.9578851,0.0002797267,0.018507719,0.00024874613,0.00015371395,0.000046212186,0.00029286603,0.00011140031,0.022474498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992848,0.00018490381,0.000048737205,0.00018014194,0.00019332807,0.00010814801],"domain_scores_gemma":[0.9985152,0.0006067437,0.00018685928,0.0002881492,0.00020907,0.0001939739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006345602,0.00031015126,0.00034911727,0.0008143123,0.00087823864,0.00186417,0.0004344998,0.00047767806,0.005035497],"category_scores_gemma":[0.0017186963,0.00031002058,0.00056618126,0.00047393018,0.0020483881,0.0032835042,0.0013903421,0.0010050213,0.0010109787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037020705,0.000015324817,0.00024371946,0.00002081795,0.000006339871,0.00012136491,0.0002806264,0.0003244986,0.0020952977,0.9901343,0.0009796642,0.005741077],"study_design_scores_gemma":[0.000014140443,0.000021200978,0.00029852343,0.000012984196,0.000008348329,0.00026816566,0.0001782434,0.0022939646,0.0016909182,0.9875168,0.0076868352,0.000009817093],"about_ca_topic_score_codex":0.0002606751,"about_ca_topic_score_gemma":0.00041665632,"teacher_disagreement_score":0.005035497,"about_ca_system_score_codex":0.0005777932,"about_ca_system_score_gemma":0.00035310586,"threshold_uncertainty_score":0.016845405},"labels":[],"label_agreement":null},{"id":"W2399743505","doi":"","title":"Channel Synthesis for Finite Transducers","year":2011,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Transducer; Computer science; Channel (broadcasting); Electronic engineering; Electrical engineering; Telecommunications; Engineering","score_opus":0.022896982740763527,"score_gpt":0.2194862854777149,"score_spread":0.19658930273695138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399743505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015518725,0.00084999675,0.9550727,0.0006578327,0.0002976159,0.00005360185,0.00016843095,0.0017284921,0.025652606],"genre_scores_gemma":[0.81904227,0.0012396422,0.14886172,0.000396461,0.00040457287,0.00027326852,0.0005251589,0.0006568698,0.028600095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990357,0.00023434935,0.000052360472,0.00031009316,0.00024668992,0.00012082107],"domain_scores_gemma":[0.99716836,0.0021029897,0.0000777756,0.00031025562,0.00025010944,0.00009053915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007620491,0.000546244,0.0008984584,0.0006221256,0.00071863114,0.001994146,0.00059108774,0.0010284187,0.013780809],"category_scores_gemma":[0.0032057227,0.00042434788,0.00086095766,0.0005501696,0.0015548496,0.0023503823,0.0015045702,0.0016765543,0.002009291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022749788,0.000071361676,0.00020964662,0.00039671376,0.000040091552,0.00015825545,0.0002922977,0.04900198,0.019832049,0.852691,0.005418467,0.07166066],"study_design_scores_gemma":[0.000058961938,0.000093523966,0.00010675152,0.00009708376,0.000041681284,0.00011415407,0.00007169877,0.21659958,0.021788122,0.7410495,0.01993949,0.00003942927],"about_ca_topic_score_codex":0.0007415105,"about_ca_topic_score_gemma":0.00081218896,"teacher_disagreement_score":0.013780809,"about_ca_system_score_codex":0.0013605835,"about_ca_system_score_gemma":0.0011418517,"threshold_uncertainty_score":0.04610139},"labels":[],"label_agreement":null},{"id":"W2400176033","doi":"10.1016/s0304-3975(04)00143-4","title":"On the number of nonterminals in linear conjunctive grammars*1","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Terminal and nonterminal symbols; Indexed grammar; Mathematics; Context-sensitive grammar; Disjoint sets; Discrete mathematics; Combinatorics; Rule-based machine translation; Computer science; Context-free grammar; Natural language processing","score_opus":0.009711916773719308,"score_gpt":0.2632984173633767,"score_spread":0.2535865005896574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400176033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37157452,0.003458792,0.52832365,0.012964813,0.0011361088,0.00018601175,0.0016071025,0.0014608962,0.07928811],"genre_scores_gemma":[0.8596938,0.0017819051,0.11399075,0.0010832995,0.001278566,0.00041347506,0.0012350704,0.0010172917,0.019505829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991028,0.003866445,0.0006565983,0.0018049318,0.0016395331,0.0010044506],"domain_scores_gemma":[0.75639486,0.22417496,0.0049701184,0.0070598577,0.0035449564,0.0038552484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009187085,0.0015327964,0.0035387606,0.0029378291,0.0045933686,0.0070840647,0.005501327,0.0051570265,0.01470914],"category_scores_gemma":[0.06065893,0.0026202756,0.0021526918,0.0033871797,0.009776243,0.031302676,0.0049144356,0.0072151856,0.0017523167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007605657,0.00016613114,0.0037453943,0.00042809738,0.000053589418,0.0004274029,0.001063822,0.032209486,0.0031898364,0.92847127,0.005357639,0.024126677],"study_design_scores_gemma":[0.000048860682,0.00005561582,0.0005288649,0.000057387108,0.000044608983,0.00023661024,0.00014188013,0.06467699,0.0013871494,0.93088996,0.0018954976,0.000036539233],"about_ca_topic_score_codex":0.0012900432,"about_ca_topic_score_gemma":0.0016149922,"teacher_disagreement_score":0.01470914,"about_ca_system_score_codex":0.0032589561,"about_ca_system_score_gemma":0.0017446887,"threshold_uncertainty_score":0.049206972},"labels":[],"label_agreement":null},{"id":"W2400282024","doi":"","title":"Enumeration Of Non-Isomorphic Semigraphs In Γ 4 .","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Mathematics; Combinatorics","score_opus":0.013960530520867834,"score_gpt":0.23514324594318844,"score_spread":0.2211827154223206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400282024","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4923556,0.0005782663,0.33989003,0.0013122815,0.0002950332,0.00018491024,0.0022535424,0.001417658,0.16171269],"genre_scores_gemma":[0.8565359,0.0003006065,0.084270395,0.00027133536,0.00006462401,0.00017852521,0.002492194,0.00031602354,0.055570345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931765,0.00021640846,0.00006649618,0.00013237367,0.0001516352,0.00011541641],"domain_scores_gemma":[0.9973231,0.0013950785,0.00021474545,0.00043800133,0.00042139576,0.00020783833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005447525,0.00044305413,0.00043169118,0.0013868298,0.0014685958,0.0022870437,0.0008856715,0.0008427575,0.016282722],"category_scores_gemma":[0.0026104404,0.00046679712,0.00073920516,0.0012165642,0.0010881843,0.00355084,0.001943677,0.0011743809,0.0025535915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019975896,0.000093753166,0.0020380875,0.00018124869,0.000030746447,0.00046258452,0.0011373422,0.0018940297,0.007276695,0.9529264,0.004599182,0.02916021],"study_design_scores_gemma":[0.000016839029,0.000024396468,0.00087871734,0.000055627206,0.000027202086,0.00039598718,0.00057818735,0.0063293115,0.005538022,0.9723613,0.013777862,0.000016543881],"about_ca_topic_score_codex":0.0010173154,"about_ca_topic_score_gemma":0.0022516833,"teacher_disagreement_score":0.016282722,"about_ca_system_score_codex":0.0008594467,"about_ca_system_score_gemma":0.00066647393,"threshold_uncertainty_score":0.054471076},"labels":[],"label_agreement":null},{"id":"W2401586919","doi":"","title":"Restricted sets of trajectories and decidability of shuffle decompositions.","year":2004,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Acadia University","funders":"","keywords":"Decidability; Unary operation; Mathematics; Regular language; Context (archaeology); Set (abstract data type); Discrete mathematics; Combinatorics; Automaton; Computer science; Theoretical computer science; Programming language","score_opus":0.008540758322706883,"score_gpt":0.23902659181847943,"score_spread":0.23048583349577256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401586919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34553754,0.00080944394,0.6336351,0.0017006994,0.000093645,0.00022602003,0.001240399,0.0013054517,0.01545181],"genre_scores_gemma":[0.9126367,0.00045887902,0.0753289,0.0002880289,0.000085907115,0.0003167626,0.002234672,0.000207653,0.008442348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971494,0.0004820912,0.0002863499,0.0009785515,0.00063038175,0.00047330448],"domain_scores_gemma":[0.9857706,0.009794872,0.0010245953,0.0019738246,0.00070233253,0.0007337359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027271293,0.0005623078,0.0006924489,0.0012422813,0.0017517621,0.0035145497,0.0019118068,0.0013929026,0.0041126567],"category_scores_gemma":[0.011032841,0.00084857794,0.0026186933,0.00091301644,0.0041955286,0.010848648,0.0031741688,0.0045040078,0.00046291546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023515629,0.00016450988,0.0029454771,0.00019331957,0.00007556524,0.00051087525,0.0013301602,0.025761392,0.007590591,0.93784994,0.0014035471,0.021939505],"study_design_scores_gemma":[0.00003828153,0.000042709067,0.0004143666,0.000042934327,0.000031069227,0.0002320302,0.00032463841,0.057615116,0.009470557,0.9283595,0.003400602,0.000028216644],"about_ca_topic_score_codex":0.0026670143,"about_ca_topic_score_gemma":0.0022407135,"teacher_disagreement_score":0.0041126567,"about_ca_system_score_codex":0.0023631172,"about_ca_system_score_gemma":0.0016206431,"threshold_uncertainty_score":0.017145693},"labels":[],"label_agreement":null},{"id":"W2401899815","doi":"","title":"A characterization of the arithmetical hierarchy by language equations.","year":2004,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Peano axioms; Arithmetic function; Mathematics; Concatenation (mathematics); Hierarchy; Expressive power; Class (philosophy); Axiom; Second-order arithmetic; Property (philosophy); Characterization (materials science); Analytical hierarchy; Discrete mathematics; Algebra over a field; Arithmetic; Pure mathematics; Computer science; Theoretical computer science; Analytic hierarchy process; Mathematical economics","score_opus":0.00519566250757594,"score_gpt":0.21013662021198726,"score_spread":0.20494095770441131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401899815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21397305,0.0028065806,0.70588803,0.0027385768,0.00023514341,0.00018268646,0.0015224491,0.0006128408,0.072040714],"genre_scores_gemma":[0.81820744,0.0010372818,0.16867423,0.0006030189,0.000371317,0.00020412455,0.0012373598,0.000110688656,0.009554544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899656,0.00021979,0.00007459722,0.00022443468,0.00032583938,0.00015887839],"domain_scores_gemma":[0.99772984,0.001315039,0.00023502672,0.00022180441,0.00033837653,0.00015995867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009746389,0.0004032193,0.00046299447,0.0015007277,0.00083654135,0.002500985,0.0008679599,0.0007810363,0.0034403577],"category_scores_gemma":[0.004703068,0.0003818097,0.00086002296,0.0013066137,0.0026128662,0.004756816,0.0018199647,0.002488592,0.000531494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018398177,0.000013943837,0.00032728887,0.000049015558,0.000006860763,0.00007440505,0.00038978487,0.0015175134,0.002445764,0.9872103,0.0010176974,0.006929122],"study_design_scores_gemma":[0.0000155586,0.000024541858,0.00044519294,0.000042120784,0.000014047099,0.00025697987,0.00012186507,0.028301815,0.0013860062,0.95932287,0.010049422,0.000019607272],"about_ca_topic_score_codex":0.0012189774,"about_ca_topic_score_gemma":0.0010971637,"teacher_disagreement_score":0.0034403577,"about_ca_system_score_codex":0.0014298204,"about_ca_system_score_gemma":0.0008002871,"threshold_uncertainty_score":0.01150912},"labels":[],"label_agreement":null},{"id":"W2402226617","doi":"10.25596/jalc-2014-157","title":"Generating the Pseudo-Powers of a Word","year":2014,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; Word (group theory); Abelian group; Computer science; Closure (psychology); Power (physics); Connection (principal bundle); Arithmetic; Mathematics; Pure mathematics; Physics; Geometry","score_opus":0.008362743079370773,"score_gpt":0.19823471050112798,"score_spread":0.18987196742175722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402226617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6094183,0.0004508177,0.32488495,0.0006373903,0.0003165151,0.00010858905,0.00014589613,0.00055046397,0.063487075],"genre_scores_gemma":[0.9500117,0.00019249709,0.038655262,0.00015222703,0.00013919789,0.00010883016,0.000094914576,0.00020828393,0.010437169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870133,0.00038307902,0.00011000977,0.00034688402,0.00031234676,0.00014622793],"domain_scores_gemma":[0.99684405,0.0014496123,0.00028870613,0.0007302228,0.00043657332,0.00025076573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012659988,0.00034335238,0.00041071308,0.00094365247,0.0012125833,0.0018504726,0.0005524839,0.00046292561,0.0042959885],"category_scores_gemma":[0.0039740982,0.00034554233,0.0008361147,0.00037102116,0.0037913262,0.0051617455,0.0023419287,0.00084233965,0.0008667599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008062388,0.000023022048,0.00061979017,0.000065898814,0.000012280123,0.00045410078,0.0014151412,0.00080969825,0.017460477,0.9660274,0.0003930316,0.0126385605],"study_design_scores_gemma":[0.000029645988,0.00015504379,0.0006481016,0.00004616099,0.000029330407,0.0009928071,0.00079181755,0.011011992,0.023664108,0.94463456,0.017942876,0.00005358201],"about_ca_topic_score_codex":0.00012845437,"about_ca_topic_score_gemma":0.00013517348,"teacher_disagreement_score":0.0042959885,"about_ca_system_score_codex":0.00042641553,"about_ca_system_score_gemma":0.00039874035,"threshold_uncertainty_score":0.014371455},"labels":[],"label_agreement":null},{"id":"W2402378065","doi":"","title":"Maximum Genus Embeddings and Genus Embeddings on Orientable Surfaces.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Genus; Mathematics; Combinatorics; Pure mathematics; Zoology; Biology","score_opus":0.007546579958146799,"score_gpt":0.21685188654742626,"score_spread":0.20930530658927946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402378065","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59562016,0.0045592794,0.16323404,0.0028287498,0.00085921725,0.000059917165,0.00051171216,0.0008119284,0.23151492],"genre_scores_gemma":[0.96823186,0.0009519548,0.013414917,0.00022757666,0.00030408605,0.00005036964,0.0002398175,0.00013894193,0.016440546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947196,0.000108344706,0.00003438523,0.0001274169,0.00013996159,0.000117885655],"domain_scores_gemma":[0.9984366,0.0007856079,0.00022287108,0.00021311617,0.00012542728,0.00021621768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041517307,0.00056502037,0.00049772894,0.001664391,0.0015076747,0.0028560627,0.0007447047,0.0011467929,0.008807212],"category_scores_gemma":[0.0031884962,0.00048046137,0.00059423863,0.0009009083,0.002717937,0.005742044,0.0032332067,0.0017035868,0.0012805016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047975904,0.000016626662,0.00043427543,0.000050610113,0.0000054554193,0.00016223184,0.0003486231,0.00093300437,0.0015786819,0.98487234,0.001856693,0.0096934335],"study_design_scores_gemma":[0.000009442924,0.000011754018,0.00034929614,0.000022125252,0.0000069790235,0.00019250388,0.00022971444,0.0023645842,0.0007437206,0.99182725,0.0042336867,0.000008980793],"about_ca_topic_score_codex":0.0003077372,"about_ca_topic_score_gemma":0.00048198635,"teacher_disagreement_score":0.008807212,"about_ca_system_score_codex":0.000723072,"about_ca_system_score_gemma":0.00019068367,"threshold_uncertainty_score":0.029463053},"labels":[],"label_agreement":null},{"id":"W2402411904","doi":"","title":"On the Number of Distinct Squares.","year":2014,"lang":"en","type":"article","venue":"Prague Stringology Conference","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Least-squares function approximation; Computer science; Mathematics; Statistics","score_opus":0.0176302303259467,"score_gpt":0.2506568914963618,"score_spread":0.23302666117041507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402411904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19045964,0.0104534505,0.47336355,0.022646379,0.0040582633,0.0001682477,0.0019984264,0.00078972575,0.29606226],"genre_scores_gemma":[0.8442238,0.0034934129,0.10061046,0.0021210313,0.002379182,0.00035823075,0.0008551389,0.000589976,0.045368675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931625,0.0024300872,0.0005440464,0.001934544,0.0011794724,0.00074944133],"domain_scores_gemma":[0.93572885,0.049461752,0.002496088,0.0057427166,0.0036070293,0.0029635604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00600151,0.00089191884,0.0021441174,0.004131327,0.0048867827,0.0077320477,0.00339975,0.003709647,0.021022525],"category_scores_gemma":[0.05780078,0.0015020553,0.0013470446,0.0030011681,0.011215752,0.024923317,0.006698439,0.007863427,0.0038181504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011970209,0.000019069626,0.00071073667,0.00007604209,0.000016932288,0.00006336805,0.00020717531,0.0010883649,0.00040775537,0.98287994,0.0037747317,0.010636058],"study_design_scores_gemma":[0.000012162879,0.000012551508,0.0002526954,0.00003500089,0.000011539791,0.00012279913,0.00007894142,0.0029894214,0.00026639402,0.99287075,0.003333807,0.000013919287],"about_ca_topic_score_codex":0.0009560014,"about_ca_topic_score_gemma":0.0011428996,"teacher_disagreement_score":0.021022525,"about_ca_system_score_codex":0.0024092612,"about_ca_system_score_gemma":0.0012973968,"threshold_uncertainty_score":0.07032734},"labels":[],"label_agreement":null},{"id":"W2402414534","doi":"10.1007/s00224-017-9817-2","title":"The Algebraic Theory of Parikh Automata","year":2017,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Unary operation; Automaton; Regular language; Affine transformation; Closure (psychology); Mathematics; Discrete mathematics; Algebraic theory; Automata theory; Set (abstract data type); Quantum finite automata; Algebraic number; Algebra over a field; Computer science; Pure mathematics; Theoretical computer science; Programming language","score_opus":0.021471962263549357,"score_gpt":0.2563282494109741,"score_spread":0.23485628714742474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402414534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06381039,0.009231018,0.70322764,0.008164525,0.0014356817,0.00009384118,0.00061819283,0.0006821608,0.21273659],"genre_scores_gemma":[0.8853626,0.005049791,0.07387745,0.001300158,0.002598147,0.00024472023,0.0005002572,0.00020105061,0.03086577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789006,0.0006694697,0.00013899602,0.00046913238,0.00062486203,0.00020756497],"domain_scores_gemma":[0.996754,0.0018151596,0.0002097954,0.0005639148,0.00046187505,0.00019522938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017499377,0.0007751084,0.0014753325,0.0022499368,0.0031703855,0.0062777237,0.001819188,0.0015689826,0.008035589],"category_scores_gemma":[0.0053801388,0.0007637328,0.0016744694,0.0027832561,0.009452407,0.015851282,0.00328969,0.0047545005,0.0020119862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005467446,0.0000033955073,0.000020279609,0.000017534698,0.00000192062,0.0000100967445,0.000072798124,0.00024782008,0.00006601572,0.99795014,0.00032574186,0.0012786336],"study_design_scores_gemma":[0.0000038339067,0.0000034542743,0.0000129222935,0.00000459292,0.0000018629331,0.000015631178,0.000015609607,0.00094296347,0.000056058543,0.9963875,0.0025524292,0.000003100357],"about_ca_topic_score_codex":0.0011642211,"about_ca_topic_score_gemma":0.00058271637,"teacher_disagreement_score":0.008035589,"about_ca_system_score_codex":0.00284922,"about_ca_system_score_gemma":0.0013764205,"threshold_uncertainty_score":0.026881754},"labels":[],"label_agreement":null},{"id":"W2402441013","doi":"","title":"On the Recursive Sequence Order-k.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sequence (biology); Order (exchange); Combinatorics; Applied mathematics; Pure mathematics; Biology","score_opus":0.02118355980526211,"score_gpt":0.24788299946190995,"score_spread":0.22669943965664785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402441013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09872447,0.010317493,0.4955489,0.00658835,0.001648148,0.0000830451,0.0010572318,0.0013820742,0.38465035],"genre_scores_gemma":[0.8117593,0.0045885155,0.09239398,0.002336948,0.0012147616,0.00014527145,0.0008749775,0.0006825011,0.086003624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988871,0.0003389506,0.00008650856,0.00025983658,0.00025582872,0.00017184406],"domain_scores_gemma":[0.9969182,0.0018563968,0.00015775255,0.00050869904,0.00037651756,0.00018253531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012245091,0.00054233696,0.0007445006,0.0015472539,0.0021575473,0.0032411814,0.0007990089,0.0011807143,0.010730125],"category_scores_gemma":[0.004958945,0.0005350543,0.0009113259,0.0015748243,0.004965144,0.011561898,0.002314285,0.0028035466,0.003621625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019737436,0.000007400141,0.00013373005,0.000030190457,0.0000035036592,0.000064736676,0.00021646169,0.00041291423,0.00025030642,0.9907817,0.002043636,0.0060356217],"study_design_scores_gemma":[0.00000461059,0.0000064563606,0.00009736321,0.000015041782,0.0000036439599,0.00007604765,0.000045266097,0.0011834534,0.00018542327,0.99055815,0.007816613,0.000007836821],"about_ca_topic_score_codex":0.0022856712,"about_ca_topic_score_gemma":0.0033750276,"teacher_disagreement_score":0.010730125,"about_ca_system_score_codex":0.0017963868,"about_ca_system_score_gemma":0.0009506992,"threshold_uncertainty_score":0.035895824},"labels":[],"label_agreement":null},{"id":"W2402862338","doi":"","title":"Endomorphism monoids of generalized split graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Endomorphism; Pure mathematics; Combinatorics; Algebra over a field","score_opus":0.008809712647425761,"score_gpt":0.20874445760834834,"score_spread":0.1999347449609226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402862338","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47373486,0.0029475824,0.30824664,0.0020387694,0.00087488536,0.00015431271,0.0014239863,0.0011553549,0.20942357],"genre_scores_gemma":[0.9293207,0.00055472605,0.030980468,0.00049057923,0.0002239922,0.000110044144,0.00056599785,0.00014811971,0.037605353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993894,0.00014059279,0.000053858017,0.00015917918,0.00016333038,0.00009357161],"domain_scores_gemma":[0.99879175,0.00042134314,0.00014772885,0.00023298664,0.0002189256,0.00018724949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006035051,0.00034660767,0.00039419308,0.0012950031,0.001162215,0.0023058436,0.0005861829,0.0005701475,0.006403117],"category_scores_gemma":[0.001301486,0.00034235057,0.00062750676,0.0006855897,0.0018771216,0.004065633,0.00196903,0.0011999352,0.0012563086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035044104,0.000018756647,0.00028641458,0.000026984497,0.000007937491,0.00015681388,0.00034081456,0.00024197619,0.0018605352,0.98864985,0.0010889303,0.0072858147],"study_design_scores_gemma":[0.000014906234,0.00002406957,0.00045345968,0.000022290562,0.000015518726,0.000349975,0.00026815658,0.0018951523,0.0017448582,0.98084015,0.014358152,0.0000133771755],"about_ca_topic_score_codex":0.0004856574,"about_ca_topic_score_gemma":0.0006975855,"teacher_disagreement_score":0.006403117,"about_ca_system_score_codex":0.00077742373,"about_ca_system_score_gemma":0.0005015774,"threshold_uncertainty_score":0.021420538},"labels":[],"label_agreement":null},{"id":"W2403784750","doi":"","title":"Transition Complexity of Language Operations.","year":2006,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Manitoba","funders":"","keywords":"Nondeterministic finite automaton; Nondeterministic algorithm; Regular language; Computer science; Deterministic finite automaton; State (computer science); Regular expression; Finite-state machine; Automaton; Mathematics; Theoretical computer science; Programming language; Automata theory","score_opus":0.013856491255630364,"score_gpt":0.233511927603605,"score_spread":0.21965543634797463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403784750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44793376,0.001342922,0.5181642,0.0021987264,0.00020915896,0.0003571822,0.0021878332,0.0008750176,0.02673121],"genre_scores_gemma":[0.9330035,0.00050738576,0.06043847,0.00018093866,0.00013919485,0.000323827,0.0011471278,0.0002127794,0.0040469496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919234,0.0020158216,0.0008494525,0.0017377734,0.0026688317,0.00080471655],"domain_scores_gemma":[0.90485424,0.077086195,0.005290869,0.0073790224,0.0033083796,0.0020812494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038899896,0.00062239985,0.0010026753,0.001520376,0.0012122823,0.0045003043,0.0017783771,0.0013161283,0.009074363],"category_scores_gemma":[0.043813873,0.00057383784,0.0023005854,0.0014793617,0.00321059,0.013181847,0.0025293722,0.0029304605,0.0006909664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063539454,0.00024100486,0.008566965,0.000575543,0.00018285091,0.00029829048,0.0010159439,0.0914923,0.0118929595,0.8281242,0.0018959466,0.05507852],"study_design_scores_gemma":[0.00004899038,0.00020787607,0.0027276734,0.000041876207,0.0000871505,0.00050927483,0.00028870744,0.19258286,0.010348599,0.78876203,0.0043176566,0.000077333694],"about_ca_topic_score_codex":0.0011447874,"about_ca_topic_score_gemma":0.0010471193,"teacher_disagreement_score":0.009074363,"about_ca_system_score_codex":0.0026753498,"about_ca_system_score_gemma":0.0016646516,"threshold_uncertainty_score":0.030356765},"labels":[],"label_agreement":null},{"id":"W2404371155","doi":"","title":"Some new monoid and group constructions under semidirect products.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Monoid; Group (periodic table); Semidirect product; Algebra over a field; Pure mathematics; Chemistry; Organic chemistry","score_opus":0.009443995149665058,"score_gpt":0.21686068752378948,"score_spread":0.2074166923741244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404371155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13816516,0.017169584,0.496192,0.0055273604,0.0033167629,0.00022165409,0.0012021262,0.0013187346,0.3368866],"genre_scores_gemma":[0.7132093,0.0060140165,0.174363,0.0020579314,0.002133188,0.00041690626,0.001083929,0.00054599356,0.10017564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870825,0.0003804915,0.00013346423,0.00026912885,0.0003814492,0.00012724574],"domain_scores_gemma":[0.998755,0.0004902793,0.0001325244,0.00021553936,0.00019000431,0.00021671092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015475132,0.000656753,0.00063124497,0.0020874755,0.0020658623,0.0040305615,0.0009358846,0.0011713058,0.008946568],"category_scores_gemma":[0.0022645635,0.00067788933,0.001105198,0.0018651107,0.0034571143,0.008852944,0.003548526,0.0026867457,0.0023137159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023742854,0.000024310815,0.00012157112,0.000061547646,0.0000061311116,0.00015119991,0.0003581608,0.00017568107,0.0008402407,0.9873669,0.0022012724,0.008669154],"study_design_scores_gemma":[0.0000134618695,0.000031040334,0.00018321669,0.000030268355,0.000014557694,0.00054754666,0.00013838522,0.0011994331,0.0011500721,0.96505994,0.031610403,0.000021705322],"about_ca_topic_score_codex":0.00037996424,"about_ca_topic_score_gemma":0.00066440296,"teacher_disagreement_score":0.008946568,"about_ca_system_score_codex":0.0015123945,"about_ca_system_score_gemma":0.00062786805,"threshold_uncertainty_score":0.02992928},"labels":[],"label_agreement":null},{"id":"W2404648201","doi":"10.4169/amer.math.monthly.122.6.515","title":"Collapse: A Fibonacci and Sturmian Game","year":2015,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Fibonacci number; Fibonacci polynomials; Set (abstract data type); Mathematics; Pisano period; Combinatorics; Computer science","score_opus":0.015941436653906377,"score_gpt":0.24930249828228324,"score_spread":0.23336106162837686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404648201","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6934712,0.00086519076,0.22177398,0.001241864,0.00014199347,0.00008547339,0.00029541392,0.00026769433,0.08185723],"genre_scores_gemma":[0.9694426,0.00025802758,0.021063207,0.00016708885,0.00007135034,0.000060234932,0.00016389629,0.00005114872,0.008722462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993783,0.00015495434,0.00003967873,0.0001207542,0.00018575556,0.000120580095],"domain_scores_gemma":[0.9987036,0.0006530154,0.00013435345,0.00011567961,0.0001414375,0.00025180032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081597146,0.00033542063,0.0005794739,0.0012693452,0.0018419763,0.0027829185,0.0006089578,0.0008208417,0.0039218883],"category_scores_gemma":[0.0035673534,0.00026122268,0.0006370837,0.0009398162,0.0031671275,0.0033415996,0.0016033112,0.0009858533,0.00043262672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004844221,0.000012540561,0.0007099636,0.000024564468,0.000005456952,0.00014134542,0.00044285742,0.0018161206,0.0019812575,0.98902076,0.0006039932,0.0051927706],"study_design_scores_gemma":[0.000014664732,0.00004092472,0.0007801442,0.000017696584,0.000010659859,0.00031801296,0.00032202314,0.024140485,0.0012840005,0.96810514,0.0049447687,0.00002131379],"about_ca_topic_score_codex":0.0013886607,"about_ca_topic_score_gemma":0.0013255266,"teacher_disagreement_score":0.0039218883,"about_ca_system_score_codex":0.0010547367,"about_ca_system_score_gemma":0.0005458879,"threshold_uncertainty_score":0.013120055},"labels":[],"label_agreement":null},{"id":"W2404946359","doi":"","title":"Repetition Complexity of Words.","year":2002,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Repetition (rhetorical device); De Bruijn sequence; Word (group theory); Mathematics; Logarithm; Computational complexity theory; Iterated function; Time complexity; Complexity class; Combinatorics; Prefix; Discrete mathematics; Morphism; Combinatorics on words; Arithmetic; Algorithm","score_opus":0.048147448014609795,"score_gpt":0.23035284030705733,"score_spread":0.18220539229244753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404946359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15602732,0.004997267,0.78421265,0.0020933033,0.0005225553,0.00029468228,0.0019286182,0.0012660418,0.048657596],"genre_scores_gemma":[0.7221694,0.0023927188,0.24568944,0.0007287498,0.0009695027,0.0006893219,0.0021448417,0.00057834265,0.024637658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970271,0.0004171083,0.0003352133,0.00083253527,0.0010990766,0.00028906605],"domain_scores_gemma":[0.9921172,0.004663631,0.00080302526,0.0013190334,0.000796552,0.0003005363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009736133,0.0007602775,0.00082824804,0.003215726,0.0012248147,0.0034916424,0.0012804728,0.0010246206,0.007971077],"category_scores_gemma":[0.009430016,0.0005126499,0.001628452,0.002504958,0.0030163028,0.008953893,0.00266646,0.0021457064,0.001703303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012001646,0.00004036679,0.0012570819,0.00030233662,0.000035080604,0.00026173264,0.00074681954,0.013526393,0.0065166256,0.9223896,0.003129411,0.051674593],"study_design_scores_gemma":[0.000013477902,0.00006651566,0.0004950982,0.000043087235,0.000024597655,0.0005711109,0.00009651602,0.04071249,0.0042607225,0.9377522,0.01591971,0.00004441598],"about_ca_topic_score_codex":0.0010168134,"about_ca_topic_score_gemma":0.0008097513,"teacher_disagreement_score":0.007971077,"about_ca_system_score_codex":0.0018749196,"about_ca_system_score_gemma":0.00078179175,"threshold_uncertainty_score":0.026665926},"labels":[],"label_agreement":null},{"id":"W2405494927","doi":"","title":"Non-Uniqueness and Radius of Cyclic Unary NFAs.","year":2004,"lang":"es","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Acadia University","funders":"","keywords":"Unary operation; Nondeterministic algorithm; RADIUS; Mathematics; Uniqueness; Regular language; Diophantine equation; Class (philosophy); Combinatorics; Discrete mathematics; Computer science; Mathematical analysis; Theoretical computer science; Artificial intelligence; Automaton","score_opus":0.006565634247570317,"score_gpt":0.22898488601908956,"score_spread":0.22241925177151925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405494927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59034646,0.0019510874,0.3840559,0.0005193589,0.000065146516,0.00007906414,0.00019990194,0.00038788037,0.022395235],"genre_scores_gemma":[0.95667976,0.00023839032,0.03957583,0.00006193091,0.00003931248,0.000084786785,0.00008288876,0.00009551279,0.0031416502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978828,0.00052308996,0.0002091102,0.0007299304,0.0004707132,0.00018437482],"domain_scores_gemma":[0.9895191,0.0070564128,0.0013612993,0.00094473746,0.0007624743,0.00035597058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016912081,0.0002451221,0.0006579452,0.0008251455,0.0013402349,0.0015441644,0.000999396,0.0008062357,0.0027136728],"category_scores_gemma":[0.011714111,0.00041094155,0.0007849744,0.00041883643,0.0026472656,0.004075693,0.0013593226,0.0011376922,0.0005122806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017379518,0.000022241751,0.0039120056,0.00026158208,0.00003928803,0.0003976616,0.0014818837,0.008849423,0.029820316,0.9359272,0.00046764122,0.018646987],"study_design_scores_gemma":[0.000033299395,0.0001984746,0.0030003933,0.00006989462,0.00008477639,0.0025860174,0.0008035911,0.08016302,0.040308867,0.8594973,0.013164837,0.000089543675],"about_ca_topic_score_codex":0.00045602545,"about_ca_topic_score_gemma":0.00038008773,"teacher_disagreement_score":0.0027136728,"about_ca_system_score_codex":0.0008777485,"about_ca_system_score_gemma":0.00043606453,"threshold_uncertainty_score":0.009078145},"labels":[],"label_agreement":null},{"id":"W2406664471","doi":"","title":"Estimation of State Complexity of Combined Operations.","year":2008,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; State (computer science); Alphabet; Upper and lower bounds; Mathematics; Regular language; Computer science; Theoretical computer science; Algorithm; Discrete mathematics; Automaton; Linguistics","score_opus":0.03663116717581648,"score_gpt":0.2526408769094715,"score_spread":0.21600970973365502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406664471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28645977,0.0009931109,0.6981195,0.00033147325,0.000056554734,0.00017011828,0.0008696547,0.00051541626,0.012484315],"genre_scores_gemma":[0.9142921,0.00038971726,0.08175637,0.000033762895,0.00004185211,0.00020852782,0.001052022,0.00012122707,0.0021044102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979247,0.00032968572,0.00014328635,0.0005149461,0.0008264351,0.00026098252],"domain_scores_gemma":[0.97823685,0.016186288,0.0012301641,0.002668352,0.0012641762,0.00041415892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010855136,0.0006335546,0.00069171685,0.0017606087,0.00067800016,0.0017952167,0.0013843476,0.00085752155,0.005278111],"category_scores_gemma":[0.017031342,0.00044675465,0.0010877402,0.0011349255,0.0013239445,0.006232115,0.0017976502,0.0018045685,0.00070136186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093816157,0.00032453085,0.025103997,0.0010979512,0.00030743197,0.0005246944,0.00082641206,0.43835205,0.055046923,0.31605133,0.0033336421,0.15809289],"study_design_scores_gemma":[0.00001092486,0.00012296354,0.004026638,0.000040618044,0.000052727126,0.00030257844,0.000102075,0.8121631,0.023355765,0.1576426,0.0021222148,0.000057720736],"about_ca_topic_score_codex":0.0012794001,"about_ca_topic_score_gemma":0.0013841215,"teacher_disagreement_score":0.005278111,"about_ca_system_score_codex":0.0014942687,"about_ca_system_score_gemma":0.00094038056,"threshold_uncertainty_score":0.017657042},"labels":[],"label_agreement":null},{"id":"W2406984000","doi":"","title":"Lower Bounds against Weakly Uniform Circuits.","year":2012,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Succinctness; Connection (principal bundle); Boolean circuit; Mathematics; Electronic circuit; Discrete mathematics; Circuit complexity; Polynomial; Relaxation (psychology); Boolean function; Combinatorics; Pigeonhole principle; Time complexity; Physics; Mathematical analysis; Quantum mechanics; Geometry","score_opus":0.024397094283383106,"score_gpt":0.2601159559057044,"score_spread":0.2357188616223213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406984000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1532794,0.005982105,0.75316966,0.008200714,0.00064643216,0.00044488927,0.0040071015,0.0050611193,0.06920857],"genre_scores_gemma":[0.8467444,0.0021473675,0.12569693,0.0025966947,0.0011042458,0.0008333747,0.0041698907,0.0010908388,0.015616176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99174607,0.0020209197,0.0005168455,0.0020047876,0.0022844223,0.0014267921],"domain_scores_gemma":[0.9324646,0.054549035,0.0023076944,0.006798324,0.0023430565,0.0015372778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004840351,0.002120873,0.0021267666,0.0025014088,0.0024507619,0.0057800603,0.004706029,0.002221286,0.01425642],"category_scores_gemma":[0.04063443,0.0014074417,0.0024525824,0.002511263,0.003910655,0.016014954,0.0067291474,0.005331429,0.0023565162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019309117,0.00028350437,0.004463978,0.001274981,0.0002541843,0.0003851156,0.0009181357,0.09122304,0.011882464,0.7814178,0.017688105,0.088277936],"study_design_scores_gemma":[0.00011955892,0.00019019491,0.00059563783,0.00013426572,0.00014850585,0.0002724614,0.000077756195,0.1678836,0.0064225267,0.8171341,0.006977436,0.000043971944],"about_ca_topic_score_codex":0.001275178,"about_ca_topic_score_gemma":0.0018195411,"teacher_disagreement_score":0.01425642,"about_ca_system_score_codex":0.003840015,"about_ca_system_score_gemma":0.0016335975,"threshold_uncertainty_score":0.047692478},"labels":[],"label_agreement":null},{"id":"W2407080619","doi":"","title":"Low uniform versions of NC1.","year":2011,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Characterization (materials science); Logarithm; Power (physics); Electronic circuit; Mathematics; Computer science; Value (mathematics); Word (group theory); Discrete mathematics; Combinatorics; Algorithm; Topology (electrical circuits); Geometry; Physics; Mathematical analysis","score_opus":0.03610587064497138,"score_gpt":0.24498704681168648,"score_spread":0.2088811761667151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407080619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36413637,0.0008570411,0.53697115,0.002694703,0.0002423903,0.00029257836,0.0038598382,0.0021439272,0.08880197],"genre_scores_gemma":[0.92369974,0.00024697094,0.057793777,0.0010194599,0.00018777561,0.00025638705,0.0023076045,0.00033507554,0.014153112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670166,0.00043038267,0.00024253233,0.0012367645,0.0008495162,0.00053913397],"domain_scores_gemma":[0.9860869,0.0077549377,0.0009825459,0.0029597261,0.0015111981,0.000704714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013583868,0.0005161131,0.00061071396,0.0008989427,0.0015329155,0.0035126614,0.0016084893,0.0008279257,0.007801946],"category_scores_gemma":[0.01115558,0.0003892664,0.0010948704,0.0011387488,0.00206701,0.006434044,0.0021220522,0.002934656,0.00078618637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035803916,0.0000749882,0.0030479305,0.00027244183,0.00004413764,0.00016759126,0.0005406431,0.010020267,0.00692173,0.95172805,0.0047786636,0.022045504],"study_design_scores_gemma":[0.000055508237,0.0001246779,0.0022855818,0.000046169425,0.000068388974,0.0005548519,0.0002286397,0.06493055,0.0139968,0.8944061,0.023249479,0.00005319134],"about_ca_topic_score_codex":0.0031646972,"about_ca_topic_score_gemma":0.003291687,"teacher_disagreement_score":0.007801946,"about_ca_system_score_codex":0.0033506462,"about_ca_system_score_gemma":0.0013223893,"threshold_uncertainty_score":0.0261001},"labels":[],"label_agreement":null},{"id":"W2407154113","doi":"","title":"State complexity of prefix-free regular languages","year":2006,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Prefix; Regular language; Computer science; State (computer science); Abstract family of languages; Theoretical computer science; Programming language; Arithmetic; Automaton; Mathematics; Linguistics; Second-generation programming language","score_opus":0.013825166592377978,"score_gpt":0.22874204676205076,"score_spread":0.21491688016967278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407154113","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78223574,0.00028561952,0.20640214,0.0008003224,0.000033346336,0.00018150372,0.0010639597,0.0010611091,0.007936168],"genre_scores_gemma":[0.95154625,0.00019183374,0.04378701,0.000058951697,0.000030272258,0.00018464348,0.0009117774,0.00015933179,0.0031300161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975473,0.00041605113,0.00027491804,0.0005360692,0.0007313194,0.0004942704],"domain_scores_gemma":[0.9818174,0.013279635,0.0013602711,0.0019637141,0.001104791,0.00047417308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001364967,0.000503445,0.0007487529,0.00095020473,0.0011162747,0.0032869363,0.0014786455,0.00077069737,0.006580866],"category_scores_gemma":[0.010780615,0.0005190423,0.0015735728,0.0009553723,0.0019102977,0.008812588,0.0019623411,0.0018399111,0.0005762549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020628374,0.0004817596,0.011060883,0.00084256474,0.00019112937,0.0007984054,0.0027634697,0.2833746,0.04876712,0.5693703,0.003114683,0.07717215],"study_design_scores_gemma":[0.00008946005,0.00022767563,0.0015089267,0.00003141278,0.00013457173,0.00029217714,0.00032483574,0.49749026,0.029483747,0.4677171,0.0026158388,0.0000840264],"about_ca_topic_score_codex":0.0025894938,"about_ca_topic_score_gemma":0.0024139269,"teacher_disagreement_score":0.006580866,"about_ca_system_score_codex":0.001943778,"about_ca_system_score_gemma":0.0019081169,"threshold_uncertainty_score":0.022015154},"labels":[],"label_agreement":null},{"id":"W2407362099","doi":"","title":"Bridges between Algebraic Automata Theory and Complexity Theory.","year":2006,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"","keywords":"Algebraic theory; Automaton; Automata theory; Computer science; Computation; Semigroup; Algebra over a field; Algebraic number; Theoretical computer science; Krohn–Rhodes theory; Theory of computation; Finite-state machine; Mathematics; Discrete mathematics; Algorithm; Special classes of semigroups; Pure mathematics","score_opus":0.020045024236462962,"score_gpt":0.24084838510107667,"score_spread":0.22080336086461372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407362099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019369928,0.118272744,0.45339024,0.056083247,0.004433159,0.00007558632,0.0005157042,0.00049816683,0.34736127],"genre_scores_gemma":[0.70238924,0.07311849,0.15741673,0.009526473,0.013817195,0.00030959665,0.001040561,0.00037365928,0.042008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976909,0.00093091227,0.00014531301,0.000363421,0.00074074126,0.00012876205],"domain_scores_gemma":[0.9887866,0.008681386,0.0004713607,0.00077812135,0.0009120823,0.00037042625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023629586,0.0006746813,0.0009900418,0.0022604796,0.0021483605,0.005364698,0.0011321531,0.0022518313,0.010168247],"category_scores_gemma":[0.010481028,0.00046170046,0.00096362265,0.0028497472,0.007391883,0.015693562,0.0037187927,0.004657236,0.0020565288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005505176,0.0000063976063,0.000074053154,0.00006480391,0.000005114557,0.00002912538,0.000112156864,0.00035476225,0.000084847314,0.99089175,0.0024059536,0.0059655285],"study_design_scores_gemma":[0.0000018776155,0.0000055784385,0.00007494361,0.000025077336,0.0000018214134,0.00005043159,0.00003302401,0.0010044394,0.000055097713,0.9846607,0.01408246,0.0000044773215],"about_ca_topic_score_codex":0.00090209115,"about_ca_topic_score_gemma":0.0008605046,"teacher_disagreement_score":0.010168247,"about_ca_system_score_codex":0.002728524,"about_ca_system_score_gemma":0.0012409692,"threshold_uncertainty_score":0.034016192},"labels":[],"label_agreement":null},{"id":"W2407962255","doi":"","title":"State-Complexity Hierarchies of Uniform Languages of Alphabet-Size Length.","year":2008,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; University of Waterloo","funders":"","keywords":"Alphabet; Regular language; Mathematics; Combinatorics; State (computer science); Class (philosophy); Hierarchy; Discrete mathematics; Formal language; Complexity class; Simple (philosophy); Pumping lemma for regular languages; Set (abstract data type); Automaton; Time complexity; Computer science; Theoretical computer science; Algorithm; Linguistics","score_opus":0.021792489354975023,"score_gpt":0.24690518062486091,"score_spread":0.2251126912698859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407962255","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7997781,0.0011617657,0.16945602,0.0011367407,0.000033578897,0.00011691696,0.0010488153,0.0005583747,0.026709663],"genre_scores_gemma":[0.9715298,0.00025060534,0.024864975,0.00007265049,0.0000445911,0.00011685605,0.00043660606,0.000067995315,0.0026158842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985335,0.00025052542,0.00011785879,0.00028692765,0.0005032045,0.00030801285],"domain_scores_gemma":[0.98598135,0.010080673,0.0015488032,0.00090318493,0.0008007584,0.00068522885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081128854,0.00038539013,0.00048589194,0.0012304216,0.0012787203,0.00296203,0.00085334125,0.00068653416,0.0038988355],"category_scores_gemma":[0.010443554,0.0005626909,0.0009576405,0.0010888953,0.001827975,0.00508347,0.0013493777,0.0014868284,0.00031462777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022064407,0.00010835997,0.007762665,0.00024709737,0.0000516766,0.00030330778,0.0021703497,0.041211423,0.014781548,0.91289526,0.0016390559,0.018608626],"study_design_scores_gemma":[0.00003803773,0.000108647604,0.006082507,0.00004457732,0.00005192284,0.0005503869,0.000399355,0.19518477,0.008431294,0.7814103,0.0076241256,0.00007408961],"about_ca_topic_score_codex":0.0025661625,"about_ca_topic_score_gemma":0.0029161323,"teacher_disagreement_score":0.0038988355,"about_ca_system_score_codex":0.0031666593,"about_ca_system_score_gemma":0.0010552653,"threshold_uncertainty_score":0.022975862},"labels":[],"label_agreement":null},{"id":"W2408319280","doi":"","title":"Input-Driven Pushdown Automata with Limited Nondeterminism (Invited Paper)","year":2014,"lang":"en","type":"article","venue":"Developments in Language Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Pushdown automaton; Deterministic pushdown automaton; Nondeterministic algorithm; Embedded pushdown automaton; Discrete mathematics; Automaton; Path (computing); Computer science; Algorithm; Computation; Mathematics; Combinatorics; Theoretical computer science; Nondeterministic finite automaton; Automata theory; Rule-based machine translation; Artificial intelligence; Programming language","score_opus":0.005016240646057672,"score_gpt":0.2126898059308322,"score_spread":0.20767356528477451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408319280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08338616,0.0066663935,0.8758779,0.0073822034,0.0030524626,0.00020881789,0.0007217183,0.002556082,0.0201482],"genre_scores_gemma":[0.68583167,0.0051188264,0.27499968,0.001220966,0.002020309,0.00034761705,0.0015572445,0.00050759915,0.028396111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884087,0.00023173254,0.000089617846,0.0004939414,0.00021659504,0.00012727018],"domain_scores_gemma":[0.9961371,0.0028918674,0.000107332475,0.00034091264,0.00032716626,0.00019565786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012153196,0.0005780559,0.00078204804,0.00038573123,0.00082115654,0.0019787268,0.0011524821,0.00086695317,0.0054529924],"category_scores_gemma":[0.0051228786,0.0006064227,0.0010721285,0.00081860146,0.0013028434,0.0030795918,0.0012930207,0.0019753953,0.0012273344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012575712,0.00038573772,0.0028526688,0.0025111171,0.00021191794,0.001781802,0.001312255,0.099415705,0.035275456,0.46030593,0.056400236,0.33828962],"study_design_scores_gemma":[0.00019555079,0.0003604882,0.0011648603,0.00015507567,0.0001610044,0.00087958295,0.00019539645,0.23392893,0.030085681,0.64084995,0.091919184,0.00010426829],"about_ca_topic_score_codex":0.0011211984,"about_ca_topic_score_gemma":0.0010500066,"teacher_disagreement_score":0.0054529924,"about_ca_system_score_codex":0.0010480888,"about_ca_system_score_gemma":0.0010304658,"threshold_uncertainty_score":0.018242061},"labels":[],"label_agreement":null},{"id":"W24097891","doi":"","title":"Permutations Restricted By Patterns Of Type (2, 1).","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Biology","score_opus":0.00854896597266616,"score_gpt":0.23052660469578637,"score_spread":0.2219776387231202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24097891","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38408297,0.00097636314,0.3126883,0.0013418051,0.002303959,0.00046419105,0.0043720417,0.0043605035,0.2894099],"genre_scores_gemma":[0.82319033,0.0004800509,0.07559785,0.0006184923,0.00032311984,0.0003620595,0.0032732785,0.000714732,0.09544016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830735,0.0004337222,0.00016966964,0.00038940276,0.0003278578,0.0003719281],"domain_scores_gemma":[0.997338,0.0007168031,0.00035759358,0.0010131514,0.00031197423,0.00026243168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070161594,0.00055325596,0.00066376093,0.0011167187,0.0018250671,0.0029422124,0.0010385113,0.0012423481,0.024019737],"category_scores_gemma":[0.003964936,0.0004607824,0.0009964905,0.0013011271,0.0013057173,0.003714449,0.0017445051,0.0011007398,0.007223665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010179725,0.00025194592,0.0032052232,0.0002861731,0.00011079369,0.0022288691,0.0009444725,0.0024058088,0.033513382,0.8692783,0.02221842,0.064538665],"study_design_scores_gemma":[0.00011398525,0.00019039557,0.0019072861,0.00010248195,0.00009245423,0.0024114794,0.0007489125,0.0077628773,0.025524609,0.8630934,0.09793697,0.0001151672],"about_ca_topic_score_codex":0.0006701627,"about_ca_topic_score_gemma":0.00112777,"teacher_disagreement_score":0.024019737,"about_ca_system_score_codex":0.00047508808,"about_ca_system_score_gemma":0.00080270105,"threshold_uncertainty_score":0.080354035},"labels":[],"label_agreement":null},{"id":"W2410782219","doi":"10.46298/dmtcs.2727","title":"Universal cycles for permutation classes","year":2009,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Permutation (music); Class (philosophy); Parity of a permutation; Cyclic permutation; Symmetric group; Physics","score_opus":0.018646532285511847,"score_gpt":0.2787453586999372,"score_spread":0.2600988264144254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2410782219","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45556358,0.0034532733,0.29986706,0.0012029159,0.00043938606,0.0002656731,0.0009709215,0.0010977724,0.23713936],"genre_scores_gemma":[0.939068,0.0008177556,0.027390266,0.00040569916,0.0002840774,0.00025442685,0.00066527963,0.000245841,0.030868536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910885,0.000092552546,0.0000465009,0.00031155834,0.00020257522,0.00023792697],"domain_scores_gemma":[0.9991547,0.00026843874,0.000104674546,0.00013598404,0.00014065151,0.00019557029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037422974,0.0004767769,0.00045009455,0.0017497452,0.002187222,0.0024791851,0.0006331423,0.0007414176,0.009721679],"category_scores_gemma":[0.002069692,0.00031028435,0.00073786156,0.0010940232,0.0021531137,0.003388886,0.002094811,0.0011197221,0.00090293563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028007518,0.000011981906,0.0006508538,0.000034804634,0.0000055947926,0.00007106553,0.0004255308,0.00061184925,0.0013963,0.9801856,0.0010018937,0.015576437],"study_design_scores_gemma":[0.000011275052,0.000028801962,0.0005827699,0.00003798532,0.000009549304,0.0002253207,0.00018340415,0.0035983748,0.0015546269,0.9512589,0.042488948,0.000020078323],"about_ca_topic_score_codex":0.0027314473,"about_ca_topic_score_gemma":0.0020998,"teacher_disagreement_score":0.009721679,"about_ca_system_score_codex":0.0022561818,"about_ca_system_score_gemma":0.00078935426,"threshold_uncertainty_score":0.0325222},"labels":[],"label_agreement":null},{"id":"W241508062","doi":"10.1007/978-0-387-68759-9_4","title":"Equations Over ω-Automata","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Automaton; Computer science; Theoretical computer science","score_opus":0.034341375351331346,"score_gpt":0.2287106275507101,"score_spread":0.19436925219937873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W241508062","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015731957,0.007208265,0.28356424,0.0042188647,0.002056853,0.00010099266,0.0006895036,0.00048517986,0.6859441],"genre_scores_gemma":[0.35382974,0.0148562025,0.08365495,0.001859278,0.0019639735,0.00033620812,0.0016469298,0.0006600982,0.5411926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996246,0.00008454997,0.00004394995,0.00009004058,0.00012440326,0.000032349537],"domain_scores_gemma":[0.99949825,0.00030640955,0.000020320447,0.000066925764,0.00008700235,0.000021009018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044710573,0.00073879526,0.00043366232,0.0006648046,0.0007740813,0.0017585601,0.00061931665,0.0006069659,0.017414412],"category_scores_gemma":[0.0013550654,0.00054916687,0.0007485653,0.000975388,0.0016805712,0.005404685,0.0012314422,0.002672907,0.004907657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004656349,0.0000073445763,0.000038104776,0.00005787622,0.0000028170498,0.000023506722,0.00021929458,0.00042837532,0.00042562213,0.9713227,0.0075883674,0.019881291],"study_design_scores_gemma":[0.0000060415605,0.0000051235147,0.000046625162,0.00003541188,0.0000049019827,0.00005358939,0.00003364423,0.0012915462,0.0005840564,0.9066194,0.09131194,0.000007668331],"about_ca_topic_score_codex":0.00093833153,"about_ca_topic_score_gemma":0.00089731073,"teacher_disagreement_score":0.017414412,"about_ca_system_score_codex":0.0011877618,"about_ca_system_score_gemma":0.00063730695,"threshold_uncertainty_score":0.058257043},"labels":[],"label_agreement":null},{"id":"W2419591848","doi":"10.1016/j.dam.2016.05.003","title":"The New Periodicity Lemma revisited","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Lemma (botany); Factorization; String (physics); Neighbourhood (mathematics); Combinatorics; Algorithm; Mathematical analysis","score_opus":0.010581352350266988,"score_gpt":0.2258826769507843,"score_spread":0.2153013246005173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2419591848","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06300995,0.013077389,0.4001429,0.05378717,0.011283095,0.00008465913,0.000661273,0.00071012566,0.45724353],"genre_scores_gemma":[0.78854835,0.00719516,0.077780634,0.013368348,0.012208843,0.00027355534,0.000420461,0.0006071435,0.09959761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988018,0.0003219863,0.00008756832,0.00036776267,0.00029189026,0.00012904884],"domain_scores_gemma":[0.9975587,0.0012491067,0.00015318269,0.0006444411,0.00028437018,0.000110195586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023981347,0.0004138176,0.00093679945,0.0011483314,0.001455126,0.002600123,0.0013995584,0.0020540007,0.01311621],"category_scores_gemma":[0.0058267065,0.0004975681,0.0009572738,0.0010413447,0.004896141,0.009500393,0.0024435346,0.0040225107,0.0021000376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012204179,0.0000048764255,0.00007334102,0.000026745503,0.000004713578,0.00006542162,0.00007318452,0.00008552294,0.0003457472,0.99134225,0.0034701515,0.0044958307],"study_design_scores_gemma":[0.000015758307,0.000013150847,0.00020650779,0.000016208152,0.000007949236,0.00023716797,0.000051951585,0.0014465947,0.00044469,0.9771955,0.020351991,0.00001248186],"about_ca_topic_score_codex":0.00044894835,"about_ca_topic_score_gemma":0.00033465802,"teacher_disagreement_score":0.01311621,"about_ca_system_score_codex":0.0007575351,"about_ca_system_score_gemma":0.00065712427,"threshold_uncertainty_score":0.04387808},"labels":[],"label_agreement":null},{"id":"W2422636290","doi":"10.1051/ita/2016010","title":"Decision algorithms for Fibonacci-automatic Words, I: Basic results","year":2016,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fibonacci number; Morphism; Class (philosophy); Word (group theory); Algorithm; Computer science; Point (geometry); Palindrome; Arithmetic; Combinatorics; Mathematics; Discrete mathematics; Artificial intelligence","score_opus":0.011414138565296647,"score_gpt":0.26358908885084137,"score_spread":0.2521749502855447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2422636290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024132578,0.00060055515,0.95782936,0.0011911257,0.00017417276,0.00030492657,0.00045186325,0.0011734108,0.014141987],"genre_scores_gemma":[0.35441813,0.0006583935,0.6275564,0.0012540836,0.00051452714,0.0008362997,0.0019591441,0.00044901465,0.012354077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99424475,0.0014968691,0.0005581445,0.0014292866,0.0016214213,0.0006495753],"domain_scores_gemma":[0.98290586,0.012974139,0.0006855387,0.0014193534,0.0015347155,0.00048033116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004852324,0.001073495,0.001264714,0.002187605,0.0018244531,0.005344085,0.003621071,0.0025572646,0.010791009],"category_scores_gemma":[0.024319924,0.00084144727,0.0025674505,0.0021027634,0.0029543429,0.008636977,0.0041834456,0.004431383,0.0030426118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031404887,0.00030207547,0.0016162868,0.00032120058,0.00008271218,0.000093237875,0.00044867772,0.016605083,0.0032596348,0.8778575,0.0077195545,0.09137999],"study_design_scores_gemma":[0.00007257447,0.000066895656,0.00019525825,0.00006404913,0.00003574706,0.00007242009,0.00009565872,0.123177215,0.003337057,0.8686998,0.0041510942,0.000032236745],"about_ca_topic_score_codex":0.0016242826,"about_ca_topic_score_gemma":0.001677982,"teacher_disagreement_score":0.010791009,"about_ca_system_score_codex":0.002762573,"about_ca_system_score_gemma":0.002746939,"threshold_uncertainty_score":0.036099494},"labels":[],"label_agreement":null},{"id":"W2430843852","doi":"10.1007/978-3-319-41114-9_5","title":"Unrestricted State Complexity of Binary Operations on Regular Languages","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Concatenation (mathematics); Alphabet; Binary number; State (computer science); Product (mathematics); Combinatorics; Discrete mathematics; Quotient; Intersection (aeronautics); Time complexity; Mathematics; Regular language; Computer science; Arithmetic; Algorithm; Theoretical computer science; Automaton","score_opus":0.02201696527997163,"score_gpt":0.25859836794947844,"score_spread":0.2365814026695068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2430843852","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63313276,0.0031760505,0.25359046,0.0027313977,0.00036062687,0.00021575278,0.0014015383,0.00071710563,0.104674324],"genre_scores_gemma":[0.9515674,0.001532245,0.029034084,0.00017907463,0.00033377088,0.00023971655,0.0011836208,0.0002631351,0.015667027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977781,0.0003626616,0.00015291304,0.00049078354,0.0007106991,0.00050475],"domain_scores_gemma":[0.99174607,0.00626933,0.00047708923,0.0008464516,0.00037665054,0.00028446162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096420816,0.0007332108,0.0008382485,0.0011457648,0.001204785,0.0046089925,0.0015955999,0.0008815579,0.008070671],"category_scores_gemma":[0.00772146,0.00060134224,0.0022192714,0.0015749787,0.0025260372,0.010906658,0.0029557268,0.0039258655,0.00089015043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033303164,0.00018754983,0.0016275626,0.00030570265,0.000060023933,0.00014085359,0.0008912415,0.038305093,0.007058956,0.91127205,0.0030153592,0.03680259],"study_design_scores_gemma":[0.000025770969,0.000077585275,0.0007918246,0.00003840786,0.000046094534,0.00011007757,0.00013672594,0.08993596,0.0045594852,0.90021455,0.0040243,0.000039185412],"about_ca_topic_score_codex":0.0015232553,"about_ca_topic_score_gemma":0.0011109615,"teacher_disagreement_score":0.008070671,"about_ca_system_score_codex":0.0027374472,"about_ca_system_score_gemma":0.0014362617,"threshold_uncertainty_score":0.026999116},"labels":[],"label_agreement":null},{"id":"W2439381154","doi":"10.1142/s0129054112400436","title":"ABELIAN PRIMITIVE WORDS","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Abelian group; Rank of an abelian group; Arithmetic of abelian varieties; Combinatorics on words; Mathematics; Word (group theory); Elementary abelian group; Context (archaeology); Free abelian group; Alphabet; Set (abstract data type); Combinatorics; Discrete mathematics; Computer science; Biology; Linguistics; Philosophy","score_opus":0.016539528795581793,"score_gpt":0.30270130491401165,"score_spread":0.28616177611842986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2439381154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48805323,0.0032766527,0.3731434,0.0013122751,0.00089281856,0.00030383375,0.0011210662,0.0010493471,0.13084744],"genre_scores_gemma":[0.8785223,0.0008765007,0.09329251,0.0004519737,0.0004683778,0.00020436499,0.00089916785,0.00025055304,0.025034316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999054,0.00018738674,0.0000839025,0.00024144395,0.0002695738,0.00016380115],"domain_scores_gemma":[0.99667203,0.0016967264,0.00044359855,0.00042454983,0.0005802067,0.0001827996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043501888,0.0005474918,0.00056581903,0.0011427772,0.0013153458,0.0015552064,0.00093427737,0.0006587112,0.009711621],"category_scores_gemma":[0.0034066786,0.000285989,0.0005114195,0.0010885395,0.0024039312,0.0046678935,0.0016193975,0.0010608152,0.0021941753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001597379,0.000058458598,0.001879367,0.00032441816,0.000022538354,0.0009847968,0.00059888297,0.0025043106,0.013786957,0.93454725,0.00377235,0.041360848],"study_design_scores_gemma":[0.00001714692,0.000097128075,0.0005142825,0.000058121237,0.000028822002,0.0010001739,0.00029963892,0.0068309405,0.011204279,0.9426654,0.037250746,0.00003343694],"about_ca_topic_score_codex":0.000238501,"about_ca_topic_score_gemma":0.00026950843,"teacher_disagreement_score":0.009711621,"about_ca_system_score_codex":0.00042562425,"about_ca_system_score_gemma":0.00037678922,"threshold_uncertainty_score":0.032488644},"labels":[],"label_agreement":null},{"id":"W2460573387","doi":"","title":"Boolean grammars: expressive power and parsing algorithms","year":2005,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Indexed grammar; Phrase structure grammar; Context-sensitive grammar; Tree-adjoining grammar; Definite clause grammar; Computer science; L-attributed grammar; Context-free grammar; Deterministic context-free grammar; Programming language; Embedded pushdown automaton; Boolean expression; Parsing expression grammar; Theoretical computer science; Algorithm; Parsing","score_opus":0.007330642977168579,"score_gpt":0.2218708008210055,"score_spread":0.21454015784383693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460573387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006680839,0.001046365,0.9776538,0.0006695162,0.000057157355,0.00005395554,0.00019257871,0.0011517762,0.012494075],"genre_scores_gemma":[0.2705329,0.0039162636,0.7110325,0.00055413373,0.0002853735,0.00037654076,0.0007972764,0.000811011,0.011694022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843603,0.0005193419,0.00014157139,0.0002760553,0.00051634305,0.00011073791],"domain_scores_gemma":[0.99808216,0.0014127505,0.000092836395,0.00021823704,0.00015149785,0.00004260087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019026336,0.00066383055,0.0005592603,0.0012007521,0.0005420266,0.0028897116,0.001422548,0.0009998946,0.004342757],"category_scores_gemma":[0.0052223247,0.0005801332,0.0010557375,0.0016172848,0.0025937338,0.004452339,0.0013477736,0.0021182802,0.0010241492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002979595,0.00001783038,0.00018971556,0.000118550335,0.000013450287,0.00010027959,0.00026309822,0.018681373,0.0037118387,0.91503936,0.0020198228,0.05981492],"study_design_scores_gemma":[0.000017536111,0.0000124119315,0.000080567006,0.00004983059,0.000018824627,0.0001384554,0.000048353042,0.09346803,0.0032182594,0.8875762,0.015350412,0.00002109968],"about_ca_topic_score_codex":0.0014831616,"about_ca_topic_score_gemma":0.0010335812,"teacher_disagreement_score":0.004342757,"about_ca_system_score_codex":0.0015017571,"about_ca_system_score_gemma":0.00084630155,"threshold_uncertainty_score":0.0145279765},"labels":[],"label_agreement":null},{"id":"W2478264020","doi":"10.5485/tmcs.2015.0381","title":"The far side of recursion","year":2015,"lang":"en","type":"article","venue":"Teaching Mathematics and Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Recursion (computer science); Far side of the Moon; Mathematics; Computer science; Geology; Algorithm; Geophysics","score_opus":0.02293979355512128,"score_gpt":0.2572593223697552,"score_spread":0.23431952881463392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478264020","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023807783,0.021378508,0.30656725,0.07815199,0.0035929398,0.000049568334,0.00015063328,0.0010248886,0.5652764],"genre_scores_gemma":[0.78768736,0.0113035785,0.07759314,0.012444097,0.0027414216,0.00016543834,0.00013404967,0.0009097422,0.1070212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99633825,0.0019987836,0.00011187631,0.0005575644,0.0007617222,0.00023187435],"domain_scores_gemma":[0.9952028,0.0032223524,0.00015141576,0.00071667985,0.00048834877,0.00021848579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032611503,0.0006550402,0.0006395851,0.00082547736,0.0039165663,0.005696309,0.0010776812,0.0024655939,0.011111618],"category_scores_gemma":[0.012072203,0.0003421119,0.0005158094,0.0007193883,0.017498963,0.014219056,0.0037568214,0.0064741364,0.0030929204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008613867,0.0000029941068,0.000060796498,0.000017476326,0.0000019366482,0.0000090965295,0.00062104984,0.0001857499,0.00013869157,0.9878379,0.0024162221,0.008699537],"study_design_scores_gemma":[0.0000057038737,0.000012777367,0.00006041369,0.00006623911,0.00000330272,0.000034646408,0.00022543225,0.0008443143,0.00033817996,0.9218053,0.07659567,0.000008105857],"about_ca_topic_score_codex":0.0029620316,"about_ca_topic_score_gemma":0.0021336125,"teacher_disagreement_score":0.011111618,"about_ca_system_score_codex":0.0030780623,"about_ca_system_score_gemma":0.0017713315,"threshold_uncertainty_score":0.03717208},"labels":[],"label_agreement":null},{"id":"W2482750740","doi":"10.1007/978-3-319-41114-9_15","title":"State Complexity of Prefix Distance of Subregular Languages","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Prefix; Upper and lower bounds; Regular language; Deterministic finite automaton; Neighbourhood (mathematics); Finite-state machine; Combinatorics; Alphabet; Mathematics; Nondeterministic finite automaton; Discrete mathematics; Automaton; Computer science; Algorithm; Theoretical computer science; Automata theory","score_opus":0.01602923877316603,"score_gpt":0.24238024157622856,"score_spread":0.22635100280306253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482750740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8136626,0.00075217074,0.1562676,0.0018225695,0.000090067486,0.0000708586,0.0013089972,0.00046964872,0.025555506],"genre_scores_gemma":[0.9837134,0.00029603133,0.009821688,0.0000870289,0.00013344642,0.00008940783,0.0007459096,0.0001542319,0.004958881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750715,0.0005336269,0.00017382833,0.0005629428,0.00080892514,0.00041352847],"domain_scores_gemma":[0.97789717,0.017571336,0.0010252071,0.0016109524,0.0010631946,0.00083223876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016127172,0.000523567,0.0013399138,0.0013375481,0.0013554365,0.0056218994,0.0025730173,0.0016899896,0.011409821],"category_scores_gemma":[0.0142968185,0.0006692153,0.0012457555,0.0017781436,0.0026707277,0.009805922,0.00324553,0.0034174903,0.0007887137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046758732,0.00010318224,0.0022186697,0.00020374359,0.00004002155,0.00015069157,0.00079908106,0.04284411,0.004050575,0.9296829,0.0021394175,0.017299999],"study_design_scores_gemma":[0.000026492062,0.000037022462,0.00055245514,0.000013899984,0.000020506808,0.0000664119,0.00009130889,0.12841514,0.0013597312,0.8688478,0.00054544635,0.000023894996],"about_ca_topic_score_codex":0.0016564801,"about_ca_topic_score_gemma":0.0013975046,"teacher_disagreement_score":0.011409821,"about_ca_system_score_codex":0.002918177,"about_ca_system_score_gemma":0.0017665084,"threshold_uncertainty_score":0.038169622},"labels":[],"label_agreement":null},{"id":"W2486550492","doi":"10.1090/cbms/101/09","title":"Integration on ℋ_{𝓅}×ℋ","year":2003,"lang":"en","type":"book-chapter","venue":"Regional conference series in mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science","score_opus":0.052780865652129964,"score_gpt":0.2525236068841242,"score_spread":0.1997427412319942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486550492","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11027034,0.0015375436,0.35528895,0.0018609195,0.0010982436,0.000094645904,0.00027660732,0.0006817534,0.528891],"genre_scores_gemma":[0.6889951,0.0009989568,0.06751275,0.0005102635,0.0006302484,0.00014110509,0.0004757172,0.0004487459,0.24028717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993248,0.00009052389,0.000037330068,0.00016772878,0.00028359066,0.0000960418],"domain_scores_gemma":[0.9993544,0.00019067635,0.00006669831,0.00007400523,0.00022842918,0.00008584463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005189671,0.00051972753,0.00062920037,0.0010158414,0.001754116,0.002575603,0.0007149404,0.0005365389,0.012235551],"category_scores_gemma":[0.0012604767,0.00046031884,0.0008336985,0.00077074365,0.0024424316,0.003596291,0.001888156,0.0021927236,0.002497261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011218828,0.000007645048,0.000045212833,0.000013295501,0.0000041925496,0.000035576435,0.00019839403,0.00018734764,0.0008713127,0.9890189,0.0011453555,0.008461454],"study_design_scores_gemma":[0.0000070556807,0.000012716478,0.00017316779,0.000008899878,0.00000840758,0.00008009875,0.00007567399,0.002246773,0.001302784,0.97907126,0.01700523,0.000007956675],"about_ca_topic_score_codex":0.001780821,"about_ca_topic_score_gemma":0.0014063423,"teacher_disagreement_score":0.012235551,"about_ca_system_score_codex":0.0014803361,"about_ca_system_score_gemma":0.0006763993,"threshold_uncertainty_score":0.040932},"labels":[],"label_agreement":null},{"id":"W2491692501","doi":"10.1090/chel/346/14","title":"Table of knots and links","year":2003,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Table (database); Computer science; Database","score_opus":0.011795954336634861,"score_gpt":0.222302871429485,"score_spread":0.21050691709285013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491692501","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035329368,0.0044238237,0.020539353,0.0011912388,0.0025688314,0.00008069265,0.0051676277,0.001322106,0.96117336],"genre_scores_gemma":[0.046401005,0.0061540715,0.024695283,0.00055721,0.00081590895,0.00014060737,0.007623846,0.000645987,0.9129661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99984753,0.000015423511,0.000010012475,0.00003890891,0.000065489156,0.000022614518],"domain_scores_gemma":[0.99976474,0.000053801225,0.000016171984,0.000040265564,0.00008918961,0.000035832338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012215188,0.00069791434,0.00069150596,0.0017993777,0.0014240891,0.0032072922,0.0008824588,0.00072001043,0.23078182],"category_scores_gemma":[0.00077804376,0.00035237076,0.00032804403,0.0030118334,0.000532035,0.003289055,0.00079258176,0.001095202,0.07855805],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004186734,0.000038314654,0.00014810705,0.0002990555,0.00000769285,0.00009038328,0.00014431484,0.0010232419,0.00082272425,0.38792711,0.3679144,0.24154288],"study_design_scores_gemma":[0.000006876253,0.00001490734,0.00013643336,0.00010067192,0.000006106605,0.000115844385,0.000069074165,0.00043345944,0.00020545103,0.1416635,0.8572385,0.000009189832],"about_ca_topic_score_codex":0.0018788466,"about_ca_topic_score_gemma":0.0026980797,"teacher_disagreement_score":0.23078182,"about_ca_system_score_codex":0.00064101093,"about_ca_system_score_gemma":0.00088024803,"threshold_uncertainty_score":0.7720421},"labels":[],"label_agreement":null},{"id":"W2491771107","doi":"10.1017/cbo9780511546884.003","title":"Algorithms and Graphs","year":2007,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Sociology","score_opus":0.02354278881369802,"score_gpt":0.20245350631542028,"score_spread":0.17891071750172227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491771107","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065195276,0.071539976,0.3353452,0.011006024,0.0023262594,0.00017896484,0.0027833537,0.0027843816,0.56751627],"genre_scores_gemma":[0.2030339,0.09554362,0.32633707,0.005956103,0.003452535,0.0008243046,0.010129646,0.0030928792,0.35162988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990283,0.00032129884,0.000058407997,0.00021993056,0.00029453603,0.00007754423],"domain_scores_gemma":[0.998629,0.0008165914,0.000049108847,0.0002855383,0.00015779994,0.000061949235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008628778,0.0010629492,0.0009081327,0.0020620527,0.0010861963,0.004134769,0.0012074261,0.0011611256,0.045038782],"category_scores_gemma":[0.0035107678,0.00054317625,0.00090831786,0.004246629,0.0020670386,0.0061372863,0.0015812312,0.0026019996,0.015721997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001989967,0.000026795455,0.00023658219,0.0005588875,0.000033048425,0.00005913562,0.00025905765,0.0027472938,0.0004357505,0.70526654,0.13444102,0.15591604],"study_design_scores_gemma":[0.0000069371617,0.000009153963,0.00017869043,0.00010160949,0.0000073160154,0.00015401244,0.00007239416,0.0019853972,0.00022543353,0.78998595,0.20726557,0.0000076042315],"about_ca_topic_score_codex":0.0016853902,"about_ca_topic_score_gemma":0.0016280875,"teacher_disagreement_score":0.045038782,"about_ca_system_score_codex":0.001991606,"about_ca_system_score_gemma":0.0010694574,"threshold_uncertainty_score":0.15066975},"labels":[],"label_agreement":null},{"id":"W2494060019","doi":"10.1002/9781119105664.oth1","title":"Problem Set 1","year":2015,"lang":"en","type":"other","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Citation; Syntax; Set (abstract data type); Library science; Linguistics; Computer science; Information retrieval; Natural language processing; Programming language; Philosophy","score_opus":0.018110248526803412,"score_gpt":0.24224630515230583,"score_spread":0.22413605662550243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494060019","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010668111,0.007081057,0.2032918,0.265022,0.017993975,0.0030969013,0.024462106,0.0021647988,0.46621913],"genre_scores_gemma":[0.23178136,0.0085168965,0.33219028,0.08964079,0.016319633,0.00903298,0.04196133,0.0025035178,0.26805326],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9941158,0.0023864806,0.00030563734,0.0017795318,0.000881507,0.0005310203],"domain_scores_gemma":[0.9773427,0.017049637,0.0005619714,0.001468798,0.0026620016,0.0009149707],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0052321367,0.0013158815,0.0014519673,0.0008601759,0.0030639688,0.007824432,0.0030102849,0.0051820255,0.16535679],"category_scores_gemma":[0.039141625,0.0005698264,0.0014980243,0.0013754952,0.0030663498,0.008712323,0.004482457,0.005982017,0.030666487],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033300064,0.00020733486,0.00091652636,0.0013422377,0.00006397698,0.00023741493,0.00037621125,0.003931462,0.00020533954,0.25346327,0.63821846,0.10070476],"study_design_scores_gemma":[0.00019809297,0.00010727117,0.00046747978,0.00083543744,0.00003690296,0.0005221385,0.0010888882,0.009246537,0.00041922246,0.5059869,0.48104405,0.000047017293],"about_ca_topic_score_codex":0.0024940798,"about_ca_topic_score_gemma":0.0021807097,"teacher_disagreement_score":0.83464324,"about_ca_system_score_codex":0.0029216532,"about_ca_system_score_gemma":0.006410797,"threshold_uncertainty_score":0.55317354},"labels":[],"label_agreement":null},{"id":"W2495464377","doi":"10.5802/aif.2235","title":"Kolam indiens, dessins sur le sable aux îles Vanuatu, courbe de Sierpinski et morphismes de monoïde","year":2006,"lang":"fr","type":"article","venue":"Annales de l’institut Fourier","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Mathematics; Sequence (biology); Humanities; Sierpinski triangle; Combinatorics; Art; Fractal; Mathematical analysis","score_opus":0.03006068674506317,"score_gpt":0.25844794490440015,"score_spread":0.22838725815933697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2495464377","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18808468,0.019533228,0.09140107,0.0063994415,0.0016230033,0.000045511068,0.00037440326,0.00040715266,0.6921315],"genre_scores_gemma":[0.79888284,0.004241463,0.019771118,0.0009479564,0.00030559767,0.00007873962,0.00029223165,0.00022788758,0.17525211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995171,0.00011479139,0.000023492881,0.00012843772,0.00011417204,0.000102067694],"domain_scores_gemma":[0.9995784,0.00014726094,0.00005514865,0.000053434112,0.000098258264,0.00006739873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005039128,0.00045313558,0.00037996113,0.0016146409,0.002712976,0.0032915368,0.0004622419,0.000817141,0.00756216],"category_scores_gemma":[0.001864784,0.00031279292,0.0004196837,0.0009829871,0.0036465707,0.0036265359,0.002073269,0.0025753276,0.0012127339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022208149,0.0000032359524,0.00031601868,0.000027337444,0.0000034825105,0.00006097462,0.0011885896,0.00009605708,0.00044612048,0.9883803,0.0011366138,0.008319035],"study_design_scores_gemma":[0.00001268352,0.000040796236,0.002846091,0.00017593888,0.000024511206,0.0007578814,0.0020792552,0.0014777117,0.002766444,0.7327549,0.25702006,0.00004372796],"about_ca_topic_score_codex":0.008629875,"about_ca_topic_score_gemma":0.01219905,"teacher_disagreement_score":0.008629875,"about_ca_system_score_codex":0.002377047,"about_ca_system_score_gemma":0.00095132395,"threshold_uncertainty_score":0.02529794},"labels":[],"label_agreement":null},{"id":"W2497478234","doi":"10.1007/978-1-4939-3264-1_2","title":"Solution by Radicals of the Cubic: From Equations to Groups and from Real to Complex Numbers","year":2015,"lang":"en","type":"book-chapter","venue":"Compact textbooks in mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Radical; Pure mathematics; Mathematics; Chemistry; Organic chemistry","score_opus":0.06677806057408893,"score_gpt":0.2895536565764837,"score_spread":0.22277559600239477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2497478234","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03955074,0.030132046,0.29648402,0.020739257,0.010213284,0.00012620058,0.0007148421,0.00049722666,0.6015423],"genre_scores_gemma":[0.48684233,0.021433065,0.11318875,0.0036751744,0.006665587,0.00023396869,0.00064415374,0.0007004881,0.3666165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997975,0.00004816866,0.0000127762705,0.000045726847,0.00007054204,0.000025324534],"domain_scores_gemma":[0.9997764,0.00009584908,0.00002319643,0.000031167237,0.00005142992,0.000021862197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037250752,0.00059763406,0.00048679567,0.00051281165,0.00088450266,0.0019683554,0.0006489853,0.0007956424,0.011909056],"category_scores_gemma":[0.0013900249,0.0002921283,0.0006439685,0.0006166388,0.0024038842,0.004029323,0.0016623915,0.002688204,0.0019014475],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037952198,0.0000046400023,0.000024856368,0.000047706228,0.000001961748,0.0000140757065,0.00023614394,0.00036391953,0.00023246933,0.9812584,0.009062994,0.00874905],"study_design_scores_gemma":[0.0000059394615,0.000004816441,0.000025470736,0.000020336305,0.0000014841546,0.00003050303,0.000051677423,0.00071537454,0.00012380832,0.95769167,0.04132399,0.0000049596633],"about_ca_topic_score_codex":0.0009884565,"about_ca_topic_score_gemma":0.0012474984,"teacher_disagreement_score":0.011909056,"about_ca_system_score_codex":0.0010463105,"about_ca_system_score_gemma":0.0009673162,"threshold_uncertainty_score":0.039839804},"labels":[],"label_agreement":null},{"id":"W2502558882","doi":"10.1017/cbo9780511760860.012","title":"Codes and formal series","year":2010,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Series (stratigraphy); Computer science; Content (measure theory); Information retrieval; Theoretical computer science; Mathematics; Geology","score_opus":0.011116549833925647,"score_gpt":0.17264100536049434,"score_spread":0.1615244555265687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2502558882","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006055229,0.014679174,0.051692378,0.003906827,0.0033454883,0.000043083448,0.0008975359,0.00086850004,0.91851175],"genre_scores_gemma":[0.17407359,0.014892249,0.02543389,0.0012446927,0.002272231,0.00014436402,0.0012201841,0.00089270785,0.77982616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965453,0.00007390965,0.000020248019,0.000050337443,0.00016967274,0.000031254964],"domain_scores_gemma":[0.9993961,0.00023714801,0.000030409996,0.00011016255,0.00017955498,0.000046655143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046387175,0.00041080217,0.00030276956,0.0018346241,0.0010089956,0.0024566327,0.0003709371,0.0004307613,0.05334409],"category_scores_gemma":[0.002311767,0.00017621541,0.00030346832,0.0014579596,0.001527317,0.0028492212,0.0008500492,0.0013075168,0.011819713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048587,0.0000028170457,0.000036440146,0.000051913736,0.0000013520665,0.000013398398,0.00014927912,0.00017511583,0.00016339582,0.9325806,0.038264118,0.028556691],"study_design_scores_gemma":[0.0000034752356,0.000008476666,0.00015729293,0.000061010815,0.0000018906208,0.000099093435,0.0000772686,0.0006162038,0.0002672399,0.60381055,0.39489138,0.0000061566284],"about_ca_topic_score_codex":0.0015387242,"about_ca_topic_score_gemma":0.0017064005,"teacher_disagreement_score":0.05334409,"about_ca_system_score_codex":0.001971359,"about_ca_system_score_gemma":0.0008148976,"threshold_uncertainty_score":0.17845374},"labels":[],"label_agreement":null},{"id":"W250939016","doi":"10.1007/978-3-540-70918-3_43","title":"Languages with Bounded Multiparty Communication Complexity","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; McGill University","funders":"","keywords":"Bounded function; Computer science; Theoretical computer science; Communication complexity; Mathematics","score_opus":0.017780105756289227,"score_gpt":0.279311783082664,"score_spread":0.2615316773263748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W250939016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16548906,0.0010613526,0.7249468,0.011445448,0.00049884955,0.0003325535,0.0014406283,0.0022013222,0.09258396],"genre_scores_gemma":[0.91834927,0.0004277727,0.050915368,0.0011600277,0.0005747323,0.0006674088,0.0007817943,0.0007065867,0.026417103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99098396,0.0027062886,0.000728708,0.0018009486,0.002456933,0.0013231375],"domain_scores_gemma":[0.93907243,0.04609609,0.0023608825,0.007306047,0.0028030695,0.002361592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003795146,0.00091591605,0.0025527913,0.0014969299,0.004477113,0.010769241,0.0030333155,0.004480187,0.013514059],"category_scores_gemma":[0.02603142,0.0019445051,0.0028225472,0.0023003586,0.005382336,0.019216375,0.008183187,0.009074702,0.0024737702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000457572,0.000026220026,0.00010903788,0.00005086245,0.000013084277,0.00011958612,0.0002776793,0.0033132802,0.00042796243,0.99232715,0.0011820219,0.0021073134],"study_design_scores_gemma":[0.000017402212,0.0000060731377,0.000040674488,0.000008058769,0.0000092504015,0.00007771977,0.000031876974,0.014115063,0.00037531627,0.9842164,0.0010884799,0.000013746892],"about_ca_topic_score_codex":0.00089391647,"about_ca_topic_score_gemma":0.0008599656,"teacher_disagreement_score":0.013514059,"about_ca_system_score_codex":0.004035141,"about_ca_system_score_gemma":0.002629072,"threshold_uncertainty_score":0.04520905},"labels":[],"label_agreement":null},{"id":"W2511042131","doi":"10.1007/s00233-017-9867-4","title":"The Frobenius problem for the shuffle operation","year":2017,"lang":"en","type":"preprint","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Iterated function; Word (group theory); Computer science; Finite set; Mathematics; Combinatorics; Discrete mathematics; Theoretical computer science; Geometry","score_opus":0.017830932465054645,"score_gpt":0.2706545985434372,"score_spread":0.2528236660783826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2511042131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44715577,0.0023687687,0.4532144,0.012770479,0.0008926847,0.00008173752,0.0005955734,0.00034733594,0.08257321],"genre_scores_gemma":[0.9233008,0.0012322362,0.032163803,0.0005817994,0.0010775322,0.00013304217,0.0003817461,0.00023560315,0.040893383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882823,0.00032521735,0.00006381802,0.000305774,0.0002411547,0.0002358318],"domain_scores_gemma":[0.996956,0.0019270763,0.00020672007,0.00039632252,0.00023876346,0.0002752342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022056154,0.0006211998,0.0013304182,0.0014138616,0.002387977,0.003836815,0.0012362741,0.0029195105,0.010288038],"category_scores_gemma":[0.007172663,0.0005656748,0.0010052545,0.0011574416,0.005055684,0.013253206,0.0025967048,0.0041241837,0.0017998094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042023243,0.000014486519,0.000073147385,0.00002821482,0.0000037583645,0.000031993663,0.00012369611,0.0010605253,0.00039653073,0.993501,0.0009992544,0.0037254116],"study_design_scores_gemma":[0.0000064842025,0.000004440224,0.000031031967,0.0000045606707,0.0000013668501,0.000022979551,0.000025119862,0.002627573,0.00024322719,0.99626344,0.00076261465,0.000007238426],"about_ca_topic_score_codex":0.0009999631,"about_ca_topic_score_gemma":0.00062273274,"teacher_disagreement_score":0.010288038,"about_ca_system_score_codex":0.0016274637,"about_ca_system_score_gemma":0.0015660743,"threshold_uncertainty_score":0.034416914},"labels":[],"label_agreement":null},{"id":"W2512194986","doi":"10.1007/978-3-540-28629-5_56","title":"Decidability of Trajectory-Based Equations","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Catenation; Decidability; Constructive; Computer science; Trajectory; Quotient; Integer (computer science); Algebra over a field; Discrete mathematics; Algorithm; Mathematics; Programming language; Pure mathematics","score_opus":0.01825032286877343,"score_gpt":0.2449511614274609,"score_spread":0.22670083855868747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512194986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10469787,0.0009021033,0.8417711,0.0032226094,0.00027541813,0.00020858622,0.0014518064,0.0014962783,0.045974176],"genre_scores_gemma":[0.8143623,0.0009996933,0.15011494,0.0008406319,0.00034927428,0.00038194365,0.003077211,0.0005509864,0.029323105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969817,0.0005898118,0.0002703961,0.00089908385,0.0008252401,0.00043373156],"domain_scores_gemma":[0.9892384,0.00875637,0.00033493084,0.00074234133,0.0007225776,0.00020540935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026044126,0.0009449585,0.0012652604,0.0009670938,0.0014243516,0.0038469173,0.0037458937,0.0022364822,0.007954646],"category_scores_gemma":[0.010900687,0.0012305967,0.0039261826,0.0015295073,0.003558596,0.010493542,0.003943022,0.0075255814,0.0008750131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006269407,0.000058318943,0.00044444698,0.00015923144,0.000046957484,0.00017142919,0.0006788,0.013632392,0.001527434,0.968286,0.0018109984,0.013121376],"study_design_scores_gemma":[0.00005333137,0.000012801677,0.00012391547,0.00002210426,0.000033216616,0.000063993066,0.00006721367,0.04897741,0.0017523988,0.94596845,0.0029098387,0.000015256979],"about_ca_topic_score_codex":0.0045184777,"about_ca_topic_score_gemma":0.0038554973,"teacher_disagreement_score":0.007954646,"about_ca_system_score_codex":0.003119016,"about_ca_system_score_gemma":0.0019541383,"threshold_uncertainty_score":0.02661097},"labels":[],"label_agreement":null},{"id":"W2515301419","doi":"10.1017/cbo9781139195768.011","title":"Synchronization","year":2009,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Synchronization (alternating current); Computer science; Parsing; Automaton; Theoretical computer science; Programming language; Computer network; Channel (broadcasting)","score_opus":0.012404575036208012,"score_gpt":0.1789077074443026,"score_spread":0.16650313240809458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515301419","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061696135,0.004658681,0.3025078,0.0023926238,0.002314,0.00024194481,0.00060847256,0.0018425547,0.6792643],"genre_scores_gemma":[0.30096552,0.007805186,0.10586242,0.0025357376,0.0017970606,0.00080863794,0.0015396146,0.0016638861,0.577022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871564,0.00027049024,0.00009673606,0.0004508405,0.0003187449,0.00014753302],"domain_scores_gemma":[0.99876404,0.00038918582,0.00007574031,0.00039116948,0.00030337725,0.00007658139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009430445,0.000910115,0.00066021056,0.0012565097,0.0016387563,0.0031952886,0.0011899167,0.0016856712,0.04156566],"category_scores_gemma":[0.0029949099,0.00048640257,0.0008311495,0.0011336029,0.0036778885,0.0051335245,0.0028477178,0.0019571371,0.014549465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026384136,0.000009918624,0.0000482912,0.00011274803,0.000008049508,0.00006528654,0.00039347884,0.0008326285,0.001724928,0.9557558,0.0114796925,0.029542852],"study_design_scores_gemma":[0.000024533449,0.000045876888,0.00011393353,0.000108449785,0.00001529767,0.00035316762,0.00015351751,0.0028765975,0.004057096,0.57988524,0.4123388,0.000027445647],"about_ca_topic_score_codex":0.0007040449,"about_ca_topic_score_gemma":0.0005668238,"teacher_disagreement_score":0.04156566,"about_ca_system_score_codex":0.0016379242,"about_ca_system_score_gemma":0.0011668146,"threshold_uncertainty_score":0.13905096},"labels":[],"label_agreement":null},{"id":"W2517333950","doi":"10.1017/etds.2014.5","title":"Suffix conjugates for a class of morphic subshifts","year":2014,"lang":"en","type":"article","venue":"Ergodic Theory and Dynamical Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Bijection; Closure (psychology); Class (philosophy); Morphism; Fixed point; Set (abstract data type); Suffix; Alphabet; Finite set","score_opus":0.005779104364594204,"score_gpt":0.21056211858217272,"score_spread":0.20478301421757852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517333950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80647594,0.00072462717,0.08177608,0.0005884403,0.00033571012,0.00010244182,0.0005619436,0.0010988847,0.10833586],"genre_scores_gemma":[0.9514299,0.00026857163,0.017549317,0.00029781743,0.00017784187,0.00011811804,0.00071338244,0.00025561792,0.029189507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999212,0.00008519061,0.00007402172,0.0002511721,0.00022062354,0.00015701828],"domain_scores_gemma":[0.99928385,0.00017423328,0.00011887822,0.00013568964,0.00016035716,0.00012707841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037823978,0.00047217248,0.00047104905,0.0015453324,0.0017973842,0.0029272328,0.00044913747,0.0010171977,0.0080743935],"category_scores_gemma":[0.0012851903,0.0003506239,0.00088158646,0.0007913584,0.0017916093,0.0017962722,0.0014681142,0.001119832,0.0016337826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068361354,0.000036809663,0.000692363,0.00003414603,0.0000089234645,0.0003874848,0.00055447867,0.00058191526,0.004869274,0.98241353,0.00076816767,0.009584604],"study_design_scores_gemma":[0.00008549904,0.00019338509,0.0021047923,0.00004886441,0.000042836917,0.001445668,0.00081692723,0.0119646145,0.014771909,0.9267003,0.04174285,0.00008234951],"about_ca_topic_score_codex":0.00074716884,"about_ca_topic_score_gemma":0.00049416075,"teacher_disagreement_score":0.0080743935,"about_ca_system_score_codex":0.0012418566,"about_ca_system_score_gemma":0.00053193513,"threshold_uncertainty_score":0.027011573},"labels":[],"label_agreement":null},{"id":"W2520022270","doi":"10.37236/6450","title":"Lower Bounds on Words Separation: Are There Short Identities in Transformation Semigroups?","year":2017,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Russian Foundation for Basic Research","keywords":"Unary operation; Mathematics; Combinatorics; Identity (music); Multiplicative function; Upper and lower bounds; Inverse; Identity function; Function (biology); Discrete mathematics; Constant (computer programming); Mathematical analysis; Geometry","score_opus":0.011733497705416334,"score_gpt":0.2718810865264232,"score_spread":0.26014758882100686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520022270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26667294,0.007154894,0.6552168,0.007750593,0.0007107059,0.00017748798,0.0010968562,0.0024869647,0.058732744],"genre_scores_gemma":[0.8260751,0.0029835368,0.14540432,0.0020759928,0.001501857,0.000581861,0.0019196846,0.0015430646,0.01791462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99406576,0.001042451,0.0004302145,0.0017523759,0.0015420907,0.0011671736],"domain_scores_gemma":[0.94054365,0.046826575,0.0024332234,0.0055822325,0.0024622579,0.0021519577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004027695,0.00166927,0.0023383386,0.0023299274,0.0030094176,0.0049335426,0.0039647776,0.0032786839,0.013598201],"category_scores_gemma":[0.041327674,0.0010678605,0.002576098,0.002705861,0.0057295947,0.020376215,0.005120266,0.00903252,0.0037290321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013752648,0.0005328744,0.0065654744,0.0010172729,0.00010405962,0.0005063973,0.001473244,0.036781564,0.014564496,0.80053806,0.01110855,0.12543276],"study_design_scores_gemma":[0.00005347369,0.00016834872,0.00082885794,0.00008408406,0.000058898302,0.00029120885,0.00014501926,0.06785398,0.0069049867,0.91855186,0.005002008,0.00005730684],"about_ca_topic_score_codex":0.00094675587,"about_ca_topic_score_gemma":0.001072668,"teacher_disagreement_score":0.013598201,"about_ca_system_score_codex":0.0031886734,"about_ca_system_score_gemma":0.001982646,"threshold_uncertainty_score":0.045490503},"labels":[],"label_agreement":null},{"id":"W2529230500","doi":"10.1007/978-3-319-53733-7_12","title":"Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Suffix; Concatenation (mathematics); Regular language; Computer science; Ideal (ethics); Generalized suffix tree; Mathematics; Discrete mathematics; Combinatorics; Suffix tree; Artificial intelligence; Linguistics; Automaton","score_opus":0.02190194143970756,"score_gpt":0.2560078981016194,"score_spread":0.23410595666191183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529230500","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7642075,0.0022202204,0.14968199,0.0076100044,0.00019189774,0.00010495813,0.0030813583,0.0008236832,0.072078384],"genre_scores_gemma":[0.96777904,0.00072508765,0.01418928,0.00033087604,0.000477398,0.00011798085,0.0018624483,0.00029189602,0.014225937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99652004,0.00064116734,0.00023719462,0.000757321,0.0012803393,0.00056387874],"domain_scores_gemma":[0.98265624,0.013377677,0.0011028672,0.0010467728,0.0008979544,0.0009184373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014227864,0.00077516015,0.0015358867,0.0015748896,0.0019238923,0.009876166,0.0029586551,0.0016775395,0.012466436],"category_scores_gemma":[0.011880222,0.00095101993,0.0017681842,0.0021597666,0.004073806,0.01662154,0.0032306383,0.003979398,0.0013331338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047731816,0.0001454972,0.0021261282,0.00030793974,0.00006063329,0.00029599367,0.0015554648,0.01914983,0.0029949788,0.9512086,0.005052191,0.016625466],"study_design_scores_gemma":[0.000030297979,0.000015303382,0.00036008217,0.000012736787,0.000016277429,0.00012213406,0.00011734848,0.023634577,0.0007289046,0.97400624,0.0009357581,0.0000203444],"about_ca_topic_score_codex":0.0018756854,"about_ca_topic_score_gemma":0.0016170348,"teacher_disagreement_score":0.012466436,"about_ca_system_score_codex":0.00392219,"about_ca_system_score_gemma":0.0021607245,"threshold_uncertainty_score":0.041704357},"labels":[],"label_agreement":null},{"id":"W2529588972","doi":"10.46298/dmtcs.1343","title":"Most Complex Regular Ideal Languages","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quotient; Ideal (ethics); Alphabet; Class (philosophy); Regular language; Quotient algebra","score_opus":0.012728167214424515,"score_gpt":0.2622929057545596,"score_spread":0.24956473854013508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529588972","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75194466,0.0003359636,0.201118,0.0011931851,0.00006993323,0.00014868523,0.0011543678,0.0010118061,0.043023523],"genre_scores_gemma":[0.9563352,0.00012560385,0.035661515,0.0001454054,0.00010318164,0.00013269775,0.0006446572,0.00012473423,0.0067270086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792767,0.00030783005,0.00018478517,0.0006197706,0.0006906145,0.00026940726],"domain_scores_gemma":[0.9933028,0.002986645,0.00091390946,0.0011430995,0.0010259869,0.00062750705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011677103,0.00035406149,0.0005126885,0.00093731994,0.001518955,0.003154053,0.00071663724,0.00053481496,0.005818051],"category_scores_gemma":[0.0049061878,0.00046921687,0.00091304595,0.00055971945,0.0031565996,0.0055748955,0.002494743,0.0013037235,0.0007282773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002713381,0.00006216078,0.0038395822,0.000119690936,0.000032915257,0.00025834312,0.0020022804,0.002696427,0.0154443635,0.9601841,0.001562222,0.01352658],"study_design_scores_gemma":[0.00004859924,0.0001299093,0.0038928369,0.000037698257,0.00004943382,0.0009739844,0.00094617443,0.024005786,0.019620689,0.92904365,0.021171814,0.000079566766],"about_ca_topic_score_codex":0.00043114505,"about_ca_topic_score_gemma":0.00049061293,"teacher_disagreement_score":0.005818051,"about_ca_system_score_codex":0.0012529239,"about_ca_system_score_gemma":0.0006997642,"threshold_uncertainty_score":0.0194633},"labels":[],"label_agreement":null},{"id":"W2536714351","doi":"10.1007/978-3-319-53733-7_21","title":"On Finite-Index Indexed Grammars and Their Restrictions","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Decidability; Rule-based machine translation; Bounded function; Indexed grammar; Discrete mathematics; Index (typography); Mathematics; Combinatorics; Computer science; Programming language; Artificial intelligence; Tree-adjoining grammar; Context-free grammar; Mathematical analysis","score_opus":0.016311217695042193,"score_gpt":0.2358414698239249,"score_spread":0.21953025212888272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536714351","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13331656,0.0065290234,0.37125182,0.0047523757,0.0008695146,0.00011031363,0.0012626622,0.00088125473,0.48102653],"genre_scores_gemma":[0.7916793,0.008907959,0.07024966,0.0013430683,0.0021635226,0.0003989636,0.003522358,0.0009920383,0.120743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984908,0.00037004153,0.00010969946,0.0002772326,0.000536274,0.0002159716],"domain_scores_gemma":[0.9969829,0.0020120502,0.0001584132,0.00044091124,0.00023442405,0.00017140184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001163276,0.000852325,0.0011717834,0.0017231135,0.0019122508,0.003848336,0.0018876988,0.0015354333,0.011502553],"category_scores_gemma":[0.0047160652,0.0011248845,0.0015024472,0.003644681,0.0050948155,0.010850254,0.0039185276,0.00592709,0.003497778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018057966,0.000017432183,0.00008471711,0.000029243127,0.0000040972513,0.000078303456,0.00030607614,0.0006278218,0.00043425424,0.9898392,0.0012903867,0.0072703892],"study_design_scores_gemma":[0.0000034082368,0.0000036653023,0.000064682434,0.000009564244,0.0000025488177,0.000063021456,0.00004408225,0.0010234901,0.00014097914,0.9955012,0.0031379517,0.000005378523],"about_ca_topic_score_codex":0.0015294293,"about_ca_topic_score_gemma":0.0010959243,"teacher_disagreement_score":0.011502553,"about_ca_system_score_codex":0.0014502648,"about_ca_system_score_gemma":0.0010272078,"threshold_uncertainty_score":0.038479924},"labels":[],"label_agreement":null},{"id":"W2538425405","doi":"10.1016/j.tcs.2016.10.005","title":"Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fibonacci number; Computer science; Algorithm; Combinatorics; Mathematics; Artificial intelligence","score_opus":0.010856704063362848,"score_gpt":0.2600031196010287,"score_spread":0.24914641553766584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2538425405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09093884,0.0008242608,0.89325315,0.0012772125,0.00017871441,0.00014531153,0.00019079648,0.0003252872,0.012866425],"genre_scores_gemma":[0.60611475,0.00081366755,0.37258533,0.0005721698,0.00030871382,0.00039737325,0.00072101626,0.00029333265,0.01819367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764854,0.0007383147,0.00019847778,0.00057493156,0.00055688043,0.00028284563],"domain_scores_gemma":[0.9853968,0.011812475,0.0006133443,0.0007606317,0.0009468228,0.00046998716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027552198,0.000696236,0.0010191023,0.0017188314,0.0017716711,0.003755278,0.0023142903,0.0015051119,0.0069926055],"category_scores_gemma":[0.014374397,0.0006111882,0.0014954823,0.0018330109,0.0024632765,0.005685109,0.0028487,0.0034430628,0.0008863262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021620859,0.0000788069,0.0008626292,0.00015714142,0.000029802897,0.000044913526,0.00041017716,0.015832193,0.0013308473,0.92471415,0.0026481424,0.053675033],"study_design_scores_gemma":[0.00003167858,0.000034745095,0.000109395325,0.000024322931,0.00001539609,0.0000493002,0.000070585615,0.067378454,0.00093185715,0.92983603,0.0015028352,0.000015377718],"about_ca_topic_score_codex":0.001363463,"about_ca_topic_score_gemma":0.0017119886,"teacher_disagreement_score":0.0069926055,"about_ca_system_score_codex":0.002448619,"about_ca_system_score_gemma":0.0019804952,"threshold_uncertainty_score":0.023392618},"labels":[],"label_agreement":null},{"id":"W2547353811","doi":"10.1007/978-3-319-46376-6_6","title":"Descriptional Complexity of Error Detection","year":2016,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Neighbourhood (mathematics); Prefix; Automaton; Regular language; Computer science; String (physics); Algorithm; Finite-state machine; Mathematics; Theoretical computer science; Discrete mathematics; Linguistics","score_opus":0.11137692888721303,"score_gpt":0.2852576581418257,"score_spread":0.17388072925461268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547353811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068302006,0.007328944,0.80348986,0.01007259,0.0005005473,0.000089548514,0.0008937447,0.00046024137,0.10886248],"genre_scores_gemma":[0.8912647,0.0044319993,0.082970165,0.00071292964,0.0010655881,0.0002819924,0.0008133969,0.0002761084,0.018183269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99530005,0.0015060144,0.00036889192,0.0006691581,0.0017796784,0.00037615674],"domain_scores_gemma":[0.98210835,0.013554979,0.0005972575,0.0021051895,0.0013482119,0.0002860436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032340612,0.00073574984,0.0011457327,0.001516446,0.0012933636,0.0071309865,0.0023301933,0.002397587,0.007801377],"category_scores_gemma":[0.020711126,0.0008607362,0.0014606905,0.0018900593,0.005354817,0.012132211,0.0030409864,0.0047057923,0.0009301876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013105954,0.0000072306407,0.00012149027,0.000051197552,0.000009155985,0.000024746163,0.000101220074,0.0037028666,0.00017998181,0.9882273,0.0011565761,0.0064051165],"study_design_scores_gemma":[0.0000026191522,0.0000025900308,0.000046937006,0.000009227526,0.0000036273896,0.00002813277,0.000016474916,0.012538424,0.00012684273,0.9860707,0.0011487555,0.000005780785],"about_ca_topic_score_codex":0.0013032474,"about_ca_topic_score_gemma":0.0007856637,"teacher_disagreement_score":0.007801377,"about_ca_system_score_codex":0.0036771318,"about_ca_system_score_gemma":0.0017336196,"threshold_uncertainty_score":0.026679575},"labels":[],"label_agreement":null},{"id":"W2551783230","doi":"10.1142/s1793042118501099","title":"D-finite numbers","year":2018,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Class (philosophy); Algebraic number; Polynomial; Field (mathematics); Point (geometry); Constant (computer programming); Algebraic number field; Differential (mechanical device); Real number","score_opus":0.010393281732494403,"score_gpt":0.2805275340452899,"score_spread":0.27013425231279553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551783230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20170696,0.010496037,0.55212873,0.0028083762,0.001410665,0.00014311938,0.0008032753,0.0006482556,0.22985463],"genre_scores_gemma":[0.83530825,0.0031017708,0.13394658,0.0010325933,0.00060035597,0.00020470447,0.00050323975,0.00014319336,0.025159448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904364,0.0001656495,0.00010311065,0.00032692865,0.00026376973,0.000096809],"domain_scores_gemma":[0.99814224,0.0008638702,0.00018688838,0.00029335544,0.00032051036,0.00019308033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009467329,0.0005133264,0.0003957879,0.0017961868,0.0010302573,0.0026285918,0.0005805848,0.00074860814,0.0036360195],"category_scores_gemma":[0.0042667715,0.00020189444,0.0004830695,0.0008889777,0.0035786356,0.0047580577,0.0018894946,0.0017529733,0.0011010708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013666646,0.0000048048887,0.00030617643,0.00002856556,0.0000022584366,0.000060264247,0.00017769937,0.00030610754,0.00085297204,0.99002856,0.0005619365,0.007656799],"study_design_scores_gemma":[0.0000071146624,0.000030773925,0.00048280694,0.00006338666,0.0000060762663,0.00048968685,0.00016665747,0.0051958095,0.0026144902,0.9266435,0.06427867,0.000021042928],"about_ca_topic_score_codex":0.00044927734,"about_ca_topic_score_gemma":0.00022191646,"teacher_disagreement_score":0.0036360195,"about_ca_system_score_codex":0.0013853045,"about_ca_system_score_gemma":0.00044851308,"threshold_uncertainty_score":0.012163758},"labels":[],"label_agreement":null},{"id":"W2559784680","doi":"10.4153/cmb-2016-093-7","title":"On Radicals of Green’s Relations in Ordered Semigroups","year":2016,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Semigroup; Radical; Pure mathematics; Special classes of semigroups; Simple (philosophy); Chemistry; Epistemology; Organic chemistry","score_opus":0.007200642009731801,"score_gpt":0.19841702331749586,"score_spread":0.19121638130776406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559784680","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6421656,0.0032296453,0.28085768,0.0017028372,0.00085704,0.0001171994,0.00040756923,0.0003902895,0.070272185],"genre_scores_gemma":[0.9464622,0.0006320549,0.042943902,0.0002491147,0.00044970066,0.00007440834,0.00012531244,0.00007733245,0.008985869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988632,0.00029399348,0.00009339837,0.00023966894,0.00032066292,0.0001891105],"domain_scores_gemma":[0.9974516,0.0011570826,0.00040393934,0.00026511966,0.00037779188,0.00034445792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016609321,0.00032113085,0.00039508054,0.0016033808,0.0014631748,0.0018852593,0.00044033478,0.00047076942,0.003545993],"category_scores_gemma":[0.0022381395,0.00024994643,0.0005939858,0.00072814163,0.0033652335,0.0042981226,0.0017339529,0.0011629403,0.00035274602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049210765,0.000013952613,0.00030375624,0.00003314208,0.0000056473846,0.00016809156,0.000971747,0.00039199815,0.003944857,0.9880106,0.00042175435,0.005685312],"study_design_scores_gemma":[0.000034290857,0.000074141324,0.0006691136,0.000033251785,0.000015382531,0.00032561048,0.00049565174,0.004008201,0.0028979224,0.97641903,0.014995105,0.00003234624],"about_ca_topic_score_codex":0.0006201855,"about_ca_topic_score_gemma":0.0006576198,"teacher_disagreement_score":0.003545993,"about_ca_system_score_codex":0.00086647377,"about_ca_system_score_gemma":0.00046299488,"threshold_uncertainty_score":0.011862576},"labels":[],"label_agreement":null},{"id":"W2562450072","doi":"10.1515/puma-2015-0008","title":"Enumeration and Automatic Sequences","year":2015,"lang":"en","type":"article","venue":"Pure mathematics and applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Enumeration; Sequence (biology); Automaton; Finite-state machine; Generating function; State (computer science); Function (biology); Combinatorics; Computer science; Base (topology); Algorithm; Mathematics; Discrete mathematics; Theoretical computer science; Biology; Genetics","score_opus":0.02117350694330332,"score_gpt":0.25226926973511526,"score_spread":0.23109576279181193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562450072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3266282,0.0018918617,0.6247824,0.0006983853,0.00021603834,0.00010432733,0.0005910817,0.0011314235,0.043956317],"genre_scores_gemma":[0.8698234,0.00069944543,0.117369495,0.00015494908,0.00019562141,0.0001902728,0.00077578676,0.0001417698,0.0106493225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862456,0.00040954142,0.00014524497,0.00033201085,0.0003585129,0.0001300818],"domain_scores_gemma":[0.99535596,0.0026762711,0.00053426507,0.00059229217,0.00066127855,0.00017990558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066418864,0.0004038741,0.0004986331,0.00146686,0.00075483206,0.0014332619,0.00066091376,0.00059956615,0.004467099],"category_scores_gemma":[0.0047321385,0.00030215332,0.0005503443,0.0012254389,0.0014939657,0.0027349177,0.0012191753,0.0008840128,0.00093900575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089923284,0.000037434766,0.0010774947,0.00016164717,0.000012672021,0.00017577402,0.00039533808,0.010157583,0.009730341,0.92912984,0.0013240129,0.047707926],"study_design_scores_gemma":[0.000010641688,0.00004038269,0.00035622425,0.000043047286,0.0000075656867,0.000226328,0.00006218787,0.03919625,0.0051357085,0.9457955,0.0091013,0.000024924862],"about_ca_topic_score_codex":0.00046721782,"about_ca_topic_score_gemma":0.0005594997,"teacher_disagreement_score":0.004467099,"about_ca_system_score_codex":0.000631426,"about_ca_system_score_gemma":0.0006084348,"threshold_uncertainty_score":0.014943957},"labels":[],"label_agreement":null},{"id":"W2568552169","doi":"10.1016/j.ic.2012.10.008","title":"Generic expression hardness results for primitive positive formula comparison","year":2012,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación","keywords":"Trichotomy (philosophy); Equivalence (formal languages); Mathematics; Expression (computer science); Discrete mathematics; Pure mathematics; Computer science","score_opus":0.02384311133039244,"score_gpt":0.2827658495853759,"score_spread":0.2589227382549834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568552169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16087373,0.0019556151,0.7168034,0.009911763,0.0006638365,0.0003895692,0.0020740826,0.002654932,0.10467303],"genre_scores_gemma":[0.8577325,0.0012498231,0.108734146,0.0022865478,0.0011077182,0.0005233453,0.002379927,0.0011021985,0.024883887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992156,0.0013715385,0.00048495378,0.0022657998,0.002726665,0.0009950137],"domain_scores_gemma":[0.9752435,0.017948594,0.0007690315,0.004292362,0.0010851395,0.00066133455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037627583,0.0016111617,0.003162228,0.002110254,0.003543448,0.0061817537,0.0071316184,0.0035891642,0.021810409],"category_scores_gemma":[0.019691568,0.0013923721,0.004621562,0.0044456185,0.00725595,0.02938908,0.008487346,0.012290577,0.001847892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036719485,0.00016308071,0.00069279526,0.0004357664,0.00008886913,0.00023447369,0.00054023066,0.0077952114,0.0020041058,0.956744,0.007204612,0.02372961],"study_design_scores_gemma":[0.00004156823,0.000029172887,0.00023535098,0.00002389502,0.000069180656,0.00014058877,0.00005671266,0.013000552,0.0012475852,0.9820701,0.0030607379,0.000024571915],"about_ca_topic_score_codex":0.0013537317,"about_ca_topic_score_gemma":0.0015582955,"teacher_disagreement_score":0.021810409,"about_ca_system_score_codex":0.004001747,"about_ca_system_score_gemma":0.0021335313,"threshold_uncertainty_score":0.07296312},"labels":[],"label_agreement":null},{"id":"W2570053645","doi":"10.1142/s0129054112400448","title":"ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Waterloo","funders":"","keywords":"Decidability; Enumeration; Recursively enumerable language; Mathematics; Combinatorics; Class (philosophy); Discrete mathematics; Function (biology); Sequence (biology); Computer science; Biology; Artificial intelligence","score_opus":0.023064990121982428,"score_gpt":0.27846263967602103,"score_spread":0.2553976495540386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570053645","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5097392,0.0005943916,0.44829467,0.0007935938,0.00007621153,0.000090154375,0.00042206558,0.0011233196,0.03886637],"genre_scores_gemma":[0.93673897,0.00024950248,0.056232184,0.000115680414,0.0001006048,0.00012245268,0.00049076293,0.00011634666,0.0058334004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840254,0.00038327664,0.00015983907,0.0004242983,0.00040636933,0.00022367897],"domain_scores_gemma":[0.9915759,0.006455371,0.0006909456,0.00068150164,0.0004028467,0.00019348014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063018,0.00046258437,0.00039580735,0.00094851514,0.0010993404,0.0019160504,0.0011753136,0.000693583,0.0036777123],"category_scores_gemma":[0.006650012,0.00042899413,0.0010782866,0.001032865,0.0025402678,0.00432832,0.0014268558,0.0018361072,0.00043602465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014469038,0.00011462281,0.0021903766,0.00019707561,0.000023091916,0.00052292226,0.0011246854,0.01685335,0.016346708,0.926371,0.0011285216,0.034982923],"study_design_scores_gemma":[0.00002323124,0.000048800044,0.0005640399,0.000037325408,0.000019367419,0.00040654547,0.00015142836,0.05186465,0.01278738,0.93014795,0.0039185206,0.00003082154],"about_ca_topic_score_codex":0.0006543523,"about_ca_topic_score_gemma":0.0008350373,"teacher_disagreement_score":0.0036777123,"about_ca_system_score_codex":0.0011410922,"about_ca_system_score_gemma":0.0007205314,"threshold_uncertainty_score":0.012303233},"labels":[],"label_agreement":null},{"id":"W2570386222","doi":"10.1142/s0218196709005330","title":"A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS","year":2009,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Fibonacci number; Class (philosophy); Set (abstract data type); Discrete mathematics; Finite set; Automaton; Sequence (biology); Regular language; Decision problem; Algebra over a field; Arithmetic; Combinatorics; Pure mathematics; Theoretical computer science; Algorithm; Artificial intelligence; Computer science","score_opus":0.01046059632410859,"score_gpt":0.2923544748404146,"score_spread":0.281893878516306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570386222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.458602,0.0004209786,0.5243186,0.003946393,0.00020134405,0.00047057302,0.0007087445,0.0006032224,0.010728128],"genre_scores_gemma":[0.81323284,0.00025950733,0.17797478,0.00042749874,0.00018211856,0.00029533877,0.0010043506,0.000101334575,0.006522243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99573576,0.0012593041,0.0003704535,0.0014334982,0.00053379044,0.0006671337],"domain_scores_gemma":[0.98402435,0.013435843,0.0006141635,0.00052192365,0.0006586041,0.00074510643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004313226,0.0005628604,0.0012012235,0.0006395832,0.0021753202,0.0049096486,0.0020154966,0.0025004845,0.005828309],"category_scores_gemma":[0.015707579,0.0006874537,0.0016870213,0.0007196293,0.0040207915,0.0064013544,0.002498228,0.0024877423,0.0005389839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015982414,0.00049038936,0.0028333492,0.0006995206,0.00015540469,0.0011559821,0.0017390506,0.08928922,0.01034395,0.8343298,0.0050961147,0.05226893],"study_design_scores_gemma":[0.0002263824,0.00022278128,0.00040668837,0.000055057004,0.00006476112,0.00021872099,0.0005371308,0.20533732,0.007293093,0.78286433,0.0026996841,0.000074081785],"about_ca_topic_score_codex":0.0017144106,"about_ca_topic_score_gemma":0.001294593,"teacher_disagreement_score":0.005828309,"about_ca_system_score_codex":0.0022203245,"about_ca_system_score_gemma":0.0019832067,"threshold_uncertainty_score":0.022810817},"labels":[],"label_agreement":null},{"id":"W2570565098","doi":"10.1142/s0129054105003273","title":"WORDS AVOIDING $\\frac{7}{3}$-POWERS AND THE THUE–MORSE MORPHISM","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Mathematics; Complement (music); Morse code; Word (group theory); Combinatorics; Identity (music); Term (time); Combinatorics on words; Binary number; Discrete mathematics; Pure mathematics; Arithmetic; Computer science; Physics; Geometry","score_opus":0.009880745572070696,"score_gpt":0.27315879649748337,"score_spread":0.2632780509254127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570565098","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.750015,0.0013538464,0.14236157,0.0009715531,0.0003460892,0.0000700169,0.00010633421,0.00039365972,0.10438185],"genre_scores_gemma":[0.94796675,0.00036055926,0.022100398,0.00018080125,0.00017004607,0.00008600077,0.000077575874,0.00013225684,0.0289256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951756,0.000090392954,0.000035995563,0.00011073318,0.00012395534,0.00012136402],"domain_scores_gemma":[0.99880624,0.0005341415,0.00017163673,0.00016679574,0.00019587291,0.00012527953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051185593,0.00039192985,0.0005291969,0.00088721677,0.00196164,0.001669146,0.00045913976,0.0008234559,0.0064835865],"category_scores_gemma":[0.002483356,0.00039400224,0.0005734444,0.0004875326,0.002735269,0.0032706792,0.00187381,0.0010044622,0.0013958426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010417483,0.000016365988,0.0003787256,0.000049652343,0.000008931487,0.00041208215,0.00083034905,0.00096317445,0.0042492975,0.9792605,0.00074520754,0.0129815815],"study_design_scores_gemma":[0.000023797273,0.00004538042,0.00045863775,0.000036322792,0.000015564065,0.00049936364,0.00034117798,0.00338428,0.0052252426,0.9746012,0.015336588,0.000032421965],"about_ca_topic_score_codex":0.0005807041,"about_ca_topic_score_gemma":0.00074601517,"teacher_disagreement_score":0.0064835865,"about_ca_system_score_codex":0.00065665314,"about_ca_system_score_gemma":0.00035314573,"threshold_uncertainty_score":0.021689773},"labels":[],"label_agreement":null},{"id":"W2574656611","doi":"","title":"A Note on Roman Bondage Number of Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.007521313394551624,"score_gpt":0.2396196506465457,"score_spread":0.23209833725199408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574656611","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05625276,0.01720959,0.11569794,0.0136118485,0.01648976,0.00008217269,0.0009563216,0.0007841706,0.7789154],"genre_scores_gemma":[0.80281836,0.011489492,0.07642316,0.004688423,0.0081332885,0.00026221946,0.00081404543,0.0007192412,0.09465177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989711,0.00032090957,0.000058777903,0.00027775246,0.00025917435,0.00011233767],"domain_scores_gemma":[0.99723464,0.0015592077,0.00019082542,0.00036797862,0.00034148456,0.00030590344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012051245,0.0006180109,0.0009529269,0.0025429633,0.0020093236,0.0026261942,0.001396794,0.0012511916,0.022445865],"category_scores_gemma":[0.0066181296,0.00038683412,0.00069323374,0.0020775225,0.003185135,0.0062035993,0.002533536,0.0036865952,0.0049335193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050010578,0.000014402907,0.00017803317,0.00011565101,0.0000067566066,0.00008011714,0.000113143506,0.0005618493,0.00058211386,0.9741033,0.012159029,0.012035717],"study_design_scores_gemma":[0.000007825303,0.000021123446,0.0002610103,0.000038227226,0.000008453661,0.00015323868,0.000045227687,0.0013620761,0.00041189566,0.959291,0.038381334,0.000018686906],"about_ca_topic_score_codex":0.00083821896,"about_ca_topic_score_gemma":0.0009861623,"teacher_disagreement_score":0.022445865,"about_ca_system_score_codex":0.0011219655,"about_ca_system_score_gemma":0.00061946746,"threshold_uncertainty_score":0.07508886},"labels":[],"label_agreement":null},{"id":"W2574983858","doi":"","title":"Split graphs whose completely regular endomorphisms form a monoid.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Endomorphism; Mathematics; Monoid; Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.012409645097022711,"score_gpt":0.2139522759062076,"score_spread":0.2015426308091849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574983858","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60193986,0.0011660168,0.28936332,0.0012066842,0.00043147276,0.000099435216,0.00095414295,0.0007994882,0.1040396],"genre_scores_gemma":[0.93786657,0.0002791255,0.036965977,0.0003214227,0.00010375633,0.00008668901,0.0006271101,0.0001289811,0.023620214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993574,0.00014048161,0.00005233973,0.00020692968,0.00013229536,0.00011066054],"domain_scores_gemma":[0.99846953,0.00053881493,0.00020593352,0.0003334967,0.00022871738,0.00022340403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000709038,0.00036421712,0.000477036,0.001202685,0.0014920656,0.0023914317,0.0006004119,0.00085237663,0.0065526986],"category_scores_gemma":[0.0018456515,0.00054104044,0.0007243107,0.00074166636,0.0021465528,0.0050988845,0.0021845605,0.0010299718,0.0012237652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006438796,0.000023495213,0.00059333927,0.00003154883,0.00001320049,0.00021987058,0.00042792843,0.00035380185,0.0025878628,0.9879431,0.0013181934,0.0064232345],"study_design_scores_gemma":[0.000017452712,0.000023440194,0.0004249382,0.000018879451,0.000015781066,0.00037146037,0.0002911225,0.002421927,0.0018657265,0.98660856,0.0079278145,0.000012950387],"about_ca_topic_score_codex":0.00040647291,"about_ca_topic_score_gemma":0.00075013953,"teacher_disagreement_score":0.0065526986,"about_ca_system_score_codex":0.00065823586,"about_ca_system_score_gemma":0.0005371425,"threshold_uncertainty_score":0.021920979},"labels":[],"label_agreement":null},{"id":"W2578144384","doi":"10.4204/eptcs.31.18","title":"Transformations Between Different Types of Unranked Bottom-Up Tree Automata","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Tree automaton; Automaton; Tree (set theory); String (physics); Mathematics; Computer science; State (computer science); Combinatorics; Theoretical computer science; Discrete mathematics; Algorithm","score_opus":0.0052680346812756865,"score_gpt":0.2312247567987587,"score_spread":0.22595672211748302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578144384","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26470926,0.00040839188,0.7143339,0.00032056653,0.00017288238,0.00018546476,0.00047108185,0.0017452636,0.017653244],"genre_scores_gemma":[0.8875994,0.00019569343,0.105834246,0.00011349427,0.000071165014,0.00016165622,0.0005593703,0.00026035227,0.0052045705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963875,0.0007070779,0.00041889865,0.0008055739,0.0012332628,0.0004477009],"domain_scores_gemma":[0.9902519,0.005632551,0.0007543413,0.0021905098,0.000869215,0.00030159624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011776456,0.00051157083,0.00057897845,0.0011463348,0.00088778714,0.0033796965,0.0015190346,0.00092055567,0.00665628],"category_scores_gemma":[0.009066284,0.00044265963,0.0019114318,0.0009833331,0.002042927,0.006034314,0.0017990146,0.002129054,0.00094503775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022737349,0.00018016268,0.001500907,0.00023537745,0.00006625376,0.0010083419,0.0009322823,0.066697374,0.018386126,0.86025244,0.00114695,0.04936632],"study_design_scores_gemma":[0.000030483647,0.000093639144,0.00044969728,0.000032553475,0.000052999338,0.0003592288,0.00013873033,0.17206623,0.018531417,0.8047389,0.003459815,0.00004625626],"about_ca_topic_score_codex":0.0006384276,"about_ca_topic_score_gemma":0.00073168083,"teacher_disagreement_score":0.00665628,"about_ca_system_score_codex":0.0011502485,"about_ca_system_score_gemma":0.0006232796,"threshold_uncertainty_score":0.02226752},"labels":[],"label_agreement":null},{"id":"W2578735002","doi":"10.4204/eptcs.31.12","title":"Transition Complexity of Incomplete DFAs","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Multiplicative function; Intersection (aeronautics); Finite-state machine; Computational complexity theory; Upper and lower bounds; Descriptive complexity theory; State (computer science); Discrete mathematics; Automaton; Average-case complexity; Time complexity; Computer science; Theoretical computer science; Algorithm","score_opus":0.007691240734273789,"score_gpt":0.23088464506836429,"score_spread":0.2231934043340905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578735002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6307605,0.0004834573,0.3582959,0.0006195165,0.000041668456,0.000088732704,0.0012338287,0.00043300557,0.008043453],"genre_scores_gemma":[0.9770586,0.00018935696,0.020081632,0.000036593352,0.000025831463,0.00008228818,0.000616756,0.00005428977,0.0018544768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997891,0.00036103284,0.00021907577,0.00047908307,0.00073243486,0.00031738653],"domain_scores_gemma":[0.9883659,0.007851004,0.0010780876,0.0010505632,0.0012077423,0.00044668358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012263014,0.00031594376,0.0007716759,0.0014428317,0.00079473836,0.0028209744,0.0010748759,0.0006660542,0.003146229],"category_scores_gemma":[0.010930711,0.00029265461,0.0012631617,0.0010227944,0.001511874,0.0064010913,0.001331779,0.0015545313,0.00021549608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024224988,0.00007709519,0.00546323,0.0002586071,0.000087464505,0.00029312744,0.00071823865,0.21058895,0.00661352,0.75073665,0.0008297459,0.024091227],"study_design_scores_gemma":[0.000018696966,0.000043437845,0.0012046987,0.00002190166,0.000037934526,0.00011431847,0.00010812107,0.41057768,0.0035267517,0.5823136,0.0020010034,0.000031735526],"about_ca_topic_score_codex":0.0030543678,"about_ca_topic_score_gemma":0.0020366411,"teacher_disagreement_score":0.003146229,"about_ca_system_score_codex":0.002836186,"about_ca_system_score_gemma":0.001285584,"threshold_uncertainty_score":0.020578027},"labels":[],"label_agreement":null},{"id":"W2582188091","doi":"10.1142/s0129054116500349","title":"State Complexity of Insertion","year":2016,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Algorithm; Computer science","score_opus":0.032465811927913014,"score_gpt":0.3026928864660438,"score_spread":0.2702270745381308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582188091","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5034271,0.00078688347,0.4302968,0.0064020134,0.00021256534,0.00046626592,0.0040897345,0.005392327,0.04892634],"genre_scores_gemma":[0.9176138,0.0004124312,0.06177216,0.00058240443,0.00013875836,0.00044289546,0.0028678314,0.0015017422,0.014668095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9899664,0.0018204125,0.0007362233,0.0020311498,0.0031000134,0.0023459152],"domain_scores_gemma":[0.95161694,0.037071973,0.002225513,0.005317131,0.00284082,0.0009276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034540668,0.0008566415,0.001658245,0.0014618726,0.0023546752,0.007361904,0.004030559,0.0029733838,0.019944971],"category_scores_gemma":[0.03164541,0.0013696933,0.0040850034,0.0020701163,0.003888774,0.013235315,0.0047828904,0.0043228013,0.0024377797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020794575,0.000502669,0.010777322,0.0014404448,0.000271586,0.000954587,0.0026689079,0.21834213,0.022126017,0.64435405,0.010655258,0.08582763],"study_design_scores_gemma":[0.000120599245,0.00017582164,0.0015135575,0.00007268742,0.00017884455,0.00036047437,0.000306666,0.37435332,0.01448086,0.6032894,0.0050349417,0.00011285362],"about_ca_topic_score_codex":0.0057415487,"about_ca_topic_score_gemma":0.005073438,"teacher_disagreement_score":0.019944971,"about_ca_system_score_codex":0.0048853755,"about_ca_system_score_gemma":0.005143765,"threshold_uncertainty_score":0.06672257},"labels":[],"label_agreement":null},{"id":"W2585141159","doi":"10.1016/j.jcss.2017.02.001","title":"State complexity of operations on input-driven pushdown automata","year":2017,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Combinatorics; State (computer science); Discrete mathematics; Mathematics; Alphabet; Automaton; Regular language; Star (game theory); Pushdown automaton; Finite-state machine; Computer science; Algorithm; Theoretical computer science","score_opus":0.05344652619702596,"score_gpt":0.29515263919310697,"score_spread":0.24170611299608102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585141159","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85407877,0.00025986382,0.13579078,0.000830699,0.000046746874,0.000073455885,0.00071681995,0.00038471547,0.00781821],"genre_scores_gemma":[0.9912005,0.00009465218,0.006514321,0.000039495302,0.00003742915,0.000054967044,0.0003273687,0.00007776029,0.0016534269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672973,0.00073417765,0.0002853953,0.00053213205,0.0009878308,0.00073069136],"domain_scores_gemma":[0.9473689,0.044427313,0.0020553614,0.0024157981,0.002265301,0.0014674134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002212425,0.00069832784,0.0016630848,0.0016519396,0.001296397,0.006967764,0.0019385243,0.0016391043,0.008261859],"category_scores_gemma":[0.020719044,0.0007419816,0.0015177694,0.0016433812,0.0026682827,0.009694898,0.0027651873,0.0026391563,0.00038179877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001155109,0.0003246872,0.0061181015,0.00030290868,0.00012211679,0.00048667841,0.00132853,0.20170279,0.010607426,0.75544155,0.0017299391,0.020680223],"study_design_scores_gemma":[0.000060839677,0.00007132136,0.0009927874,0.0000148730915,0.000043190495,0.000072262694,0.0001503393,0.46415564,0.0034865828,0.53059906,0.00031305355,0.000039997773],"about_ca_topic_score_codex":0.0031712807,"about_ca_topic_score_gemma":0.0024275698,"teacher_disagreement_score":0.008261859,"about_ca_system_score_codex":0.0029478623,"about_ca_system_score_gemma":0.002370953,"threshold_uncertainty_score":0.027638674},"labels":[],"label_agreement":null},{"id":"W2585527963","doi":"10.37236/6915","title":"Counting Lyndon Factors","year":2017,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Combinatorics; Fibonacci number; Mathematics; Word (group theory); Counterexample; Golden ratio; Upper and lower bounds; Combinatorics on words; Alphabet; Word length; Discrete mathematics; Computer science; Philosophy","score_opus":0.010469131315584097,"score_gpt":0.2396999400641482,"score_spread":0.22923080874856408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585527963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30818617,0.0068933363,0.579721,0.0017308366,0.0008657143,0.00035502794,0.002290538,0.0015246337,0.09843288],"genre_scores_gemma":[0.83441323,0.0022251217,0.12838106,0.00075219426,0.00056258973,0.0006042659,0.0021415015,0.00083645707,0.03008351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99682766,0.00046401346,0.000297053,0.00092815125,0.0009270207,0.00055601436],"domain_scores_gemma":[0.9904221,0.005733101,0.0009779277,0.0012520591,0.0011219328,0.00049289095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018405643,0.0012707846,0.0017407624,0.0024543456,0.0030596938,0.003885748,0.0017820895,0.002086425,0.018505588],"category_scores_gemma":[0.019020673,0.0010115427,0.001972866,0.0016119335,0.0032116538,0.01095084,0.002466075,0.0018928996,0.003437578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008475053,0.00010400075,0.00945305,0.0009370361,0.000110431094,0.001138974,0.0014146902,0.015044834,0.018091556,0.8479962,0.009040923,0.09582075],"study_design_scores_gemma":[0.000053406995,0.00016582808,0.0014712656,0.00025372434,0.00008735685,0.0016096608,0.0003194578,0.031837255,0.009957256,0.9206824,0.03344188,0.00012047646],"about_ca_topic_score_codex":0.0013288441,"about_ca_topic_score_gemma":0.0016082312,"teacher_disagreement_score":0.018505588,"about_ca_system_score_codex":0.0017910218,"about_ca_system_score_gemma":0.0011983424,"threshold_uncertainty_score":0.06190741},"labels":[],"label_agreement":null},{"id":"W2585764344","doi":"10.1016/j.tcs.2017.02.012","title":"Abelian-square-rich words","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Square (algebra); Abelian group; Combinatorics; Algebra over a field; Pure mathematics; Geometry","score_opus":0.012208342314047174,"score_gpt":0.2651676796845346,"score_spread":0.2529593373704874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585764344","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6789692,0.0010429422,0.17574896,0.002416404,0.00047917245,0.00009031599,0.0009632015,0.0014891903,0.13880059],"genre_scores_gemma":[0.9640741,0.00015302333,0.010806942,0.0002512692,0.00019120639,0.00005153347,0.0004523542,0.00012438098,0.023895215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934834,0.00014861826,0.00005053816,0.00016995173,0.00014910664,0.0001334558],"domain_scores_gemma":[0.99819285,0.00083380204,0.00018570144,0.0002342499,0.00033262238,0.0002207778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050729216,0.0004992728,0.00057205564,0.0012285893,0.001585473,0.0025221894,0.0005211291,0.00073285215,0.009850912],"category_scores_gemma":[0.002139921,0.0004207312,0.00047591102,0.001144801,0.0023732889,0.004148024,0.0022675595,0.0011143581,0.0022914503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018919651,0.000022712144,0.00052669185,0.00006227054,0.000013560436,0.00027820456,0.0006074895,0.00046794125,0.0053396556,0.98443353,0.0019359774,0.0061227363],"study_design_scores_gemma":[0.000036049154,0.000027345097,0.0004690162,0.000011104413,0.000020607351,0.00041995134,0.00035990568,0.0020831185,0.0034777147,0.9832532,0.009821593,0.000020368627],"about_ca_topic_score_codex":0.00035697166,"about_ca_topic_score_gemma":0.0005039128,"teacher_disagreement_score":0.009850912,"about_ca_system_score_codex":0.00061262527,"about_ca_system_score_gemma":0.0004081818,"threshold_uncertainty_score":0.032954633},"labels":[],"label_agreement":null},{"id":"W2586542999","doi":"10.1142/s1793830917500203","title":"Random graph languages","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Undirected graph; Comparability graph; Voltage graph; Null graph; Graph; Discrete mathematics; Mathematics; Line graph; Theoretical computer science","score_opus":0.012106860808956496,"score_gpt":0.2792503952538275,"score_spread":0.267143534444871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586542999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078999944,0.005307015,0.79689175,0.00855216,0.0009695718,0.000312341,0.0023211911,0.0019724818,0.104673594],"genre_scores_gemma":[0.770687,0.003925391,0.17441484,0.0038612753,0.0013620553,0.0008176483,0.0024627885,0.00066854584,0.04180046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958401,0.0014364191,0.00032027863,0.0012709333,0.00079662405,0.00033570995],"domain_scores_gemma":[0.993101,0.003987671,0.00071924203,0.00091149437,0.00095672306,0.00032393006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021821475,0.0006757598,0.0008517535,0.002473063,0.0013000476,0.0034244105,0.0014294717,0.00139418,0.009477428],"category_scores_gemma":[0.008574088,0.00041471404,0.0014833658,0.0017912774,0.0036049695,0.0075404183,0.0019908745,0.0019449579,0.0022703013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012164943,0.000008375135,0.00014954612,0.000057994424,0.000008985722,0.00009065484,0.00027862846,0.0008952181,0.00046097283,0.99188447,0.0016509277,0.0045019477],"study_design_scores_gemma":[0.000011419558,0.000016120692,0.000102342456,0.000032634023,0.000009213218,0.00033647005,0.00014368136,0.0071528493,0.00038023602,0.97562784,0.016167236,0.000019844834],"about_ca_topic_score_codex":0.00069537095,"about_ca_topic_score_gemma":0.0004692417,"teacher_disagreement_score":0.009477428,"about_ca_system_score_codex":0.0015511046,"about_ca_system_score_gemma":0.0009553258,"threshold_uncertainty_score":0.0317052},"labels":[],"label_agreement":null},{"id":"W2590512199","doi":"10.1142/s0129054116500386","title":"Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties","year":2016,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fibonacci number; Enumeration; Abelian group; Representation (politics); Mathematics; Word (group theory); Combinatorics; Discrete mathematics; Class (philosophy); State (computer science); Function (biology); Algorithm; Computer science; Artificial intelligence","score_opus":0.022275286274606947,"score_gpt":0.2935118611464839,"score_spread":0.27123657487187697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590512199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112635575,0.00048810797,0.8720171,0.001001374,0.00009982479,0.00021565837,0.0002486733,0.00065026747,0.012643564],"genre_scores_gemma":[0.55498594,0.0002702293,0.43462467,0.00040257408,0.0001581291,0.00045185158,0.00066419085,0.00020636237,0.008236056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722004,0.0008124341,0.00032549672,0.0006110268,0.0007098296,0.00032113874],"domain_scores_gemma":[0.9891977,0.008313451,0.0005484398,0.0009130351,0.00076727854,0.0002601103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021311308,0.00048252626,0.0008091222,0.0012462895,0.0013206078,0.003151291,0.0019742947,0.0011523508,0.0046418523],"category_scores_gemma":[0.010807513,0.0005066067,0.0010945711,0.0013122013,0.0022080871,0.0058883666,0.002749627,0.0019326085,0.0007675158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026345975,0.00014362716,0.0018845506,0.00024170247,0.000041172087,0.00010137208,0.0004697251,0.018522449,0.0067531522,0.8453655,0.003294972,0.12291822],"study_design_scores_gemma":[0.00006786335,0.00006252622,0.0003450832,0.000042667816,0.000021644493,0.00010734219,0.00013984983,0.16320059,0.0065009263,0.82607865,0.0034003071,0.00003256172],"about_ca_topic_score_codex":0.0010836909,"about_ca_topic_score_gemma":0.0016459799,"teacher_disagreement_score":0.0046418523,"about_ca_system_score_codex":0.002055614,"about_ca_system_score_gemma":0.0014869629,"threshold_uncertainty_score":0.01552856},"labels":[],"label_agreement":null},{"id":"W2592641503","doi":"10.1007/s00224-018-9859-0","title":"Primitivity, Uniform Minimality, and State Complexity of Boolean Operations","year":2018,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Product term; Discrete mathematics; Permutation (music); Boolean circuit; Combinatorics; Boolean network; Direct product; Permutation group; Boolean expression; State (computer science); Boolean function; Two-element Boolean algebra; Parity function; Complete Boolean algebra; Algorithm; Algebra over a field; Pure mathematics","score_opus":0.041126256274553526,"score_gpt":0.2732903883261544,"score_spread":0.23216413205160086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592641503","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6644106,0.0011451396,0.30022025,0.00292716,0.00009041593,0.000096853684,0.00074656913,0.00039857253,0.029964535],"genre_scores_gemma":[0.98663867,0.00025759672,0.010166204,0.00012327913,0.00010462004,0.000096058975,0.0002855072,0.000053546923,0.002274505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955651,0.0014147949,0.00038823127,0.0009345187,0.0009521266,0.00074518623],"domain_scores_gemma":[0.9537563,0.03849731,0.0020476682,0.0031722272,0.0013101003,0.0012163243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003793457,0.0008037423,0.0017596579,0.0023885246,0.0025124752,0.0071590324,0.0023855632,0.0013737514,0.0048540053],"category_scores_gemma":[0.024006527,0.0011394352,0.0023166565,0.0019321735,0.006567587,0.014265926,0.0038361223,0.003915352,0.00037260415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027264009,0.000107483655,0.001794491,0.0001141114,0.000047056594,0.000080604244,0.00067949126,0.009177622,0.0012526143,0.9775894,0.0005547015,0.008329748],"study_design_scores_gemma":[0.000017054384,0.000022905779,0.00046032417,0.000013179198,0.000033423552,0.00005025328,0.00006771449,0.02202745,0.0011563249,0.97577447,0.00035872002,0.000018201868],"about_ca_topic_score_codex":0.0014673314,"about_ca_topic_score_gemma":0.0015756816,"teacher_disagreement_score":0.0071590324,"about_ca_system_score_codex":0.0024402018,"about_ca_system_score_gemma":0.0014924144,"threshold_uncertainty_score":0.02006197},"labels":[],"label_agreement":null},{"id":"W2592757846","doi":"10.1142/s0129054113400182","title":"AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Shuffling; Mathematics; Combinatorics; Combinatorics on words; Discrete mathematics; Function (biology); Algorithm; Word (group theory)","score_opus":0.011031482350575644,"score_gpt":0.2717489781803248,"score_spread":0.2607174958297491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592757846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08777449,0.000374021,0.89882714,0.0005324518,0.000114088936,0.00009910111,0.0001523007,0.0012460211,0.010880444],"genre_scores_gemma":[0.59930265,0.0004591188,0.39376846,0.0003061596,0.00030295528,0.00034035466,0.00034040256,0.00042872372,0.0047510955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968707,0.0009887039,0.0003105202,0.00060554803,0.00092322374,0.00030127753],"domain_scores_gemma":[0.99116427,0.006099005,0.0005623419,0.0014467838,0.00055283424,0.000174813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026702199,0.000839922,0.0008820805,0.0024617,0.0017740441,0.0026933725,0.0019835464,0.0007396886,0.004133244],"category_scores_gemma":[0.013201188,0.00092451635,0.0025096198,0.001997514,0.004889392,0.007606945,0.0031472163,0.0023146658,0.00093988434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058293557,0.000037179336,0.00077273423,0.00016402885,0.000030462406,0.00015759688,0.00054443075,0.0076016304,0.005649343,0.9596093,0.00083001086,0.024544906],"study_design_scores_gemma":[0.000024329598,0.000047412555,0.00027441813,0.000026530219,0.000019103296,0.000119402226,0.000063259286,0.026364656,0.008180659,0.9598513,0.005001004,0.000027864986],"about_ca_topic_score_codex":0.0008105314,"about_ca_topic_score_gemma":0.00091177627,"teacher_disagreement_score":0.004133244,"about_ca_system_score_codex":0.0018353427,"about_ca_system_score_gemma":0.0012257864,"threshold_uncertainty_score":0.014121592},"labels":[],"label_agreement":null},{"id":"W2595036685","doi":"10.1016/j.tcs.2017.03.007","title":"State complexity of permutation on finite languages over a binary alphabet","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Science and Technology; Ministry of Science, ICT and Future Planning","keywords":"Deterministic finite automaton; Combinatorics; Mathematics; Permutation (music); Regular language; Modulo; Nondeterministic finite automaton; Finite-state machine; Discrete mathematics; Deterministic automaton; State (computer science); DFA minimization; Cyclic permutation; Alphabet; String (physics); Binary number; Automaton; Automata theory; Algorithm; Computer science; Arithmetic; Symmetric group; Theoretical computer science; Physics","score_opus":0.023003178710106462,"score_gpt":0.2986228897265871,"score_spread":0.27561971101648064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595036685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9191755,0.00022722532,0.069073476,0.0017154402,0.000041467396,0.000048624068,0.00073551276,0.00025303554,0.008729804],"genre_scores_gemma":[0.99243635,0.00010689448,0.004171996,0.00006725144,0.000062687985,0.00004925563,0.0004635077,0.00007071643,0.002571314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737144,0.00073310424,0.00015839546,0.0004117548,0.0006620393,0.0006633596],"domain_scores_gemma":[0.9565765,0.037006702,0.0018975269,0.0021651443,0.0010476981,0.0013064147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018373942,0.0005322392,0.0014157433,0.0013966677,0.0013067133,0.005929689,0.0018483548,0.0020990088,0.009269638],"category_scores_gemma":[0.018604955,0.0006957239,0.0012408704,0.0015999501,0.0026759224,0.011517711,0.0027784994,0.0028217218,0.00041189505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014490603,0.00032866246,0.0078029684,0.00023207902,0.00009334736,0.00033272887,0.0014538039,0.12985629,0.0062402855,0.8304626,0.0028929526,0.018855216],"study_design_scores_gemma":[0.00007832069,0.0000722987,0.001592005,0.000016785129,0.000036078283,0.000080773265,0.000170588,0.3020455,0.0020763916,0.69341797,0.00037462404,0.00003866171],"about_ca_topic_score_codex":0.0032769314,"about_ca_topic_score_gemma":0.0030733687,"teacher_disagreement_score":0.009269638,"about_ca_system_score_codex":0.0029944186,"about_ca_system_score_gemma":0.002664471,"threshold_uncertainty_score":0.031009972},"labels":[],"label_agreement":null},{"id":"W260210188","doi":"","title":"Advances and Trends in Automata and Formal Languages A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen - J.UCS Special Issue.","year":2002,"lang":"en","type":"article","venue":"JUCS - Journal of Universal Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Honour; Computer science; Automaton; Cognitive science; Theoretical computer science; History; Psychology; Archaeology","score_opus":0.006244402982577283,"score_gpt":0.2163864148918221,"score_spread":0.2101420119092448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W260210188","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037190572,0.6163795,0.016768238,0.10941013,0.19891332,0.000066499524,0.000979535,0.00035746847,0.053406224],"genre_scores_gemma":[0.03993144,0.54790455,0.01438105,0.009109366,0.25094527,0.000109161,0.0019758674,0.0008170743,0.13482624],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978745,0.00033199348,0.0001710779,0.00054119,0.0008966628,0.00018460763],"domain_scores_gemma":[0.99261296,0.002333993,0.0003238008,0.0005480709,0.0027972856,0.0013838782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003513084,0.000949498,0.0010429721,0.0029644012,0.0011980634,0.0049649677,0.0009876965,0.0011972972,0.0140447775],"category_scores_gemma":[0.009014983,0.00047530077,0.00070431,0.0040226863,0.0016665475,0.007097749,0.0023697636,0.0043517333,0.0065009734],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012090358,0.00005567251,0.0006769008,0.0011887345,0.000045226392,0.00012854469,0.0006250794,0.00058883795,0.002030015,0.054031536,0.7562305,0.1842781],"study_design_scores_gemma":[0.0000062578874,0.000026196838,0.000656085,0.00026059133,0.000011967804,0.00016087931,0.00015259547,0.00031271644,0.0003304513,0.022951275,0.97511655,0.000014340069],"about_ca_topic_score_codex":0.00089000625,"about_ca_topic_score_gemma":0.0014301335,"teacher_disagreement_score":0.0140447775,"about_ca_system_score_codex":0.0023227513,"about_ca_system_score_gemma":0.0018194597,"threshold_uncertainty_score":0.046984494},"labels":[],"label_agreement":null},{"id":"W2610921159","doi":"10.14232/actacyb.23.1.2017.3","title":"Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages","year":2017,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Prefix; Regular language; Prefix code; Concatenation (mathematics); Ideal (ethics); Mathematics; Quotient; Combinatorics; Discrete mathematics; Alphabet; Computer science; Automaton; Algorithm; Theoretical computer science","score_opus":0.019023756742540792,"score_gpt":0.25754122198324414,"score_spread":0.23851746524070336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610921159","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85647583,0.0004103441,0.12927082,0.0012403071,0.000028326838,0.00007972518,0.0010888036,0.00037888714,0.011026955],"genre_scores_gemma":[0.9725558,0.00018608171,0.02372886,0.00008928912,0.0000702987,0.00011913853,0.0007999166,0.00010227602,0.0023483294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962697,0.0007558232,0.00045513822,0.00079566793,0.0011677562,0.0005559268],"domain_scores_gemma":[0.966653,0.025300113,0.0023315402,0.0023028478,0.001765037,0.0016474373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023485615,0.00047128418,0.0010019214,0.0013369495,0.0010476311,0.0049003363,0.0015221374,0.0009488043,0.0037418832],"category_scores_gemma":[0.017880086,0.0005784983,0.0013732826,0.0010648551,0.0034919889,0.008757094,0.002406621,0.0015691633,0.0003570523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095625094,0.0001875822,0.009948878,0.00037963397,0.00011420397,0.0005835252,0.0027941219,0.104525216,0.018705599,0.83737457,0.0019906494,0.022439862],"study_design_scores_gemma":[0.00004615451,0.00008822669,0.0021374729,0.00002733662,0.000046922934,0.0004118409,0.00033984784,0.29709587,0.009117002,0.68897516,0.0016498588,0.000064357846],"about_ca_topic_score_codex":0.0013841927,"about_ca_topic_score_gemma":0.00090076204,"teacher_disagreement_score":0.0049003363,"about_ca_system_score_codex":0.0024966553,"about_ca_system_score_gemma":0.0017342139,"threshold_uncertainty_score":0.018114626},"labels":[],"label_agreement":null},{"id":"W2610936131","doi":"","title":"On a variant of the Ailon–Rudnick theorem in finite characteristic","year":2017,"lang":"en","type":"article","venue":"New York journal of mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of British Columbia","funders":"","keywords":"Mathematics; Pure mathematics; Calculus (dental); Medicine; Orthodontics","score_opus":0.02745803990985038,"score_gpt":0.24837936559747903,"score_spread":0.22092132568762865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610936131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14369296,0.005481816,0.49034762,0.015998244,0.0040894262,0.00013836118,0.00082111615,0.00054851075,0.33888203],"genre_scores_gemma":[0.8512842,0.0034664418,0.062306274,0.0038916979,0.0029608936,0.00018074075,0.0005537742,0.00050594687,0.074850075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987834,0.00033316435,0.00007489813,0.00034409977,0.000272876,0.00019154292],"domain_scores_gemma":[0.9960996,0.0023307328,0.00024232827,0.00055246975,0.000490108,0.00028479766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025197878,0.0008196864,0.0016300535,0.0027620778,0.0025466525,0.003118905,0.0022182306,0.0018429945,0.01200477],"category_scores_gemma":[0.009601196,0.0005427558,0.0018791578,0.002730641,0.0066820155,0.014766513,0.0042946404,0.005285865,0.0014506239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019281355,0.000009588592,0.00014421366,0.000024409437,0.0000072894213,0.000052124346,0.00013446795,0.00046447202,0.00018230874,0.9948055,0.001564233,0.0025920281],"study_design_scores_gemma":[0.000009245794,0.000007811965,0.00011558528,0.000008165551,0.0000064927153,0.000045190223,0.000031611282,0.0018666327,0.00008496439,0.99489504,0.0029213224,0.000007875631],"about_ca_topic_score_codex":0.0021709246,"about_ca_topic_score_gemma":0.0016406688,"teacher_disagreement_score":0.01200477,"about_ca_system_score_codex":0.0023259702,"about_ca_system_score_gemma":0.0010026505,"threshold_uncertainty_score":0.04015994},"labels":[],"label_agreement":null},{"id":"W2612751452","doi":"","title":"NBB bases of some lattices of pattern avoiding permutations.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.019426898417844934,"score_gpt":0.2651149689424482,"score_spread":0.24568807052460326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612751452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3244552,0.0017284644,0.33767354,0.0018621853,0.0009271787,0.00017678287,0.0029968012,0.0010123927,0.3291674],"genre_scores_gemma":[0.8533087,0.0004553629,0.08788924,0.00039961186,0.00023309844,0.00026002916,0.0020379846,0.00022275969,0.05519319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933416,0.00015938896,0.00004681627,0.000113580274,0.00020595152,0.0001400069],"domain_scores_gemma":[0.99884975,0.00028548512,0.0001507023,0.0001960171,0.00025975972,0.0002582136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000501537,0.00039276766,0.0005408255,0.0013047588,0.0018882207,0.0022479412,0.00077819277,0.00057826063,0.015278179],"category_scores_gemma":[0.0018206458,0.0004065669,0.00057835627,0.0008429671,0.0015952612,0.0020760698,0.0014626775,0.0014162186,0.0037993183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001139482,0.000043245367,0.00028329928,0.0000672186,0.000010723361,0.0002383218,0.000245728,0.0009312767,0.0038129543,0.98043174,0.0028402132,0.01098136],"study_design_scores_gemma":[0.000030543182,0.00002416547,0.00031650838,0.000037121543,0.000009717056,0.0003203868,0.00022950444,0.0043313378,0.0028690095,0.97325224,0.018560171,0.000019282237],"about_ca_topic_score_codex":0.0012126686,"about_ca_topic_score_gemma":0.0014773167,"teacher_disagreement_score":0.015278179,"about_ca_system_score_codex":0.00077288353,"about_ca_system_score_gemma":0.0006729785,"threshold_uncertainty_score":0.051110625},"labels":[],"label_agreement":null},{"id":"W2613395908","doi":"","title":"Extensions and restrictions of Wyhtoff's game preserving Wythoff's P-positions","year":2009,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Statistics Canada; Dalhousie University","funders":"","keywords":"Fibonacci number; Set (abstract data type); Morphism; Computer science; Word (group theory); Combinatorics; Mathematics; Discrete mathematics; Programming language; Geometry","score_opus":0.01289465573409901,"score_gpt":0.22562146701532143,"score_spread":0.21272681128122242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613395908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36661616,0.00068044575,0.46837884,0.0022102334,0.00054387184,0.00027273758,0.00065149023,0.0005123891,0.1601338],"genre_scores_gemma":[0.892456,0.0006537611,0.055221792,0.00042169174,0.0002518148,0.00034813,0.00045880474,0.00025319704,0.049934726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974165,0.0006445146,0.00022094717,0.0005060141,0.00054980617,0.00066222396],"domain_scores_gemma":[0.9959045,0.0018915759,0.00026845268,0.0007009538,0.00041922458,0.0008153617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023994814,0.0008275936,0.001202792,0.0015723814,0.0025669045,0.0037005083,0.002012627,0.0014587166,0.008362269],"category_scores_gemma":[0.007127315,0.0007690302,0.0020272608,0.0017666951,0.0035033321,0.010590177,0.005236889,0.0052354704,0.001398986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010755167,0.00004319977,0.00009897612,0.000023347195,0.000007669175,0.000120635166,0.000358989,0.0010323966,0.0012320927,0.992301,0.00053014164,0.0041439864],"study_design_scores_gemma":[0.00003766413,0.000046200646,0.00013026614,0.00001671793,0.000013735293,0.00015188954,0.00016349494,0.0067867856,0.0011601534,0.98711526,0.004356673,0.0000210794],"about_ca_topic_score_codex":0.0016342836,"about_ca_topic_score_gemma":0.0013062367,"teacher_disagreement_score":0.008362269,"about_ca_system_score_codex":0.0013963777,"about_ca_system_score_gemma":0.0016635845,"threshold_uncertainty_score":0.027974546},"labels":[],"label_agreement":null},{"id":"W2613700840","doi":"10.71781/10245","title":"Modèles et algorithmes pour les enchères combinatoires","year":2003,"lang":"fr","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chemistry","score_opus":0.009160145108839623,"score_gpt":0.18695090907059203,"score_spread":0.17779076396175242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613700840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01892636,0.00049125456,0.9692917,0.001007283,0.00019067115,0.00013113099,0.0004061385,0.0012316708,0.00832381],"genre_scores_gemma":[0.13546683,0.0010238067,0.83583885,0.0003503341,0.00031480778,0.0006396319,0.0016351995,0.0006062619,0.02412433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970855,0.0009992267,0.00016831825,0.0006346107,0.00090467813,0.00020765212],"domain_scores_gemma":[0.99091595,0.0071439142,0.00025603292,0.00076802814,0.0007521513,0.00016398849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030290931,0.0024132356,0.002217701,0.0025203377,0.0024351035,0.007606477,0.002825551,0.0040306337,0.014092364],"category_scores_gemma":[0.014847856,0.0015606328,0.004350688,0.003085597,0.002735166,0.008840964,0.0026234142,0.007234661,0.003858989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042517207,0.00035566863,0.0012917663,0.00031442428,0.00018156477,0.00030139353,0.00078959804,0.17194846,0.0027976225,0.66383785,0.008962387,0.14879417],"study_design_scores_gemma":[0.00018132509,0.00006162072,0.00022468412,0.00006373072,0.000055859007,0.00013120139,0.00021713508,0.67661,0.0018818134,0.31089184,0.009643888,0.000036824054],"about_ca_topic_score_codex":0.013192166,"about_ca_topic_score_gemma":0.015725886,"teacher_disagreement_score":0.014092364,"about_ca_system_score_codex":0.004318342,"about_ca_system_score_gemma":0.0024494333,"threshold_uncertainty_score":0.047143638},"labels":[],"label_agreement":null},{"id":"W2616293382","doi":"","title":"Substitution shifts generated by $p$-adic integer sequences","year":2014,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Substitution (logic); Uncountable set; Modulo; Mathematics; Alphabet; Algebraic number; Combinatorics; Sequence (biology); Integer (computer science); Discrete mathematics; Closure (psychology); Computer science","score_opus":0.032336867444329405,"score_gpt":0.15971958641899922,"score_spread":0.12738271897466982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616293382","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7842165,0.0006119164,0.17375225,0.0006319027,0.00029887323,0.00008099624,0.0001774917,0.00029534425,0.039934695],"genre_scores_gemma":[0.95844084,0.00026712797,0.03311811,0.00012801596,0.00013306289,0.00009664904,0.00010588199,0.00006672324,0.0076435674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995202,0.000090575784,0.000043666336,0.00012858101,0.00012164928,0.00009543328],"domain_scores_gemma":[0.9989968,0.00043434097,0.00014615477,0.00014807191,0.0001480633,0.00012669999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040420375,0.0003647074,0.0002702768,0.00071187963,0.0010498456,0.0012599858,0.00043692856,0.000586663,0.0035371918],"category_scores_gemma":[0.0017235867,0.00020971967,0.00041213952,0.00055668654,0.0018110417,0.0019500258,0.00093580614,0.0009596079,0.00068563933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093060255,0.00003161783,0.0007673332,0.00004727123,0.000005045333,0.00060363207,0.0010218404,0.002822845,0.01805203,0.96135086,0.0003774541,0.014827017],"study_design_scores_gemma":[0.000042135696,0.00018819064,0.0008726654,0.000043226915,0.000012484163,0.001025399,0.00072992744,0.026266215,0.023145793,0.9317491,0.015881328,0.00004353347],"about_ca_topic_score_codex":0.0003833932,"about_ca_topic_score_gemma":0.00035063224,"teacher_disagreement_score":0.0035371918,"about_ca_system_score_codex":0.0008912235,"about_ca_system_score_gemma":0.00047097882,"threshold_uncertainty_score":0.011833012},"labels":[],"label_agreement":null},{"id":"W2616617106","doi":"10.1142/s0129054117500137","title":"Worst Case Branching and Other Measures of Nondeterminism","year":2017,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; TRACE (psycholinguistics); Mathematics; Computation; Upper and lower bounds; Nondeterministic finite automaton; Tree (set theory); Bounded function; Discrete mathematics; Branching (polymer chemistry); Automaton; Combinatorics; Computer science; Algorithm; Automata theory; Theoretical computer science","score_opus":0.04300114367963864,"score_gpt":0.3331492841058865,"score_spread":0.29014814042624787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616617106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18126877,0.005754352,0.78618187,0.0025760715,0.0002727981,0.00011516032,0.00080145727,0.001302869,0.021726564],"genre_scores_gemma":[0.90894866,0.0017154452,0.081923604,0.00034264746,0.00050749606,0.00024512675,0.0005242268,0.0006012864,0.0051915636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99375474,0.0011349687,0.0003933773,0.0017968162,0.002105582,0.0008143997],"domain_scores_gemma":[0.91199327,0.06731215,0.0055337762,0.008515255,0.0033367132,0.0033089002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005402145,0.0016800419,0.0017708864,0.0026669432,0.0017375975,0.004954474,0.0032803924,0.0022105502,0.006336429],"category_scores_gemma":[0.055523638,0.00079205557,0.002303449,0.0028226986,0.0053846166,0.012967884,0.0028624604,0.006004893,0.00061017694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003261065,0.00016229409,0.005259325,0.00038311855,0.00013600964,0.00044820513,0.0008081157,0.08597812,0.009608644,0.86669284,0.0014900941,0.028707175],"study_design_scores_gemma":[0.000012876192,0.00008729821,0.0010946277,0.00005593915,0.00004634282,0.00037031763,0.00007687006,0.14949603,0.0036374226,0.8429606,0.0021129786,0.00004864413],"about_ca_topic_score_codex":0.0009897085,"about_ca_topic_score_gemma":0.0006165269,"teacher_disagreement_score":0.006336429,"about_ca_system_score_codex":0.0033255306,"about_ca_system_score_gemma":0.0013907923,"threshold_uncertainty_score":0.028569639},"labels":[],"label_agreement":null},{"id":"W2618109676","doi":"10.1016/j.tcs.2018.04.024","title":"Variations of checking stack automata: Obtaining unexpected decidability properties","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Undecidable problem; Decidability; Nondeterministic algorithm; Emptiness; Decision problem; Discrete mathematics; Automaton; Bounded function; Mathematics; Computer science; Combinatorics; Algorithm; Theoretical computer science","score_opus":0.018541725253925886,"score_gpt":0.25498249743764784,"score_spread":0.23644077218372195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618109676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46999222,0.0003676973,0.5147634,0.0006391093,0.00014582185,0.00016236868,0.0007351488,0.007395483,0.0057987887],"genre_scores_gemma":[0.87856483,0.000088031586,0.11834164,0.00017016419,0.00009169406,0.00008562262,0.0006354361,0.0010673426,0.0009552017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992362,0.0020634537,0.0004055564,0.0022071477,0.0022694895,0.0006923466],"domain_scores_gemma":[0.952359,0.032186452,0.0018089666,0.011157949,0.0015821393,0.00090538943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004195503,0.0014956525,0.0013392243,0.002098825,0.00137498,0.002968734,0.00596679,0.0022485103,0.0033115253],"category_scores_gemma":[0.032630306,0.0012400333,0.0028114563,0.0027377647,0.0043883016,0.0061054043,0.004431642,0.004285157,0.00048485646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032576572,0.0007128425,0.033083137,0.0011143535,0.0009987438,0.00207979,0.0020353855,0.2295003,0.13171466,0.38981846,0.0082174055,0.19746716],"study_design_scores_gemma":[0.00009921071,0.0001865906,0.0027992646,0.000042263062,0.0003431,0.00033606205,0.00014493892,0.5846158,0.05228268,0.35727397,0.001789913,0.00008623925],"about_ca_topic_score_codex":0.0019681857,"about_ca_topic_score_gemma":0.0036286197,"teacher_disagreement_score":0.00596679,"about_ca_system_score_codex":0.00165882,"about_ca_system_score_gemma":0.0016651938,"threshold_uncertainty_score":0.022188187},"labels":[],"label_agreement":null},{"id":"W2618190110","doi":"10.1007/978-3-319-60134-2_5","title":"Complexity of Proper Prefix-Convex Regular Languages","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Prefix; Regular language; Regular polygon; Combinatorics; Prefix code; Computer science; Discrete mathematics; Alphabet; Mathematics; Theoretical computer science; Algorithm; Linguistics; Automaton","score_opus":0.02884657845516872,"score_gpt":0.2612156032773482,"score_spread":0.2323690248221795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618190110","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55731046,0.0022767186,0.30379534,0.0074732,0.00024133931,0.00014734609,0.0024517216,0.00075487734,0.1255489],"genre_scores_gemma":[0.9485477,0.0012068627,0.026235586,0.00036880866,0.00049013307,0.00018817636,0.0016301956,0.00031417827,0.021018272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717844,0.0005743289,0.00016766551,0.00057986384,0.0011425876,0.00035718468],"domain_scores_gemma":[0.9885915,0.008768827,0.0005969587,0.000841656,0.0006241669,0.00057705556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001232985,0.00074093585,0.0013876541,0.0013245007,0.0014339971,0.0075659296,0.00237264,0.0014519929,0.012530947],"category_scores_gemma":[0.010785772,0.00091817137,0.0015097376,0.0022430655,0.0038673936,0.014916702,0.00338287,0.004621064,0.0011584675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012540648,0.000040063627,0.0005222859,0.00013788938,0.000019497356,0.00010120541,0.00048599407,0.00898466,0.0011258556,0.97651684,0.002079476,0.009860828],"study_design_scores_gemma":[0.00001469078,0.000009692378,0.00020980017,0.000010038937,0.000008990491,0.000079687765,0.000057736386,0.01576592,0.0004269251,0.9823784,0.0010264623,0.00001173383],"about_ca_topic_score_codex":0.001416359,"about_ca_topic_score_gemma":0.0010319995,"teacher_disagreement_score":0.012530947,"about_ca_system_score_codex":0.0032195924,"about_ca_system_score_gemma":0.0014990752,"threshold_uncertainty_score":0.041920185},"labels":[],"label_agreement":null},{"id":"W2619644749","doi":"10.1142/s1793557118500596","title":"On the endomorphism monoids of Clifford semigroups","year":2017,"lang":"en","type":"article","venue":"Asian-European Journal of Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McMaster University","keywords":"Endomorphism; Mathematics; Pure mathematics; Clifford algebra; Algebra over a field","score_opus":0.02498553244667356,"score_gpt":0.23708769808081512,"score_spread":0.21210216563414155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619644749","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58871204,0.0064574294,0.33404064,0.0013860775,0.00050176826,0.0002015776,0.00078006124,0.00026934154,0.06765111],"genre_scores_gemma":[0.9159472,0.0020926874,0.06783869,0.00032733823,0.00051891984,0.0001816509,0.00048504706,0.000071662675,0.012536861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984701,0.00032147107,0.00015558927,0.0003379876,0.00052314636,0.00019168199],"domain_scores_gemma":[0.99688476,0.001395931,0.00045057273,0.00026797297,0.00054137345,0.0004593276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025155293,0.00055460964,0.00045184378,0.0019714339,0.0018504673,0.0021478932,0.00057589693,0.0007526944,0.003842197],"category_scores_gemma":[0.0030145524,0.0004040618,0.00080222846,0.0010425941,0.0024620197,0.005096094,0.0017291658,0.0012796591,0.0005555715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006054462,0.000043214808,0.0013233521,0.00009462957,0.000010192302,0.00037793108,0.0007806728,0.0006650112,0.0068402537,0.9811266,0.00035038215,0.008327261],"study_design_scores_gemma":[0.000038007453,0.00020511061,0.0028252904,0.00006667907,0.000022846909,0.0015789592,0.0005212889,0.007108949,0.0066607106,0.95849913,0.022419298,0.000053676184],"about_ca_topic_score_codex":0.00055993826,"about_ca_topic_score_gemma":0.00040131382,"teacher_disagreement_score":0.003842197,"about_ca_system_score_codex":0.0008842545,"about_ca_system_score_gemma":0.0007521664,"threshold_uncertainty_score":0.013303518},"labels":[],"label_agreement":null},{"id":"W2621373850","doi":"10.1007/978-3-319-60252-3_16","title":"Branching Measures and Nearly Acyclic NFAs","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Combinatorics; Path (computing); Directed acyclic graph; Finite-state machine; String (physics); Mathematics; Nondeterministic finite automaton; Discrete mathematics; Computation; Automaton; Algorithm; Computer science; Automata theory; Theoretical computer science","score_opus":0.01823453053306076,"score_gpt":0.24333581897018078,"score_spread":0.22510128843712002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621373850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14551403,0.019725874,0.62257123,0.0036726934,0.00095554534,0.000080454745,0.0007429814,0.0007390825,0.20599811],"genre_scores_gemma":[0.856496,0.008004216,0.087538965,0.00068587495,0.0013562024,0.00020906655,0.0006653106,0.00030266304,0.0447416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922466,0.00019942175,0.000060538325,0.00017492271,0.00025841646,0.00008215439],"domain_scores_gemma":[0.99687505,0.0020972206,0.000248748,0.00033339945,0.00027069866,0.00017482188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009924751,0.00068164873,0.00075771305,0.0018783156,0.0012247079,0.0028768019,0.00079768064,0.0011812797,0.005675914],"category_scores_gemma":[0.00438655,0.0006136578,0.0008087206,0.0023376045,0.0027041943,0.005961843,0.0013130127,0.002883135,0.00068552955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007667809,0.0000053986314,0.000076727505,0.000023439921,0.0000036297622,0.00001844659,0.000078746925,0.0010689588,0.0002759211,0.99033195,0.00058620184,0.007522947],"study_design_scores_gemma":[0.0000013283064,0.0000019881263,0.000044930865,0.000007960723,0.000002084063,0.000024233597,0.000009378459,0.001422352,0.00005654764,0.99629045,0.0021356912,0.0000030495025],"about_ca_topic_score_codex":0.0012159582,"about_ca_topic_score_gemma":0.0010190833,"teacher_disagreement_score":0.005675914,"about_ca_system_score_codex":0.0018779642,"about_ca_system_score_gemma":0.0005090238,"threshold_uncertainty_score":0.018987834},"labels":[],"label_agreement":null},{"id":"W266933206","doi":"10.1007/s00236-003-0110-2","title":"A word on 7 letters which is non-repetitive up to mod 5","year":2003,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mod; Theory of computation; Construct (python library); Word (group theory); Combinatorics; Mathematics; Plane (geometry); Discrete mathematics; Arithmetic; Computer science; Algorithm; Programming language","score_opus":0.008311424531101974,"score_gpt":0.22354343087930634,"score_spread":0.21523200634820436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W266933206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6657583,0.0009059437,0.111597225,0.0029710091,0.0028465872,0.00023645365,0.0010132996,0.0022597234,0.2124114],"genre_scores_gemma":[0.85103995,0.00024134267,0.060130194,0.0007077799,0.00030030342,0.00017590115,0.0009640137,0.0003592208,0.08608134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949896,0.00007401086,0.00005041185,0.00013269903,0.00009064896,0.00015319473],"domain_scores_gemma":[0.99895084,0.00033976612,0.00015756338,0.00015667663,0.00024426106,0.00015089358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031051695,0.00064723723,0.00055153976,0.0006220802,0.002327446,0.0016058198,0.0005719289,0.0016672696,0.014228316],"category_scores_gemma":[0.0011531195,0.0003580794,0.0007672431,0.0007398831,0.0016637675,0.0016790264,0.0010763438,0.0011270597,0.004438358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089165824,0.00015984311,0.0011203232,0.00050468545,0.000059240232,0.006856649,0.0039137797,0.0008077358,0.08630811,0.82652664,0.011838215,0.061013058],"study_design_scores_gemma":[0.00012895856,0.0007783697,0.0025139744,0.00027004117,0.00012035734,0.0062496513,0.0027565316,0.005099197,0.05570849,0.76571316,0.16048914,0.00017212366],"about_ca_topic_score_codex":0.00038408532,"about_ca_topic_score_gemma":0.00051617634,"teacher_disagreement_score":0.014228316,"about_ca_system_score_codex":0.0005681769,"about_ca_system_score_gemma":0.0007603807,"threshold_uncertainty_score":0.04759848},"labels":[],"label_agreement":null},{"id":"W2676854164","doi":"10.1016/j.ic.2010.11.009","title":"Decision problems for convex languages","year":2010,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Prefix; Suffix; Regular language; Mathematics; Computer science; Combinatorics; Abstract family of languages; Time complexity; Discrete mathematics; Linguistics; Automaton; Artificial intelligence; Programming language","score_opus":0.006772956264340065,"score_gpt":0.2565013127934235,"score_spread":0.2497283565290834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2676854164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12920013,0.0032089828,0.7877523,0.015085619,0.00040694722,0.00040699184,0.0017367691,0.0004716728,0.061730668],"genre_scores_gemma":[0.78841615,0.002780691,0.15001094,0.0015918917,0.001089582,0.0009148442,0.0024890215,0.00042593773,0.05228095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99522567,0.0021729486,0.00027122677,0.0009957224,0.00074663345,0.00058777555],"domain_scores_gemma":[0.96127856,0.033909533,0.0010492245,0.0011404968,0.0012794714,0.0013427986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050142007,0.0014122354,0.003041721,0.0013915363,0.00215059,0.007819025,0.002777567,0.0032175973,0.016063403],"category_scores_gemma":[0.025506904,0.0015036953,0.0024778023,0.0024966695,0.005716682,0.013622303,0.0035789062,0.007820068,0.0012096456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012013301,0.00008897795,0.00017718259,0.00014474565,0.000038529895,0.00007359618,0.000232194,0.017325785,0.0002655963,0.96766484,0.004802042,0.009066434],"study_design_scores_gemma":[0.000030067886,0.000014162528,0.000039642782,0.000015167102,0.000010369722,0.000021924601,0.00005104847,0.039030004,0.00015701004,0.95962596,0.0009951184,0.000009415115],"about_ca_topic_score_codex":0.0037617306,"about_ca_topic_score_gemma":0.0031431452,"teacher_disagreement_score":0.016063403,"about_ca_system_score_codex":0.005540713,"about_ca_system_score_gemma":0.0034009363,"threshold_uncertainty_score":0.053737402},"labels":[],"label_agreement":null},{"id":"W272196518","doi":"10.1515/dema-2013-0425","title":"Idempotent tree languages","year":2013,"lang":"en","type":"article","venue":"Demonstratio Mathematica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Idempotence; Tree (set theory); Pure mathematics; Combinatorics","score_opus":0.009053640755379136,"score_gpt":0.22744410840890125,"score_spread":0.2183904676535221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W272196518","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7175947,0.00087257824,0.2438387,0.000374224,0.0001806229,0.00007183334,0.00036521663,0.0004778371,0.036224287],"genre_scores_gemma":[0.9606399,0.00021699384,0.03027947,0.000098960554,0.00013170017,0.00008462236,0.00020696002,0.000090844915,0.008250619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839133,0.00026199452,0.00014089243,0.00042162873,0.00058452337,0.0001996526],"domain_scores_gemma":[0.9971136,0.0011613754,0.000413238,0.00037837602,0.00058945466,0.00034396423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015058811,0.00023811066,0.00044321382,0.0014044577,0.0011335836,0.0024945186,0.0007973713,0.00051942345,0.0023250345],"category_scores_gemma":[0.002772124,0.00037556444,0.0006224514,0.0006079299,0.0025934326,0.0034093554,0.0014009832,0.0011504369,0.00043694588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011987895,0.000050590934,0.0013839836,0.000063226915,0.000014001167,0.00049079023,0.0016437807,0.0012395295,0.022890309,0.96332896,0.00046178282,0.008313106],"study_design_scores_gemma":[0.000052759697,0.00019929919,0.0020950902,0.00006657478,0.000040940304,0.0016980885,0.0007991854,0.01544104,0.019974174,0.93961823,0.019946026,0.00006863636],"about_ca_topic_score_codex":0.00024361927,"about_ca_topic_score_gemma":0.00022986784,"teacher_disagreement_score":0.0024945186,"about_ca_system_score_codex":0.00090592843,"about_ca_system_score_gemma":0.0004917828,"threshold_uncertainty_score":0.007963955},"labels":[],"label_agreement":null},{"id":"W2727894299","doi":"10.1142/s021819671950019x","title":"Low-complexity computations for nilpotent subgroup problems","year":2019,"lang":"en","type":"preprint","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Coset; Mathematics; Nilpotent; Centralizer and normalizer; Nilpotent group; Characteristic subgroup; Fitting subgroup; Bounded function; Conjugacy class; Commutator subgroup; Discrete mathematics; Computation; Combinatorics; Normal subgroup; Group (periodic table); Algorithm; p-group; Symmetric group; Mathematical analysis","score_opus":0.0311483277074883,"score_gpt":0.2916422187674985,"score_spread":0.2604938910600102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727894299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32906502,0.0011242,0.6138495,0.0047025154,0.0002617269,0.000349313,0.0018979425,0.008657985,0.040091872],"genre_scores_gemma":[0.76620734,0.0002562573,0.21757245,0.000579271,0.00024378943,0.00037041202,0.0025157058,0.0010858402,0.011168926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982534,0.00031982083,0.00010677039,0.0005408763,0.00041112496,0.0003680322],"domain_scores_gemma":[0.9937078,0.004267432,0.0002669412,0.0011750387,0.0003561459,0.00022679953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010467551,0.0009681572,0.00088641996,0.00096640753,0.0011887918,0.004021454,0.0028702603,0.0012895138,0.023930883],"category_scores_gemma":[0.007850724,0.00040977268,0.0011154371,0.0017917322,0.0016258307,0.00886827,0.0026284556,0.002524154,0.003071933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018808136,0.00064798706,0.004926959,0.0014467408,0.0001434566,0.00039894835,0.0016642478,0.07012116,0.01446167,0.6098889,0.026899558,0.2675195],"study_design_scores_gemma":[0.00016838002,0.00006654636,0.00030835703,0.000043270506,0.000051330975,0.00010144225,0.0002465292,0.17710374,0.009560717,0.80714244,0.0051812544,0.000025968035],"about_ca_topic_score_codex":0.0017978256,"about_ca_topic_score_gemma":0.003737893,"teacher_disagreement_score":0.023930883,"about_ca_system_score_codex":0.0026904857,"about_ca_system_score_gemma":0.0021041227,"threshold_uncertainty_score":0.08005679},"labels":[],"label_agreement":null},{"id":"W2736549445","doi":"10.1007/978-3-319-62809-7_21","title":"Relative Prefix Distance Between Languages","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Prefix; Decidability; Computer science; Context (archaeology); Word (group theory); Context-free language; Regular language; Combinatorics; Discrete mathematics; Mathematics; Theoretical computer science; Rule-based machine translation; Artificial intelligence; Linguistics; Automaton; Geometry","score_opus":0.01644346720488384,"score_gpt":0.2641630324598084,"score_spread":0.24771956525492453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736549445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12363063,0.0035424575,0.67069554,0.002208274,0.0007131455,0.00012471525,0.001460494,0.001191183,0.19643347],"genre_scores_gemma":[0.67846686,0.0029998987,0.22782607,0.00090804335,0.0009792929,0.00032599276,0.0035178594,0.0008857254,0.08409024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769187,0.00043911583,0.00019125114,0.0007662882,0.0007349775,0.00017651154],"domain_scores_gemma":[0.996424,0.001829469,0.00022270114,0.00070248084,0.00056993816,0.00025134473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001094435,0.00053091167,0.00089210883,0.00215448,0.0015350312,0.0042512026,0.0012971435,0.0013202124,0.013762396],"category_scores_gemma":[0.00577866,0.00059958926,0.0007956988,0.0029422727,0.0026040967,0.011669712,0.00387131,0.0037707589,0.0037595439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050495968,0.000012064293,0.00011481486,0.00007907329,0.0000081953085,0.000042666357,0.0003049822,0.00088597037,0.0014524835,0.969871,0.0013649948,0.025813442],"study_design_scores_gemma":[0.000005491127,0.000024308018,0.00010775499,0.00002741189,0.000008987906,0.00014761645,0.00008479123,0.0024353466,0.0014131045,0.9780899,0.017644638,0.000010579318],"about_ca_topic_score_codex":0.0002860536,"about_ca_topic_score_gemma":0.00022968074,"teacher_disagreement_score":0.013762396,"about_ca_system_score_codex":0.0013698615,"about_ca_system_score_gemma":0.0007920955,"threshold_uncertainty_score":0.04603976},"labels":[],"label_agreement":null},{"id":"W2739858278","doi":"10.46298/dmtcs.3526","title":"The Size of the rth Smallest Component in Decomposable Structures with a Restricted Pattern","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Statistics Canada","funders":"","keywords":"Mathematics; Combinatorics; Component (thermodynamics); Class (philosophy); Combinatorial analysis; Combinatorial method; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.0071796406325237245,"score_gpt":0.23238279958540722,"score_spread":0.2252031589528835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739858278","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8937875,0.0003609535,0.096934296,0.0006894939,0.000035794495,0.00007471363,0.0005399877,0.00056547683,0.0070117847],"genre_scores_gemma":[0.98474634,0.000223716,0.012422753,0.00005307972,0.00006342713,0.00013159012,0.0004989401,0.00014741709,0.001712776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886465,0.00022555959,0.00009413812,0.0004060421,0.00025525756,0.00015423294],"domain_scores_gemma":[0.96715474,0.02348408,0.0035076023,0.002883663,0.001368547,0.0016014391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016381954,0.00050128606,0.0007883463,0.0016448268,0.0007610502,0.0019329287,0.0015679231,0.001087534,0.0054629184],"category_scores_gemma":[0.024383293,0.0005973117,0.00053754123,0.0009573755,0.0027407464,0.0045768917,0.0015183135,0.0012469769,0.0006277942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034911875,0.00036394832,0.06021606,0.0014345209,0.00021338035,0.003157427,0.0024399252,0.08593217,0.11802653,0.62039995,0.007840638,0.09648431],"study_design_scores_gemma":[0.00018838073,0.00049918477,0.024313327,0.00012505101,0.00014501483,0.004332662,0.000758492,0.37706846,0.052349865,0.5362455,0.0038171627,0.00015686886],"about_ca_topic_score_codex":0.00048730962,"about_ca_topic_score_gemma":0.00036852813,"teacher_disagreement_score":0.0054629184,"about_ca_system_score_codex":0.0008411719,"about_ca_system_score_gemma":0.00040533626,"threshold_uncertainty_score":0.01827526},"labels":[],"label_agreement":null},{"id":"W2741750108","doi":"10.1142/9789813148208_0006","title":"Quasi-Distances and Weighted Finite Automata","year":2017,"lang":"en","type":"book-chapter","venue":"WORLD SCIENTIFIC eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.021884968505049333,"score_gpt":0.23485990733877915,"score_spread":0.2129749388337298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741750108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060124706,0.030182598,0.6302189,0.0050210464,0.003680645,0.00006479183,0.0005107385,0.00052038045,0.26967624],"genre_scores_gemma":[0.62640214,0.016174205,0.16482389,0.0015284381,0.0033806583,0.0003422984,0.0008025137,0.0006062615,0.18593962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929965,0.00020368567,0.000053956202,0.00016893803,0.00022526628,0.000048491554],"domain_scores_gemma":[0.9991067,0.0005220715,0.000055794524,0.00012473941,0.00013516788,0.000055536468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006328256,0.00068723987,0.0006286213,0.0011701031,0.0010601535,0.0023018103,0.00091299857,0.00085176405,0.009387707],"category_scores_gemma":[0.002336952,0.00043809615,0.0005505626,0.0018134026,0.0025639334,0.005870351,0.0012790194,0.0022403372,0.0015600853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000665975,0.0000039383353,0.00002623636,0.000038469334,0.0000031439356,0.000009808496,0.00007799507,0.0005402425,0.0003623319,0.98654664,0.0014847327,0.010899932],"study_design_scores_gemma":[0.0000015194462,0.0000046847517,0.000031505413,0.00001207395,0.0000021317376,0.000021326174,0.000024786472,0.0010217294,0.00013882719,0.9877699,0.010967822,0.000003754362],"about_ca_topic_score_codex":0.0007805062,"about_ca_topic_score_gemma":0.000874219,"teacher_disagreement_score":0.009387707,"about_ca_system_score_codex":0.0015650294,"about_ca_system_score_gemma":0.000531943,"threshold_uncertainty_score":0.031404972},"labels":[],"label_agreement":null},{"id":"W2749482857","doi":"10.1007/978-3-319-66396-8_3","title":"Overpals, Underlaps, and Underpals","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Waterloo","funders":"","keywords":"Computer science; Word (group theory); Landmark; Factor (programming language); Natural language processing; Artificial intelligence; Linguistics; Programming language; Philosophy","score_opus":0.019617496920211915,"score_gpt":0.25108628994739307,"score_spread":0.23146879302718115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749482857","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16497366,0.0075996667,0.16616711,0.0048833443,0.0015850693,0.000085415275,0.0007793711,0.0011546238,0.6527718],"genre_scores_gemma":[0.8541956,0.0037393845,0.022031104,0.0010245439,0.0007684043,0.00008134436,0.0006775384,0.0009186739,0.11656341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902534,0.00016429032,0.00007132198,0.0003070542,0.00021180426,0.00022026553],"domain_scores_gemma":[0.9979225,0.0007028593,0.00016926683,0.00071556907,0.0002931882,0.000196599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007874183,0.00057666504,0.0006303594,0.0008460967,0.0018872936,0.004398171,0.0009383127,0.00095977937,0.020234711],"category_scores_gemma":[0.004839049,0.00048961013,0.00067964563,0.0010705787,0.0047218725,0.012157439,0.0046530203,0.002490989,0.004302835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088103974,0.000018738785,0.00072601886,0.0000959429,0.000008685157,0.00027908533,0.0011637036,0.00046080837,0.00073746254,0.9415202,0.0058694184,0.049031768],"study_design_scores_gemma":[0.0000065631907,0.000026975293,0.00043483882,0.000063345506,0.000014825005,0.0006697254,0.0008788984,0.0009970765,0.00084482384,0.94091827,0.055128142,0.000016594811],"about_ca_topic_score_codex":0.0008060445,"about_ca_topic_score_gemma":0.0006812649,"teacher_disagreement_score":0.020234711,"about_ca_system_score_codex":0.00055279554,"about_ca_system_score_gemma":0.0007595507,"threshold_uncertainty_score":0.0676918},"labels":[],"label_agreement":null},{"id":"W2756030149","doi":"10.1007/s11139-017-9981-7","title":"More infinite products: Thue–Morse and the gamma function","year":2018,"lang":"en","type":"article","venue":"The Ramanujan Journal","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Product (mathematics); Infinite product; Morse code; Function (biology); Mathematics; Combinatorics; Rational function; Constant (computer programming); Pure mathematics; Biology; Geometry; Computer science","score_opus":0.009218506670999176,"score_gpt":0.21572346704083556,"score_spread":0.20650496036983637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756030149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36947414,0.01980454,0.40642792,0.012599758,0.0027077715,0.000049079987,0.00020105338,0.00030686607,0.1884289],"genre_scores_gemma":[0.9235538,0.003477621,0.038712878,0.0015157657,0.0021774604,0.000059994283,0.000118437994,0.00020283883,0.03018122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986203,0.0005985016,0.00009598398,0.0002329824,0.00027959544,0.00017270297],"domain_scores_gemma":[0.99421257,0.003287215,0.00044139897,0.000920251,0.0006632626,0.00047536302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036150373,0.00092978217,0.0015321801,0.002618986,0.002748929,0.005323682,0.0013482659,0.002611265,0.0072844033],"category_scores_gemma":[0.012457106,0.00074526045,0.0014556763,0.001959648,0.007195637,0.012799373,0.0028973303,0.0046046847,0.0009065217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008840815,0.0000061911846,0.00005490275,0.000011274669,0.0000028552045,0.00003166969,0.00019287654,0.00032202012,0.00011563949,0.9972952,0.0002666577,0.0016919828],"study_design_scores_gemma":[0.0000028711484,0.000004678877,0.00002475388,0.0000073052192,0.0000019045775,0.000032025895,0.000034155437,0.0010257454,0.00004673907,0.9976006,0.0012127922,0.000006453951],"about_ca_topic_score_codex":0.0010118767,"about_ca_topic_score_gemma":0.0008913161,"teacher_disagreement_score":0.0072844033,"about_ca_system_score_codex":0.0014865707,"about_ca_system_score_gemma":0.0007366387,"threshold_uncertainty_score":0.024368763},"labels":[],"label_agreement":null},{"id":"W2758996273","doi":"10.25596/jalc-2017-169","title":"State Complexity of Prefix Distance of Subregular Languages","year":2017,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Prefix; Upper and lower bounds; Mathematics; Regular language; Combinatorics; Deterministic finite automaton; Finite-state machine; Alphabet; Neighbourhood (mathematics); Nondeterministic finite automaton; Discrete mathematics; Automaton; Computer science; Algorithm; Automata theory; Theoretical computer science","score_opus":0.024655987397331262,"score_gpt":0.25231424399670954,"score_spread":0.22765825659937827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758996273","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8718284,0.0002672388,0.116899654,0.00062738295,0.00002480174,0.00005732833,0.0007981686,0.00066715566,0.008829783],"genre_scores_gemma":[0.982834,0.000076758224,0.013871571,0.00004341214,0.00002177365,0.00007248732,0.0005187606,0.000084602514,0.0024767383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793434,0.00037450058,0.00021769505,0.0006229961,0.0005671673,0.00028325254],"domain_scores_gemma":[0.9849166,0.011010504,0.0010179303,0.0015231374,0.0008758533,0.0006558978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010358499,0.00031233727,0.00085730787,0.00068456173,0.0008437994,0.002585429,0.001429367,0.0008595695,0.007931719],"category_scores_gemma":[0.011439275,0.00042839893,0.0010105709,0.00059000624,0.001839046,0.0049546883,0.002058825,0.001372576,0.00069476117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001963583,0.00019509136,0.0109076295,0.0006704191,0.00009805806,0.00070401246,0.0022997973,0.2789464,0.042880766,0.61277217,0.0024270308,0.046135053],"study_design_scores_gemma":[0.000054346707,0.00016389621,0.0018229361,0.000027158832,0.000048860402,0.000249793,0.00018280266,0.56152457,0.015607806,0.41875207,0.0015120088,0.000053785876],"about_ca_topic_score_codex":0.0014644419,"about_ca_topic_score_gemma":0.0012462492,"teacher_disagreement_score":0.007931719,"about_ca_system_score_codex":0.0016667236,"about_ca_system_score_gemma":0.00080291944,"threshold_uncertainty_score":0.0265342},"labels":[],"label_agreement":null},{"id":"W2765317479","doi":"10.1090/bproc/37","title":"When is an automatic set an additive basis?","year":2018,"lang":"en","type":"preprint","venue":"Proceedings of the American Mathematical Society Series B","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Basis (linear algebra); Natural number; Characterization (materials science); Set (abstract data type); Mathematics; Natural (archaeology); Algorithm; Order (exchange); Computer science; Combinatorics; Geometry; Geography; Physics","score_opus":0.019577695073338557,"score_gpt":0.2632862714098411,"score_spread":0.24370857633650256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765317479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22395736,0.0006574816,0.6706173,0.0023856799,0.00050483266,0.00016530117,0.0011009517,0.0038896904,0.09672141],"genre_scores_gemma":[0.7226933,0.0003362966,0.24724247,0.0006540699,0.00027400313,0.00021664354,0.0016964304,0.00078220235,0.026104515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996923,0.000539418,0.00023341883,0.0007869364,0.0010452071,0.0004719113],"domain_scores_gemma":[0.9963617,0.0016891937,0.00018978579,0.0007488231,0.00078595756,0.00022460805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020590278,0.0007518621,0.000852836,0.0021643909,0.0023187702,0.0043177637,0.0014593669,0.001270821,0.010867884],"category_scores_gemma":[0.007673612,0.0007029738,0.0017311688,0.0015064289,0.0030801555,0.008655492,0.0033038966,0.0024081797,0.0032324016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011661181,0.000076265256,0.0010049893,0.00012459827,0.000027723312,0.00013455002,0.0004149928,0.0019557925,0.003339734,0.93125284,0.0045735487,0.056978412],"study_design_scores_gemma":[0.000019624225,0.000069076756,0.0006611124,0.0000615822,0.000043855503,0.00029600927,0.0005457721,0.016252628,0.010161598,0.95143294,0.02039931,0.000056609777],"about_ca_topic_score_codex":0.0017362003,"about_ca_topic_score_gemma":0.0023648152,"teacher_disagreement_score":0.010867884,"about_ca_system_score_codex":0.001292439,"about_ca_system_score_gemma":0.0011277576,"threshold_uncertainty_score":0.036356747},"labels":[],"label_agreement":null},{"id":"W2765746319","doi":"10.23638/dmtcs-20-1-20","title":"Permutation complexity of images of Sturmian words by marked morphisms","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Morphism; Permutation (music); Mathematics; Combinatorics; Pure mathematics; Art","score_opus":0.019732605636758344,"score_gpt":0.276199733789977,"score_spread":0.25646712815321865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765746319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6610137,0.0012294371,0.12812817,0.01748774,0.0014223823,0.000062217405,0.00066854234,0.0009328269,0.18905494],"genre_scores_gemma":[0.9737352,0.00040887034,0.009877706,0.0009839516,0.00056273746,0.000062154155,0.00022675714,0.00013430406,0.014008278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992111,0.000114006434,0.000041721047,0.00021994351,0.00030761928,0.00010554253],"domain_scores_gemma":[0.99611485,0.0025002505,0.00028732335,0.0004349321,0.00043049455,0.00023213054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005864168,0.0002679057,0.00037302705,0.00068998366,0.00090029486,0.0022947765,0.00060329004,0.00092671416,0.010546976],"category_scores_gemma":[0.006250517,0.00023073894,0.00054701767,0.0006232039,0.0024812673,0.005836363,0.0012607115,0.0017211124,0.0011699699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011519134,0.0000125505485,0.00078035815,0.000080189144,0.000007212062,0.00017626402,0.000304588,0.0015275677,0.0036143167,0.97985005,0.0046524517,0.00887933],"study_design_scores_gemma":[0.000019152909,0.00003530461,0.0014089848,0.000018982992,0.000010254159,0.00032276983,0.00012837537,0.0054568695,0.0056416877,0.97412634,0.012803353,0.000027898988],"about_ca_topic_score_codex":0.00048032036,"about_ca_topic_score_gemma":0.00038743255,"teacher_disagreement_score":0.010546976,"about_ca_system_score_codex":0.0011578988,"about_ca_system_score_gemma":0.0004618805,"threshold_uncertainty_score":0.03528315},"labels":[],"label_agreement":null},{"id":"W2766426016","doi":"10.1016/j.dam.2018.12.028","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e556\" altimg=\"si21.gif\"><mml:mi>k</mml:mi></mml:math>-foldability of words","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Bijection; Catalan number; Combinatorics; Mathematics; Word (group theory); Tree (set theory); Alphabet; Complement (music); Discrete mathematics; Geometry","score_opus":0.012423472672947664,"score_gpt":0.2340378134522046,"score_spread":0.22161434077925693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766426016","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001898876,0.00037254865,0.1923111,0.004172431,0.0014171917,0.00034280884,0.15456532,0.15946801,0.48545167],"genre_scores_gemma":[0.028501237,0.0010956284,0.12878314,0.0018058347,0.000758044,0.00076697563,0.22562443,0.13008024,0.48258445],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941516,0.00010441744,0.00008060034,0.0001051401,0.00023948417,0.000055113618],"domain_scores_gemma":[0.9978599,0.00066652923,0.00012284493,0.0005096634,0.000661854,0.00017918172],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007428196,0.0014271709,0.0008950846,0.0021042698,0.00091018097,0.0058868397,0.0022099854,0.0014577335,0.57106245],"category_scores_gemma":[0.0044123456,0.0009369088,0.0007980593,0.002870573,0.0006097218,0.006375409,0.002002063,0.0021495845,0.50232023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068187954,0.000024281579,0.0001226777,0.00027667446,0.000006568151,0.00004517185,0.0001480103,0.0002533671,0.002146936,0.041770253,0.911128,0.044009868],"study_design_scores_gemma":[0.000028201604,0.000009880265,0.00032371265,0.00005673653,0.0000044700505,0.00010297867,0.000053802483,0.0014880659,0.0043632165,0.017680837,0.97586274,0.00002542938],"about_ca_topic_score_codex":0.0046724263,"about_ca_topic_score_gemma":0.005296609,"teacher_disagreement_score":0.57106245,"about_ca_system_score_codex":0.0017272038,"about_ca_system_score_gemma":0.0011184264,"threshold_uncertainty_score":0.6118274},"labels":[],"label_agreement":null},{"id":"W2766804132","doi":"10.1007/978-3-319-94631-3_7","title":"A New Technique for Reachability of States in Concatenation Automata","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Concatenation (mathematics); Reachability; Computer science; Automaton; Mathematical proof; Theoretical computer science; State (computer science); Finite-state machine; Algorithm; Discrete mathematics; Mathematics; Combinatorics","score_opus":0.015007128737231968,"score_gpt":0.2591802567197418,"score_spread":0.24417312798250984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766804132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015064633,0.00022774907,0.9916155,0.00008258852,0.00019802983,0.000050754577,0.000076495984,0.0009386388,0.005303853],"genre_scores_gemma":[0.0910878,0.0009371677,0.8886684,0.00036593038,0.0004969216,0.00052125036,0.00048461114,0.0015348537,0.015903093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973557,0.0004614554,0.00031143636,0.00081314496,0.00087615795,0.00018215207],"domain_scores_gemma":[0.9968767,0.0017997369,0.00012216665,0.0007594958,0.00032690435,0.00011494141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017148865,0.0016447479,0.0012791558,0.0026476309,0.002704666,0.002811042,0.0032088966,0.0018415494,0.010623754],"category_scores_gemma":[0.0045271465,0.0013404762,0.0039635897,0.0026954585,0.0037810744,0.010121651,0.00709744,0.0063735796,0.003972036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017218642,0.00007241066,0.00021620798,0.0005679934,0.000070321905,0.0004897072,0.0011765696,0.0060066166,0.025465263,0.8190615,0.0048240293,0.14187713],"study_design_scores_gemma":[0.00004251654,0.00017954843,0.00028597293,0.0001826497,0.00025476984,0.0012505988,0.0001987039,0.08048906,0.033948835,0.8112565,0.071779355,0.00013147049],"about_ca_topic_score_codex":0.0008761407,"about_ca_topic_score_gemma":0.0010435922,"teacher_disagreement_score":0.010623754,"about_ca_system_score_codex":0.0010804825,"about_ca_system_score_gemma":0.0010229489,"threshold_uncertainty_score":0.035539985},"labels":[],"label_agreement":null},{"id":"W2768476682","doi":"10.1016/j.tcs.2018.04.039","title":"Avoidance bases for formulas with reversal","year":2018,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Index (typography); Subject (documents); Mathematics; Combinatorics; Computer science","score_opus":0.011948554639043669,"score_gpt":0.25296535695797273,"score_spread":0.24101680231892905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768476682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24787503,0.0017818358,0.53826964,0.0032886895,0.0012335768,0.00017092195,0.0011233686,0.0016129649,0.204644],"genre_scores_gemma":[0.89802647,0.0007425209,0.053652097,0.0008716176,0.00063333474,0.00019159446,0.001293864,0.0005093972,0.044079166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990338,0.00016217989,0.000064843654,0.00021109483,0.00033079393,0.00019725275],"domain_scores_gemma":[0.9986455,0.00051619357,0.00010214894,0.00027360703,0.00028540008,0.00017720826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090574805,0.0009902102,0.00086334045,0.0024115155,0.002376659,0.0046428107,0.0014714258,0.0013088344,0.011646345],"category_scores_gemma":[0.0027562813,0.0006336518,0.0011312697,0.0015906745,0.0022494048,0.005736694,0.0027874424,0.003895163,0.0024100281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032845728,0.000025460584,0.00009088347,0.00002659233,0.0000063318344,0.0000420988,0.00015378409,0.00044124655,0.0006976529,0.98954713,0.0012627906,0.0076731876],"study_design_scores_gemma":[0.00001265934,0.000007127136,0.00003574835,0.000008177399,0.000008757888,0.000032063934,0.00004280166,0.0015429282,0.0004739016,0.99398685,0.0038404833,0.000008518627],"about_ca_topic_score_codex":0.0009924505,"about_ca_topic_score_gemma":0.0012051194,"teacher_disagreement_score":0.011646345,"about_ca_system_score_codex":0.0012969206,"about_ca_system_score_gemma":0.000962396,"threshold_uncertainty_score":0.038960934},"labels":[],"label_agreement":null},{"id":"W2769915601","doi":"10.1007/978-3-319-94631-3_4","title":"Most Complex Deterministic Union-Free Regular Languages","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular language; Regular expression; Mathematics; Discrete mathematics; Nondeterministic finite automaton; State (computer science); Automaton; Star (game theory); Combinatorics; Computer science; Automata theory; Theoretical computer science; Algorithm; Programming language","score_opus":0.016876873437716863,"score_gpt":0.27262869384931837,"score_spread":0.2557518204116015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769915601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5310166,0.0014041348,0.33663145,0.0043299072,0.00022948686,0.00015479515,0.0029002526,0.0024271512,0.12090629],"genre_scores_gemma":[0.94837403,0.00043387205,0.02373935,0.00065024727,0.00022639145,0.00016731022,0.0013679303,0.0005291527,0.024511768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762434,0.00032225237,0.0001825556,0.0008115308,0.0006861466,0.00037313116],"domain_scores_gemma":[0.99394256,0.0037871234,0.00046968763,0.0007285943,0.0006801055,0.0003919211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014671435,0.0008998952,0.0013895942,0.0012779599,0.0025462334,0.007189685,0.001544241,0.001640137,0.01550902],"category_scores_gemma":[0.0058388757,0.0012931796,0.0013954146,0.0012904801,0.0036092505,0.008225678,0.0035875312,0.0032262912,0.003489468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024837838,0.000050590457,0.0007508812,0.00018905471,0.000035175377,0.00023975594,0.0008294832,0.002197037,0.003839986,0.9787139,0.003055102,0.009850597],"study_design_scores_gemma":[0.000037544276,0.000017363502,0.00024940964,0.000020523848,0.000029446646,0.00028440665,0.00012852595,0.005365129,0.0021869924,0.98687047,0.004785172,0.000024903824],"about_ca_topic_score_codex":0.0005465778,"about_ca_topic_score_gemma":0.00070484384,"teacher_disagreement_score":0.01550902,"about_ca_system_score_codex":0.0016891878,"about_ca_system_score_gemma":0.0010487934,"threshold_uncertainty_score":0.051882803},"labels":[],"label_agreement":null},{"id":"W2770859862","doi":"10.37236/1671","title":"There Are Ternary Circular Square-Free Words of Length $n$ for $n\\ge 18$","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Ternary operation; Combinatorics; Square (algebra); Geometry; Computer science","score_opus":0.01556969058956936,"score_gpt":0.22256243941455833,"score_spread":0.20699274882498897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770859862","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8800553,0.0014858383,0.037445877,0.0017079792,0.0004001004,0.000050576367,0.00097369804,0.00056203787,0.07731848],"genre_scores_gemma":[0.94451,0.00049541995,0.03007493,0.0004629964,0.00007880626,0.00011912948,0.0009581378,0.00012687605,0.023173677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971694,0.000030671854,0.00002247781,0.000087739296,0.000055066677,0.00008706671],"domain_scores_gemma":[0.9984452,0.00067138893,0.00035672146,0.00014356645,0.00019023819,0.00019298408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002303916,0.00050828874,0.00042511232,0.00041535837,0.0015687668,0.0012132971,0.00046363304,0.0009999493,0.013368248],"category_scores_gemma":[0.0016217328,0.00037673482,0.00061947136,0.0005123695,0.0013566182,0.0022519992,0.0015583868,0.0006881564,0.0027311968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037478623,0.00031834564,0.022798782,0.0012817199,0.00012349129,0.0054944204,0.006135843,0.0030393316,0.19644995,0.5641672,0.0171779,0.1792652],"study_design_scores_gemma":[0.00019102667,0.0004031962,0.021662584,0.00029454584,0.00016797592,0.0053515118,0.005146491,0.006263485,0.116508536,0.7081625,0.13559279,0.00025541897],"about_ca_topic_score_codex":0.000752075,"about_ca_topic_score_gemma":0.001725741,"teacher_disagreement_score":0.013368248,"about_ca_system_score_codex":0.00051688554,"about_ca_system_score_gemma":0.0006109387,"threshold_uncertainty_score":0.044721246},"labels":[],"label_agreement":null},{"id":"W2771131742","doi":"10.1007/s00224-018-9871-4","title":"Better Complexity Bounds for Cost Register Automata","year":2018,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Register (sociolinguistics); Computer science; Automaton; Register allocation; Theoretical computer science; Arithmetic; Parallel computing; Mathematics; Programming language","score_opus":0.05901425934316849,"score_gpt":0.2955452278681961,"score_spread":0.23653096852502759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771131742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14316913,0.007983903,0.7440227,0.01601336,0.0021468524,0.000297751,0.0017663527,0.0035706596,0.08102931],"genre_scores_gemma":[0.80706394,0.0027721291,0.14708193,0.0035023652,0.002955152,0.0007031556,0.0016675062,0.002724499,0.031529337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906935,0.0022478276,0.0005077424,0.0018854694,0.0030778062,0.0015877456],"domain_scores_gemma":[0.9424414,0.041726183,0.0015052946,0.0100079635,0.00269611,0.0016229259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005360552,0.0025972545,0.0034272887,0.0038377065,0.0025031916,0.00831675,0.0057768244,0.0036797097,0.037266996],"category_scores_gemma":[0.04138692,0.0013949104,0.0044856113,0.0034141645,0.004452425,0.031061048,0.0065603363,0.011854327,0.0039070235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006840379,0.000329976,0.00090265035,0.00047398958,0.00010274311,0.00013505327,0.0004638737,0.04744369,0.004998535,0.8920113,0.0148253115,0.037628938],"study_design_scores_gemma":[0.00006309387,0.00006265143,0.00031273148,0.000053045766,0.00008013461,0.000054036824,0.000075507785,0.12350946,0.0019313113,0.86948574,0.0043141083,0.00005829072],"about_ca_topic_score_codex":0.0032911492,"about_ca_topic_score_gemma":0.005636986,"teacher_disagreement_score":0.037266996,"about_ca_system_score_codex":0.0069181067,"about_ca_system_score_gemma":0.002914917,"threshold_uncertainty_score":0.124670506},"labels":[],"label_agreement":null},{"id":"W2771270479","doi":"10.1016/j.tcs.2018.04.019","title":"Leaf realization problem, caterpillar graphs and prefix normal words","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bijection; Simple graph; Prefix; Discrete mathematics; Graph; Simple (philosophy); Natural number; Realization (probability)","score_opus":0.006163145191917235,"score_gpt":0.22559021252530242,"score_spread":0.21942706733338518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771270479","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6545474,0.0013020715,0.279466,0.00933589,0.0002767699,0.00014021173,0.0014199567,0.0007838404,0.05272783],"genre_scores_gemma":[0.9296853,0.00092055195,0.045657832,0.0004811724,0.00022847047,0.00011878545,0.002090962,0.00017974491,0.020637102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941206,0.00014231328,0.000038989183,0.0001960549,0.000082422586,0.0001281377],"domain_scores_gemma":[0.99779606,0.0013783732,0.00020528145,0.0003129085,0.00011239617,0.0001949783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007141022,0.00045337493,0.0011241024,0.00052862446,0.0024944013,0.003456541,0.0014725303,0.0027939847,0.010553362],"category_scores_gemma":[0.0031775846,0.0005609377,0.00094317837,0.0015843877,0.0022391756,0.006316441,0.001975933,0.0023441024,0.001289916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019520156,0.00009453375,0.00066578394,0.00018467409,0.000021962773,0.00039212886,0.0006218253,0.0074043255,0.0031060237,0.9633781,0.0067117307,0.017223716],"study_design_scores_gemma":[0.000028679475,0.000016083324,0.0001384216,0.0000118155585,0.000011277646,0.00012516948,0.00029995228,0.00924323,0.0006592079,0.98714286,0.0023123738,0.000010851142],"about_ca_topic_score_codex":0.0014952937,"about_ca_topic_score_gemma":0.0017161759,"teacher_disagreement_score":0.010553362,"about_ca_system_score_codex":0.0012626492,"about_ca_system_score_gemma":0.0010398118,"threshold_uncertainty_score":0.035304487},"labels":[],"label_agreement":null},{"id":"W2782891332","doi":"10.1016/j.tcs.2018.10.017","title":"Critical exponents of infinite balanced words","year":2018,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; University of Waterloo; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Exponent; Critical exponent; Construct (python library); Word (group theory); Mathematics; Discrete mathematics; Combinatorics; Computer science; Scaling; Geometry","score_opus":0.015274009070791862,"score_gpt":0.28262871418596985,"score_spread":0.267354705115178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782891332","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.887604,0.0015983674,0.05427669,0.0018978666,0.00037208493,0.0000575418,0.0002558354,0.0002580847,0.05367957],"genre_scores_gemma":[0.9853786,0.00037313765,0.003063292,0.00014392077,0.0002755651,0.000059746333,0.00011603997,0.0000977163,0.010491995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954045,0.00012057493,0.000027618398,0.00007773462,0.000112748785,0.000120862045],"domain_scores_gemma":[0.99659014,0.00188805,0.0004151803,0.00016570477,0.00044770035,0.00049322756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077981554,0.0007608628,0.00059817114,0.0025323865,0.0013262224,0.0030761417,0.00052266277,0.00080352946,0.00763407],"category_scores_gemma":[0.007340689,0.00043562643,0.00031332712,0.00073880935,0.0022314994,0.0040640035,0.0015096248,0.0013245656,0.00083868724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011524294,0.000020542875,0.00064819364,0.000054432814,0.0000070159535,0.00020972344,0.00047349947,0.0010001911,0.0032636696,0.9889824,0.001326972,0.0038981335],"study_design_scores_gemma":[0.000041838513,0.000017678985,0.0003273538,0.000030768224,0.000008778716,0.00009398417,0.00016242416,0.006622464,0.0011800927,0.98921204,0.0022900028,0.0000125882725],"about_ca_topic_score_codex":0.00050981407,"about_ca_topic_score_gemma":0.0006132109,"teacher_disagreement_score":0.00763407,"about_ca_system_score_codex":0.0011775414,"about_ca_system_score_gemma":0.00051830546,"threshold_uncertainty_score":0.025538504},"labels":[],"label_agreement":null},{"id":"W2786516640","doi":"10.1142/s0129054113400133","title":"IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Regular language; Combinatorics; Concatenation (mathematics); State (computer science); Quotient; Alphabet; Permutation (music); Discrete mathematics; Integer (computer science); Binary logarithm; Automaton; Algorithm; Computer science; Physics","score_opus":0.020012000271576177,"score_gpt":0.32110049861142975,"score_spread":0.30108849833985357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786516640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22559924,0.0015477991,0.7609836,0.00085045083,0.000066966924,0.0002515362,0.000882489,0.0012782533,0.008539733],"genre_scores_gemma":[0.55507046,0.0013457001,0.43270174,0.00035000054,0.0002428569,0.00040059473,0.002603388,0.000391908,0.006893323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793243,0.00050361385,0.00015059864,0.0005805328,0.00065187516,0.00018090048],"domain_scores_gemma":[0.99247426,0.004991744,0.00094509416,0.000808412,0.0005649064,0.00021552193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018666568,0.0007884946,0.0012190342,0.002279284,0.0007150092,0.0033338177,0.0010833642,0.00088161416,0.0030025754],"category_scores_gemma":[0.0115193995,0.00076970214,0.0013835601,0.0019887516,0.0016122413,0.0044117025,0.001857539,0.0013030656,0.00089356693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002001089,0.0003361681,0.020720255,0.0029841086,0.00045968193,0.0025270067,0.0023651265,0.13642909,0.049604267,0.46634933,0.00862449,0.3075994],"study_design_scores_gemma":[0.000108775836,0.0003859713,0.0024378279,0.00017383357,0.00014243902,0.001454511,0.000944577,0.47852275,0.016196571,0.47774023,0.02181,0.000082486215],"about_ca_topic_score_codex":0.0006855727,"about_ca_topic_score_gemma":0.00076448574,"teacher_disagreement_score":0.0033338177,"about_ca_system_score_codex":0.0009645471,"about_ca_system_score_gemma":0.0011725314,"threshold_uncertainty_score":0.010044634},"labels":[],"label_agreement":null},{"id":"W2787777282","doi":"10.5539/jmr.v10n2p24","title":"Regularity and Green's Relations for Generalized Semigroups of Transformations with Invariant Set","year":2018,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Semigroup; Combinatorics; Invariant (physics); Discrete mathematics; Mathematical physics","score_opus":0.08349271056879606,"score_gpt":0.35714500524810566,"score_spread":0.2736522946793096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787777282","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.657594,0.0006714859,0.2907438,0.0010327734,0.00021034737,0.00010837476,0.00040615624,0.00036719747,0.04886582],"genre_scores_gemma":[0.9476456,0.00023064675,0.041135088,0.0001781294,0.00019281184,0.00013897255,0.00029985196,0.000083443316,0.0100954715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988373,0.00027209113,0.00008931379,0.00032704475,0.000287702,0.00018662798],"domain_scores_gemma":[0.99746215,0.0012482146,0.0003322309,0.00032367022,0.00031254883,0.00032105955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014867634,0.0003591433,0.0005293329,0.0012865487,0.0015248982,0.0014769448,0.00065341627,0.0006214846,0.0028732999],"category_scores_gemma":[0.0033380268,0.00030560757,0.0010248384,0.0008080051,0.0033950147,0.0026931074,0.0014774449,0.0013312958,0.00039112012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032396838,0.00000970812,0.00028552575,0.00001537948,0.0000055647274,0.00009387693,0.0005594798,0.00068712886,0.0019783552,0.9930561,0.00025302454,0.0030234721],"study_design_scores_gemma":[0.000017967528,0.000042224798,0.0006779203,0.000010118086,0.000010395773,0.0002096787,0.0002068392,0.007672297,0.0016917246,0.9854211,0.0040181177,0.00002168757],"about_ca_topic_score_codex":0.0008834351,"about_ca_topic_score_gemma":0.00086242653,"teacher_disagreement_score":0.0028732999,"about_ca_system_score_codex":0.001065538,"about_ca_system_score_gemma":0.0006312483,"threshold_uncertainty_score":0.009612143},"labels":[],"label_agreement":null},{"id":"W2788443823","doi":"10.1007/978-3-319-73216-9_17","title":"Input-Position-Restricted Models of Language Acceptors","year":2018,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Nondeterministic algorithm; Position (finance); Computer science; Class (philosophy); Algorithm; Bounded function; Mathematics; Artificial intelligence","score_opus":0.044618863842752675,"score_gpt":0.27305922008322947,"score_spread":0.2284403562404768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788443823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10539824,0.0012183938,0.74274117,0.002701666,0.00041186175,0.00009834841,0.00060163974,0.0012693811,0.1455593],"genre_scores_gemma":[0.89822656,0.00080148724,0.062186826,0.00033689273,0.00029572565,0.00020207492,0.0005759245,0.00048072793,0.036893737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880564,0.00044721493,0.0000801495,0.00020946075,0.00030059743,0.00015691492],"domain_scores_gemma":[0.9976192,0.001327971,0.0001088543,0.00052164326,0.00028739197,0.00013488518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013404526,0.0007348351,0.0007918284,0.0006432183,0.0010389339,0.0049174004,0.00185621,0.0018052515,0.009569744],"category_scores_gemma":[0.004907408,0.0006294007,0.0012624424,0.00067278615,0.003397326,0.006283021,0.001986943,0.0037853497,0.0024597652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000138044,0.0000068728614,0.00003884506,0.000020573107,0.000002475474,0.000033913526,0.0001435705,0.0018389873,0.0004952195,0.9953607,0.0004769572,0.0015680977],"study_design_scores_gemma":[0.0000072051075,0.0000046421237,0.000017875584,0.0000083128225,0.0000030807912,0.00003064538,0.000022010905,0.014444406,0.0003475592,0.9836826,0.001426925,0.0000048100146],"about_ca_topic_score_codex":0.00062955037,"about_ca_topic_score_gemma":0.0006646338,"teacher_disagreement_score":0.009569744,"about_ca_system_score_codex":0.0014262024,"about_ca_system_score_gemma":0.0008413422,"threshold_uncertainty_score":0.032013953},"labels":[],"label_agreement":null},{"id":"W2788967239","doi":"10.1090/tran/7762","title":"Becker’s conjecture on Mahler functions","year":2019,"lang":"en","type":"preprint","venue":"Transactions of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Mathematics; Integer (computer science); Polynomial; Combinatorics; Rational function; Function (biology); Power series; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.015532435128295144,"score_gpt":0.251137186422282,"score_spread":0.23560475129398686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788967239","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14779773,0.0055482946,0.21136579,0.06638521,0.001935284,0.00013682374,0.002540307,0.0016804043,0.56261015],"genre_scores_gemma":[0.84308237,0.0034120579,0.033439297,0.010219709,0.002599904,0.00039809744,0.0015176573,0.00064450013,0.1046864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962746,0.0009860109,0.00018500815,0.0007426117,0.0011040901,0.0007076875],"domain_scores_gemma":[0.9851185,0.011032785,0.00054788485,0.0013262026,0.0012924764,0.0006821988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004631635,0.0015156514,0.002045834,0.0039339983,0.003971336,0.005527957,0.0023643216,0.0046886913,0.02433187],"category_scores_gemma":[0.0247622,0.00092239195,0.0025184506,0.0030624075,0.007804958,0.012684158,0.005956883,0.0062686987,0.0051828464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000320628,0.000013830473,0.00020316853,0.000050232662,0.000010287958,0.000032037617,0.0001296811,0.00078290625,0.00008504857,0.98957074,0.005296575,0.003793417],"study_design_scores_gemma":[0.000019633808,0.000010005825,0.00010314179,0.00003116533,0.000008348077,0.000031155465,0.000044416312,0.0021401765,0.00017343648,0.99149656,0.005925806,0.00001614528],"about_ca_topic_score_codex":0.0026022757,"about_ca_topic_score_gemma":0.0023726793,"teacher_disagreement_score":0.02433187,"about_ca_system_score_codex":0.006094043,"about_ca_system_score_gemma":0.0024472147,"threshold_uncertainty_score":0.08139819},"labels":[],"label_agreement":null},{"id":"W2790789623","doi":"","title":"Hereditary hemimorphy of {5, -4}-hemimorphic arc connected digraphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arc (geometry); Mathematics; Combinatorics; Geometry","score_opus":0.009607700113445904,"score_gpt":0.21796445153209554,"score_spread":0.20835675141864962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790789623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8605686,0.00030969814,0.026124697,0.00039245398,0.0000634181,0.000038812355,0.0011143723,0.00024720456,0.11114085],"genre_scores_gemma":[0.9832999,0.00009521909,0.004814804,0.00007813492,0.000020611495,0.000020878992,0.00063927507,0.00002169362,0.011009568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997694,0.000047971367,0.0000148077015,0.00006501925,0.000038985945,0.0000639068],"domain_scores_gemma":[0.99923337,0.00036166437,0.00014267454,0.000087115106,0.0000637822,0.000111429574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012776941,0.00021454401,0.00022281348,0.0007647492,0.0011885546,0.0013319898,0.00038988158,0.00044568934,0.009917203],"category_scores_gemma":[0.00069730333,0.00028323912,0.00029617926,0.00068729743,0.00081889087,0.00088991894,0.000655359,0.0005188551,0.0006861587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000173036,0.000053528034,0.00243181,0.00012341888,0.000036464953,0.0010742476,0.00058174855,0.0034166113,0.0075399177,0.96508384,0.0038071007,0.01567836],"study_design_scores_gemma":[0.000082409824,0.0000807209,0.006189627,0.00006380666,0.000088471286,0.0016383595,0.0008852016,0.015612367,0.0078024245,0.9462303,0.021286337,0.000039818533],"about_ca_topic_score_codex":0.0013228215,"about_ca_topic_score_gemma":0.0024830406,"teacher_disagreement_score":0.009917203,"about_ca_system_score_codex":0.00065581914,"about_ca_system_score_gemma":0.00036991164,"threshold_uncertainty_score":0.033176363},"labels":[],"label_agreement":null},{"id":"W2791126244","doi":"10.23638/lmcs-15(1:11)2019","title":"The Subpower Membership Problem for Finite Algebras with Cube Terms","year":2019,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund; Austrian Science Fund; National Science Foundation","keywords":"Mathematics; Subalgebra; Variety (cybernetics); Tuple; Constraint satisfaction problem; Finite set; Cube (algebra); Combinatorics; Set (abstract data type); Discrete mathematics; Direct product; Product (mathematics); Algebra over a field; Pure mathematics; Computer science","score_opus":0.06249495354962712,"score_gpt":0.36465759795693997,"score_spread":0.30216264440731283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791126244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2498404,0.00100218,0.72536516,0.005994358,0.00013364693,0.00037122096,0.0012698505,0.000978747,0.015044472],"genre_scores_gemma":[0.74742436,0.00091904984,0.23814392,0.00081988814,0.00048506423,0.00033747975,0.0029341322,0.00022713743,0.008708986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967996,0.001008445,0.0002526205,0.0008067482,0.00084613485,0.00028636903],"domain_scores_gemma":[0.98627985,0.010900953,0.000645962,0.0010426785,0.0005789174,0.0005516703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030539727,0.0005404202,0.001045374,0.000885753,0.00172184,0.0032349634,0.0020698858,0.0015982502,0.0052229147],"category_scores_gemma":[0.0155462455,0.0006177315,0.0022264917,0.0014301329,0.0039406777,0.013334611,0.0034182,0.003984311,0.00080187956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035282577,0.00023640075,0.0027567972,0.0004402069,0.00006770553,0.00045658395,0.0017137254,0.026561774,0.00489005,0.8970118,0.00645194,0.05906016],"study_design_scores_gemma":[0.000033908123,0.000036187175,0.00027361047,0.000027700036,0.000021855329,0.00020234947,0.00029224707,0.049777176,0.0028394323,0.9433057,0.0031683212,0.000021507485],"about_ca_topic_score_codex":0.0024795095,"about_ca_topic_score_gemma":0.0017835406,"teacher_disagreement_score":0.0052229147,"about_ca_system_score_codex":0.0019102687,"about_ca_system_score_gemma":0.001959648,"threshold_uncertainty_score":0.017472386},"labels":[],"label_agreement":null},{"id":"W2793662473","doi":"10.4230/lipics.stacs.2018.54","title":"Sums of Palindromes: an Approach via Automata","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Palindrome; Natural number; Automaton; Base (topology); Representation (politics); Combinatorics; Constant (computer programming); Mathematics; Natural (archaeology); Discrete mathematics; Computer science; Theoretical computer science","score_opus":0.016344549135428415,"score_gpt":0.26225920579889506,"score_spread":0.24591465666346665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793662473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031330116,0.0022440716,0.9442293,0.0012389112,0.00033621438,0.000121814875,0.00015859438,0.0003855496,0.01995529],"genre_scores_gemma":[0.33132905,0.0015460487,0.6542704,0.00058575213,0.00076767715,0.00036331455,0.0003136705,0.00034429075,0.010479697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960245,0.0014674976,0.0003875132,0.00097653776,0.0008964206,0.00024749548],"domain_scores_gemma":[0.9938498,0.004026308,0.0003396051,0.00092346943,0.0005929826,0.0002678697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031921978,0.0011933418,0.0016820799,0.0033897124,0.0020843965,0.005030676,0.0031580492,0.0017263136,0.006851376],"category_scores_gemma":[0.009419452,0.0014999355,0.0037152166,0.0016008614,0.0048011784,0.010506076,0.004504921,0.0047547575,0.0013810792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049616356,0.00003071207,0.00019884283,0.00009554222,0.000030819603,0.00011291053,0.0002873151,0.00459757,0.001527453,0.9820004,0.00052150275,0.0105472375],"study_design_scores_gemma":[0.000012670175,0.000020434152,0.000040667357,0.000028450997,0.000016285452,0.000066047476,0.00004511015,0.027284706,0.00096592196,0.96752733,0.0039742677,0.00001805927],"about_ca_topic_score_codex":0.0006795974,"about_ca_topic_score_gemma":0.001000921,"teacher_disagreement_score":0.006851376,"about_ca_system_score_codex":0.0020002543,"about_ca_system_score_gemma":0.00080434146,"threshold_uncertainty_score":0.022920132},"labels":[],"label_agreement":null},{"id":"W2794110009","doi":"10.1515/udt-2017-0013","title":"Palindromic Closures and Thue-Morse Substitution for Markoff Numbers","year":2017,"lang":"en","type":"article","venue":"Uniform distribution theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Closure (psychology); Palindrome; Iterated function; Substitution (logic); Mathematics; Fibonacci number; Combinatorics; Word (group theory); Morse code; State (computer science); Discrete mathematics; Computer science; Algorithm; Geometry; Mathematical analysis","score_opus":0.011275225272347702,"score_gpt":0.25504062010601153,"score_spread":0.24376539483366383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794110009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2579523,0.00057413656,0.7090514,0.00029531828,0.00031307433,0.000102494785,0.00010387222,0.0005604584,0.031046964],"genre_scores_gemma":[0.85982436,0.00026196777,0.13328126,0.00014132261,0.00016508537,0.00015220435,0.00011455421,0.00019475384,0.0058643697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990257,0.0001983757,0.00008162242,0.00017393578,0.00036817434,0.00015230065],"domain_scores_gemma":[0.99835,0.00089569454,0.00013441134,0.00022201023,0.00029072026,0.0001072095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013770577,0.00046512525,0.0006947609,0.0018270739,0.0010119375,0.0018461302,0.0010698375,0.00081901456,0.004442207],"category_scores_gemma":[0.0072372365,0.00032990793,0.00083526416,0.0009547021,0.0027542976,0.003441767,0.0015548465,0.0014969413,0.0010867615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006133474,0.000024823907,0.00063001795,0.00003908754,0.0000075559756,0.00019306173,0.0003173405,0.0028339576,0.0042569265,0.97067183,0.0004556726,0.020508388],"study_design_scores_gemma":[0.000027496772,0.00008521511,0.00055628526,0.000057123056,0.00001970317,0.0003710985,0.0002057508,0.04028798,0.012048615,0.93738616,0.008904053,0.000050406976],"about_ca_topic_score_codex":0.0006226114,"about_ca_topic_score_gemma":0.0006439829,"teacher_disagreement_score":0.004442207,"about_ca_system_score_codex":0.00088053953,"about_ca_system_score_gemma":0.0005868059,"threshold_uncertainty_score":0.01486069},"labels":[],"label_agreement":null},{"id":"W2795834488","doi":"10.1142/s0218196718500285","title":"Birecurrent sets","year":2018,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Series (stratigraphy); Set (abstract data type); Automaton; Representation (politics); Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics; Theoretical computer science; Computer science","score_opus":0.01246235517186945,"score_gpt":0.2920277872573106,"score_spread":0.27956543208544116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795834488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.626994,0.00085939094,0.28086817,0.00040878664,0.00020865323,0.00018586271,0.0010699603,0.0017335465,0.08767161],"genre_scores_gemma":[0.95710105,0.0002173706,0.03018532,0.00014581997,0.000100445934,0.00011107032,0.00076926965,0.0001342816,0.011235351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883324,0.00010919547,0.00011802781,0.00041799425,0.00032452063,0.00019705787],"domain_scores_gemma":[0.99855334,0.0003916821,0.00017085389,0.0003786861,0.00036661167,0.00013877968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005275722,0.0004312215,0.00050846924,0.0014275971,0.0011360846,0.0018943849,0.0009722803,0.00048606377,0.0064769126],"category_scores_gemma":[0.0019390538,0.00030198196,0.0008105862,0.000612976,0.0019643577,0.003493262,0.0016609423,0.0009091885,0.000900744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011787426,0.00008025419,0.0016729896,0.00013793283,0.000033908338,0.00055245205,0.0009668099,0.0019026435,0.016640818,0.94803476,0.0010200297,0.028839497],"study_design_scores_gemma":[0.000038162398,0.00017938657,0.0017835759,0.0000755777,0.000092108625,0.0012696652,0.0006177085,0.020333845,0.026901456,0.92281765,0.025827631,0.00006312423],"about_ca_topic_score_codex":0.0005347036,"about_ca_topic_score_gemma":0.00057817827,"teacher_disagreement_score":0.0064769126,"about_ca_system_score_codex":0.0006540452,"about_ca_system_score_gemma":0.00041583512,"threshold_uncertainty_score":0.02166742},"labels":[],"label_agreement":null},{"id":"W2797999682","doi":"10.1142/s0129054118400099","title":"State Complexity of Neighbourhoods and Approximate Pattern Matching","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Substring; Neighbourhood (mathematics); Mathematics; Combinatorics; Upper and lower bounds; Deterministic finite automaton; State (computer science); Nondeterministic algorithm; String (physics); Discrete mathematics; Finite-state machine; Set (abstract data type); Computer science; Algorithm","score_opus":0.026187599199695585,"score_gpt":0.303750500253681,"score_spread":0.2775629010539854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797999682","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7047003,0.00037686928,0.281956,0.0013261853,0.00004612862,0.00012802402,0.001342022,0.0014790164,0.008645447],"genre_scores_gemma":[0.9642821,0.0001319783,0.03045403,0.000097831886,0.0000396304,0.00016814534,0.0011098229,0.0002054972,0.0035109518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99467,0.0009228052,0.00057876075,0.0013693317,0.0016659498,0.0007931118],"domain_scores_gemma":[0.97362095,0.01765152,0.0016128842,0.0048385975,0.0014549311,0.00082109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019171442,0.00056846533,0.0014603358,0.0012008196,0.0014571816,0.0041338108,0.002991974,0.0017050073,0.0076201605],"category_scores_gemma":[0.020564765,0.00075635465,0.0021300025,0.0016064116,0.0027409224,0.009043702,0.0039652484,0.0023274524,0.000733447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023687738,0.00041814864,0.012714677,0.00070913724,0.00022287005,0.000504184,0.0014213679,0.46182552,0.030198364,0.41375992,0.0034257807,0.07243114],"study_design_scores_gemma":[0.0000493299,0.00012586758,0.0014021811,0.000021779213,0.00007960444,0.00015858116,0.00010182971,0.5861783,0.010240694,0.40057918,0.00100699,0.000055575776],"about_ca_topic_score_codex":0.002838161,"about_ca_topic_score_gemma":0.0023392844,"teacher_disagreement_score":0.0076201605,"about_ca_system_score_codex":0.002860171,"about_ca_system_score_gemma":0.0017715254,"threshold_uncertainty_score":0.025491953},"labels":[],"label_agreement":null},{"id":"W2798578734","doi":"","title":"Nonlinear Weighted Finite Automata","year":2018,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Nonlinear system; Computer science; Automaton; Finite-state machine; Algorithm; Theoretical computer science; Physics","score_opus":0.08505758686459591,"score_gpt":0.3371786691107923,"score_spread":0.2521210822461964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798578734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09333232,0.0016023244,0.8077467,0.0022033716,0.0012601605,0.000091113296,0.00066794216,0.0009518448,0.09214414],"genre_scores_gemma":[0.7327438,0.0013508648,0.12780371,0.00036148168,0.00038116088,0.00020780135,0.0011367196,0.00035972372,0.13565467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964476,0.00007255139,0.000027737002,0.00012725251,0.00009553879,0.00003208326],"domain_scores_gemma":[0.99903536,0.00030588117,0.00005005965,0.00021459699,0.00030690007,0.00008726596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051516475,0.00050629413,0.0005283582,0.0006725621,0.00084755453,0.001663621,0.0006054461,0.0006116938,0.010879434],"category_scores_gemma":[0.0024272455,0.00024348088,0.0006786896,0.00056500774,0.0009962602,0.002167138,0.0013329097,0.0011867519,0.0021181966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084106745,0.000042052914,0.0006029949,0.00009914309,0.00003165276,0.00012618299,0.00024918796,0.018253349,0.01056819,0.89688176,0.004840552,0.06822086],"study_design_scores_gemma":[0.000010006034,0.000030441817,0.00040847834,0.000028676779,0.000030422083,0.00012607848,0.000080180565,0.14842786,0.0057069324,0.8077,0.03742573,0.000025259114],"about_ca_topic_score_codex":0.001476068,"about_ca_topic_score_gemma":0.0014138477,"teacher_disagreement_score":0.010879434,"about_ca_system_score_codex":0.0011590923,"about_ca_system_score_gemma":0.0008182267,"threshold_uncertainty_score":0.03639531},"labels":[],"label_agreement":null},{"id":"W2798699651","doi":"10.1142/s0129054120410014","title":"Additive Number Theory via Approximation by Regular Languages","year":2020,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Natural number; Mathematics; Base (topology); Formal language; Regular language; Number theory; Discrete mathematics; Automaton; Representation (politics); Combinatorics; Computer science; Theoretical computer science; Algorithm","score_opus":0.008711594732859467,"score_gpt":0.27563610870373884,"score_spread":0.26692451397087935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798699651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074459836,0.00087777607,0.8941443,0.001357182,0.00034050006,0.00006148241,0.00014648636,0.0008560889,0.027756399],"genre_scores_gemma":[0.7603132,0.0010475578,0.22090736,0.0008567581,0.0006989859,0.00020927512,0.00031044224,0.0002960298,0.015360295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962525,0.000974749,0.0002666842,0.000928832,0.001205151,0.00037207388],"domain_scores_gemma":[0.9919842,0.0052846484,0.0005321694,0.001278421,0.0006276136,0.0002930039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028706437,0.0010495861,0.0013509027,0.0024187658,0.0014109637,0.00384048,0.0021371208,0.00092754536,0.005503326],"category_scores_gemma":[0.01191876,0.00065074704,0.0027569118,0.0019034804,0.004636845,0.010136117,0.0040170355,0.0041745002,0.0013099893],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005186916,0.00002892879,0.0002874167,0.00006617801,0.00001978264,0.00009907378,0.0002776458,0.004908251,0.0011585419,0.9811755,0.0007203061,0.011206527],"study_design_scores_gemma":[0.000016920672,0.000034779412,0.00011028215,0.000019985875,0.000034686134,0.00013625147,0.00004790468,0.03265397,0.0019163956,0.96071744,0.004292764,0.00001859186],"about_ca_topic_score_codex":0.00072508445,"about_ca_topic_score_gemma":0.00060432823,"teacher_disagreement_score":0.005503326,"about_ca_system_score_codex":0.0017570698,"about_ca_system_score_gemma":0.00070996536,"threshold_uncertainty_score":0.018410444},"labels":[],"label_agreement":null},{"id":"W2798939578","doi":"10.1007/978-3-319-98654-8_19","title":"Counting Subwords and Regular Languages","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Arithmetic; Combinatorics; Word (group theory); Discrete mathematics; Mathematics; Geometry","score_opus":0.008474628084336331,"score_gpt":0.2309994693236953,"score_spread":0.22252484123935898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798939578","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07946848,0.014566574,0.40211225,0.0040301797,0.0025617846,0.00017435639,0.00055938907,0.0021334812,0.4943935],"genre_scores_gemma":[0.49389377,0.010490002,0.15492278,0.0015108678,0.0032115632,0.0005928027,0.0016619277,0.0017457295,0.3319706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893886,0.00023957169,0.000092226146,0.00024151216,0.00038103203,0.000106858795],"domain_scores_gemma":[0.99817514,0.0010556673,0.00013328502,0.00023792346,0.00029019156,0.00010773737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072314165,0.0011978779,0.0012573381,0.002847435,0.0013515314,0.0035329103,0.0015447175,0.0011495699,0.011967952],"category_scores_gemma":[0.004440194,0.0007363296,0.00086099,0.0035746086,0.0021897138,0.0074694087,0.0018524058,0.0023695505,0.0043976232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022134449,0.000022224027,0.00010827548,0.000117949065,0.0000076249166,0.000045562403,0.00016975467,0.0005453493,0.0008318281,0.94251883,0.00797604,0.047634423],"study_design_scores_gemma":[0.000003659251,0.0000061947835,0.000059261893,0.000028425136,0.00000837079,0.00009182619,0.000033227123,0.0015373183,0.0005387157,0.98148847,0.016195346,0.00000917087],"about_ca_topic_score_codex":0.00055506366,"about_ca_topic_score_gemma":0.0006212969,"teacher_disagreement_score":0.011967952,"about_ca_system_score_codex":0.0015616808,"about_ca_system_score_gemma":0.0008182435,"threshold_uncertainty_score":0.040036798},"labels":[],"label_agreement":null},{"id":"W2802228513","doi":"10.1142/s0129054118420017","title":"Rigidity and Substitutive Dendric Words","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Aperiodic graph; Rigidity (electromagnetism); Algebraic number; Word (group theory); Extension (predicate logic); Discrete mathematics; Class (philosophy); Graph; Computer science; Artificial intelligence","score_opus":0.014958775711966481,"score_gpt":0.29957644344810586,"score_spread":0.2846176677361394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802228513","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78588206,0.00083492,0.14050503,0.0004811409,0.00013809859,0.000047181857,0.00034860545,0.00032726035,0.07143565],"genre_scores_gemma":[0.9720518,0.00020878746,0.01746547,0.000116653304,0.00006167797,0.000035227506,0.00020911245,0.000055972738,0.009795223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993167,0.000115140465,0.000060184335,0.00021009221,0.00019310832,0.0001048048],"domain_scores_gemma":[0.9989391,0.00036340675,0.0002073204,0.00019625481,0.00017151506,0.0001224437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033723787,0.00036203588,0.00035333837,0.0008584379,0.0013447981,0.0011464806,0.0004738268,0.00072668004,0.0049542463],"category_scores_gemma":[0.0014114026,0.00037263753,0.00049214764,0.0005275878,0.002735819,0.0019387649,0.00137472,0.00091833354,0.0010446546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006873215,0.000011710787,0.00041099128,0.000045756853,0.0000055882656,0.00030000706,0.0005266576,0.002113674,0.009373027,0.98090655,0.00037154905,0.005865678],"study_design_scores_gemma":[0.000020272699,0.000077771096,0.0012911538,0.000034912355,0.000017140574,0.0011458347,0.00046997837,0.011243545,0.010430968,0.9629101,0.012305463,0.00005285532],"about_ca_topic_score_codex":0.00053064735,"about_ca_topic_score_gemma":0.00053827104,"teacher_disagreement_score":0.0049542463,"about_ca_system_score_codex":0.0005943723,"about_ca_system_score_gemma":0.00028781424,"threshold_uncertainty_score":0.016573608},"labels":[],"label_agreement":null},{"id":"W2802872846","doi":"10.1142/s0129054120420010","title":"Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels","year":2020,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Regular language; Regular expression; Invariant (physics); Automaton; Alphabet; String (physics); Prefix; Decision problem; Discrete mathematics; Formal language; Mathematics; Graph; Predicate (mathematical logic); Word (group theory); Decidability; Computer science; Theoretical computer science; Algorithm; Programming language","score_opus":0.016306984253055712,"score_gpt":0.26942994187874125,"score_spread":0.25312295762568554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802872846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011143452,0.00020591426,0.97723174,0.00063287624,0.00015431004,0.000082588485,0.00029235406,0.0011713338,0.009085441],"genre_scores_gemma":[0.24863894,0.0006694934,0.73346335,0.0007948156,0.00047955898,0.00067487557,0.0011328472,0.0009193502,0.013226806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9900635,0.003115031,0.001025594,0.002824949,0.0022379302,0.0007328845],"domain_scores_gemma":[0.9867006,0.0072670267,0.0010742146,0.0032927,0.0013283718,0.00033711136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005097726,0.00079590885,0.0008310233,0.0016674893,0.0013680389,0.0040494218,0.0022218577,0.0018680566,0.0050829826],"category_scores_gemma":[0.01589247,0.0010467861,0.0022018966,0.0022356596,0.008799577,0.012515578,0.0029215019,0.003833922,0.001789654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003784708,0.000015851196,0.00022708227,0.00005718806,0.000008978066,0.00010811676,0.0004535246,0.0024724603,0.001474834,0.98485106,0.0008450344,0.009447952],"study_design_scores_gemma":[0.000015575864,0.000028603465,0.000102887905,0.00004299642,0.00002804498,0.00014046274,0.00013654724,0.015571768,0.003342842,0.965462,0.015096596,0.00003163459],"about_ca_topic_score_codex":0.001185413,"about_ca_topic_score_gemma":0.0011852116,"teacher_disagreement_score":0.005097726,"about_ca_system_score_codex":0.0016306357,"about_ca_system_score_gemma":0.0019786214,"threshold_uncertainty_score":0.026959717},"labels":[],"label_agreement":null},{"id":"W2803866596","doi":"10.4171/jca/39","title":"On the complexity of the cogrowth sequence","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Cayley graph; Sequence (biology); Combinatorics; Generating set of a group; Mathematics; Set (abstract data type); Graph; Group (periodic table); Finitely-generated abelian group; Discrete mathematics; Computer science","score_opus":0.058327331036721046,"score_gpt":0.26513548195462605,"score_spread":0.206808150917905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803866596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9175379,0.0009640684,0.06067951,0.004169141,0.0000879312,0.00006178697,0.00082487176,0.00029626503,0.015378482],"genre_scores_gemma":[0.98811615,0.00040981526,0.0072182096,0.00018529895,0.00025041605,0.00011006759,0.00058526883,0.00008250619,0.00304222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973552,0.0008009423,0.00015997319,0.00064514525,0.00060800597,0.0004306793],"domain_scores_gemma":[0.9360753,0.054861765,0.0035600618,0.0021404792,0.0013370388,0.0020253912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025786539,0.0005562511,0.0015002692,0.0024368346,0.0016239038,0.0053160945,0.0024455355,0.0024329026,0.005475493],"category_scores_gemma":[0.029338876,0.00071309163,0.00089398,0.0020498703,0.004958651,0.010713277,0.002975099,0.0030848444,0.0005649668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067943253,0.00016375628,0.010371072,0.00028183835,0.00006947679,0.00042567746,0.00128593,0.064377405,0.004266171,0.89679384,0.0035549763,0.017730385],"study_design_scores_gemma":[0.000048653128,0.0000586245,0.0014439814,0.000028563865,0.00001986466,0.0002322836,0.00011704205,0.12973142,0.0011701141,0.86612755,0.0009793468,0.00004261141],"about_ca_topic_score_codex":0.0014350872,"about_ca_topic_score_gemma":0.00074395986,"teacher_disagreement_score":0.005475493,"about_ca_system_score_codex":0.002688319,"about_ca_system_score_gemma":0.0011739362,"threshold_uncertainty_score":0.019505203},"labels":[],"label_agreement":null},{"id":"W2804472712","doi":"10.4230/lipics.cpm.2018.6","title":"Nearest constrained circular words","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Point (geometry); Computer science; Word (group theory); Polynomial; Dynamic programming; Algorithm; Time complexity; Mathematical optimization; Mathematics; Geometry; Mathematical analysis","score_opus":0.017279605229506646,"score_gpt":0.2567727694223453,"score_spread":0.23949316419283864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804472712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29007187,0.0017014104,0.678334,0.0010459329,0.00043037863,0.00022292633,0.0010879145,0.0006901357,0.026415413],"genre_scores_gemma":[0.69879556,0.00078815856,0.27367395,0.00046878832,0.00022151343,0.00033754646,0.0022354661,0.0004789292,0.023000093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859256,0.0002531555,0.00013882155,0.00059078797,0.00026222106,0.00016248065],"domain_scores_gemma":[0.99631834,0.002021236,0.00054566376,0.00048220262,0.00035835363,0.0002742464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005005582,0.00065288716,0.00080332236,0.0010106147,0.0019684443,0.0017135296,0.0013536027,0.0016320118,0.012608458],"category_scores_gemma":[0.0055739144,0.0005563738,0.00094829104,0.001245087,0.0018406083,0.0043565063,0.0022402648,0.0012516695,0.0022212816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005449966,0.00016422893,0.002285382,0.0008807302,0.00007427424,0.001381958,0.001473846,0.08357658,0.017373737,0.78740674,0.0072455397,0.09759189],"study_design_scores_gemma":[0.0000481857,0.00015157842,0.0005442383,0.000097038595,0.000040068986,0.00082991103,0.0007336064,0.11341368,0.006464682,0.85120547,0.026392812,0.00007861896],"about_ca_topic_score_codex":0.0011963847,"about_ca_topic_score_gemma":0.0011699944,"teacher_disagreement_score":0.012608458,"about_ca_system_score_codex":0.0008174186,"about_ca_system_score_gemma":0.00071367086,"threshold_uncertainty_score":0.042179525},"labels":[],"label_agreement":null},{"id":"W2805347351","doi":"10.37236/7985","title":"Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Repetition (rhetorical device); Mathematics; Infimum and supremum; Word (group theory); Exponent; Physics; Geometry; Philosophy","score_opus":0.012828629700556458,"score_gpt":0.22911369206267942,"score_spread":0.21628506236212297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805347351","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6405224,0.00306558,0.1474937,0.011946818,0.00096962514,0.00014516503,0.0012192529,0.0028604926,0.19177696],"genre_scores_gemma":[0.9730059,0.00046777778,0.014393031,0.0014932943,0.0006320992,0.0001355652,0.00044354526,0.0003007324,0.00912799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997177,0.0005575933,0.00024815835,0.0007142089,0.0007209334,0.00058197853],"domain_scores_gemma":[0.9855437,0.00979961,0.00095883996,0.0021450683,0.00077656563,0.00077624567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021634263,0.0006727201,0.0012531738,0.001381916,0.0020781553,0.0038589546,0.0014930633,0.002151372,0.0110072205],"category_scores_gemma":[0.01661127,0.0006054787,0.0013465201,0.0013048546,0.004506375,0.0057276553,0.0035273232,0.004021592,0.002444376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004505839,0.0000775312,0.0017018812,0.0001986268,0.000028870925,0.0006164616,0.0010969491,0.004934252,0.0039685224,0.96089065,0.007538898,0.01849668],"study_design_scores_gemma":[0.000065837165,0.000059094116,0.00066085556,0.000043744643,0.00002237501,0.0003150852,0.0001725884,0.017875664,0.0019567492,0.9744461,0.0043320935,0.00004987902],"about_ca_topic_score_codex":0.000960094,"about_ca_topic_score_gemma":0.00056451274,"teacher_disagreement_score":0.0110072205,"about_ca_system_score_codex":0.001368237,"about_ca_system_score_gemma":0.0008044143,"threshold_uncertainty_score":0.036822796},"labels":[],"label_agreement":null},{"id":"W2810127451","doi":"10.1007/978-3-319-98654-8_21","title":"A General Approach to State Complexity of Operations: Formalization and Limitations","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unary operation; Arity; Computer science; Complement (music); State (computer science); Regular language; Class (philosophy); Automaton; Set (abstract data type); Tuple; Theoretical computer science; Finite-state machine; Deterministic finite automaton; Transformation (genetics); Time complexity; Algorithm; Discrete mathematics; Programming language; Mathematics; Artificial intelligence","score_opus":0.05043347692059187,"score_gpt":0.2581152853837025,"score_spread":0.20768180846311063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810127451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007655592,0.0017316497,0.9614811,0.0028839572,0.00020374748,0.00010414306,0.00022952665,0.0003942733,0.025315987],"genre_scores_gemma":[0.43382215,0.0047935457,0.5351273,0.0013351751,0.0016952781,0.0010328504,0.00060702045,0.0008735412,0.020713098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9915379,0.0018470006,0.00078128575,0.0018015516,0.0034095831,0.0006226791],"domain_scores_gemma":[0.95965135,0.02806087,0.000920082,0.007993219,0.0026732294,0.0007011514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074960645,0.0023155161,0.0028072216,0.0033192872,0.0018974853,0.008444789,0.007307799,0.0034460695,0.014062305],"category_scores_gemma":[0.029265119,0.001611247,0.0042313887,0.004942662,0.01257028,0.043247856,0.007225916,0.012645187,0.0017138966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014355767,0.000019338218,0.00008145492,0.000118109,0.000009751886,0.000014601862,0.00010365559,0.004032769,0.00034405573,0.98450005,0.0008003545,0.0099614905],"study_design_scores_gemma":[0.0000053063145,0.000011746252,0.000047548874,0.000019927955,0.000011886889,0.000032888525,0.000025357149,0.029600047,0.00054410036,0.96717894,0.002511777,0.0000105248955],"about_ca_topic_score_codex":0.0018633548,"about_ca_topic_score_gemma":0.0014713466,"teacher_disagreement_score":0.014062305,"about_ca_system_score_codex":0.004748746,"about_ca_system_score_gemma":0.0029147062,"threshold_uncertainty_score":0.047043145},"labels":[],"label_agreement":null},{"id":"W2810888652","doi":"10.1007/s11083-018-9462-7","title":"A Syntactic Approach to the MacNeille Completion of Λ∗, the Free Monoid Over an Ordered Alphabet Λ","year":2018,"lang":"en","type":"article","venue":"Order","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Closure (psychology); Monoid; Alphabet; Partially ordered set; Divisibility rule; Lattice (music); Discrete mathematics; Linguistics","score_opus":0.014486632585228622,"score_gpt":0.23637881447789247,"score_spread":0.22189218189266385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810888652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025908463,0.0028897543,0.8298744,0.007409731,0.0011002134,0.00009315127,0.00040750022,0.000570185,0.13174662],"genre_scores_gemma":[0.6704154,0.0019510291,0.26842916,0.0030727503,0.0022087845,0.00026684435,0.000632109,0.00057680835,0.052447125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980628,0.00083092484,0.00013261758,0.00032398346,0.00047424133,0.00017537738],"domain_scores_gemma":[0.9981054,0.0008792469,0.00012070971,0.00025891396,0.00044199737,0.00019357467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027321165,0.0008722761,0.00081517565,0.0027881782,0.003353514,0.005471599,0.0026493904,0.0021135441,0.008149809],"category_scores_gemma":[0.004112065,0.0008265415,0.0016603288,0.0019366108,0.009927276,0.011182723,0.0031334176,0.004694367,0.0013848626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025157083,0.0000044115523,0.000014338633,0.000008767029,9.671386e-7,0.00002091983,0.0001762612,0.00009587012,0.00013416767,0.9985702,0.00032133778,0.0006502342],"study_design_scores_gemma":[0.0000055328414,0.0000088028555,0.00003991084,0.000012706006,0.0000037332472,0.00006184177,0.00008827887,0.0015319304,0.00033189516,0.9878633,0.010041617,0.000010374494],"about_ca_topic_score_codex":0.003500768,"about_ca_topic_score_gemma":0.003650131,"teacher_disagreement_score":0.008149809,"about_ca_system_score_codex":0.0032999748,"about_ca_system_score_gemma":0.0030730504,"threshold_uncertainty_score":0.02726382},"labels":[],"label_agreement":null},{"id":"W2826831346","doi":"10.1007/978-3-319-94631-3_17","title":"Cycle Height of Finite Automata","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Nondeterministic finite automaton; Deterministic finite automaton; Finite-state machine; Computation; Polynomial; GF(2); Mathematics; Discrete mathematics; Combinatorics; Finite field; Automaton; Computer science; Algorithm; Automata theory; Theoretical computer science; Mathematical analysis","score_opus":0.011887819308244016,"score_gpt":0.23078918159480524,"score_spread":0.21890136228656124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2826831346","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39951614,0.009195415,0.124534056,0.002031327,0.00085527974,0.00012255042,0.0011793426,0.0009903344,0.4615755],"genre_scores_gemma":[0.9454035,0.0025616,0.011128419,0.0002197332,0.0005032072,0.00009419906,0.00063638814,0.00025398066,0.039199002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996463,0.00004462498,0.000013513291,0.00008131849,0.00013475025,0.00007947953],"domain_scores_gemma":[0.99929345,0.0004160219,0.000033400862,0.00007594859,0.00009390007,0.0000873713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022233068,0.0004514212,0.0006104806,0.001623123,0.00096281094,0.0022886198,0.00075137656,0.0005520544,0.009632847],"category_scores_gemma":[0.0014877454,0.00045896237,0.0005153313,0.001797012,0.0013725171,0.0032015124,0.0011906951,0.0017870682,0.0011365538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004861377,0.0000180845,0.0001915709,0.000090250884,0.000007767136,0.00004566266,0.00027429074,0.0025288325,0.0022184204,0.96782625,0.0028848809,0.023865294],"study_design_scores_gemma":[0.0000074877794,0.000016024693,0.00025381555,0.000023195185,0.00001192087,0.00004187771,0.00006055066,0.004892005,0.0013379726,0.9848216,0.008522586,0.000011072787],"about_ca_topic_score_codex":0.001183649,"about_ca_topic_score_gemma":0.0011767116,"teacher_disagreement_score":0.009632847,"about_ca_system_score_codex":0.0014122388,"about_ca_system_score_gemma":0.0006509862,"threshold_uncertainty_score":0.032225132},"labels":[],"label_agreement":null},{"id":"W2883076598","doi":"10.4153/s0008439519000031","title":"Linear Conjugacy","year":2019,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjugacy class; Semigroup; Finite field; Conjugate; Field (mathematics); Linear map; Representation (politics); Combinatorics; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.0060828230119658756,"score_gpt":0.19554829676925173,"score_spread":0.18946547375728584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883076598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6734335,0.00030740863,0.16459161,0.0013610268,0.00036094914,0.00018439644,0.00037695197,0.00042416222,0.15896009],"genre_scores_gemma":[0.97797054,0.00011972998,0.0067505413,0.00016679999,0.0001638139,0.00007235611,0.00019594627,0.000054835837,0.014505421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974706,0.0004335079,0.00021830412,0.00084967597,0.0006210833,0.000406815],"domain_scores_gemma":[0.99752754,0.00077950966,0.0003689472,0.0005304736,0.00049417483,0.00029930915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075608294,0.00037102413,0.000381615,0.0009920804,0.0013694859,0.0037923472,0.00046508512,0.0007719826,0.009261199],"category_scores_gemma":[0.0032601368,0.0002912234,0.0005542495,0.00070967345,0.0043857605,0.0038293845,0.0028124778,0.0014116666,0.0019689484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109749686,0.000055811946,0.0016399515,0.00003673175,0.000011194936,0.00026421348,0.0009685339,0.00071271585,0.0064205537,0.9762877,0.0008871791,0.01260554],"study_design_scores_gemma":[0.00002875885,0.00012373552,0.001463436,0.00003002349,0.0000145684535,0.00076980545,0.00059057324,0.0063131694,0.014454186,0.9618621,0.0143055655,0.000044078715],"about_ca_topic_score_codex":0.00036186507,"about_ca_topic_score_gemma":0.00016134244,"teacher_disagreement_score":0.009261199,"about_ca_system_score_codex":0.0011638008,"about_ca_system_score_gemma":0.00054836186,"threshold_uncertainty_score":0.03098178},"labels":[],"label_agreement":null},{"id":"W2885423836","doi":"10.1051/ita/2018008","title":"Circular critical exponents for Thue–Morse factors","year":2019,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morse code; Exponent; Word (group theory); Repetition (rhetorical device); Mathematics; Critical exponent; Factor (programming language); Discrete Morse theory; Combinatorics; Morse theory; Discrete mathematics; Pure mathematics; Geometry; Computer science; Linguistics; Philosophy","score_opus":0.009138817957750053,"score_gpt":0.25539041598198997,"score_spread":0.2462515980242399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885423836","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8448093,0.0017286342,0.0936618,0.0008977475,0.00027114112,0.000082984254,0.00010785661,0.0002642264,0.058176313],"genre_scores_gemma":[0.9883477,0.00037372197,0.006746096,0.00006593515,0.00023779059,0.000052712316,0.00003642459,0.00005717237,0.0040824194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995989,0.00007910177,0.000030352621,0.00009122722,0.000096805925,0.00010365683],"domain_scores_gemma":[0.9941268,0.0034146716,0.000867699,0.00039066287,0.0005741855,0.0006259667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094543025,0.00063827645,0.00058111077,0.0022534947,0.00149193,0.0018394688,0.0004989488,0.0009223836,0.0074759694],"category_scores_gemma":[0.010062756,0.00029773326,0.00060788036,0.0007155133,0.0032265407,0.0026895737,0.0014200493,0.0014330688,0.0008195771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021037734,0.000040533527,0.0036066931,0.00016182191,0.000023717044,0.0009527973,0.001374194,0.0043173935,0.011747667,0.96513546,0.0012339054,0.0111955255],"study_design_scores_gemma":[0.000055115608,0.00013794043,0.0030895658,0.00010890102,0.000039382176,0.00078359735,0.000603723,0.036579598,0.012115037,0.9404389,0.005979689,0.00006857535],"about_ca_topic_score_codex":0.00056107243,"about_ca_topic_score_gemma":0.00047149113,"teacher_disagreement_score":0.0074759694,"about_ca_system_score_codex":0.00078190904,"about_ca_system_score_gemma":0.0003799474,"threshold_uncertainty_score":0.025009632},"labels":[],"label_agreement":null},{"id":"W2885772766","doi":"10.1007/978-3-319-98654-8_33","title":"Computational Complexity of Decision Problems on Self-verifying Finite Automata","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Nondeterministic algorithm; Decision problem; Nondeterministic finite automaton; Büchi automaton; Deterministic automaton; Computer science; Two-way deterministic finite automaton; Automaton; Computational complexity theory; Universality (dynamical systems); DFA minimization; Theoretical computer science; Deterministic finite automaton; NP; Equivalence (formal languages); Discrete mathematics; Algorithm; Automata theory; Mathematics; Computation; Turing machine","score_opus":0.033065120484532674,"score_gpt":0.26349418510358047,"score_spread":0.2304290646190478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885772766","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4481182,0.0023281802,0.4760476,0.011670372,0.00039656195,0.00045933996,0.0026107028,0.0007336698,0.057635497],"genre_scores_gemma":[0.9224716,0.0009812987,0.062189322,0.0004300069,0.0005914527,0.0003352148,0.0019317674,0.00020880606,0.010860588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932133,0.002342404,0.00046168332,0.0012503318,0.0019370401,0.00079531537],"domain_scores_gemma":[0.9465362,0.04759946,0.0014695161,0.0022667223,0.0012508528,0.0008772576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037319437,0.0010694783,0.0021284989,0.0013877882,0.0017158802,0.009105441,0.0034640178,0.0026338124,0.013056541],"category_scores_gemma":[0.030488618,0.0012272636,0.0032142545,0.0021546409,0.004435755,0.01427945,0.004100482,0.0056772763,0.0007818256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000453317,0.0002306858,0.0015733219,0.00038963382,0.00012263905,0.00016841477,0.000521757,0.07647656,0.0010365571,0.88746166,0.004956027,0.026609302],"study_design_scores_gemma":[0.000050150455,0.000015335863,0.00017746915,0.00001799112,0.000019522546,0.00004066288,0.00006692217,0.08528742,0.00030435013,0.9133719,0.00063596526,0.000012333764],"about_ca_topic_score_codex":0.0021205007,"about_ca_topic_score_gemma":0.0019146384,"teacher_disagreement_score":0.013056541,"about_ca_system_score_codex":0.004229183,"about_ca_system_score_gemma":0.0029756718,"threshold_uncertainty_score":0.043678522},"labels":[],"label_agreement":null},{"id":"W2888233883","doi":"10.1142/s012905411842008x","title":"Operations on Unambiguous Finite Automata","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Concatenation (mathematics); Mathematics; Combinatorics; Nondeterministic finite automaton; Quotient; Closure (psychology); Discrete mathematics; String (physics); Regular language; Deterministic finite automaton; Upper and lower bounds; Alphabet; Finite-state machine; Automaton; Computer science; Automata theory; Algorithm","score_opus":0.017999668340575658,"score_gpt":0.30974991188201595,"score_spread":0.2917502435414403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888233883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36082977,0.001599259,0.5958172,0.0009868598,0.00026978063,0.00019147103,0.0013162191,0.001522579,0.037466902],"genre_scores_gemma":[0.8828743,0.0009173214,0.10889831,0.00019648859,0.00030069824,0.00029202097,0.0007733971,0.00030465506,0.0054428624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946138,0.0010131078,0.0007012525,0.0011898367,0.001693925,0.0007880022],"domain_scores_gemma":[0.9795297,0.014057016,0.0015612004,0.002543891,0.0015277405,0.0007804788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016614825,0.00094748806,0.0009867371,0.0015200676,0.0016963691,0.004495133,0.0015847756,0.0011271214,0.0072901743],"category_scores_gemma":[0.016443063,0.00083776866,0.0014888062,0.0018739696,0.0035900392,0.012308847,0.0037173193,0.0025670803,0.0010745518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018231852,0.00006564662,0.00088752864,0.00021341984,0.00001668381,0.00020250131,0.0006214637,0.020864246,0.005156367,0.94643646,0.0011519156,0.024201438],"study_design_scores_gemma":[0.000021793681,0.000055134886,0.00023919213,0.000030022065,0.000018254352,0.00010676787,0.00011338413,0.035749357,0.004407694,0.9551646,0.0040592803,0.000034587494],"about_ca_topic_score_codex":0.001086292,"about_ca_topic_score_gemma":0.0008954117,"teacher_disagreement_score":0.0072901743,"about_ca_system_score_codex":0.0014415592,"about_ca_system_score_gemma":0.0010768119,"threshold_uncertainty_score":0.024388075},"labels":[],"label_agreement":null},{"id":"W2890948056","doi":"10.1142/s0129054119500308","title":"Cobham’s Theorem and Automaticity","year":2019,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"Fonds pour la Formation à la Recherche dans l’Industrie et dans l’Agriculture; Natural Sciences and Engineering Research Council of Canada; Université de Liège","keywords":"Aperiodic graph; Automaticity; Prefix; Sequence (biology); Mathematics; Discrete mathematics; Combinatorics; Philosophy; Linguistics","score_opus":0.016367887227190753,"score_gpt":0.29745463307549835,"score_spread":0.2810867458483076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890948056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13775395,0.0065730773,0.5783481,0.011707572,0.0017474919,0.00012924819,0.00033380932,0.0008524668,0.2625542],"genre_scores_gemma":[0.8611084,0.0016271893,0.10581127,0.0022003632,0.0009851723,0.00027240408,0.00017793638,0.00032418396,0.027493132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968393,0.00053640903,0.0001681506,0.0010103208,0.0009860974,0.00045973127],"domain_scores_gemma":[0.9861692,0.008327522,0.00067175535,0.0022490055,0.001960716,0.000621872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036239557,0.00089522277,0.000926496,0.0027670274,0.0031341293,0.0022665241,0.0016184194,0.0016306085,0.006717788],"category_scores_gemma":[0.013963141,0.00055135053,0.0015314325,0.0016490694,0.0072694747,0.009213721,0.004644819,0.0050346395,0.0015481233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039919378,0.000008975672,0.00023660912,0.000047771267,0.000006854894,0.00007946688,0.00024274719,0.00038953073,0.0009902134,0.99110305,0.0009926385,0.005862186],"study_design_scores_gemma":[0.000014534714,0.00003050795,0.0004214898,0.000029654293,0.000013866568,0.00014809836,0.000058966165,0.0034402914,0.0028801619,0.97907686,0.013857244,0.00002833086],"about_ca_topic_score_codex":0.0016015543,"about_ca_topic_score_gemma":0.0012456017,"teacher_disagreement_score":0.006717788,"about_ca_system_score_codex":0.0030715216,"about_ca_system_score_gemma":0.0012131354,"threshold_uncertainty_score":0.022473276},"labels":[],"label_agreement":null},{"id":"W2898086057","doi":"10.3390/a11110165","title":"Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers","year":2018,"lang":"en","type":"article","venue":"Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Saint Mary's University; University of Waterloo","funders":"","keywords":"Edit distance; Computer science; Nondeterministic algorithm; Cardinality (data modeling); Algorithm; Nondeterministic finite automaton; Correctness; Word (group theory); Automaton; Theoretical computer science; Mathematics; Automata theory","score_opus":0.01009466810539971,"score_gpt":0.2554369351228916,"score_spread":0.2453422670174919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898086057","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015572955,0.000094883675,0.981339,0.00013419964,0.00004239153,0.00006122371,0.00010699512,0.0020405718,0.000607759],"genre_scores_gemma":[0.19622399,0.00013055914,0.80128,0.00006889662,0.00005024717,0.00023323834,0.00043176636,0.00037375832,0.0012075035],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968454,0.0008989585,0.00035960064,0.0009864153,0.00069833646,0.00021119561],"domain_scores_gemma":[0.98335385,0.012618362,0.00071622455,0.0019468797,0.0011415301,0.0002232099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025604202,0.0011849835,0.0013339015,0.0017849742,0.00087792566,0.002354077,0.0022012994,0.0016872984,0.0034251856],"category_scores_gemma":[0.017857326,0.0006498992,0.0014624617,0.0013519428,0.0018093245,0.0054499027,0.002589581,0.002035182,0.0011095812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079827494,0.00026943887,0.003066377,0.0007637203,0.00015865572,0.00030938225,0.0013501231,0.24930727,0.035749044,0.25067106,0.005101773,0.45245486],"study_design_scores_gemma":[0.00007248332,0.00014492607,0.00024396,0.000024643929,0.00003337724,0.00017538296,0.00015075735,0.7748743,0.018277988,0.20339145,0.0025633085,0.000047372578],"about_ca_topic_score_codex":0.001553781,"about_ca_topic_score_gemma":0.0023422686,"teacher_disagreement_score":0.0034251856,"about_ca_system_score_codex":0.0015628434,"about_ca_system_score_gemma":0.0023630902,"threshold_uncertainty_score":0.013540983},"labels":[],"label_agreement":null},{"id":"W2898795341","doi":"10.1142/s0218196720500125","title":"The complexity of properties of transformation semigroups","year":2019,"lang":"en","type":"preprint","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semigroup; Mathematics; Semilattice; Idempotence; Transformation (genetics); Commutative property; Decidability; Discrete mathematics; Bicyclic semigroup; Cancellative semigroup; Polynomial; Pure mathematics; Combinatorics; Algebra over a field; Mathematical analysis","score_opus":0.03541922886832506,"score_gpt":0.26587798678265917,"score_spread":0.23045875791433412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898795341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6112828,0.0006873033,0.36265698,0.0057455734,0.00009993587,0.00039021394,0.002548322,0.0017573691,0.014831554],"genre_scores_gemma":[0.890121,0.00044923453,0.10272307,0.00021260677,0.00017534399,0.0002599329,0.0029239918,0.00034672648,0.0027880096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930508,0.0020692898,0.00060759194,0.0015849272,0.0019137682,0.0007736324],"domain_scores_gemma":[0.9325073,0.058247097,0.0025348158,0.0042521935,0.0016412063,0.0008173809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038159455,0.00067969225,0.0012590877,0.0017546563,0.0018496043,0.0076324847,0.0029150485,0.0017474332,0.007817486],"category_scores_gemma":[0.034220543,0.0009575146,0.0034913751,0.0021698899,0.0038800472,0.014893702,0.0026581478,0.0033646694,0.00079623127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001129107,0.0004999528,0.014304163,0.0013912306,0.0003135073,0.0011430186,0.002447931,0.20062041,0.015921041,0.65264815,0.0062648924,0.10331667],"study_design_scores_gemma":[0.0000818332,0.00006219566,0.001072715,0.000043792923,0.000072118986,0.00030432368,0.00029151657,0.25295562,0.0070055122,0.7358373,0.0022314433,0.000041745436],"about_ca_topic_score_codex":0.0028255496,"about_ca_topic_score_gemma":0.002042101,"teacher_disagreement_score":0.007817486,"about_ca_system_score_codex":0.0034881847,"about_ca_system_score_gemma":0.0022555594,"threshold_uncertainty_score":0.026152074},"labels":[],"label_agreement":null},{"id":"W2898948556","doi":"10.1016/j.tcs.2018.12.014","title":"State complexity of pattern matching in regular languages","year":2018,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Sigma; Alphabet; Word (group theory); Kappa; Mathematics; State (computer science); Matching (statistics); Discrete mathematics; Physics; Algorithm; Geometry; Statistics; Philosophy; Linguistics","score_opus":0.019041264832982706,"score_gpt":0.2783483248492058,"score_spread":0.2593070600162231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898948556","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8266851,0.00044055143,0.1523949,0.0041868533,0.00009959434,0.00010851666,0.0016324347,0.0007398701,0.013712252],"genre_scores_gemma":[0.9886901,0.00014093936,0.0073652123,0.00012785303,0.00009172525,0.00007125152,0.00064635015,0.000120430705,0.0027462116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964141,0.000924526,0.00024135868,0.00079234486,0.0009851675,0.00064247946],"domain_scores_gemma":[0.96344966,0.029961748,0.0017052706,0.0025303473,0.0013763658,0.0009765673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023815574,0.00051817973,0.0015059857,0.0013838368,0.0013152475,0.0059486916,0.0020979075,0.0022332263,0.010491943],"category_scores_gemma":[0.024266537,0.00073759374,0.0014084384,0.0016832559,0.0023234554,0.010542687,0.0028651352,0.0029315853,0.00070338463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017821598,0.00042332168,0.008990993,0.0005185021,0.00014620657,0.00043633778,0.0013876616,0.12745558,0.009460224,0.80236185,0.0062547075,0.040782444],"study_design_scores_gemma":[0.00006402301,0.000043823427,0.00074684597,0.000013639856,0.000042804702,0.00006858292,0.00010207886,0.30154482,0.0020695678,0.69485337,0.00042505618,0.000025410773],"about_ca_topic_score_codex":0.0021236907,"about_ca_topic_score_gemma":0.00187896,"teacher_disagreement_score":0.010491943,"about_ca_system_score_codex":0.0025531615,"about_ca_system_score_gemma":0.0023530403,"threshold_uncertainty_score":0.03509903},"labels":[],"label_agreement":null},{"id":"W2900953251","doi":"10.22215/etd/2019-13532","title":"Enumerative properties of restricted words and compositions","year":2019,"lang":"en","type":"preprint","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Subsequence; Mathematics; Simple (philosophy); Enumeration; Group (periodic table); Convergence (economics); Integer (computer science); Graph; Distribution (mathematics); Combinatorics; Classification of finite simple groups; Longest common subsequence problem; Element (criminal law); Discrete mathematics; Pure mathematics; Group theory; Computer science; Group of Lie type; Mathematical analysis","score_opus":0.0224147944789346,"score_gpt":0.23190583011547997,"score_spread":0.20949103563654536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900953251","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6755988,0.00041334535,0.22140804,0.0005802915,0.000113770984,0.00020985643,0.0024261344,0.00150342,0.09774631],"genre_scores_gemma":[0.90464175,0.00027847494,0.06552022,0.0002650254,0.00009792829,0.00030147587,0.0025946584,0.0003688511,0.025931584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986644,0.00021328132,0.0001715389,0.0003794855,0.0003076252,0.00026371388],"domain_scores_gemma":[0.99582314,0.002125636,0.00046736508,0.00074836455,0.0005410796,0.00029443277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006722612,0.00051098777,0.0005660718,0.0017977144,0.0016997189,0.0027331652,0.0009132796,0.00084364176,0.013746206],"category_scores_gemma":[0.0068191676,0.00044873095,0.0008195837,0.0018447214,0.0013543338,0.0032370845,0.0017522015,0.0010244504,0.0022653264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020440025,0.00008386418,0.0020742049,0.00016011643,0.000029073457,0.00033476512,0.000885841,0.0076913857,0.00700661,0.9310769,0.0032778494,0.047175],"study_design_scores_gemma":[0.000029647661,0.000052593172,0.0007051187,0.00004201435,0.000032905096,0.00042642257,0.00022511955,0.02321726,0.004648306,0.95930827,0.011281336,0.000031004474],"about_ca_topic_score_codex":0.0010781547,"about_ca_topic_score_gemma":0.0015610281,"teacher_disagreement_score":0.013746206,"about_ca_system_score_codex":0.0012736759,"about_ca_system_score_gemma":0.0010723288,"threshold_uncertainty_score":0.04598564},"labels":[],"label_agreement":null},{"id":"W2903659467","doi":"","title":"Some combinatorial problems in the theory of partial transformation semigroups","year":2014,"lang":"en","type":"article","venue":"The scientific electronic library of periodicals of the National Academy of Sciences of Ukraine (National Academy of Sciences of Ukraine)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Wilfrid Laurier University","keywords":"Transformation (genetics); Mathematics; Special classes of semigroups; Algebra over a field; Semigroup; Computer science; Pure mathematics","score_opus":0.026589543742404957,"score_gpt":0.27143248645005463,"score_spread":0.24484294270764967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903659467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25646487,0.019658076,0.5757399,0.019730946,0.0015090096,0.00019362867,0.0013151001,0.0005859134,0.12480264],"genre_scores_gemma":[0.7979144,0.0071138893,0.15177894,0.0017599171,0.0048278584,0.00045113015,0.0017418637,0.0003225463,0.03408945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712104,0.0010713967,0.00026056575,0.00062144385,0.0006552235,0.0002703756],"domain_scores_gemma":[0.9917806,0.006279221,0.0004702074,0.0005862086,0.00051948085,0.0003643297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041027456,0.00086603017,0.0017603601,0.0036035636,0.003137015,0.007705343,0.0025256732,0.002208146,0.0086019235],"category_scores_gemma":[0.010093621,0.0009899235,0.0023984953,0.0056878994,0.007506026,0.011465857,0.002617452,0.0048367353,0.0013187961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026961272,0.000031747153,0.00035720845,0.00012462036,0.000015215972,0.00013444148,0.00031791587,0.0024287556,0.00018899588,0.9856102,0.0016075424,0.009156591],"study_design_scores_gemma":[0.000009351813,0.000013651024,0.00014709443,0.000023444918,0.000006359144,0.00011007874,0.00010181026,0.0048909704,0.00009528829,0.99184,0.0027511802,0.000010850393],"about_ca_topic_score_codex":0.0011841536,"about_ca_topic_score_gemma":0.0010077544,"teacher_disagreement_score":0.0086019235,"about_ca_system_score_codex":0.0030745468,"about_ca_system_score_gemma":0.0011456148,"threshold_uncertainty_score":0.028776348},"labels":[],"label_agreement":null},{"id":"W2903828083","doi":"10.4230/lipics.icalp.2019.121","title":"Optimal Regular Expressions for Permutations","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Permutation (music); Alphabet; Combinatorics; Mathematics; Bit-reversal permutation; Construct (python library); Expression (computer science); Regular language; Discrete mathematics; Cyclic permutation; Symmetric group; Computer science; Physics; Theoretical computer science","score_opus":0.06957427623550301,"score_gpt":0.20176615200875134,"score_spread":0.1321918757732483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903828083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29935828,0.0008859947,0.6456778,0.004766985,0.00027094,0.00031694816,0.0029435952,0.0038903845,0.041889034],"genre_scores_gemma":[0.7122693,0.00043023034,0.26780623,0.0007456339,0.00023775977,0.00054263143,0.0023637826,0.0011146403,0.014489747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961856,0.0010927895,0.0003427663,0.0009913383,0.0008476301,0.0005398342],"domain_scores_gemma":[0.98999727,0.006302023,0.00061133254,0.0021389208,0.00063123234,0.00031924446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017967536,0.00064502435,0.0008656374,0.0007242506,0.0011968464,0.0023460714,0.0012738821,0.0010387296,0.0071257795],"category_scores_gemma":[0.012154633,0.00072764297,0.0011730661,0.0010454416,0.0025408755,0.0051316055,0.0018257527,0.002072406,0.0019142184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072108477,0.0001655625,0.001292106,0.00032890603,0.000036967398,0.0002659151,0.0007514044,0.04335721,0.014456919,0.8562911,0.010888948,0.071443856],"study_design_scores_gemma":[0.000060697508,0.000062531035,0.00017197814,0.00003942275,0.00002524228,0.00011528681,0.00013545157,0.09690603,0.00781893,0.88451254,0.010124003,0.000027982787],"about_ca_topic_score_codex":0.0012669403,"about_ca_topic_score_gemma":0.002019676,"teacher_disagreement_score":0.0071257795,"about_ca_system_score_codex":0.0021008044,"about_ca_system_score_gemma":0.0018857142,"threshold_uncertainty_score":0.023838043},"labels":[],"label_agreement":null},{"id":"W290526480","doi":"10.4230/dagsemproc.06111.10","title":"Incremental branching programs","year":2006,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; McGill University; Fonds Québécois de la Recherche sur la Nature et les Technologies; National Science Foundation","keywords":"Nondeterministic algorithm; Branching (polymer chemistry); Computation; Computer science; Exponential function; Mathematics; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.008540348256302814,"score_gpt":0.21953475216317944,"score_spread":0.21099440390687663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W290526480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034050457,0.00021765895,0.93166333,0.0009364319,0.00007505174,0.00017227339,0.00039801752,0.0012531382,0.031233598],"genre_scores_gemma":[0.53989553,0.00036964114,0.44095108,0.0006628347,0.000155657,0.00073104963,0.0010436623,0.00033638047,0.015854059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821115,0.00051043514,0.00009551138,0.00043766806,0.0005178075,0.00022747912],"domain_scores_gemma":[0.9956754,0.0022829343,0.00028764637,0.0010412532,0.00049822824,0.00021451052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015464424,0.0006334459,0.00046446224,0.00071753317,0.0007625987,0.0017563266,0.0026258957,0.000999196,0.007568963],"category_scores_gemma":[0.00567118,0.0004920653,0.0011798145,0.0007998252,0.0024717636,0.0049453215,0.0025767623,0.002900066,0.000889877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068000576,0.000055181466,0.00047037736,0.000086450105,0.000016434466,0.00016158925,0.00021272374,0.022129614,0.0025264267,0.9510131,0.0017988349,0.021461325],"study_design_scores_gemma":[0.000039614974,0.000056555,0.00018744804,0.000026644748,0.00002962975,0.00020828345,0.00007433405,0.15989634,0.0029599122,0.8192046,0.01729796,0.000018686216],"about_ca_topic_score_codex":0.0014317578,"about_ca_topic_score_gemma":0.001551918,"teacher_disagreement_score":0.007568963,"about_ca_system_score_codex":0.0010330338,"about_ca_system_score_gemma":0.0010608864,"threshold_uncertainty_score":0.02532065},"labels":[],"label_agreement":null},{"id":"W2906840866","doi":"10.4153/s0008439519000651","title":"Deciding the Existence of Minority Terms","year":2019,"lang":"en","type":"preprint","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Engineering and Physical Sciences Research Council","keywords":"Approx; Idempotence; Ternary operation; Class (philosophy); Mathematics; Type (biology); Polynomial; Combinatorics; Work (physics); Computational complexity theory; Discrete mathematics; Algebra over a field; Pure mathematics; Computer science; Physics; Algorithm; Mathematical analysis; Quantum mechanics; Artificial intelligence","score_opus":0.01911506829677905,"score_gpt":0.2252663140036611,"score_spread":0.20615124570688204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2906840866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82646024,0.00022222594,0.15634805,0.005198305,0.0001366118,0.0002518229,0.0010720232,0.0009281154,0.00938251],"genre_scores_gemma":[0.9556848,0.000068747206,0.041198682,0.00035254486,0.00009760042,0.00007400701,0.0008375835,0.000092096365,0.0015939085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98833954,0.003459489,0.0010248158,0.0028925836,0.0028172263,0.0014664192],"domain_scores_gemma":[0.908382,0.07603786,0.0034011393,0.005768352,0.003690603,0.0027199928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007387721,0.0004285257,0.001667225,0.00094541366,0.0020248794,0.00653658,0.003068232,0.0025913997,0.0068779937],"category_scores_gemma":[0.053190548,0.0007903825,0.0021376202,0.0010108757,0.0039280755,0.014240929,0.0046253935,0.003132168,0.0007384856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009484498,0.0013382845,0.05297232,0.001652262,0.00059851265,0.0020773588,0.003116536,0.10111555,0.06241778,0.60147995,0.010837247,0.1529097],"study_design_scores_gemma":[0.0002912562,0.00042367098,0.0033437477,0.00008739494,0.000213138,0.000638205,0.001732493,0.32895592,0.044182494,0.6153761,0.004648556,0.00010699798],"about_ca_topic_score_codex":0.0032668454,"about_ca_topic_score_gemma":0.0030504672,"teacher_disagreement_score":0.007387721,"about_ca_system_score_codex":0.0022995074,"about_ca_system_score_gemma":0.0030553536,"threshold_uncertainty_score":0.039070487},"labels":[],"label_agreement":null},{"id":"W2907265589","doi":"10.1016/j.tcs.2018.12.016","title":"The number of valid factorizations of Fibonacci prefixes","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fibonacci number; Prefix; Fibonacci polynomials; Mathematics; Sequence (biology); Pisano period; Combinatorics; Lucas sequence; Recurrence relation; Arithmetic; Word (group theory); Lucas number; Discrete mathematics; Linguistics","score_opus":0.007265641520229918,"score_gpt":0.2561661758688777,"score_spread":0.24890053434864778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907265589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82475865,0.0014695579,0.14827764,0.0017383742,0.000315872,0.00015712647,0.0027417762,0.0005712957,0.01996964],"genre_scores_gemma":[0.9459987,0.00062960957,0.044540875,0.00020563236,0.00024534969,0.00020539617,0.0024771541,0.0002477735,0.0054493076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906722,0.0024605196,0.0012058408,0.001778562,0.0023917002,0.0014910745],"domain_scores_gemma":[0.90914154,0.06876633,0.005724425,0.008153159,0.005464635,0.002749951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052410783,0.00087278907,0.0018485166,0.0022196115,0.005230496,0.0071981996,0.0023613765,0.0035162636,0.012803572],"category_scores_gemma":[0.04271392,0.001706386,0.0020198366,0.002092917,0.0038746307,0.01230334,0.0027174733,0.002196443,0.0019898138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0045769336,0.00046306092,0.029563272,0.0010141339,0.00041717157,0.0019344834,0.0033511024,0.0237032,0.03735697,0.80043226,0.010183308,0.08700404],"study_design_scores_gemma":[0.00017729221,0.0002645052,0.0037279062,0.00015533778,0.00022175799,0.0032705797,0.0008586584,0.05962786,0.017333252,0.90656143,0.0076505113,0.00015091448],"about_ca_topic_score_codex":0.00052828295,"about_ca_topic_score_gemma":0.00065386354,"teacher_disagreement_score":0.012803572,"about_ca_system_score_codex":0.0015517769,"about_ca_system_score_gemma":0.0024080216,"threshold_uncertainty_score":0.042832255},"labels":[],"label_agreement":null},{"id":"W2907458073","doi":"10.1016/j.tcs.2018.12.025","title":"Syntactic complexity of bifix-free regular languages","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Narodowe Centrum Nauki","keywords":"Injective function; Cardinality (data modeling); Mathematics; Regular language; Alphabet; Upper and lower bounds; Combinatorics; Discrete mathematics; Function (biology); Semigroup; Computer science; Theoretical computer science; Linguistics; Automaton","score_opus":0.011359170030102426,"score_gpt":0.24601496610541337,"score_spread":0.23465579607531095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907458073","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8798993,0.0005275708,0.07848339,0.002665353,0.00006378628,0.000045336106,0.000737776,0.00031399186,0.037263427],"genre_scores_gemma":[0.98993355,0.00019246571,0.0053241244,0.00014009618,0.00011206048,0.000050454495,0.0004878905,0.000063007705,0.0036963427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744093,0.0005847839,0.00016890577,0.0004008929,0.00096059573,0.00044380804],"domain_scores_gemma":[0.9865307,0.010481297,0.00086919527,0.00067871925,0.0008231844,0.0006167748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017354484,0.0004241788,0.0011192268,0.0024277004,0.002050969,0.005933108,0.0017242949,0.0013964395,0.008997649],"category_scores_gemma":[0.0076290574,0.0006892282,0.0011790858,0.0020002383,0.0032035888,0.010903891,0.0025459633,0.0029529175,0.0006403658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015299655,0.00007550894,0.0016942163,0.00009430412,0.000020180923,0.00020128326,0.00086414866,0.00385859,0.0023377743,0.983712,0.0009412519,0.006047817],"study_design_scores_gemma":[0.000020367263,0.000016536926,0.00085423054,0.000010938155,0.00001816952,0.00012637429,0.00016986167,0.012278633,0.001003352,0.9847281,0.00075126963,0.000022170403],"about_ca_topic_score_codex":0.0012096518,"about_ca_topic_score_gemma":0.0009917227,"teacher_disagreement_score":0.008997649,"about_ca_system_score_codex":0.0020741285,"about_ca_system_score_gemma":0.0011173998,"threshold_uncertainty_score":0.030100107},"labels":[],"label_agreement":null},{"id":"W2910240168","doi":"10.1016/j.tcs.2019.10.006","title":"Some further results on squarefree arithmetic progressions in infinite words","year":2019,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Square-free integer; Arithmetic; Mathematics; Combinatorics","score_opus":0.016454798319736685,"score_gpt":0.27484793513718514,"score_spread":0.25839313681744847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910240168","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27905017,0.009906266,0.27056286,0.010126897,0.002703536,0.0001495352,0.001157255,0.0010043954,0.42533898],"genre_scores_gemma":[0.8135463,0.0048042135,0.041118678,0.0023876198,0.0033365332,0.00019415027,0.0013146822,0.00044657898,0.13285115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926144,0.00014461794,0.000061221945,0.00018712561,0.00021877178,0.0001267084],"domain_scores_gemma":[0.9965263,0.0025122107,0.00013487962,0.00027470972,0.0002811937,0.00027079965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012391112,0.0016198425,0.001054908,0.0026572442,0.0022261813,0.0036157642,0.0012572393,0.0012346726,0.023902126],"category_scores_gemma":[0.003991641,0.0006962409,0.0020745718,0.0033349048,0.0034728649,0.0084957,0.0031618043,0.0048904526,0.0026529017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015481032,0.0001095801,0.0003983952,0.00032779347,0.000021904923,0.0004534168,0.0010390388,0.0019606238,0.0038409582,0.96816885,0.0046777925,0.018846804],"study_design_scores_gemma":[0.000020999814,0.000030442046,0.00031097088,0.000024747696,0.000021145572,0.0001632979,0.00012180641,0.0020522755,0.0011947562,0.9861363,0.009906531,0.000016748563],"about_ca_topic_score_codex":0.0008657046,"about_ca_topic_score_gemma":0.0010341569,"teacher_disagreement_score":0.023902126,"about_ca_system_score_codex":0.0012591796,"about_ca_system_score_gemma":0.0008338713,"threshold_uncertainty_score":0.079960525},"labels":[],"label_agreement":null},{"id":"W2911230821","doi":"","title":"Decomposition and descriptional complexity of shuffle on words and finite languages","year":2010,"lang":"en","type":"article","venue":"Scholarship@Western (Western University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Unary operation; Regular language; Singleton; Nondeterministic finite automaton; Character (mathematics); Mathematics; Deterministic finite automaton; Finite-state machine; Discrete mathematics; Computer science; Automaton; Combinatorics; Automata theory; Theoretical computer science; Algorithm","score_opus":0.0765272094044937,"score_gpt":0.31538020865417143,"score_spread":0.23885299924967773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911230821","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7471636,0.0008864375,0.23461969,0.0025713511,0.000044535416,0.0001320902,0.001656268,0.0004304628,0.012495635],"genre_scores_gemma":[0.9493942,0.00041842277,0.042248234,0.0001733622,0.00008308361,0.00019120834,0.0018333404,0.00014091155,0.0055172397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99637043,0.0008681231,0.00032345322,0.00070678507,0.00094603765,0.00078524183],"domain_scores_gemma":[0.98260593,0.012251325,0.001532233,0.0016314184,0.001031812,0.0009471746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019603046,0.0007016212,0.0013351128,0.0021992256,0.0011638664,0.004947561,0.0020429476,0.0016066761,0.0062014945],"category_scores_gemma":[0.013975844,0.00087147945,0.0016866238,0.002552914,0.003275625,0.016963739,0.003718501,0.0026929537,0.00060053664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005800477,0.00029108635,0.0062465407,0.0004066557,0.000103839455,0.00037834738,0.0019110577,0.079907596,0.00651051,0.86926186,0.0032890565,0.03111344],"study_design_scores_gemma":[0.00003794321,0.000049180428,0.00070155965,0.000027714957,0.000025847841,0.00014802504,0.00025718444,0.19451562,0.0026300033,0.8001301,0.0014383206,0.0000384638],"about_ca_topic_score_codex":0.001980006,"about_ca_topic_score_gemma":0.0016560977,"teacher_disagreement_score":0.0062014945,"about_ca_system_score_codex":0.0037346946,"about_ca_system_score_gemma":0.0013954778,"threshold_uncertainty_score":0.027097225},"labels":[],"label_agreement":null},{"id":"W2911506693","doi":"10.1051/ita/2018015","title":"Randomized generation of error control codes with automata and transducers","year":2018,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Error detection and correction; Algorithm; Computer science; Block (permutation group theory); Code (set theory); Automaton; Theoretical computer science; Mathematics; Programming language","score_opus":0.014520461654828115,"score_gpt":0.25472337989382593,"score_spread":0.2402029182389978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911506693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035033476,0.00005514756,0.9604809,0.00019229033,0.0000589811,0.00009792937,0.00010526557,0.0022099172,0.0017661026],"genre_scores_gemma":[0.4845988,0.00007376935,0.5108305,0.00016700407,0.00004469011,0.0003960595,0.00031476317,0.00043728182,0.0031370441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955041,0.0015284371,0.00037583036,0.00092516135,0.0012492795,0.00041723167],"domain_scores_gemma":[0.9864682,0.00864969,0.00086351053,0.0024441897,0.0013425321,0.00023187029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002901012,0.00051652896,0.0006353786,0.0006860351,0.00066420925,0.0012712779,0.0015935228,0.0010011061,0.002374555],"category_scores_gemma":[0.015538017,0.0004336288,0.0009470008,0.0005822956,0.002383027,0.002172053,0.0017231732,0.0013981655,0.0006319074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066216115,0.00015753646,0.002372322,0.00026770934,0.000055915294,0.0004323161,0.0006694045,0.27031633,0.041829526,0.61840326,0.0024233048,0.062410243],"study_design_scores_gemma":[0.00009449959,0.00011912206,0.00014929987,0.000037392336,0.000029825562,0.000103141705,0.000056850145,0.8067509,0.046757378,0.1412024,0.004657217,0.000041957184],"about_ca_topic_score_codex":0.0016351583,"about_ca_topic_score_gemma":0.0018303468,"teacher_disagreement_score":0.002901012,"about_ca_system_score_codex":0.0012904727,"about_ca_system_score_gemma":0.0022822374,"threshold_uncertainty_score":0.015342236},"labels":[],"label_agreement":null},{"id":"W2911617544","doi":"10.1007/978-3-030-13435-8_15","title":"State Complexity of Pseudocatenation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular language; Alphabet; Deterministic finite automaton; Combinatorics; Upper and lower bounds; State (computer science); Mathematics; Nondeterministic algorithm; Nondeterministic finite automaton; Discrete mathematics; Word (group theory); Finite-state machine; Automaton; Computer science; Algorithm; Automata theory; Theoretical computer science","score_opus":0.025421893009769405,"score_gpt":0.24552281160870568,"score_spread":0.22010091859893627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911617544","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.632226,0.0011817061,0.21654177,0.0043387325,0.00021358582,0.00016002843,0.0021521524,0.0006381769,0.14254779],"genre_scores_gemma":[0.9774186,0.00037363154,0.008665024,0.00015486944,0.00015043236,0.00010316008,0.00064075756,0.00012473468,0.012368731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980564,0.00035370517,0.00010982702,0.00031974885,0.0008300016,0.00033032443],"domain_scores_gemma":[0.9874774,0.009608849,0.00051019725,0.0011538136,0.0008250591,0.00042461776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009608398,0.00040367103,0.00094361923,0.0013274666,0.0015596969,0.0059954715,0.0015529349,0.0016599259,0.014500594],"category_scores_gemma":[0.009483621,0.0005822007,0.0012280921,0.001858142,0.0025256649,0.010164706,0.0023831644,0.0030760218,0.00080630294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001222087,0.000039861265,0.0005587784,0.00008473605,0.000012714984,0.000061799365,0.0002733321,0.011052297,0.0010434365,0.97579837,0.0017340584,0.009218403],"study_design_scores_gemma":[0.000012680762,0.000013630912,0.00032971366,0.000008239002,0.000009694465,0.00004831306,0.00005141177,0.041121177,0.0008311902,0.9566481,0.00091322383,0.000012530098],"about_ca_topic_score_codex":0.0017609451,"about_ca_topic_score_gemma":0.0013223101,"teacher_disagreement_score":0.014500594,"about_ca_system_score_codex":0.0025790832,"about_ca_system_score_gemma":0.0015139319,"threshold_uncertainty_score":0.0485093},"labels":[],"label_agreement":null},{"id":"W2912094370","doi":"10.1016/s0304-3975(01)00212-2","title":"Palindrome complexity","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft; Deutscher Akademischer Austauschdienst; University of Alberta","keywords":"Palindrome; Mathematics; Morphism; Sequence (biology); Combinatorics; Upper and lower bounds; Discrete mathematics; Class (philosophy); Computer science","score_opus":0.019404880997357755,"score_gpt":0.2512589619389404,"score_spread":0.2318540809415826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912094370","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20754342,0.0042343214,0.17297661,0.008316202,0.0008291545,0.00008222615,0.00085733697,0.00079110864,0.60436964],"genre_scores_gemma":[0.8987065,0.0014895825,0.019087259,0.00083843654,0.0008564433,0.00007740797,0.0006839642,0.00019101478,0.07806949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994856,0.00008671862,0.00002787184,0.00017431717,0.00015780808,0.00006768083],"domain_scores_gemma":[0.99902797,0.00048115174,0.00006368547,0.00020228587,0.00012973919,0.00009518981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037669894,0.00047363667,0.00079104444,0.0011157623,0.0014466777,0.0025856232,0.0008776155,0.0008593112,0.020924581],"category_scores_gemma":[0.001799382,0.00035892375,0.00071080716,0.0012948872,0.0017649444,0.007339383,0.0017356375,0.0029466515,0.0026422045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014702101,0.000012786449,0.00006814761,0.000026001522,0.0000034081443,0.00002823456,0.00009197774,0.000232033,0.00037932934,0.99179745,0.0018865635,0.005459447],"study_design_scores_gemma":[0.0000050426393,0.000007125912,0.00008279864,0.000004761898,0.0000044817116,0.000077645454,0.000025160163,0.0010737092,0.0002950105,0.9923746,0.0060456917,0.000004044686],"about_ca_topic_score_codex":0.00030463887,"about_ca_topic_score_gemma":0.00028562848,"teacher_disagreement_score":0.020924581,"about_ca_system_score_codex":0.0010183229,"about_ca_system_score_gemma":0.00046069565,"threshold_uncertainty_score":0.069999635},"labels":[],"label_agreement":null},{"id":"W2912417747","doi":"","title":"Interpreted Trajectories","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Acadia University","funders":"","keywords":"Decidability; Equivalence (formal languages); Operand; Formalism (music); Turing; Computation; Mathematics; Computer science; Algebra over a field; Discrete mathematics; Algorithm; Pure mathematics; Arithmetic","score_opus":0.004391832578533249,"score_gpt":0.1974072551963312,"score_spread":0.19301542261779794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912417747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023768418,0.0010123439,0.91861737,0.0011549704,0.0007338261,0.00021963949,0.0017378652,0.0018175998,0.050937917],"genre_scores_gemma":[0.43533283,0.0019401537,0.50386,0.00094369776,0.00047225878,0.0006665015,0.004078905,0.0012401484,0.051465537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811065,0.00040779254,0.00021142798,0.0005846458,0.00045270287,0.00023279601],"domain_scores_gemma":[0.9980392,0.00046941647,0.00020251433,0.0005890034,0.00056883873,0.0001310817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010433989,0.00094567897,0.0005705539,0.0012228703,0.0012350713,0.0032699257,0.0017169662,0.0013956751,0.015019494],"category_scores_gemma":[0.0034724541,0.00054959994,0.0013322002,0.0012712107,0.0032793449,0.0082340455,0.002689309,0.0026838304,0.0025436492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047541656,0.000015609634,0.00021473721,0.000105528896,0.00001410755,0.00029488772,0.000585075,0.0033345984,0.002507649,0.98049647,0.0014771775,0.010906644],"study_design_scores_gemma":[0.000024879166,0.000054014607,0.00016335392,0.000093698975,0.000032130916,0.0002983703,0.00032628266,0.014785057,0.00544205,0.87338567,0.10536139,0.000033149023],"about_ca_topic_score_codex":0.0017134675,"about_ca_topic_score_gemma":0.0013815094,"teacher_disagreement_score":0.015019494,"about_ca_system_score_codex":0.0014837402,"about_ca_system_score_gemma":0.0012257198,"threshold_uncertainty_score":0.050245225},"labels":[],"label_agreement":null},{"id":"W2912588130","doi":"10.1016/j.tcs.2011.12.024","title":"Relativized codes","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Canada Research Chairs","keywords":"Prefix code; Alphabet; Prefix; Mathematics; Class (philosophy); Factorization; Discrete mathematics; Block code; Word (group theory); Code (set theory); Set (abstract data type); Computer science; Combinatorics; Decoding methods; Linear code; Algorithm; Programming language; Linguistics","score_opus":0.018758539228213668,"score_gpt":0.230878302459858,"score_spread":0.21211976323164433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912588130","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08985206,0.0033116394,0.50664926,0.008332244,0.0029264078,0.000176673,0.0021788818,0.0029431363,0.38362974],"genre_scores_gemma":[0.81221753,0.0015578304,0.071838,0.0024719385,0.002268493,0.00027789953,0.0019857073,0.001232869,0.10614968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99668807,0.0008343017,0.00017769204,0.0008337409,0.0009645368,0.0005015805],"domain_scores_gemma":[0.99589854,0.0013331575,0.00027710682,0.0013646637,0.00084908545,0.00027741672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011578525,0.0009260781,0.0012492411,0.0025961527,0.002944247,0.0048740436,0.0014414247,0.002292869,0.023723373],"category_scores_gemma":[0.0064185136,0.00065471814,0.0014497028,0.002498328,0.0040301955,0.008189955,0.0040951814,0.004309179,0.0067468584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016677086,0.000004389552,0.000032626405,0.000013833149,0.0000032012124,0.000011727889,0.000066523025,0.0002594526,0.00012990067,0.9946239,0.0018073834,0.0030304093],"study_design_scores_gemma":[0.0000058600576,0.000005879112,0.000033507866,0.0000118087755,0.000005891089,0.00003783034,0.000024386842,0.0013416102,0.00040685668,0.98935,0.008765313,0.000010873754],"about_ca_topic_score_codex":0.0012819933,"about_ca_topic_score_gemma":0.000811093,"teacher_disagreement_score":0.023723373,"about_ca_system_score_codex":0.0021868204,"about_ca_system_score_gemma":0.001569966,"threshold_uncertainty_score":0.07936257},"labels":[],"label_agreement":null},{"id":"W2912608078","doi":"10.1016/s0890-5401(03)00090-7","title":"Follow automata","year":2003,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":122,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Nondeterministic finite automaton; Regular expression; Automaton; Nondeterministic algorithm; Quotient; Combinatorics; Computer science; Mathematics; Discrete mathematics; Equivalence relation; Deterministic automaton; Equivalence (formal languages); Theoretical computer science; Automata theory; Programming language","score_opus":0.009556904921695659,"score_gpt":0.22470565894381395,"score_spread":0.21514875402211828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912608078","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017733505,0.0011569883,0.2367877,0.0053742747,0.0021398664,0.00042258803,0.0069146776,0.0070628687,0.7224075],"genre_scores_gemma":[0.22674902,0.0015867553,0.04239464,0.0017977996,0.000626042,0.0005152268,0.0052045095,0.0020225737,0.71910346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995073,0.00006999625,0.00003060985,0.0001883804,0.00013487498,0.00006885673],"domain_scores_gemma":[0.9984389,0.00037864942,0.000059439248,0.0005903817,0.00043987628,0.00009277158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038490767,0.00081172516,0.0006378587,0.0011477005,0.0020146451,0.0041275183,0.0009579354,0.0012218748,0.11928343],"category_scores_gemma":[0.0028307538,0.00047547385,0.0009156168,0.0010902747,0.0012680467,0.0067997985,0.0019568764,0.0021569785,0.07109369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058549274,0.000042381922,0.0002563539,0.00008137426,0.000010998565,0.00012077448,0.00032352813,0.00034926762,0.0015194993,0.88835025,0.056923445,0.05196361],"study_design_scores_gemma":[0.000024326146,0.000023713257,0.00021868304,0.00002955562,0.000018589759,0.00019500422,0.00015541163,0.0018120188,0.003065414,0.6641359,0.33030298,0.000018382627],"about_ca_topic_score_codex":0.0015355598,"about_ca_topic_score_gemma":0.0017573518,"teacher_disagreement_score":0.11928343,"about_ca_system_score_codex":0.0011108138,"about_ca_system_score_gemma":0.000933457,"threshold_uncertainty_score":0.39904284},"labels":[],"label_agreement":null},{"id":"W2913164463","doi":"10.1007/978-3-642-31653-1_28","title":"Pseudoperiodic Words","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Alphabet; Generalization; Computer science; Word (group theory); Simple (philosophy); Natural number; Period (music); Natural (archaeology); Palindrome; Combinatorics; Artificial intelligence; Natural language processing; Arithmetic; Mathematics; Linguistics; History; Philosophy","score_opus":0.01386970247357725,"score_gpt":0.2304507232981848,"score_spread":0.21658102082460756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913164463","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02765614,0.0031151704,0.08269183,0.0018873052,0.0027711948,0.00008209048,0.00060115784,0.000585861,0.8806093],"genre_scores_gemma":[0.36966395,0.0040290505,0.034830265,0.0012527973,0.0020951992,0.0003309999,0.0014832215,0.00082458736,0.58548987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973744,0.00006185331,0.000020532994,0.00005952115,0.00008356822,0.000037127018],"domain_scores_gemma":[0.9997054,0.00009087075,0.000026811616,0.000080804166,0.00006793999,0.0000281858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019041222,0.00054631993,0.00038696892,0.0009838027,0.0011523805,0.0020314106,0.00041670856,0.00061511504,0.028082304],"category_scores_gemma":[0.0010204659,0.0002543719,0.00031061348,0.0010057766,0.0013709337,0.0032039862,0.0011736434,0.0011617856,0.009561074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018128323,0.0000038869703,0.000031111766,0.00003929503,0.000002288325,0.000050953928,0.00018276335,0.00008766674,0.0008602044,0.9638369,0.010124821,0.024761928],"study_design_scores_gemma":[0.0000093199915,0.000022788634,0.00013685795,0.000035612877,0.0000065378445,0.0004075639,0.00015991926,0.00063142134,0.0013363609,0.76109767,0.23614539,0.000010517864],"about_ca_topic_score_codex":0.00014035372,"about_ca_topic_score_gemma":0.00017206073,"teacher_disagreement_score":0.028082304,"about_ca_system_score_codex":0.0005183134,"about_ca_system_score_gemma":0.00033097746,"threshold_uncertainty_score":0.09394467},"labels":[],"label_agreement":null},{"id":"W2913376930","doi":"10.1016/j.tcs.2009.05.010","title":"Predictable semiautomata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Computer science","score_opus":0.005467650429001623,"score_gpt":0.2282123256084742,"score_spread":0.22274467517947258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913376930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22017759,0.0011162806,0.58191574,0.0022274253,0.0006901643,0.00013103119,0.0008056582,0.002464197,0.19047193],"genre_scores_gemma":[0.92343307,0.00041211466,0.025022684,0.0002846075,0.00026102609,0.00011923698,0.0004471453,0.000277416,0.04974279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990746,0.00018192476,0.0000622023,0.00026952638,0.00029160987,0.00012022072],"domain_scores_gemma":[0.9979759,0.0010408312,0.00014145878,0.00038445333,0.00029597708,0.00016136144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066713104,0.00054638716,0.00060429657,0.0009813658,0.0015804266,0.002200289,0.00066030177,0.0007090745,0.012275727],"category_scores_gemma":[0.0027160572,0.00049413857,0.0008906171,0.0007937196,0.0023938902,0.0039136005,0.0019547737,0.0019303225,0.0019816426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000136441695,0.000008957448,0.0001040856,0.000015757647,0.0000036546314,0.00006919235,0.00018801473,0.00040984794,0.0006337792,0.9933947,0.0009771106,0.0041812323],"study_design_scores_gemma":[0.000007296545,0.00001113259,0.00010092002,0.0000049853966,0.0000053228882,0.00010913221,0.000053668085,0.003874318,0.0008758527,0.9897043,0.005246178,0.000006930547],"about_ca_topic_score_codex":0.00042783492,"about_ca_topic_score_gemma":0.0004084113,"teacher_disagreement_score":0.012275727,"about_ca_system_score_codex":0.000715939,"about_ca_system_score_gemma":0.00066431024,"threshold_uncertainty_score":0.04106641},"labels":[],"label_agreement":null},{"id":"W2913518517","doi":"10.1016/j.ejc.2008.04.006","title":"Palindromic richness","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":151,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Palindrome; Conjecture; Mathematics; Class (philosophy); Word (group theory); Combinatorics; Property (philosophy); Sequence (biology); Pure mathematics; Computer science; Artificial intelligence","score_opus":0.01561513954250889,"score_gpt":0.19376765825863365,"score_spread":0.17815251871612475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913518517","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20645511,0.0018158351,0.20910308,0.0044999067,0.0006046887,0.00010631494,0.0009873612,0.001011442,0.5754163],"genre_scores_gemma":[0.9240908,0.0007109314,0.021817366,0.0006383039,0.0006007171,0.00009392554,0.0005772202,0.00028819905,0.051182576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984043,0.00033920124,0.0001329004,0.00050633657,0.00038370502,0.00023349785],"domain_scores_gemma":[0.9971468,0.0012622948,0.00022205437,0.00071130286,0.00036201585,0.00029556904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001267583,0.00061631453,0.0013306703,0.0022820844,0.0026528512,0.004275796,0.00095987215,0.0009786936,0.021763388],"category_scores_gemma":[0.0037250975,0.0006008295,0.0012098321,0.0017306283,0.0036842802,0.01045702,0.004335294,0.0033262768,0.0029923252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001535847,0.000008727323,0.00008851457,0.000022000959,0.000004172785,0.000034412773,0.00016239956,0.00007695305,0.00038084228,0.9949183,0.0006641338,0.003624074],"study_design_scores_gemma":[0.000009170837,0.000010785398,0.00014333539,0.000008962154,0.000009728679,0.00022652034,0.00007917296,0.00043150794,0.0004032926,0.991546,0.007124041,0.000007465685],"about_ca_topic_score_codex":0.00020965347,"about_ca_topic_score_gemma":0.00021907182,"teacher_disagreement_score":0.021763388,"about_ca_system_score_codex":0.00093383814,"about_ca_system_score_gemma":0.0004637166,"threshold_uncertainty_score":0.07280576},"labels":[],"label_agreement":null},{"id":"W2918819669","doi":"10.1007/978-3-030-28796-2_6","title":"Critical Exponent of Infinite Balanced Words via the Pell Number System","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponent; Alphabet; Computation; Word (group theory); Critical exponent; Combinatorics on words","score_opus":0.01091101810620658,"score_gpt":0.23917438440136696,"score_spread":0.22826336629516036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918819669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6744457,0.0031556773,0.10872024,0.0017076195,0.00059996644,0.00008931425,0.000274247,0.00045730962,0.21054997],"genre_scores_gemma":[0.9645126,0.0007698969,0.0077465316,0.00014848013,0.0003923195,0.00006617886,0.00013282006,0.000120292214,0.026110947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976057,0.00006103258,0.000012754579,0.00004304437,0.0000688204,0.000053858494],"domain_scores_gemma":[0.99939096,0.00028817542,0.000097790966,0.000042294032,0.00008576634,0.00009502237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030187113,0.00062960107,0.00069222925,0.0015526016,0.001064492,0.0026248668,0.00052492897,0.0007126351,0.0076247775],"category_scores_gemma":[0.0023900045,0.00035434566,0.0003410038,0.0007546627,0.0017809353,0.003118312,0.0014098999,0.0011492666,0.0011211087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052849577,0.000009851935,0.0001505869,0.000033179833,0.0000037805944,0.000107756285,0.00013402586,0.0010494469,0.0022391796,0.99123514,0.00081779377,0.004166461],"study_design_scores_gemma":[0.0000192382,0.000016484017,0.00015879935,0.000014997249,0.0000055360542,0.00009982775,0.000050593382,0.0051240926,0.0008414533,0.9911034,0.002553842,0.000011731299],"about_ca_topic_score_codex":0.00046266222,"about_ca_topic_score_gemma":0.0004362953,"teacher_disagreement_score":0.0076247775,"about_ca_system_score_codex":0.001057695,"about_ca_system_score_gemma":0.00042955458,"threshold_uncertainty_score":0.02550739},"labels":[],"label_agreement":null},{"id":"W2922093590","doi":"10.1007/978-3-030-23247-4_10","title":"Generalized de Bruijn Words and the State Complexity of Conjugate Sets","year":2019,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"De Bruijn sequence; Generalization; Word (group theory); Conjugate; State (computer science); Computer science; Arithmetic; Mathematics; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.01462106335471596,"score_gpt":0.25134246284634876,"score_spread":0.2367213994916328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922093590","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7891536,0.00044676723,0.16217846,0.0017087251,0.00009935161,0.00009811053,0.000614705,0.00023751322,0.045462836],"genre_scores_gemma":[0.9839347,0.00016321435,0.009292773,0.00009130166,0.000088375375,0.000092459595,0.0002460288,0.000055255656,0.006035987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738866,0.0007620354,0.00022011323,0.0005175175,0.00067265093,0.00043916496],"domain_scores_gemma":[0.9830736,0.012999688,0.0011378858,0.0014228105,0.00075539754,0.000610557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016260087,0.0005515374,0.0011378764,0.0019780463,0.0020826012,0.008228868,0.0016773719,0.0017918317,0.008957977],"category_scores_gemma":[0.011519405,0.0008388022,0.0013497171,0.0021239917,0.005094513,0.012839605,0.0033624521,0.0032052475,0.0006316921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006765788,0.000033529832,0.00035482034,0.000028029333,0.000009915484,0.000066711036,0.00030575573,0.005749902,0.00066576776,0.9897804,0.00019236567,0.0027451979],"study_design_scores_gemma":[0.000010880725,0.0000106595535,0.00015336726,0.0000059221097,0.000007394643,0.000030020967,0.000055469503,0.016014451,0.00058474834,0.98278147,0.00033230672,0.000013379986],"about_ca_topic_score_codex":0.0010405742,"about_ca_topic_score_gemma":0.00087926857,"teacher_disagreement_score":0.008957977,"about_ca_system_score_codex":0.0022332922,"about_ca_system_score_gemma":0.0010708777,"threshold_uncertainty_score":0.029967427},"labels":[],"label_agreement":null},{"id":"W2922297948","doi":"10.1016/j.aim.2022.108513","title":"Scaling limits of permutation classes with a finite specification: A dichotomy","year":2022,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Agence Nationale de la Recherche; National Science Foundation","keywords":"Mathematics; Random permutation; Permutation (music); Separable space; Limit (mathematics); Substitution (logic); Combinatorics; Discrete mathematics; Scaling limit; Limiting; Simple (philosophy); Scaling; Symmetric group; Computer science","score_opus":0.01687842668211548,"score_gpt":0.2675458652067728,"score_spread":0.25066743852465734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922297948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4639974,0.0020321526,0.36841822,0.009710217,0.00064972247,0.0001171211,0.00040043055,0.0010199718,0.15365475],"genre_scores_gemma":[0.9599082,0.00063897547,0.024157086,0.0010064302,0.0006141636,0.00023176015,0.00024033555,0.0002570859,0.012946017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995743,0.0013236431,0.00028084568,0.0010132331,0.0010209522,0.0006183713],"domain_scores_gemma":[0.98229295,0.009730487,0.0012794047,0.0032328202,0.0013948113,0.0020695732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043580555,0.00095889915,0.0020578043,0.0022594344,0.0040512006,0.008039938,0.0024594364,0.0034848826,0.009665468],"category_scores_gemma":[0.018595567,0.0011158437,0.002145011,0.0017973046,0.010125282,0.015827257,0.006356911,0.0057250387,0.0010790774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011340069,0.000015493166,0.00008381384,0.0000119627175,0.000003068494,0.000029072162,0.000111694404,0.00033263396,0.00016418482,0.9978612,0.0002520036,0.00112366],"study_design_scores_gemma":[0.000010648155,0.000012342361,0.00006917072,0.000009656371,0.000003964509,0.00005921317,0.00006211509,0.0042427536,0.00018229376,0.9947466,0.00059260795,0.000008637386],"about_ca_topic_score_codex":0.0012106905,"about_ca_topic_score_gemma":0.00060764345,"teacher_disagreement_score":0.009665468,"about_ca_system_score_codex":0.0022489233,"about_ca_system_score_gemma":0.0016457151,"threshold_uncertainty_score":0.03233421},"labels":[],"label_agreement":null},{"id":"W2922342170","doi":"10.1016/j.tcs.2019.03.005","title":"Edit distance neighbourhoods of input-driven pushdown automata","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Deterministic pushdown automaton; Pushdown automaton; Neighbourhood (mathematics); Embedded pushdown automaton; Context-free language; Automaton; Discrete mathematics; Nondeterministic algorithm; Nested word; Deterministic context-free grammar; Mathematics; Computer science; Combinatorics; Regular language; Theoretical computer science; Automata theory; Nondeterministic finite automaton; Quantum finite automata; Context-free grammar; Rule-based machine translation; Artificial intelligence","score_opus":0.004905713422251415,"score_gpt":0.22424705956990149,"score_spread":0.21934134614765008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922342170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4888016,0.00081446854,0.49088052,0.0004313916,0.00014475893,0.0001121522,0.00064013136,0.00088120415,0.01729382],"genre_scores_gemma":[0.9510328,0.00025744038,0.03871734,0.00006872048,0.00008096519,0.00012022339,0.0004417397,0.00017009766,0.009110583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985555,0.0003791728,0.00012506904,0.0003927192,0.00042953985,0.00011797519],"domain_scores_gemma":[0.98816174,0.007638594,0.000915747,0.0012440229,0.0011322421,0.00090759655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011741599,0.00046875485,0.0011930655,0.0017318684,0.0012895382,0.0026832114,0.0016930132,0.0013467458,0.0046334616],"category_scores_gemma":[0.012206362,0.00045126956,0.00087531755,0.0011863105,0.0015632936,0.0038195455,0.0024234613,0.001383456,0.00070055487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045208912,0.0001550128,0.0019133607,0.00025495628,0.000068653215,0.00080477394,0.0014468867,0.061277673,0.009621055,0.8856877,0.0015313907,0.03678643],"study_design_scores_gemma":[0.00003959025,0.00009940097,0.0005322045,0.000023103716,0.000029697629,0.00026042844,0.00014679377,0.2418838,0.0032543328,0.7515362,0.0021592046,0.000035204845],"about_ca_topic_score_codex":0.0007363692,"about_ca_topic_score_gemma":0.00068072334,"teacher_disagreement_score":0.0046334616,"about_ca_system_score_codex":0.00078739953,"about_ca_system_score_gemma":0.00047371906,"threshold_uncertainty_score":0.015500426},"labels":[],"label_agreement":null},{"id":"W2922460544","doi":"10.1016/j.ic.2019.03.003","title":"On store languages and applications","year":2019,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Nondeterministic algorithm; Pushdown automaton; Bounded function; Reachability; Set (abstract data type); Successor cardinal; Finite-state machine; Automaton; Theoretical computer science; Deterministic pushdown automaton; Decidability; Programming language; Algorithm; Nondeterministic finite automaton; Mathematics; Automata theory","score_opus":0.003813228071605732,"score_gpt":0.23946662207938194,"score_spread":0.2356533940077762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922460544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049323104,0.032183703,0.60254216,0.02174392,0.0028062568,0.0001446103,0.000937379,0.0014633103,0.2888556],"genre_scores_gemma":[0.6396429,0.024846187,0.10229879,0.005002037,0.004700315,0.00055094104,0.001151088,0.0012563019,0.22055155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873334,0.00038520404,0.00009479191,0.00029044412,0.0003516379,0.00014461472],"domain_scores_gemma":[0.9969944,0.0017229464,0.000084014595,0.0006464433,0.00040977573,0.0001424184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012759416,0.0009566552,0.0014023809,0.0029798185,0.002793837,0.0059577045,0.0017399424,0.0024030746,0.021811917],"category_scores_gemma":[0.0059286435,0.00081376237,0.0013385452,0.005440186,0.005366991,0.015383308,0.0044773445,0.0036405933,0.004274377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000132397845,0.00001102413,0.000048215385,0.0000421216,0.000004507571,0.000032086777,0.0002295102,0.00043698793,0.00016275843,0.98531586,0.0036802446,0.010023461],"study_design_scores_gemma":[0.0000039556553,0.0000053420013,0.000028194123,0.000026968473,0.0000059678737,0.000057848272,0.00008081239,0.002032692,0.0001915477,0.9797269,0.017834352,0.0000054610746],"about_ca_topic_score_codex":0.0021491314,"about_ca_topic_score_gemma":0.0016237267,"teacher_disagreement_score":0.021811917,"about_ca_system_score_codex":0.0017328588,"about_ca_system_score_gemma":0.0012045295,"threshold_uncertainty_score":0.072968185},"labels":[],"label_agreement":null},{"id":"W2922654736","doi":"10.23638/dmtcs-22-1-3","title":"A Characterization of Morphic Words with Polynomial Growth","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Zigzag; Multilinear map; Word (group theory); Morphism; Mathematics; String (physics); Combinatorics; Characterization (materials science); Polynomial; Type (biology); Discrete mathematics; Pure mathematics; Physics","score_opus":0.012555062082393343,"score_gpt":0.23269367976107758,"score_spread":0.22013861767868423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922654736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7261815,0.000689377,0.23330045,0.00063610094,0.00008852409,0.00010931819,0.00061189715,0.00067718566,0.03770557],"genre_scores_gemma":[0.9493601,0.00023995394,0.038696315,0.00010840561,0.00010910945,0.000103236176,0.00038514327,0.00016141287,0.010836367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995615,0.000052369593,0.000048118076,0.00012433266,0.00013183619,0.000081915336],"domain_scores_gemma":[0.9984047,0.00068443915,0.00028361476,0.00021270083,0.00023743614,0.00017710302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002468513,0.0003923149,0.0002775164,0.001260685,0.00079171406,0.0014797843,0.00055352965,0.00061219826,0.0042999065],"category_scores_gemma":[0.002104352,0.00032533967,0.000488916,0.00090063974,0.0024231696,0.0030398548,0.0013180188,0.0010892058,0.00063533476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009471086,0.00002363059,0.0018615841,0.00009043822,0.0000064407122,0.00055290264,0.0011632848,0.00371576,0.023953406,0.9473689,0.00065020856,0.020518662],"study_design_scores_gemma":[0.000020409505,0.000100114026,0.0019910992,0.00004192018,0.000023449362,0.001445918,0.00048776955,0.041357916,0.014928652,0.9207471,0.018800452,0.000055260276],"about_ca_topic_score_codex":0.0007448093,"about_ca_topic_score_gemma":0.00064046314,"teacher_disagreement_score":0.0042999065,"about_ca_system_score_codex":0.0010045398,"about_ca_system_score_gemma":0.00034202906,"threshold_uncertainty_score":0.014384627},"labels":[],"label_agreement":null},{"id":"W2936148280","doi":"10.1007/978-3-030-28796-2_10","title":"Circularly Squarefree Words and Unbordered Conjugates: A New Approach","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Square-free integer; Conjugate; Word (group theory); Mathematics; Binary number; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.017454630119164944,"score_gpt":0.24844484626922583,"score_spread":0.23099021615006088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2936148280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08106844,0.0038917423,0.78733766,0.0021110037,0.0019813646,0.00009834523,0.0002112646,0.000333131,0.122967005],"genre_scores_gemma":[0.7016639,0.0044941697,0.1840495,0.0017767794,0.0030925602,0.0002221325,0.0003457096,0.00047038187,0.10388485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993357,0.00018436824,0.00005066627,0.00021246554,0.00013391653,0.00008295756],"domain_scores_gemma":[0.99895287,0.00038026506,0.00010186057,0.00021438289,0.00023189162,0.00011879759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077137374,0.0011613801,0.0010102787,0.0025857058,0.0016363093,0.004841174,0.0015931726,0.0016910197,0.006696618],"category_scores_gemma":[0.0018163424,0.00066822616,0.0011923511,0.0017291806,0.0034629086,0.007198571,0.0029702063,0.0026362613,0.002044094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001784556,0.000023922095,0.00007578452,0.000028353223,0.0000040605496,0.000092532246,0.0002521825,0.00047221087,0.0008651678,0.9910794,0.0006951732,0.0063934317],"study_design_scores_gemma":[0.0000063447706,0.000024319903,0.000053342872,0.000011746998,0.000008780409,0.00011810696,0.00012755704,0.005919114,0.0005092345,0.9845685,0.008640057,0.000013009352],"about_ca_topic_score_codex":0.00032263485,"about_ca_topic_score_gemma":0.00045950428,"teacher_disagreement_score":0.006696618,"about_ca_system_score_codex":0.0009466071,"about_ca_system_score_gemma":0.00050568423,"threshold_uncertainty_score":0.022402406},"labels":[],"label_agreement":null},{"id":"W2940923581","doi":"10.4230/lipics.mfcs.2017.24","title":"Better Complexity Bounds for Cost Register Automata","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Register (sociolinguistics); Automaton; Register allocation; Theoretical computer science; Parallel computing; Programming language","score_opus":0.06230586614724938,"score_gpt":0.3169479117971421,"score_spread":0.25464204564989273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940923581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29246008,0.0063494802,0.5399512,0.021266544,0.0008643462,0.00026997118,0.002578541,0.0030805916,0.13317923],"genre_scores_gemma":[0.9083363,0.0017931579,0.06814167,0.0015369188,0.000949505,0.0003151969,0.0013985472,0.0008223768,0.01670643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993997,0.0011425486,0.00033341892,0.0016025245,0.0019753259,0.0009492475],"domain_scores_gemma":[0.96444297,0.025914162,0.0012181442,0.0057472233,0.0016505101,0.0010270382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036329855,0.0011074587,0.0014234607,0.0021009583,0.0014905491,0.0068127075,0.0028684048,0.0019528964,0.016501527],"category_scores_gemma":[0.023779174,0.0006802736,0.0025803777,0.0021192762,0.0038351677,0.020256951,0.0046267654,0.008500534,0.0019513525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002607069,0.00011227877,0.0012072902,0.0002552551,0.000037577916,0.00008596898,0.00036977074,0.024124492,0.003110139,0.9464548,0.0057006003,0.01828105],"study_design_scores_gemma":[0.00003106572,0.000055519078,0.00042776743,0.000044616234,0.000037883943,0.0000707878,0.000090952904,0.1004801,0.0022353928,0.8901053,0.006387843,0.000032823238],"about_ca_topic_score_codex":0.0024247942,"about_ca_topic_score_gemma":0.002553266,"teacher_disagreement_score":0.016501527,"about_ca_system_score_codex":0.005898189,"about_ca_system_score_gemma":0.0020925286,"threshold_uncertainty_score":0.05520308},"labels":[],"label_agreement":null},{"id":"W2941395296","doi":"10.1007/978-3-030-28796-2_11","title":"The Undirected Repetition Threshold","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Conjecture; Combinatorics; Infimum and supremum; Mathematics; Repetition (rhetorical device); Physics; Philosophy","score_opus":0.012675204938594394,"score_gpt":0.2475024252707532,"score_spread":0.2348272203321588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941395296","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36167663,0.0030725275,0.23710886,0.008859714,0.0007101329,0.00009532777,0.0010608446,0.0013661749,0.38604975],"genre_scores_gemma":[0.94649124,0.00085676124,0.016814606,0.0010615933,0.0007122716,0.00014249209,0.0003997742,0.00034422797,0.03317699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871635,0.00035162922,0.000051573614,0.0003818093,0.00030019617,0.00019855933],"domain_scores_gemma":[0.99256164,0.0048099896,0.000444822,0.0011358126,0.00053305237,0.00051474874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088552217,0.00046334852,0.0010075235,0.0015036187,0.0015302219,0.002959623,0.0013245209,0.0020016285,0.012852091],"category_scores_gemma":[0.010060325,0.00049701636,0.0005896532,0.0010459826,0.002856174,0.00550449,0.0023177643,0.0030672958,0.001991718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038658447,0.000010751886,0.00015881631,0.00004470133,0.000008171977,0.00006018756,0.00012007077,0.0012409217,0.001344677,0.9894818,0.0024828343,0.0050085178],"study_design_scores_gemma":[0.000007302062,0.000006294795,0.00013888771,0.0000096527965,0.0000074991094,0.00008889635,0.00002577597,0.0073630996,0.0005358826,0.989618,0.0021904216,0.0000082177],"about_ca_topic_score_codex":0.0007987299,"about_ca_topic_score_gemma":0.0005172357,"teacher_disagreement_score":0.012852091,"about_ca_system_score_codex":0.0009860994,"about_ca_system_score_gemma":0.0007593702,"threshold_uncertainty_score":0.04299456},"labels":[],"label_agreement":null},{"id":"W2941439348","doi":"10.48550/arxiv.1904.11100","title":"Decision Problems for Restricted Variants of Two-Dimensional Automata","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic finite automaton; Deterministic automaton; Nondeterministic algorithm; Decidability; Discrete mathematics; Deterministic finite automaton; Mathematics; Combinatorics; Decision problem; Two-way deterministic finite automaton; Unary operation; Büchi automaton; Undecidable problem; Equivalence (formal languages); Automaton; Automata theory; Finite-state machine; Computer science; Algorithm; Theoretical computer science","score_opus":0.05830578397450525,"score_gpt":0.20406357862047086,"score_spread":0.1457577946459656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941439348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43680277,0.0007164707,0.5411941,0.0018874913,0.0001814543,0.0004004706,0.0009979588,0.0007257341,0.017093483],"genre_scores_gemma":[0.90892226,0.0002335397,0.084216624,0.0002423524,0.000089457026,0.00030067333,0.0010761218,0.00007178217,0.0048471014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99588746,0.0011796863,0.0005218962,0.0013246862,0.00062524213,0.00046099274],"domain_scores_gemma":[0.9826418,0.013832844,0.00069225085,0.0015020294,0.0007951314,0.00053588924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002650986,0.0004847567,0.0006812669,0.0005038036,0.0009383547,0.0026830137,0.0018652349,0.0013600165,0.003313676],"category_scores_gemma":[0.011378239,0.0005383613,0.0017656527,0.00058853306,0.0029070997,0.004412905,0.0028745309,0.0025755896,0.0003220964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005724836,0.0003069516,0.002981883,0.0003851009,0.00011090281,0.0009743907,0.001432914,0.12259842,0.007805232,0.82822716,0.0027224417,0.03188209],"study_design_scores_gemma":[0.0001671013,0.00008426398,0.00042518074,0.000027386084,0.00004116513,0.00028211888,0.00027168146,0.27521095,0.004183375,0.71602917,0.0032352419,0.000042472824],"about_ca_topic_score_codex":0.0021375124,"about_ca_topic_score_gemma":0.0018175885,"teacher_disagreement_score":0.003313676,"about_ca_system_score_codex":0.0019372054,"about_ca_system_score_gemma":0.0010284147,"threshold_uncertainty_score":0.0140554905},"labels":[],"label_agreement":null},{"id":"W29419446","doi":"10.3899/jrheum.171196","title":"On Pregroups, Freedom, and (Virtual) Conceptual Necessity","year":2006,"lang":"en","type":"article","venue":"The Journal of Rheumatology","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rotation formalisms in three dimensions; Minimalist program; Computer science; Chomsky hierarchy; Formalism (music); Grammar; Transformational grammar; Natural language; Theoretical linguistics; Linguistics; Generative grammar; Mathematics; Programming language; Artificial intelligence; Formal language; Geometry; Philosophy","score_opus":0.00685313990406954,"score_gpt":0.20728176299071827,"score_spread":0.20042862308664872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29419446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1561933,0.008288789,0.6256925,0.0061655347,0.0006537796,0.00012238667,0.00031725861,0.00027017604,0.2022963],"genre_scores_gemma":[0.918215,0.0018062091,0.060225368,0.00080321066,0.0005935951,0.0002409779,0.00018271159,0.000122008154,0.01781096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867517,0.000492072,0.00006108295,0.00031367078,0.00025213388,0.00020587795],"domain_scores_gemma":[0.997143,0.0016433436,0.00018827923,0.00059913873,0.0002189084,0.00020733719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025941816,0.0006789368,0.0006525662,0.0016533871,0.0027336304,0.002896146,0.0008531786,0.0016848624,0.0060010296],"category_scores_gemma":[0.0032872485,0.00052473915,0.0011557537,0.0011092188,0.019876992,0.01147527,0.0054935296,0.0032309685,0.0006556542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000443713,0.000002029882,0.000038778904,0.0000050946805,8.342019e-7,0.00001392623,0.00019415597,0.000099143894,0.00010380475,0.998315,0.000095498355,0.0011273581],"study_design_scores_gemma":[0.000004081145,0.000007952985,0.00007739555,0.0000075863372,0.000001834448,0.000042568343,0.000056298617,0.0003935254,0.00012127852,0.99487203,0.0044101095,0.000005333498],"about_ca_topic_score_codex":0.0008995531,"about_ca_topic_score_gemma":0.00077767274,"teacher_disagreement_score":0.0060010296,"about_ca_system_score_codex":0.0018650449,"about_ca_system_score_gemma":0.0006124965,"threshold_uncertainty_score":0.02007544},"labels":[],"label_agreement":null},{"id":"W2942306020","doi":"10.1007/978-3-030-28796-2_7","title":"Repetitions in Infinite Palindrome-Rich Words","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Alphabet; Word (group theory); Combinatorics on words; Repetition (rhetorical device); Exponent; Construct (python library)","score_opus":0.013142131746093222,"score_gpt":0.23493822697104802,"score_spread":0.2217960952249548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942306020","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6942542,0.002054144,0.14878581,0.00062469137,0.00036211452,0.000057970046,0.00036947004,0.00094323425,0.15254834],"genre_scores_gemma":[0.948074,0.0004144999,0.016398001,0.00012776308,0.00021941026,0.00007245063,0.000238328,0.00024558444,0.03421006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992524,0.00021260834,0.000067919114,0.0001667328,0.00018551885,0.000114861185],"domain_scores_gemma":[0.99780065,0.0015734934,0.00017204083,0.00023271306,0.00012983213,0.00009120591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004559155,0.0005012254,0.0006180401,0.00092861487,0.001202965,0.0020489418,0.00085088913,0.0008540208,0.0054272525],"category_scores_gemma":[0.0023844005,0.00065854046,0.0006747832,0.0007913434,0.0017630643,0.0033013585,0.0013679978,0.0013149062,0.0012551522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018817796,0.000030010462,0.00026841456,0.00013404284,0.000015699443,0.00076360744,0.001327951,0.0018593011,0.014907114,0.96647227,0.0010235504,0.013009956],"study_design_scores_gemma":[0.000025612984,0.00006514235,0.0003398534,0.000034460518,0.00002295793,0.00077768735,0.0002180765,0.004867623,0.0065768864,0.9808131,0.006230504,0.00002818756],"about_ca_topic_score_codex":0.00022454222,"about_ca_topic_score_gemma":0.0003281075,"teacher_disagreement_score":0.0054272525,"about_ca_system_score_codex":0.0005135498,"about_ca_system_score_gemma":0.00023460241,"threshold_uncertainty_score":0.018155932},"labels":[],"label_agreement":null},{"id":"W2942381101","doi":"","title":"Two-Pattern Strings","year":2002,"lang":"en","type":"article","venue":"Murdoch Research Repository (Murdoch University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); McMaster University","funders":"","keywords":"Generalization; String (physics); Computer science; Class (philosophy); Discrete mathematics; Mathematics; Artificial intelligence","score_opus":0.053742380219074966,"score_gpt":0.2676355784846972,"score_spread":0.21389319826562225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942381101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23125884,0.00091918,0.6722753,0.0013502196,0.00090539263,0.00020524237,0.0010644188,0.0020382837,0.089983106],"genre_scores_gemma":[0.8006153,0.00041233972,0.17037259,0.0008978268,0.0002904863,0.00028499658,0.0015054811,0.00035041507,0.0252705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907744,0.00018337573,0.000074361895,0.00030893748,0.0002414678,0.000114514405],"domain_scores_gemma":[0.9982857,0.00061221374,0.00015840554,0.000461728,0.0002958646,0.0001860889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051916356,0.00037293285,0.00054061256,0.0008320529,0.0010935387,0.0011486887,0.0006847914,0.0009237371,0.00909269],"category_scores_gemma":[0.002850941,0.00020530816,0.0005753033,0.00088164146,0.0015356233,0.0031228794,0.0011403211,0.0012212662,0.0016469448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021496545,0.000065324224,0.0010525205,0.00015864623,0.000017400824,0.00048609928,0.0005362975,0.0035911093,0.015288779,0.8938886,0.0049047233,0.07979545],"study_design_scores_gemma":[0.00004045493,0.00017221365,0.0010700828,0.00005607309,0.000017279512,0.0012227747,0.00017865765,0.027337167,0.0070162825,0.88816065,0.07465904,0.000069356014],"about_ca_topic_score_codex":0.00031393144,"about_ca_topic_score_gemma":0.00026633436,"teacher_disagreement_score":0.00909269,"about_ca_system_score_codex":0.00051469874,"about_ca_system_score_gemma":0.000388884,"threshold_uncertainty_score":0.030418098},"labels":[],"label_agreement":null},{"id":"W2942613632","doi":"10.1016/j.tcs.2019.05.010","title":"Palindromic Ziv–Lempel and Crochemore factorizations of m-bonacci infinite words","year":2019,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Institute for Research in Fundamental Sciences; Fonds De La Recherche Scientifique - FNRS","keywords":"Palindrome; Fibonacci number; Word (group theory); Factorization; Variation (astronomy); Mathematics; Computer science; Combinatorics; Algorithm; Physics","score_opus":0.010676924602460596,"score_gpt":0.25030753162492947,"score_spread":0.23963060702246888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942613632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60349184,0.0027860461,0.17710494,0.002124446,0.0006534322,0.00014553092,0.0008505595,0.00054739544,0.21229574],"genre_scores_gemma":[0.93913203,0.00033114236,0.021079214,0.00031570176,0.0002804409,0.00009333852,0.00036472155,0.00014323943,0.038260154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944395,0.00011059922,0.000031447096,0.00013095736,0.000108009175,0.00017496277],"domain_scores_gemma":[0.9993067,0.00025032306,0.00010555001,0.00008061772,0.0001275973,0.00012920474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005325523,0.00066295324,0.0007051183,0.0020228154,0.0024231835,0.0025148988,0.0006523675,0.0009895369,0.013648738],"category_scores_gemma":[0.0022512153,0.00047530487,0.00090404396,0.0009117351,0.0017865917,0.0025249657,0.0012097618,0.0015204789,0.0022630426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007965099,0.000015954965,0.00018590175,0.000037795795,0.000004410993,0.00015786637,0.00042396892,0.0004218491,0.0015757931,0.991774,0.00094855466,0.0043742526],"study_design_scores_gemma":[0.000019157358,0.000023262277,0.00032854237,0.000030582643,0.000007477978,0.00018590248,0.00018043701,0.003399527,0.000847034,0.98854464,0.006414036,0.000019455534],"about_ca_topic_score_codex":0.0015698748,"about_ca_topic_score_gemma":0.0016680944,"teacher_disagreement_score":0.013648738,"about_ca_system_score_codex":0.001450423,"about_ca_system_score_gemma":0.0005797554,"threshold_uncertainty_score":0.0456596},"labels":[],"label_agreement":null},{"id":"W2943660833","doi":"10.1017/jsl.2019.26","title":"AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES","year":2019,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; Massey University; Russian Science Foundation; Kazan Federal University; Ministry of Education, India; Natural Sciences and Engineering Research Council of Canada","keywords":"Decidability; Algebraic structure; Computer science; Presentation (obstetrics); Set (abstract data type); Automaton; Turing machine; Algebra over a field; Discrete mathematics; Mathematics; Theoretical computer science; Programming language; Pure mathematics","score_opus":0.004713833986705237,"score_gpt":0.20536240274780657,"score_spread":0.20064856876110132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943660833","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52399695,0.00047050734,0.41468254,0.002843398,0.00017845523,0.00015970328,0.0008646043,0.000977241,0.055826608],"genre_scores_gemma":[0.9476892,0.000119782315,0.043622952,0.00016339529,0.00013629785,0.000109290544,0.00052795,0.00006521905,0.0075660804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691975,0.0007448606,0.00020910494,0.00078997115,0.0009604702,0.000375772],"domain_scores_gemma":[0.9903964,0.005210512,0.0010337027,0.0014682228,0.0013452423,0.0005459609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014231103,0.0003404188,0.00056150975,0.000915046,0.0018437919,0.0035794606,0.0012549709,0.0011579423,0.0072241197],"category_scores_gemma":[0.0077188774,0.00046738793,0.0012820855,0.00089209224,0.004456454,0.0061239097,0.002391887,0.0025951157,0.0006361197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076874014,0.000055665863,0.0004020683,0.000056215034,0.000010780818,0.00011927128,0.00035109613,0.0061511467,0.002110171,0.98470324,0.0006012376,0.0053622406],"study_design_scores_gemma":[0.000025871788,0.000027379896,0.00016074098,0.000012813451,0.000008657836,0.000104925544,0.0000997269,0.0203959,0.0018761716,0.9744323,0.0028400652,0.000015431848],"about_ca_topic_score_codex":0.0011230605,"about_ca_topic_score_gemma":0.0012535397,"teacher_disagreement_score":0.0072241197,"about_ca_system_score_codex":0.0017525143,"about_ca_system_score_gemma":0.0012374034,"threshold_uncertainty_score":0.02416706},"labels":[],"label_agreement":null},{"id":"W2946240107","doi":"10.1016/j.tcs.2019.04.007","title":"Ranking and unranking fixed-density necklaces and Lyndon words","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ranking (information retrieval); Prefix; Combinatorics; Mathematics; Time complexity; Running time; Algorithm; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.003989916041867961,"score_gpt":0.20771983853182152,"score_spread":0.20372992248995356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946240107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56613123,0.00112106,0.37316835,0.0012744361,0.0002549339,0.00012654865,0.00067339814,0.0012354574,0.0560145],"genre_scores_gemma":[0.9161835,0.00037065477,0.047286365,0.00026144422,0.00018983867,0.00015711244,0.0006471289,0.00030374725,0.03460028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771774,0.00062666397,0.00019357589,0.00049973826,0.00053467497,0.0004275854],"domain_scores_gemma":[0.9866535,0.007972287,0.0012817367,0.0014304561,0.0015716586,0.0010905078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002151082,0.0006635209,0.0020151378,0.0035126333,0.003170922,0.005450133,0.0019056539,0.0020665044,0.011268772],"category_scores_gemma":[0.016684398,0.00093499065,0.0011442892,0.0027791313,0.004281277,0.008344762,0.0026631104,0.0020110158,0.0016711575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001121922,0.000035031455,0.0004377076,0.000079057914,0.000012748463,0.00012428971,0.00046017865,0.0032495253,0.0010305577,0.9842748,0.001347386,0.008836433],"study_design_scores_gemma":[0.000019684061,0.000023516784,0.0001395618,0.000015803893,0.000010292973,0.000084207204,0.00012542901,0.011837801,0.0005871752,0.98558784,0.0015472005,0.000021519854],"about_ca_topic_score_codex":0.0022218896,"about_ca_topic_score_gemma":0.0029158844,"teacher_disagreement_score":0.011268772,"about_ca_system_score_codex":0.0018716236,"about_ca_system_score_gemma":0.0011157459,"threshold_uncertainty_score":0.037697792},"labels":[],"label_agreement":null},{"id":"W2947749495","doi":"10.1007/s00224-019-09929-9","title":"Additive Number Theory via Automata Theory","year":2019,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fibonacci number; Natural number; Palindrome; Mathematics; Base (topology); Basis (linear algebra); Automaton; Mathematical proof; Discrete mathematics; Representation (politics); Combinatorics; Computer science; Theoretical computer science","score_opus":0.0077621033940630585,"score_gpt":0.2280083916079614,"score_spread":0.22024628821389836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947749495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026205448,0.010554055,0.8280747,0.0048032715,0.001375322,0.00006933333,0.0003403609,0.0005072518,0.12807013],"genre_scores_gemma":[0.73466146,0.008468191,0.20783491,0.0018966445,0.0036653595,0.0004025548,0.00051481364,0.00032114465,0.0422349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790704,0.0006842556,0.0001292325,0.00042638674,0.0006845392,0.00016862634],"domain_scores_gemma":[0.99763155,0.0015151,0.0001038491,0.00025656048,0.00034707767,0.00014592678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016102447,0.0013743967,0.001798804,0.0038255884,0.0019865485,0.006126656,0.0017999457,0.0013174352,0.0069768527],"category_scores_gemma":[0.0034410835,0.0007632563,0.0017466631,0.003294598,0.0066827373,0.011695237,0.003713482,0.004906516,0.0014126195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004081063,0.0000045321603,0.00002226612,0.000022949185,0.0000037683637,0.000009140254,0.000058836536,0.00034090967,0.00008829816,0.9969035,0.00036890138,0.0021728016],"study_design_scores_gemma":[0.0000041272547,0.0000044441726,0.00002619846,0.0000077587465,0.0000055679557,0.000015647369,0.000012238696,0.0014396511,0.00008879035,0.99553406,0.0028564937,0.000005116426],"about_ca_topic_score_codex":0.0010964058,"about_ca_topic_score_gemma":0.000846671,"teacher_disagreement_score":0.0069768527,"about_ca_system_score_codex":0.002564547,"about_ca_system_score_gemma":0.0010086813,"threshold_uncertainty_score":0.023339868},"labels":[],"label_agreement":null},{"id":"W2948857561","doi":"10.1016/j.ipl.2020.106027","title":"Borders, palindrome prefixes, and square prefixes","year":2020,"lang":"en","type":"preprint","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Prefix; Palindrome; Conjecture; Combinatorics; Mathematics; Alphabet; Bijection; Square (algebra); Linguistics; Geometry","score_opus":0.013896880524760269,"score_gpt":0.23957471478753883,"score_spread":0.22567783426277857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948857561","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56773645,0.0021057855,0.33922854,0.0018890359,0.00051495724,0.00009634375,0.00042059133,0.00065125007,0.08735701],"genre_scores_gemma":[0.9467844,0.00049050146,0.041570205,0.00031090493,0.00020335114,0.00007924291,0.0001903346,0.00011284289,0.010258225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989722,0.00022845225,0.0000931241,0.0003589465,0.00018106496,0.00016630767],"domain_scores_gemma":[0.9947501,0.003188845,0.0005307941,0.0008020426,0.00038480954,0.00034342165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010912046,0.0003359314,0.0005621907,0.0009099745,0.001216337,0.0031128635,0.0006241484,0.0013661218,0.0076485123],"category_scores_gemma":[0.0065733944,0.00037918967,0.00058188447,0.0009245873,0.0030906936,0.007258351,0.0017137416,0.0015273447,0.00091585587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001607232,0.000023477362,0.0003759209,0.000050894967,0.000005964788,0.00031561754,0.0003922449,0.00104123,0.0042829546,0.9812004,0.000643449,0.011507151],"study_design_scores_gemma":[0.000018507193,0.00004693624,0.00017205492,0.000016439442,0.000008908866,0.00029468734,0.00017805655,0.0064756633,0.0024427888,0.9873324,0.0029975832,0.000015961697],"about_ca_topic_score_codex":0.00027816673,"about_ca_topic_score_gemma":0.00029749353,"teacher_disagreement_score":0.0076485123,"about_ca_system_score_codex":0.00043751372,"about_ca_system_score_gemma":0.0003988329,"threshold_uncertainty_score":0.025586784},"labels":[],"label_agreement":null},{"id":"W2949256186","doi":"10.31857/s0869-56524862156-158","title":"Zeroone laws for sentences with k variables","year":2019,"lang":"en","type":"article","venue":"Доклады Академии наук","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Zero (linguistics); Mathematics; Random variable; Variable (mathematics); Graph; Combinatorics; Discrete mathematics; Law; Mathematical physics; Philosophy; Mathematical analysis; Statistics; Political science; Linguistics","score_opus":0.006313602605071225,"score_gpt":0.19395133374847678,"score_spread":0.18763773114340557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949256186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4390252,0.00084267865,0.52325636,0.0026206728,0.0001883243,0.000116676834,0.0007993789,0.0009586054,0.03219224],"genre_scores_gemma":[0.9704418,0.00020957421,0.02442681,0.00044420012,0.00011871235,0.00008976325,0.00041208247,0.00008695283,0.0037701314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968368,0.0008274886,0.0003146391,0.0009304183,0.0006005895,0.0004900134],"domain_scores_gemma":[0.9862466,0.008814205,0.0015052113,0.0016072019,0.001090552,0.0007362455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003184502,0.0003976822,0.0006502855,0.0015329052,0.002054209,0.003329568,0.0010868117,0.0010937616,0.003986064],"category_scores_gemma":[0.011117121,0.00048424056,0.0013620984,0.00078031985,0.006735033,0.008593062,0.0025672135,0.0025347641,0.00043766762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007236187,0.000030432655,0.0014952896,0.000056097237,0.000016357424,0.0003525911,0.0009954398,0.0011066954,0.0014467102,0.9898982,0.000464221,0.0040656268],"study_design_scores_gemma":[0.00002176709,0.00003950215,0.0007776083,0.000028596314,0.00002432007,0.00021442554,0.00025338493,0.010958577,0.0015386357,0.98373806,0.002375886,0.000029247833],"about_ca_topic_score_codex":0.002882003,"about_ca_topic_score_gemma":0.0021335902,"teacher_disagreement_score":0.003986064,"about_ca_system_score_codex":0.0018847496,"about_ca_system_score_gemma":0.0008433476,"threshold_uncertainty_score":0.016841412},"labels":[],"label_agreement":null},{"id":"W2949299973","doi":"10.48550/arxiv.0911.5151","title":"Recurrent words with constant Abelian complexity","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Constant (computer programming); Abelian group; Mathematics; Pure mathematics; Computer science; Programming language","score_opus":0.06207296745981019,"score_gpt":0.2749516028501021,"score_spread":0.21287863539029192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949299973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.834309,0.00047840903,0.12522042,0.0010752056,0.00026319234,0.00007029807,0.0003691757,0.0007240504,0.037490215],"genre_scores_gemma":[0.97755617,0.00010531001,0.014928768,0.00020867934,0.00017517315,0.00006291527,0.00025009303,0.00008717345,0.0066257445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981178,0.00037586244,0.0001680762,0.0004967544,0.00045005057,0.00039147935],"domain_scores_gemma":[0.98573685,0.008124386,0.0021277948,0.0017154121,0.0016315184,0.00066393305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006609578,0.00060004235,0.00065581285,0.0010884253,0.0012802216,0.002627276,0.001146278,0.0013877413,0.008246547],"category_scores_gemma":[0.008541172,0.0004850839,0.0009650854,0.000756124,0.0025063262,0.004590757,0.00242693,0.0016160712,0.0018114919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004490499,0.00010695746,0.004651591,0.0004018683,0.00008041007,0.002482697,0.0020251493,0.0056314105,0.055565033,0.9080654,0.00309801,0.017442377],"study_design_scores_gemma":[0.000084918334,0.00016960205,0.0017335974,0.00005196174,0.000118081516,0.0022760362,0.00057333545,0.040427353,0.034483362,0.9049534,0.015026899,0.0001014873],"about_ca_topic_score_codex":0.0003408658,"about_ca_topic_score_gemma":0.00040221273,"teacher_disagreement_score":0.008246547,"about_ca_system_score_codex":0.0007321977,"about_ca_system_score_gemma":0.00047720363,"threshold_uncertainty_score":0.027587414},"labels":[],"label_agreement":null},{"id":"W2949340385","doi":"10.48550/arxiv.0907.0159","title":"The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Prefix; Universality (dynamical systems); Mathematics; Computer science; Arithmetic; Linguistics; Philosophy; Physics","score_opus":0.05736920413176716,"score_gpt":0.277646012375562,"score_spread":0.22027680824379486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949340385","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7767424,0.0015724307,0.19382928,0.011988267,0.00019039435,0.00033304046,0.0034199238,0.0009070149,0.011017332],"genre_scores_gemma":[0.93105114,0.00063780823,0.06068523,0.00055984204,0.00043008904,0.00030662466,0.0032767837,0.00027475908,0.002777661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9884062,0.00391031,0.00090690854,0.0036224916,0.0016726949,0.0014813943],"domain_scores_gemma":[0.8471334,0.13929246,0.004526486,0.0054326043,0.0018180397,0.0017969138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068784435,0.0013284462,0.0024551349,0.0017603835,0.0023798766,0.00899197,0.004023739,0.0032452352,0.007834496],"category_scores_gemma":[0.05625873,0.0011536353,0.003832265,0.0024116384,0.006833097,0.025253896,0.004942908,0.0054964977,0.000578251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040007606,0.0010429996,0.03353259,0.002673409,0.0007922662,0.0011818024,0.0042532957,0.22826304,0.0077333828,0.58088756,0.01347955,0.122159444],"study_design_scores_gemma":[0.00016534656,0.00010778973,0.0014524219,0.000063299754,0.00011910351,0.00029809648,0.0007236937,0.18072319,0.0025898148,0.8123775,0.0013153964,0.00006430352],"about_ca_topic_score_codex":0.0038694446,"about_ca_topic_score_gemma":0.0032472084,"teacher_disagreement_score":0.00899197,"about_ca_system_score_codex":0.0037153529,"about_ca_system_score_gemma":0.0032911596,"threshold_uncertainty_score":0.036377132},"labels":[],"label_agreement":null},{"id":"W2949449426","doi":"","title":"Extremal words in the shift orbit closure of a morphic sequence","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Lexicographical order; Word (group theory); Morphism; Closure (psychology); Mathematics; Combinatorics; Alphabet; Sequence (biology); Orbit (dynamics); Sigma; Binary number; Omega; Discrete mathematics; Arithmetic; Linguistics; Physics; Geometry","score_opus":0.08722468572650457,"score_gpt":0.19206390880599006,"score_spread":0.10483922307948548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949449426","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8870268,0.00057973556,0.08040657,0.00033582674,0.000078053425,0.000034576955,0.00026737215,0.0002098708,0.031061225],"genre_scores_gemma":[0.98019147,0.0001292867,0.014867488,0.00005217058,0.00006997025,0.00003518342,0.00015535916,0.000046454035,0.004452463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966645,0.000048205628,0.000040116534,0.000104433144,0.000085624226,0.000055074455],"domain_scores_gemma":[0.99946505,0.0002252477,0.00009601892,0.00005448297,0.00009658788,0.00006259766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024897078,0.00024029094,0.00031280902,0.00091396034,0.00097545644,0.0014030447,0.00027206537,0.00039231,0.0024931536],"category_scores_gemma":[0.0010852406,0.00024083385,0.00032876633,0.00047400407,0.0017973533,0.0018341482,0.0009257274,0.0006718945,0.00027908426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010245339,0.000015112957,0.00099031,0.000075217875,0.0000076055285,0.00034165414,0.0011656358,0.0010023251,0.015177608,0.96812963,0.00043569857,0.0125568155],"study_design_scores_gemma":[0.000024542838,0.00008020563,0.002128431,0.000048118854,0.00002757563,0.00084396434,0.0008725498,0.011073133,0.014818167,0.95934284,0.0106990365,0.000041438343],"about_ca_topic_score_codex":0.00034782148,"about_ca_topic_score_gemma":0.00048693098,"teacher_disagreement_score":0.0024931536,"about_ca_system_score_codex":0.0007010244,"about_ca_system_score_gemma":0.00027473035,"threshold_uncertainty_score":0.008340418},"labels":[],"label_agreement":null},{"id":"W2949687231","doi":"10.1016/j.ic.2017.07.009","title":"Deletion operations on deterministic families of automata","year":2017,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Nondeterministic algorithm; Bounded function; Deterministic pushdown automaton; Quotient; Computer science; Regular language; Discrete mathematics; Mathematics; Automaton; Nondeterministic finite automaton; Combinatorics; Theoretical computer science; Automata theory","score_opus":0.015235780528646823,"score_gpt":0.27170826713596813,"score_spread":0.2564724866073213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949687231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22566898,0.0013001377,0.7447724,0.0012881899,0.00025260955,0.00007881065,0.00071694946,0.0009928957,0.02492911],"genre_scores_gemma":[0.88168114,0.0008097375,0.09866607,0.0003356291,0.00023112987,0.00026576538,0.00080264994,0.0003797428,0.016828217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99623615,0.0010648256,0.00044408417,0.001004756,0.00083987263,0.00041039454],"domain_scores_gemma":[0.97898453,0.015217971,0.001123308,0.0024083955,0.0015078139,0.0007580449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026870626,0.0008536218,0.0011109965,0.0021878944,0.0029925273,0.0039555556,0.0019072235,0.001623283,0.0062717837],"category_scores_gemma":[0.010208678,0.0010963634,0.0018336897,0.0019738465,0.004496879,0.011534764,0.0032569151,0.0021733174,0.0011531804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010177259,0.000024421668,0.00039717043,0.00006493883,0.000013206906,0.00024072677,0.0006272958,0.0026387756,0.0022913283,0.98289907,0.00086783676,0.009833565],"study_design_scores_gemma":[0.000024392304,0.00003108594,0.00017448886,0.000022683587,0.000026780892,0.00041317998,0.00018831475,0.013217976,0.0029608982,0.9779449,0.0049633402,0.00003200952],"about_ca_topic_score_codex":0.0006503787,"about_ca_topic_score_gemma":0.0005962268,"teacher_disagreement_score":0.0062717837,"about_ca_system_score_codex":0.0015535968,"about_ca_system_score_gemma":0.0010285842,"threshold_uncertainty_score":0.020981193},"labels":[],"label_agreement":null},{"id":"W2949830328","doi":"10.48550/arxiv.1202.0276","title":"A combinatorial approach for solving certain nested recursions with non-slow solutions","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Recursion (computer science); Golomb coding; Interpretation (philosophy); Lambda; Tree (set theory); Sequence (biology); Monotone polygon; Mathematics; Combinatorics; Function (biology); Generating function; Discrete mathematics; Computer science; Algorithm; Physics; Geometry","score_opus":0.06844618958737558,"score_gpt":0.18510450200578585,"score_spread":0.11665831241841026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949830328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040415388,0.00008124492,0.95162946,0.00030744876,0.000039694103,0.000059989146,0.000040584844,0.00013490739,0.0072912686],"genre_scores_gemma":[0.38957578,0.00015459556,0.60009885,0.0002959903,0.00013360503,0.00035891592,0.00018184568,0.0001816323,0.009018869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916065,0.00030947867,0.000059313523,0.00016280162,0.00018889765,0.00011882071],"domain_scores_gemma":[0.9982096,0.0010633036,0.00015907225,0.00023508772,0.00019217387,0.00014077169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016639964,0.00058794854,0.00059112074,0.001189519,0.0010651352,0.0014729461,0.0015401931,0.001529889,0.005093537],"category_scores_gemma":[0.006989345,0.00043091268,0.0013593977,0.0008729417,0.002415436,0.0023769722,0.0020186987,0.002192585,0.00070219114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016564427,0.000024452494,0.0003073863,0.000049653932,0.00000916022,0.00008625323,0.00023094694,0.019949691,0.0026568256,0.9641627,0.0004870773,0.012019245],"study_design_scores_gemma":[0.000014041223,0.000020135982,0.000061715014,0.000015192523,0.0000057359143,0.00004760755,0.000059771308,0.1779623,0.0010159407,0.81937253,0.001413689,0.000011461096],"about_ca_topic_score_codex":0.00092556386,"about_ca_topic_score_gemma":0.0020243274,"teacher_disagreement_score":0.005093537,"about_ca_system_score_codex":0.0010464845,"about_ca_system_score_gemma":0.0008546379,"threshold_uncertainty_score":0.017039597},"labels":[],"label_agreement":null},{"id":"W2949945653","doi":"10.48550/arxiv.math/0210182","title":"Approximation to real numbers by cubic algebraic integers II","year":2002,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Exponent; Algebraic number; Mathematics; Transcendental number; Integer (computer science); Combinatorics; Real number; Degree (music); Discrete mathematics; Property (philosophy); Physics; Mathematical analysis; Computer science","score_opus":0.02501620453971207,"score_gpt":0.24668063431600107,"score_spread":0.221664429776289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949945653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6482533,0.0015963172,0.23630728,0.002658079,0.0006040212,0.00011097928,0.00045452794,0.0013265853,0.10868897],"genre_scores_gemma":[0.9506639,0.00034668038,0.038602717,0.00017477477,0.00011861025,0.000042179974,0.00019774534,0.00007647369,0.009776967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904853,0.00018970344,0.000056748766,0.00018393474,0.00027746236,0.00024367905],"domain_scores_gemma":[0.99739873,0.0013272717,0.00025326535,0.00058476924,0.0002747303,0.00016116234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090978737,0.00036626312,0.00048175053,0.001090352,0.0009038054,0.0022937187,0.000617531,0.0004460946,0.0064271735],"category_scores_gemma":[0.008470809,0.0002907318,0.0005737246,0.00088355294,0.001958984,0.002368652,0.0015053828,0.0014666512,0.0010714337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037778105,0.000055916313,0.0021912875,0.00014767236,0.0000122260235,0.00015880703,0.00062348705,0.019612363,0.0066246702,0.93219876,0.003494295,0.034502674],"study_design_scores_gemma":[0.00007335298,0.00009345982,0.0010938703,0.000084123996,0.000020712072,0.0003296252,0.0003219084,0.20313612,0.006680372,0.7655328,0.022591313,0.000042369236],"about_ca_topic_score_codex":0.0023002853,"about_ca_topic_score_gemma":0.0023104511,"teacher_disagreement_score":0.0064271735,"about_ca_system_score_codex":0.0019891975,"about_ca_system_score_gemma":0.0007633188,"threshold_uncertainty_score":0.021501005},"labels":[],"label_agreement":null},{"id":"W2950033168","doi":"10.48550/arxiv.1107.4654","title":"On abelian and additive complexity in infinite words","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Abelian group; Bounded function; Mathematics; Discrete mathematics; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.10706452918237605,"score_gpt":0.19396571086449196,"score_spread":0.08690118168211591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950033168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59912646,0.005846089,0.23860882,0.0051714703,0.00037744592,0.000071247145,0.0004943066,0.00026784305,0.15003626],"genre_scores_gemma":[0.981831,0.0006769182,0.011031697,0.0002703226,0.0005179942,0.000057174617,0.00017377784,0.000046095665,0.00539503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979615,0.0005767701,0.000115716524,0.00030067816,0.00078216486,0.00026308504],"domain_scores_gemma":[0.99027467,0.0069374987,0.0006922998,0.000532651,0.0010482315,0.00051467225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011360429,0.00054976885,0.00062622345,0.003016413,0.001283929,0.003743293,0.0008138876,0.00071524945,0.003241394],"category_scores_gemma":[0.0064283796,0.00037005325,0.0008084864,0.0017798236,0.0061941436,0.0074369633,0.002965144,0.0024256583,0.00039957612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016177177,0.00001170799,0.00031834954,0.000032182103,0.0000061383607,0.00007274099,0.00047026336,0.0009737864,0.0007874325,0.99512815,0.0002525736,0.0019304891],"study_design_scores_gemma":[0.000006156354,0.000016026372,0.00050409214,0.00001673627,0.0000060386615,0.0000769155,0.000116659576,0.0038511322,0.00052654825,0.99208564,0.0027793038,0.000014643269],"about_ca_topic_score_codex":0.0010299698,"about_ca_topic_score_gemma":0.0007232891,"teacher_disagreement_score":0.003743293,"about_ca_system_score_codex":0.0017233866,"about_ca_system_score_gemma":0.00056520593,"threshold_uncertainty_score":0.01250416},"labels":[],"label_agreement":null},{"id":"W2950107561","doi":"10.1142/s0129054118400051","title":"On the Density of Context-Free and Counter Languages","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of British Columbia","funders":"","keywords":"Undecidable problem; Deterministic pushdown automaton; Context-free language; Decidability; Mathematics; Regular language; Pushdown automaton; Discrete mathematics; Nondeterministic algorithm; Nested word; Word (group theory); Pumping lemma for regular languages; Combinatorics; Bounded function; Automaton; Nondeterministic finite automaton; Computer science; Finite-state machine; Automata theory; Quantum finite automata; Algorithm; Theoretical computer science; Rule-based machine translation; Programming language","score_opus":0.011998211497109624,"score_gpt":0.2856617002251832,"score_spread":0.2736634887280736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950107561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33970758,0.002528542,0.6221501,0.0017288184,0.00012661032,0.00033243874,0.0006513783,0.0014936015,0.03128093],"genre_scores_gemma":[0.9319115,0.0006668561,0.060597375,0.0003235461,0.00015084061,0.00039882906,0.00044417195,0.00019056188,0.005316253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961392,0.0009933827,0.00032667466,0.0007531564,0.0011838715,0.0006036377],"domain_scores_gemma":[0.9776999,0.017800406,0.00085269526,0.0015450717,0.0014155327,0.00068644114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026115384,0.00068006036,0.00079172873,0.0018956204,0.0016548069,0.0036663394,0.0016069569,0.0010093037,0.0031667557],"category_scores_gemma":[0.015422626,0.0010258162,0.0014175153,0.0012419092,0.0055706087,0.010444706,0.0035864948,0.0029264216,0.0004129782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014469096,0.000049994465,0.0012774676,0.00012136628,0.000019223053,0.00023411373,0.0012295147,0.011525889,0.002690011,0.9705185,0.0005904523,0.011598708],"study_design_scores_gemma":[0.000041157524,0.00007467955,0.0005055893,0.000081663755,0.000053286687,0.00037291978,0.0003656453,0.08740761,0.0060842545,0.9004166,0.004544506,0.000052107778],"about_ca_topic_score_codex":0.0033804625,"about_ca_topic_score_gemma":0.001818531,"teacher_disagreement_score":0.0036663394,"about_ca_system_score_codex":0.0028602877,"about_ca_system_score_gemma":0.0023547614,"threshold_uncertainty_score":0.020752966},"labels":[],"label_agreement":null},{"id":"W2950147499","doi":"","title":"Theory of Atomata","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nondeterministic finite automaton; Deterministic finite automaton; Regular language; Deterministic automaton; Büchi automaton; Nondeterministic algorithm; Finite-state machine; Regular expression; Quotient; Automaton; Discrete mathematics; DFA minimization; Computer science; Mathematics; Combinatorics; Algorithm; Theoretical computer science; Automata theory; Programming language","score_opus":0.08135788777280233,"score_gpt":0.17228220593679217,"score_spread":0.09092431816398984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950147499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031784732,0.00254903,0.74995226,0.0031587912,0.0009926684,0.00031485368,0.002163078,0.0023284403,0.20675616],"genre_scores_gemma":[0.5638268,0.0020207225,0.34392953,0.00162426,0.0007705476,0.0008947327,0.0031739401,0.00079546176,0.082963966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979837,0.0004552875,0.00021541052,0.00059659104,0.0004841909,0.00026472964],"domain_scores_gemma":[0.9985386,0.0005530529,0.000107309745,0.000368638,0.00033884804,0.00009361409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014388285,0.0006453789,0.0007379966,0.0016318348,0.0027513104,0.004148723,0.0018487356,0.0012547014,0.017098056],"category_scores_gemma":[0.0028279757,0.00070334645,0.0018232021,0.0012566006,0.0042759506,0.0075735846,0.0040815813,0.0029427959,0.004608977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006705212,0.000004930285,0.000092160415,0.000032400687,0.000003910594,0.000033625452,0.00022460741,0.0001884508,0.00027579744,0.99536926,0.0010194839,0.002748694],"study_design_scores_gemma":[0.000011203594,0.000013401366,0.00008930244,0.000030955394,0.000010370667,0.00014153618,0.00010666394,0.0029653565,0.00094917836,0.9371268,0.05854526,0.000010072418],"about_ca_topic_score_codex":0.001435906,"about_ca_topic_score_gemma":0.0010995336,"teacher_disagreement_score":0.017098056,"about_ca_system_score_codex":0.0021655394,"about_ca_system_score_gemma":0.001118792,"threshold_uncertainty_score":0.057198763},"labels":[],"label_agreement":null},{"id":"W2950158923","doi":"10.48550/arxiv.0808.2417","title":"On NFAs Where All States are Final, Initial, or Both","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nondeterministic algorithm; Automaton; Finite-state machine; Computer science; State (computer science); Nondeterministic finite automaton; Discrete mathematics; Mathematics; Theoretical computer science; Combinatorics; Programming language; Automata theory","score_opus":0.10069417776452155,"score_gpt":0.3076529819467308,"score_spread":0.20695880418220924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950158923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30291277,0.00082972547,0.6363471,0.01150635,0.00033168058,0.00038255317,0.0013745291,0.00068497896,0.04563032],"genre_scores_gemma":[0.86245203,0.0010431105,0.12077562,0.0013024423,0.00079131377,0.00043047935,0.0017073496,0.00034639734,0.0111511955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98734516,0.004413274,0.0010434489,0.0029912854,0.0021628055,0.0020440954],"domain_scores_gemma":[0.8956219,0.08681208,0.0054424256,0.008163351,0.0022760904,0.0016841817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008726752,0.0013712837,0.0023135992,0.0019602065,0.0053735697,0.007481487,0.0036486865,0.0049120183,0.0100681055],"category_scores_gemma":[0.043184288,0.0011456726,0.0049694055,0.0025951972,0.008134056,0.031210817,0.005380424,0.0091206925,0.0010929232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023346624,0.00021940973,0.0025131593,0.00034249606,0.0000805865,0.00047001525,0.0010821634,0.023199502,0.0028133313,0.953434,0.0020583568,0.01355358],"study_design_scores_gemma":[0.000025245463,0.00003438107,0.000367504,0.000040291114,0.0000321496,0.00019892273,0.00029882236,0.027531551,0.001480508,0.9679137,0.0020467371,0.00003020256],"about_ca_topic_score_codex":0.0028323801,"about_ca_topic_score_gemma":0.0037564128,"teacher_disagreement_score":0.0100681055,"about_ca_system_score_codex":0.004222004,"about_ca_system_score_gemma":0.0020703115,"threshold_uncertainty_score":0.046151996},"labels":[],"label_agreement":null},{"id":"W2950350370","doi":"10.48550/arxiv.math/0602454","title":"On the rational subset problem for groups","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Decidability; Mathematics; Free product; Monoid; Abelian group; Combinatorics; Discrete mathematics; Group (periodic table); Commutative property; Direct product; Free monoid; Product (mathematics)","score_opus":0.03801478463653996,"score_gpt":0.2499666468721628,"score_spread":0.21195186223562285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950350370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3211191,0.0039496585,0.60798436,0.02226173,0.00041868893,0.0003156105,0.00092266535,0.0014203292,0.04160786],"genre_scores_gemma":[0.88504213,0.0015276361,0.09674599,0.0013836123,0.00080013135,0.00036217555,0.001298609,0.00030940663,0.0125303725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99503005,0.0018376263,0.00040914296,0.0012585752,0.00072069175,0.00074385904],"domain_scores_gemma":[0.98023945,0.017281434,0.0005080293,0.0010035095,0.0006041836,0.00036335652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061719334,0.00074012676,0.0013581786,0.0018642545,0.003190329,0.005954026,0.002227355,0.0021565186,0.0044159754],"category_scores_gemma":[0.01235289,0.00078882265,0.0033394517,0.0016699281,0.0071285153,0.021083957,0.004261564,0.005615881,0.00060185546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011696525,0.00013085704,0.0013687196,0.00020200515,0.000037524253,0.00040275714,0.0029363364,0.010544241,0.0018994099,0.95942533,0.0029514143,0.01998449],"study_design_scores_gemma":[0.0000326641,0.00003425915,0.00017510823,0.00003604112,0.000025718347,0.00015685301,0.00055111106,0.023163673,0.0018999589,0.9683243,0.0055723446,0.000027915672],"about_ca_topic_score_codex":0.0039693825,"about_ca_topic_score_gemma":0.0022377763,"teacher_disagreement_score":0.0061719334,"about_ca_system_score_codex":0.004797853,"about_ca_system_score_gemma":0.002209448,"threshold_uncertainty_score":0.03481096},"labels":[],"label_agreement":null},{"id":"W2950353433","doi":"","title":"There are k-uniform cubefree binary morphisms for all k >= 0","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Morphism; Sigma; Binary number; Mathematics; Word (group theory); Combinatorics; Pure mathematics; Discrete mathematics; Physics; Arithmetic; Geometry","score_opus":0.05784351900844131,"score_gpt":0.2664431063803424,"score_spread":0.2085995873719011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950353433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8091968,0.0029288596,0.14744833,0.0009960624,0.00039513613,0.00009263587,0.0016643701,0.0011562993,0.036121435],"genre_scores_gemma":[0.9442166,0.00094095245,0.038499624,0.00036525246,0.00017861708,0.00020742761,0.0014328456,0.00017950301,0.013979243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998862,0.00012978012,0.00010562738,0.00044216457,0.00020762414,0.0002527112],"domain_scores_gemma":[0.9947077,0.0025075122,0.00065259245,0.0004537153,0.0008662215,0.00081223494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089267385,0.0006602407,0.00062564865,0.0009883096,0.0017983101,0.002142978,0.0006122079,0.0007988665,0.006980597],"category_scores_gemma":[0.003562511,0.00078454375,0.0008899422,0.0009559235,0.0025466755,0.0044402545,0.0031952458,0.0014960819,0.0018426892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012913342,0.00016887148,0.010481904,0.00069002504,0.000104996674,0.0019738886,0.0026521077,0.0034251683,0.03707809,0.88598996,0.0053855944,0.050758023],"study_design_scores_gemma":[0.00011760675,0.00018699307,0.011095341,0.0001348916,0.0001011539,0.0033412685,0.0008384641,0.010991866,0.026936969,0.92103446,0.024993768,0.00022715521],"about_ca_topic_score_codex":0.0010168329,"about_ca_topic_score_gemma":0.00087427563,"teacher_disagreement_score":0.006980597,"about_ca_system_score_codex":0.001065367,"about_ca_system_score_gemma":0.000679217,"threshold_uncertainty_score":0.023352444},"labels":[],"label_agreement":null},{"id":"W2950489119","doi":"10.48550/arxiv.0907.4667","title":"Further applications of a power series method for pattern avoidance","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Alphabet; Morphism; Combinatorics on words; Combinatorics; Mathematics; Sigma; Series (stratigraphy); Class (philosophy); Binary number; Word (group theory); Algebraic number; Upper and lower bounds; Discrete mathematics; Arithmetic; Computer science; Physics; Artificial intelligence; Geometry","score_opus":0.02269352017953786,"score_gpt":0.2917949579463926,"score_spread":0.26910143776685475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950489119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022434136,0.0017314438,0.9210028,0.0026521764,0.0008070273,0.00012048485,0.00011867868,0.00049313845,0.05064002],"genre_scores_gemma":[0.3799172,0.0036092817,0.5468252,0.0016185158,0.0022867394,0.0004458092,0.00030498247,0.0007234779,0.06426887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864644,0.00037297135,0.00009036776,0.00036838782,0.00043042825,0.0000914213],"domain_scores_gemma":[0.99610835,0.0023447028,0.00017161331,0.0008684594,0.00036170435,0.00014514105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001927473,0.0013128058,0.001044877,0.0026001057,0.0016224881,0.0016895513,0.0017716644,0.0012176625,0.014340091],"category_scores_gemma":[0.008403722,0.00060073927,0.0024434784,0.002469465,0.00382887,0.0052298633,0.0033749742,0.0039189723,0.0022250577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006276885,0.000068340516,0.00037583418,0.00013609332,0.000031479765,0.00020174551,0.0003724822,0.0072673773,0.0039619827,0.9223399,0.003355972,0.061825942],"study_design_scores_gemma":[0.00002409778,0.00006763599,0.00014265954,0.000022713413,0.000019899002,0.00032699472,0.00006035967,0.046431087,0.001987372,0.927493,0.023394981,0.000029286148],"about_ca_topic_score_codex":0.00082237105,"about_ca_topic_score_gemma":0.0009404845,"teacher_disagreement_score":0.014340091,"about_ca_system_score_codex":0.0010969015,"about_ca_system_score_gemma":0.0005978565,"threshold_uncertainty_score":0.04797244},"labels":[],"label_agreement":null},{"id":"W2950591547","doi":"10.48550/arxiv.cs/0604104","title":"On the Shannon Covers of Certain Irreducible Constrained Systems of Finite Type","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cover (algebra); Presentation (obstetrics); FTCS scheme; Mathematics; Type (biology); Automaton; Word (group theory); Discrete mathematics; Pure mathematics; Computer science; Ordinary differential equation; Mathematical analysis; Theoretical computer science; Differential equation; Geometry; Engineering","score_opus":0.04169870009626818,"score_gpt":0.25060793330755027,"score_spread":0.20890923321128207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950591547","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80844134,0.0002449413,0.16710219,0.00031804238,0.00003096116,0.000052259395,0.0001791974,0.00023632999,0.023394834],"genre_scores_gemma":[0.9841936,0.00010508946,0.012551033,0.000045182984,0.000040404775,0.00006497278,0.00012032399,0.00004276391,0.0028367364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989506,0.00026725905,0.000054052805,0.00012521069,0.00035976226,0.00024311089],"domain_scores_gemma":[0.9975897,0.0015219115,0.0002797686,0.0002386158,0.0001774181,0.00019254457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000765456,0.00042524302,0.00054149656,0.0012136752,0.0012976651,0.0014805221,0.0005017275,0.00071836956,0.0037319667],"category_scores_gemma":[0.0039673336,0.0004399853,0.00086346513,0.0007271314,0.002040768,0.0021073301,0.0017052889,0.0012609859,0.00025946583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001524566,0.000034269236,0.0013286619,0.000084901665,0.000028295897,0.0005481687,0.0014329453,0.022163982,0.009417311,0.9530653,0.00051352143,0.01123021],"study_design_scores_gemma":[0.000024690165,0.000095686155,0.0013666305,0.000034792723,0.000032341773,0.00041589825,0.00037275528,0.08368186,0.0076674228,0.90326244,0.0029893757,0.000056167308],"about_ca_topic_score_codex":0.00077339046,"about_ca_topic_score_gemma":0.0007473614,"teacher_disagreement_score":0.0037319667,"about_ca_system_score_codex":0.001093181,"about_ca_system_score_gemma":0.0005438572,"threshold_uncertainty_score":0.01248467},"labels":[],"label_agreement":null},{"id":"W2951205465","doi":"10.48550/arxiv.1004.1890","title":"On the superimposition of Christoffel words","year":2010,"lang":"en","type":"preprint","venue":"Archipelago (Université du Québec à Montréal)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Christoffel symbols; Superimposition; Conjecture; Mathematics; Root (linguistics); Pure mathematics; Arithmetic; Combinatorics; Linguistics; Computer science; Philosophy; Artificial intelligence","score_opus":0.006177373981429543,"score_gpt":0.17036645386233032,"score_spread":0.16418907988090078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951205465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79271024,0.00042822634,0.16548854,0.00061327964,0.00018748574,0.000103817896,0.00012889331,0.00056281267,0.039776683],"genre_scores_gemma":[0.9618077,0.00019515937,0.030663593,0.00014135173,0.00014298277,0.00009295694,0.00017765463,0.00009816355,0.006680407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99529654,0.00097125286,0.0003747747,0.0012038061,0.0013673116,0.0007862768],"domain_scores_gemma":[0.99168724,0.004665299,0.001085106,0.0013294636,0.0006086226,0.00062431773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019911542,0.0006359815,0.0008890514,0.0013678904,0.0034203904,0.0023034664,0.0012880918,0.0017279999,0.008098084],"category_scores_gemma":[0.013791551,0.00066311663,0.0008125783,0.0014530462,0.0051195035,0.0052866973,0.0034267907,0.0017497586,0.0011949947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047884678,0.00008624006,0.0020353752,0.000101078054,0.000021906493,0.0010861485,0.0014068969,0.008342528,0.011400459,0.9445119,0.0007170379,0.029811533],"study_design_scores_gemma":[0.000072551346,0.000298674,0.0009792452,0.00005686697,0.000034073208,0.0012026012,0.00079490687,0.034961887,0.02052044,0.9304787,0.010518464,0.000081500126],"about_ca_topic_score_codex":0.0006906422,"about_ca_topic_score_gemma":0.0005299147,"teacher_disagreement_score":0.008098084,"about_ca_system_score_codex":0.0012288896,"about_ca_system_score_gemma":0.000967785,"threshold_uncertainty_score":0.027090847},"labels":[],"label_agreement":null},{"id":"W2951393208","doi":"10.48550/arxiv.1408.0389","title":"Bifix codes and interval exchanges","year":2014,"lang":"en","type":"preprint","venue":"Archipelago (Université du Québec à Montréal)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Interval (graph theory); Mathematics; Combinatorics","score_opus":0.008124256583171655,"score_gpt":0.17813909347262963,"score_spread":0.17001483688945798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951393208","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71232593,0.00056628045,0.23365049,0.0009473244,0.00013367475,0.00004963672,0.00038156207,0.00032842977,0.051616736],"genre_scores_gemma":[0.9801384,0.00018490404,0.013779772,0.00011803797,0.000063534826,0.000037602524,0.00017099311,0.000051837862,0.00545487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989201,0.00015898216,0.000058049507,0.00026821962,0.00034594964,0.00024884474],"domain_scores_gemma":[0.9960061,0.0020782019,0.00054574094,0.00052855164,0.00051019597,0.00033134434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081018085,0.00026914175,0.0003439952,0.0010852121,0.0013457092,0.0021096626,0.00067166245,0.0008303203,0.0046998328],"category_scores_gemma":[0.0052918154,0.00016085718,0.0005592166,0.0010532486,0.0026049018,0.0033870782,0.0016838947,0.0017053856,0.0004506692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051323823,0.00001197201,0.00073186366,0.000018797973,0.0000031161862,0.00011073256,0.00034247906,0.001470061,0.0023541385,0.987257,0.00026448292,0.0073840185],"study_design_scores_gemma":[0.000014571709,0.000048381058,0.0006189953,0.000020910606,0.00000885551,0.00038211612,0.00029101895,0.017581977,0.0057898727,0.970858,0.0043605976,0.000024710582],"about_ca_topic_score_codex":0.0014991146,"about_ca_topic_score_gemma":0.00067895296,"teacher_disagreement_score":0.0046998328,"about_ca_system_score_codex":0.0010652076,"about_ca_system_score_gemma":0.00057253265,"threshold_uncertainty_score":0.015722513},"labels":[],"label_agreement":null},{"id":"W2951433852","doi":"10.1007/s00029-021-00629-2","title":"Noncommutative rational Pólya series","year":2021,"lang":"en","type":"preprint","venue":"Selecta Mathematica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Karl-Franzens-Universität Graz; Austrian Science Fund","keywords":"Mathematics; Noncommutative geometry; Formal power series; Series (stratigraphy); Corollary; Invertible matrix; Power series; Conjecture; Field (mathematics); Pure mathematics; Discrete mathematics; Combinatorics; Mathematical analysis","score_opus":0.01580780768877425,"score_gpt":0.256094717062033,"score_spread":0.24028690937325878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951433852","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60994565,0.00094664516,0.26171905,0.0011590081,0.0006933721,0.00008436793,0.0002750188,0.00071667414,0.124460235],"genre_scores_gemma":[0.97153,0.000265669,0.011627712,0.00009129864,0.00014396782,0.00003949284,0.000071198716,0.00005316066,0.01617754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908566,0.00017794257,0.0000686687,0.0002861834,0.00026996873,0.00011153621],"domain_scores_gemma":[0.999271,0.00023479048,0.00011874841,0.00014417218,0.00014973902,0.00008157413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072722073,0.0003677101,0.00039847888,0.0006851217,0.00085232535,0.001988588,0.00044807332,0.0003538865,0.0068177404],"category_scores_gemma":[0.0018756177,0.00018890748,0.00052985054,0.0005458109,0.0024721443,0.0029566528,0.000964187,0.0008698107,0.0008982183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031289783,0.0000148804675,0.0002363976,0.00002222696,0.0000043711543,0.00014079899,0.00018834844,0.0011187418,0.0024514343,0.9918133,0.000367715,0.003610437],"study_design_scores_gemma":[0.000020758349,0.00004897616,0.00040184587,0.000021109632,0.000012342532,0.00022807167,0.00019399638,0.01222876,0.006401445,0.9666323,0.013788038,0.000022361974],"about_ca_topic_score_codex":0.00036977587,"about_ca_topic_score_gemma":0.00031019057,"teacher_disagreement_score":0.0068177404,"about_ca_system_score_codex":0.0008588994,"about_ca_system_score_gemma":0.00038811436,"threshold_uncertainty_score":0.022807598},"labels":[],"label_agreement":null},{"id":"W2951629521","doi":"10.1142/s0129054119400239","title":"Most Complex Non-Returning Regular Languages","year":2019,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Concatenation (mathematics); Upper and lower bounds; Regular language; State (computer science); Semigroup; Discrete mathematics; Star (game theory); Mathematics; Combinatorics; Binary number; Automaton; Computer science; Algorithm; Theoretical computer science; Arithmetic","score_opus":0.02039698106508405,"score_gpt":0.31923168493430226,"score_spread":0.29883470386921823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951629521","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65808076,0.0003567015,0.31814376,0.001085699,0.000053229345,0.0002224802,0.0009889306,0.0016693592,0.01939913],"genre_scores_gemma":[0.91638595,0.00016539854,0.077424586,0.00019907347,0.00004592128,0.00015682544,0.00080462225,0.00024498813,0.004572607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998086,0.00030843672,0.00023442796,0.00050891715,0.0006647027,0.00019760139],"domain_scores_gemma":[0.9896975,0.0051436936,0.0014595252,0.002025102,0.0012725436,0.00040157235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097412785,0.00035739917,0.0004489952,0.00050158694,0.00079954363,0.0021220886,0.0012524966,0.0005333165,0.0051449384],"category_scores_gemma":[0.006761292,0.00047355518,0.000853164,0.00050375576,0.0016144648,0.00352847,0.0016487474,0.0013309714,0.0008191902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069044746,0.00024525885,0.008114255,0.00074163044,0.000062692954,0.0010098632,0.0026646806,0.014765923,0.08671308,0.8153795,0.0031179977,0.0664947],"study_design_scores_gemma":[0.00006435149,0.00026567696,0.005308034,0.00008955236,0.00011827848,0.0017820972,0.00094139023,0.068635345,0.110693604,0.7890145,0.02297161,0.00011551851],"about_ca_topic_score_codex":0.00033884004,"about_ca_topic_score_gemma":0.0004764307,"teacher_disagreement_score":0.0051449384,"about_ca_system_score_codex":0.0008752421,"about_ca_system_score_gemma":0.00077448896,"threshold_uncertainty_score":0.017211497},"labels":[],"label_agreement":null},{"id":"W2951674483","doi":"10.48550/arxiv.1105.0086","title":"A Pattern Sequence Approach to Stern's Sequence","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Sequence (biology); Complement (music); Word (group theory); String (physics); Base (topology); Mathematics; Binary number; Integer (computer science); Bar (unit); Physics; Discrete mathematics; Arithmetic; Computer science; Geometry; Mathematical physics; Mathematical analysis; Chemistry","score_opus":0.1631295145464035,"score_gpt":0.19920289243417796,"score_spread":0.036073377887774455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951674483","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027099883,0.0011094244,0.88694954,0.0014600254,0.0007162071,0.00010154223,0.00024463452,0.00047469477,0.08184406],"genre_scores_gemma":[0.46184,0.0019272817,0.4481444,0.0010732412,0.001234172,0.00038319745,0.00048886874,0.0004925634,0.084416285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897003,0.0003036225,0.00008143594,0.000238249,0.00028797134,0.00011873087],"domain_scores_gemma":[0.99877924,0.00044679517,0.000106294836,0.00028283236,0.00025121254,0.00013362261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012428619,0.00062267866,0.00056894834,0.00204448,0.0013142482,0.0022649576,0.001443382,0.0010937096,0.011012127],"category_scores_gemma":[0.0036599715,0.00041195843,0.000996163,0.0017393237,0.0029859703,0.0053354613,0.002089494,0.0022207396,0.003640996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011921331,0.000008014808,0.00009446658,0.000016470118,0.0000021314008,0.000056911143,0.00022916564,0.000544434,0.00052832527,0.9904821,0.0006226502,0.007403398],"study_design_scores_gemma":[0.000005582872,0.000026890764,0.00006942654,0.000016934498,0.0000037052196,0.0001491333,0.000061711035,0.010993569,0.00067502266,0.9728252,0.015163443,0.000009343222],"about_ca_topic_score_codex":0.00090638176,"about_ca_topic_score_gemma":0.0009298344,"teacher_disagreement_score":0.011012127,"about_ca_system_score_codex":0.0012750219,"about_ca_system_score_gemma":0.000820256,"threshold_uncertainty_score":0.036839247},"labels":[],"label_agreement":null},{"id":"W2951682701","doi":"10.48550/arxiv.1112.3758","title":"Filtrations of Formal Languages by Arithmetic Progressions","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arithmetic; Diagonal; Square (algebra); Context (archaeology); Mathematics; Sequence (biology); Formal language; Set (abstract data type); Filtration (mathematics); Computer science; Linguistics; Algorithm; Pure mathematics; Programming language; Philosophy; History","score_opus":0.04921501896387369,"score_gpt":0.18985637935941863,"score_spread":0.14064136039554492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951682701","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47870138,0.0011038017,0.47107318,0.0008922267,0.00027806792,0.00016889839,0.0005615428,0.0019393682,0.04528153],"genre_scores_gemma":[0.8969096,0.00044409998,0.087892905,0.00025910893,0.00032473763,0.00027103053,0.0005767368,0.00025879234,0.013063073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978016,0.00051365333,0.00023863872,0.00058199465,0.0004417112,0.00042237467],"domain_scores_gemma":[0.99606234,0.0019497105,0.00039859055,0.00057977496,0.00048113783,0.0005284434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002484124,0.0007402982,0.00074011483,0.0025756424,0.0023685598,0.003822925,0.00062260305,0.0009058573,0.0041370513],"category_scores_gemma":[0.0047466815,0.0007445744,0.002317448,0.0009360973,0.0041688466,0.0047744787,0.0027372923,0.0017204005,0.00089502655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010326327,0.000040049657,0.0007353654,0.000069141744,0.000018340668,0.00041345172,0.0017691274,0.0020206624,0.009342388,0.971,0.00088749244,0.013600622],"study_design_scores_gemma":[0.00004538757,0.00009586655,0.0007117345,0.000042578107,0.000027584509,0.00049375574,0.0002878536,0.00850244,0.0069402396,0.9719533,0.0108479895,0.000051405063],"about_ca_topic_score_codex":0.0009630003,"about_ca_topic_score_gemma":0.00072356797,"teacher_disagreement_score":0.0041370513,"about_ca_system_score_codex":0.0013835087,"about_ca_system_score_gemma":0.00077987235,"threshold_uncertainty_score":0.013839781},"labels":[],"label_agreement":null},{"id":"W2951958096","doi":"10.1142/s0129054120410075","title":"The Intersection Problem for Finite Semigroups","year":2020,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Deutsche Forschungsgemeinschaft","keywords":"Decidability; Special classes of semigroups; Intersection (aeronautics); Mathematics; Commutative property; Semigroup; Complexity class; Monoid; Bounded function; Class (philosophy); Word problem (mathematics education); Discrete mathematics; Morphism; Order (exchange); Krohn–Rhodes theory; Pure mathematics; Time complexity; Computer science; Arithmetic","score_opus":0.026329324620930957,"score_gpt":0.30822186272285923,"score_spread":0.28189253810192827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951958096","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7037534,0.0013411298,0.26221114,0.0057245353,0.00010675754,0.00027447127,0.0019439602,0.0012122559,0.023432255],"genre_scores_gemma":[0.943066,0.0005444517,0.047646284,0.0002922801,0.0002484913,0.00021631298,0.0025166213,0.0001911772,0.0052784714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99459165,0.0012395091,0.00058784714,0.0015541804,0.0014008029,0.0006259997],"domain_scores_gemma":[0.95666206,0.03683802,0.0018570852,0.0022046997,0.0012407635,0.0011973103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032153379,0.0006213792,0.001583523,0.0016320157,0.0029585385,0.006554853,0.0020130905,0.0016834225,0.008262462],"category_scores_gemma":[0.018900976,0.00083907647,0.0024835807,0.002030672,0.00482601,0.016009575,0.004268739,0.004350547,0.00064660126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014343151,0.00040161176,0.007643981,0.0007842249,0.00017887991,0.00068391033,0.0034182558,0.03869976,0.006993284,0.86781543,0.006141104,0.06580524],"study_design_scores_gemma":[0.000078926634,0.00009014022,0.0010999889,0.0000655357,0.00006755255,0.0004208122,0.00075605646,0.07800834,0.0068921377,0.9082106,0.004258534,0.000051341987],"about_ca_topic_score_codex":0.0017654705,"about_ca_topic_score_gemma":0.0010906579,"teacher_disagreement_score":0.008262462,"about_ca_system_score_codex":0.0032376954,"about_ca_system_score_gemma":0.0025582353,"threshold_uncertainty_score":0.02764064},"labels":[],"label_agreement":null},{"id":"W2951961788","doi":"10.48550/arxiv.1006.4104","title":"Abelian Primitive Words","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Abelian group; Combinatorics on words; Word (group theory); Rank of an abelian group; Mathematics; Context (archaeology); Arithmetic of abelian varieties; Set (abstract data type); Elementary abelian group; Enumeration; Pure mathematics; Discrete mathematics; Computer science; Biology; Geometry","score_opus":0.044369920398749686,"score_gpt":0.1752911875584094,"score_spread":0.1309212671596597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951961788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5118485,0.0040762415,0.31705743,0.0021978559,0.0010566907,0.00026605156,0.00089349714,0.0007861935,0.1618176],"genre_scores_gemma":[0.9107273,0.0009115974,0.06366577,0.0005025819,0.00051942735,0.00015961564,0.00059678976,0.00016375136,0.022753322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998857,0.00025492208,0.00008649383,0.0002818269,0.00032973263,0.000190116],"domain_scores_gemma":[0.9961809,0.0020334385,0.00050751294,0.00045644745,0.00060118624,0.00022055123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005372682,0.00050727354,0.00053420255,0.0012476892,0.001568988,0.0017569151,0.0009916547,0.00082656275,0.007937025],"category_scores_gemma":[0.0039854525,0.00028501614,0.00052694674,0.0011365202,0.0033662815,0.0047916705,0.0018468545,0.001250892,0.0016957815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006243684,0.000030889085,0.00093329244,0.000142582,0.0000110932615,0.00043397845,0.00042194154,0.0013356792,0.0047778054,0.9728017,0.00199037,0.017058356],"study_design_scores_gemma":[0.000010278088,0.00005116676,0.0002832538,0.000036073892,0.000015134735,0.00056600425,0.00024202945,0.0042903773,0.004796493,0.9672261,0.022463508,0.000019556834],"about_ca_topic_score_codex":0.00032687737,"about_ca_topic_score_gemma":0.00036166588,"teacher_disagreement_score":0.007937025,"about_ca_system_score_codex":0.0006034108,"about_ca_system_score_gemma":0.00045118763,"threshold_uncertainty_score":0.026551962},"labels":[],"label_agreement":null},{"id":"W2952125519","doi":"10.48550/arxiv.math/0610033","title":"Automata over a binary alphabet generating free groups of even rank","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Alphabet; Rank (graph theory); Automaton; Binary number; Combinatorics; Mathematics; Computer science; Arithmetic; Theoretical computer science","score_opus":0.024106702353282713,"score_gpt":0.2498368270045698,"score_spread":0.22573012465128708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952125519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64011335,0.00050318515,0.3105269,0.00079981115,0.00029638928,0.0001997023,0.0005763209,0.0021392803,0.044845074],"genre_scores_gemma":[0.9300234,0.00017093382,0.055411648,0.00013040584,0.000103416896,0.00023235893,0.00052066933,0.00014017815,0.013267006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999298,0.00017091054,0.000057798086,0.00015301837,0.00016518726,0.00015504772],"domain_scores_gemma":[0.9980247,0.00084952224,0.00029219934,0.0003635117,0.00019365983,0.0002763487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005692497,0.0006708733,0.00037660627,0.0007924587,0.001024465,0.0015512414,0.00079396093,0.00058795215,0.0050652055],"category_scores_gemma":[0.0020478473,0.0002876351,0.00089031964,0.0004851868,0.0016121271,0.0022647304,0.0018924691,0.00072701945,0.0010299257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033505162,0.00017376977,0.0023249607,0.00016689584,0.00002855039,0.0005270956,0.0020502468,0.013064828,0.022216864,0.9249816,0.002717706,0.03141246],"study_design_scores_gemma":[0.00014803515,0.00026207435,0.0007430486,0.00006317431,0.00004710359,0.0003722764,0.0004187243,0.065675,0.03151373,0.8795026,0.021149714,0.00010444319],"about_ca_topic_score_codex":0.0006391996,"about_ca_topic_score_gemma":0.0008780683,"teacher_disagreement_score":0.0050652055,"about_ca_system_score_codex":0.00072187884,"about_ca_system_score_gemma":0.00067152036,"threshold_uncertainty_score":0.016944766},"labels":[],"label_agreement":null},{"id":"W2952126735","doi":"10.48550/arxiv.1311.4448","title":"Most Complex Regular Right-Ideal Languages","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ideal (ethics); Mathematics; Quotient; State (computer science); Alphabet; Semigroup; Discrete mathematics; Sequence (biology); Regular language; Combinatorics; Pure mathematics; Computer science; Algorithm; Automaton; Theoretical computer science; Linguistics","score_opus":0.045525544993766064,"score_gpt":0.18543329295013616,"score_spread":0.1399077479563701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952126735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6937578,0.00036190613,0.27857396,0.0011870504,0.00005400774,0.00017253956,0.0014979742,0.0011523636,0.02324247],"genre_scores_gemma":[0.93303895,0.0001669494,0.05940917,0.00017587755,0.000102132486,0.00015990666,0.00095252844,0.00015244292,0.0058420715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977518,0.0003426611,0.00022228001,0.00069828314,0.000702597,0.00028237037],"domain_scores_gemma":[0.99058867,0.0040210555,0.0013765286,0.0017763019,0.0015178329,0.000719677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016518744,0.0003510209,0.0006943634,0.0009203412,0.0011774915,0.0035671685,0.00079862075,0.00054518593,0.0048441454],"category_scores_gemma":[0.0069648535,0.00050777954,0.00091110024,0.0006399769,0.0026191543,0.006889945,0.0024657606,0.0015866478,0.0007691258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032819918,0.000082850485,0.0048007565,0.00013478134,0.000036263627,0.00042062433,0.0018317059,0.004040262,0.022079024,0.9516502,0.0013639044,0.013231468],"study_design_scores_gemma":[0.000058718273,0.00012578134,0.0029625883,0.00004860076,0.000052999243,0.0010226989,0.0009385069,0.041884933,0.02576234,0.91403925,0.013024051,0.0000795628],"about_ca_topic_score_codex":0.00044259845,"about_ca_topic_score_gemma":0.0005206006,"teacher_disagreement_score":0.0048441454,"about_ca_system_score_codex":0.0011229594,"about_ca_system_score_gemma":0.00079067214,"threshold_uncertainty_score":0.01620531},"labels":[],"label_agreement":null},{"id":"W2952198339","doi":"10.48550/arxiv.1102.3932","title":"Fife's Theorem Revisited","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Calculus (dental); Medicine; Orthodontics","score_opus":0.06622231502230806,"score_gpt":0.17311808128531983,"score_spread":0.10689576626301177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952198339","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045016635,0.0049005984,0.68221766,0.012438385,0.0018721394,0.000090591246,0.00056837994,0.0008808838,0.25201473],"genre_scores_gemma":[0.82315856,0.002031577,0.11039852,0.0038705477,0.0015782651,0.00026898074,0.00026818618,0.00026478912,0.05816051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972127,0.00058123056,0.000173036,0.000721279,0.0008546482,0.00045709542],"domain_scores_gemma":[0.9952247,0.0032708724,0.00015960041,0.0005856365,0.00059631746,0.00016285693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004512947,0.00067390274,0.00093798694,0.0016312987,0.0025646433,0.002749669,0.0016669775,0.0020797886,0.010327485],"category_scores_gemma":[0.008193682,0.00044283498,0.0017865442,0.0010237064,0.006873393,0.0092848325,0.003008073,0.0038565537,0.0011865308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001020753,0.000004271969,0.00011806095,0.000020826139,0.0000036653098,0.000035641406,0.00013955573,0.00045091374,0.000107838256,0.99339783,0.0012406072,0.0044705966],"study_design_scores_gemma":[0.000012788587,0.00001638486,0.00012430975,0.000021227457,0.000007765262,0.00013150414,0.000050826056,0.0039201733,0.0007226534,0.97059745,0.0243771,0.000017675888],"about_ca_topic_score_codex":0.0031524997,"about_ca_topic_score_gemma":0.00154988,"teacher_disagreement_score":0.010327485,"about_ca_system_score_codex":0.0026638869,"about_ca_system_score_gemma":0.001339831,"threshold_uncertainty_score":0.03454888},"labels":[],"label_agreement":null},{"id":"W2952343029","doi":"","title":"Finite Orbits of Language Operations","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Waterloo","funders":"","keywords":"Complement (music); Closure (psychology); Set (abstract data type); Finite set; Monoid; Bounded function; Mathematics; Orbit (dynamics); Computer science; Discrete mathematics; Pure mathematics; Programming language; Political science; Engineering; Mathematical analysis","score_opus":0.06161193071247009,"score_gpt":0.18350968864853764,"score_spread":0.12189775793606755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952343029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78386134,0.000603533,0.1654144,0.00072810805,0.000109060034,0.00007198131,0.00046145447,0.0007922669,0.047957826],"genre_scores_gemma":[0.98384804,0.00015854357,0.010678381,0.000054718814,0.000065866916,0.00007418106,0.00023064301,0.00007556542,0.004814037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998793,0.0001540521,0.00008406381,0.00025404058,0.00043366884,0.00028120237],"domain_scores_gemma":[0.9959266,0.002277408,0.0003501548,0.0005329214,0.00046720062,0.00044576853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009903252,0.00042042648,0.000570434,0.0014440357,0.0018553134,0.0031274965,0.00082525914,0.0006165842,0.0046037715],"category_scores_gemma":[0.004111858,0.0003756235,0.0010935867,0.00044140522,0.0041190833,0.0050720465,0.0029357865,0.0015078362,0.00050920964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017746355,0.00004959223,0.0013623515,0.00007573777,0.000020194226,0.00034085804,0.0014005392,0.0032653664,0.0088596735,0.97590774,0.00041299398,0.008127489],"study_design_scores_gemma":[0.00003846724,0.00009465327,0.0009339951,0.00004930175,0.00003374422,0.00026876226,0.0007714287,0.028152281,0.016058082,0.9486756,0.0048860437,0.000037597652],"about_ca_topic_score_codex":0.0020045883,"about_ca_topic_score_gemma":0.0010467162,"teacher_disagreement_score":0.0046037715,"about_ca_system_score_codex":0.0018186407,"about_ca_system_score_gemma":0.0010316396,"threshold_uncertainty_score":0.015401185},"labels":[],"label_agreement":null},{"id":"W2952344650","doi":"10.48550/arxiv.math/0608698","title":"The Quiver of the Semigroup Algebra of a Left Regular Band","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Quiver; Semigroup; Mathematics; Algebra over a field; Pure mathematics","score_opus":0.013763130426212694,"score_gpt":0.2168305934229344,"score_spread":0.2030674629967217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952344650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75856495,0.0007828401,0.18071692,0.00072100875,0.0002268084,0.00007534207,0.00035519514,0.00036321406,0.05819375],"genre_scores_gemma":[0.9731838,0.0002584331,0.014982374,0.00013705777,0.00017941593,0.000043216896,0.00024694361,0.000050154376,0.010918559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996847,0.0000751294,0.000015163052,0.000066884844,0.00009871826,0.000059518465],"domain_scores_gemma":[0.9995652,0.00012201134,0.000058563346,0.00004068614,0.00009448649,0.000119075885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043555623,0.00020739982,0.0003036958,0.0011078718,0.0009635469,0.0022231583,0.00038387082,0.0002847698,0.0060320557],"category_scores_gemma":[0.00086416147,0.0001942991,0.00043443186,0.00049148005,0.0016503,0.0020144994,0.0006595153,0.00069922925,0.000835208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034282133,0.0000199102,0.0006347814,0.000029293828,0.00000779372,0.00013816531,0.00037619527,0.0013266931,0.0033461193,0.9859825,0.00082920893,0.0072752275],"study_design_scores_gemma":[0.000016345783,0.000056107907,0.0013300133,0.00001681554,0.0000136370945,0.00027040116,0.00018841,0.01712712,0.0029771929,0.97098273,0.0069986894,0.000022463171],"about_ca_topic_score_codex":0.0009888955,"about_ca_topic_score_gemma":0.0007673878,"teacher_disagreement_score":0.0060320557,"about_ca_system_score_codex":0.0006398744,"about_ca_system_score_gemma":0.0004689517,"threshold_uncertainty_score":0.020179212},"labels":[],"label_agreement":null},{"id":"W2952441272","doi":"","title":"Quotient Complexity of Star-Free Languages","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quotient; Concatenation (mathematics); Regular language; Mathematics; Star (game theory); Discrete mathematics; Combinatorics; Intersection (aeronautics); Operand; Function (biology); Computer science; Arithmetic; Theoretical computer science; Automaton","score_opus":0.06936346238571205,"score_gpt":0.19577833256891503,"score_spread":0.12641487018320297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952441272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79225206,0.0005567757,0.17922603,0.001224461,0.00006064323,0.00012069896,0.0010657078,0.00055552827,0.02493818],"genre_scores_gemma":[0.9787507,0.00021508962,0.015551957,0.000107058986,0.000081088736,0.00011164598,0.0007589151,0.0001202665,0.004303239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708503,0.0004567872,0.00033105447,0.00063957454,0.0010143018,0.00047335023],"domain_scores_gemma":[0.98647565,0.009009345,0.00078610104,0.0013302555,0.001441267,0.0009573123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014026626,0.00047493892,0.00090633985,0.0013604091,0.0011746236,0.0039709457,0.0011614818,0.00066762266,0.007040526],"category_scores_gemma":[0.011453168,0.00044079762,0.0014415352,0.0009385886,0.0033276805,0.0094288,0.0031488244,0.0020328397,0.0005964709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044293344,0.00008472782,0.0038347172,0.00019892107,0.000043353055,0.0002854488,0.0017054593,0.026259137,0.010753721,0.9378016,0.001723198,0.016866876],"study_design_scores_gemma":[0.000023746514,0.000042659954,0.0008633696,0.000013356574,0.000023242064,0.00016557207,0.00012762246,0.07615769,0.0051980256,0.9152205,0.002134735,0.000029493098],"about_ca_topic_score_codex":0.0017178286,"about_ca_topic_score_gemma":0.001136779,"teacher_disagreement_score":0.007040526,"about_ca_system_score_codex":0.0028461937,"about_ca_system_score_gemma":0.0014009519,"threshold_uncertainty_score":0.023552895},"labels":[],"label_agreement":null},{"id":"W2952515196","doi":"10.48550/arxiv.1602.06915","title":"Periodicity in Rectangular Arrays","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Repetition (rhetorical device); Root (linguistics); Mathematics; Combinatorics; Arithmetic; Algorithm; Discrete mathematics","score_opus":0.044682663767223796,"score_gpt":0.1705782619942617,"score_spread":0.1258955982270379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952515196","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5274196,0.0009970523,0.41001058,0.0007386217,0.0003385083,0.000087940185,0.00039356694,0.0008436721,0.059170462],"genre_scores_gemma":[0.92184937,0.00026389654,0.06915289,0.00016615391,0.00014738175,0.00010415321,0.00019435126,0.000088044115,0.00803384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993777,0.00012357211,0.000050483864,0.0001754173,0.00014214413,0.00013056895],"domain_scores_gemma":[0.99851376,0.0006721365,0.00025859365,0.00030504086,0.00012366762,0.00012685884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005529707,0.00021497464,0.00037388652,0.0005636603,0.00085666194,0.0013445581,0.00047524553,0.000602884,0.0065188045],"category_scores_gemma":[0.0026342198,0.000282288,0.0004721543,0.0005518189,0.0016196519,0.0023588121,0.001491731,0.00063092797,0.00082719506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010717417,0.000019428076,0.0010934831,0.00007970123,0.0000055139785,0.00035150812,0.00039023897,0.0037447386,0.008464893,0.968119,0.0012312254,0.016393105],"study_design_scores_gemma":[0.000047121524,0.00013590339,0.0012881448,0.00003565107,0.000013634732,0.00083376584,0.0003103964,0.050714083,0.011417534,0.9211433,0.01401295,0.00004751017],"about_ca_topic_score_codex":0.00029796697,"about_ca_topic_score_gemma":0.0002933717,"teacher_disagreement_score":0.0065188045,"about_ca_system_score_codex":0.00040262128,"about_ca_system_score_gemma":0.0002847956,"threshold_uncertainty_score":0.021807611},"labels":[],"label_agreement":null},{"id":"W2952621327","doi":"10.48550/arxiv.math/0306081","title":"Avoiding large squares in infinite binary words","year":2003,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Binary number; Mathematics; Least-squares function approximation; Statistics; Arithmetic","score_opus":0.03556507515267771,"score_gpt":0.2701786116115995,"score_spread":0.2346135364589218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952621327","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7089642,0.00040121103,0.26146302,0.00057492644,0.00014919862,0.00006546186,0.000087007276,0.0002915801,0.02800337],"genre_scores_gemma":[0.9212409,0.00020136566,0.06637022,0.00013906539,0.000052077958,0.00011392067,0.00013270903,0.00009201133,0.011657731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950254,0.00012782561,0.000059233123,0.000105086336,0.00011442708,0.00009098663],"domain_scores_gemma":[0.9984492,0.00073657534,0.00023174044,0.00024938252,0.00017679654,0.000156324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004662388,0.0004049454,0.00036991094,0.0004242595,0.0013992877,0.0010943536,0.0004969441,0.00063082157,0.002948301],"category_scores_gemma":[0.002200227,0.00032146994,0.00043083463,0.0004807789,0.0018757024,0.00255233,0.0016027709,0.0008028578,0.0007584481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023003087,0.000082962644,0.0014692044,0.00022549607,0.00001335064,0.0006892984,0.0017459177,0.008675469,0.037855893,0.92041725,0.0010578742,0.027537389],"study_design_scores_gemma":[0.0000538846,0.00020878587,0.00079142605,0.000060913444,0.000026999493,0.0008715082,0.0006830073,0.026670057,0.036864914,0.9127273,0.020983674,0.000057532707],"about_ca_topic_score_codex":0.00031763595,"about_ca_topic_score_gemma":0.00047280418,"teacher_disagreement_score":0.002948301,"about_ca_system_score_codex":0.00050275825,"about_ca_system_score_gemma":0.0003840189,"threshold_uncertainty_score":0.009863079},"labels":[],"label_agreement":null},{"id":"W2952654623","doi":"10.48550/arxiv.1207.4233","title":"Lyndon words and Fibonacci numbers","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Fibonacci number; Combinatorics; Concatenation (mathematics); Word (group theory); Upper and lower bounds; Mathematics; Closure (psychology); Golden ratio; Aperiodic graph; Combinatorics on words; Discrete mathematics; Geometry","score_opus":0.04710241029971428,"score_gpt":0.1737734363795925,"score_spread":0.12667102607987824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952654623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46317062,0.010755054,0.40042362,0.00275975,0.00076094095,0.00010452242,0.0003965497,0.00073285756,0.12089609],"genre_scores_gemma":[0.91777444,0.0016974965,0.06586533,0.0003379513,0.00044863767,0.00014993138,0.00021357865,0.00007001435,0.013442512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989724,0.00026551096,0.00008879249,0.00023158653,0.00029688948,0.0001448111],"domain_scores_gemma":[0.9980509,0.0012243736,0.00023900268,0.00017497236,0.0001946719,0.00011608426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090293045,0.00045349103,0.00054937886,0.0016417993,0.0013309587,0.0022203224,0.000614539,0.0010787988,0.0037467037],"category_scores_gemma":[0.004554416,0.00034763702,0.0005085553,0.0011056424,0.0038064194,0.0032215426,0.0010021677,0.001101151,0.00064900017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037785896,0.000008630883,0.00037704743,0.000053471547,0.0000036476026,0.0001428475,0.00032562844,0.001788033,0.002471811,0.98143494,0.0008538925,0.012502265],"study_design_scores_gemma":[0.000007355273,0.000021993097,0.00032806784,0.000024458353,0.000003694769,0.00018135329,0.00008564929,0.007840172,0.0011236597,0.98363227,0.0067342026,0.000016941402],"about_ca_topic_score_codex":0.000994009,"about_ca_topic_score_gemma":0.0009359389,"teacher_disagreement_score":0.0037467037,"about_ca_system_score_codex":0.0014344512,"about_ca_system_score_gemma":0.000541196,"threshold_uncertainty_score":0.012534022},"labels":[],"label_agreement":null},{"id":"W2952711126","doi":"10.48550/arxiv.1206.5352","title":"Subword Complexity and k-Synchronization","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Contrast (vision); Synchronization (alternating current); Function (biology); Mathematics; Combinatorics; Algorithm; Computer science; Discrete mathematics; Arithmetic; Artificial intelligence; Biology; Evolutionary biology; Topology (electrical circuits); Genetics","score_opus":0.0930934791514959,"score_gpt":0.18355479325032645,"score_spread":0.09046131409883054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952711126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7539859,0.0005055144,0.21984695,0.00068198674,0.000093113325,0.00004577195,0.0002511211,0.00031707768,0.02427259],"genre_scores_gemma":[0.9812617,0.00016280742,0.014502181,0.00007419718,0.00011334378,0.00005902036,0.00013492719,0.000058688533,0.0036330975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876547,0.00018664179,0.000109694054,0.00042428396,0.00031482874,0.00019914069],"domain_scores_gemma":[0.9943159,0.0026929157,0.0010128546,0.0007989967,0.0006288336,0.0005505485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007460485,0.00040077665,0.0006039341,0.0014501024,0.00096662855,0.0016720616,0.00069603126,0.00055872113,0.0044073653],"category_scores_gemma":[0.0044157486,0.00023500269,0.0006219089,0.0009856875,0.0029423104,0.004195063,0.0027116553,0.0010736049,0.0006462978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015307573,0.000032814576,0.0035753623,0.00008186844,0.000020000181,0.00024542445,0.00093309063,0.005674124,0.012352452,0.9583651,0.00077486766,0.01779177],"study_design_scores_gemma":[0.000022042092,0.00010972805,0.0028821535,0.00001920484,0.000028726874,0.00040510925,0.00028866646,0.047795705,0.009027329,0.93395466,0.0054212376,0.000045312183],"about_ca_topic_score_codex":0.00052856124,"about_ca_topic_score_gemma":0.00036971844,"teacher_disagreement_score":0.0044073653,"about_ca_system_score_codex":0.0009745238,"about_ca_system_score_gemma":0.0005498163,"threshold_uncertainty_score":0.014744163},"labels":[],"label_agreement":null},{"id":"W2952789396","doi":"10.48550/arxiv.1505.02695","title":"Palindromic complexity of trees","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Palindrome; Alphabet; TRACE (psycholinguistics); Path (computing); Tree (set theory); Combinatorics; Word (group theory); Upper and lower bounds; Set (abstract data type); Free monoid; Combinatorics on words; Mathematics; Computer science; Discrete mathematics; Monoid; Biology; Linguistics; Genome","score_opus":0.15652650826724238,"score_gpt":0.20203523843705312,"score_spread":0.045508730169810746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952789396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90489966,0.0006069825,0.07114924,0.0011985782,0.00004171783,0.000050812036,0.00050022005,0.00013002026,0.021422822],"genre_scores_gemma":[0.9856483,0.00026832914,0.010840124,0.000098920566,0.00010058956,0.00006350617,0.0003600204,0.00003101432,0.0025892216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849164,0.00028152936,0.000120790966,0.00045070564,0.00042021385,0.00023507947],"domain_scores_gemma":[0.99160624,0.005882629,0.0008308402,0.00065591215,0.00045959093,0.0005647385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000908962,0.0004089462,0.0007104154,0.00153049,0.0012932185,0.0028924884,0.0013432059,0.001084339,0.004992518],"category_scores_gemma":[0.0068668434,0.00046085624,0.00074784626,0.0012644707,0.0022718615,0.0053779604,0.0019516048,0.001964839,0.00049081875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017609308,0.00009881695,0.0029211002,0.00019761139,0.00002407553,0.00040182637,0.0015290421,0.010243358,0.00920544,0.96460885,0.0008197626,0.009774094],"study_design_scores_gemma":[0.000021579468,0.000038748363,0.0006879098,0.000014144226,0.00001004858,0.0002631812,0.00016502506,0.01709552,0.0016218276,0.9787508,0.0013152191,0.000016004078],"about_ca_topic_score_codex":0.0005015774,"about_ca_topic_score_gemma":0.0005156624,"teacher_disagreement_score":0.004992518,"about_ca_system_score_codex":0.0011227642,"about_ca_system_score_gemma":0.00046889405,"threshold_uncertainty_score":0.016701639},"labels":[],"label_agreement":null},{"id":"W2952825866","doi":"10.48550/arxiv.0808.1657","title":"Periodicity, repetitions, and orbits of an automatic sequence","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Decidability; Sequence (biology); Simple (philosophy); Lexicographical order; Quotient; Closure (psychology); Mathematics; Discrete mathematics; Combinatorics","score_opus":0.052077942687973076,"score_gpt":0.2794468482591015,"score_spread":0.2273689055711284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952825866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76246166,0.00081130443,0.20268978,0.00047538328,0.000099392906,0.000048333175,0.00015619365,0.00039918363,0.032858774],"genre_scores_gemma":[0.9694127,0.0002112718,0.025664838,0.000083327606,0.00011930393,0.00005676128,0.000099199446,0.000047412126,0.0043051546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941134,0.00009460935,0.00006783631,0.00017735752,0.00016532785,0.000083517945],"domain_scores_gemma":[0.9982968,0.0009300414,0.00023308315,0.00028175398,0.00016478634,0.00009346085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051457045,0.00026985558,0.00033837487,0.0009745079,0.0010618758,0.0010753789,0.00041814227,0.00047486564,0.0023645374],"category_scores_gemma":[0.002326289,0.00027108303,0.0005874892,0.0004316064,0.002695702,0.0028201577,0.0011998238,0.0008632319,0.00037058967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007558357,0.000022382363,0.0019930804,0.00005785232,0.000007758935,0.00032634547,0.0011546891,0.0034831818,0.015247436,0.9606164,0.00042488868,0.01659035],"study_design_scores_gemma":[0.000018294857,0.00009840919,0.0016544143,0.00003011515,0.000018762996,0.0004521852,0.00023802434,0.025336243,0.01129923,0.9542924,0.00652588,0.000036048197],"about_ca_topic_score_codex":0.00080963015,"about_ca_topic_score_gemma":0.0008003124,"teacher_disagreement_score":0.0023645374,"about_ca_system_score_codex":0.00063004164,"about_ca_system_score_gemma":0.0004057832,"threshold_uncertainty_score":0.007910192},"labels":[],"label_agreement":null},{"id":"W2952875997","doi":"10.48550/arxiv.math/0612497","title":"A Profinite Approach to Stable Pairs","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Profinite group; Mathematics; Sociology; Physics; Group (periodic table)","score_opus":0.04287205224487553,"score_gpt":0.24269637916613382,"score_spread":0.1998243269212583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952875997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009752678,0.002397692,0.9239601,0.0022854046,0.0005736773,0.000102225546,0.00033215084,0.00080427056,0.05979168],"genre_scores_gemma":[0.4962336,0.005485617,0.4582851,0.0027824037,0.002834081,0.0006062937,0.0007842264,0.0004825642,0.032506175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807775,0.0004745414,0.00016708756,0.00048677175,0.0006090287,0.00018486971],"domain_scores_gemma":[0.9961403,0.0022645507,0.00019249103,0.00048110896,0.00068114995,0.00024035417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031902592,0.0012245825,0.0006459151,0.0030486188,0.002255056,0.0034654469,0.0016413619,0.0013944462,0.012639068],"category_scores_gemma":[0.0045514535,0.0008308471,0.0018552647,0.0014417218,0.0043800967,0.010679264,0.0039656456,0.005998823,0.003190441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012500208,0.00002394353,0.000089967514,0.00009123496,0.00000569064,0.0001505842,0.00027746454,0.00041510456,0.0013537833,0.98594636,0.0013290119,0.010304287],"study_design_scores_gemma":[0.000008633517,0.00003750114,0.00009070522,0.000039011753,0.000012845942,0.0003950485,0.00007228459,0.0033737307,0.0025208192,0.96883786,0.024588507,0.000023159528],"about_ca_topic_score_codex":0.0004658137,"about_ca_topic_score_gemma":0.00042264987,"teacher_disagreement_score":0.012639068,"about_ca_system_score_codex":0.0012840781,"about_ca_system_score_gemma":0.0006234492,"threshold_uncertainty_score":0.042281926},"labels":[],"label_agreement":null},{"id":"W2952917448","doi":"10.48550/arxiv.math/0306416","title":"State Complexity and the Monoid of Transformations of a Finite Set","year":2003,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Monoid; State (computer science); Syntactic monoid; Root (linguistics); Set (abstract data type); Free monoid; Finite set; Mathematics; Finite-state machine; Computer science; Discrete mathematics; Algorithm; Linguistics","score_opus":0.06035698064283764,"score_gpt":0.2639145045130027,"score_spread":0.20355752387016504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952917448","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6714723,0.0017029871,0.29459614,0.002496688,0.00009595764,0.00010819905,0.000673999,0.0003881255,0.02846566],"genre_scores_gemma":[0.97545934,0.00048745566,0.020078672,0.00009283747,0.00012689161,0.00009794301,0.00033036136,0.000060868864,0.0032655909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99634546,0.0007687545,0.00029836458,0.0008034143,0.0012936287,0.0004903711],"domain_scores_gemma":[0.97497606,0.019168302,0.0017091699,0.0021719164,0.0011325374,0.00084200845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020584115,0.00051459006,0.000800002,0.0020465779,0.0015776617,0.0057230494,0.001084153,0.0012481041,0.0056363493],"category_scores_gemma":[0.012686152,0.00039658765,0.0012325981,0.0016782032,0.004544407,0.012122134,0.00253105,0.0026953265,0.0004776555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021989309,0.0000606659,0.0023047973,0.00014005249,0.000034300658,0.000114530114,0.0007702825,0.015323427,0.0037518614,0.96636283,0.00047451904,0.010442849],"study_design_scores_gemma":[0.000020499123,0.00008266261,0.0012063647,0.000021650048,0.00003417653,0.00012866833,0.00016230879,0.0577629,0.0044157123,0.93388426,0.0022387605,0.00004193438],"about_ca_topic_score_codex":0.0013778637,"about_ca_topic_score_gemma":0.0009704525,"teacher_disagreement_score":0.0057230494,"about_ca_system_score_codex":0.0028527146,"about_ca_system_score_gemma":0.0012394482,"threshold_uncertainty_score":0.020697951},"labels":[],"label_agreement":null},{"id":"W2952942893","doi":"10.48550/arxiv.0708.3224","title":"The Frobenius Problem in a Free Monoid","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Noncommutative geometry; Mathematics; Monoid; Free monoid; Integer (computer science); Commutative property; Combinatorics; Quadratic equation; Exponential function; Discrete mathematics; Measure (data warehouse); Pure mathematics; Computer science","score_opus":0.026644636919038706,"score_gpt":0.2528533788499173,"score_spread":0.22620874193087862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952942893","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78462553,0.0008878917,0.20272757,0.0018435585,0.000113499256,0.000062782055,0.000280192,0.00023392975,0.009225026],"genre_scores_gemma":[0.926804,0.0003936708,0.062988274,0.00015350008,0.0001736947,0.00006116319,0.00026809212,0.00007010041,0.009087418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877304,0.0002692069,0.00012037864,0.00043055855,0.00024006978,0.0001667161],"domain_scores_gemma":[0.9947726,0.0038611246,0.00028161533,0.0004887358,0.00032645182,0.0002693915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025098072,0.00055268983,0.0008802128,0.0010800615,0.0017137822,0.002267935,0.0011393755,0.0012944427,0.0031409482],"category_scores_gemma":[0.0077405865,0.00048321762,0.0009070828,0.0009896698,0.004630237,0.007896466,0.0016638143,0.0017264081,0.0004902969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030996226,0.000042624266,0.0014677267,0.00017204056,0.000027978027,0.00022923882,0.00076644664,0.019521581,0.0050139315,0.9500885,0.0010585611,0.021301411],"study_design_scores_gemma":[0.000026116646,0.000045093897,0.00034766484,0.000022986398,0.000014691216,0.00014449409,0.00014472219,0.038799826,0.0039234553,0.95418566,0.0023152493,0.00003018875],"about_ca_topic_score_codex":0.0018999268,"about_ca_topic_score_gemma":0.0016109217,"teacher_disagreement_score":0.0031409482,"about_ca_system_score_codex":0.0019266823,"about_ca_system_score_gemma":0.0012916992,"threshold_uncertainty_score":0.013979077},"labels":[],"label_agreement":null},{"id":"W2952968515","doi":"10.48550/arxiv.0901.1397","title":"Avoiding Squares and Overlaps Over the Natural Numbers","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Natural (archaeology); Natural number; Mathematics; Computer science; Econometrics; History; Combinatorics; Archaeology","score_opus":0.018036416459758967,"score_gpt":0.2514304650373672,"score_spread":0.23339404857760826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952968515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25690416,0.0005593081,0.6995164,0.0006163077,0.00018351033,0.00010807983,0.00010732172,0.0004598525,0.04154498],"genre_scores_gemma":[0.75161564,0.00035345645,0.22698858,0.00023325022,0.00015215998,0.00020982602,0.0001793601,0.0003104996,0.01995726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986829,0.00036471154,0.00010953144,0.00036245462,0.00027745604,0.00020283095],"domain_scores_gemma":[0.99861324,0.00071901374,0.00014320113,0.00028209446,0.00012727476,0.000115119125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010221462,0.00046638036,0.0004609725,0.0005715605,0.0016875361,0.0013985598,0.0006665022,0.0007216082,0.004063006],"category_scores_gemma":[0.003270252,0.00035576796,0.0010655371,0.00048987253,0.0032507866,0.0031925847,0.0022367162,0.0010401341,0.0009278706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091115566,0.000031497377,0.00059772976,0.00007723495,0.000012088874,0.00039238262,0.0010066954,0.0068386067,0.0062329853,0.9595598,0.0007608378,0.02439919],"study_design_scores_gemma":[0.000024900759,0.000093345574,0.00025526405,0.000028816161,0.000017757422,0.00047556395,0.0003020105,0.02457352,0.008497072,0.95034015,0.015357059,0.000034434528],"about_ca_topic_score_codex":0.00077634293,"about_ca_topic_score_gemma":0.00091103214,"teacher_disagreement_score":0.004063006,"about_ca_system_score_codex":0.00061898294,"about_ca_system_score_gemma":0.00066790654,"threshold_uncertainty_score":0.013592124},"labels":[],"label_agreement":null},{"id":"W2953066797","doi":"10.48550/arxiv.1808.02529","title":"Circular critical exponents for Thue-Morse factors","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morse code; Exponent; Word (group theory); Repetition (rhetorical device); Critical exponent; Factor (programming language); Mathematics; Statistical physics; Physics; Pure mathematics; Computer science; Geometry; Linguistics; Telecommunications; Philosophy","score_opus":0.10233616838167477,"score_gpt":0.21566655069228802,"score_spread":0.11333038231061325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953066797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84681064,0.0014891931,0.09891229,0.0009039332,0.0002732508,0.000080783495,0.00012440483,0.00029023277,0.051115315],"genre_scores_gemma":[0.9870761,0.0003064058,0.007944591,0.000078979996,0.00026764086,0.000057000554,0.00004649721,0.00007975902,0.004142975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994259,0.00011334626,0.0000417837,0.00013655072,0.00013966447,0.00014282961],"domain_scores_gemma":[0.9928833,0.0043147947,0.00093274296,0.0005110147,0.0006748554,0.0006832819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010531457,0.00070554845,0.0006125733,0.0021195726,0.0016948243,0.0020792424,0.000565168,0.0010571586,0.007635111],"category_scores_gemma":[0.01161883,0.00034943328,0.0006877974,0.0007493811,0.0034928306,0.003102986,0.0016552592,0.001713753,0.0009202597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022140144,0.00003644739,0.0035084859,0.00014875847,0.000021620286,0.0008725137,0.0014765855,0.0038328923,0.010251852,0.96848863,0.0011211089,0.010019669],"study_design_scores_gemma":[0.00004626238,0.000111973495,0.0019702704,0.00008312685,0.000032469907,0.0005803159,0.00048186883,0.025424423,0.00951014,0.95684093,0.0048654336,0.000052616782],"about_ca_topic_score_codex":0.0005395866,"about_ca_topic_score_gemma":0.0005138191,"teacher_disagreement_score":0.007635111,"about_ca_system_score_codex":0.0009030689,"about_ca_system_score_gemma":0.00037597673,"threshold_uncertainty_score":0.02554202},"labels":[],"label_agreement":null},{"id":"W2953147117","doi":"10.1002/rsa.20095","title":"The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function","year":2005,"lang":"en","type":"article","venue":"Scholarship - Claremont (Claremont Colleges)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","funders":"","keywords":"Probabilistic logic; Monotone polygon; Boolean function; Mathematics; Function (biology); Convergence (economics); Linear growth; Discrete mathematics; Applied mathematics; Pure mathematics; Statistics","score_opus":0.01287401157908717,"score_gpt":0.2288308892448166,"score_spread":0.21595687766572944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953147117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20581166,0.0006445877,0.7653673,0.0030835727,0.00013428449,0.00009603929,0.0002714575,0.00044954737,0.02414162],"genre_scores_gemma":[0.82106036,0.0007031703,0.16552907,0.00047365556,0.00013034327,0.00022303495,0.00028772064,0.00029829156,0.011294258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991153,0.0002619061,0.00006031486,0.00021239012,0.00021482671,0.00013523636],"domain_scores_gemma":[0.98932004,0.0076840245,0.0006284162,0.0010433716,0.0009625479,0.00036157612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024045452,0.00060053123,0.00047623733,0.0011173025,0.0007903772,0.0029051006,0.0010075484,0.0011934408,0.006351124],"category_scores_gemma":[0.018152142,0.00031906425,0.0008983206,0.000727758,0.0026560428,0.0073402305,0.0012586879,0.0017836298,0.00091333396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009383345,0.000026811938,0.0010056328,0.000105293926,0.000017111694,0.00009864525,0.00030907555,0.017702537,0.0056888526,0.944517,0.0014275162,0.029007686],"study_design_scores_gemma":[0.000015261248,0.0000256967,0.00031885822,0.000038566817,0.000023315743,0.00010653739,0.00011060832,0.17435475,0.011182137,0.81081784,0.002981617,0.00002478464],"about_ca_topic_score_codex":0.0008860138,"about_ca_topic_score_gemma":0.0008453368,"teacher_disagreement_score":0.006351124,"about_ca_system_score_codex":0.0011487264,"about_ca_system_score_gemma":0.00081415597,"threshold_uncertainty_score":0.021246612},"labels":[],"label_agreement":null},{"id":"W2953277693","doi":"10.48550/arxiv.1312.4428","title":"On Constraint Satisfaction Problems below P","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Datalog; Constraint satisfaction problem; Treewidth; Bounded function; Mathematics; Duality (order theory); Discrete mathematics; Constraint satisfaction; Nondeterministic algorithm; Combinatorics; Conjecture; Simple (philosophy); Computer science; Pathwidth; Theoretical computer science; Graph","score_opus":0.046308067381303705,"score_gpt":0.17042913700929968,"score_spread":0.12412106962799598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953277693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09427332,0.009050132,0.70844996,0.046946738,0.00077569607,0.00041681927,0.0029398322,0.001094522,0.13605298],"genre_scores_gemma":[0.7538627,0.008025399,0.18451528,0.008683176,0.0025546865,0.0008006139,0.0047569964,0.00040359955,0.036397442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962179,0.0012606152,0.0002792313,0.0011114771,0.00067427167,0.00045644437],"domain_scores_gemma":[0.98381674,0.013721793,0.0006171107,0.00075696665,0.0007002767,0.00038707192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028465632,0.0009997468,0.001170263,0.001193879,0.0025854844,0.004591298,0.0015913441,0.0026829473,0.011701124],"category_scores_gemma":[0.0144267185,0.0007332817,0.0017765345,0.003199924,0.0036560073,0.011758522,0.0040750443,0.007099003,0.0014420829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009904653,0.00011472615,0.001115917,0.0003330356,0.000059290487,0.00036514876,0.00054238946,0.007442569,0.0010427625,0.944951,0.012485635,0.031448536],"study_design_scores_gemma":[0.000027248998,0.000016290576,0.00021193459,0.00003212622,0.000011571827,0.00018344822,0.00012065436,0.015696699,0.00037761615,0.9762265,0.0070850416,0.000010904824],"about_ca_topic_score_codex":0.0035382593,"about_ca_topic_score_gemma":0.0026675288,"teacher_disagreement_score":0.011701124,"about_ca_system_score_codex":0.002711048,"about_ca_system_score_gemma":0.0017954482,"threshold_uncertainty_score":0.039144218},"labels":[],"label_agreement":null},{"id":"W2953288157","doi":"10.48550/arxiv.1010.5391","title":"Multi-dimensional sets recognizable in all abstract numeration systems","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Computer science","score_opus":0.09328003376098516,"score_gpt":0.2102244378903298,"score_spread":0.11694440412934463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953288157","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75005984,0.0007302069,0.21160479,0.0006614527,0.00019539839,0.000077505094,0.0006762622,0.0013348587,0.03465968],"genre_scores_gemma":[0.96794486,0.00013954655,0.026129799,0.00014892682,0.00006677815,0.00010155646,0.00052291976,0.00007515333,0.0048705726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974445,0.0003479942,0.00022966032,0.0010486786,0.0006191392,0.00031006994],"domain_scores_gemma":[0.99548066,0.0018882083,0.00074950355,0.0010479043,0.0005269598,0.00030671962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008338554,0.000515123,0.0007371033,0.0012130752,0.0014115315,0.0039689317,0.00086219946,0.0011951523,0.0037763426],"category_scores_gemma":[0.0041703493,0.0006875035,0.0009744384,0.0007658157,0.0031331345,0.0039280364,0.002710495,0.0019001025,0.0005771594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030962177,0.00012822975,0.0050196294,0.00027943813,0.00006180517,0.00071859924,0.003359357,0.009943446,0.038664334,0.9017214,0.0011582611,0.03863582],"study_design_scores_gemma":[0.00005123922,0.00013342219,0.0033810341,0.00007368273,0.000044614946,0.0009384321,0.0005852386,0.01829578,0.019496016,0.9462712,0.010658074,0.00007123793],"about_ca_topic_score_codex":0.0004916316,"about_ca_topic_score_gemma":0.00035942093,"teacher_disagreement_score":0.0039689317,"about_ca_system_score_codex":0.0010208017,"about_ca_system_score_gemma":0.0005136044,"threshold_uncertainty_score":0.012633145},"labels":[],"label_agreement":null},{"id":"W2953320161","doi":"10.48550/arxiv.0708.4217","title":"A note on the Markoff condition and central words","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Economics","score_opus":0.026028751113604667,"score_gpt":0.2649261114454045,"score_spread":0.23889736033179984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953320161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25706702,0.006925033,0.57621837,0.006525235,0.002603286,0.000098343306,0.00033155942,0.0007500957,0.14948112],"genre_scores_gemma":[0.90672576,0.0017118971,0.07295681,0.0014413365,0.0019029196,0.00010441395,0.00016397492,0.00026215814,0.014730647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985434,0.00036824652,0.00011556733,0.0004114996,0.00035150294,0.00020985157],"domain_scores_gemma":[0.9957065,0.0025718315,0.00029713855,0.0004735779,0.000607924,0.0003429944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001973114,0.00064315606,0.00077705045,0.0014008618,0.0022792558,0.0028901128,0.0009951347,0.0019014701,0.0054881633],"category_scores_gemma":[0.005624779,0.00050275517,0.0008819002,0.0012423646,0.007356436,0.008585307,0.0031184012,0.0036936882,0.0010001728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002770188,0.000007633625,0.00017063356,0.000031247815,0.000002688511,0.000081885475,0.00031363041,0.00021880007,0.001327573,0.994572,0.0005164228,0.0027298022],"study_design_scores_gemma":[0.000007857619,0.00003971006,0.00022716259,0.000022753713,0.000008804707,0.00018050164,0.00015949644,0.0018998155,0.0023538698,0.985159,0.009912994,0.000028062781],"about_ca_topic_score_codex":0.0010354952,"about_ca_topic_score_gemma":0.00078284775,"teacher_disagreement_score":0.0054881633,"about_ca_system_score_codex":0.001067199,"about_ca_system_score_gemma":0.00072031585,"threshold_uncertainty_score":0.01835972},"labels":[],"label_agreement":null},{"id":"W2954251248","doi":"10.1007/978-3-030-23220-7_5","title":"Finite Limits and Anti-unification in Substitution Categories","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Unification; Morphism; Mathematical proof; Substitution (logic); Computer science; Arrow; Algebra over a field; Mathematics; Pure mathematics; Programming language; Geometry","score_opus":0.017021689750149425,"score_gpt":0.2296796129914109,"score_spread":0.21265792324126148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954251248","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15540753,0.021046354,0.40868294,0.004446785,0.0014891335,0.00006099912,0.00022971175,0.00067998475,0.4079566],"genre_scores_gemma":[0.8780714,0.0054062777,0.04284573,0.000696165,0.00057580107,0.00009875876,0.00024034601,0.00021970496,0.07184585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984647,0.0005182805,0.00011456254,0.00028289625,0.00047638756,0.00014325386],"domain_scores_gemma":[0.99842083,0.00088829955,0.00008152999,0.000264688,0.00023881962,0.000105792285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020520077,0.000390481,0.00050002575,0.0012743002,0.0015448357,0.00321173,0.00090430287,0.001149727,0.004835494],"category_scores_gemma":[0.0036042624,0.00045097238,0.00070665806,0.0012591537,0.005881233,0.008369832,0.0032227996,0.003044604,0.0011292229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024113124,0.0000019058942,0.000037209044,0.000016369255,0.0000013155994,0.000024172148,0.00025137755,0.000092017064,0.00018019881,0.9960897,0.00023305565,0.0030702527],"study_design_scores_gemma":[0.0000021012904,0.0000050207655,0.000058555594,0.00002395673,0.0000029485766,0.00007912664,0.00011357232,0.00063364406,0.0004404662,0.9850873,0.013548643,0.0000046734276],"about_ca_topic_score_codex":0.001144572,"about_ca_topic_score_gemma":0.00073224265,"teacher_disagreement_score":0.004835494,"about_ca_system_score_codex":0.0015879447,"about_ca_system_score_gemma":0.000844704,"threshold_uncertainty_score":0.016176343},"labels":[],"label_agreement":null},{"id":"W2954853821","doi":"10.1007/978-3-030-23247-4_16","title":"Nondeterminism Growth and State Complexity","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; String (physics); Combinatorics; Nondeterministic algorithm; Path (computing); Discrete mathematics; Tree (set theory); Bounding overwatch; Deterministic finite automaton; Nondeterministic finite automaton; Finite-state machine; State (computer science); Degree (music); Automaton; Algorithm; Computer science; Physics; Automata theory; Theoretical computer science","score_opus":0.01937335753452985,"score_gpt":0.2362460321222283,"score_spread":0.21687267458769846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954853821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33789018,0.005115384,0.40216568,0.010019176,0.000396785,0.00016904698,0.0012460839,0.0008932033,0.24210453],"genre_scores_gemma":[0.937866,0.0019527248,0.028715797,0.00019671816,0.0003519097,0.0002098284,0.00043036276,0.0002550293,0.030021569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981883,0.00035174505,0.00011121255,0.00040651707,0.0007159324,0.00022618874],"domain_scores_gemma":[0.9748574,0.020081758,0.00084815687,0.0025882856,0.0011674708,0.0004569288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015794443,0.0004783529,0.0010748339,0.0012589745,0.0012215228,0.004185389,0.0013347066,0.0011722127,0.008775417],"category_scores_gemma":[0.01740022,0.0007489498,0.0009276429,0.0015866146,0.0037587227,0.014451825,0.0022750695,0.004993409,0.00086207775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000320824,0.000020762289,0.0003721047,0.000057647572,0.0000055209057,0.00004177241,0.00020542617,0.0068009123,0.00081024395,0.9782347,0.0011408457,0.012277998],"study_design_scores_gemma":[0.000004111252,0.000005285032,0.00017002106,0.0000072958765,0.0000042065126,0.000043145606,0.00003111469,0.021494474,0.0006759953,0.975636,0.0019222954,0.000006132341],"about_ca_topic_score_codex":0.0008279986,"about_ca_topic_score_gemma":0.0006744315,"teacher_disagreement_score":0.008775417,"about_ca_system_score_codex":0.0023989493,"about_ca_system_score_gemma":0.0009696711,"threshold_uncertainty_score":0.029356658},"labels":[],"label_agreement":null},{"id":"W2955954078","doi":"10.46298/dmtcs.6380","title":"On intervals of the consecutive pattern poset","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Bucknell University; Simons Foundation","keywords":"Partially ordered set; Combinatorics; Mathematics; Subsequence; Rank (graph theory); Order (exchange); Generating function; Hasse diagram; Set (abstract data type); Function (biology); Discrete mathematics; Computer science; Biology","score_opus":0.015109162470780112,"score_gpt":0.2509598280722007,"score_spread":0.23585066560142057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955954078","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54236346,0.001571236,0.35701397,0.00071542925,0.00020379234,0.00014122369,0.0012271787,0.00060677814,0.096156865],"genre_scores_gemma":[0.9371169,0.00072259514,0.044809166,0.00017601649,0.0004291407,0.00023010667,0.0011934071,0.00017260989,0.015150102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986338,0.00032807078,0.00010196087,0.00034282362,0.00035117325,0.00024217472],"domain_scores_gemma":[0.9964066,0.002043925,0.0005085301,0.00028353703,0.00037758183,0.0003797685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093343295,0.00073155394,0.00065222697,0.0027702474,0.0016859021,0.003237806,0.0007741639,0.00075184315,0.010105735],"category_scores_gemma":[0.0038770959,0.00043667146,0.0010667564,0.0024186692,0.0036839184,0.005475825,0.001994578,0.0015747276,0.0010576039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006433015,0.000023581637,0.0006815284,0.00004601048,0.00000696903,0.00020629591,0.0006523122,0.0025972936,0.0017815096,0.98630875,0.00048774877,0.0071436],"study_design_scores_gemma":[0.000017851611,0.0000633942,0.0006969577,0.000028988574,0.000010684243,0.00031762916,0.00026009325,0.0110806925,0.0014035343,0.9821854,0.003910615,0.000024095758],"about_ca_topic_score_codex":0.00088411174,"about_ca_topic_score_gemma":0.00061579456,"teacher_disagreement_score":0.010105735,"about_ca_system_score_codex":0.0009726745,"about_ca_system_score_gemma":0.00046658804,"threshold_uncertainty_score":0.03380704},"labels":[],"label_agreement":null},{"id":"W2962693339","doi":"10.4171/lem/56-1-2","title":"A Wreath Product Approach to Classical Subgroup Theorems","year":2010,"lang":"fr","type":"article","venue":"L’Enseignement Mathématique","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Wreath product; Mathematics; Product (mathematics); Combinatorics; Geometry","score_opus":0.015635897593886727,"score_gpt":0.2381202000603462,"score_spread":0.22248430246645948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962693339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07844014,0.0017748722,0.80130035,0.0018077877,0.00058625854,0.00009210849,0.00027736268,0.00097184227,0.11474929],"genre_scores_gemma":[0.8237723,0.0023363526,0.13585927,0.00078954577,0.0010077453,0.00019328292,0.00031968573,0.00041100342,0.035310734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935895,0.00012250766,0.000037511996,0.00014750448,0.00023944008,0.00009400963],"domain_scores_gemma":[0.9991393,0.00036446226,0.00007248691,0.00018164475,0.00017365473,0.00006835197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014760231,0.0009005904,0.0005287608,0.0015103064,0.000919329,0.0016824453,0.0012208342,0.0005579152,0.012659776],"category_scores_gemma":[0.0020238322,0.0003521051,0.0009862422,0.0007893641,0.002928004,0.007516227,0.0031514317,0.0020759276,0.0017556846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000099855015,0.000014815742,0.00009948531,0.000052442378,0.0000068700397,0.00009009529,0.00021585567,0.00035860733,0.0013954812,0.99012834,0.0006384154,0.0069896234],"study_design_scores_gemma":[0.000013497025,0.000045146357,0.00019493102,0.000016374677,0.00001478305,0.00017116655,0.00007458989,0.0030836053,0.0030287008,0.97889984,0.014442172,0.000015166128],"about_ca_topic_score_codex":0.0005036869,"about_ca_topic_score_gemma":0.0003656585,"teacher_disagreement_score":0.012659776,"about_ca_system_score_codex":0.0007014016,"about_ca_system_score_gemma":0.00034809715,"threshold_uncertainty_score":0.042351186},"labels":[],"label_agreement":null},{"id":"W2962772080","doi":"","title":"Most Complex Regular Ideal Languages","year":2017,"lang":"en","type":"article","venue":"UWSpace (University of Waterloo)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quotient; Concatenation (mathematics); Ideal (ethics); Mathematics; Combinatorics; Sigma; Alphabet; Discrete mathematics; Class (philosophy); Pure mathematics; Computer science; Physics; Linguistics","score_opus":0.014989971566290986,"score_gpt":0.2154152196680669,"score_spread":0.20042524810177592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962772080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74996424,0.00034205566,0.20372462,0.0011846786,0.00006457374,0.00014381626,0.0012016237,0.0010304521,0.04234395],"genre_scores_gemma":[0.95877606,0.00012572175,0.033199817,0.00013295628,0.00009351645,0.0001290324,0.000642607,0.000120727986,0.0067796065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789584,0.00031581952,0.00018449507,0.00063942384,0.00068779977,0.00027654183],"domain_scores_gemma":[0.99343514,0.002920131,0.000892741,0.0011369543,0.0009849658,0.0006301122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011710664,0.00036827335,0.0005201711,0.0009925478,0.0014916422,0.0031936686,0.00069718517,0.00054163847,0.0058140582],"category_scores_gemma":[0.0050028116,0.0004761874,0.00088976545,0.0006082347,0.0032067178,0.005528547,0.0024659364,0.0012658909,0.00071377563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025635195,0.000061687686,0.003993043,0.00011281472,0.000032441596,0.00024637193,0.002149299,0.002912234,0.014396476,0.9604386,0.0016033243,0.01379736],"study_design_scores_gemma":[0.000048070517,0.0001228314,0.0036987,0.00003726431,0.000048215927,0.0008665291,0.0009688366,0.025247397,0.018162614,0.93004525,0.020677809,0.0000764235],"about_ca_topic_score_codex":0.00054607034,"about_ca_topic_score_gemma":0.0006321293,"teacher_disagreement_score":0.0058140582,"about_ca_system_score_codex":0.0013611646,"about_ca_system_score_gemma":0.0007539489,"threshold_uncertainty_score":0.01944995},"labels":[],"label_agreement":null},{"id":"W2962795882","doi":"10.25596/jalc-2017-029","title":"Unrestricted State Complexity of Binary Operations on Regular and Ideal Languages","year":2017,"lang":"en","type":"article","venue":"UWSpace (University of Waterloo)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ideal (ethics); State (computer science); Mathematics; Computer science; Binary number; Arithmetic; Programming language; Epistemology; Philosophy","score_opus":0.02019124733844362,"score_gpt":0.22524602191600346,"score_spread":0.20505477457755983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962795882","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84986,0.00046125884,0.13297507,0.0010711384,0.000061161816,0.00014904384,0.0012242564,0.0007368196,0.013461114],"genre_scores_gemma":[0.97322005,0.00021665919,0.02144422,0.000105904386,0.000080520644,0.00017391896,0.0011812928,0.00018335058,0.0033940473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935569,0.00091386953,0.00059440656,0.001306377,0.001809762,0.0018185526],"domain_scores_gemma":[0.9713586,0.020067781,0.002447377,0.003086519,0.0017977906,0.0012419752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002092452,0.0007128311,0.0012055207,0.0013424436,0.0017313005,0.0051204558,0.0021738054,0.0009943396,0.007096492],"category_scores_gemma":[0.016813276,0.0007434297,0.0021752238,0.0015820008,0.0032691597,0.014558116,0.0036888393,0.0036147884,0.000644533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024187148,0.0009123218,0.013642877,0.00066487584,0.00019547202,0.00061919895,0.0026414027,0.22772712,0.031343065,0.65472627,0.0038644192,0.061244372],"study_design_scores_gemma":[0.00008979096,0.00022311202,0.0019966806,0.000044647815,0.00011535107,0.00024794042,0.00047035952,0.45170304,0.020802766,0.5221592,0.0020244734,0.0001226816],"about_ca_topic_score_codex":0.0028620944,"about_ca_topic_score_gemma":0.003467031,"teacher_disagreement_score":0.007096492,"about_ca_system_score_codex":0.0038539683,"about_ca_system_score_gemma":0.0036381744,"threshold_uncertainty_score":0.027962565},"labels":[],"label_agreement":null},{"id":"W2962852487","doi":"10.1515/integ.2009.027","title":"Christoffel Words and Markoff Triples","year":2009,"lang":"en","type":"article","venue":"Integers","topic":"semigroups and automata theory","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Christoffel symbols; Mathematics; Algebra over a field; Arithmetic; Pure mathematics","score_opus":0.005713033424047182,"score_gpt":0.21434177469517077,"score_spread":0.20862874127112357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962852487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34398827,0.003087398,0.4085988,0.0023282187,0.0015793326,0.0002106326,0.0006146527,0.0010878617,0.23850475],"genre_scores_gemma":[0.9166656,0.00091940264,0.05980945,0.0005546934,0.00038843328,0.00014132034,0.00028845327,0.00015818074,0.0210743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890804,0.00027676614,0.000080598315,0.00021002133,0.00033129274,0.00019329147],"domain_scores_gemma":[0.9990515,0.00036909227,0.00012951279,0.000102329635,0.00021127256,0.00013630796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079903594,0.00043060532,0.00034296652,0.0020899624,0.0019958073,0.002295806,0.0006121499,0.0009309603,0.008276266],"category_scores_gemma":[0.002292989,0.0002817215,0.00047190592,0.0012904555,0.0023466628,0.004421969,0.0020950623,0.0012245715,0.0013419228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024233841,0.000011820953,0.00011205732,0.000028600885,0.0000030017277,0.00008434429,0.00029381525,0.00024329907,0.0009802196,0.9908029,0.00089860574,0.0065171],"study_design_scores_gemma":[0.000011002647,0.000027076616,0.00018674137,0.000033354616,0.00000964828,0.00029601168,0.00036286793,0.002052051,0.0029081914,0.96545917,0.028626667,0.000027207749],"about_ca_topic_score_codex":0.00062134454,"about_ca_topic_score_gemma":0.00057124323,"teacher_disagreement_score":0.008276266,"about_ca_system_score_codex":0.00084443955,"about_ca_system_score_gemma":0.0004823354,"threshold_uncertainty_score":0.027686834},"labels":[],"label_agreement":null},{"id":"W2962895102","doi":"10.23638/lmcs-15(1:11)2019","title":"The Subpower Membership Problem for Finite Algebras with Cube Terms","year":2019,"lang":"en","type":"article","venue":"CU Scholar (University of Colorado Boulder)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cube (algebra); Algebra over a field; Mathematics; Pure mathematics; Computer science; Combinatorics","score_opus":0.007760281499568587,"score_gpt":0.18962416952716468,"score_spread":0.1818638880275961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962895102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31668544,0.0011145428,0.65119773,0.007525306,0.00014208401,0.0004526989,0.0021005997,0.0014880083,0.01929352],"genre_scores_gemma":[0.76832956,0.0009438688,0.21485251,0.0008994931,0.00044259444,0.0003125868,0.0043033683,0.00026290712,0.009653158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972433,0.0008035116,0.0002008413,0.0007311672,0.0007349105,0.00028633783],"domain_scores_gemma":[0.9893071,0.008314454,0.0005164216,0.00092120765,0.0004742545,0.00046655204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023028795,0.0005769649,0.001141656,0.0007793739,0.0016328667,0.0033051325,0.0021072447,0.0014851736,0.0062209],"category_scores_gemma":[0.012696201,0.00058178185,0.002075643,0.0015494522,0.0029317094,0.013012612,0.003130449,0.0041902787,0.00087244896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066567597,0.00048479767,0.0057594567,0.00075491564,0.00012333077,0.0006331458,0.002142666,0.05107076,0.0077754743,0.7910276,0.014405276,0.12515691],"study_design_scores_gemma":[0.000053134427,0.00006272372,0.0004949666,0.00003657459,0.000036848516,0.0002708436,0.0004391947,0.08255281,0.0043578832,0.90693235,0.0047343257,0.000028347553],"about_ca_topic_score_codex":0.0034306308,"about_ca_topic_score_gemma":0.0028073045,"teacher_disagreement_score":0.0062209,"about_ca_system_score_codex":0.0019988108,"about_ca_system_score_gemma":0.002239309,"threshold_uncertainty_score":0.020811021},"labels":[],"label_agreement":null},{"id":"W2962904359","doi":"10.1007/s00224-017-9803-8","title":"Syntactic Complexity of Regular Ideals","year":2017,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"European Social Fund; Uniwersytet Wrocławski; University of Waterloo; Natural Sciences and Engineering Research Council of Canada; European Commission; Narodowe Centrum Nauki; University of Toronto; Narodowym Centrum Nauki","keywords":"Regular language; Cardinality (data modeling); Suffix; Mathematics; Prefix; Discrete mathematics; Nondeterministic finite automaton; Descriptive complexity theory; Combinatorics; Computer science; Time complexity; Automaton; Automata theory; Linguistics; Theoretical computer science","score_opus":0.05201520097610158,"score_gpt":0.2847825039784081,"score_spread":0.23276730300230652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962904359","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82631797,0.0002793368,0.13655572,0.0013602731,0.00005765806,0.000121818724,0.0007678297,0.00056450773,0.033974946],"genre_scores_gemma":[0.97766894,0.00011070264,0.017918078,0.00009460134,0.0000773154,0.00010631132,0.0005011044,0.000081162194,0.0034417405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726486,0.000391741,0.00027124808,0.0005787293,0.00094125804,0.00055209384],"domain_scores_gemma":[0.9877735,0.007551041,0.0012898057,0.0014304842,0.0013107521,0.00064445013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015124638,0.00031097495,0.0007296733,0.0011099719,0.0018346921,0.003266437,0.0010847372,0.00057987554,0.0056990264],"category_scores_gemma":[0.00766384,0.0005835329,0.001610799,0.00054161885,0.0032186941,0.0057241344,0.0025410203,0.0018416694,0.0005141885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004622758,0.00013944865,0.007289138,0.00025104516,0.000050351537,0.00040454336,0.0019534857,0.03203704,0.024225835,0.91427207,0.0019825387,0.016932242],"study_design_scores_gemma":[0.000027530175,0.00007749991,0.002520562,0.000025092675,0.00004734557,0.00031948436,0.0003488684,0.07103628,0.014685737,0.9072887,0.003566654,0.000056220237],"about_ca_topic_score_codex":0.0012363943,"about_ca_topic_score_gemma":0.0011985343,"teacher_disagreement_score":0.0056990264,"about_ca_system_score_codex":0.001941206,"about_ca_system_score_gemma":0.0016442187,"threshold_uncertainty_score":0.019065201},"labels":[],"label_agreement":null},{"id":"W2962907371","doi":"10.48550/arxiv.1907.08247","title":"The abelian complexity of infinite words and the Frobenius problem","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Abelian group; Mathematics; Algebra over a field; Pure mathematics","score_opus":0.056827129785857494,"score_gpt":0.17794420859524235,"score_spread":0.12111707880938485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962907371","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84905344,0.00117651,0.11499239,0.0032736731,0.000094042414,0.000035738653,0.00016575625,0.000103177095,0.031105336],"genre_scores_gemma":[0.983012,0.00039110144,0.010610592,0.00015060067,0.0003173476,0.000048414222,0.00012561791,0.000039845687,0.0053044055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987692,0.00042595106,0.000060815153,0.00023184634,0.00028914426,0.00022288918],"domain_scores_gemma":[0.988379,0.009741896,0.00065658666,0.0003576605,0.00040677865,0.0004580493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015504468,0.00041555043,0.0007239142,0.0013788377,0.0013632689,0.0022050028,0.0007766644,0.0011377557,0.002959619],"category_scores_gemma":[0.008663085,0.00036483692,0.0006382412,0.00081220677,0.0050891093,0.007707454,0.0017650309,0.0017351619,0.0003478223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088323926,0.00003709397,0.001112919,0.000067579975,0.000016818169,0.00014411948,0.00049393106,0.0076903757,0.0015808591,0.98280495,0.0007228949,0.005240034],"study_design_scores_gemma":[0.000018342138,0.000022004919,0.0004849886,0.0000105036515,0.000006213168,0.00009023521,0.00015701113,0.015055843,0.00083944923,0.98211044,0.0011884243,0.000016547196],"about_ca_topic_score_codex":0.0010077135,"about_ca_topic_score_gemma":0.0006232017,"teacher_disagreement_score":0.002959619,"about_ca_system_score_codex":0.0015738439,"about_ca_system_score_gemma":0.0007932766,"threshold_uncertainty_score":0.011419117},"labels":[],"label_agreement":null},{"id":"W2962987831","doi":"10.1016/j.tcs.2011.05.057","title":"The growth function of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>S</mml:mi></mml:math>-recognizable sets","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scroll; Function (biology); Mathematics; Computer science; Algorithm; Computer graphics (images); Theology; Philosophy; Biology","score_opus":0.014901754697260744,"score_gpt":0.22520454045590907,"score_spread":0.21030278575864833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962987831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5407336,0.0019259037,0.3135529,0.006696017,0.00044038068,0.0001717995,0.005360069,0.0029972843,0.1281221],"genre_scores_gemma":[0.91733545,0.0011760629,0.028160471,0.00031889183,0.00029226427,0.00030034207,0.0025198206,0.0008721665,0.049024418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871266,0.00026376988,0.000051998148,0.00030013407,0.0003741957,0.0002972202],"domain_scores_gemma":[0.97401506,0.018869504,0.0010826341,0.0010356392,0.0033241394,0.0016730181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019595453,0.00086116075,0.00073209376,0.0035121108,0.0011416385,0.004094612,0.00141369,0.0014501238,0.02057665],"category_scores_gemma":[0.02353553,0.00039552973,0.00080472406,0.0013846825,0.0026524023,0.005083904,0.0013649826,0.00197795,0.005281081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028799052,0.0000572693,0.004002753,0.0002928174,0.000026279025,0.00021837738,0.0007931255,0.013494865,0.005823605,0.9214525,0.013258074,0.04029233],"study_design_scores_gemma":[0.000049508,0.0001057748,0.005349116,0.0002136549,0.00004960488,0.0009555315,0.0005216548,0.12711361,0.014914102,0.82876,0.021865804,0.00010155931],"about_ca_topic_score_codex":0.0017823117,"about_ca_topic_score_gemma":0.00092292164,"teacher_disagreement_score":0.02057665,"about_ca_system_score_codex":0.0030933614,"about_ca_system_score_gemma":0.0012989808,"threshold_uncertainty_score":0.068835795},"labels":[],"label_agreement":null},{"id":"W2962994149","doi":"","title":"Connecting Weighted Automata and Recurrent Neural Networks through Spectral Learning","year":2018,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal","funders":"","keywords":"Recurrent neural network; Computer science; Connection (principal bundle); Automaton; Algorithm; Extension (predicate logic); Rank (graph theory); Artificial neural network; Artificial intelligence; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.08167116604847909,"score_gpt":0.3369207155138802,"score_spread":0.2552495494654011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962994149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015910858,0.00014229515,0.98207134,0.00010317461,0.00003582074,0.000018799365,0.000026897023,0.000246956,0.0014437328],"genre_scores_gemma":[0.71622795,0.00039508523,0.27930322,0.00017900085,0.00009583894,0.00019447082,0.00013976118,0.00015856752,0.0033061174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989435,0.00046302826,0.000059593793,0.00025467976,0.00020959719,0.00006972538],"domain_scores_gemma":[0.99581784,0.0029659295,0.00035046967,0.00037944707,0.000381697,0.00010473548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016001894,0.0006717799,0.00067565835,0.0007753371,0.0005233804,0.0012596516,0.0013462515,0.0010973462,0.0027058122],"category_scores_gemma":[0.009936062,0.00050238054,0.0006014354,0.00059223425,0.0019937113,0.0037220959,0.0019579607,0.0014583867,0.0004836918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007933295,0.00004690435,0.00082234055,0.00015805781,0.000054947985,0.00017329464,0.0003348507,0.50936884,0.0041974336,0.4283153,0.0006939429,0.055754762],"study_design_scores_gemma":[0.000004007353,0.000026181515,0.000048334565,0.000009490548,0.0000050965295,0.000026278443,0.000017928018,0.83857113,0.0007293883,0.1599055,0.0006481516,0.000008454039],"about_ca_topic_score_codex":0.001288053,"about_ca_topic_score_gemma":0.0013958426,"teacher_disagreement_score":0.0027058122,"about_ca_system_score_codex":0.00066811434,"about_ca_system_score_gemma":0.00059327175,"threshold_uncertainty_score":0.009051859},"labels":[],"label_agreement":null},{"id":"W2963042803","doi":"10.1051/ita/2010007","title":"Infinite words containing squares at every position","year":2010,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Infimum and supremum; Alphabet; Word (group theory); Position (finance); Mathematics; Combinatorics; Binary number; Arithmetic; Existential quantification; Discrete mathematics; Linguistics; Philosophy","score_opus":0.00508258092233842,"score_gpt":0.23085131560883587,"score_spread":0.22576873468649744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963042803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69119096,0.0025719076,0.21752538,0.007065486,0.00076521246,0.000044074677,0.00032704734,0.0009648104,0.07954515],"genre_scores_gemma":[0.9333757,0.0004268871,0.049283687,0.0008302378,0.00026914882,0.000070720926,0.00018150937,0.00019024851,0.015371739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991321,0.0002448834,0.00009658379,0.000285629,0.00013531269,0.000105554725],"domain_scores_gemma":[0.99461293,0.0036027555,0.0005017941,0.00044629193,0.00055061234,0.0002856095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008333037,0.0004962623,0.0007200221,0.00063553854,0.001343339,0.0020856299,0.0005185728,0.0012784646,0.0041301535],"category_scores_gemma":[0.005645853,0.0006355867,0.0005175938,0.0005786595,0.0037321865,0.005960814,0.0013550306,0.0017479147,0.0016201757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057581207,0.000055585857,0.0015850839,0.00034662432,0.000029260835,0.0009983965,0.0024404062,0.0026835958,0.039805345,0.91928077,0.0032057234,0.028993381],"study_design_scores_gemma":[0.000048988175,0.00010350868,0.000397385,0.00007253993,0.000025856423,0.0006505802,0.00069804693,0.0055473386,0.016433267,0.9570242,0.018951518,0.000046819576],"about_ca_topic_score_codex":0.00017945918,"about_ca_topic_score_gemma":0.00024235643,"teacher_disagreement_score":0.0041301535,"about_ca_system_score_codex":0.00058968243,"about_ca_system_score_gemma":0.00029519398,"threshold_uncertainty_score":0.013816774},"labels":[],"label_agreement":null},{"id":"W2963118546","doi":"","title":"On the number of unbordered factors","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Sequence (biology); Morse code; Computer science; Combinatorics; Discrete mathematics; Mathematics; Telecommunications","score_opus":0.01886922901219202,"score_gpt":0.2231976949213709,"score_spread":0.20432846590917889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963118546","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038562972,0.03579788,0.17783241,0.004519713,0.003639036,0.00006406924,0.0005345276,0.0004286898,0.73862064],"genre_scores_gemma":[0.57525605,0.025669351,0.110901095,0.0017465254,0.0049211644,0.00031494728,0.0009847647,0.0007308427,0.27947527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915636,0.00016992571,0.000057045963,0.00024271288,0.00028131806,0.00009267],"domain_scores_gemma":[0.99847466,0.0009902617,0.0000677757,0.00017676075,0.00020883913,0.00008167393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010234256,0.0008858044,0.0011410526,0.0016741428,0.0014149029,0.003623174,0.0013074502,0.0011515432,0.015294953],"category_scores_gemma":[0.003040956,0.0007255663,0.00072081503,0.0016645914,0.004479736,0.009131659,0.0016750372,0.00391954,0.0035145367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019539037,0.000007226921,0.000065727574,0.00006802483,0.000003368146,0.000028231281,0.000116566865,0.00023948212,0.00043357123,0.9760478,0.003901613,0.019068839],"study_design_scores_gemma":[0.000004153102,0.0000073862147,0.000060664097,0.00004158296,0.0000049065875,0.00010351148,0.000028004086,0.0005351421,0.00027830063,0.9743973,0.024532871,0.000006107273],"about_ca_topic_score_codex":0.00045316972,"about_ca_topic_score_gemma":0.000597564,"teacher_disagreement_score":0.015294953,"about_ca_system_score_codex":0.0015511675,"about_ca_system_score_gemma":0.00057851174,"threshold_uncertainty_score":0.051166654},"labels":[],"label_agreement":null},{"id":"W2963210887","doi":"10.1142/s0218196710005662","title":"APERIODIC POINTLIKES AND BEYOND","year":2010,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Aperiodic graph; Decidability; Mathematics; Set (abstract data type); Discrete mathematics; Combinatorics; Pure mathematics; Computer science","score_opus":0.004474427832064978,"score_gpt":0.2400935153321515,"score_spread":0.23561908750008653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963210887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4479399,0.0022454388,0.45271584,0.00254329,0.00028609595,0.00015424642,0.00053313177,0.0012038338,0.09237822],"genre_scores_gemma":[0.971126,0.00032462896,0.022822848,0.0002872279,0.000104930565,0.000053992768,0.00014631476,0.00006552093,0.005068486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858236,0.00026554146,0.00008699793,0.00049615523,0.00037034767,0.00019855464],"domain_scores_gemma":[0.9949321,0.0033959271,0.0003653292,0.0006543671,0.00042350366,0.00022873344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015726343,0.00034251637,0.0004995377,0.0008452994,0.0013787065,0.0027416812,0.0010466625,0.0008478804,0.0035405012],"category_scores_gemma":[0.005163479,0.0003683915,0.0010265225,0.0004611698,0.0036949643,0.0075006313,0.002012354,0.0025508904,0.00040817153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046141053,0.00002116815,0.000522647,0.000058168167,0.0000068974337,0.00014324872,0.000706493,0.0010452258,0.0022124602,0.98654085,0.0004743047,0.008222419],"study_design_scores_gemma":[0.000014165686,0.000041171046,0.00020838372,0.000034816574,0.000014713052,0.00019752399,0.00022078051,0.0060891793,0.004693794,0.98090726,0.007561899,0.000016448788],"about_ca_topic_score_codex":0.00050315063,"about_ca_topic_score_gemma":0.000327989,"teacher_disagreement_score":0.0035405012,"about_ca_system_score_codex":0.00085419783,"about_ca_system_score_gemma":0.00052717555,"threshold_uncertainty_score":0.011844218},"labels":[],"label_agreement":null},{"id":"W2963216346","doi":"10.1007/978-3-319-98654-8_10","title":"Additive Number Theory via Approximation by Regular Languages","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Theoretical computer science; Programming language; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.005978647879563974,"score_gpt":0.22829505871394593,"score_spread":0.22231641083438194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963216346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048822064,0.004066335,0.7878825,0.002405876,0.00086055987,0.00006658697,0.00025643752,0.000968352,0.1546713],"genre_scores_gemma":[0.75445235,0.0041431566,0.17633666,0.00093160325,0.0015813365,0.00023664902,0.0005529582,0.00050377654,0.061261483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834645,0.00044984423,0.000101194346,0.00034937964,0.0006088625,0.0001442483],"domain_scores_gemma":[0.99829227,0.0010728763,0.00007484167,0.0003228183,0.0001567009,0.00008050271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009548167,0.00106701,0.0013481086,0.0018288202,0.0010697931,0.0041653165,0.0016778853,0.0008896844,0.0064620073],"category_scores_gemma":[0.0035202878,0.00079300866,0.0015968819,0.0020102453,0.0035094202,0.008936291,0.0031230485,0.0048382822,0.0021191996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015513295,0.000008712683,0.00003093454,0.000038622773,0.000005570605,0.000012483723,0.00006986369,0.001215839,0.0002833527,0.98987913,0.0006921064,0.007747844],"study_design_scores_gemma":[0.0000054121124,0.000008333678,0.00003280933,0.00000990902,0.000008893593,0.000036541325,0.000016218393,0.004819889,0.00033207558,0.990932,0.003790634,0.000007262139],"about_ca_topic_score_codex":0.00043708977,"about_ca_topic_score_gemma":0.00037722432,"teacher_disagreement_score":0.0064620073,"about_ca_system_score_codex":0.0017281397,"about_ca_system_score_gemma":0.0005410309,"threshold_uncertainty_score":0.021617591},"labels":[],"label_agreement":null},{"id":"W2963221799","doi":"","title":"Permutation complexity of images of Sturmian words by marked morphisms","year":2018,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Morphism; Permutation (music); Combinatorics; Art","score_opus":0.050669574501848766,"score_gpt":0.1841130613037573,"score_spread":0.13344348680190854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963221799","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74053174,0.00081912684,0.12299858,0.010548903,0.0008102854,0.000051949937,0.0004899823,0.0007303291,0.12301914],"genre_scores_gemma":[0.9801595,0.00025172584,0.009743898,0.00063462765,0.00029334464,0.00004811691,0.00017966375,0.000090934525,0.008598079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993044,0.00010010965,0.000039018832,0.00017609546,0.00027356832,0.000106801504],"domain_scores_gemma":[0.99683255,0.0019914159,0.00024637932,0.00037369435,0.00035208062,0.00020393991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051327894,0.00023396086,0.00032930964,0.0006301098,0.0007555841,0.0020491797,0.0005173489,0.0008296007,0.0075396732],"category_scores_gemma":[0.0048621125,0.00023742646,0.0005184868,0.00052996847,0.0021900514,0.0051484937,0.0010524307,0.0014644169,0.00084786786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015597764,0.000016104412,0.00094719924,0.00008155169,0.000008882886,0.00023029633,0.00037496968,0.00226048,0.0068449406,0.9749391,0.0035670202,0.010573355],"study_design_scores_gemma":[0.000024773763,0.00004601466,0.0015940118,0.000017764289,0.000012351746,0.00038867904,0.00014813791,0.008355247,0.0089877965,0.9677618,0.012629337,0.00003403282],"about_ca_topic_score_codex":0.0004917209,"about_ca_topic_score_gemma":0.00041468596,"teacher_disagreement_score":0.0075396732,"about_ca_system_score_codex":0.001150071,"about_ca_system_score_gemma":0.00042223753,"threshold_uncertainty_score":0.02522266},"labels":[],"label_agreement":null},{"id":"W2963223550","doi":"10.1515/integ.2011.007","title":"Van der Waerden's Theorem and Avoidability in Words","year":2011,"lang":"en","type":"article","venue":"Integers","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Van der Waerden's theorem; Mathematics; Combinatorics","score_opus":0.015984831060490524,"score_gpt":0.2174280305775529,"score_spread":0.20144319951706235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963223550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29478586,0.0054633305,0.49630997,0.008458933,0.0010043079,0.00010356699,0.0005044536,0.00054120773,0.19282833],"genre_scores_gemma":[0.9389652,0.00089682714,0.037308525,0.0006224694,0.00040814953,0.00016373467,0.00022368183,0.0001533518,0.021258164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980599,0.00048836606,0.00018107306,0.00065969984,0.0003492109,0.00026165968],"domain_scores_gemma":[0.99565303,0.0031326767,0.00021584243,0.0005501332,0.0003071085,0.00014112885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015884701,0.0005803768,0.0011615637,0.0015101172,0.0023717866,0.0036316672,0.0017644857,0.001458668,0.0050854697],"category_scores_gemma":[0.005515621,0.0007207621,0.0015380043,0.0013736946,0.008053637,0.012427998,0.0035631575,0.0034428418,0.0005746112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023390388,0.0000047458816,0.00010783235,0.00003266184,0.0000064016235,0.00004434967,0.00037240374,0.0004824118,0.00033634697,0.99609923,0.00037691303,0.0021133681],"study_design_scores_gemma":[0.0000088241395,0.0000053532544,0.000042661493,0.000007767094,0.0000052721402,0.000036758345,0.000076383134,0.0009575052,0.00020661973,0.99583936,0.002807892,0.0000055353394],"about_ca_topic_score_codex":0.0014249241,"about_ca_topic_score_gemma":0.0012246006,"teacher_disagreement_score":0.0050854697,"about_ca_system_score_codex":0.0015083554,"about_ca_system_score_gemma":0.0006764122,"threshold_uncertainty_score":0.017012596},"labels":[],"label_agreement":null},{"id":"W2963282310","doi":"10.1016/j.aim.2009.09.001","title":"A groupoid approach to discrete inverse semigroup algebras","year":2009,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":184,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Inverse semigroup; Inverse element; Bicyclic semigroup; Semigroup; Cancellative semigroup; Pure mathematics; Duality (order theory); Inverse; Algebra over a field; Convolution (computer science); Idempotence; Special classes of semigroups","score_opus":0.00977277697568894,"score_gpt":0.25581891978628796,"score_spread":0.24604614281059903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963282310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034162592,0.004952486,0.8408087,0.005631753,0.0014996118,0.00007116317,0.00019753944,0.00025016587,0.112426005],"genre_scores_gemma":[0.6272911,0.005252171,0.28908607,0.0022514309,0.003245378,0.00026212886,0.00037713523,0.00022009748,0.07201446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993826,0.00021262349,0.000038861304,0.00012729767,0.00017942897,0.00005917848],"domain_scores_gemma":[0.99934703,0.00029746487,0.00003288451,0.00010086055,0.00013169118,0.00009012715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010254668,0.0007220216,0.00092889444,0.0017932499,0.0015844845,0.0030213988,0.0012950018,0.0013057304,0.00668837],"category_scores_gemma":[0.0017691279,0.0004335354,0.0013304421,0.0017091956,0.005456045,0.0070095584,0.0021026954,0.004702095,0.0010459586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031639306,0.000004602781,0.000011422898,0.0000075229354,0.000001365752,0.000014192118,0.000104884864,0.00017398375,0.00013916829,0.99802303,0.00025986249,0.0012567365],"study_design_scores_gemma":[0.000004299981,0.0000073162932,0.000015073085,0.000004848686,0.0000021561966,0.000022096265,0.000030356185,0.0011500029,0.00008232173,0.9939628,0.0047150385,0.0000037587063],"about_ca_topic_score_codex":0.0013808504,"about_ca_topic_score_gemma":0.0011238653,"teacher_disagreement_score":0.00668837,"about_ca_system_score_codex":0.0018633885,"about_ca_system_score_gemma":0.0008880227,"threshold_uncertainty_score":0.022374809},"labels":[],"label_agreement":null},{"id":"W2963375598","doi":"10.1017/s1446788713000074","title":"A VARIANT OF HOFSTADTER’S SEQUENCE AND FINITE AUTOMATA","year":2012,"lang":"en","type":"article","venue":"Journal of the Australian Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Automaton; Mathematics; Finite-state machine; Integer (computer science); Combinatorics; Discrete mathematics; Algorithm; Theoretical computer science; Computer science; Programming language; Genetics; Biology","score_opus":0.04289413870499177,"score_gpt":0.28252230318145355,"score_spread":0.2396281644764618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963375598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48972812,0.0010528077,0.43781802,0.0015108909,0.00043484574,0.00007202993,0.00019836672,0.00053759565,0.06864733],"genre_scores_gemma":[0.9648784,0.000157234,0.027003609,0.00016483138,0.00016646371,0.00004289681,0.000067645175,0.000059865066,0.0074592014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989648,0.00028404276,0.00005114591,0.0002330108,0.00029088516,0.00017611204],"domain_scores_gemma":[0.9981025,0.0009858891,0.00018639289,0.0002971018,0.00031557656,0.00011259442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085493195,0.00033076358,0.00034356126,0.0011141532,0.00091782835,0.0014002769,0.00071526587,0.0009193895,0.0050768857],"category_scores_gemma":[0.0033009036,0.00021145146,0.00064245187,0.00071267044,0.0031521867,0.0032059392,0.0008106816,0.0013096262,0.0005747245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030201745,0.0000076255283,0.00026927044,0.000013111604,0.0000034682967,0.0001102101,0.00018806412,0.0030455114,0.0021821426,0.9906759,0.00029766266,0.0031766766],"study_design_scores_gemma":[0.000009906052,0.000031968466,0.00032982754,0.000012141687,0.0000044569206,0.00014937542,0.00009409164,0.031928625,0.0023781839,0.9612441,0.0037941781,0.000023104289],"about_ca_topic_score_codex":0.0025919827,"about_ca_topic_score_gemma":0.0013702903,"teacher_disagreement_score":0.0050768857,"about_ca_system_score_codex":0.0011883514,"about_ca_system_score_gemma":0.0005360022,"threshold_uncertainty_score":0.016983867},"labels":[],"label_agreement":null},{"id":"W2963398621","doi":"","title":"Hereditary Rigid Relations.","year":2015,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Unary operation; Mathematics; Identity function; Identity (music); Set (abstract data type); Constant (computer programming); Finite set; Pure mathematics; Combinatorics; Computer science; Mathematical analysis; Physics","score_opus":0.015371285475275043,"score_gpt":0.22473418335123818,"score_spread":0.20936289787596313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963398621","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08430117,0.0051543806,0.091359496,0.0066036913,0.0007875474,0.000066766224,0.0017927298,0.0008676726,0.8090666],"genre_scores_gemma":[0.79174054,0.003070249,0.011980913,0.0008801202,0.0011321723,0.000086262604,0.0019013917,0.00021454558,0.18899381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897385,0.00016228402,0.00004798955,0.00041394678,0.00026460562,0.00013729614],"domain_scores_gemma":[0.99782085,0.0011454519,0.00020754107,0.00041421672,0.00022506251,0.00018684068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007536954,0.00050619134,0.00061121996,0.0013083128,0.0018597621,0.0027805495,0.00062797015,0.0007774053,0.05133723],"category_scores_gemma":[0.0024587745,0.00032048827,0.00061156263,0.0019435486,0.0032537775,0.0049101887,0.001948982,0.0015532973,0.005307239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018504601,0.0000111296185,0.00011640854,0.000046438246,0.000004080387,0.000052423424,0.0001945975,0.00025174933,0.00057109,0.9861224,0.0049278755,0.007683199],"study_design_scores_gemma":[0.000011706318,0.000013356609,0.0005411618,0.000028128958,0.000010539017,0.0001848905,0.00012427091,0.00096420787,0.000796739,0.96144044,0.035875376,0.000009193267],"about_ca_topic_score_codex":0.0017163965,"about_ca_topic_score_gemma":0.0015568926,"teacher_disagreement_score":0.05133723,"about_ca_system_score_codex":0.0023029856,"about_ca_system_score_gemma":0.00077939284,"threshold_uncertainty_score":0.17174011},"labels":[],"label_agreement":null},{"id":"W2963407000","doi":"","title":"Primitive words and Lyndon words in automatic and linearly recurrent sequences","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Waterloo","funders":"","keywords":"Sequence (biology); Factorization; Combinatorics; Generating function; Bounded function; Computer science; Function (biology); Combinatorics on words; Algorithm; Mathematics; Discrete mathematics; Word (group theory); Arithmetic; Biology; Genetics","score_opus":0.015559798908457682,"score_gpt":0.22808675651606733,"score_spread":0.21252695760760965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963407000","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06655227,0.026145253,0.23111035,0.002171252,0.0028395848,0.00013879767,0.00034129262,0.00067372667,0.67002743],"genre_scores_gemma":[0.5289392,0.013101378,0.08463849,0.0009431018,0.0027151739,0.0004315768,0.00063224416,0.0005197273,0.36807904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996136,0.00011081565,0.000032019292,0.000066144494,0.0001287123,0.000048682246],"domain_scores_gemma":[0.9996315,0.0002113295,0.000027625762,0.000043736094,0.000060185845,0.000025605217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047125728,0.00086061936,0.0005886082,0.0012115764,0.0013684839,0.002326424,0.00074567646,0.0009362458,0.0092161205],"category_scores_gemma":[0.0012956767,0.00048080637,0.00048443076,0.0016470985,0.0030287234,0.0040163887,0.0009893827,0.0018061392,0.0027250373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011712695,0.0000066778175,0.000023431992,0.000053765012,0.0000018597772,0.000036304504,0.00039708838,0.00017271169,0.0009024457,0.9800545,0.0026567073,0.01568279],"study_design_scores_gemma":[0.0000052638516,0.000013588972,0.000057949514,0.000027791782,0.000003547767,0.00010821203,0.00008234976,0.0007134278,0.0005600063,0.9632825,0.035135284,0.000010184574],"about_ca_topic_score_codex":0.0005246426,"about_ca_topic_score_gemma":0.00087106344,"teacher_disagreement_score":0.0092161205,"about_ca_system_score_codex":0.0011319892,"about_ca_system_score_gemma":0.0005982065,"threshold_uncertainty_score":0.030831039},"labels":[],"label_agreement":null},{"id":"W2963571572","doi":"10.1016/j.aim.2009.08.013","title":"An automaton-theoretic approach to the representation theory of quantum algebras","year":2009,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Torus; Invariant (physics); Semigroup; Pure mathematics; Discrete mathematics; Representation theory; Invariant theory; Algebraic number; Quantum; Algebra over a field; Quantum mechanics; Mathematical physics","score_opus":0.015042188280655398,"score_gpt":0.2922200621754028,"score_spread":0.2771778738947474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963571572","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038174037,0.0032177782,0.8870331,0.0059125605,0.0008892745,0.000067269866,0.00027775866,0.0003164625,0.06411177],"genre_scores_gemma":[0.78113675,0.0033336903,0.18677397,0.0016203186,0.0019027583,0.00023932225,0.00035261258,0.00018817413,0.024452325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989611,0.00038108573,0.00007378854,0.0001587696,0.00030689393,0.00011827122],"domain_scores_gemma":[0.99860865,0.00076847535,0.000073617324,0.00021974636,0.00022101136,0.00010856241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015173755,0.0006413981,0.0010726025,0.0014704101,0.0018922276,0.0040044105,0.0024836503,0.00192259,0.0063961106],"category_scores_gemma":[0.002866161,0.0005436419,0.00215437,0.0015621003,0.004832729,0.007880139,0.0025977262,0.004052723,0.0009213998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027278593,0.000005467821,0.0000139174235,0.000008475432,0.0000020742407,0.000011636873,0.00006307397,0.0005344922,0.00013850551,0.99815375,0.00018963912,0.0008761911],"study_design_scores_gemma":[0.000003268934,0.0000051966313,0.000011733406,0.0000048196853,0.0000021752132,0.000010428514,0.000013652941,0.004539373,0.000066325774,0.9941859,0.0011528924,0.000004205151],"about_ca_topic_score_codex":0.0014648814,"about_ca_topic_score_gemma":0.0011946765,"teacher_disagreement_score":0.0063961106,"about_ca_system_score_codex":0.0018851463,"about_ca_system_score_gemma":0.0015121044,"threshold_uncertainty_score":0.021397114},"labels":[],"label_agreement":null},{"id":"W2964048382","doi":"10.1142/s0129054112400655","title":"THE CRITICAL EXPONENT IS COMPUTABLE FOR AUTOMATIC SEQUENCES","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Tulane University","keywords":"Exponent; Infimum and supremum; Mathematics; Critical exponent; Rational number; Computation; Constant (computer programming); Discrete mathematics; Sequence (biology); Diophantine equation; Diophantine approximation; Combinatorics; Computer science; Algorithm","score_opus":0.028626477348128468,"score_gpt":0.3462912195548554,"score_spread":0.31766474220672697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964048382","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7795151,0.0012735388,0.1828075,0.00074242614,0.00010442917,0.000065626155,0.00039103115,0.00089446944,0.03420598],"genre_scores_gemma":[0.97994244,0.00032299123,0.01714893,0.000065400614,0.00008539565,0.000038427752,0.00021563882,0.000119820026,0.0020610641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934846,0.000090268266,0.000059475635,0.00019520102,0.00019385439,0.00011277724],"domain_scores_gemma":[0.99432266,0.003822151,0.000395316,0.0006565859,0.0005994719,0.00020390772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061901956,0.0005742991,0.00055679504,0.0018617378,0.0007914229,0.0027120484,0.00048825302,0.00043288292,0.0029038468],"category_scores_gemma":[0.011215149,0.00034653296,0.0003937116,0.0013259477,0.0022972124,0.005363385,0.0014314204,0.0015766931,0.00053260487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037730215,0.000056189365,0.008525268,0.00031017503,0.00003274644,0.0004912154,0.0012072609,0.011065984,0.0156491,0.9051342,0.0026589646,0.054491647],"study_design_scores_gemma":[0.00004669807,0.000041807223,0.0015921256,0.00009456248,0.00003410371,0.00030657972,0.00016471901,0.048977137,0.014980883,0.92826486,0.005446892,0.000049508533],"about_ca_topic_score_codex":0.0009254964,"about_ca_topic_score_gemma":0.00088185986,"teacher_disagreement_score":0.0029038468,"about_ca_system_score_codex":0.0014997749,"about_ca_system_score_gemma":0.0007774134,"threshold_uncertainty_score":0.010881662},"labels":[],"label_agreement":null},{"id":"W2964137219","doi":"10.4153/cmb-2018-014-8","title":"Merge Decompositions, Two-sided Krohn–Rhodes, and Aperiodic Pointlikes","year":2018,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Homomorphism; Semigroup; Semidirect product; Aperiodic graph; Mathematical proof; Merge (version control); Pure mathematics; Decomposition theorem; Discrete mathematics; Algebraic number; Direct product; Algebra over a field; Combinatorics; Group (periodic table); Computer science; Mathematical analysis","score_opus":0.006204546888429754,"score_gpt":0.22040460149230726,"score_spread":0.2142000546038775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964137219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3136058,0.0012876508,0.61172986,0.00066848774,0.00026428376,0.00012190564,0.0001693146,0.0005782036,0.07157455],"genre_scores_gemma":[0.8716238,0.00038596868,0.11383527,0.00016641647,0.00014136276,0.00006967073,0.00013603581,0.000091780144,0.01354967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901783,0.00018742534,0.00005964406,0.00020632899,0.0003960944,0.000132579],"domain_scores_gemma":[0.99931777,0.0001792658,0.000111809015,0.00013866519,0.00013324076,0.00011932444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011361858,0.0003257146,0.000330484,0.0009021143,0.0006909852,0.00097327615,0.00043245128,0.00034133537,0.004625595],"category_scores_gemma":[0.0011466722,0.00027069304,0.00070780655,0.0004014464,0.0018593372,0.0021341497,0.0018946545,0.0010607308,0.00082195154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040532977,0.00001230167,0.00017208625,0.000030734987,0.0000078233625,0.00014670366,0.00052400574,0.0005741936,0.0069062444,0.9817261,0.00043053806,0.009428771],"study_design_scores_gemma":[0.000033085875,0.000089894886,0.00058359513,0.000022338187,0.000024568279,0.0006896771,0.00050507125,0.007591522,0.013265132,0.9475563,0.029608585,0.00003021483],"about_ca_topic_score_codex":0.00036864536,"about_ca_topic_score_gemma":0.00050271343,"teacher_disagreement_score":0.004625595,"about_ca_system_score_codex":0.0006178613,"about_ca_system_score_gemma":0.00031283346,"threshold_uncertainty_score":0.015474141},"labels":[],"label_agreement":null},{"id":"W2964149005","doi":"10.1142/s0218196717500084","title":"On the atoms of algebraic lattices arising in 𝔮-theory","year":2017,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Mathematics; Algebraic number; Algebra over a field; Pure mathematics; Algebraic theory; Mathematical analysis","score_opus":0.015634903759305544,"score_gpt":0.29598898408520485,"score_spread":0.2803540803258993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964149005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7764862,0.0015495534,0.1432779,0.0024123518,0.00038137299,0.000087667606,0.00053124764,0.00020979285,0.07506395],"genre_scores_gemma":[0.9460915,0.0008631121,0.04254014,0.00022398603,0.00027704518,0.00005173001,0.00031840726,0.00007440438,0.009559814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995177,0.00012182068,0.000024048706,0.00007151941,0.00016889643,0.00009610597],"domain_scores_gemma":[0.99882704,0.0006364917,0.00014103687,0.0000993376,0.00017202852,0.00012407292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006856524,0.0005280904,0.0006316238,0.0012899683,0.0025453642,0.002558834,0.0011130308,0.0010817637,0.0059538796],"category_scores_gemma":[0.0026835622,0.0003623815,0.00067531265,0.0014293398,0.0036324093,0.0051233163,0.0015353411,0.0020936313,0.001047674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004677276,0.000024672674,0.00061529264,0.0000580321,0.0000049682117,0.0001517721,0.00039485563,0.000890904,0.0009970602,0.98999256,0.0009899042,0.0058332398],"study_design_scores_gemma":[0.000009052871,0.000016174881,0.00022820737,0.000020478443,0.000006464725,0.00019448221,0.00031361493,0.004789005,0.0008903137,0.9904936,0.0030256524,0.000012968331],"about_ca_topic_score_codex":0.00087174226,"about_ca_topic_score_gemma":0.0010942635,"teacher_disagreement_score":0.0059538796,"about_ca_system_score_codex":0.0008789729,"about_ca_system_score_gemma":0.00054291775,"threshold_uncertainty_score":0.019917727},"labels":[],"label_agreement":null},{"id":"W2964301491","doi":"10.1007/978-3-642-40579-2_26","title":"Sets Represented as the Length-n Factors of a Word","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Alphabet; Word (group theory); Upper and lower bounds; Combinatorics; Binary number; Mathematics; Set (abstract data type); Combinatorics on words; Discrete mathematics; Finite set; Word length; Computer science; Arithmetic; Natural language processing; Linguistics","score_opus":0.0172427046136661,"score_gpt":0.24584312987546808,"score_spread":0.22860042526180196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964301491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16855466,0.0049897498,0.55716366,0.001322982,0.001771216,0.00019870968,0.00167463,0.001729865,0.2625945],"genre_scores_gemma":[0.6498865,0.0035971054,0.19196223,0.00040815506,0.001024289,0.00030976813,0.0020016097,0.0007997689,0.15001065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992779,0.00015594205,0.0000663324,0.00021574313,0.00017152628,0.000112586495],"domain_scores_gemma":[0.99943787,0.00025902185,0.000063201376,0.0001007309,0.000097973854,0.000041258743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040051583,0.0007614376,0.000520454,0.0013037918,0.0010643916,0.0036160375,0.0008524554,0.00071837095,0.013366042],"category_scores_gemma":[0.0017290341,0.00047038027,0.00087145786,0.0011860145,0.0017326619,0.0035874527,0.0012080392,0.00096759055,0.004158301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025423607,0.000028075488,0.0003477992,0.00021164307,0.00003159751,0.00029438172,0.0009940264,0.001983399,0.01288509,0.9189216,0.0056063873,0.05844182],"study_design_scores_gemma":[0.000031047224,0.00007699916,0.00043453713,0.00020965883,0.000063796026,0.00051011296,0.00047976858,0.009344837,0.010025905,0.86640066,0.11236755,0.000055049186],"about_ca_topic_score_codex":0.0008139993,"about_ca_topic_score_gemma":0.0010502252,"teacher_disagreement_score":0.013366042,"about_ca_system_score_codex":0.0009614648,"about_ca_system_score_gemma":0.00048565387,"threshold_uncertainty_score":0.044713855},"labels":[],"label_agreement":null},{"id":"W2964341975","doi":"10.37236/8905","title":"Queens in Exile: Non-attacking Queens on Infinite Chess Boards","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Quadrant (abdomen); Square (algebra); Queen (butterfly); Order (exchange); Mathematics; Word (group theory); Spiral (railway); Geometry; Mathematical analysis; Biology; Zoology","score_opus":0.01603099815686654,"score_gpt":0.2611772959522399,"score_spread":0.24514629779537334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964341975","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6950983,0.00052322826,0.21341157,0.0025201067,0.00033930843,0.00011229078,0.0002423728,0.00046731636,0.08728547],"genre_scores_gemma":[0.92866904,0.0002252261,0.03834717,0.00019589438,0.000098701035,0.00010887744,0.00022933623,0.0001242516,0.032001484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992342,0.00029017575,0.00003537577,0.00011854468,0.00011980589,0.00020187853],"domain_scores_gemma":[0.9970247,0.002038574,0.00020334314,0.00023748568,0.00013551218,0.00036039756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061545166,0.0005732742,0.00067610986,0.00044439116,0.0018320794,0.0025519524,0.0014168075,0.0020675883,0.008490251],"category_scores_gemma":[0.0046061995,0.0004723078,0.00081522577,0.00036728408,0.0027771958,0.0033659008,0.002468517,0.0017628386,0.0008936879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048657064,0.0001094416,0.0015186465,0.00014228604,0.0000252717,0.0015953999,0.0012814284,0.06211986,0.004561559,0.9089692,0.0057618516,0.013428518],"study_design_scores_gemma":[0.00010275174,0.00008744703,0.0004932013,0.000031129544,0.000016096898,0.00035580274,0.00065930036,0.1934475,0.0024792838,0.7961803,0.006111632,0.0000356334],"about_ca_topic_score_codex":0.0015140048,"about_ca_topic_score_gemma":0.0023999787,"teacher_disagreement_score":0.008490251,"about_ca_system_score_codex":0.0008673172,"about_ca_system_score_gemma":0.00056678033,"threshold_uncertainty_score":0.028402746},"labels":[],"label_agreement":null},{"id":"W2964549879","doi":"10.1007/978-3-030-23679-3_18","title":"Decision Problems for Restricted Variants of Two-Dimensional Automata","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Deterministic automaton; Nondeterministic finite automaton; Decidability; Nondeterministic algorithm; Unary operation; Deterministic finite automaton; Discrete mathematics; Automaton; Two-way deterministic finite automaton; Decision problem; Computer science; Büchi automaton; Equivalence (formal languages); Combinatorics; Mathematics; Finite-state machine; Automata theory; Algorithm; Theoretical computer science","score_opus":0.017336484729493278,"score_gpt":0.25404343266138335,"score_spread":0.23670694793189007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964549879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22320023,0.0018617298,0.7304277,0.0022737947,0.00038527258,0.00034949236,0.00080003036,0.0004705994,0.04023116],"genre_scores_gemma":[0.81264675,0.0011170487,0.16463336,0.00033777856,0.0004591191,0.00045748468,0.0013822997,0.00018398893,0.018782249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605584,0.0016968307,0.00034468787,0.0008561646,0.00058825576,0.00045826207],"domain_scores_gemma":[0.98439205,0.01294921,0.00042490457,0.0011266123,0.0005445198,0.0005627152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003489549,0.00089455646,0.0015799745,0.0007802779,0.0009991913,0.0050624833,0.0030450933,0.0019452363,0.0073458194],"category_scores_gemma":[0.012201148,0.00078049314,0.002295094,0.0014034563,0.003151309,0.007396079,0.003031904,0.0047120494,0.0006679059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042649073,0.0001992158,0.0004957912,0.0002922034,0.00008301186,0.00018304202,0.0003938942,0.052107897,0.0018594412,0.9121306,0.003390002,0.02843845],"study_design_scores_gemma":[0.00008850437,0.00005872162,0.00014484659,0.000027924638,0.000029079985,0.00010555607,0.0001249716,0.13751042,0.0008000296,0.85914767,0.0019352236,0.000027048276],"about_ca_topic_score_codex":0.0013637202,"about_ca_topic_score_gemma":0.0011832927,"teacher_disagreement_score":0.0073458194,"about_ca_system_score_codex":0.0016887182,"about_ca_system_score_gemma":0.0011322993,"threshold_uncertainty_score":0.02457422},"labels":[],"label_agreement":null},{"id":"W2964924495","doi":"10.23638/dmtcs-22-1-6","title":"The repetition threshold for binary rich words","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Repetition (rhetorical device); Binary number; Psychology; Linguistics; Mathematics; Natural language processing; Arithmetic; Computer science; Philosophy","score_opus":0.017334118239021163,"score_gpt":0.25899928604030886,"score_spread":0.2416651678012877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964924495","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5059976,0.0077712545,0.10650927,0.052896358,0.0030015735,0.00015120319,0.0010169436,0.0017683422,0.32088745],"genre_scores_gemma":[0.9754321,0.0010807657,0.008368473,0.003614908,0.0010970471,0.00011093654,0.00017772603,0.00018924069,0.009928884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986136,0.0002275882,0.00010970227,0.00038595154,0.00048683965,0.0001761623],"domain_scores_gemma":[0.99166065,0.005698403,0.0006647913,0.00078641216,0.0008507876,0.00033897243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000956288,0.00024613895,0.00037334068,0.0012580071,0.0012017934,0.0019272757,0.00077182625,0.0015384173,0.008397518],"category_scores_gemma":[0.013098297,0.00027673616,0.00042013545,0.0005933006,0.0038813374,0.004917137,0.0014663306,0.0027144097,0.0019382288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017344432,0.000020413234,0.0017102114,0.00017461304,0.000012345915,0.00041402885,0.0007955577,0.0014558578,0.00955007,0.95924115,0.010582771,0.015869534],"study_design_scores_gemma":[0.000056329904,0.00009389361,0.0025143076,0.00009722711,0.000018306768,0.0010043706,0.000341436,0.0065067452,0.011116379,0.95128065,0.026911775,0.00005853128],"about_ca_topic_score_codex":0.00056356064,"about_ca_topic_score_gemma":0.00036041666,"teacher_disagreement_score":0.008397518,"about_ca_system_score_codex":0.001298136,"about_ca_system_score_gemma":0.00056518003,"threshold_uncertainty_score":0.028092504},"labels":[],"label_agreement":null},{"id":"W2969519964","doi":"10.5802/jtnb.1070","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>F</mml:mi> </mml:math> -sets and finite automata","year":2019,"lang":"en","type":"article","venue":"Journal de Théorie des Nombres de Bordeaux","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Subvariety; Mathematics; Commutative property; Endomorphism; Algebraic group; Natural number; Context (archaeology); Abelian group; Algebraic number; Discrete mathematics; Action (physics); Invariant (physics); Pure mathematics; Algebra over a field; Mathematical analysis; Variety (cybernetics)","score_opus":0.01246956994955565,"score_gpt":0.23958445543329335,"score_spread":0.2271148854837377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969519964","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03515753,0.00264115,0.46003428,0.01560187,0.0014007416,0.00028196964,0.005384142,0.011070676,0.46842772],"genre_scores_gemma":[0.3258029,0.0055124527,0.26589832,0.004247037,0.0014491356,0.0006982805,0.013593605,0.0061586555,0.37663972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867034,0.00034270884,0.00014035974,0.00035483643,0.00036650395,0.00012524074],"domain_scores_gemma":[0.99868315,0.00036097414,0.00014100781,0.0004182295,0.00023752525,0.0001591802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015111637,0.0006438743,0.00059554353,0.0016532777,0.0011083743,0.0050644656,0.0017907097,0.0012521287,0.038120516],"category_scores_gemma":[0.0020674663,0.00065494096,0.00091920677,0.002413395,0.0021809072,0.0075513823,0.0024593286,0.0022923693,0.015566006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007943109,0.00005464975,0.00033422434,0.00017014363,0.00001623439,0.00016923028,0.00049859774,0.0011426924,0.003509253,0.86338496,0.0698924,0.060748145],"study_design_scores_gemma":[0.000037570306,0.000035235724,0.0008991568,0.000095987285,0.000014694432,0.00033072737,0.00018611898,0.0057918164,0.0044870484,0.46084294,0.5272235,0.000055312434],"about_ca_topic_score_codex":0.005113341,"about_ca_topic_score_gemma":0.0058654775,"teacher_disagreement_score":0.038120516,"about_ca_system_score_codex":0.0032106296,"about_ca_system_score_gemma":0.0015987996,"threshold_uncertainty_score":0.1275258},"labels":[],"label_agreement":null},{"id":"W2971864569","doi":"10.1142/s0129054121420041","title":"Descriptional Complexity of Semi-Simple Splicing Systems","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"String (physics); Regular language; RNA splicing; Axiom; Mathematics; Set (abstract data type); Recursively enumerable language; Simple (philosophy); Focus (optics); Combinatorics; Discrete mathematics; Computer science; Theoretical computer science; Physics; Automaton; Genetics; RNA","score_opus":0.04492041818409099,"score_gpt":0.30748736289904227,"score_spread":0.2625669447149513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971864569","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63589555,0.0013254116,0.34101593,0.0030567332,0.000055410863,0.00018747254,0.0019097396,0.0009171166,0.015636647],"genre_scores_gemma":[0.9607004,0.0004979688,0.033943105,0.00019315133,0.000058476446,0.00024264432,0.0013441786,0.00011137008,0.0029087414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99606246,0.0010804912,0.00045568167,0.00076454366,0.0012627586,0.00037401242],"domain_scores_gemma":[0.9833266,0.012236319,0.0013991457,0.0015411988,0.0010169429,0.00047977918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001901205,0.00064315606,0.0010699624,0.0014855235,0.0011011027,0.00402368,0.0023903172,0.001694804,0.0035104225],"category_scores_gemma":[0.011130854,0.0008878231,0.0017972738,0.001324835,0.0038560908,0.008006674,0.0031339582,0.0024647554,0.0004187089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016276177,0.000110751644,0.003314655,0.00035149403,0.00012011399,0.00041890374,0.0016415932,0.108399905,0.0051972796,0.8636263,0.0015522849,0.015103893],"study_design_scores_gemma":[0.000028948009,0.00002392751,0.00038135453,0.000017588123,0.000025732408,0.00011404132,0.00013943017,0.17025727,0.0012930545,0.8263165,0.0013730623,0.00002909678],"about_ca_topic_score_codex":0.0022192006,"about_ca_topic_score_gemma":0.0014971694,"teacher_disagreement_score":0.00402368,"about_ca_system_score_codex":0.0029409763,"about_ca_system_score_gemma":0.0012098368,"threshold_uncertainty_score":0.021338403},"labels":[],"label_agreement":null},{"id":"W2972232677","doi":"10.1007/s00209-021-02868-7","title":"A refinement of Christol’s theorem for algebraic power series","year":2021,"lang":"en","type":"preprint","venue":"Mathematische Zeitschrift","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algebraic closure; Mathematics; Algebraic number; Power series; Ring (chemistry); Formal power series; Context (archaeology); Series (stratigraphy); Finite field; Algebraic extension; State (computer science); Polynomial ring; Combinatorics; Field (mathematics); Discrete mathematics; Bounded function; Closure (psychology); Polynomial; Pure mathematics; Algorithm; Mathematical analysis","score_opus":0.015340489818487563,"score_gpt":0.2493736303180293,"score_spread":0.23403314049954174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972232677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035598934,0.003956512,0.757698,0.009936668,0.006116263,0.00014645442,0.00076776923,0.0008142649,0.1849652],"genre_scores_gemma":[0.6175693,0.0051437235,0.26750973,0.0052802996,0.009723102,0.00027846367,0.0008473695,0.0012725824,0.09237542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758255,0.00059006433,0.00014851888,0.00073527126,0.0006996223,0.00024394067],"domain_scores_gemma":[0.9946931,0.0025346885,0.00020477192,0.0009095789,0.0013435233,0.00031442303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041960925,0.0012921152,0.0019210093,0.0037783969,0.0026578181,0.0034108981,0.0022955365,0.0018056957,0.014864318],"category_scores_gemma":[0.010912498,0.00068852765,0.0027990723,0.0031858238,0.006157717,0.011737425,0.0045566005,0.006138392,0.0027373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037166756,0.000020292204,0.00012902281,0.00008845496,0.000016701148,0.000082074956,0.00023319162,0.0004988334,0.0009052153,0.9856081,0.0038970974,0.0084838],"study_design_scores_gemma":[0.000024988287,0.000026698679,0.0002352884,0.000025753092,0.000025303969,0.00012210933,0.000058862788,0.0051750573,0.00091922865,0.96732706,0.026032541,0.000027043912],"about_ca_topic_score_codex":0.0033261166,"about_ca_topic_score_gemma":0.0023348948,"teacher_disagreement_score":0.014864318,"about_ca_system_score_codex":0.002746266,"about_ca_system_score_gemma":0.0015418915,"threshold_uncertainty_score":0.04972613},"labels":[],"label_agreement":null},{"id":"W2973381442","doi":"10.1142/s0129054119400367","title":"State Complexity of the Quotient Operation on Input-Driven Pushdown Automata","year":2019,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Pushdown automaton; Deterministic pushdown automaton; Quotient; Context-free language; Nested word; Discrete mathematics; String (physics); Regular language; Mathematics; Closure (psychology); Computer science; Quantum finite automata; Nondeterministic finite automaton; Combinatorics; Finite-state machine; Automata theory; Automaton; Rule-based machine translation; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.022675386170567174,"score_gpt":0.2866288769865917,"score_spread":0.2639534908160245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973381442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80003273,0.00019510432,0.19002084,0.00055463775,0.000042795426,0.00011100406,0.0005818948,0.0010389773,0.0074219583],"genre_scores_gemma":[0.98246884,0.000072595605,0.0154836,0.000037629896,0.000022233446,0.00009797085,0.0003392049,0.000080601145,0.0013972075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706465,0.00053404574,0.00030431568,0.0007657758,0.00081649766,0.00051486236],"domain_scores_gemma":[0.98245,0.012578086,0.000960145,0.0019236589,0.001295109,0.0007930997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015384357,0.00053513976,0.0010644783,0.000963104,0.00111713,0.0038211732,0.0013141531,0.00078507874,0.004200953],"category_scores_gemma":[0.011622324,0.00041740586,0.0014818884,0.00072661805,0.0026843778,0.006655208,0.0025676885,0.0017423617,0.00031264446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021082675,0.00041680766,0.014646881,0.00050048175,0.0001580765,0.0008148278,0.0025913643,0.2723872,0.051329628,0.58989954,0.0019205782,0.06322638],"study_design_scores_gemma":[0.00006203035,0.00015958986,0.0014476893,0.00002046613,0.00007633429,0.00015061698,0.00014189236,0.6421192,0.021055335,0.33358788,0.0011227806,0.000056212102],"about_ca_topic_score_codex":0.0035351822,"about_ca_topic_score_gemma":0.002026333,"teacher_disagreement_score":0.004200953,"about_ca_system_score_codex":0.0029707644,"about_ca_system_score_gemma":0.0023318923,"threshold_uncertainty_score":0.02155453},"labels":[],"label_agreement":null},{"id":"W2973570009","doi":"10.1142/s0129054119400306","title":"Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation","year":2019,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Agentúra na Podporu Výskumu a Vývoja","keywords":"Suffix; Prefix; Factor (programming language); Regular language; Star (game theory); Computer science; Mathematics; Complementation; Discrete mathematics; Linguistics; Artificial intelligence; Programming language; Automaton","score_opus":0.01206863278707973,"score_gpt":0.2887628517587392,"score_spread":0.27669421897165947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973570009","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85746616,0.00016012884,0.12596196,0.00032583642,0.0000305271,0.00013356826,0.00032394458,0.00032653415,0.015271261],"genre_scores_gemma":[0.9636066,0.00013028669,0.029713577,0.000059118775,0.000037746453,0.00014443527,0.00040843184,0.00008933379,0.0058103567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988477,0.00022474455,0.00011315619,0.00021158955,0.00032323058,0.00027952285],"domain_scores_gemma":[0.9959831,0.0016577932,0.00084600196,0.0004544823,0.00059570064,0.0004629814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012662786,0.00047743952,0.0006900948,0.00084842433,0.0015185723,0.0018581508,0.00096842326,0.0004194797,0.005103163],"category_scores_gemma":[0.004558061,0.00030370074,0.0011835526,0.00081319455,0.0020790268,0.0039394037,0.001184628,0.000976249,0.0007754719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005747847,0.00017513517,0.003539763,0.00015880965,0.000049825485,0.0005443784,0.0012269255,0.036961377,0.014854013,0.9280087,0.0010425694,0.012863785],"study_design_scores_gemma":[0.00012573942,0.00021175033,0.0011930557,0.000035081255,0.00007385293,0.0005472763,0.0007041812,0.10429308,0.021890357,0.8661838,0.0046351575,0.00010660969],"about_ca_topic_score_codex":0.0015170873,"about_ca_topic_score_gemma":0.0018479931,"teacher_disagreement_score":0.005103163,"about_ca_system_score_codex":0.0012522688,"about_ca_system_score_gemma":0.0017967777,"threshold_uncertainty_score":0.017071784},"labels":[],"label_agreement":null},{"id":"W2980045536","doi":"10.37236/11660","title":"Tree Automata and Pigeonhole Classes of Matroids: II","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Douglas College","funders":"Royal Society Te Apārangi","keywords":"Matroid; Pigeonhole principle; Mathematics; Combinatorics; Graphic matroid; Discrete mathematics; Class (philosophy); Tree (set theory); Computer science","score_opus":0.006619691375914248,"score_gpt":0.22282454320529904,"score_spread":0.2162048518293848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980045536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56753486,0.00029305363,0.40695417,0.0023845357,0.00010090489,0.0003011742,0.0010563205,0.001304462,0.020070562],"genre_scores_gemma":[0.9307169,0.00012225164,0.065610126,0.00029527972,0.00006593893,0.00016464145,0.00052139687,0.000077053526,0.002426525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977059,0.0005115539,0.00015701923,0.0006482243,0.00049880386,0.00047856316],"domain_scores_gemma":[0.9866632,0.009344651,0.001033557,0.0016845881,0.00066483725,0.0006091657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019270033,0.00052464585,0.0006701873,0.000852122,0.0013819266,0.004257693,0.0017773311,0.0013243872,0.005123666],"category_scores_gemma":[0.0121954195,0.00052555604,0.001631847,0.00093112525,0.0032187644,0.007242398,0.0019807534,0.0025345206,0.00024719117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048471472,0.00031747602,0.009120689,0.0002463241,0.00008820124,0.00040924354,0.0011553267,0.028653089,0.013028413,0.89696234,0.0033376045,0.046196565],"study_design_scores_gemma":[0.00010207724,0.0002724371,0.0027351368,0.000050766597,0.00006243403,0.00035636456,0.0005134347,0.14369275,0.014898583,0.8328268,0.004433851,0.000055386125],"about_ca_topic_score_codex":0.0039826673,"about_ca_topic_score_gemma":0.003497351,"teacher_disagreement_score":0.005123666,"about_ca_system_score_codex":0.0025420445,"about_ca_system_score_gemma":0.0017616533,"threshold_uncertainty_score":0.018443942},"labels":[],"label_agreement":null},{"id":"W2980258839","doi":"","title":"Upper Bound on Syntactic Complexity of Suffix-Free Languages","year":2014,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular language; Cardinality (data modeling); Semigroup; Suffix; Upper and lower bounds; Alphabet; Mathematics; Combinatorics; Discrete mathematics; State (computer science); Quotient; Automaton; Computer science; Algorithm; Theoretical computer science; Linguistics","score_opus":0.05045026808207155,"score_gpt":0.18716882192228534,"score_spread":0.1367185538402138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980258839","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7680296,0.0006570623,0.18621649,0.003994967,0.00017449996,0.00015077695,0.0014435898,0.0012078657,0.038125213],"genre_scores_gemma":[0.9753997,0.00014775123,0.020273516,0.00021118054,0.00014771121,0.00013013583,0.0005501584,0.00016693094,0.0029729386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958884,0.0007799135,0.00030929348,0.0009476135,0.0015220373,0.0005528891],"domain_scores_gemma":[0.9473168,0.04281543,0.0018195037,0.004272767,0.0020531677,0.0017222805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023683887,0.0005537587,0.0010971439,0.001140212,0.0014391184,0.0032783851,0.001896084,0.0013717996,0.0105868485],"category_scores_gemma":[0.019883733,0.000667428,0.0015977457,0.0006372256,0.003227725,0.007968966,0.003681598,0.0029033993,0.0009002944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012258757,0.00042918755,0.011503342,0.0008362002,0.00013948517,0.001085709,0.002965058,0.054761,0.058035422,0.83210075,0.005264296,0.031653676],"study_design_scores_gemma":[0.000066533845,0.00017765418,0.0025412864,0.000076933175,0.00007515324,0.0005481361,0.00022659863,0.1376129,0.01847256,0.8353257,0.004800629,0.00007581155],"about_ca_topic_score_codex":0.00052174693,"about_ca_topic_score_gemma":0.0006493123,"teacher_disagreement_score":0.0105868485,"about_ca_system_score_codex":0.0016790031,"about_ca_system_score_gemma":0.0014851474,"threshold_uncertainty_score":0.035416543},"labels":[],"label_agreement":null},{"id":"W2980435437","doi":"10.4153/s0008439519000638","title":"Measurable and Continuous Units of an -semigroup","year":2019,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Unicode; Bijection; Mathematics; Semigroup; Combinatorics; Product (mathematics); Discrete mathematics; Arithmetic; Pure mathematics; Computer science; Geometry; Artificial intelligence","score_opus":0.007780172752348805,"score_gpt":0.18181219706139112,"score_spread":0.17403202430904233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980435437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54670805,0.0010860207,0.30113393,0.001082883,0.0005167313,0.0001480397,0.00063327485,0.0007024352,0.14798857],"genre_scores_gemma":[0.9595597,0.00014424516,0.02446564,0.00011772105,0.00012451728,0.000121297715,0.00022646382,0.00007001019,0.0151703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986297,0.00039399313,0.000118890945,0.0003162025,0.00038651525,0.00015473168],"domain_scores_gemma":[0.9978872,0.00064889924,0.0002437289,0.00018448854,0.00051299826,0.0005226804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093721953,0.00034980956,0.00036682098,0.0009184413,0.0010720938,0.0023488498,0.0006928216,0.00044088945,0.0052550114],"category_scores_gemma":[0.0020426617,0.00030424644,0.00050134986,0.00043740444,0.0022976145,0.0022298077,0.0017049401,0.0010014246,0.00064182916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002653643,0.000020060497,0.0001704131,0.000017559929,0.00000531678,0.00010258458,0.00034293305,0.00047696277,0.0019788023,0.99413425,0.0003907478,0.0023338436],"study_design_scores_gemma":[0.000041613894,0.00010339818,0.0007008689,0.000024993002,0.0000088293045,0.0002419105,0.0003766922,0.018962895,0.0037063644,0.96390134,0.011904004,0.000027055494],"about_ca_topic_score_codex":0.0009339361,"about_ca_topic_score_gemma":0.00069665944,"teacher_disagreement_score":0.0052550114,"about_ca_system_score_codex":0.0010552965,"about_ca_system_score_gemma":0.0005129578,"threshold_uncertainty_score":0.017579794},"labels":[],"label_agreement":null},{"id":"W2985287154","doi":"10.1016/j.tcs.2019.10.048","title":"Palindromization and construction of Markoff triples","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Diophantine equation; Mathematics; Set (abstract data type); Monoid; Palindrome; Free monoid; Resolution (logic); Combinatorics; Pure mathematics; Algebra over a field; Computer science","score_opus":0.003379876228543957,"score_gpt":0.19893721235105163,"score_spread":0.19555733612250767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985287154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33794668,0.00043167773,0.5136884,0.0009669976,0.0004501041,0.00015691422,0.0003730914,0.0011974958,0.1447887],"genre_scores_gemma":[0.8942136,0.00021285328,0.080077894,0.00021154358,0.00011095031,0.0001297508,0.00041961911,0.00034472664,0.024279129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942505,0.00011775754,0.00004807707,0.00014416472,0.00013373054,0.00013124495],"domain_scores_gemma":[0.999326,0.00024284462,0.00006361582,0.00015819284,0.00010717081,0.00010214837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006158143,0.0004244897,0.000549597,0.0013834613,0.0025724876,0.0018230017,0.00090854464,0.0009335655,0.009732243],"category_scores_gemma":[0.0014907009,0.00048394012,0.0008781943,0.0009547653,0.0016555925,0.0032332204,0.0023489795,0.0016078377,0.0018707803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004274323,0.00002319722,0.00012147927,0.00002749085,0.0000038139524,0.00014063876,0.00040946522,0.00027793652,0.003977606,0.9869126,0.00061804446,0.0074450714],"study_design_scores_gemma":[0.000014926541,0.000035229496,0.00019329453,0.000018511177,0.000012498083,0.00026387797,0.0002854366,0.0027027095,0.007537144,0.97928154,0.009630983,0.000023902801],"about_ca_topic_score_codex":0.00035337644,"about_ca_topic_score_gemma":0.00042823254,"teacher_disagreement_score":0.009732243,"about_ca_system_score_codex":0.0005608786,"about_ca_system_score_gemma":0.0004255583,"threshold_uncertainty_score":0.032557607},"labels":[],"label_agreement":null},{"id":"W2989980706","doi":"10.3233/fi-2020-1875","title":"Insertions Yielding Equivalent Double Occurrence Words","year":2019,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Word (group theory); Symbol (formal); Palindrome; Mathematics; Computer science; Arithmetic; Characterization (materials science); Combinatorics; Geometry; Physics","score_opus":0.02152212203726644,"score_gpt":0.2566209218273727,"score_spread":0.23509879979010628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989980706","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49082622,0.0005160753,0.4605311,0.00032565786,0.00033123515,0.00018730087,0.0005669173,0.0017395192,0.044976067],"genre_scores_gemma":[0.82874876,0.00032727106,0.15150984,0.00028119428,0.00013430882,0.00021124928,0.0010367616,0.00079996267,0.016950808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984693,0.00024982388,0.0001884051,0.0004656028,0.00035309693,0.00027370514],"domain_scores_gemma":[0.9969408,0.0013985706,0.00035336858,0.00065231894,0.0004697572,0.00018521151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006772423,0.0005921958,0.0005587363,0.000898066,0.0009666,0.0016091197,0.0007258118,0.00088573823,0.007193396],"category_scores_gemma":[0.0050955135,0.0005236926,0.0010293291,0.0006490942,0.0014897847,0.0025006498,0.0024220287,0.00097238447,0.0020439355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050423236,0.00018619398,0.0031380947,0.00046403095,0.00004757671,0.0040538106,0.0022781407,0.0059831645,0.07947075,0.80012804,0.0033965798,0.100349486],"study_design_scores_gemma":[0.00010188635,0.00033123998,0.0015477365,0.0001136061,0.00012326885,0.0045387154,0.0008969742,0.026189178,0.08596006,0.81909394,0.06100593,0.00009764239],"about_ca_topic_score_codex":0.00018562534,"about_ca_topic_score_gemma":0.00023862542,"teacher_disagreement_score":0.007193396,"about_ca_system_score_codex":0.0005052899,"about_ca_system_score_gemma":0.00041228923,"threshold_uncertainty_score":0.024064302},"labels":[],"label_agreement":null},{"id":"W2991381026","doi":"10.1016/j.tcs.2019.11.022","title":"Unique decipherability in formal languages","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chomsky hierarchy; Undecidable problem; Unique factorization domain; Combinatorics; Mathematics; Context (archaeology); Multiset; Factorization; Regular language; Word (group theory); Hierarchy; Context-free language; Formal language; Discrete mathematics; Philosophy of language; Computer science; Decidability; Artificial intelligence; Rule-based machine translation; Automaton; Philosophy; Algorithm","score_opus":0.004845414963894193,"score_gpt":0.2447670603921896,"score_spread":0.23992164542829542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991381026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47493434,0.0017411748,0.4784334,0.0026584268,0.000396272,0.000093738025,0.0003387177,0.0012552288,0.04014882],"genre_scores_gemma":[0.9740355,0.00035657524,0.019229116,0.00024006247,0.00016523706,0.000069002286,0.000116485746,0.0001854438,0.0056025037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959894,0.0010405175,0.00038852345,0.0012015568,0.00075575465,0.00062433095],"domain_scores_gemma":[0.9734361,0.018236458,0.0019642196,0.0037556726,0.0016418807,0.00096557324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002714149,0.00060901034,0.0015918162,0.0023423366,0.002720081,0.0052677216,0.0014924593,0.0019754076,0.0051360237],"category_scores_gemma":[0.01755955,0.0010889854,0.0013222522,0.0018102481,0.0072235186,0.013822989,0.005029008,0.004597838,0.00067529525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005894945,0.000017134455,0.00034369715,0.000064198124,0.000008611514,0.00017585483,0.00084300584,0.0014400133,0.00088808325,0.98726386,0.00044967042,0.008446898],"study_design_scores_gemma":[0.000009665426,0.000012321168,0.00006838885,0.000013471508,0.000010036411,0.00018468866,0.00011449548,0.0029673213,0.0011363124,0.9945977,0.00087085593,0.000014770506],"about_ca_topic_score_codex":0.00040484063,"about_ca_topic_score_gemma":0.00027183953,"teacher_disagreement_score":0.0052677216,"about_ca_system_score_codex":0.0013793634,"about_ca_system_score_gemma":0.0010603853,"threshold_uncertainty_score":0.017181695},"labels":[],"label_agreement":null},{"id":"W2994108360","doi":"10.37236/2018","title":"Christoffel Words and the Calkin-Wilf Tree","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Christoffel symbols; Noncommutative geometry; Tree (set theory); Combinatorics; Duality (order theory); Rational number; Pure mathematics","score_opus":0.0079640133193285,"score_gpt":0.1884078611678091,"score_spread":0.1804438478484806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994108360","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65858024,0.0035782892,0.169973,0.001941677,0.0004375674,0.000049612918,0.00040970536,0.00037510417,0.16465476],"genre_scores_gemma":[0.9679593,0.0009474921,0.01504915,0.00023325911,0.0003172935,0.000032401425,0.00014130554,0.00007021693,0.015249614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961084,0.000051807016,0.000017006081,0.000081241575,0.00013248855,0.000106607695],"domain_scores_gemma":[0.9993074,0.000302073,0.00010600909,0.000059879316,0.00011514862,0.000109423425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046066256,0.00029831688,0.00035720025,0.0018192441,0.0017031449,0.0017521833,0.00048729315,0.0006893287,0.005626596],"category_scores_gemma":[0.0015651552,0.00019222603,0.00033776925,0.0013672528,0.002349138,0.0044342494,0.00094971055,0.0012191603,0.00081849186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008293108,0.000003885575,0.00007590161,0.000010897145,0.0000010265668,0.000047999507,0.00015312221,0.0002004184,0.0004179682,0.99631894,0.00029630543,0.0024652143],"study_design_scores_gemma":[0.000005283404,0.000011310683,0.00024854022,0.00000979336,0.0000035400299,0.00014352203,0.00015031517,0.0013167321,0.0007391271,0.9899401,0.0074194,0.0000123303735],"about_ca_topic_score_codex":0.00093556894,"about_ca_topic_score_gemma":0.00081862556,"teacher_disagreement_score":0.005626596,"about_ca_system_score_codex":0.0011493284,"about_ca_system_score_gemma":0.0004887187,"threshold_uncertainty_score":0.01882279},"labels":[],"label_agreement":null},{"id":"W2995334287","doi":"10.1016/j.ic.2021.104689","title":"Maximal state complexity and generalized de Bruijn words","year":2021,"lang":"en","type":"preprint","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"De Bruijn sequence; Generalization; Word (group theory); State (computer science); Mathematics; Word length; Combinatorics; Computer science; Discrete mathematics; Algorithm; Natural language processing","score_opus":0.024555745477797198,"score_gpt":0.2641879211985905,"score_spread":0.23963217572079332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995334287","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6742356,0.0023255001,0.22876401,0.0051817787,0.00023728854,0.00009438174,0.0013347158,0.00036264624,0.08746408],"genre_scores_gemma":[0.9788047,0.0004775754,0.011886727,0.0001651135,0.0002513096,0.00008123417,0.00041193608,0.00007396709,0.007847428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771047,0.00065499643,0.00014701099,0.0005360383,0.0005955734,0.00035596755],"domain_scores_gemma":[0.98460096,0.012321145,0.0007428019,0.0010760317,0.0007024241,0.00055657484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001612331,0.00061757164,0.0013764467,0.0019689072,0.001964406,0.007002456,0.0013832848,0.0016735721,0.009071774],"category_scores_gemma":[0.009597116,0.0007087607,0.0010646482,0.0025861643,0.0044379365,0.011096188,0.0021505952,0.0028867468,0.0005810457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048006914,0.000021569762,0.0002684711,0.00004050066,0.000008545284,0.000047102894,0.00021741475,0.0030794975,0.000501828,0.9925632,0.00055646495,0.0026474039],"study_design_scores_gemma":[0.0000057623906,0.0000035367375,0.00010235554,0.000004943196,0.000004555063,0.000023266193,0.000025299521,0.00682328,0.00028060065,0.9922874,0.00043233577,0.000006676533],"about_ca_topic_score_codex":0.0012359729,"about_ca_topic_score_gemma":0.0010949444,"teacher_disagreement_score":0.009071774,"about_ca_system_score_codex":0.0025952638,"about_ca_system_score_gemma":0.0010818265,"threshold_uncertainty_score":0.030348063},"labels":[],"label_agreement":null},{"id":"W2997558551","doi":"10.1051/ita/2020006","title":"The weak circular repetition threshold over large alphabets","year":2020,"lang":"en","type":"preprint","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Repetition (rhetorical device); Physics; Combinatorics; Infimum and supremum; Mathematics; Philosophy","score_opus":0.010011638184957341,"score_gpt":0.2504297073528558,"score_spread":0.24041806916789846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997558551","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7884979,0.0013809674,0.16632876,0.0013227281,0.00013452626,0.000060618677,0.00038941842,0.0011783541,0.040706642],"genre_scores_gemma":[0.98571175,0.00017622167,0.011395004,0.00016366201,0.00012486494,0.000063390944,0.00011578556,0.00007112704,0.0021781712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971148,0.00047072273,0.00024519136,0.00088968483,0.0008229483,0.00045664317],"domain_scores_gemma":[0.98149645,0.011331795,0.002014982,0.002392148,0.00152941,0.0012352417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019390419,0.00039546544,0.000680059,0.0016430574,0.0010571731,0.0026521473,0.0010093056,0.0009447887,0.0023304373],"category_scores_gemma":[0.014394758,0.00045081915,0.00057834195,0.00083074055,0.0034164463,0.0041034743,0.0026852435,0.00153733,0.00078005187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005041006,0.000060247872,0.005667812,0.00024262302,0.000034522956,0.0005840207,0.001228882,0.01637803,0.057755187,0.89022094,0.0018147925,0.025508817],"study_design_scores_gemma":[0.000050932285,0.00018244458,0.0029533398,0.000048939404,0.000038189322,0.00073306233,0.00029705637,0.0665322,0.02782285,0.89555097,0.0057010944,0.00008893021],"about_ca_topic_score_codex":0.0005243759,"about_ca_topic_score_gemma":0.0002457996,"teacher_disagreement_score":0.0026521473,"about_ca_system_score_codex":0.0011160664,"about_ca_system_score_gemma":0.00079242996,"threshold_uncertainty_score":0.010254741},"labels":[],"label_agreement":null},{"id":"W2998391309","doi":"10.48550/arxiv.1912.12992","title":"A Note on the Parallel Cleaning of Cliques","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Clique; Conjecture; Computer science; Upper and lower bounds; Combinatorics; Mathematics; Parallel computing; Theoretical computer science; Mathematical analysis","score_opus":0.06377983943882734,"score_gpt":0.19165351717713636,"score_spread":0.12787367773830902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998391309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12131706,0.0045036413,0.7757092,0.03763904,0.0043028644,0.000422568,0.00089989963,0.0033772397,0.05182851],"genre_scores_gemma":[0.48630977,0.002165603,0.46696532,0.004686322,0.0019375413,0.00065318,0.0010732096,0.0018033177,0.034405768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958033,0.00088269764,0.00018192925,0.0013005482,0.0012511682,0.0005803164],"domain_scores_gemma":[0.9524699,0.027469179,0.0011474792,0.014567041,0.002206824,0.002139566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050769555,0.00087395,0.0016768337,0.0013301052,0.0038716102,0.002677035,0.0043172208,0.0030777976,0.01788502],"category_scores_gemma":[0.03291776,0.0009928987,0.0026944715,0.0013221243,0.0056984755,0.011936373,0.0080364905,0.010523459,0.003024529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012672736,0.00046751153,0.0044873813,0.0010644883,0.00019561868,0.00087355817,0.0015722989,0.052105725,0.065348014,0.661821,0.057442434,0.15335464],"study_design_scores_gemma":[0.00015058322,0.00026970997,0.001411804,0.00011001501,0.000073695235,0.00054264447,0.00038697317,0.115997374,0.023335448,0.7865765,0.071064614,0.00008070022],"about_ca_topic_score_codex":0.0022506455,"about_ca_topic_score_gemma":0.0028185637,"teacher_disagreement_score":0.01788502,"about_ca_system_score_codex":0.0012931506,"about_ca_system_score_gemma":0.001245981,"threshold_uncertainty_score":0.05983138},"labels":[],"label_agreement":null},{"id":"W2999574320","doi":"10.1016/j.tcs.2018.05.036","title":"On store languages of language acceptors","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Pushdown automaton; Computer science; Nondeterministic algorithm; Regular language; Programming language; Nondeterministic finite automaton; Set (abstract data type); Finite-state machine; Theoretical computer science; Automaton; Automata theory","score_opus":0.005652122416816928,"score_gpt":0.2664795864860257,"score_spread":0.26082746406920876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999574320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21717438,0.0016203948,0.6883136,0.00652625,0.0008741674,0.00023027278,0.0013374359,0.0019142708,0.08200912],"genre_scores_gemma":[0.85035706,0.0013380819,0.07016833,0.0015763586,0.0009288221,0.00042461295,0.0015544329,0.0017628201,0.07188955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973701,0.0007408718,0.00022886878,0.0005125933,0.00060670363,0.00054075394],"domain_scores_gemma":[0.9863332,0.009063608,0.00057804555,0.0017303099,0.0015233903,0.00077143667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035773355,0.0011977684,0.0018572755,0.002610222,0.003711029,0.00837465,0.0027868159,0.0030200148,0.018646343],"category_scores_gemma":[0.014657131,0.0016184573,0.0026082278,0.0028645888,0.006767184,0.021204853,0.006835389,0.005665912,0.0026447137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006563926,0.000023840894,0.00017211227,0.000037607242,0.00000604132,0.000072248506,0.00058404537,0.0010472636,0.0004743492,0.993386,0.0010044081,0.003126513],"study_design_scores_gemma":[0.0000178892,0.000015567939,0.00005095202,0.000018240138,0.000012117872,0.000051750896,0.0001541176,0.0052085505,0.00034038693,0.99202526,0.0020918068,0.000013286521],"about_ca_topic_score_codex":0.0027247379,"about_ca_topic_score_gemma":0.0027282736,"teacher_disagreement_score":0.018646343,"about_ca_system_score_codex":0.0023498745,"about_ca_system_score_gemma":0.001983201,"threshold_uncertainty_score":0.062378168},"labels":[],"label_agreement":null},{"id":"W3000096852","doi":"10.1007/s00220-021-03979-2","title":"Gibbsian Representations of Continuous Specifications: The Theorems of Kozlov and Sullivan Revisited","year":2021,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Israel Science Foundation; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Lattice (music); Characterization (materials science); Algebra over a field; Complete lattice; Uniform continuity; Continuous function (set theory)","score_opus":0.06212556313151681,"score_gpt":0.3152315522961542,"score_spread":0.2531059891646374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000096852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13464053,0.005424941,0.6818536,0.020603497,0.00091648253,0.00007407133,0.0006421191,0.00059483916,0.15524997],"genre_scores_gemma":[0.94265443,0.0019885595,0.038429845,0.0015477695,0.0008803979,0.00010691996,0.00020538217,0.00020087435,0.013985701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822813,0.0006070044,0.000108727814,0.0003281136,0.0005332355,0.00019471481],"domain_scores_gemma":[0.99210185,0.0052712313,0.00040689975,0.0012906643,0.0006488624,0.00028055513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041681933,0.00060014986,0.001329408,0.0017605812,0.0017626993,0.005332777,0.0021818972,0.003017252,0.007508456],"category_scores_gemma":[0.013869961,0.0007499712,0.0013921069,0.002608826,0.008310291,0.014576372,0.004205965,0.0064706802,0.00059705303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023553991,0.0000015106704,0.0000125422985,0.0000047601607,9.827056e-7,0.000004262905,0.000063675914,0.00013801313,0.000025392961,0.99891055,0.00016074501,0.0006751966],"study_design_scores_gemma":[0.0000034910124,0.0000016778216,0.00001330987,0.0000034356115,0.0000014491657,0.0000072615944,0.000021719841,0.0009909684,0.0000391933,0.9982786,0.00063598296,0.0000029151063],"about_ca_topic_score_codex":0.0023792915,"about_ca_topic_score_gemma":0.0015306459,"teacher_disagreement_score":0.007508456,"about_ca_system_score_codex":0.0028024337,"about_ca_system_score_gemma":0.0015311248,"threshold_uncertainty_score":0.025118291},"labels":[],"label_agreement":null},{"id":"W3000349095","doi":"10.37236/909","title":"For each $\\alpha &gt; 2$ there is an Infinite Binary Word with Critical Exponent $\\alpha$","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Infimum and supremum; Exponent; Mathematics; Alpha (finance); Combinatorics; Word (group theory); Binary number; Critical exponent; Discrete mathematics; Arithmetic; Statistics; Geometry","score_opus":0.019762076447317534,"score_gpt":0.25544231610733475,"score_spread":0.23568023966001722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000349095","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6824678,0.0023618315,0.16845833,0.0043608216,0.0010988456,0.00016007789,0.001279746,0.00095095066,0.13886155],"genre_scores_gemma":[0.9041,0.0009517844,0.05678061,0.0006407632,0.00061322085,0.00020375915,0.00075224735,0.0004058697,0.035551723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995937,0.000039947165,0.000029726243,0.00013508709,0.00008037292,0.00012127666],"domain_scores_gemma":[0.9983296,0.0007943963,0.00021305717,0.000122031364,0.00030403642,0.00023694555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038552957,0.00087632606,0.0006967856,0.0010879164,0.001571532,0.0024598727,0.00054095255,0.00090429286,0.008086525],"category_scores_gemma":[0.0018711977,0.0004177614,0.00051727373,0.0008448416,0.0022858602,0.004067187,0.001580459,0.0019694655,0.0017837428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007909245,0.00011819858,0.003124896,0.0004387022,0.000041253013,0.0025251925,0.002401185,0.0007547425,0.07177786,0.866151,0.009069729,0.042806365],"study_design_scores_gemma":[0.00008944086,0.00011609075,0.003876403,0.00016383274,0.000060227427,0.0026270973,0.0010150404,0.0055348845,0.02759278,0.89940226,0.059440378,0.00008141213],"about_ca_topic_score_codex":0.0005015762,"about_ca_topic_score_gemma":0.000556855,"teacher_disagreement_score":0.008086525,"about_ca_system_score_codex":0.00084635476,"about_ca_system_score_gemma":0.00044940048,"threshold_uncertainty_score":0.027052164},"labels":[],"label_agreement":null},{"id":"W3000767751","doi":"10.1016/j.jcss.2017.05.011","title":"Complexity of suffix-free regular languages","year":2017,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowe Centrum Nauki","keywords":"Suffix; Regular language; Computer science; Abstract family of languages; Mathematics; Programming language; Theoretical computer science; Linguistics; Second-generation programming language; Automaton; Fifth-generation programming language; Philosophy","score_opus":0.03649435107061784,"score_gpt":0.28232251809877423,"score_spread":0.2458281670281564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000767751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8624281,0.0006455115,0.100573935,0.004884983,0.000096496384,0.000085248605,0.0015042768,0.00046258623,0.029318783],"genre_scores_gemma":[0.9842808,0.00024640257,0.007938661,0.00017966611,0.00018402045,0.000069862006,0.0009091356,0.00010623628,0.006085276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968321,0.000710387,0.00023792645,0.0005740744,0.0011674752,0.00047810024],"domain_scores_gemma":[0.96568763,0.028209522,0.001701802,0.001633536,0.0013280186,0.0014394362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016979405,0.00055222807,0.001383317,0.0017571219,0.0016515165,0.0075252815,0.0024746659,0.001874934,0.013317219],"category_scores_gemma":[0.018060712,0.000777748,0.0014005123,0.0019313094,0.0029421118,0.012887989,0.0027917165,0.0026577446,0.00084543513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006265596,0.00024384567,0.005300948,0.0003024273,0.000081090846,0.00048594436,0.0017581579,0.041646913,0.0051873866,0.9228828,0.0041093547,0.017374618],"study_design_scores_gemma":[0.00005252103,0.000031072217,0.0007433135,0.00001125299,0.000023978166,0.00020166035,0.00016695305,0.06985483,0.0010095893,0.92701215,0.0008658944,0.000026701151],"about_ca_topic_score_codex":0.0015209009,"about_ca_topic_score_gemma":0.0015455642,"teacher_disagreement_score":0.013317219,"about_ca_system_score_codex":0.002606095,"about_ca_system_score_gemma":0.0019177664,"threshold_uncertainty_score":0.044550538},"labels":[],"label_agreement":null},{"id":"W3003895073","doi":"10.48550/arxiv.2001.11763","title":"Lengths of extremal square-free ternary words","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ternary operation; Square (algebra); Square-free integer; Mathematics; Combinatorics; Statistics; Computer science; Geometry","score_opus":0.06753658856910162,"score_gpt":0.18090390546365465,"score_spread":0.11336731689455302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003895073","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9235215,0.0014852108,0.052909013,0.00050488405,0.00013696209,0.00003139023,0.00074276485,0.0002976618,0.020370685],"genre_scores_gemma":[0.97915053,0.00029980665,0.01742581,0.00007090104,0.00010076128,0.000066337845,0.00037613607,0.00010400154,0.0024058067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989843,0.00018061615,0.00012862931,0.00028959374,0.0002564599,0.00016033034],"domain_scores_gemma":[0.9947918,0.0028057408,0.0009156007,0.00039793676,0.0006052397,0.0004835568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005713214,0.0003591108,0.00039583,0.0014429038,0.001052897,0.0018049567,0.000645605,0.00075924175,0.004496994],"category_scores_gemma":[0.0071278512,0.00047336114,0.0003461838,0.0009079099,0.0015055721,0.0022405153,0.001311483,0.00076224486,0.0005567746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007702155,0.0000812847,0.0074005127,0.000619339,0.00006729767,0.00091418007,0.0014263951,0.01824838,0.048754025,0.87489665,0.0034105023,0.043411296],"study_design_scores_gemma":[0.000053313408,0.00017775458,0.004855241,0.00011686694,0.00006346248,0.001622824,0.0007286551,0.047060452,0.02662016,0.9068503,0.011714212,0.00013674537],"about_ca_topic_score_codex":0.0001479053,"about_ca_topic_score_gemma":0.00020117115,"teacher_disagreement_score":0.004496994,"about_ca_system_score_codex":0.0007143231,"about_ca_system_score_gemma":0.00033758092,"threshold_uncertainty_score":0.015043914},"labels":[],"label_agreement":null},{"id":"W3004372759","doi":"10.24963/ijcai.2020/203","title":"Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem","year":2020,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Carleton University; University of Waterloo","funders":"","keywords":"Mathematical proof; Satisfiability; Boolean satisfiability problem; Conjunctive normal form; Symbolic computation; Terabyte; Resolution (logic)","score_opus":0.01563664605867351,"score_gpt":0.23311389027598106,"score_spread":0.21747724421730755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004372759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4251451,0.0020553956,0.45881686,0.018376665,0.00058712804,0.0005530659,0.0021176208,0.003721282,0.08862694],"genre_scores_gemma":[0.8462677,0.0009445997,0.13483232,0.0020091906,0.00025646377,0.00031788755,0.00144327,0.00038431722,0.013544337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708956,0.0009479537,0.00019715221,0.00034936416,0.0009290399,0.00048691238],"domain_scores_gemma":[0.9846171,0.01263697,0.00062449736,0.000790014,0.0010708189,0.0002605123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029888165,0.00054622366,0.00060508813,0.0012110261,0.0021219926,0.001980693,0.0016450853,0.0011900533,0.011148292],"category_scores_gemma":[0.018806001,0.00068651285,0.0014049568,0.0015773501,0.0027933551,0.004118164,0.0027984548,0.0039551593,0.0013628502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050236203,0.00023860362,0.005028037,0.0010606487,0.00010448582,0.0021128072,0.0023052832,0.014074836,0.010069601,0.87233865,0.024491053,0.067673706],"study_design_scores_gemma":[0.00025664023,0.00015709031,0.0013494403,0.00019811298,0.00012228198,0.0010055851,0.001089767,0.063588135,0.019169828,0.8795036,0.033469748,0.00008989352],"about_ca_topic_score_codex":0.0036071916,"about_ca_topic_score_gemma":0.0035547568,"teacher_disagreement_score":0.011148292,"about_ca_system_score_codex":0.0029933068,"about_ca_system_score_gemma":0.0031904231,"threshold_uncertainty_score":0.037294805},"labels":[],"label_agreement":null},{"id":"W3005704136","doi":"10.5802/jtnb.1135","title":"The upper density of an automatic set is rational","year":2020,"lang":"fr","type":"preprint","venue":"Journal de Théorie des Nombres de Bordeaux","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Natural density; Natural number; Upper and lower bounds; Rational number; Mathematics; Set (abstract data type); Combinatorics; BETA (programming language); Alpha (finance); Discrete mathematics; Natural (archaeology); Computer science; Statistics; Mathematical analysis","score_opus":0.028402395063456556,"score_gpt":0.2867220647542983,"score_spread":0.25831966969084175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005704136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.344904,0.00071492296,0.5083274,0.0022517988,0.0002064075,0.00009712396,0.001157133,0.0034053486,0.13893594],"genre_scores_gemma":[0.9326426,0.00040284716,0.050837334,0.00032115722,0.00021447595,0.00020030784,0.000906943,0.00041321493,0.014061277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964139,0.00046442327,0.00018546561,0.0008410007,0.0014983776,0.00059687294],"domain_scores_gemma":[0.99055636,0.006475749,0.00044756083,0.0010249799,0.0010447677,0.0004505913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017333571,0.000856189,0.0011127462,0.003880523,0.0020615493,0.005631178,0.001334732,0.0010723594,0.012430093],"category_scores_gemma":[0.014308164,0.0007643758,0.0017193314,0.0020646967,0.005993329,0.00781725,0.003330345,0.002526899,0.002208785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006263907,0.000021072261,0.00091185264,0.000060145267,0.000012503202,0.00009019149,0.000343071,0.0029749756,0.001766043,0.9798789,0.001830781,0.012047911],"study_design_scores_gemma":[0.000017118264,0.00003678724,0.0014066512,0.00005645675,0.000028775426,0.0002730592,0.00022002697,0.034276515,0.0044523734,0.95124304,0.007927149,0.00006211605],"about_ca_topic_score_codex":0.0037618913,"about_ca_topic_score_gemma":0.0030181475,"teacher_disagreement_score":0.012430093,"about_ca_system_score_codex":0.003001682,"about_ca_system_score_gemma":0.0012998756,"threshold_uncertainty_score":0.041582823},"labels":[],"label_agreement":null},{"id":"W3006271837","doi":"10.3390/math8020240","title":"Unicyclic Graphs Whose Completely Regular Endomorphisms form a Monoid","year":2020,"lang":"en","type":"article","venue":"Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Henan University; University of Waterloo; Henan University of Science and Technology; National Natural Science Foundation of China","keywords":"Endomorphism; Monoid; Combinatorics; Mathematics; Graph; Integer (computer science); Discrete mathematics; Computer science","score_opus":0.03347713955722071,"score_gpt":0.22032938706903338,"score_spread":0.18685224751181267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006271837","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8905225,0.0010024693,0.08231223,0.00031386185,0.00014860259,0.00007672654,0.00032595967,0.00017964735,0.025117982],"genre_scores_gemma":[0.9727788,0.00027887683,0.021600626,0.000113109556,0.000044287077,0.00005285305,0.00034711746,0.000022793856,0.004761541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994524,0.00010024706,0.00005412412,0.00017564284,0.00010964218,0.00010799422],"domain_scores_gemma":[0.9983742,0.00050095917,0.00031509253,0.0002669719,0.00025212235,0.0002906541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005259073,0.00025058447,0.00031379322,0.00079785817,0.0011903169,0.0010398118,0.00033865997,0.00035355956,0.0018214848],"category_scores_gemma":[0.0012334842,0.00025046387,0.00044868348,0.0004624193,0.001299594,0.0015763373,0.0014288165,0.00044227013,0.00023021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027168973,0.000066985165,0.005661771,0.00017349595,0.00003470031,0.00145833,0.0015659299,0.001571966,0.0334827,0.9235751,0.0013599709,0.030777378],"study_design_scores_gemma":[0.00007611309,0.00037516656,0.0075127226,0.00011365219,0.000095156145,0.0053740824,0.0018130887,0.012996137,0.027837351,0.88710356,0.05660262,0.00010040126],"about_ca_topic_score_codex":0.00037419263,"about_ca_topic_score_gemma":0.0006233865,"teacher_disagreement_score":0.0018214848,"about_ca_system_score_codex":0.0004940011,"about_ca_system_score_gemma":0.00043653802,"threshold_uncertainty_score":0.006093502},"labels":[],"label_agreement":null},{"id":"W3006400177","doi":"10.4153/s0008414x20000085","title":"Universal Alternating Semiregular Polytopes","year":2020,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Connection (principal bundle); Regular polygon; Group (periodic table); Quotient; Geometry; Physics","score_opus":0.017790368026394235,"score_gpt":0.19585083179491197,"score_spread":0.17806046376851775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006400177","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7597303,0.00012655885,0.1791088,0.00010440244,0.000040629722,0.00006302716,0.00019856231,0.00024473827,0.06038301],"genre_scores_gemma":[0.9699397,0.000059586546,0.022286957,0.000029555513,0.000020444311,0.000047329624,0.00019261535,0.000052981497,0.0073706643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949944,0.00008387389,0.000024601,0.00015088677,0.00016540739,0.000075852906],"domain_scores_gemma":[0.9996543,0.000057997513,0.00006985582,0.00010347905,0.000045851466,0.000068552916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018456498,0.00030689075,0.0003004155,0.0004693978,0.0005227198,0.0010201616,0.00047256917,0.0002709161,0.0052429456],"category_scores_gemma":[0.00052285637,0.0002083073,0.00048069295,0.00026946553,0.0016644662,0.00091714994,0.0012632092,0.0006985412,0.00045017846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091633534,0.0000424918,0.0011784486,0.000053243322,0.000020006177,0.00027633717,0.0002203167,0.0147524895,0.016743269,0.95330715,0.0006564855,0.012658],"study_design_scores_gemma":[0.00006170185,0.00027693005,0.004639409,0.000050684375,0.000037136582,0.0009993494,0.0007412001,0.15000686,0.020578692,0.7942785,0.028270496,0.00005902969],"about_ca_topic_score_codex":0.0006398958,"about_ca_topic_score_gemma":0.0006838115,"teacher_disagreement_score":0.0052429456,"about_ca_system_score_codex":0.0004513625,"about_ca_system_score_gemma":0.0001635804,"threshold_uncertainty_score":0.017539382},"labels":[],"label_agreement":null},{"id":"W3008205532","doi":"10.1007/978-3-030-40608-0_13","title":"Alternating Finite Automata with Limited Universal Branching","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computation; Bounded function; Tree (set theory); Automaton; Finite-state machine; Mathematics; Branching (polymer chemistry); Discrete mathematics; Algorithm; Computer science; Combinatorics; Theoretical computer science","score_opus":0.012989202170072269,"score_gpt":0.21414007564872947,"score_spread":0.2011508734786572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008205532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06747853,0.0013934382,0.77586234,0.0005611822,0.00039758877,0.00009258468,0.00048553027,0.0019223415,0.15180643],"genre_scores_gemma":[0.7334662,0.0011157735,0.17757335,0.0002640416,0.0002343363,0.00032103152,0.0006911741,0.0006364969,0.08569767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999343,0.00018878392,0.000056556477,0.0001534637,0.00018472015,0.000073415526],"domain_scores_gemma":[0.99816704,0.0011346121,0.00006657219,0.0003372579,0.000195486,0.00009905444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005215582,0.00064698374,0.00056531903,0.00056182,0.0008594351,0.0016376363,0.0012183198,0.0008361824,0.009864042],"category_scores_gemma":[0.0027937323,0.0005733133,0.00066401146,0.0007407855,0.0016149983,0.004481623,0.0021342137,0.0020910725,0.0025041397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064826905,0.000030472615,0.00014210361,0.0000873252,0.0000064911565,0.000135398,0.00028017606,0.0049345703,0.004846674,0.95676494,0.00169359,0.031013424],"study_design_scores_gemma":[0.000008695529,0.000019668694,0.000059418904,0.00002027347,0.000008377574,0.00017134029,0.000038324928,0.021474954,0.0029929064,0.96330875,0.011886009,0.000011402163],"about_ca_topic_score_codex":0.0003880219,"about_ca_topic_score_gemma":0.0004905204,"teacher_disagreement_score":0.009864042,"about_ca_system_score_codex":0.00069275626,"about_ca_system_score_gemma":0.00053570984,"threshold_uncertainty_score":0.032998502},"labels":[],"label_agreement":null},{"id":"W3010514372","doi":"10.4171/jems/1244","title":"A height gap theorem for coefficients of Mahler functions","year":2022,"lang":"en","type":"article","venue":"Journal of the European Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Conjecture; Logarithm; Product (mathematics); Function (biology); Algebraic number; Power series; Field (mathematics); Series (stratigraphy); Generating function; Function field; Mathematical analysis; Pure mathematics; Geometry","score_opus":0.022626436104440584,"score_gpt":0.23731925096609657,"score_spread":0.21469281486165598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010514372","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9065634,0.0007327293,0.06810842,0.00082179776,0.00007416872,0.000025826332,0.0001918993,0.0003333834,0.02314847],"genre_scores_gemma":[0.99122494,0.00024698972,0.005650258,0.000067015404,0.000096445045,0.000028447015,0.000101593156,0.00004913277,0.0025351732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995158,0.00007005828,0.00001748935,0.00009142657,0.00014629599,0.00015889594],"domain_scores_gemma":[0.9955433,0.0028273254,0.000396577,0.00035108146,0.00030952116,0.000572213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009964254,0.00045147477,0.0004456713,0.0018646998,0.00080198963,0.0020640513,0.0007285578,0.0005636603,0.0038068516],"category_scores_gemma":[0.008155878,0.00026610188,0.00052684476,0.000714875,0.0025773149,0.0042062267,0.0016760636,0.0014904183,0.0006366941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013957014,0.00003871958,0.0067240577,0.000106566375,0.000016971046,0.00034770058,0.0008945506,0.007007013,0.013767901,0.9558382,0.0013736412,0.013745205],"study_design_scores_gemma":[0.000034077457,0.00012686767,0.0038447354,0.000053645483,0.000022561491,0.00077865436,0.00038881216,0.08163434,0.01107098,0.8982208,0.0037693111,0.00005517814],"about_ca_topic_score_codex":0.0005217596,"about_ca_topic_score_gemma":0.00027029536,"teacher_disagreement_score":0.0038068516,"about_ca_system_score_codex":0.0008030353,"about_ca_system_score_gemma":0.00030559648,"threshold_uncertainty_score":0.012735188},"labels":[],"label_agreement":null},{"id":"W3010659905","doi":"10.1007/978-3-030-48516-0_7","title":"The State Complexity of Lexicographically Smallest Words and Computing Successors","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lexicographical order; Combinatorics; Mathematics; Alphabet; Word (group theory); State (computer science); Upper and lower bounds; Regular language; Successor cardinal; Discrete mathematics; Finite-state machine; Matching (statistics); Finite set; Algorithm; Automaton; Computer science; Geometry","score_opus":0.027792817311278778,"score_gpt":0.26906938661235347,"score_spread":0.2412765693010747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010659905","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70659226,0.0014013364,0.25815558,0.0046389364,0.00014768724,0.00013822032,0.002865274,0.00092117133,0.025139585],"genre_scores_gemma":[0.95166296,0.00056586706,0.040338006,0.0001640127,0.00019127467,0.00013612206,0.0016782354,0.00028413517,0.004979395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99572575,0.001034021,0.00040128888,0.0009482867,0.00126221,0.00062836293],"domain_scores_gemma":[0.9298513,0.060197253,0.0022581317,0.004433921,0.0019271199,0.0013322532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029482169,0.00068974664,0.0017150015,0.0029759451,0.0019186803,0.009603051,0.0030164933,0.0021414298,0.011859628],"category_scores_gemma":[0.03655278,0.001110643,0.002371674,0.0037845427,0.0040837815,0.02146669,0.00318485,0.003660836,0.0008541974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001444952,0.00026693262,0.008507467,0.0005856145,0.00012457612,0.00025491373,0.001530066,0.11414475,0.0060015437,0.8075461,0.005177465,0.05441559],"study_design_scores_gemma":[0.00003247867,0.00003519788,0.0008469393,0.000030903237,0.000046717974,0.000084036394,0.00015446593,0.16273296,0.0022207997,0.83305657,0.00072507665,0.000033971133],"about_ca_topic_score_codex":0.0030663365,"about_ca_topic_score_gemma":0.0032956786,"teacher_disagreement_score":0.011859628,"about_ca_system_score_codex":0.0034417117,"about_ca_system_score_gemma":0.0025999434,"threshold_uncertainty_score":0.0396744},"labels":[],"label_agreement":null},{"id":"W3012040074","doi":"10.4230/lipics.stacs.2020.16","title":"Existential Length Universality","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Universality (dynamical systems); Discrete mathematics; Bounded function; Upper and lower bounds; PSPACE; Exponential function; Binary number; Computational complexity theory; Algorithm; Arithmetic","score_opus":0.023378349384035317,"score_gpt":0.23238747961975506,"score_spread":0.20900913023571974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012040074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21557184,0.0030351342,0.7077844,0.009582424,0.00044747128,0.00024980932,0.0020208203,0.0033024477,0.058005564],"genre_scores_gemma":[0.90304655,0.0010714149,0.077581026,0.0016359795,0.0007778138,0.00022164267,0.0011392394,0.0007972234,0.013729105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933467,0.0011975449,0.00041883235,0.0030578717,0.00083105837,0.0011480434],"domain_scores_gemma":[0.97478783,0.017149933,0.0019702392,0.004100373,0.0008985686,0.0010930402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040907227,0.0010931044,0.0014459911,0.0014335096,0.0024502384,0.004283587,0.0036624346,0.0021606793,0.011836812],"category_scores_gemma":[0.022690242,0.0011935123,0.002814653,0.0017493181,0.007450569,0.021222379,0.009261435,0.0051599564,0.0014049261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027740482,0.00009173875,0.0033299786,0.0007046164,0.00009562091,0.0005338507,0.0014192713,0.021328924,0.0047311005,0.922902,0.005726784,0.038858734],"study_design_scores_gemma":[0.00004075991,0.00007266364,0.00058576587,0.000108236716,0.00009892986,0.00060563814,0.00032036862,0.035839666,0.0048554894,0.9390274,0.01838734,0.000057790574],"about_ca_topic_score_codex":0.0016556587,"about_ca_topic_score_gemma":0.0011506057,"teacher_disagreement_score":0.011836812,"about_ca_system_score_codex":0.003959471,"about_ca_system_score_gemma":0.0015674185,"threshold_uncertainty_score":0.039598048},"labels":[],"label_agreement":null},{"id":"W3017213921","doi":"10.1007/978-3-030-63591-6_7","title":"Exploring Tetris as a Transformation Semigroup","year":2021,"lang":"en","type":"preprint","venue":"Springer proceedings in mathematics & statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Iterated function; Simple (philosophy); Semigroup; Group (periodic table); Mathematics; Transformation (genetics); Abelian group; Mathematical economics; Computer science; Pure mathematics","score_opus":0.05983721058332027,"score_gpt":0.27009752060475956,"score_spread":0.2102603100214393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017213921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18299626,0.00082527305,0.6375517,0.0030795396,0.00034677645,0.000058913072,0.00026756103,0.00083650346,0.17403749],"genre_scores_gemma":[0.904441,0.00047962577,0.056140795,0.00024421673,0.00017508797,0.000060602633,0.00022050017,0.00033767827,0.037900478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964404,0.00012254539,0.000015817053,0.00008164911,0.000074888645,0.000061084975],"domain_scores_gemma":[0.99905616,0.0005342405,0.00007169011,0.00013709065,0.000092658505,0.00010815059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054651656,0.00042831278,0.0005540956,0.00074296584,0.0011836957,0.0026327993,0.00080491195,0.0009492004,0.015465927],"category_scores_gemma":[0.0018042705,0.00036621597,0.00092712214,0.0006762072,0.002573661,0.00432093,0.001796309,0.0016556556,0.0016453837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012005619,0.0000058135165,0.00006757372,0.000009165766,0.000001919837,0.00004940608,0.00014903203,0.0010190462,0.0005238226,0.9952408,0.00026432826,0.0026571658],"study_design_scores_gemma":[0.000006677817,0.000013187711,0.000036225123,0.000004424362,0.0000026011965,0.00006159769,0.00012219173,0.011410103,0.0003537239,0.9844195,0.0035654225,0.000004332618],"about_ca_topic_score_codex":0.0010263622,"about_ca_topic_score_gemma":0.00074875576,"teacher_disagreement_score":0.015465927,"about_ca_system_score_codex":0.0009259753,"about_ca_system_score_gemma":0.00059945526,"threshold_uncertainty_score":0.05173862},"labels":[],"label_agreement":null},{"id":"W3025609620","doi":"10.1016/j.disc.2020.111958","title":"Sum-free sets generated by the period-<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e22\" altimg=\"si8.svg\"><mml:mi>k</mml:mi></mml:math>-folding sequences and some Sturmian sequences","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"China Scholarship Council; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Sequence (biology); Generalization; Period (music); Folding (DSP implementation); Set (abstract data type); Discrete mathematics; Algorithm; Computer science; Mathematical analysis","score_opus":0.022021716403563683,"score_gpt":0.24535637632110602,"score_spread":0.22333465991754234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025609620","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42260003,0.0011187239,0.39805758,0.0011005417,0.0006585893,0.00011317539,0.0019879465,0.0010632757,0.1733002],"genre_scores_gemma":[0.8848902,0.0003748413,0.047746908,0.0003049741,0.00021669998,0.00022605444,0.0016688913,0.0003218497,0.064249545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994343,0.000121925696,0.00005042229,0.00014621082,0.00014510677,0.000102066064],"domain_scores_gemma":[0.99878746,0.0004888635,0.000120678895,0.00015871537,0.00029037485,0.00015383308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006392517,0.0005114051,0.00042255843,0.001560725,0.0015647992,0.0019549532,0.0007242133,0.00048556665,0.012147576],"category_scores_gemma":[0.0018215352,0.00031828313,0.0007403684,0.00082415616,0.0012817774,0.0020718982,0.0013253613,0.000828604,0.0023661316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000918955,0.000022113994,0.0005133919,0.00007317443,0.000017515278,0.00023225683,0.0004891836,0.0011019602,0.0041555353,0.97694457,0.0023499874,0.014008423],"study_design_scores_gemma":[0.000022608765,0.000036316487,0.00072587107,0.000031936877,0.000019948911,0.00046050263,0.00020546006,0.006523349,0.0062934095,0.9732238,0.012428498,0.000028368106],"about_ca_topic_score_codex":0.00030895366,"about_ca_topic_score_gemma":0.0004895553,"teacher_disagreement_score":0.012147576,"about_ca_system_score_codex":0.00077485404,"about_ca_system_score_gemma":0.00052377145,"threshold_uncertainty_score":0.040637672},"labels":[],"label_agreement":null},{"id":"W3026005886","doi":"10.1016/j.tcs.2019.06.024","title":"State grammars with stores","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Embedded pushdown automaton; Rule-based machine translation; Tree-adjoining grammar; L-attributed grammar; Bounded function; State (computer science); Phrase structure grammar; Indexed grammar; Context-sensitive grammar; Terminal and nonterminal symbols; Context-free grammar; Mathematics; Definite clause grammar; Production (economics); Computer science; Algorithm; Artificial intelligence","score_opus":0.0037112011740026846,"score_gpt":0.20199407623767815,"score_spread":0.19828287506367548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026005886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03316611,0.0006734469,0.81715345,0.0028982498,0.00064456946,0.00024385945,0.0027037417,0.0074344995,0.13508208],"genre_scores_gemma":[0.6377265,0.0010989408,0.20953342,0.001068791,0.00055818475,0.00057386287,0.003592442,0.0039335713,0.14191423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797255,0.00047675887,0.00018983611,0.00061213115,0.00051035767,0.0002383641],"domain_scores_gemma":[0.9967777,0.0012642728,0.00010847162,0.0013005942,0.0004063113,0.000142702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001195146,0.0011435143,0.0012345356,0.0017802006,0.0025769817,0.0062264004,0.0017162896,0.0019571558,0.027763536],"category_scores_gemma":[0.0045984336,0.0015277293,0.0019965484,0.002806869,0.0045144577,0.012110593,0.0047697416,0.0038261316,0.010790139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026241605,0.000016608003,0.000092167706,0.000034535642,0.00000804795,0.00007763187,0.00031518575,0.00097010046,0.00058822933,0.9847162,0.0026401267,0.010515013],"study_design_scores_gemma":[0.000010713775,0.0000076168712,0.000028346703,0.000012925917,0.00001529222,0.00006635888,0.00006434718,0.0034048841,0.0011949596,0.9800552,0.015125497,0.000013908489],"about_ca_topic_score_codex":0.0019512055,"about_ca_topic_score_gemma":0.0017339843,"teacher_disagreement_score":0.027763536,"about_ca_system_score_codex":0.0014744399,"about_ca_system_score_gemma":0.0018188175,"threshold_uncertainty_score":0.09287834},"labels":[],"label_agreement":null},{"id":"W3026976675","doi":"10.1016/j.tcs.2020.10.029","title":"Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101","year":2020,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Characterization (materials science); Binary number; Mathematics; Least-squares function approximation; Combinatorics; Arithmetic; Statistics; Materials science; Nanotechnology","score_opus":0.012494494510200358,"score_gpt":0.23389598394775504,"score_spread":0.2214014894375547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026976675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.934747,0.0004149621,0.04513185,0.0006188643,0.000099231394,0.00007936241,0.002504581,0.00039682435,0.016007287],"genre_scores_gemma":[0.969422,0.00015073105,0.021930607,0.00016731012,0.00015564113,0.00016298052,0.003026505,0.00021102653,0.004773227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865156,0.00019123494,0.00016972184,0.0004451583,0.00034481264,0.00019748346],"domain_scores_gemma":[0.98040134,0.010755552,0.0040119807,0.0010924963,0.0021079849,0.0016305773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000897165,0.00050869735,0.00045345927,0.0020286583,0.0012895942,0.0029269657,0.0011786114,0.0010433642,0.005711309],"category_scores_gemma":[0.009898516,0.0005701915,0.0003918667,0.001347078,0.0016425522,0.0021290032,0.0010212546,0.0010992651,0.0011052997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0056316843,0.0006562256,0.059877377,0.0009907999,0.00015248435,0.0012944766,0.0038864536,0.019509122,0.17904727,0.6168911,0.0103798155,0.10168322],"study_design_scores_gemma":[0.00027504464,0.00094016205,0.045982134,0.00038530506,0.00024857835,0.0037282184,0.0028432934,0.18031672,0.1028283,0.61995846,0.04213898,0.000354828],"about_ca_topic_score_codex":0.0006788429,"about_ca_topic_score_gemma":0.00074567006,"teacher_disagreement_score":0.005711309,"about_ca_system_score_codex":0.0011530882,"about_ca_system_score_gemma":0.0012910787,"threshold_uncertainty_score":0.019106269},"labels":[],"label_agreement":null},{"id":"W3028589106","doi":"10.1142/s0129054121410094","title":"An Inequality for the Number of Periods in a Word","year":2021,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Waterloo","funders":"","keywords":"Word (group theory); Mathematics; Prefix; Square-free integer; Inequality; Exponent; Representation (politics); Discrete mathematics; Pure mathematics; Combinatorics; Mathematical analysis; Linguistics; Geometry; Law","score_opus":0.03514299275799944,"score_gpt":0.3783249735212547,"score_spread":0.3431819807632553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028589106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65347433,0.0023869686,0.26806557,0.002631366,0.00043527217,0.0001259602,0.000987822,0.00055848894,0.07133424],"genre_scores_gemma":[0.9511437,0.00054387597,0.03861637,0.00038246662,0.00050698465,0.00022317952,0.00036270448,0.0002564331,0.00796426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764663,0.00040062043,0.00021837972,0.0006718862,0.000620528,0.0004419864],"domain_scores_gemma":[0.98731637,0.008427879,0.0011185341,0.0011837783,0.0010750521,0.0008784534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025028095,0.00073171814,0.0009801852,0.0020506538,0.0016704313,0.002931354,0.0016715911,0.0011046665,0.006351796],"category_scores_gemma":[0.012337251,0.00063631526,0.00093584985,0.0010660645,0.0039110174,0.0076891896,0.0029654007,0.0022842763,0.0010470753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007458429,0.00009154285,0.006326208,0.00036676976,0.000076009244,0.0007341522,0.0010460177,0.0053422884,0.03374118,0.91543394,0.0026603132,0.03343581],"study_design_scores_gemma":[0.00008120899,0.00031228774,0.004556041,0.00012710052,0.0001111137,0.0010329548,0.00028023208,0.044943172,0.01499104,0.9240652,0.00939564,0.000104102015],"about_ca_topic_score_codex":0.00043436378,"about_ca_topic_score_gemma":0.0003975567,"teacher_disagreement_score":0.006351796,"about_ca_system_score_codex":0.0015856994,"about_ca_system_score_gemma":0.00077829475,"threshold_uncertainty_score":0.021248877},"labels":[],"label_agreement":null},{"id":"W3035317803","doi":"10.1016/j.tcs.2021.03.010","title":"The undirected repetition threshold and undirected pattern avoidance","year":2021,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Conjecture; Infimum and supremum; Mathematics; Word (group theory); Repetition (rhetorical device); Binary number; Discrete mathematics; Arithmetic; Geometry; Philosophy","score_opus":0.008529589075174234,"score_gpt":0.23205111697758085,"score_spread":0.22352152790240662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035317803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65361285,0.00111559,0.2539766,0.0031113648,0.00025860156,0.000058330555,0.0002902845,0.0005830241,0.08699329],"genre_scores_gemma":[0.97860056,0.0002645827,0.013845121,0.0002069434,0.00014846386,0.000049625127,0.00010090763,0.00007126704,0.006712519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993125,0.00017541906,0.00003745642,0.00018353804,0.00018270694,0.00010840038],"domain_scores_gemma":[0.9931457,0.00473996,0.00055671146,0.0006966834,0.000407596,0.00045336864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067753415,0.0002822541,0.0006299072,0.0009825882,0.00090096885,0.0021678281,0.001082837,0.0013789278,0.0056627938],"category_scores_gemma":[0.0068604206,0.00033492426,0.00042767543,0.0007263778,0.0024068044,0.003942657,0.0014602982,0.0016495506,0.0005089195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007012442,0.000035578523,0.00080731953,0.000065710774,0.000011344836,0.00018548658,0.00026430425,0.00472042,0.0049582436,0.9759034,0.0018845898,0.011093527],"study_design_scores_gemma":[0.000012464727,0.000010886661,0.00031884926,0.0000071720624,0.0000067802,0.00016428017,0.00005600786,0.02102562,0.0010567202,0.9764221,0.00090918445,0.0000100282],"about_ca_topic_score_codex":0.0005858958,"about_ca_topic_score_gemma":0.0004705902,"teacher_disagreement_score":0.0056627938,"about_ca_system_score_codex":0.00054528285,"about_ca_system_score_gemma":0.00051300525,"threshold_uncertainty_score":0.018943965},"labels":[],"label_agreement":null},{"id":"W3036081150","doi":"10.1142/s0219498821502005","title":"The reduced ring order and lower semi-lattices II","year":2020,"lang":"en","type":"article","venue":"Journal of Algebra and Its Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Ottawa","funders":"","keywords":"Mathematics; Bijection, injection and surjection; Commutative ring; Order (exchange); Ring (chemistry); Noncommutative ring; Power series; Von Neumann regular ring; Pure mathematics; Lattice (music); Category of rings; Polynomial ring; Commutative property; Series (stratigraphy); Combinatorics; Primitive ring; Principal ideal ring; Mathematical analysis; Chemistry","score_opus":0.013251322748289102,"score_gpt":0.23975800265973038,"score_spread":0.22650667991144127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036081150","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55657405,0.0045160674,0.1980772,0.003326718,0.000916567,0.000104307575,0.00039542373,0.00042193552,0.23566781],"genre_scores_gemma":[0.9543074,0.001024393,0.022665672,0.00025203408,0.00036051637,0.000035607045,0.00015218374,0.000049154638,0.021153104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993591,0.0001534265,0.000038016125,0.00012928706,0.00020786161,0.00011236051],"domain_scores_gemma":[0.99906355,0.0002695712,0.00013007547,0.0001863588,0.00019109974,0.00015938471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007889471,0.00020304947,0.0003392942,0.00072838634,0.0008009437,0.0023429953,0.00035410537,0.00025479108,0.005947045],"category_scores_gemma":[0.0012152276,0.00018826642,0.00043976496,0.00038064615,0.002813754,0.0032144897,0.0014039597,0.0012249151,0.00096987066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002778783,0.000013626086,0.00025890648,0.000038128223,0.0000038034473,0.00007632743,0.0002525821,0.0006332339,0.0015937522,0.9917687,0.00052448036,0.0048086434],"study_design_scores_gemma":[0.000012380778,0.00008621784,0.00067352515,0.000034728648,0.000010208967,0.0003697612,0.00033947267,0.005968509,0.004152497,0.9601608,0.028164491,0.000027520502],"about_ca_topic_score_codex":0.0005078645,"about_ca_topic_score_gemma":0.00036672308,"teacher_disagreement_score":0.005947045,"about_ca_system_score_codex":0.00072273583,"about_ca_system_score_gemma":0.0004883673,"threshold_uncertainty_score":0.019894898},"labels":[],"label_agreement":null},{"id":"W3036249117","doi":"10.3390/math8061009","title":"Endomorphism Spectra of Double Fan Graphs","year":2020,"lang":"en","type":"article","venue":"Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Henan University; University of Waterloo; Henan University of Science and Technology; National Natural Science Foundation of China","keywords":"Endomorphism; Mathematics; Graph; Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.030190528489661576,"score_gpt":0.22810860822804854,"score_spread":0.19791807973838696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036249117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8728965,0.00042054648,0.087749675,0.0003491602,0.0000778135,0.000035640194,0.00017747728,0.00014465713,0.03814847],"genre_scores_gemma":[0.9866981,0.00014500352,0.0092025455,0.000055893495,0.000036941656,0.000026271886,0.000079127196,0.000027773132,0.0037283802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949634,0.000081488244,0.000031090418,0.000116122406,0.00017987448,0.00009498662],"domain_scores_gemma":[0.9990276,0.00032088306,0.00014543986,0.00010987845,0.00022217637,0.00017397296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053892686,0.00031495432,0.00022796437,0.0018859934,0.0007397044,0.0013737619,0.00036395926,0.00037976218,0.0024211684],"category_scores_gemma":[0.0010438081,0.00020659575,0.00035960635,0.0005323579,0.0016361402,0.0023223844,0.00090826076,0.00078505,0.00017866933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051421604,0.000025504844,0.0017970058,0.000027230122,0.000006381254,0.00030404073,0.000624091,0.001007615,0.008734065,0.9785655,0.00038060793,0.008476551],"study_design_scores_gemma":[0.000020646256,0.000041431776,0.0030585881,0.00002462428,0.000009755438,0.000985448,0.00051679113,0.009543871,0.007392285,0.97044563,0.007929364,0.000031575775],"about_ca_topic_score_codex":0.00034887658,"about_ca_topic_score_gemma":0.0002381152,"teacher_disagreement_score":0.0024211684,"about_ca_system_score_codex":0.00070626865,"about_ca_system_score_gemma":0.00020267656,"threshold_uncertainty_score":0.008099616},"labels":[],"label_agreement":null},{"id":"W3036393604","doi":"10.37236/9703","title":"Extremal Overlap-Free and Extremal $\\beta$-Free Binary Words","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Word (group theory); BETA (programming language); Binary number; Combinatorics; Exponent; Mathematics; Sigma; Alphabet; Physics; Arithmetic; Geometry; Computer science; Quantum mechanics; Philosophy; Linguistics","score_opus":0.013599943502214476,"score_gpt":0.2272958911095833,"score_spread":0.21369594760736882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036393604","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92517114,0.000589234,0.04893769,0.00032408396,0.00006473386,0.000022683493,0.00036894143,0.00018821038,0.024333239],"genre_scores_gemma":[0.9779425,0.00016751736,0.015273467,0.00008214956,0.00007078454,0.000070057155,0.0003538488,0.000081063445,0.0059585813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993693,0.00011073006,0.000054977176,0.000151289,0.00014306158,0.00017071227],"domain_scores_gemma":[0.9976942,0.0010560259,0.0003943372,0.00022472706,0.0002532365,0.0003774422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040589305,0.00041804306,0.00037301268,0.000932158,0.0011932561,0.0014133367,0.00058645423,0.0005654236,0.004975726],"category_scores_gemma":[0.0028041308,0.00038515488,0.00032892526,0.00068138895,0.0013581979,0.0017555987,0.0015547955,0.0008584686,0.0006807613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060088915,0.000091007874,0.0033947295,0.00024726923,0.000027783535,0.0008991394,0.0011014753,0.006424328,0.029392887,0.9303308,0.0023891968,0.025100417],"study_design_scores_gemma":[0.00006899303,0.00015602869,0.0039970893,0.0000949477,0.00005512399,0.0018205532,0.00079305907,0.033498764,0.0235154,0.92086715,0.015031006,0.000101870624],"about_ca_topic_score_codex":0.00015304814,"about_ca_topic_score_gemma":0.00023603789,"teacher_disagreement_score":0.004975726,"about_ca_system_score_codex":0.00048737583,"about_ca_system_score_gemma":0.0002364492,"threshold_uncertainty_score":0.016645491},"labels":[],"label_agreement":null},{"id":"W3037745114","doi":"10.5802/jtnb.1236","title":"Badly approximable numbers, Kronecker’s theorem, and diversity of Sturmian characteristic sequences","year":2023,"lang":"en","type":"article","venue":"Journal de Théorie des Nombres de Bordeaux","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Kronecker delta; Irrational number; Sequence (biology); Dimension (graph theory); Combinatorics; Diophantine approximation; Discrete mathematics; Measure (data warehouse); Pure mathematics; Geometry","score_opus":0.014775413606572798,"score_gpt":0.24650043151737894,"score_spread":0.23172501791080613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037745114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7275719,0.00088967086,0.2568505,0.00066887145,0.00009026204,0.00001810767,0.00014820171,0.00017375498,0.013588802],"genre_scores_gemma":[0.9826082,0.00022966841,0.014936837,0.00007013943,0.000057363846,0.000023454477,0.00008358746,0.000025058282,0.0019655835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990439,0.00017877368,0.000058228703,0.00019164037,0.0003566019,0.00017082356],"domain_scores_gemma":[0.9961887,0.0020361547,0.00048120163,0.0003915646,0.00042536116,0.0004770104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014825489,0.00038901268,0.0006494673,0.0022430473,0.0009728099,0.0017365912,0.000783929,0.0005682947,0.0016833473],"category_scores_gemma":[0.006770934,0.000280432,0.000664082,0.0012571645,0.0027451068,0.002973251,0.0013996216,0.0013313942,0.00024414575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011249868,0.000018856152,0.0037200397,0.00005410476,0.000021634916,0.00013685483,0.0005040308,0.013933782,0.0041725626,0.9659357,0.0004561036,0.010933663],"study_design_scores_gemma":[0.000018344586,0.00009127893,0.0017804455,0.000030276333,0.000022031145,0.0002843793,0.00013767956,0.06860209,0.0035458757,0.9230051,0.0024426288,0.000039845],"about_ca_topic_score_codex":0.00096747343,"about_ca_topic_score_gemma":0.00073695794,"teacher_disagreement_score":0.0022430473,"about_ca_system_score_codex":0.0016678141,"about_ca_system_score_gemma":0.00046095354,"threshold_uncertainty_score":0.012100875},"labels":[],"label_agreement":null},{"id":"W3037965222","doi":"10.1016/j.aam.2016.11.005","title":"Profinite automata","year":2016,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Mathematics; Modulo; Uncountable set; Discrete mathematics; Sequence (biology); Algebraic number; Alphabet; Prime number; Profinite group; Primitive root modulo n; Combinatorics; Prime (order theory); Group (periodic table)","score_opus":0.00865574799174698,"score_gpt":0.24458560634197135,"score_spread":0.23592985835022437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037965222","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07274975,0.0044023274,0.4514406,0.005785083,0.001422962,0.00010771408,0.001562903,0.0018728793,0.46065566],"genre_scores_gemma":[0.8146587,0.002439714,0.05391329,0.001140053,0.0010152357,0.00012896144,0.0012206048,0.00039717014,0.12508635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918383,0.00016876178,0.00007055066,0.0002575964,0.00024020634,0.00007899431],"domain_scores_gemma":[0.9985814,0.00058191817,0.00007487506,0.00033249208,0.0003178903,0.00011151692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000653704,0.0006030038,0.0006300077,0.0013311146,0.0016448613,0.0034143636,0.0006453983,0.0011472321,0.019940108],"category_scores_gemma":[0.0027176994,0.00046108608,0.00084703165,0.0011836805,0.002208144,0.007278051,0.0018018897,0.002339576,0.0045650476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010460185,0.000006914525,0.000057693767,0.000022449558,0.0000026899922,0.000027736525,0.00013311347,0.00017663235,0.00043460567,0.9910617,0.001609894,0.0064559137],"study_design_scores_gemma":[0.0000046995506,0.000008607702,0.000062564126,0.000009322778,0.0000057643065,0.00013116749,0.000045440385,0.0015861667,0.00063405413,0.9775489,0.019955479,0.000007816106],"about_ca_topic_score_codex":0.00043963856,"about_ca_topic_score_gemma":0.0003331625,"teacher_disagreement_score":0.019940108,"about_ca_system_score_codex":0.0009238423,"about_ca_system_score_gemma":0.0005050727,"threshold_uncertainty_score":0.0667063},"labels":[],"label_agreement":null},{"id":"W3040025217","doi":"10.1016/j.tcs.2021.02.023","title":"Squarefree words with interior disposable factors","year":2021,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Square-free integer; Word (group theory); Mathematics; Combinatorics; Ternary operation; Position (finance); Symbol (formal); Property (philosophy); Arithmetic; Computer science; Geometry; Philosophy; Business","score_opus":0.009752978889501072,"score_gpt":0.23538600739585205,"score_spread":0.22563302850635097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040025217","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4363451,0.0013349348,0.39325786,0.0013943632,0.0007791509,0.00014592754,0.0009837454,0.0016088713,0.16415004],"genre_scores_gemma":[0.8896844,0.00041473017,0.043957822,0.00028727576,0.00025549642,0.00011822289,0.0005597056,0.0004350822,0.06428736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992304,0.00012301201,0.00006393926,0.00025123663,0.00016113851,0.0001702324],"domain_scores_gemma":[0.99791867,0.0011426172,0.00014472376,0.00024943313,0.00028655498,0.00025799553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000630925,0.0010280586,0.00093868695,0.0012277161,0.0016563366,0.0037357325,0.0007474508,0.001149605,0.016593248],"category_scores_gemma":[0.0025938544,0.0010098697,0.0010039748,0.001136452,0.0027872913,0.006047938,0.002687579,0.0021720498,0.0035688877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017261376,0.000046023022,0.00044022652,0.00008524059,0.0000113949845,0.0006671594,0.0008207257,0.00062204123,0.0057859127,0.98143333,0.0017425184,0.008172988],"study_design_scores_gemma":[0.000034117318,0.000025266821,0.00020063452,0.000019134064,0.000017672084,0.00043512025,0.00021021144,0.0021780252,0.003530932,0.985466,0.0078619225,0.000020967856],"about_ca_topic_score_codex":0.00047788327,"about_ca_topic_score_gemma":0.00066873385,"teacher_disagreement_score":0.016593248,"about_ca_system_score_codex":0.0006800616,"about_ca_system_score_gemma":0.00048101906,"threshold_uncertainty_score":0.055509925},"labels":[],"label_agreement":null},{"id":"W3042874346","doi":"10.1051/ita/2021001","title":"The simplest binary word with only three squares","year":2021,"lang":"en","type":"preprint","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Correctness; Word (group theory); Binary number; Property (philosophy); Computer science; Mathematics; Binary operation; Software; Discrete mathematics; Algebra over a field; Theoretical computer science; Arithmetic; Algorithm; Pure mathematics; Programming language; Epistemology; Philosophy","score_opus":0.008547743220322503,"score_gpt":0.23700780590173773,"score_spread":0.22846006268141522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042874346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30535272,0.0010300722,0.55988634,0.006149323,0.0019052968,0.00015969308,0.000588302,0.0018999152,0.12302841],"genre_scores_gemma":[0.7512894,0.00037484747,0.2252786,0.0009901364,0.00019551293,0.00016902591,0.00033087496,0.00072797143,0.02064352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918336,0.0002241051,0.000076736964,0.00022242514,0.0002036775,0.00008972171],"domain_scores_gemma":[0.9979075,0.00071593066,0.00019038212,0.0006062085,0.0003253039,0.00025462196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075966946,0.00044332558,0.0005939099,0.00051526964,0.0018976985,0.0018082882,0.00081900007,0.0010518524,0.010225218],"category_scores_gemma":[0.0027343584,0.00044721566,0.0008606788,0.0005129373,0.003366379,0.0040405216,0.0026968445,0.0019247999,0.003114385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033950835,0.000059306018,0.0010195279,0.00047429,0.00002712163,0.00067165494,0.0018138945,0.0013112988,0.040589385,0.91023064,0.0051494525,0.038313802],"study_design_scores_gemma":[0.000084520514,0.0001836391,0.00078724587,0.00020910132,0.00008603676,0.0020959435,0.0009416979,0.007250675,0.039520014,0.8472972,0.10141771,0.00012630457],"about_ca_topic_score_codex":0.00023175312,"about_ca_topic_score_gemma":0.00037430198,"teacher_disagreement_score":0.010225218,"about_ca_system_score_codex":0.0005389115,"about_ca_system_score_gemma":0.00066805835,"threshold_uncertainty_score":0.034206748},"labels":[],"label_agreement":null},{"id":"W3044924055","doi":"10.1017/nmj.2021.5","title":"MAHLER’S AND KOKSMA’S CLASSIFICATIONS IN FIELDS OF POWER SERIES","year":2021,"lang":"en","type":"preprint","venue":"Nagoya Mathematical Journal","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Series (stratigraphy); Prime (order theory); Finite field; Field (mathematics); Mathematics; Power (physics); Power series; Prime power; Combinatorics; Discrete mathematics; Pure mathematics; Physics; Mathematical analysis; Geology; Quantum mechanics","score_opus":0.024934000237615002,"score_gpt":0.2691077440815369,"score_spread":0.24417374384392193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044924055","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7984949,0.0024291838,0.0760893,0.0046341405,0.0006857355,0.00007422198,0.00033576952,0.00019194353,0.11706476],"genre_scores_gemma":[0.9766937,0.000533501,0.010136701,0.00026456575,0.0005054401,0.0000714599,0.00014891264,0.0000387109,0.011606983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998638,0.00030266395,0.00012265285,0.00026306737,0.0004604249,0.00021315001],"domain_scores_gemma":[0.9954537,0.0021767197,0.00067096646,0.00042560688,0.00081012154,0.0004628792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022213957,0.00035552518,0.00075531745,0.004386666,0.0018897365,0.0045953225,0.0010354972,0.0015120497,0.0071640704],"category_scores_gemma":[0.0071453187,0.0003230565,0.00074822333,0.0016523871,0.0043988326,0.008001328,0.0016890569,0.0017445325,0.0010347402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025134317,0.000007199584,0.0007132362,0.000020899011,0.0000030189824,0.00004695735,0.0004382769,0.00022410283,0.00038964316,0.9954364,0.0005559189,0.0021392058],"study_design_scores_gemma":[0.000023249351,0.000029037838,0.001625693,0.000045514556,0.000011237925,0.00034025701,0.000549356,0.005383456,0.0009229377,0.9833574,0.007682296,0.0000294963],"about_ca_topic_score_codex":0.0008515936,"about_ca_topic_score_gemma":0.0005181269,"teacher_disagreement_score":0.0071640704,"about_ca_system_score_codex":0.0021357313,"about_ca_system_score_gemma":0.0005591186,"threshold_uncertainty_score":0.023966193},"labels":[],"label_agreement":null},{"id":"W3080853710","doi":"10.37236/9819","title":"Synchronizing Times for $k$-sets in Automata","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Word (group theory); Synchronizing; Mathematics; Combinatorics; Automaton; State (computer science); Conjecture; Upper and lower bounds; Discrete mathematics; Word length; Algorithm; Computer science; Topology (electrical circuits); Geometry; Theoretical computer science","score_opus":0.007389085431190077,"score_gpt":0.23200268580022293,"score_spread":0.22461360036903286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080853710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5536583,0.0010186173,0.4092245,0.002133865,0.0003637053,0.00021037104,0.0008950012,0.0029164779,0.029579038],"genre_scores_gemma":[0.88000995,0.00027723092,0.109903924,0.00039329665,0.00018944617,0.00054867886,0.0006240903,0.00058799254,0.0074653383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99611926,0.0007381052,0.00061793224,0.0011383574,0.00088283204,0.00050342525],"domain_scores_gemma":[0.97644126,0.015283456,0.002552456,0.0022292726,0.0019926198,0.0015009202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023605803,0.00070830795,0.0010355568,0.0015360424,0.0023365193,0.004189397,0.0015887416,0.0017605091,0.0073507517],"category_scores_gemma":[0.019980932,0.001005821,0.0014819871,0.0013776139,0.0033068748,0.007959577,0.0031230918,0.002563225,0.001511076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010246744,0.00014870407,0.003947425,0.00040591697,0.00006647629,0.0005844106,0.0033986866,0.025454322,0.023277663,0.9042148,0.0027802528,0.034696568],"study_design_scores_gemma":[0.000112485395,0.00015383643,0.00079009234,0.000089749534,0.00006163679,0.00032338084,0.000431434,0.07254755,0.010372418,0.90989274,0.005128658,0.00009598519],"about_ca_topic_score_codex":0.0006475195,"about_ca_topic_score_gemma":0.0009059272,"teacher_disagreement_score":0.0073507517,"about_ca_system_score_codex":0.0024014898,"about_ca_system_score_gemma":0.0011244222,"threshold_uncertainty_score":0.024590671},"labels":[],"label_agreement":null},{"id":"W3081350802","doi":"10.48550/arxiv.2008.11164","title":"Concatenation Operations and Restricted Variants of Two-Dimensional Automata","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Diagonal; Closure (psychology); Nondeterministic algorithm; Nondeterministic finite automaton; Automaton; Discrete mathematics; Computer science; Mathematics; Combinatorics; Algorithm; Automata theory; Theoretical computer science","score_opus":0.06388443640970944,"score_gpt":0.19876819439626528,"score_spread":0.13488375798655583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081350802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3683779,0.0010444516,0.6088014,0.00042445504,0.00026714473,0.00015483078,0.0005341593,0.0014952135,0.018900402],"genre_scores_gemma":[0.9230323,0.00037261145,0.070715144,0.0001400754,0.000106958876,0.00033514554,0.0005056542,0.00014421938,0.004647873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99607337,0.00083440164,0.00065480405,0.0011774666,0.00084136345,0.00041848753],"domain_scores_gemma":[0.9923924,0.003414001,0.00089086086,0.002008194,0.00081809337,0.00047647092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001631938,0.0006436743,0.00065475027,0.0009294062,0.0014299053,0.002421251,0.0012887439,0.0010888465,0.0024145504],"category_scores_gemma":[0.005840246,0.0005532412,0.0019614757,0.0008026646,0.004545471,0.004963161,0.0036129837,0.0017801728,0.000553412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026048088,0.000080074875,0.0014612003,0.00012865824,0.000040031806,0.00096037495,0.0020802899,0.011720059,0.017798478,0.9507624,0.00061345845,0.014094544],"study_design_scores_gemma":[0.00008523782,0.00023659003,0.00076954166,0.000067025074,0.00006689762,0.0011167759,0.0004988147,0.09462894,0.018354315,0.8711884,0.012874481,0.00011296807],"about_ca_topic_score_codex":0.0012533291,"about_ca_topic_score_gemma":0.0005955682,"teacher_disagreement_score":0.002421251,"about_ca_system_score_codex":0.0010035512,"about_ca_system_score_gemma":0.0007367093,"threshold_uncertainty_score":0.008630633},"labels":[],"label_agreement":null},{"id":"W3087847018","doi":"10.1016/j.disc.2020.112167","title":"Graded alphabets, circular codes, free Lie algebras and comma-free codes","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Generalization; Mathematical proof; Embedding; Characterization (materials science); Degree (music); Discrete mathematics; Combinatorics; Code (set theory); Pure mathematics; Mathematical analysis; Geometry","score_opus":0.021235000057293535,"score_gpt":0.2294300444318054,"score_spread":0.20819504437451186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087847018","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5324329,0.0054838923,0.2938351,0.0041147186,0.0010347035,0.00010277564,0.001206648,0.0008397856,0.16094944],"genre_scores_gemma":[0.9506124,0.0012090129,0.017173994,0.00053237856,0.00048565996,0.0000766659,0.0004902878,0.00011007982,0.029309446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990386,0.000201205,0.0000693073,0.00019860332,0.00028985264,0.00020242695],"domain_scores_gemma":[0.9964431,0.0015469525,0.00060730975,0.00043044463,0.0004651332,0.00050693826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007721448,0.0004986107,0.00072067487,0.0019754092,0.0022383812,0.003499502,0.00092448684,0.0012339072,0.006503274],"category_scores_gemma":[0.0033375814,0.0002626682,0.0005180005,0.0022508842,0.004134763,0.0034600482,0.0018083458,0.0016929972,0.0013504976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024474211,0.000009324786,0.00013128361,0.000021277701,0.0000026367366,0.00003857869,0.00014664879,0.00050148455,0.0004059554,0.9953833,0.00052760873,0.0028073513],"study_design_scores_gemma":[0.0000059081945,0.000005768569,0.00007755388,0.000008208084,0.000002939101,0.00003458954,0.0000518134,0.0014512787,0.00031114943,0.9960549,0.001986818,0.000009068701],"about_ca_topic_score_codex":0.0025091744,"about_ca_topic_score_gemma":0.0017298327,"teacher_disagreement_score":0.006503274,"about_ca_system_score_codex":0.0013224089,"about_ca_system_score_gemma":0.0011079388,"threshold_uncertainty_score":0.021755636},"labels":[],"label_agreement":null},{"id":"W3096500228","doi":"10.46298/dmtcs.6915","title":"Graphs containing finite induced paths of unbounded length","year":2022,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Lyon; Agence Nationale de la Recherche; Canadian Defence Academy","keywords":"Antichain; Mathematics; Combinatorics; Lexicographical order; Induced subgraph; Comparability graph; Pairwise comparison; Discrete mathematics; Graph; Finite set; Path (computing); Partially ordered set; Pathwidth; Line graph; Computer science","score_opus":0.023524839367688503,"score_gpt":0.27372617276941025,"score_spread":0.25020133340172174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096500228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8314678,0.00027125631,0.14835893,0.00021716634,0.00003897174,0.00004800413,0.0008035389,0.00059343455,0.018200975],"genre_scores_gemma":[0.94628936,0.00016940913,0.04608679,0.000066158216,0.00002585612,0.00007400104,0.0011080242,0.00010144865,0.006078899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973494,0.000048372192,0.000019796682,0.00008611704,0.000056383564,0.00005444823],"domain_scores_gemma":[0.9984144,0.00065327564,0.00031477213,0.00022261545,0.000216184,0.00017872667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022663004,0.00025517255,0.00023939749,0.0006724374,0.0005191982,0.0006898301,0.0005087073,0.00033327623,0.0021113127],"category_scores_gemma":[0.0012722004,0.00026044282,0.00031241024,0.00043815398,0.0006563697,0.001553588,0.0007834014,0.00053249416,0.0003932902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034881962,0.00007310862,0.0054581743,0.00020845028,0.00003634877,0.00096848287,0.00087021425,0.010311069,0.11779845,0.8335154,0.0013779147,0.029033534],"study_design_scores_gemma":[0.000037990674,0.00013472333,0.004982843,0.000072810144,0.00008638103,0.0010706794,0.00040673764,0.040135223,0.0677869,0.86269826,0.022544008,0.000043434655],"about_ca_topic_score_codex":0.00039104294,"about_ca_topic_score_gemma":0.0010223809,"teacher_disagreement_score":0.0021113127,"about_ca_system_score_codex":0.00050709804,"about_ca_system_score_gemma":0.0003852039,"threshold_uncertainty_score":0.007063031},"labels":[],"label_agreement":null},{"id":"W3099960508","doi":"10.1007/978-3-030-62536-8_8","title":"Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Parallelism (grammar); Automaton; Finite-state machine; Parallel computing; Theoretical computer science; Algorithm","score_opus":0.019800135212385092,"score_gpt":0.240125828284948,"score_spread":0.2203256930725629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099960508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04677243,0.0007937482,0.9330432,0.00047649065,0.00014412028,0.00004436261,0.00005255775,0.0005029196,0.018170083],"genre_scores_gemma":[0.77530867,0.00076000136,0.21411036,0.00016806678,0.0002573,0.00016370292,0.00012850636,0.00025291578,0.008850478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868757,0.00057369896,0.00009677957,0.00021919774,0.00034197458,0.00008080316],"domain_scores_gemma":[0.9926945,0.0055797165,0.00019601306,0.0010335888,0.00033056724,0.00016573591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001909226,0.00063712324,0.00087485067,0.0004921228,0.0007452009,0.0015299196,0.0013764604,0.00085624127,0.0031118724],"category_scores_gemma":[0.008083592,0.00077530567,0.0008869455,0.0007908477,0.0020666872,0.0070346612,0.0029577974,0.0026220544,0.0005084727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002151881,0.00009742098,0.0006219798,0.00024104636,0.00004502422,0.00025284413,0.0004053815,0.055498686,0.013707564,0.83840513,0.0013684393,0.08914119],"study_design_scores_gemma":[0.000015298887,0.000029451267,0.00006686544,0.0000127657895,0.000017164342,0.00007656326,0.000017252423,0.109667376,0.0025637264,0.8854247,0.0020980155,0.000010948218],"about_ca_topic_score_codex":0.00036191478,"about_ca_topic_score_gemma":0.0006128784,"teacher_disagreement_score":0.0031118724,"about_ca_system_score_codex":0.0006447558,"about_ca_system_score_gemma":0.00076420826,"threshold_uncertainty_score":0.010410249},"labels":[],"label_agreement":null},{"id":"W3100652847","doi":"10.5167/uzh-191594","title":"A decorated tree approach to random permutations in substitution-closed classes","year":2020,"lang":"en","type":"article","venue":"Zurich Open Repository and Archive (University of Zurich)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Mathematics; Bijection; Substitution (logic); Combinatorics; Tree (set theory); Constraint (computer-aided design); Decomposition; Discrete mathematics; Computer science","score_opus":0.017864218697264407,"score_gpt":0.2050423370549858,"score_spread":0.1871781183577214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100652847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08338034,0.00022581541,0.8911644,0.00030676645,0.00011655495,0.000048215847,0.00011633753,0.00026726807,0.024374265],"genre_scores_gemma":[0.7909829,0.00034917038,0.18661642,0.00036841462,0.00019232387,0.00020989831,0.00024802878,0.0005110045,0.02052175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897695,0.0002758679,0.000056359946,0.00028505165,0.00027298278,0.00013291235],"domain_scores_gemma":[0.99765307,0.0010531181,0.00015753767,0.0005512062,0.00034723562,0.00023778269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012023099,0.00036385984,0.0005465236,0.0012699533,0.0012027973,0.0019717228,0.0009738416,0.0010439239,0.0065267],"category_scores_gemma":[0.005065898,0.00041797926,0.00096296,0.0007207992,0.0027538587,0.0040695616,0.0023928178,0.002264919,0.00090500666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008490992,0.000007277116,0.00010532745,0.000012406978,0.0000020981709,0.00004014245,0.000097530385,0.0016062488,0.0012722564,0.9938273,0.00016157642,0.0028593817],"study_design_scores_gemma":[0.0000075729563,0.000025086045,0.00015482023,0.000019064917,0.000007484565,0.00017680739,0.000054106644,0.035667002,0.0023830342,0.9561971,0.0052932664,0.000014726566],"about_ca_topic_score_codex":0.00053393276,"about_ca_topic_score_gemma":0.00068152667,"teacher_disagreement_score":0.0065267,"about_ca_system_score_codex":0.00091325433,"about_ca_system_score_gemma":0.00045421525,"threshold_uncertainty_score":0.021834016},"labels":[],"label_agreement":null},{"id":"W3102860825","doi":"","title":"FROM INDEXED GRAMMARS TO GENERATING FUNCTIONS","year":2016,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rule-based machine translation; Context-free grammar; Computer science; Class (philosophy); Programming language; Tree-adjoining grammar; Series (stratigraphy); Indexed grammar; Context (archaeology); Extended Affix Grammar; L-attributed grammar; Natural language processing; Artificial intelligence; History","score_opus":0.01129816369973855,"score_gpt":0.21564222431273228,"score_spread":0.20434406061299373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102860825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026623584,0.00055516325,0.9455109,0.0005798709,0.00018847064,0.00004320714,0.000180873,0.0010410056,0.025276916],"genre_scores_gemma":[0.51225054,0.0023101228,0.4625283,0.00071379275,0.0007300477,0.0002604821,0.00055397174,0.0009212101,0.019731488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930036,0.00022535237,0.000040281608,0.00014478074,0.00021568051,0.000073488125],"domain_scores_gemma":[0.99836475,0.0010347994,0.00008004035,0.00029881706,0.00016167529,0.00005989796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010892381,0.0006516047,0.00041701592,0.0019729328,0.0007524026,0.0020956784,0.0012047591,0.00076935126,0.00561537],"category_scores_gemma":[0.0055678836,0.00039565683,0.0006324177,0.0016894073,0.002592212,0.0045539257,0.0020835784,0.0019281281,0.0016882512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000579989,0.000007946979,0.00010486877,0.000026285514,0.0000025433617,0.000050243652,0.00016763528,0.0042784377,0.0007221588,0.9747775,0.00085873593,0.018997872],"study_design_scores_gemma":[0.0000020849984,0.00000432918,0.000041286225,0.0000072856515,0.000002203649,0.00003188454,0.00001611968,0.0116565535,0.0006375066,0.9833175,0.0042767995,0.0000064609067],"about_ca_topic_score_codex":0.0009007388,"about_ca_topic_score_gemma":0.000997027,"teacher_disagreement_score":0.00561537,"about_ca_system_score_codex":0.0009157586,"about_ca_system_score_gemma":0.00069068925,"threshold_uncertainty_score":0.018785357},"labels":[],"label_agreement":null},{"id":"W3103597113","doi":"","title":"A characterization of model sets by dynamical systems","year":2005,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Aperiodic graph; Dynamical systems theory; Characterization (materials science); Dynamical system (definition); Mathematics; Product (mathematics); Pure mathematics; Combinatorics; Physics; Geometry","score_opus":0.008800566012053684,"score_gpt":0.21940097861315633,"score_spread":0.21060041260110265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103597113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41806078,0.00067219994,0.5565025,0.0006392976,0.00007053034,0.00010332318,0.00034223587,0.00041580573,0.023193194],"genre_scores_gemma":[0.9615902,0.0001270328,0.03615434,0.00006433953,0.000047257483,0.00008193552,0.00018182714,0.000045669094,0.0017074134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988181,0.00028639095,0.00007889478,0.00038388086,0.00032048518,0.000112176276],"domain_scores_gemma":[0.99600595,0.0022928219,0.00053479825,0.00063253037,0.00029127646,0.00024271439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010100305,0.00036612607,0.00062918745,0.0014279928,0.0008365629,0.0022486986,0.0008459351,0.00091248937,0.0031485911],"category_scores_gemma":[0.006169462,0.00040825768,0.00071818545,0.0007813333,0.0028290234,0.0037875727,0.0018986833,0.0012214687,0.00032664934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006421515,0.000032673575,0.002431527,0.00008216517,0.000034087956,0.00028529603,0.0009042718,0.015099143,0.0054255794,0.9663715,0.0006026237,0.008666835],"study_design_scores_gemma":[0.000018732066,0.000063691296,0.0011945873,0.000038950235,0.000022022861,0.00046421,0.00028115028,0.13951245,0.00258116,0.85054713,0.0052496917,0.000026257108],"about_ca_topic_score_codex":0.00044888115,"about_ca_topic_score_gemma":0.00027410034,"teacher_disagreement_score":0.0031485911,"about_ca_system_score_codex":0.0009710671,"about_ca_system_score_gemma":0.0002629925,"threshold_uncertainty_score":0.010533094},"labels":[],"label_agreement":null},{"id":"W3106242887","doi":"","title":"ON SIMULTANEOUS RATIONAL APPROXIMATIONS TO A REAL NUMBER, ITS SQUARE, AND ITS CUBE","year":2012,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Exponent; Transcendental number; Algebraic number; Rational number; Upper and lower bounds; Square (algebra); Combinatorics; Cube (algebra); Degree (music); Discrete mathematics; Real number; Mathematical analysis; Geometry","score_opus":0.01621041567378072,"score_gpt":0.26720758650858795,"score_spread":0.2509971708348072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106242887","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8609326,0.0009845297,0.11726204,0.00058972184,0.00015512205,0.000029753397,0.00008255931,0.00018640974,0.01977734],"genre_scores_gemma":[0.9866492,0.00021408807,0.010963333,0.00007548829,0.000056448902,0.000022675555,0.00004967238,0.000024929888,0.0019441263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986085,0.00047591666,0.00008978167,0.0002495734,0.00037833466,0.00019789273],"domain_scores_gemma":[0.9917406,0.0061648577,0.00057477993,0.00065981393,0.0005475978,0.00031228186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016643789,0.0005104277,0.0007596738,0.0008388079,0.0006736815,0.0016765025,0.0004319396,0.00045783803,0.0029568567],"category_scores_gemma":[0.01234555,0.00029618575,0.0005898448,0.0006163894,0.00227663,0.0031860403,0.0017211214,0.0011201458,0.0005016355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010084362,0.00004414534,0.0038111052,0.00015427706,0.000042258973,0.00068919465,0.0010368638,0.026301788,0.018902833,0.9259252,0.0013378174,0.020746145],"study_design_scores_gemma":[0.000116849245,0.0003640508,0.0023878952,0.00010954048,0.000075986325,0.0010795222,0.0005107636,0.2606762,0.01468462,0.71169734,0.008221486,0.00007570892],"about_ca_topic_score_codex":0.0006703783,"about_ca_topic_score_gemma":0.0005175274,"teacher_disagreement_score":0.0029568567,"about_ca_system_score_codex":0.0010055965,"about_ca_system_score_gemma":0.0002783259,"threshold_uncertainty_score":0.009891689},"labels":[],"label_agreement":null},{"id":"W3115281408","doi":"","title":"String Attractors for Automatic Sequences.","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Attractor; String (physics); Combinatorics; Decidability; Sequence (biology); Mathematics; Prefix; Constant (computer programming); Discrete mathematics; Mathematical analysis; Mathematical physics; Computer science","score_opus":0.12056397071989795,"score_gpt":0.20194717572376258,"score_spread":0.08138320500386463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115281408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25202015,0.0014844263,0.69609284,0.0025763884,0.00027898463,0.0003310018,0.001951774,0.0019915935,0.043272898],"genre_scores_gemma":[0.84991014,0.0006625323,0.1334083,0.00046832734,0.00026426726,0.00042354982,0.0022957586,0.00021212672,0.012355018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984291,0.00032904558,0.00017861597,0.00056610233,0.00033146853,0.00016560414],"domain_scores_gemma":[0.98778707,0.009891184,0.0007940221,0.00066925253,0.00056252105,0.00029591122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014055871,0.00056236493,0.00050237385,0.0012678166,0.0012556112,0.0021779859,0.00092198077,0.0011068723,0.010331945],"category_scores_gemma":[0.010992332,0.0004538212,0.0019366412,0.0008718806,0.0024129339,0.005268084,0.0020518017,0.0021721986,0.0011899989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017254,0.00006263926,0.0017735218,0.00033044713,0.000037800575,0.0002904786,0.00071690045,0.016493121,0.00978851,0.9351328,0.0037110446,0.031490136],"study_design_scores_gemma":[0.000029961044,0.0000541378,0.00045226922,0.000048283266,0.00003057552,0.0003251944,0.0001401028,0.0902106,0.0054843053,0.8961879,0.0070036473,0.000033021075],"about_ca_topic_score_codex":0.0010249517,"about_ca_topic_score_gemma":0.0010428702,"teacher_disagreement_score":0.010331945,"about_ca_system_score_codex":0.0017236393,"about_ca_system_score_gemma":0.000806944,"threshold_uncertainty_score":0.03456384},"labels":[],"label_agreement":null},{"id":"W3116363031","doi":"10.1016/j.tcs.2020.12.028","title":"Decision problems and projection languages for restricted variants of two-dimensional automata","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic finite automaton; Deterministic automaton; Decidability; Mathematics; Nondeterministic algorithm; Discrete mathematics; Deterministic finite automaton; Büchi automaton; Decision problem; Regular language; Combinatorics; Two-way deterministic finite automaton; Quantum finite automata; Unary operation; Equivalence (formal languages); Deterministic pushdown automaton; Automata theory; Automaton; Finite-state machine; Computer science; Algorithm; Theoretical computer science","score_opus":0.017174068509438905,"score_gpt":0.27142118068754834,"score_spread":0.2542471121781094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116363031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32860506,0.00089827785,0.63977134,0.0030134802,0.0002493582,0.00032887235,0.0007165019,0.0004925855,0.025924554],"genre_scores_gemma":[0.87757623,0.0005667822,0.10762105,0.0004167011,0.00024618214,0.000514231,0.0010020346,0.00015245615,0.011904399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947778,0.0021117053,0.00053741434,0.001111472,0.00078682316,0.00067471433],"domain_scores_gemma":[0.9801333,0.015217634,0.000779572,0.0015313362,0.0012453914,0.001092768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048163943,0.00086925854,0.0015330826,0.0009985084,0.0017771663,0.00749638,0.0025560716,0.0021396494,0.006725824],"category_scores_gemma":[0.014612154,0.001095391,0.0027905486,0.0017208616,0.006124679,0.012358773,0.004843495,0.006252555,0.00066058536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013357963,0.00008954062,0.00029757374,0.00007983367,0.000025889023,0.0001332511,0.000527959,0.007329,0.00087886874,0.9842785,0.00063619216,0.0055897846],"study_design_scores_gemma":[0.000039533064,0.000024743502,0.000070816146,0.000012207684,0.000012658249,0.000065110915,0.00014110346,0.028095597,0.0004554552,0.9705183,0.00054455723,0.000019951043],"about_ca_topic_score_codex":0.0017373214,"about_ca_topic_score_gemma":0.0014825276,"teacher_disagreement_score":0.00749638,"about_ca_system_score_codex":0.0019253468,"about_ca_system_score_gemma":0.0024159155,"threshold_uncertainty_score":0.025471866},"labels":[],"label_agreement":null},{"id":"W3116871471","doi":"10.1142/s0129054120420095","title":"Semilinearity of Families of Languages","year":2020,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Linguistics; Computer science; Sociology; Philosophy","score_opus":0.017634115768495644,"score_gpt":0.30219732675415434,"score_spread":0.2845632109856587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116871471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18459532,0.0007676365,0.75840443,0.0012380658,0.00016437541,0.00017584492,0.0009532541,0.002172185,0.0515289],"genre_scores_gemma":[0.8453786,0.00052004476,0.13307224,0.0005314216,0.00020743211,0.00037091319,0.0010633117,0.0005148991,0.018341213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99704933,0.0006935974,0.00032985647,0.00087408884,0.0007207662,0.0003323342],"domain_scores_gemma":[0.98869705,0.006381325,0.00084305817,0.0019240533,0.0017090499,0.0004455656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023224112,0.0003645972,0.000527498,0.0013572244,0.0015460205,0.0023119135,0.0010437017,0.00053508976,0.006783828],"category_scores_gemma":[0.0058692214,0.00076679897,0.0017190482,0.0006577098,0.003346148,0.008129444,0.0030180567,0.0024507572,0.000924897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009083073,0.000046471672,0.0015537482,0.00016502026,0.000026747894,0.00039218986,0.0019457622,0.0028049015,0.00881967,0.96070784,0.0018627623,0.021584114],"study_design_scores_gemma":[0.000025484298,0.00009115535,0.0008602284,0.000072957875,0.000041003168,0.0009885835,0.00066724495,0.025484301,0.012299122,0.9336175,0.025799846,0.000052754458],"about_ca_topic_score_codex":0.00086492667,"about_ca_topic_score_gemma":0.000803035,"teacher_disagreement_score":0.006783828,"about_ca_system_score_codex":0.0016706652,"about_ca_system_score_gemma":0.0010711077,"threshold_uncertainty_score":0.02269411},"labels":[],"label_agreement":null},{"id":"W3119265231","doi":"10.1016/j.ic.2021.104686","title":"Descriptional Complexity of Formal Systems (DCFS 2019)","year":2021,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Modulo; Alphabet; Congruence (geometry); Computer science; Arithmetic; Mathematics; Combinatorics; Discrete mathematics; Linguistics; Philosophy","score_opus":0.02873548115125589,"score_gpt":0.24258239689671604,"score_spread":0.21384691574546016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119265231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10263013,0.019148689,0.6246566,0.039151613,0.0032444943,0.00028612022,0.0075554,0.0015860264,0.2017409],"genre_scores_gemma":[0.85521144,0.0063850465,0.09107051,0.0018895972,0.0026674161,0.00046072557,0.0048436765,0.0006183608,0.036853246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755377,0.0004926322,0.00017514439,0.0005588119,0.0010103212,0.00020928642],"domain_scores_gemma":[0.99311525,0.0043341094,0.0003119046,0.0011534975,0.0008119135,0.00027331652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019785657,0.0006406234,0.0008569827,0.002314289,0.001552813,0.005495398,0.0012463067,0.0016571278,0.012513871],"category_scores_gemma":[0.010563141,0.0007098426,0.0015485332,0.0035085732,0.00345429,0.009424535,0.0037824644,0.005261012,0.0021067797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002344699,0.0000117177,0.00019325587,0.00008508471,0.000010186952,0.000020470516,0.00016554346,0.0022372666,0.00026760902,0.9714488,0.006911377,0.018625269],"study_design_scores_gemma":[0.0000062458416,0.0000057798097,0.00015761884,0.000029644018,0.0000060763045,0.000047494363,0.000031446663,0.0061270525,0.00034588244,0.97466904,0.018559415,0.000014279868],"about_ca_topic_score_codex":0.004336074,"about_ca_topic_score_gemma":0.0019868598,"teacher_disagreement_score":0.012513871,"about_ca_system_score_codex":0.005327865,"about_ca_system_score_gemma":0.0022147368,"threshold_uncertainty_score":0.041863084},"labels":[],"label_agreement":null},{"id":"W3120172643","doi":"10.1016/j.tcs.2021.01.018","title":"Ostrowski-automatic sequences: Theory and applications","year":2021,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Enumeration; Computation; Computer science; Algebra over a field; Order (exchange); Mathematics; Automated theorem proving; Theoretical computer science; Discrete mathematics; Algorithm; Pure mathematics","score_opus":0.007005801093417205,"score_gpt":0.2402572451134385,"score_spread":0.2332514440200213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120172643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17745696,0.02711677,0.64375746,0.00538445,0.0019225781,0.00014377688,0.00060983415,0.0006353472,0.14297277],"genre_scores_gemma":[0.7819529,0.012725884,0.14838488,0.00079749676,0.0018929287,0.0003552565,0.00056112075,0.00019562778,0.05313387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992766,0.00017842778,0.0000637306,0.00017982876,0.0002180989,0.00008333372],"domain_scores_gemma":[0.99757546,0.001235007,0.00038059347,0.00020425662,0.00039711714,0.00020763277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095735415,0.00070452184,0.0008020974,0.0039465595,0.0018013683,0.0027476482,0.0011758758,0.0014072628,0.006708866],"category_scores_gemma":[0.004708303,0.00051393127,0.00078929716,0.0042574666,0.0033094406,0.005573132,0.0020165835,0.002717949,0.0015083661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015101859,0.000011184754,0.00013817515,0.00005238813,0.0000035260505,0.000027067535,0.00015139475,0.00075214065,0.00039808502,0.9871516,0.00071137695,0.010587994],"study_design_scores_gemma":[0.0000087902135,0.000011165388,0.00014736789,0.000020621308,0.000005244093,0.000098869736,0.00006098988,0.0050696163,0.0004044306,0.9884637,0.005697629,0.000011485458],"about_ca_topic_score_codex":0.0007941308,"about_ca_topic_score_gemma":0.00081993797,"teacher_disagreement_score":0.006708866,"about_ca_system_score_codex":0.0015931217,"about_ca_system_score_gemma":0.0012020579,"threshold_uncertainty_score":0.022443354},"labels":[],"label_agreement":null},{"id":"W3120287019","doi":"10.1016/j.ic.2021.104690","title":"Structural properties of NFAs and growth rates of nondeterminism measures","year":2021,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; String (physics); Computation; Nondeterministic algorithm; Combinatorics; Bounded function; Polynomial; Discrete mathematics; Bounding overwatch; Tree (set theory); GF(2); Exponential function; Path (computing); Nondeterministic finite automaton; Finite field; Automaton; Algorithm; Computer science; Automata theory; Theoretical computer science","score_opus":0.022265722468154052,"score_gpt":0.23524108675770072,"score_spread":0.21297536428954666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120287019","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.659701,0.0011551449,0.31377643,0.0020772826,0.000104959436,0.00013963484,0.0012148675,0.0007100635,0.021120649],"genre_scores_gemma":[0.9675688,0.0004905333,0.027447753,0.00010205215,0.00017146711,0.00021197992,0.00043071737,0.00023302542,0.0033436255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960496,0.00096204726,0.00037497166,0.0009959273,0.0010460197,0.0005714708],"domain_scores_gemma":[0.8531241,0.117554694,0.010017699,0.008499309,0.00634117,0.0044629937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060829744,0.0007487979,0.0014357934,0.0041647526,0.001948905,0.0062411083,0.002268548,0.0020010476,0.008232515],"category_scores_gemma":[0.056801148,0.001355902,0.0015321121,0.0024823416,0.0049589407,0.01333436,0.0018903887,0.0037793913,0.0006894042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001279903,0.00005530921,0.0024337969,0.00010235855,0.00002159142,0.00009151687,0.00073442486,0.008378841,0.0037703381,0.97681385,0.00045510652,0.007014902],"study_design_scores_gemma":[0.000025583624,0.000035694018,0.0011532141,0.00003892044,0.000024079634,0.00024654606,0.00018316734,0.053901054,0.0029767381,0.94036037,0.0010136369,0.000041082665],"about_ca_topic_score_codex":0.0010899844,"about_ca_topic_score_gemma":0.0009278919,"teacher_disagreement_score":0.008232515,"about_ca_system_score_codex":0.0031537197,"about_ca_system_score_gemma":0.0016907742,"threshold_uncertainty_score":0.032170177},"labels":[],"label_agreement":null},{"id":"W3121836531","doi":"10.46298/lmcs-18(3:14)2022","title":"Tameness and the power of programs over monoids in DA","year":2022,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Morphism; Monoid; Class (philosophy); Regular language; Mathematics; Characterization (materials science); Hierarchy; Expressive power; Complexity class; Pure mathematics; Discrete mathematics; Algebra over a field; Computer science; Time complexity; Automaton; Programming language; Physics; Artificial intelligence","score_opus":0.04480822537424823,"score_gpt":0.3572987186146682,"score_spread":0.31249049324042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121836531","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54816914,0.0010752038,0.3998949,0.002376275,0.00011412932,0.000072177536,0.00033459996,0.00079493213,0.047168568],"genre_scores_gemma":[0.9693179,0.00018949599,0.024296945,0.00021106849,0.000070237606,0.000063281244,0.00009418866,0.00006426013,0.005692616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983707,0.00033051512,0.00012896485,0.00057006406,0.00036610165,0.00023357772],"domain_scores_gemma":[0.99409723,0.0034208805,0.00044640034,0.0009808878,0.00065728585,0.0003973189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016248595,0.00035145853,0.00045060346,0.001308617,0.0016446845,0.0034926645,0.0009795532,0.0009570591,0.0034174756],"category_scores_gemma":[0.005222553,0.00044945572,0.0009776345,0.0006102537,0.0053164572,0.007902468,0.0023830794,0.0021195847,0.00039318763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056395475,0.000016730419,0.0009687502,0.000053564458,0.000008873958,0.00011020017,0.0010275625,0.0010967631,0.0027883274,0.98917806,0.00018328174,0.004511475],"study_design_scores_gemma":[0.000027357879,0.00008587977,0.0009921105,0.000032240438,0.000040648407,0.00039054133,0.00035897864,0.01954198,0.0090559665,0.9597428,0.0096937595,0.000037649676],"about_ca_topic_score_codex":0.0012538406,"about_ca_topic_score_gemma":0.00084516365,"teacher_disagreement_score":0.0034926645,"about_ca_system_score_codex":0.0018104024,"about_ca_system_score_gemma":0.00070400164,"threshold_uncertainty_score":0.013135433},"labels":[],"label_agreement":null},{"id":"W3121898969","doi":"","title":"Operational state complexity of deterministic unranked tree automata","year":2016,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Tree (set theory); Regular language; Combinatorics; String (physics); Intersection (aeronautics); Tree automaton; State (computer science); Discrete mathematics; Automaton; Deterministic finite automaton; Mathematics; Upper and lower bounds; Time complexity; Computer science; Theoretical computer science; Algorithm","score_opus":0.03509262192747717,"score_gpt":0.2554535460084224,"score_spread":0.22036092408094524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121898969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80397314,0.0002236534,0.18890904,0.0003524648,0.00003813607,0.00004920854,0.00058456237,0.000604037,0.0052658175],"genre_scores_gemma":[0.979084,0.00009266368,0.018717486,0.000029121791,0.00001952197,0.0000600377,0.00053578604,0.000051922732,0.0014095029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822515,0.00029275037,0.00022980476,0.0003876406,0.0005320306,0.00033263664],"domain_scores_gemma":[0.99110717,0.005893327,0.00091177796,0.00092552183,0.00077420636,0.0003880385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078460574,0.00039581337,0.0005449446,0.00060762605,0.0005319336,0.0025369942,0.0009485526,0.0005372162,0.0032745278],"category_scores_gemma":[0.006274744,0.00029069165,0.00070058496,0.0005397983,0.0014391238,0.004235282,0.0012160955,0.0010941363,0.0003618975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000985819,0.00030711727,0.0078698695,0.00042290348,0.00008437075,0.0005901788,0.001387044,0.3535213,0.06575863,0.5162373,0.0017741476,0.051061235],"study_design_scores_gemma":[0.0000298794,0.00014315902,0.0013298972,0.000019070092,0.000032738328,0.0001238573,0.00015574275,0.70414263,0.019894056,0.27294007,0.0011345333,0.000054349577],"about_ca_topic_score_codex":0.0014355637,"about_ca_topic_score_gemma":0.0014059995,"teacher_disagreement_score":0.0032745278,"about_ca_system_score_codex":0.0013247323,"about_ca_system_score_gemma":0.0010267362,"threshold_uncertainty_score":0.01095438},"labels":[],"label_agreement":null},{"id":"W3124826634","doi":"10.1109/ccc.1997.612315","title":"Circuits and expressions with non-associative gates","year":2002,"lang":"en","type":"preprint","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Chengdu University of Information Technology","keywords":"Iterated function; Multiplication (music); Associative property; Semigroup; Abelian group; Mathematics; Expression (computer science); Discrete mathematics; Class (philosophy); Value (mathematics); Algebra over a field; Arithmetic; Computer science; Pure mathematics; Combinatorics","score_opus":0.01329980603729951,"score_gpt":0.2157967089046736,"score_spread":0.20249690286737407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124826634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4243123,0.0010299654,0.53547335,0.0015958829,0.00010582258,0.0002013268,0.00025823992,0.00030140197,0.0367216],"genre_scores_gemma":[0.8963752,0.00050395017,0.089851305,0.00018479416,0.000121823665,0.00024145852,0.00029537428,0.00006096457,0.012365099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998691,0.00038974494,0.00010404389,0.0003032157,0.00030271843,0.00020924845],"domain_scores_gemma":[0.99719644,0.0019259388,0.00028592243,0.00029243893,0.00019110621,0.000108108245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009921195,0.00056584436,0.00047263494,0.0005479744,0.001076086,0.002604867,0.00086406217,0.0010468069,0.0034285446],"category_scores_gemma":[0.0037766816,0.00025854103,0.0010765387,0.0008132484,0.0039885067,0.006274711,0.0016299644,0.0015488083,0.0003596602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038998267,0.000027017742,0.000284459,0.00008211161,0.000009087761,0.00020264486,0.00042068274,0.010694819,0.0026027688,0.9781285,0.00025060005,0.0072582243],"study_design_scores_gemma":[0.000018323344,0.000042927448,0.00010108266,0.000012257071,0.0000127822805,0.00011671271,0.00015317445,0.03192726,0.0061572124,0.9565051,0.004942554,0.0000106457155],"about_ca_topic_score_codex":0.00083686505,"about_ca_topic_score_gemma":0.0007876036,"teacher_disagreement_score":0.0034285446,"about_ca_system_score_codex":0.0013394527,"about_ca_system_score_gemma":0.00068214786,"threshold_uncertainty_score":0.011469662},"labels":[],"label_agreement":null},{"id":"W3126348830","doi":"10.1007/978-3-030-67731-2_11","title":"Concatenation Operations and Restricted Variants of Two-Dimensional Automata","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Diagonal; Closure (psychology); Computer science; Nondeterministic algorithm; Automaton; Nondeterministic finite automaton; Discrete mathematics; Algorithm; Automata theory; Combinatorics; Mathematics; Theoretical computer science","score_opus":0.015236191860627867,"score_gpt":0.24741043209524152,"score_spread":0.23217424023461367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126348830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14003891,0.004423854,0.6764287,0.0008354359,0.0014567509,0.00010835523,0.00052883185,0.0013506972,0.17482851],"genre_scores_gemma":[0.79831433,0.0021643706,0.14714657,0.00031919565,0.000521219,0.0002550725,0.00074623973,0.000400484,0.050132453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886215,0.00029857672,0.00016434246,0.00028446192,0.00024961442,0.00014087716],"domain_scores_gemma":[0.9983999,0.00076599,0.00010231781,0.00045520207,0.00016621398,0.00011032239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074357784,0.0006031694,0.0006220953,0.0008140788,0.0010110524,0.0037248076,0.0013115829,0.0008494597,0.0054748124],"category_scores_gemma":[0.0019820537,0.00048656928,0.0011807908,0.0013647745,0.0032831158,0.006131786,0.002582477,0.0025759696,0.0014105338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000463941,0.0000168338,0.000075730975,0.000039919258,0.0000063852112,0.00010360016,0.00028649287,0.0009956158,0.0026453298,0.9828782,0.00072688673,0.012178629],"study_design_scores_gemma":[0.000012228925,0.000037941565,0.00012343029,0.000019864692,0.000015592406,0.00029649425,0.00012176831,0.0065273237,0.0031340732,0.97399515,0.015684256,0.000031807293],"about_ca_topic_score_codex":0.0004863013,"about_ca_topic_score_gemma":0.00042334062,"teacher_disagreement_score":0.0054748124,"about_ca_system_score_codex":0.0006486684,"about_ca_system_score_gemma":0.00042884695,"threshold_uncertainty_score":0.018315077},"labels":[],"label_agreement":null},{"id":"W3126750858","doi":"10.1142/s0129054121410033","title":"Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Separable space; Mathematics; Partition (number theory); Zero (linguistics); Embedding; Word (group theory); Constructive; Rational number; Combinatorics; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.011756043757670224,"score_gpt":0.26541966523242494,"score_spread":0.25366362147475474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126750858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15621094,0.00034140266,0.8259807,0.0009936616,0.00010667454,0.000088204,0.00012867774,0.00072028505,0.015429411],"genre_scores_gemma":[0.7585519,0.0003324457,0.22559533,0.0003202511,0.00012642148,0.00021141834,0.000406439,0.0004429757,0.014012771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799,0.00041605916,0.0001547283,0.0005969368,0.0004604332,0.00038184106],"domain_scores_gemma":[0.9958274,0.0023638087,0.00029341763,0.00086285407,0.0003429693,0.00030952122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017813746,0.00079604087,0.0008168918,0.0008460174,0.0018725984,0.0022467,0.0017922941,0.0015166532,0.0049119834],"category_scores_gemma":[0.0052508707,0.0008073474,0.0012941628,0.00095269084,0.0054864925,0.008507513,0.004679923,0.0029616093,0.0011616306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009635627,0.000030523624,0.0003764755,0.00009138938,0.000011184287,0.00020500598,0.00083367655,0.0064225076,0.0067503336,0.9641677,0.0006215648,0.020393157],"study_design_scores_gemma":[0.000022760789,0.000040499646,0.00012743626,0.000024801031,0.000029569028,0.00015141703,0.00036724072,0.023975914,0.008206284,0.9620378,0.0049862806,0.00002997101],"about_ca_topic_score_codex":0.0015139506,"about_ca_topic_score_gemma":0.0020804745,"teacher_disagreement_score":0.0049119834,"about_ca_system_score_codex":0.0016035609,"about_ca_system_score_gemma":0.0012422913,"threshold_uncertainty_score":0.016432226},"labels":[],"label_agreement":null},{"id":"W3130346675","doi":"10.46298/lmcs-20(3:12)2024","title":"Decidability for Sturmian words","year":2024,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Decidability; Mathematics; Computer science; Calculus (dental); Discrete mathematics; Medicine","score_opus":0.07095395759748904,"score_gpt":0.4281744339669295,"score_spread":0.35722047636944043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130346675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37878206,0.0012091964,0.5687947,0.0030110977,0.00026008717,0.00018676792,0.000895748,0.002717642,0.044142727],"genre_scores_gemma":[0.9108582,0.0003349021,0.07962755,0.00046940258,0.00020200985,0.00017637532,0.00083356205,0.00022087681,0.007277086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750876,0.00045197317,0.000187781,0.00077244703,0.00068634795,0.00039261483],"domain_scores_gemma":[0.9941759,0.004464108,0.00028469175,0.00033279302,0.00057045155,0.00017207855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024366144,0.00049399544,0.0006089912,0.0012145108,0.0016568225,0.0035262473,0.001452293,0.0009786376,0.0043966966],"category_scores_gemma":[0.0064032543,0.0006734318,0.0018382837,0.00083427393,0.003486831,0.0063500535,0.001526143,0.002884453,0.0005029991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007383618,0.000054909437,0.0009046032,0.00014943196,0.000024207027,0.00018614833,0.0008365099,0.00559884,0.0039929333,0.97187364,0.0014245923,0.014880304],"study_design_scores_gemma":[0.000031897358,0.000040399867,0.00025067525,0.000030556293,0.00003238036,0.00015246548,0.00015946581,0.03379982,0.009989534,0.9495978,0.005890102,0.000024949264],"about_ca_topic_score_codex":0.0014189497,"about_ca_topic_score_gemma":0.0016556367,"teacher_disagreement_score":0.0043966966,"about_ca_system_score_codex":0.0028863514,"about_ca_system_score_gemma":0.0017305778,"threshold_uncertainty_score":0.020942092},"labels":[],"label_agreement":null},{"id":"W3131929699","doi":"","title":"Asymptotic behaviour of functional identities","year":2012,"lang":"en","type":"article","venue":"Bulgarian Digital Mathematics Library (BulDML) at IMI-BAS (Institute of Mathematics and Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland","keywords":"Psychology; Mathematics; Computer science","score_opus":0.0124899196269221,"score_gpt":0.18865477312232784,"score_spread":0.17616485349540573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131929699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8956472,0.0007109088,0.069941945,0.000519282,0.00009301007,0.000032220454,0.0001701743,0.00035123466,0.03253407],"genre_scores_gemma":[0.9926111,0.00016017201,0.0043540695,0.000028817834,0.000048535512,0.000028486878,0.000101901474,0.000042810712,0.002624004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942833,0.00010609313,0.000029343733,0.000105037056,0.00019074319,0.0001404723],"domain_scores_gemma":[0.99713767,0.00095751084,0.00045837712,0.0003710773,0.000652782,0.00042252333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010185825,0.00036515025,0.00045312266,0.0023306878,0.00091809384,0.0017021518,0.0008118574,0.0005050987,0.004381284],"category_scores_gemma":[0.009269217,0.00022933587,0.00048864994,0.000576184,0.0022290875,0.0033012172,0.0015425619,0.0010968638,0.00044187676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093561626,0.00005074337,0.009376927,0.00012527932,0.000020949474,0.00023973118,0.00046585457,0.01033755,0.0048884037,0.96149397,0.0009562138,0.011950696],"study_design_scores_gemma":[0.000022929293,0.000088896435,0.010376028,0.000101768856,0.000020744148,0.0009841614,0.00041062137,0.20591937,0.005714197,0.7726729,0.0036247906,0.00006364518],"about_ca_topic_score_codex":0.0014220434,"about_ca_topic_score_gemma":0.00082790205,"teacher_disagreement_score":0.004381284,"about_ca_system_score_codex":0.0014793031,"about_ca_system_score_gemma":0.00067771564,"threshold_uncertainty_score":0.014656782},"labels":[],"label_agreement":null},{"id":"W3136852318","doi":"10.48550/arxiv.2103.10904","title":"Frobenius Numbers and Automatic Sequences","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Sequence (biology); Combinatorics; Mathematical proof; Discrete mathematics; Set (abstract data type); Integer (computer science); Automaton; Computer science; Theoretical computer science","score_opus":0.04365410181395647,"score_gpt":0.17349913350985474,"score_spread":0.12984503169589828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136852318","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04623552,0.02458391,0.16879795,0.011495345,0.009061726,0.00008679343,0.0050318395,0.001977779,0.73272914],"genre_scores_gemma":[0.645247,0.023761531,0.055365596,0.001776848,0.008933798,0.00023838767,0.0067031807,0.0013163764,0.25665733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998062,0.000044667464,0.000009605357,0.000033685978,0.00008333433,0.000022469381],"domain_scores_gemma":[0.9992999,0.00038010377,0.00006573147,0.00006663097,0.00013548003,0.000052190328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036419873,0.00059435103,0.0003730537,0.0024625747,0.00054081075,0.0013121938,0.00038005933,0.0005686553,0.0707673],"category_scores_gemma":[0.0021470329,0.00020513595,0.00031117426,0.0019824272,0.00065206416,0.002612117,0.000680846,0.0009786488,0.009746283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004308308,0.000018251087,0.00018028662,0.0002206023,0.000009770081,0.000064824555,0.000117987714,0.00097413326,0.0010172875,0.89349705,0.06663699,0.037219696],"study_design_scores_gemma":[0.000008713654,0.000013236854,0.0005810912,0.00004676137,0.0000045747615,0.00013319882,0.000040149607,0.0019076511,0.00093770085,0.9095837,0.086726196,0.00001712473],"about_ca_topic_score_codex":0.0007960712,"about_ca_topic_score_gemma":0.00094068033,"teacher_disagreement_score":0.0707673,"about_ca_system_score_codex":0.0005915293,"about_ca_system_score_gemma":0.0002826842,"threshold_uncertainty_score":0.23674017},"labels":[],"label_agreement":null},{"id":"W3150719485","doi":"","title":"Transition complexity of incomplete dfas","year":2011,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Intersection (aeronautics); Descriptive complexity theory; Transition system; Finite-state machine; Deterministic finite automaton; Computational complexity theory; Automaton; Theoretical computer science; Computer science; State (computer science); Algorithmic complexity; Nondeterministic finite automaton; Transition (genetics); Mathematics; Algorithm; Automata theory","score_opus":0.0924043149423218,"score_gpt":0.23169189708273552,"score_spread":0.1392875821404137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150719485","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6019933,0.00055081054,0.3857265,0.0006645501,0.0000449074,0.00009307648,0.0012814273,0.00045505533,0.009190289],"genre_scores_gemma":[0.97549963,0.00021306195,0.02148707,0.000038630034,0.000029796027,0.00008685759,0.00063548586,0.000055913664,0.0019536866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780685,0.00038469184,0.00022800411,0.0004816157,0.0007794919,0.00031941783],"domain_scores_gemma":[0.9880002,0.008208713,0.0010821936,0.001066899,0.0012070623,0.0004348446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012716437,0.0003252727,0.00078007375,0.0014863358,0.00081017194,0.0028937594,0.0010534507,0.00069883815,0.0032153013],"category_scores_gemma":[0.011229027,0.00030255082,0.0012687648,0.0010493351,0.0015586325,0.0067244736,0.0013800148,0.0015906563,0.00021483775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020863363,0.00006608429,0.0045595337,0.00024538545,0.000081993414,0.00028587496,0.0006819358,0.17713243,0.005514346,0.78868854,0.0008002834,0.02173488],"study_design_scores_gemma":[0.00001715578,0.000039832357,0.0010250494,0.000022429109,0.000035722383,0.00011163304,0.00010093383,0.3582182,0.0030794106,0.6352955,0.0020249914,0.00002916836],"about_ca_topic_score_codex":0.0027993424,"about_ca_topic_score_gemma":0.0018328208,"teacher_disagreement_score":0.0032153013,"about_ca_system_score_codex":0.0027722346,"about_ca_system_score_gemma":0.0012159895,"threshold_uncertainty_score":0.020114124},"labels":[],"label_agreement":null},{"id":"W3154979563","doi":"10.1016/j.jnt.2021.03.005","title":"On quadratic numbers and forms, and Markoff theory","year":2021,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Quadratic equation; Word (group theory); Pure mathematics; Discrete mathematics; Combinatorics; Geometry","score_opus":0.005763016727419214,"score_gpt":0.23177856977853492,"score_spread":0.2260155530511157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154979563","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17739421,0.020785423,0.28680533,0.02168196,0.0030466511,0.00007716168,0.00038441079,0.00028432108,0.4895406],"genre_scores_gemma":[0.8923873,0.004984107,0.02586904,0.002114352,0.0035162307,0.00009907487,0.00022998673,0.00011357883,0.0706864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999252,0.00024992102,0.000049832277,0.00014842421,0.00021048512,0.00008934303],"domain_scores_gemma":[0.9981527,0.0011811969,0.0001550265,0.00014936832,0.00022106491,0.00014056407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014866784,0.0006636774,0.00071075914,0.0020606744,0.0029258567,0.0034400944,0.0009270475,0.0012626234,0.0065940935],"category_scores_gemma":[0.006100834,0.00044102583,0.0006081533,0.002352492,0.0073686014,0.0118576065,0.0025096997,0.0030847874,0.0006907709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072929915,0.0000057521947,0.000048076585,0.0000110837755,8.442701e-7,0.000012178197,0.0001299869,0.00016758211,0.00006844396,0.9967945,0.00063679833,0.002117586],"study_design_scores_gemma":[0.0000046297782,0.0000057178313,0.000067091845,0.0000060566285,0.0000014469548,0.000024249122,0.000044738557,0.0005136556,0.00003361953,0.9961578,0.0031366695,0.000004348992],"about_ca_topic_score_codex":0.0020912616,"about_ca_topic_score_gemma":0.0015316971,"teacher_disagreement_score":0.0065940935,"about_ca_system_score_codex":0.0017282154,"about_ca_system_score_gemma":0.0007670537,"threshold_uncertainty_score":0.02205944},"labels":[],"label_agreement":null},{"id":"W3158013313","doi":"10.1142/s0129054121410045","title":"Generalizations of Checking Stack Automata: Characterizations and Hierarchies","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Decidability; Turing machine; Computer science; Automaton; Stack (abstract data type); Theoretical computer science; Bounded function; Expressive power; Pushdown automaton; Automata theory; PSPACE; Discrete mathematics; Mathematics; Computational complexity theory; Programming language; Algorithm; Computation","score_opus":0.014366912644291241,"score_gpt":0.28497822296240233,"score_spread":0.2706113103181111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158013313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4371498,0.0027307891,0.5252642,0.0020836496,0.00016602347,0.00036937548,0.0014601172,0.002433841,0.02834222],"genre_scores_gemma":[0.91478294,0.00092879374,0.08035433,0.00038610882,0.00029296003,0.00021984382,0.0006801908,0.00027218452,0.0020826804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942099,0.0011061232,0.0005681665,0.0015718048,0.0017045249,0.00083949626],"domain_scores_gemma":[0.9714589,0.01696077,0.0024314036,0.0059517603,0.001880521,0.0013167636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028478643,0.0011794784,0.0014809608,0.0038964844,0.002024968,0.004227023,0.0034772458,0.0017362788,0.0052200537],"category_scores_gemma":[0.016926669,0.0011958178,0.0031511574,0.004415875,0.004880065,0.012801398,0.0036945534,0.0052660303,0.0004363585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001983647,0.00020048716,0.007824704,0.0005716359,0.00012922545,0.0007253931,0.0024906446,0.05692775,0.013205537,0.8770273,0.0023230463,0.03837594],"study_design_scores_gemma":[0.000026083144,0.000065845736,0.0014685531,0.000087934044,0.000095916235,0.0005097837,0.0003731276,0.15727147,0.005067661,0.8306934,0.00425405,0.00008621762],"about_ca_topic_score_codex":0.0040001962,"about_ca_topic_score_gemma":0.0036477523,"teacher_disagreement_score":0.0052200537,"about_ca_system_score_codex":0.002726249,"about_ca_system_score_gemma":0.0016400442,"threshold_uncertainty_score":0.019780338},"labels":[],"label_agreement":null},{"id":"W3159641609","doi":"10.48550/arxiv.2105.01179","title":"Degrees of Restriction for Two-Dimensional Automata","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Nondeterministic finite automaton; Automaton; Closure (psychology); Deterministic automaton; Nested word; Computer science; Automata theory; Mobile automaton; ω-automaton; Bounded function; Quantum finite automata; Discrete mathematics; Alphabet; Mathematics; Algorithm; Theoretical computer science","score_opus":0.06975635240950788,"score_gpt":0.1995490897455659,"score_spread":0.129792737336058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159641609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44406956,0.0007095827,0.5109532,0.00092195097,0.000116746705,0.00016600396,0.00072161324,0.0010133988,0.04132803],"genre_scores_gemma":[0.9264895,0.000260061,0.06807633,0.00019473136,0.00008517704,0.0003042695,0.0005213386,0.000092561844,0.003976069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99571085,0.0008351474,0.0006309659,0.001117294,0.0012601044,0.00044555595],"domain_scores_gemma":[0.9885755,0.0054344637,0.0010602139,0.0031283547,0.0009020489,0.00089953525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018139766,0.0005250758,0.0006577561,0.0013499273,0.0016089274,0.003125569,0.001360483,0.00091630884,0.003208529],"category_scores_gemma":[0.006475931,0.00072101905,0.0017300699,0.0009333209,0.0049339077,0.0059040715,0.0043262755,0.0029415481,0.0005353311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008298791,0.00004979334,0.0011355317,0.00008001866,0.000016293903,0.0001434599,0.0012128168,0.007304295,0.0070074736,0.9742373,0.00040255004,0.008327432],"study_design_scores_gemma":[0.000043792552,0.00008130548,0.0008631456,0.000041866126,0.000027075796,0.0003786299,0.00030139272,0.046429485,0.008255003,0.93356884,0.009940541,0.000068985755],"about_ca_topic_score_codex":0.0012012578,"about_ca_topic_score_gemma":0.00084570097,"teacher_disagreement_score":0.003208529,"about_ca_system_score_codex":0.0014833233,"about_ca_system_score_gemma":0.0007522667,"threshold_uncertainty_score":0.010762274},"labels":[],"label_agreement":null},{"id":"W3159934812","doi":"10.11575/cdm.v16i1.69831","title":"Lengths of extremal square-free ternary words","year":2020,"lang":"en","type":"article","venue":"University of Calgary","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Ternary operation; Word (group theory); Square (algebra); Alphabet; Square-free integer; Mathematics; Combinatorics; Sigma; Discrete mathematics; Geometry; Computer science; Linguistics; Physics; Philosophy","score_opus":0.011476607508859989,"score_gpt":0.17807640045272488,"score_spread":0.1665997929438649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159934812","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92744905,0.0014996291,0.049769424,0.0004651695,0.00011844323,0.00003098141,0.0006391121,0.0002755054,0.019752776],"genre_scores_gemma":[0.9802271,0.00028920255,0.016596027,0.00006492871,0.000081217484,0.00006096905,0.0003276244,0.00008925484,0.0022636296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905795,0.0001598179,0.00012513914,0.00025274124,0.00024868763,0.00015567966],"domain_scores_gemma":[0.99500644,0.0025992505,0.00093834137,0.00036121538,0.0006434551,0.00045124887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055573735,0.000322442,0.00038546158,0.0014400965,0.0010373791,0.0017246109,0.00059153186,0.0006785066,0.0041432166],"category_scores_gemma":[0.0069684167,0.0004588963,0.00031209885,0.0008956357,0.0014289471,0.0020477714,0.0012549118,0.00071584474,0.00051296735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008508083,0.00008238822,0.008549293,0.00062307523,0.00006863008,0.00096450694,0.0015069824,0.020222882,0.056355868,0.8572799,0.003094955,0.050400697],"study_design_scores_gemma":[0.000058403668,0.00023360198,0.006903932,0.00014345594,0.000070574424,0.0018279734,0.000857932,0.052429102,0.035737425,0.88814616,0.013428771,0.0001627919],"about_ca_topic_score_codex":0.00017031972,"about_ca_topic_score_gemma":0.00024436534,"teacher_disagreement_score":0.0041432166,"about_ca_system_score_codex":0.00074824895,"about_ca_system_score_gemma":0.00035739868,"threshold_uncertainty_score":0.0138604045},"labels":[],"label_agreement":null},{"id":"W3161227694","doi":"10.11575/cdm.v16i1.70710","title":"Symmetric association schemes arising from abstract regular polytopes","year":2020,"lang":"en","type":"article","venue":"University of Calgary","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Coxeter group; Mathematics; Combinatorics; Polytope; Coset; Vertex (graph theory); Type (biology); Symmetric group; Graph","score_opus":0.010077732651104067,"score_gpt":0.17369821090648002,"score_spread":0.16362047825537596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161227694","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81658757,0.00028618166,0.120258786,0.00057149853,0.0001822841,0.00010687037,0.00027581176,0.00037761248,0.061353374],"genre_scores_gemma":[0.9785624,0.00011852421,0.0103986515,0.00006113865,0.00007271987,0.00007351157,0.00016026203,0.00004428487,0.010508552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989599,0.00017298525,0.00008059728,0.0002544834,0.0002919757,0.00023999202],"domain_scores_gemma":[0.99910223,0.00028149472,0.00015157853,0.00019297723,0.00009079497,0.0001809128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052583613,0.0003607403,0.00047976463,0.0010309146,0.0017179055,0.0034649363,0.000523239,0.0006835639,0.0057036513],"category_scores_gemma":[0.0014255376,0.00040556665,0.0007045184,0.0010186125,0.00282122,0.003256869,0.002463423,0.0011452542,0.00075356965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023468043,0.00001362419,0.00025078,0.000012126115,0.000003040385,0.00014915908,0.00029538627,0.0007837186,0.0012409333,0.994396,0.00021144436,0.0026203587],"study_design_scores_gemma":[0.0000427195,0.00004320749,0.0004542117,0.00001753479,0.000013354021,0.00028177694,0.0004959137,0.009686426,0.0030494144,0.9760351,0.009857495,0.00002290056],"about_ca_topic_score_codex":0.0006693588,"about_ca_topic_score_gemma":0.00066636817,"teacher_disagreement_score":0.0057036513,"about_ca_system_score_codex":0.0013077535,"about_ca_system_score_gemma":0.00055799255,"threshold_uncertainty_score":0.019080639},"labels":[],"label_agreement":null},{"id":"W3169538887","doi":"10.1017/jsl.2021.38","title":"CONTRIBUTIONS TO THE THEORY OF <i>F</i>-AUTOMATIC SETS","year":2021,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Endomorphism; Injective function; NIP; Abelian group; Mathematics; Automaticity; Prime (order theory); Combinatorics; Set (abstract data type); Multiplication (music); Discrete mathematics; Pure mathematics; Computer science","score_opus":0.015106567953820968,"score_gpt":0.27411389948587456,"score_spread":0.2590073315320536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169538887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33528775,0.0014861659,0.3943005,0.0041253245,0.00060030585,0.000054430533,0.00039576215,0.0005904689,0.26315933],"genre_scores_gemma":[0.958129,0.0004684911,0.029547866,0.00035338753,0.000530874,0.000057843234,0.0001716277,0.00007418044,0.0106666535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991272,0.00018836212,0.00004432018,0.00019990517,0.00028551105,0.00015469352],"domain_scores_gemma":[0.99757427,0.0013214934,0.00023504364,0.00034325226,0.000316938,0.00020907987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009840637,0.00040883955,0.00039185066,0.0016999972,0.0014978752,0.0027131643,0.0010756693,0.0009929324,0.004817197],"category_scores_gemma":[0.0027173648,0.0004411499,0.0007678999,0.0011288895,0.0046122354,0.004070654,0.0022666533,0.0021326747,0.00055416476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007751579,0.000005460797,0.0001778962,0.000015028721,0.000002081718,0.000045788238,0.00017561432,0.0010210703,0.00040443006,0.9957618,0.00037202434,0.0020110728],"study_design_scores_gemma":[0.0000041699727,0.000008891327,0.0001486101,0.0000095064715,0.000003678956,0.00007473698,0.00006388703,0.0072297878,0.000439981,0.98775965,0.0042475914,0.000009345495],"about_ca_topic_score_codex":0.0010140679,"about_ca_topic_score_gemma":0.0006175078,"teacher_disagreement_score":0.004817197,"about_ca_system_score_codex":0.0018943425,"about_ca_system_score_gemma":0.00057353213,"threshold_uncertainty_score":0.01611507},"labels":[],"label_agreement":null},{"id":"W3169850973","doi":"10.1142/s0129054121420028","title":"Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lexicographical order; Regular language; Mathematics; State (computer science); Combinatorics; Word (group theory); Discrete mathematics; Computer science; Automaton; Artificial intelligence; Algorithm","score_opus":0.012540010066171578,"score_gpt":0.2983123553723818,"score_spread":0.28577234530621026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169850973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23198636,0.0002880491,0.7570027,0.00092213694,0.00006653375,0.00020391817,0.000748073,0.0034281875,0.0053539895],"genre_scores_gemma":[0.54730195,0.00024981415,0.44528195,0.00028325262,0.000070521266,0.00032675322,0.0020042413,0.00054912304,0.003932412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960622,0.000679542,0.0004658218,0.001344444,0.00086859724,0.00057943823],"domain_scores_gemma":[0.98641557,0.009644799,0.0011495717,0.001739414,0.0007580103,0.00029275144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018754087,0.00090909534,0.001116069,0.0017326567,0.0011878251,0.003965337,0.0022607376,0.0016168137,0.004550365],"category_scores_gemma":[0.015114926,0.0012605914,0.0031756053,0.0019239307,0.0032337676,0.012250168,0.002958917,0.0024228191,0.0010836744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00167346,0.0006196519,0.011907204,0.0015467384,0.00020300919,0.00093577366,0.0031386027,0.20445709,0.062804885,0.50103676,0.00464074,0.20703611],"study_design_scores_gemma":[0.00010498945,0.00016902854,0.0008064378,0.00010337515,0.00013810582,0.000249647,0.00035184072,0.320304,0.04877221,0.6241849,0.0047028447,0.000112591806],"about_ca_topic_score_codex":0.004368917,"about_ca_topic_score_gemma":0.006553415,"teacher_disagreement_score":0.004550365,"about_ca_system_score_codex":0.0025427553,"about_ca_system_score_gemma":0.0027331326,"threshold_uncertainty_score":0.018449008},"labels":[],"label_agreement":null},{"id":"W3176232965","doi":"10.1007/978-3-030-79121-6_7","title":"Degrees of Restriction for Two-Dimensional Automata","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Nondeterministic finite automaton; Automaton; Computer science; Closure (psychology); Mobile automaton; Deterministic automaton; Automata theory; Nested word; ω-automaton; Quantum finite automata; Deterministic finite automaton; Discrete mathematics; Algorithm; Theoretical computer science; Mathematics","score_opus":0.01989656258438412,"score_gpt":0.25560705739146267,"score_spread":0.23571049480707854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176232965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2377696,0.0020768302,0.40235788,0.0022221769,0.0007642206,0.00016932191,0.0009985527,0.0010851747,0.35255635],"genre_scores_gemma":[0.9161724,0.0009614716,0.039978795,0.0003548471,0.00040446705,0.00032201686,0.000646045,0.0002463967,0.040913645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987851,0.00031483703,0.00010886414,0.00023872158,0.00032824624,0.00022426608],"domain_scores_gemma":[0.99700016,0.0018683494,0.00014444528,0.00043138122,0.00022599041,0.00032971503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011825919,0.00070047274,0.0008647199,0.0016910704,0.0017973345,0.004673027,0.0011902092,0.00083538354,0.008946254],"category_scores_gemma":[0.0031639284,0.0007366426,0.0010771223,0.0015572055,0.004355226,0.0072908783,0.003409161,0.004124901,0.0014558391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041763862,0.000015506143,0.00006860853,0.00003022323,0.0000033261774,0.000023957158,0.0002627542,0.0004835982,0.00071666733,0.9918526,0.0006185734,0.005882329],"study_design_scores_gemma":[0.000018898698,0.000014938143,0.00012250392,0.000012197111,0.0000054773323,0.00007302483,0.00008887133,0.0019038387,0.0007204537,0.992105,0.0049186717,0.000016250342],"about_ca_topic_score_codex":0.0005695248,"about_ca_topic_score_gemma":0.0005139722,"teacher_disagreement_score":0.008946254,"about_ca_system_score_codex":0.0012448907,"about_ca_system_score_gemma":0.0005373384,"threshold_uncertainty_score":0.029928148},"labels":[],"label_agreement":null},{"id":"W3183377724","doi":"10.1007/s00236-021-00399-6","title":"On the size of partial derivatives and the word membership problem","year":2021,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Fundação para a Ciência e a Tecnologia; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Word (group theory); Computer science; Mathematics; Linguistics; Algorithm; Philosophy","score_opus":0.011602762286817978,"score_gpt":0.21218272425894133,"score_spread":0.20057996197212336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183377724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6280048,0.002756074,0.29334185,0.026297152,0.00042896526,0.0001382051,0.0015375504,0.00081879954,0.046676617],"genre_scores_gemma":[0.96681446,0.0007128111,0.023761362,0.00059923955,0.0005105106,0.00014465665,0.00051269296,0.00029500923,0.006649255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994303,0.002655575,0.000353188,0.0009702125,0.0011302446,0.00058774883],"domain_scores_gemma":[0.8226803,0.16184728,0.0032241764,0.005868383,0.0027256394,0.0036542474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008167137,0.0007354239,0.0030784265,0.0021608677,0.0022172388,0.0076216348,0.0036875168,0.0036699746,0.011612464],"category_scores_gemma":[0.066039644,0.001196097,0.0012999307,0.002782556,0.008592311,0.028557686,0.0047593107,0.0051600146,0.0005973342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038724084,0.00011896588,0.0016831832,0.00016199399,0.00003491089,0.00015331038,0.00060641393,0.011627595,0.0013779367,0.966771,0.0032783614,0.01379918],"study_design_scores_gemma":[0.000036886704,0.000023376238,0.00023662092,0.000016502827,0.000012204159,0.00007754236,0.00009931231,0.027686408,0.00041287535,0.9707618,0.0006174907,0.000018928797],"about_ca_topic_score_codex":0.0012521555,"about_ca_topic_score_gemma":0.00082611706,"teacher_disagreement_score":0.011612464,"about_ca_system_score_codex":0.002740684,"about_ca_system_score_gemma":0.0017261197,"threshold_uncertainty_score":0.043192446},"labels":[],"label_agreement":null},{"id":"W3183587779","doi":"10.55016/ojs/cdm.v16i2.71729","title":"Reconstructing the topology on monoids and polymorphism clones of reducts of the rationals","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rational number; Monoid; Endomorphism; Mathematics; Combinatorics","score_opus":0.011116799403799933,"score_gpt":0.2674111510308947,"score_spread":0.25629435162709474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183587779","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8017436,0.0006951132,0.17983577,0.0005607341,0.00007717501,0.00005522523,0.00021674756,0.00032767552,0.016488083],"genre_scores_gemma":[0.94846225,0.00063153874,0.040076796,0.00011869306,0.00011530388,0.00005464759,0.00035634876,0.00012642283,0.010057943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889153,0.00022425747,0.00008690627,0.000340282,0.00031783112,0.00013917533],"domain_scores_gemma":[0.9960289,0.0018169554,0.0005502311,0.00085424766,0.00039804194,0.00035167136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012271883,0.000447434,0.000708683,0.0016871144,0.0010053815,0.0029895667,0.00075003656,0.0006513027,0.0027943952],"category_scores_gemma":[0.004761017,0.0005292857,0.0012001432,0.0010407477,0.0027929698,0.005431704,0.00285508,0.002134759,0.00039242933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011834532,0.000029499357,0.0027273134,0.000079937585,0.000018268505,0.0004359226,0.0016825373,0.0032390768,0.0075061736,0.9664484,0.0002470627,0.01746742],"study_design_scores_gemma":[0.00004599487,0.00016915702,0.0030981174,0.000036844034,0.00004693546,0.0010394827,0.0009193576,0.016503872,0.015453669,0.9514985,0.0111247795,0.000063345986],"about_ca_topic_score_codex":0.0010939784,"about_ca_topic_score_gemma":0.00075849,"teacher_disagreement_score":0.0029895667,"about_ca_system_score_codex":0.0009760481,"about_ca_system_score_gemma":0.0004840802,"threshold_uncertainty_score":0.009348154},"labels":[],"label_agreement":null},{"id":"W3186614868","doi":"","title":"Mesosome Avoidance.","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Alphabet; Conjugate; Mathematics; Combinatorics; Pure mathematics; Mathematical analysis; Philosophy; Linguistics","score_opus":0.05169880687379649,"score_gpt":0.1681797954940208,"score_spread":0.1164809886202243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186614868","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6527365,0.0011095359,0.2689226,0.0008036727,0.00032280822,0.00014901524,0.0008417134,0.00072722824,0.07438684],"genre_scores_gemma":[0.9469897,0.0002879614,0.03314324,0.00017115318,0.00006872099,0.00010482968,0.00055660744,0.00009646096,0.018581333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963117,0.00003421536,0.000031846208,0.00013266635,0.000094653085,0.00007554171],"domain_scores_gemma":[0.9988105,0.00038359527,0.00024052706,0.00018215858,0.00021885727,0.00016432974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021982905,0.0003708362,0.00030038832,0.000796083,0.0011821515,0.0011316049,0.00061351864,0.0004874506,0.0058610556],"category_scores_gemma":[0.001463363,0.00022913849,0.000595633,0.00044321676,0.0011869192,0.0018104255,0.0015072576,0.00072162715,0.0011335533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024070995,0.000083039544,0.007465813,0.00036962063,0.000038962673,0.0011767617,0.0016828175,0.0051451186,0.034727037,0.9070739,0.0039539053,0.03804225],"study_design_scores_gemma":[0.000030984032,0.00019172461,0.0030227539,0.00015417676,0.00007934508,0.0026420162,0.0012601211,0.026904648,0.03389969,0.8742489,0.057506766,0.000058895297],"about_ca_topic_score_codex":0.00059928594,"about_ca_topic_score_gemma":0.0009313697,"teacher_disagreement_score":0.0058610556,"about_ca_system_score_codex":0.00054077985,"about_ca_system_score_gemma":0.00037239568,"threshold_uncertainty_score":0.019607127},"labels":[],"label_agreement":null},{"id":"W3189147489","doi":"10.1051/ita/2022006","title":"Automatic sequences of rank two","year":2022,"lang":"en","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Decidability; Rank (graph theory); Concatenation (mathematics); Property (philosophy); Combinatorics; Class (philosophy); Mathematics; Word (group theory); Set (abstract data type); Integer (computer science); Discrete mathematics; Computer science; Artificial intelligence; Linguistics","score_opus":0.0063962751302120155,"score_gpt":0.2407304873681937,"score_spread":0.23433421223798168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189147489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8415286,0.0006132935,0.09449368,0.0007167478,0.00018456588,0.00011232621,0.0013916806,0.0017346605,0.059224326],"genre_scores_gemma":[0.9708092,0.00010820411,0.017112985,0.00010061965,0.00013381854,0.0001249725,0.0008590272,0.000086546366,0.0106646875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985587,0.00029194335,0.00014988336,0.00038413014,0.0003381061,0.0002773316],"domain_scores_gemma":[0.9935044,0.0032496608,0.0009271165,0.0007297432,0.0009933352,0.00059576036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058016,0.0004670933,0.00038316575,0.0012734619,0.0012352854,0.0022237708,0.0005392306,0.0005475936,0.005807392],"category_scores_gemma":[0.0043823035,0.00035636724,0.00056420587,0.00059715833,0.0019847031,0.003145275,0.0011819814,0.0009794837,0.001059419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043251622,0.00010002668,0.0029925844,0.00023602629,0.000023959265,0.0007606182,0.0016952469,0.0049943444,0.03389076,0.92624515,0.0027084313,0.025920225],"study_design_scores_gemma":[0.00008783864,0.00021383309,0.002668132,0.00008023384,0.00003321126,0.0010606075,0.00056999,0.034054253,0.019849954,0.9182213,0.023033015,0.00012766049],"about_ca_topic_score_codex":0.0005979648,"about_ca_topic_score_gemma":0.00061568397,"teacher_disagreement_score":0.005807392,"about_ca_system_score_codex":0.0009064024,"about_ca_system_score_gemma":0.0008031214,"threshold_uncertainty_score":0.019427717},"labels":[],"label_agreement":null},{"id":"W3196411836","doi":"10.1016/j.tcs.2022.03.013","title":"Positive planar satisfiability problems under 3-connectivity constraints","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Bangladesh University of Engineering and Technology","keywords":"Combinatorics; Mathematics; Planar graph; Planarity testing; Satisfiability; Discrete mathematics; Planar; Matching (statistics); Graph; Time complexity; Computer science","score_opus":0.009563311863093891,"score_gpt":0.2284865948402183,"score_spread":0.2189232829771244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196411836","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5199673,0.0011903718,0.39585912,0.010842222,0.00026919326,0.000350966,0.0025110508,0.0011422437,0.067867465],"genre_scores_gemma":[0.9071831,0.00072545605,0.075207196,0.0008234441,0.00031863345,0.00024956898,0.0019839269,0.00029571264,0.013212879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851006,0.0004956915,0.00011032487,0.00036162423,0.000296895,0.00022533828],"domain_scores_gemma":[0.98292714,0.014590468,0.0010926056,0.0004949503,0.0005152849,0.00037948755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014723886,0.0007968256,0.0011655616,0.0009151105,0.0013924197,0.004203074,0.0021095674,0.0025689797,0.011952411],"category_scores_gemma":[0.011564252,0.001076068,0.0014729622,0.0021167416,0.0023905446,0.009137537,0.0027914587,0.0034941616,0.00079515687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065364863,0.0002688421,0.0016932527,0.0009188994,0.00016893548,0.00095703994,0.0010127106,0.11455982,0.00771471,0.811934,0.012299788,0.047818337],"study_design_scores_gemma":[0.00014041683,0.00004976502,0.0003932278,0.000048703634,0.00006573244,0.00027322827,0.0004130815,0.07732577,0.0037422783,0.9143454,0.0031722994,0.000029992732],"about_ca_topic_score_codex":0.0018859018,"about_ca_topic_score_gemma":0.0024487076,"teacher_disagreement_score":0.011952411,"about_ca_system_score_codex":0.0014099913,"about_ca_system_score_gemma":0.0009416187,"threshold_uncertainty_score":0.039984763},"labels":[],"label_agreement":null},{"id":"W3199131588","doi":"10.1142/s0129054121420090","title":"Space Complexity of Stack Automata Models","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Decidability; Automaton; Measure (data warehouse); Stack (abstract data type); Bounded function; Computer science; Word (group theory); Discrete mathematics; Function (biology); Mathematics; Pushdown automaton; Theoretical computer science; Programming language","score_opus":0.051088884067070364,"score_gpt":0.31622316539600487,"score_spread":0.2651342813289345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199131588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48687878,0.0015880591,0.4907061,0.0017558142,0.00008273319,0.0001685346,0.0013851364,0.0013122453,0.016122455],"genre_scores_gemma":[0.9488344,0.0005770235,0.045155756,0.00012961347,0.0001313258,0.00024760852,0.0007726082,0.0002519598,0.0038997012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942498,0.0012422225,0.0005041181,0.0011142965,0.0021102582,0.00077926466],"domain_scores_gemma":[0.9720344,0.02145975,0.0019248637,0.0026353726,0.0011734149,0.00077227445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021206622,0.0012486231,0.0013992765,0.0023051198,0.0015082913,0.0066097733,0.0024249973,0.0019061118,0.006595318],"category_scores_gemma":[0.017017424,0.0009833464,0.0025330058,0.002300376,0.0038917696,0.015564638,0.0036010698,0.002513421,0.00053500815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041172197,0.00012795658,0.00437686,0.00039638815,0.0001584867,0.00028533486,0.0012730156,0.22601432,0.007246331,0.73866427,0.0014510987,0.01959428],"study_design_scores_gemma":[0.000028222199,0.000064982436,0.0005740904,0.000029737372,0.000054482516,0.00013354502,0.00014525873,0.34233204,0.0031874091,0.65157384,0.0018360699,0.000040360133],"about_ca_topic_score_codex":0.0030109803,"about_ca_topic_score_gemma":0.0021087977,"teacher_disagreement_score":0.0066097733,"about_ca_system_score_codex":0.003331586,"about_ca_system_score_gemma":0.0019443914,"threshold_uncertainty_score":0.024172485},"labels":[],"label_agreement":null},{"id":"W3200958393","doi":"10.4153/s0008439521000564","title":"On semidirectly closed pseudovarieties of finite semigroups and monoids","year":2021,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Semigroup; Combinatorics","score_opus":0.006739570748546352,"score_gpt":0.189201737907681,"score_spread":0.18246216715913463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200958393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5752648,0.006822856,0.3312666,0.0021268514,0.0005010865,0.00010082662,0.0007610561,0.000490145,0.08266567],"genre_scores_gemma":[0.95933145,0.0011393693,0.02992339,0.00019356563,0.0002864545,0.00008989902,0.0004543534,0.000055625496,0.008525816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985745,0.00041650454,0.00011831342,0.00029898962,0.00044188477,0.00014980887],"domain_scores_gemma":[0.9972683,0.001598096,0.00023058223,0.00025954196,0.00033393514,0.00030949735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001384018,0.0003565015,0.00062193023,0.0014940895,0.0015144367,0.0034933717,0.00072734617,0.00057797437,0.003353895],"category_scores_gemma":[0.0028437953,0.00040922168,0.00091533334,0.0014258723,0.005085885,0.006701083,0.0027414006,0.0015370197,0.0004231074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036023866,0.0000114412605,0.00034055376,0.000037568258,0.0000056280555,0.00014291167,0.0006134313,0.000523237,0.0012570424,0.99245185,0.00031666784,0.004263658],"study_design_scores_gemma":[0.000019386598,0.000046153582,0.00070560386,0.000030061046,0.000009349533,0.0004023785,0.00040589945,0.005311361,0.0015783327,0.9832212,0.0082508875,0.00001934152],"about_ca_topic_score_codex":0.0018922763,"about_ca_topic_score_gemma":0.0011554412,"teacher_disagreement_score":0.0034933717,"about_ca_system_score_codex":0.0017542971,"about_ca_system_score_gemma":0.00078279286,"threshold_uncertainty_score":0.012728393},"labels":[],"label_agreement":null},{"id":"W3202595936","doi":"10.1142/s0218196723500133","title":"Cogrowth series for free products of finite groups","year":2022,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Generating set of a group; Cayley graph; Alphabet; Symmetric group; Free product; Group (periodic table); Discrete mathematics; Graph","score_opus":0.010833698914913082,"score_gpt":0.24161646759643685,"score_spread":0.23078276868152375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202595936","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84948426,0.0015136813,0.106805295,0.0009439878,0.00015991005,0.000069991365,0.00038611842,0.00047887518,0.040157914],"genre_scores_gemma":[0.9841696,0.0003824023,0.008428776,0.000067578876,0.00020409487,0.000072653966,0.00022769862,0.000059767513,0.006387422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925584,0.00014293242,0.000042857362,0.00016752792,0.00023549868,0.00015526683],"domain_scores_gemma":[0.9965088,0.0020139522,0.00047730247,0.00024225841,0.00029258474,0.00046508224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012651175,0.00070115866,0.0008070209,0.002625442,0.0012832199,0.0020361992,0.00093350234,0.0005393953,0.005789752],"category_scores_gemma":[0.005098367,0.0003045352,0.00091062026,0.0012029387,0.002641006,0.0037361854,0.0014594218,0.0013117878,0.00074554817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010135657,0.000035853976,0.0013319507,0.00008943083,0.000011680235,0.00019803214,0.00057674095,0.0044646575,0.0019891246,0.9817281,0.0006854739,0.0087876655],"study_design_scores_gemma":[0.000023665583,0.00006501134,0.0007491543,0.000021521493,0.000017291124,0.0002480377,0.00009974174,0.030208629,0.0023034683,0.962763,0.0034801853,0.000020269523],"about_ca_topic_score_codex":0.000643051,"about_ca_topic_score_gemma":0.00048044903,"teacher_disagreement_score":0.005789752,"about_ca_system_score_codex":0.002034217,"about_ca_system_score_gemma":0.0006388327,"threshold_uncertainty_score":0.019368649},"labels":[],"label_agreement":null},{"id":"W3203615789","doi":"10.1090/tran/8671","title":"Simultaneous rational approximation to successive powers of a real number","year":2022,"lang":"lv","type":"article","venue":"Transactions of the American Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Artificial intelligence; Computer science","score_opus":0.009436427657698511,"score_gpt":0.2602173234816138,"score_spread":0.2507808958239153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203615789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019902295,0.0007512523,0.9119716,0.0006349745,0.0007975659,0.00006733787,0.000160875,0.0019501637,0.06376385],"genre_scores_gemma":[0.57144207,0.0019073533,0.35059416,0.0007762181,0.0014064471,0.00028039404,0.00050356454,0.0036454028,0.06944437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99578863,0.0008490132,0.00027901193,0.0010087278,0.0015806583,0.0004939364],"domain_scores_gemma":[0.9945385,0.0026765566,0.00033584688,0.0014609667,0.000741534,0.00024657158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031876701,0.001955693,0.0012185593,0.0027166798,0.0008117809,0.0045492547,0.002226675,0.00081544014,0.023593282],"category_scores_gemma":[0.018468449,0.00073658995,0.0023202675,0.0017804871,0.002949417,0.007159012,0.0042848517,0.00470694,0.012180866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023308271,0.000049484155,0.00069027924,0.00023486644,0.000043907352,0.00029817957,0.00052797655,0.006955121,0.0038637514,0.9131213,0.006856241,0.06712585],"study_design_scores_gemma":[0.000051331604,0.00010984055,0.0004032591,0.00011313473,0.00008095674,0.00042133706,0.0001409067,0.13014543,0.012347074,0.8096078,0.046514466,0.00006443991],"about_ca_topic_score_codex":0.0012019497,"about_ca_topic_score_gemma":0.0014712764,"teacher_disagreement_score":0.023593282,"about_ca_system_score_codex":0.0018078069,"about_ca_system_score_gemma":0.00085649575,"threshold_uncertainty_score":0.0789274},"labels":[],"label_agreement":null},{"id":"W3206558031","doi":"10.37236/10799","title":"Congruence Properties of Combinatorial Sequences via Walnut and the Rowland-Yassawi-Zeilberger Automaton","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Modulo; Catalan number; Congruence (geometry); Automaton; Combinatorics; Prime (order theory); Discrete mathematics; Congruence relation; Theoretical computer science; Computer science","score_opus":0.005608120209821498,"score_gpt":0.19187676655686822,"score_spread":0.18626864634704673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206558031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74737966,0.000523321,0.1971073,0.0007876793,0.00019056031,0.0001469803,0.00028794282,0.0004953456,0.053081263],"genre_scores_gemma":[0.96666884,0.00015565893,0.02796719,0.000119696175,0.00008688563,0.00009341936,0.00017176963,0.00007749628,0.0046590343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998629,0.00022918191,0.00011170521,0.00033097094,0.00050842203,0.0001908451],"domain_scores_gemma":[0.997968,0.001092167,0.00022644528,0.00022582417,0.000282967,0.00020455752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082513096,0.00033135983,0.0005762571,0.001199196,0.0015903399,0.0027091147,0.0007867684,0.0009224231,0.0035772386],"category_scores_gemma":[0.004131578,0.00041635477,0.0008295287,0.0008390721,0.0032631815,0.0032981217,0.0012193222,0.0015194237,0.0005804877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060031507,0.000026386584,0.000490679,0.00001922565,0.000004829515,0.00018307922,0.00045956983,0.001978506,0.005731892,0.98684573,0.00023072421,0.003969423],"study_design_scores_gemma":[0.000044968372,0.00008070027,0.0006898086,0.000017159253,0.00001415442,0.00019523407,0.00016587117,0.027180279,0.007616715,0.961266,0.002697086,0.00003201551],"about_ca_topic_score_codex":0.0017984058,"about_ca_topic_score_gemma":0.0017643456,"teacher_disagreement_score":0.0035772386,"about_ca_system_score_codex":0.0012131187,"about_ca_system_score_gemma":0.000892761,"threshold_uncertainty_score":0.011967063},"labels":[],"label_agreement":null},{"id":"W3209834539","doi":"10.1216/rmj.2023.53.755","title":"SYMBOLIC SUBSTITUTIONS, BRATTELI DIAGRAMS AND OPERATOR ALGEBRAS","year":2023,"lang":"en","type":"article","venue":"Rocky Mountain Journal of Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Mathematics; Equivalence relation; Equivalence (formal languages); Pure mathematics; Invariant (physics); Operator (biology); Fibonacci number; Algebra over a field; Discrete mathematics","score_opus":0.0137436395996189,"score_gpt":0.24558725532972486,"score_spread":0.23184361573010595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209834539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20758502,0.0064795846,0.6799594,0.0014770274,0.0006249158,0.00011694461,0.00019341662,0.00055894523,0.10300469],"genre_scores_gemma":[0.8724704,0.00283818,0.10661111,0.00037326547,0.00032430826,0.00013148125,0.00019039298,0.00011196822,0.016948901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989773,0.00035457706,0.000075946,0.0001585812,0.00025297812,0.00018067208],"domain_scores_gemma":[0.9985096,0.0006551136,0.00029347348,0.00017766774,0.0002264878,0.00013753343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010939759,0.00044960313,0.00045802706,0.0016753162,0.0015593858,0.0027403866,0.0007212114,0.0012582331,0.0041315896],"category_scores_gemma":[0.0029436916,0.00028819538,0.00065806555,0.0017542479,0.0042061526,0.0055694417,0.0014039984,0.0014140881,0.00076001993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007571967,0.000008724627,0.000121457924,0.000026543312,0.0000028464801,0.00009025022,0.0003193131,0.0008765063,0.001466788,0.9930131,0.00013632265,0.0039305654],"study_design_scores_gemma":[0.000004363318,0.00002532604,0.00013104583,0.000022029828,0.0000062665003,0.00017213676,0.00021122642,0.004966589,0.001634235,0.98559546,0.007217887,0.0000133282565],"about_ca_topic_score_codex":0.0013317912,"about_ca_topic_score_gemma":0.0011665857,"teacher_disagreement_score":0.0041315896,"about_ca_system_score_codex":0.0010543966,"about_ca_system_score_gemma":0.00085562223,"threshold_uncertainty_score":0.013821542},"labels":[],"label_agreement":null},{"id":"W3212109522","doi":"10.5802/crmath.408","title":"Prefixes of the Fibonacci word that end with a cube","year":2023,"lang":"en","type":"article","venue":"Comptes Rendus Mathématique","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fibonacci number; Prefix; Word (group theory); Mathematics; Cube (algebra); Combinatorics; Arithmetic; Pisano period; Fibonacci polynomials; Discrete mathematics; Geometry; Linguistics","score_opus":0.0173094521457045,"score_gpt":0.22189025039074295,"score_spread":0.20458079824503844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212109522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49741384,0.0019072938,0.24888943,0.0011852667,0.0007805319,0.00024998432,0.0014611991,0.0013231322,0.24678937],"genre_scores_gemma":[0.79857343,0.0013686835,0.13699119,0.0005514293,0.0001671338,0.00045443376,0.0020966562,0.00088683586,0.058910236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993974,0.00010575982,0.000055123048,0.0001085682,0.00018622437,0.00014695611],"domain_scores_gemma":[0.9984126,0.0008511575,0.00015015042,0.00012994089,0.0003704767,0.00008552506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055705034,0.00052242546,0.00047127274,0.0008881874,0.0019046122,0.0017477483,0.00038418183,0.0010406639,0.0121887],"category_scores_gemma":[0.0039662845,0.0004350129,0.0007143568,0.001370777,0.0016199218,0.0031585926,0.0010794274,0.00089751935,0.0031002802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015406073,0.000027689453,0.00091416,0.000119279954,0.00001265645,0.001151691,0.0012140939,0.0027964173,0.0076378994,0.9571015,0.0044177063,0.024452785],"study_design_scores_gemma":[0.000030431218,0.0001240122,0.001409444,0.00014004983,0.00003410303,0.0014008717,0.0011373425,0.014285068,0.016171781,0.8816591,0.083539195,0.00006850342],"about_ca_topic_score_codex":0.0020648078,"about_ca_topic_score_gemma":0.0023088283,"teacher_disagreement_score":0.0121887,"about_ca_system_score_codex":0.0011056324,"about_ca_system_score_gemma":0.00093493186,"threshold_uncertainty_score":0.0407753},"labels":[],"label_agreement":null},{"id":"W3212859878","doi":"10.1137/23m1558513","title":"Extending Dekking’s Construction of an Infinite Binary Word Avoiding Abelian 4-Powers","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Thompson Rivers University; University of Winnipeg","funders":"","keywords":"Abelian group; Word (group theory); Binary number; Construct (python library); Mathematics; Binary operation; Omega; Exponent; Discrete mathematics; Combinatorics; Pure mathematics; Arithmetic; Computer science; Physics; Linguistics; Quantum mechanics; Geometry","score_opus":0.01647246899495382,"score_gpt":0.2752870181134576,"score_spread":0.2588145491185038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212859878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37290055,0.0004142501,0.5501102,0.0006734475,0.0005448506,0.00013577029,0.00019843335,0.0008340162,0.07418852],"genre_scores_gemma":[0.7231748,0.0004367499,0.24540858,0.00027321494,0.00013076756,0.00019851954,0.00024878947,0.00048509554,0.029643476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973136,0.000035593926,0.000030857107,0.000065524335,0.00007573685,0.00006093495],"domain_scores_gemma":[0.9994386,0.00019895284,0.00005408024,0.00011269043,0.0001331212,0.00006257739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028485886,0.00047798577,0.00043098436,0.0008143077,0.0010378314,0.0009833159,0.0005265559,0.00051001017,0.005010106],"category_scores_gemma":[0.0013821286,0.00034794124,0.00066130655,0.00043077365,0.0014171057,0.0020520566,0.0014950217,0.0011589868,0.0015955726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022077214,0.000086249645,0.0011562107,0.00033180136,0.000017260032,0.0008430424,0.0014466404,0.0041154823,0.07854602,0.8190975,0.0023141454,0.09182487],"study_design_scores_gemma":[0.000052269916,0.0002133419,0.0011702293,0.00011822536,0.00006370199,0.00080319605,0.0004316605,0.026717087,0.09695272,0.8113363,0.062042683,0.00009852978],"about_ca_topic_score_codex":0.00048732985,"about_ca_topic_score_gemma":0.0006487157,"teacher_disagreement_score":0.005010106,"about_ca_system_score_codex":0.0004808357,"about_ca_system_score_gemma":0.0003180899,"threshold_uncertainty_score":0.016760468},"labels":[],"label_agreement":null},{"id":"W3217440222","doi":"10.4171/ggd/821","title":"Amenability of quadratic automaton groups","year":2024,"lang":"en","type":"article","venue":"Groups Geometry and Dynamics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Mathematics; Quadratic equation; Degree (music); Combinatorics; Action (physics); Automaton; Discrete mathematics; Orbit (dynamics); Theoretical computer science; Computer science; Geometry","score_opus":0.005864219216535241,"score_gpt":0.22448340880354115,"score_spread":0.2186191895870059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217440222","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8142397,0.00022756061,0.14545663,0.0003803273,0.00006859841,0.000041890842,0.000126894,0.0004128721,0.039045528],"genre_scores_gemma":[0.9889932,0.000075499825,0.00450705,0.000040868195,0.000046748806,0.00002462425,0.00008309212,0.000042879077,0.0061859214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995566,0.000079238474,0.000017820761,0.00014959082,0.0001206681,0.000076007585],"domain_scores_gemma":[0.99856746,0.0006452448,0.00022915796,0.00023054924,0.00012071147,0.00020690933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030197648,0.00036286894,0.00035898807,0.00078755076,0.00062488107,0.0010156289,0.0006062135,0.00041924426,0.010822807],"category_scores_gemma":[0.0020383243,0.00018955811,0.00052904437,0.00025352012,0.001292629,0.0016620347,0.0013217423,0.00093943445,0.00082755106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002215367,0.000051468287,0.0022844295,0.00011370382,0.000025125824,0.00029422573,0.0007827388,0.017795103,0.02421736,0.9420215,0.0005904747,0.01160232],"study_design_scores_gemma":[0.000037099217,0.00023792402,0.00270402,0.000018424002,0.000034934284,0.00034383804,0.00025802894,0.10392886,0.007843129,0.87937766,0.0051788953,0.000037153142],"about_ca_topic_score_codex":0.0004989371,"about_ca_topic_score_gemma":0.00053400453,"teacher_disagreement_score":0.010822807,"about_ca_system_score_codex":0.00037512518,"about_ca_system_score_gemma":0.00012655782,"threshold_uncertainty_score":0.036205888},"labels":[],"label_agreement":null},{"id":"W32599491","doi":"10.1016/j.media.2020.101758","title":"Operational State Complexity of Prefix-Free Regular Languages.","year":2009,"lang":"en","type":"article","venue":"Automata and Formal Languages","topic":"semigroups and automata theory","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Prefix; Computer science; Regular language; Programming language; State (computer science); Theoretical computer science; Arithmetic; Automaton; Mathematics; Linguistics","score_opus":0.012214209482492586,"score_gpt":0.25001553398118254,"score_spread":0.23780132449868996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32599491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07172173,0.0005006667,0.9077579,0.0014542841,0.0001490226,0.00022605415,0.0017167673,0.0019503594,0.014523154],"genre_scores_gemma":[0.6935817,0.00048638266,0.28903514,0.0006922963,0.00027083253,0.0006537676,0.0037904726,0.0006915252,0.010797855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941825,0.0013688044,0.00078873656,0.0013755738,0.0014629848,0.0008214612],"domain_scores_gemma":[0.9789346,0.012990189,0.0015411812,0.0036299592,0.0024059343,0.0004980403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042563668,0.00081473024,0.00097544293,0.0016909601,0.0013427889,0.0053989566,0.0021406584,0.0014633554,0.0105262995],"category_scores_gemma":[0.025040226,0.00056842936,0.001788621,0.002079272,0.0027546147,0.01054417,0.0033858567,0.0031116356,0.0020795213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035391867,0.00011668138,0.0010035754,0.00025678097,0.00004766901,0.00024179665,0.0006163904,0.084564395,0.0019591898,0.8371114,0.004620107,0.069108106],"study_design_scores_gemma":[0.000026429047,0.000047194466,0.00011223581,0.000033729975,0.000017281129,0.00012288569,0.00009635011,0.2308758,0.0015545143,0.7636568,0.003433307,0.000023442386],"about_ca_topic_score_codex":0.0018964903,"about_ca_topic_score_gemma":0.0016973458,"teacher_disagreement_score":0.0105262995,"about_ca_system_score_codex":0.0021231328,"about_ca_system_score_gemma":0.0025572097,"threshold_uncertainty_score":0.035214007},"labels":[],"label_agreement":null},{"id":"W339857704","doi":"","title":"There are binary circular cube-free words of length n contained within the Thue-Morse word for all positive integers n.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Word (group theory); Morse code; Binary number; Cube (algebra); Combinatorics; Word length; Discrete mathematics; Arithmetic; Geometry; Computer science; Natural language processing; Telecommunications","score_opus":0.01057388134700569,"score_gpt":0.23592382872048187,"score_spread":0.2253499473734762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W339857704","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7030596,0.004578167,0.0850273,0.0019666879,0.00066086964,0.00012417107,0.00210325,0.00092049997,0.20155941],"genre_scores_gemma":[0.90692496,0.0015724229,0.040429056,0.0006186096,0.00019380322,0.00035643997,0.0020014588,0.0001501021,0.047753118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996141,0.000066006454,0.000034100376,0.00009373871,0.00008925879,0.00010272517],"domain_scores_gemma":[0.9980008,0.0010641107,0.0003720927,0.00013723502,0.00022486987,0.0002007998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029462774,0.00059148145,0.00053977413,0.0008290266,0.001982516,0.001983489,0.00054916297,0.0011362253,0.012499989],"category_scores_gemma":[0.0022476024,0.0004925583,0.00043516303,0.0010849491,0.0013420032,0.0027055268,0.0018557681,0.0008728681,0.0041605346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015452006,0.0001621658,0.0039926358,0.0009313497,0.00005230213,0.0026863304,0.0022580037,0.0020880143,0.03596422,0.8484069,0.011808706,0.090104245],"study_design_scores_gemma":[0.00011289116,0.0002314376,0.005169965,0.00024130118,0.000070138456,0.0029831112,0.0017662165,0.008339949,0.04208552,0.8730813,0.06572222,0.00019583367],"about_ca_topic_score_codex":0.00085806457,"about_ca_topic_score_gemma":0.0013720219,"teacher_disagreement_score":0.012499989,"about_ca_system_score_codex":0.0006352415,"about_ca_system_score_gemma":0.000796067,"threshold_uncertainty_score":0.04181665},"labels":[],"label_agreement":null},{"id":"W347217945","doi":"10.1017/cbo9780511760860","title":"Noncommutative Rational Series with Applications","year":2010,"lang":"en","type":"preprint","venue":"Cambridge University Press eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":200,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Noncommutative geometry; Algebra over a field; Series (stratigraphy); Power series; Computer science; Algebraic theory; Automaton; Representation (politics); Commutative property; Algebraic number; Mathematics; Theoretical computer science; Pure mathematics","score_opus":0.012691450552387542,"score_gpt":0.20673531057906763,"score_spread":0.1940438600266801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W347217945","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033032633,0.048033293,0.13032684,0.005636493,0.004539168,0.00006280184,0.00021434855,0.00048354853,0.7776708],"genre_scores_gemma":[0.7151685,0.036293287,0.05679788,0.0014435841,0.006409658,0.0001950806,0.00025808884,0.00024079086,0.1831932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993735,0.00017925305,0.000036925117,0.00013176163,0.00022521138,0.00005340019],"domain_scores_gemma":[0.99930096,0.0003218156,0.0000511008,0.00009725559,0.00015919498,0.0000696659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005932062,0.0008484995,0.0009319835,0.0020210566,0.0014405333,0.002814115,0.0005758799,0.00073648116,0.012220669],"category_scores_gemma":[0.0020828499,0.00029342374,0.00057906174,0.002808135,0.0021615906,0.0030095093,0.0024392793,0.0021987024,0.0025202995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005737612,0.000009915671,0.000040190615,0.000058372752,0.0000027779008,0.000065348635,0.00016214544,0.0006861137,0.0003355617,0.9851264,0.0026400266,0.01086755],"study_design_scores_gemma":[0.0000036138083,0.000010232939,0.00008704603,0.000033440614,0.0000032219152,0.00014989657,0.0000890903,0.0029557175,0.00020214697,0.93684,0.05961836,0.000007174781],"about_ca_topic_score_codex":0.00042844852,"about_ca_topic_score_gemma":0.00047414508,"teacher_disagreement_score":0.012220669,"about_ca_system_score_codex":0.0015318088,"about_ca_system_score_gemma":0.0004529579,"threshold_uncertainty_score":0.04088223},"labels":[],"label_agreement":null},{"id":"W40576911","doi":"10.25596/jalc-2004-333","title":"Context Derivation Sets and Context-Free Normal Forms","year":2004,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Terminal and nonterminal symbols; Symbol (formal); Context-free grammar; Context-sensitive grammar; Computer science; Tree-adjoining grammar; Context (archaeology); Grammar; Mildly context-sensitive grammar formalism; Indexed grammar; Extended Affix Grammar; Mathematics; Combinatory categorial grammar; Rule-based machine translation; Algorithm; Natural language processing; Artificial intelligence; Generative grammar; Programming language; Linguistics; Phrase structure rules","score_opus":0.009273650047310978,"score_gpt":0.19586749789400532,"score_spread":0.18659384784669433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W40576911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030326992,0.0008673227,0.9279304,0.0006425014,0.00017348754,0.0001510999,0.00026694624,0.0018206852,0.037820626],"genre_scores_gemma":[0.44038326,0.0010549276,0.5352294,0.00044490353,0.000226686,0.0003930748,0.0010198823,0.0006727183,0.020575201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997256,0.0007100048,0.00026364852,0.00060973613,0.0009857197,0.00017481849],"domain_scores_gemma":[0.9970668,0.0015376935,0.00015396958,0.0005904808,0.000514737,0.00013629391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016578157,0.0007691684,0.0004970794,0.0015664375,0.0011452395,0.0028404342,0.0011775509,0.0009794057,0.006948449],"category_scores_gemma":[0.005397999,0.0005185471,0.0010309402,0.0012040014,0.003967002,0.005261274,0.0024050327,0.0027470093,0.0021730764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021794947,0.000015844735,0.00012412106,0.000045850527,0.000007625448,0.00013387424,0.00035507313,0.0027739047,0.0016852483,0.9562154,0.0009261466,0.037695203],"study_design_scores_gemma":[0.0000096901695,0.000013616494,0.000053555275,0.000021505473,0.000006006604,0.00014030593,0.000050365834,0.0075164344,0.0022177426,0.97754216,0.012415857,0.000012773666],"about_ca_topic_score_codex":0.00070827146,"about_ca_topic_score_gemma":0.0007353244,"teacher_disagreement_score":0.006948449,"about_ca_system_score_codex":0.0011780978,"about_ca_system_score_gemma":0.000937207,"threshold_uncertainty_score":0.023244858},"labels":[],"label_agreement":null},{"id":"W40607377","doi":"10.1007/978-3-319-04298-5_39","title":"Unary NFAs with Limited Nondeterminism","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Unary operation; Nondeterministic algorithm; Regular language; Computer science; Nondeterministic finite automaton; Discrete mathematics; Automaton; Bounded function; Finite-state machine; Deterministic finite automaton; Exponential function; Mathematics; Combinatorics; Algorithm; Automata theory; Theoretical computer science","score_opus":0.01104340316334352,"score_gpt":0.21656867968437515,"score_spread":0.20552527652103164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W40607377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041805603,0.0020563353,0.84794086,0.0010836844,0.00046999715,0.00012039433,0.00042588313,0.0027931014,0.10330412],"genre_scores_gemma":[0.71682096,0.0017740258,0.22935581,0.00041982584,0.00041317433,0.0003295961,0.00060976326,0.00085569965,0.049421173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984736,0.0003371095,0.0001518876,0.00041218777,0.00045314096,0.00017207576],"domain_scores_gemma":[0.9966666,0.0018531338,0.00013087335,0.0009778857,0.00029638901,0.00007499508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015624282,0.0007575412,0.0008600315,0.00076777145,0.0010235606,0.0029883392,0.0016299364,0.0011616352,0.008291269],"category_scores_gemma":[0.0059480714,0.00080809015,0.0012845063,0.000781553,0.0025131258,0.011518542,0.0020374611,0.0030037272,0.0024520643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079186786,0.000027658401,0.0001665653,0.00026012055,0.000016732369,0.00012644168,0.00032010165,0.004367325,0.0042661806,0.9238137,0.0025941343,0.0639618],"study_design_scores_gemma":[0.000020520823,0.000024449531,0.00008453203,0.00008842009,0.00003341552,0.00029458612,0.00003149938,0.016161127,0.005227827,0.9483234,0.02968799,0.00002223963],"about_ca_topic_score_codex":0.0004767126,"about_ca_topic_score_gemma":0.00056982995,"teacher_disagreement_score":0.008291269,"about_ca_system_score_codex":0.0011579914,"about_ca_system_score_gemma":0.000708397,"threshold_uncertainty_score":0.027737081},"labels":[],"label_agreement":null},{"id":"W4200575172","doi":"10.3390/axioms10040338","title":"Two Extensions of Cover Automata","year":2021,"lang":"en","type":"article","venue":"Axioms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"Universitatea din București","keywords":"Nondeterministic finite automaton; Nondeterministic algorithm; DFA minimization; Quantum finite automata; Finite-state machine; Deterministic finite automaton; Cover (algebra); Automaton; Automata theory; Computational complexity theory; ω-automaton; Deterministic automaton; Mathematics; Regular language; Theoretical computer science; Transformation (genetics); Nested word; Computer science; Algorithm","score_opus":0.012192135861547021,"score_gpt":0.2524540472500556,"score_spread":0.24026191138850858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200575172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09352316,0.00057438883,0.86957777,0.00090600096,0.00019315636,0.00020856062,0.0005269958,0.0011267528,0.03336319],"genre_scores_gemma":[0.66177166,0.0004993482,0.32223257,0.00040273022,0.00020165298,0.00034571264,0.0010511196,0.00019779471,0.01329739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979462,0.00042421583,0.00017482656,0.0005523596,0.00067776954,0.00022466746],"domain_scores_gemma":[0.9952179,0.0021350742,0.00034190013,0.0015085975,0.00056498486,0.0002315922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009663766,0.00052101986,0.0005346011,0.0008726466,0.0008002426,0.0016221412,0.0011827023,0.0009728641,0.0059550954],"category_scores_gemma":[0.005806561,0.00040104744,0.0014768365,0.0007996092,0.001669394,0.0038439732,0.002089825,0.0017012892,0.0007617152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022400818,0.00013454477,0.0011725487,0.00014484022,0.000034669247,0.00044263172,0.00081906485,0.032615278,0.008260464,0.87308997,0.0026358783,0.080426075],"study_design_scores_gemma":[0.000049250462,0.0002140024,0.0007655964,0.0000829554,0.00005479436,0.0009960503,0.000196709,0.19868408,0.008436266,0.7295135,0.060939297,0.00006747404],"about_ca_topic_score_codex":0.0010480463,"about_ca_topic_score_gemma":0.0012214739,"teacher_disagreement_score":0.0059550954,"about_ca_system_score_codex":0.0009062928,"about_ca_system_score_gemma":0.00076912215,"threshold_uncertainty_score":0.01992178},"labels":[],"label_agreement":null},{"id":"W4205114821","doi":"10.1016/j.tcs.2019.10.009","title":"Preface","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.004675915981703264,"score_gpt":0.21808375355248175,"score_spread":0.21340783757077847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205114821","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013351644,0.012073082,0.009279256,0.046336465,0.25923637,0.00041720644,0.009656881,0.0016320621,0.6600335],"genre_scores_gemma":[0.0056254985,0.003963224,0.002369373,0.00700159,0.027506288,0.00019641791,0.0052237213,0.00078641006,0.94732744],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991622,0.0001349088,0.00004333848,0.00013774306,0.0004457926,0.00007602072],"domain_scores_gemma":[0.9944699,0.0008279913,0.00017828676,0.00046671907,0.0030701063,0.000987039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014127116,0.0008302357,0.0006109841,0.0030439212,0.0023778216,0.0034979375,0.0011672331,0.000991222,0.4110943],"category_scores_gemma":[0.011263264,0.0002460702,0.00048394362,0.0020090567,0.0005971179,0.002578151,0.002031837,0.002911655,0.27134565],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002299948,0.000015198468,0.0000676649,0.00006459185,0.0000013682247,0.000023475997,0.0000449416,0.000043709406,0.00010293566,0.006687543,0.95997214,0.032953463],"study_design_scores_gemma":[0.0000037445354,0.0000087876615,0.00017123602,0.00008152655,0.0000014301725,0.000027104972,0.000054452204,0.000028948542,0.00008924886,0.0042900145,0.99523973,0.0000038214534],"about_ca_topic_score_codex":0.0031275249,"about_ca_topic_score_gemma":0.0046119248,"teacher_disagreement_score":0.4110943,"about_ca_system_score_codex":0.001980481,"about_ca_system_score_gemma":0.0020794729,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4205168884","doi":"10.1090/crmm/027","title":"Combinatorics on Words","year":2008,"lang":"en","type":"book","venue":"CRM monograph series","topic":"semigroups and automata theory","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Psychology; Computer science; Mathematics","score_opus":0.01141688571781476,"score_gpt":0.19887639996649845,"score_spread":0.18745951424868368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205168884","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036883196,0.012321137,0.029060641,0.002264821,0.0019637644,0.00004150278,0.0004000114,0.0004562962,0.9498035],"genre_scores_gemma":[0.06893191,0.013037809,0.012853592,0.0010863546,0.002424335,0.00018088288,0.0008859059,0.000650464,0.8999488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99964166,0.000067214074,0.000019358173,0.0000719467,0.00016390451,0.000036028403],"domain_scores_gemma":[0.9997583,0.00007076756,0.000015818803,0.000068949535,0.000059256647,0.00002689509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022222007,0.0011252144,0.0008740895,0.0021608018,0.0016675252,0.0039548567,0.00074245693,0.0004920653,0.036454536],"category_scores_gemma":[0.0008576861,0.00058286753,0.0005902568,0.0032195402,0.0026271434,0.0053485497,0.0016688425,0.00225716,0.018179886],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009142513,0.000011029721,0.000041776217,0.00009492779,0.00000560822,0.00003162397,0.00027086653,0.0003193658,0.00037769068,0.88126063,0.06482799,0.052749388],"study_design_scores_gemma":[0.000004000839,0.0000060951143,0.000086216416,0.000047055106,0.0000055814526,0.00008176167,0.00008059916,0.00037163778,0.00022459624,0.56131536,0.43777025,0.000006811722],"about_ca_topic_score_codex":0.0015944213,"about_ca_topic_score_gemma":0.0022981055,"teacher_disagreement_score":0.036454536,"about_ca_system_score_codex":0.0021619422,"about_ca_system_score_gemma":0.0011731929,"threshold_uncertainty_score":0.12195253},"labels":[],"label_agreement":null},{"id":"W4205254578","doi":"10.1016/j.jda.2011.12.002","title":"Number of holes in unavoidable sets of partial words II","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Winnipeg","keywords":"Combinatorics; Mathematics; Computer science","score_opus":0.020873642163818533,"score_gpt":0.26923992195902396,"score_spread":0.24836627979520542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205254578","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84183925,0.0006518021,0.13247831,0.0014786259,0.0001878233,0.00008972105,0.00091211597,0.00047566902,0.021886682],"genre_scores_gemma":[0.97645444,0.0001423346,0.019075787,0.00011936006,0.00010636939,0.000108818786,0.00045078335,0.00011032812,0.0034316576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967616,0.0005925641,0.00028556728,0.0008474161,0.00089477573,0.00061811664],"domain_scores_gemma":[0.97690773,0.016223151,0.0017546895,0.0021337045,0.0009932463,0.0019874678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002523338,0.00074483134,0.002355911,0.0021322079,0.0034394455,0.0061295745,0.0034858848,0.0023577565,0.0110146925],"category_scores_gemma":[0.01514486,0.0016107091,0.0019498059,0.0018881101,0.0054607503,0.012672995,0.003795303,0.0027645023,0.00046703455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007533125,0.00011412878,0.0060065207,0.00024372466,0.00006742929,0.0004094818,0.0012696985,0.005886997,0.0037987642,0.9716248,0.0017161213,0.008109136],"study_design_scores_gemma":[0.00008586517,0.000096270414,0.0018270108,0.000047555477,0.00007059069,0.0005117123,0.0005286883,0.017647559,0.0024928686,0.9746815,0.0019741382,0.000036182544],"about_ca_topic_score_codex":0.0005031394,"about_ca_topic_score_gemma":0.00061463384,"teacher_disagreement_score":0.0110146925,"about_ca_system_score_codex":0.0016478553,"about_ca_system_score_gemma":0.0009346914,"threshold_uncertainty_score":0.03684783},"labels":[],"label_agreement":null},{"id":"W4205301710","doi":"10.1007/978-3-030-93489-7_8","title":"Width Measures of Alternating Finite Automata","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Automaton; Exponential function; Tree (set theory); Existentialism; Exponential growth; Finite-state machine; Polynomial; Computation; Discrete mathematics; Combinatorics; State (computer science); Algorithm; Computer science; Mathematical analysis; Theoretical computer science","score_opus":0.027431598995972806,"score_gpt":0.24702915329241187,"score_spread":0.21959755429643907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205301710","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36094058,0.006197905,0.49728888,0.0016469905,0.0006648855,0.00007798638,0.0006661523,0.00074500754,0.13177156],"genre_scores_gemma":[0.88898987,0.0021102624,0.071692795,0.00037292935,0.00090730883,0.00025833983,0.0006085934,0.0006108419,0.034449104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987902,0.00028354576,0.000102332524,0.00030115663,0.0003882692,0.00013452487],"domain_scores_gemma":[0.9943178,0.00367403,0.00043861184,0.0005582425,0.0005113347,0.0005000551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012906626,0.00084823195,0.0009065394,0.0024064735,0.001036029,0.0042418693,0.0018213504,0.0011322006,0.0063601374],"category_scores_gemma":[0.007428896,0.0009254709,0.0007717557,0.0020680192,0.0023423133,0.01096949,0.002064738,0.0034902769,0.0008275325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039175906,0.000017634708,0.0001737861,0.000043823085,0.0000069658645,0.000021283593,0.00020553546,0.0013987524,0.0018028335,0.9861513,0.0007167638,0.009422115],"study_design_scores_gemma":[0.000005144065,0.00001803318,0.00023152336,0.00002116774,0.000007791553,0.00005404063,0.000071120405,0.007861253,0.0007640009,0.98872757,0.0022275154,0.000010953888],"about_ca_topic_score_codex":0.00032325616,"about_ca_topic_score_gemma":0.00032232003,"teacher_disagreement_score":0.0063601374,"about_ca_system_score_codex":0.0012870118,"about_ca_system_score_gemma":0.0003483483,"threshold_uncertainty_score":0.021276772},"labels":[],"label_agreement":null},{"id":"W4205520528","doi":"10.1016/j.tcs.2018.07.015","title":"Complexity of proper prefix-convex regular languages","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Prefix; Regular language; Mathematics; Combinatorics; Regular polygon; Prefix code; Discrete mathematics; Computer science; Algorithm; Theoretical computer science; Automaton; Linguistics","score_opus":0.017698645149661598,"score_gpt":0.26388378525127937,"score_spread":0.24618514010161777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205520528","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78341216,0.00058377715,0.1827426,0.0045858067,0.00007530149,0.00009191793,0.0015250196,0.0004377538,0.026545756],"genre_scores_gemma":[0.97721434,0.00031282037,0.013320711,0.00019754544,0.00015720853,0.00010417282,0.0010299418,0.00012913135,0.0075340546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966266,0.0008099352,0.0002254486,0.0006842792,0.0011394696,0.0005141784],"domain_scores_gemma":[0.9750875,0.019738866,0.0014308457,0.0014078023,0.0010765966,0.0012583496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018204491,0.0006505489,0.0015615233,0.0014620788,0.001638963,0.008368483,0.0025574786,0.0017892391,0.011323509],"category_scores_gemma":[0.017673315,0.00079336466,0.0014599785,0.0021613087,0.003948374,0.016469542,0.003398519,0.0034814486,0.0007076339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003881647,0.0000982584,0.0021638342,0.00018958923,0.000042080886,0.00026065114,0.001242621,0.0220843,0.0023038555,0.9598319,0.0016366488,0.009758124],"study_design_scores_gemma":[0.00003568403,0.000023385246,0.00053126423,0.000011096276,0.000020669415,0.0001384655,0.00016611391,0.048539545,0.00091911206,0.948891,0.0007021468,0.00002153674],"about_ca_topic_score_codex":0.0019717896,"about_ca_topic_score_gemma":0.0015674416,"teacher_disagreement_score":0.011323509,"about_ca_system_score_codex":0.003233491,"about_ca_system_score_gemma":0.001867781,"threshold_uncertainty_score":0.037880898},"labels":[],"label_agreement":null},{"id":"W4205548359","doi":"10.1016/j.tcs.2006.01.028","title":"Sequential?","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université du Québec à Montréal","keywords":"Undecidable problem; Multiplicity (mathematics); Idempotence; Semiring; Automaton; Mathematics; Series (stratigraphy); Discrete mathematics; Algebra over a field; Pure mathematics; Combinatorics; Computer science; Decidability; Theoretical computer science; Geometry","score_opus":0.00672751249240781,"score_gpt":0.22558577782933412,"score_spread":0.21885826533692632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205548359","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02069809,0.00074387126,0.18814155,0.009543252,0.0017300854,0.00015983812,0.0017858921,0.0020309824,0.7751665],"genre_scores_gemma":[0.46778435,0.0009242526,0.06362705,0.0031824696,0.0012133193,0.00025747795,0.0020146156,0.001410951,0.45958552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982638,0.00033998254,0.000104045605,0.0007659958,0.0003246141,0.0002015848],"domain_scores_gemma":[0.99711525,0.0008351756,0.00019031663,0.0010374339,0.0005992821,0.0002225604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011919247,0.0008122242,0.0005828439,0.00066276686,0.0016991543,0.0033151205,0.0010000317,0.0011702073,0.11176799],"category_scores_gemma":[0.0056441133,0.0005442825,0.000757942,0.0008464802,0.0027196892,0.010486874,0.0024678186,0.001918129,0.023552895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007653906,0.000021803353,0.000305537,0.00007204064,0.000009005282,0.00009584688,0.00029194774,0.00022820156,0.0006569846,0.94987166,0.021689303,0.026681153],"study_design_scores_gemma":[0.00002148063,0.000019720721,0.00017982561,0.00002832859,0.000011446517,0.00027239745,0.00021944242,0.0015201399,0.0010233611,0.8562176,0.14047438,0.000011840916],"about_ca_topic_score_codex":0.0014554441,"about_ca_topic_score_gemma":0.0013078606,"teacher_disagreement_score":0.11176799,"about_ca_system_score_codex":0.0010362314,"about_ca_system_score_gemma":0.0010879522,"threshold_uncertainty_score":0.3739012},"labels":[],"label_agreement":null},{"id":"W4206956776","doi":"10.1016/j.tcs.2017.03.001","title":"Specular sets","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Conseil Régional, Île-de-France; Agence Nationale de la Recherche","keywords":"Generalization; Cardinality (data modeling); Specular reflection; Mathematics; Set (abstract data type); Combinatorics; Interval (graph theory); Natural (archaeology); Group (periodic table); Discrete mathematics; Computer science; Geography; Data mining; Mathematical analysis","score_opus":0.011435490035065918,"score_gpt":0.26523298001445667,"score_spread":0.2537974899793907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206956776","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116838574,0.0015500757,0.299118,0.0035964309,0.0007187217,0.00012971763,0.002121077,0.0015710362,0.5743563],"genre_scores_gemma":[0.789759,0.0012062228,0.040399257,0.0012045199,0.00068061246,0.0001638961,0.003080007,0.0006868166,0.16281977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882287,0.00022080299,0.00007659934,0.0003353244,0.00033807187,0.00020634578],"domain_scores_gemma":[0.99819523,0.0005945989,0.00014230791,0.00042339702,0.00045342869,0.00019102199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008052932,0.00090119295,0.00088039227,0.001789527,0.0028342018,0.0047931285,0.0008886614,0.00092558865,0.028350785],"category_scores_gemma":[0.002720415,0.0005817442,0.0009441157,0.0020441583,0.0030163086,0.009871714,0.003293421,0.002617691,0.0064427922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023678387,0.0000107230735,0.00008941355,0.000022954344,0.000003835723,0.00003481294,0.00012607109,0.00014028465,0.00040240245,0.988967,0.0028810522,0.0072977534],"study_design_scores_gemma":[0.000008366359,0.000010678533,0.00010394022,0.000011890541,0.0000068930935,0.00012433456,0.00011843107,0.0009259388,0.000708559,0.9791296,0.018843768,0.000007584566],"about_ca_topic_score_codex":0.00048020683,"about_ca_topic_score_gemma":0.00043427292,"teacher_disagreement_score":0.028350785,"about_ca_system_score_codex":0.0011477651,"about_ca_system_score_gemma":0.0007989545,"threshold_uncertainty_score":0.09484285},"labels":[],"label_agreement":null},{"id":"W4210875876","doi":"10.1017/s000497272100126x","title":"ON A -ADDITIVE UNIQUENESS SET FOR MULTIPLICATIVE FUNCTIONS","year":2022,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiplicative function; Uniqueness; Mathematics; Integer (computer science); Combinatorics; Function (biology); Cauchy distribution; Identity (music); Sequence (biology); Mathematical analysis; Physics; Chemistry","score_opus":0.027127586978672583,"score_gpt":0.266332937692701,"score_spread":0.23920535071402843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210875876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.583407,0.0008628697,0.3597504,0.0010885535,0.00041506218,0.000086067994,0.0002727985,0.00045645697,0.05366083],"genre_scores_gemma":[0.9503006,0.00020540196,0.037460744,0.00036477615,0.00017412084,0.0001808458,0.0002136317,0.000121361096,0.010978554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750817,0.0006433959,0.00022009909,0.00069478573,0.0005968655,0.00033667628],"domain_scores_gemma":[0.99431026,0.0028218098,0.0004583461,0.00045603546,0.001176808,0.00077673775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002873454,0.00067972176,0.0011825108,0.0027116993,0.004081385,0.003444236,0.0010753133,0.0014775518,0.0046239467],"category_scores_gemma":[0.005575471,0.00076024013,0.002197389,0.00092517113,0.0046418835,0.004249681,0.005718715,0.0028416177,0.0010609304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046429956,0.000023540733,0.0008913888,0.00003710615,0.00002026389,0.00018873338,0.0005650666,0.00064284954,0.0024586113,0.9909462,0.00029838798,0.0038814514],"study_design_scores_gemma":[0.000026511401,0.00011006164,0.0011796834,0.00005904236,0.000040578365,0.00078655157,0.0007380182,0.016072428,0.007418641,0.9656421,0.007850343,0.000076023],"about_ca_topic_score_codex":0.00052045356,"about_ca_topic_score_gemma":0.00042474104,"teacher_disagreement_score":0.0046239467,"about_ca_system_score_codex":0.0014246907,"about_ca_system_score_gemma":0.0011228791,"threshold_uncertainty_score":0.015468657},"labels":[],"label_agreement":null},{"id":"W4211050463","doi":"10.1016/j.ic.2008.03.005","title":"Synchronization","year":2008,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Synchronizing; Synchronization (alternating current); Computer science; Automaton; Coding (social sciences); Conjecture; Sequence (biology); Connection (principal bundle); Theoretical computer science; Mathematics; Discrete mathematics; Computer network; Telecommunications; Transmission (telecommunications)","score_opus":0.009007121495195454,"score_gpt":0.21169090798816587,"score_spread":0.20268378649297042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211050463","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04264586,0.00065256964,0.4542088,0.0021307133,0.0013588921,0.0004475387,0.001204776,0.00378003,0.49357086],"genre_scores_gemma":[0.7449858,0.0005151598,0.04169646,0.0009371465,0.00047323064,0.000566266,0.0015639699,0.0010303073,0.2082316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898154,0.00018367998,0.000056455632,0.0003735465,0.00024122414,0.00016346516],"domain_scores_gemma":[0.9979165,0.0004739476,0.00013302779,0.0008784868,0.0004102999,0.0001877573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007907448,0.00064693077,0.00063976523,0.0012601754,0.0014975601,0.0020018932,0.0010558451,0.00082319084,0.056868583],"category_scores_gemma":[0.004450475,0.0003374815,0.00059455476,0.0009066987,0.001307119,0.0035730428,0.002936839,0.0013034305,0.011217868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021437356,0.000047148194,0.00047191902,0.00012103365,0.000029924437,0.00017741388,0.00048440153,0.0020870054,0.012689416,0.91845685,0.015259322,0.04996115],"study_design_scores_gemma":[0.0001184691,0.00014786002,0.0011021225,0.00006331815,0.00006786519,0.000504924,0.0004720255,0.02391809,0.022889912,0.8088174,0.14184664,0.000051415223],"about_ca_topic_score_codex":0.00053229625,"about_ca_topic_score_gemma":0.00049183506,"teacher_disagreement_score":0.056868583,"about_ca_system_score_codex":0.00078925095,"about_ca_system_score_gemma":0.0011587335,"threshold_uncertainty_score":0.19024438},"labels":[],"label_agreement":null},{"id":"W4212834144","doi":"10.1016/s0304-3975(03)00311-6","title":"Reducing NFAs by invariant equivalences","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Automaton; Merge (version control); Invariant (physics); Nondeterministic finite automaton; Mathematics; Equivalence (formal languages); Discrete mathematics; Combinatorics; Automata theory; Computer science; Theoretical computer science","score_opus":0.010824583969180577,"score_gpt":0.23935752065838203,"score_spread":0.22853293668920147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212834144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21451601,0.0008649015,0.66854537,0.002094232,0.00090916594,0.0002842351,0.0006412136,0.004721408,0.10742346],"genre_scores_gemma":[0.8368803,0.00063615805,0.12896027,0.00085174013,0.00047178625,0.00026128735,0.001216382,0.0013102636,0.029411815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681854,0.0007109426,0.0002483475,0.00063978543,0.0009164761,0.00066590164],"domain_scores_gemma":[0.99390393,0.003109328,0.00023816877,0.0017240748,0.0007491465,0.00027528958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014133643,0.00085712405,0.0012245551,0.0018216261,0.0019020704,0.0025462226,0.0018884452,0.0014945811,0.010665731],"category_scores_gemma":[0.0070708054,0.00080049725,0.0034310205,0.0013213634,0.0027245588,0.00814458,0.0052990466,0.004316393,0.001998693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012549946,0.00022782585,0.0005098657,0.00017689317,0.00006512639,0.00026057835,0.0011453466,0.0063503846,0.004809111,0.9165046,0.0047025685,0.065122224],"study_design_scores_gemma":[0.000022675187,0.000021307747,0.00013268193,0.000018427168,0.00005020875,0.00011406232,0.00018049544,0.0077383984,0.0029443149,0.98166543,0.0070941,0.000017909071],"about_ca_topic_score_codex":0.001727291,"about_ca_topic_score_gemma":0.0017929588,"teacher_disagreement_score":0.010665731,"about_ca_system_score_codex":0.0012735843,"about_ca_system_score_gemma":0.0007818077,"threshold_uncertainty_score":0.035680473},"labels":[],"label_agreement":null},{"id":"W4213316062","doi":"10.7146/brics.v8i38.21698","title":"Free De Morgan Bisemigroups and Bisemilattices","year":2001,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Computer science","score_opus":0.011783930890360735,"score_gpt":0.23312789835787498,"score_spread":0.22134396746751425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213316062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090291135,0.0025037876,0.7983177,0.0017486182,0.0009094907,0.00019415116,0.0005885172,0.000909848,0.1045368],"genre_scores_gemma":[0.6680755,0.001795293,0.28144664,0.0006729361,0.00048642306,0.00033378645,0.00085156463,0.0002626762,0.046075184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936754,0.00013014581,0.00003882427,0.00012982872,0.00022608846,0.00010756416],"domain_scores_gemma":[0.99960357,0.000095945536,0.000069428825,0.00005221092,0.0001033582,0.000075541146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005209335,0.0007345942,0.00033058642,0.0016714447,0.0013041464,0.0026591392,0.0008929852,0.00065736537,0.007848207],"category_scores_gemma":[0.0008396471,0.00033231048,0.00051117776,0.0011295306,0.0018760926,0.004115994,0.00192434,0.0011963135,0.0012179287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014215817,0.0000075448675,0.000057064597,0.000024859282,0.0000034628677,0.000063404834,0.00023778458,0.0008447378,0.000889523,0.9896253,0.00065263733,0.007579561],"study_design_scores_gemma":[0.00001026213,0.000018012712,0.0000933872,0.000016512471,0.000008549401,0.00014545275,0.00026821834,0.0040881434,0.0014983106,0.96127427,0.032565605,0.000013376568],"about_ca_topic_score_codex":0.0010671797,"about_ca_topic_score_gemma":0.0013577886,"teacher_disagreement_score":0.007848207,"about_ca_system_score_codex":0.0008062422,"about_ca_system_score_gemma":0.00049265265,"threshold_uncertainty_score":0.026254833},"labels":[],"label_agreement":null},{"id":"W4214595959","doi":"10.1007/s00453-022-00939-7","title":"Tree Automata and Pigeonhole Classes of Matroids: I","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Douglas College","funders":"Victoria University of Wellington; Royal Society Te Apārangi","keywords":"Matroid; Pigeonhole principle; Combinatorics; Bounded function; Mathematics; Graphic matroid; Discrete mathematics; Oriented matroid; Tree automaton; Tree (set theory); Class (philosophy); Matroid partitioning; Computer science; Automaton; Artificial intelligence","score_opus":0.005874396165787945,"score_gpt":0.20356124901729758,"score_spread":0.19768685285150964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214595959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39198625,0.0006019233,0.5641429,0.0038622045,0.00026921602,0.00025892648,0.0008520954,0.0028469313,0.035179593],"genre_scores_gemma":[0.9364371,0.00017814754,0.0554589,0.00055691897,0.00013525337,0.00017657063,0.0003671988,0.00022330094,0.0064665684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747235,0.0004161794,0.00016439169,0.0008328563,0.0005195306,0.00059461413],"domain_scores_gemma":[0.98903733,0.006807161,0.0007120069,0.002295274,0.00062518014,0.00052295515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001641111,0.00062000676,0.00070794753,0.00096533727,0.0017242415,0.003735839,0.0017814551,0.0012839027,0.0075934986],"category_scores_gemma":[0.008064093,0.00067610084,0.0027177949,0.0006759926,0.0042674826,0.0090281945,0.0033321276,0.0030915327,0.00053337397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041496367,0.00017464184,0.0016423999,0.0001613895,0.000059893722,0.00023423723,0.0007073359,0.021722091,0.008417974,0.9376978,0.0031795378,0.025587808],"study_design_scores_gemma":[0.00009495273,0.00016049601,0.0005852823,0.000043405333,0.00006249438,0.00014840708,0.00015201459,0.105763376,0.012068346,0.874277,0.006596242,0.000048034646],"about_ca_topic_score_codex":0.0047455216,"about_ca_topic_score_gemma":0.003960455,"teacher_disagreement_score":0.0075934986,"about_ca_system_score_codex":0.004653281,"about_ca_system_score_gemma":0.0016521685,"threshold_uncertainty_score":0.033762038},"labels":[],"label_agreement":null},{"id":"W4221140780","doi":"10.48550/arxiv.2202.01594","title":"Approximate NFA Universality and Related Problems Motivated by Information Theory","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Universality (dynamical systems); Mathematics; Discrete mathematics; Automaton; Probability of error; Combinatorics; Computer science; Algorithm; Theoretical computer science","score_opus":0.022861825507649775,"score_gpt":0.15417579761361974,"score_spread":0.13131397210596996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221140780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18715768,0.0010620147,0.79728025,0.0055522877,0.00011945876,0.00018281382,0.0005104493,0.0012870922,0.0068480307],"genre_scores_gemma":[0.8720284,0.00055006234,0.12272681,0.00074880925,0.00023671452,0.00024180375,0.000575809,0.0002678855,0.0026237406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98989594,0.00370155,0.0006370487,0.0029808725,0.0017666712,0.0010179287],"domain_scores_gemma":[0.91635644,0.06946068,0.002825059,0.008675453,0.001680485,0.0010019105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067116506,0.0008404003,0.001745738,0.0011813022,0.0019288099,0.0036552884,0.0032146059,0.0030565728,0.004490744],"category_scores_gemma":[0.0534035,0.0009478556,0.0028359825,0.0015845123,0.008844684,0.012242636,0.003977352,0.0064495257,0.00051145896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051062484,0.00019922634,0.0048168935,0.0004538236,0.000114010145,0.00027329408,0.0009506561,0.099655814,0.0042821094,0.8509466,0.0020218326,0.035775125],"study_design_scores_gemma":[0.00003401383,0.000055807384,0.00042743163,0.00004344071,0.000030054738,0.00015395107,0.00014086836,0.12728322,0.002965982,0.8677226,0.0011124056,0.000030163505],"about_ca_topic_score_codex":0.0025397677,"about_ca_topic_score_gemma":0.0018435866,"teacher_disagreement_score":0.0067116506,"about_ca_system_score_codex":0.0038400074,"about_ca_system_score_gemma":0.0020800577,"threshold_uncertainty_score":0.035494983},"labels":[],"label_agreement":null},{"id":"W4224095417","doi":"10.1016/j.tcs.2022.04.006","title":"Properties of a class of Toeplitz words","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Toeplitz matrix; Uncountable set; Mathematics; Automaton; Class (philosophy); Permutation (music); Mathematical proof; Set (abstract data type); Discrete mathematics; Combinatorics; Algebra over a field; Theoretical computer science; Computer science; Pure mathematics; Artificial intelligence; Countable set; Programming language","score_opus":0.012783376803217462,"score_gpt":0.2203714539050505,"score_spread":0.20758807710183305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224095417","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87380975,0.00038891204,0.1006861,0.00035763893,0.00009423199,0.00007404774,0.00034833254,0.00034502702,0.023895873],"genre_scores_gemma":[0.98645717,0.00015505728,0.006451599,0.00007672321,0.00011491744,0.000060177732,0.00028586303,0.000064009764,0.0063345293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939775,0.00008143779,0.000057807934,0.00016383687,0.00016323378,0.00013602413],"domain_scores_gemma":[0.99642205,0.0019565262,0.0004981967,0.00033924007,0.0004022326,0.00038182896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006414005,0.00063894043,0.000766353,0.0018515731,0.0019905611,0.0038990278,0.00078874116,0.0011373303,0.007516861],"category_scores_gemma":[0.0038835688,0.00045688587,0.00069070567,0.0016810658,0.0019114099,0.0036169223,0.0011564663,0.0012606899,0.0007470445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002377047,0.00009605256,0.0017975168,0.0000940791,0.00002222096,0.0007249608,0.00079625845,0.0020364826,0.012964388,0.9687057,0.0007647278,0.01175981],"study_design_scores_gemma":[0.000059660564,0.00014431572,0.0009881927,0.000020724196,0.000024106701,0.0011329378,0.0003632565,0.016574796,0.0056550927,0.9717449,0.0032512827,0.000040744762],"about_ca_topic_score_codex":0.0003934004,"about_ca_topic_score_gemma":0.00026652106,"teacher_disagreement_score":0.007516861,"about_ca_system_score_codex":0.00062771636,"about_ca_system_score_gemma":0.00055759464,"threshold_uncertainty_score":0.025146425},"labels":[],"label_agreement":null},{"id":"W4229896219","doi":"10.3233/fi-2011-582","title":"Preface","year":2011,"lang":"la","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Magyar Tudományos Akadémia; Queen's University; Universität Wien; Technische Universität Wien; Loughborough University; Friedrich-Schiller-Universität Jena","keywords":"Automaton; Computer science; Cellular automaton; Theoretical computer science; Artificial intelligence","score_opus":0.07323782083805494,"score_gpt":0.21739817564180614,"score_spread":0.1441603548037512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229896219","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002443358,0.01805894,0.010403845,0.057187244,0.2496653,0.0005005868,0.013257936,0.0017437248,0.64673907],"genre_scores_gemma":[0.015104834,0.00893503,0.0036803435,0.010373043,0.041568078,0.00030343034,0.010890447,0.0011295242,0.90801525],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899405,0.00014344824,0.00006944594,0.00021982864,0.000476842,0.000096422926],"domain_scores_gemma":[0.9955621,0.00068162405,0.00017781353,0.0003933337,0.0023666578,0.00081862666],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014545372,0.0008472137,0.0006816218,0.0019289898,0.002174248,0.0032957979,0.0012554947,0.0012711672,0.35548067],"category_scores_gemma":[0.010185539,0.0002732255,0.0005121231,0.0015317029,0.0006651249,0.0031392602,0.0021623126,0.0031707047,0.23367119],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035765443,0.000017582026,0.00012451086,0.00011995969,0.000002688483,0.000056643494,0.00010930331,0.00008769954,0.0001975326,0.009838674,0.94750804,0.041901615],"study_design_scores_gemma":[0.0000035977353,0.000011674975,0.0002566029,0.00009112095,0.0000013539767,0.00006170551,0.000050994102,0.000031193686,0.0000821367,0.0031693592,0.99623626,0.0000040546443],"about_ca_topic_score_codex":0.00263235,"about_ca_topic_score_gemma":0.0028201593,"teacher_disagreement_score":0.6445193,"about_ca_system_score_codex":0.0021075015,"about_ca_system_score_gemma":0.0019140891,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4230315400","doi":"10.1142/s0129054113400364","title":"MULTIPSEUDOPERIODIC WORDS","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Alphabet; Generalization; Simple (philosophy); Word (group theory); Mathematics; Palindrome; Natural number; Combinatorics; Discrete mathematics; Computer science; Linguistics","score_opus":0.01158208468288874,"score_gpt":0.2736022467836538,"score_spread":0.26202016210076506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230315400","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63308495,0.0015353338,0.28033817,0.00062078866,0.00036313126,0.00017579937,0.00034034063,0.00051886943,0.08302263],"genre_scores_gemma":[0.94592005,0.000347978,0.03991869,0.00014727349,0.00013234916,0.00013645273,0.0001872582,0.000066292916,0.013143648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996904,0.000052188127,0.000029687615,0.00010496045,0.0000621391,0.000060672857],"domain_scores_gemma":[0.99951136,0.00013888357,0.00009433132,0.00010362659,0.0000893715,0.00006238458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029579207,0.000360477,0.00029811275,0.0005353997,0.0011316416,0.001060704,0.0005649126,0.00062971807,0.0057810983],"category_scores_gemma":[0.0009991052,0.00020049654,0.00044929574,0.00039756086,0.0012261734,0.002351418,0.0012767932,0.000573015,0.0009539616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001315166,0.000051663752,0.0009623438,0.00015749667,0.000012099809,0.0014994594,0.00079686474,0.0016721179,0.023172878,0.9478743,0.000837719,0.022831522],"study_design_scores_gemma":[0.000035710214,0.00021314344,0.000996143,0.000067716326,0.000034575136,0.0030550829,0.00083010085,0.0141263725,0.022629414,0.9162458,0.04171898,0.000046864418],"about_ca_topic_score_codex":0.000116170755,"about_ca_topic_score_gemma":0.00019243344,"teacher_disagreement_score":0.0057810983,"about_ca_system_score_codex":0.0003523281,"about_ca_system_score_gemma":0.00027221715,"threshold_uncertainty_score":0.01933968},"labels":[],"label_agreement":null},{"id":"W4230442289","doi":"10.1007/978-3-642-22321-1_10","title":"Theory of Átomata","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nondeterministic finite automaton; Deterministic automaton; Büchi automaton; Computer science; Deterministic finite automaton; Two-way deterministic finite automaton; Automaton; Nondeterministic algorithm; Finite-state machine; Regular language; Regular expression; Quotient; Discrete mathematics; Mathematics; Combinatorics; Theoretical computer science; Algorithm; Programming language; Automata theory","score_opus":0.020207786188411674,"score_gpt":0.22664638615806523,"score_spread":0.20643859996965355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230442289","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009796644,0.010257561,0.34330788,0.005507989,0.0016986327,0.000117817195,0.0018078402,0.0016523784,0.62585324],"genre_scores_gemma":[0.4835736,0.011170522,0.21116814,0.0030370934,0.0024890047,0.00067968486,0.0039533777,0.00137306,0.2825555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892116,0.00030538772,0.00007801804,0.0002495275,0.0003195724,0.00012640074],"domain_scores_gemma":[0.9992693,0.00028171827,0.00003985955,0.00019508509,0.00017232493,0.00004163627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095703494,0.0008778354,0.00093665806,0.0021304768,0.0026827203,0.005932326,0.0018786873,0.0015673029,0.025853883],"category_scores_gemma":[0.0022886079,0.0010866346,0.0015312546,0.0025453412,0.005289519,0.010772305,0.0027383051,0.0041546947,0.008657873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003601786,0.0000025830066,0.000023325454,0.000023871204,0.0000022315403,0.000008340482,0.00007981753,0.00008820161,0.00006571707,0.99297225,0.002960084,0.0037698962],"study_design_scores_gemma":[0.0000042844194,0.0000023385778,0.000029146808,0.000016824086,0.0000046340288,0.000036674184,0.000028719456,0.00041690157,0.00012841068,0.96534747,0.03398073,0.0000038277676],"about_ca_topic_score_codex":0.0019214848,"about_ca_topic_score_gemma":0.0016114317,"teacher_disagreement_score":0.025853883,"about_ca_system_score_codex":0.0027724404,"about_ca_system_score_gemma":0.0012982498,"threshold_uncertainty_score":0.0864898},"labels":[],"label_agreement":null},{"id":"W4233005118","doi":"10.1007/3-540-44977-9_10","title":"Feedback-Free Circuits in the Algebra of Transients","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Binary number; SIGNAL (programming language); Automaton; Electronic circuit; State (computer science); Computer science; Algorithm; Theoretical computer science; Algebra over a field; Mathematics; Arithmetic; Engineering; Electrical engineering; Pure mathematics; Programming language","score_opus":0.014021645481956214,"score_gpt":0.22002589122422989,"score_spread":0.20600424574227366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233005118","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15519641,0.0037576705,0.6906927,0.0016386803,0.00045708977,0.00009365197,0.0005424559,0.0008532035,0.1467681],"genre_scores_gemma":[0.94360894,0.0015527323,0.029774372,0.00026542463,0.00046933972,0.00011061812,0.00020548607,0.00009336877,0.023919724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934226,0.00016212293,0.000046309186,0.00015594138,0.0001953939,0.00009788193],"domain_scores_gemma":[0.9984931,0.00093668234,0.00012968789,0.00014439308,0.0001722157,0.00012382319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064271706,0.00043253932,0.00066510466,0.0007935986,0.0010030967,0.0028812275,0.0010820316,0.0009181442,0.008006659],"category_scores_gemma":[0.0020967296,0.00037489051,0.0008386516,0.00084908586,0.0020162708,0.0043625045,0.0010102137,0.0016745732,0.0009772112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017433602,0.0000075262396,0.00004248274,0.000021997821,0.000004194532,0.000039865365,0.00007530393,0.0022189645,0.0007325342,0.993616,0.00034091255,0.002882673],"study_design_scores_gemma":[0.0000104468,0.000014400878,0.000043119548,0.0000062571476,0.000005284995,0.000062808256,0.000019791352,0.009021564,0.00047455035,0.9881505,0.002183783,0.0000075861167],"about_ca_topic_score_codex":0.00065049285,"about_ca_topic_score_gemma":0.000624124,"teacher_disagreement_score":0.008006659,"about_ca_system_score_codex":0.0011197585,"about_ca_system_score_gemma":0.0006199695,"threshold_uncertainty_score":0.026784956},"labels":[],"label_agreement":null},{"id":"W4234130960","doi":"10.1142/s012905411940032x","title":"Branching Measures and Nearly Acyclic NFAs","year":2019,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Nondeterministic algorithm; Nondeterministic finite automaton; Path (computing); String (physics); Discrete mathematics; Computation; Finite-state machine; Directed acyclic graph; Automaton; Algorithm; Computer science; Automata theory","score_opus":0.010147681627145586,"score_gpt":0.27040780591959834,"score_spread":0.26026012429245277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234130960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24174626,0.0013514179,0.7393182,0.00083838013,0.00007800225,0.00008252551,0.00049281877,0.0009949176,0.01509745],"genre_scores_gemma":[0.86012816,0.0006571585,0.13423912,0.00028874536,0.00012492895,0.0002025269,0.00038726584,0.00018416594,0.0037880861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671656,0.00062109163,0.00030173754,0.00090048567,0.0010559564,0.0004041971],"domain_scores_gemma":[0.9847845,0.010334028,0.0015657422,0.001457574,0.0010465508,0.00081157935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020778656,0.0006755946,0.00065309316,0.0021332926,0.0010990509,0.0022220502,0.0010205728,0.0009069826,0.0036035124],"category_scores_gemma":[0.013651968,0.0005840233,0.0011271745,0.0020090586,0.0030377991,0.0064511276,0.0017792576,0.0024194806,0.0003131689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007911494,0.00003295392,0.0017637045,0.00007781309,0.000020457495,0.00010986839,0.00037193918,0.015416658,0.0036664035,0.9599294,0.00038102627,0.01815062],"study_design_scores_gemma":[0.000011319627,0.00002575936,0.00045675717,0.000021689033,0.000012812685,0.00010249615,0.000044724802,0.03497694,0.0009831517,0.96122205,0.0021236362,0.000018645656],"about_ca_topic_score_codex":0.0026482213,"about_ca_topic_score_gemma":0.0017437282,"teacher_disagreement_score":0.0036035124,"about_ca_system_score_codex":0.0022005255,"about_ca_system_score_gemma":0.0008038212,"threshold_uncertainty_score":0.015966058},"labels":[],"label_agreement":null},{"id":"W4235515712","doi":"10.1142/9789812705808_0007","title":"GRAPH SEMIGROUPS","year":2003,"lang":"en","type":"article","venue":"Advances in Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.00499827380829178,"score_gpt":0.23118717119456214,"score_spread":0.22618889738627035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235515712","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08791145,0.008652779,0.43663755,0.010688823,0.0038334876,0.00016403083,0.001911043,0.0022449938,0.44795588],"genre_scores_gemma":[0.755323,0.0047050933,0.07471207,0.0022061658,0.0019853695,0.00022024069,0.0019329488,0.00051894336,0.15839617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994874,0.00013565182,0.000025094238,0.00015365108,0.00014701294,0.000051101368],"domain_scores_gemma":[0.9992211,0.00029974472,0.00005146414,0.00013436168,0.00017356347,0.00011977027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045481074,0.00053259445,0.0006365633,0.0015739333,0.0014309237,0.0029036494,0.00062455895,0.0007516039,0.016618866],"category_scores_gemma":[0.0014453462,0.0003708553,0.0008073701,0.0013648344,0.0019882096,0.003571473,0.0015333119,0.0018269044,0.0036734354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009532161,0.000006463071,0.000038081875,0.00001856899,0.0000028115976,0.000022033626,0.00010297503,0.00013011877,0.0004526028,0.99106956,0.0031217847,0.005025485],"study_design_scores_gemma":[0.0000067976816,0.000005867142,0.00006418818,0.0000057991865,0.000004918177,0.0000679195,0.00004175753,0.0008693108,0.00026952705,0.9779562,0.020703023,0.0000047029707],"about_ca_topic_score_codex":0.0005883999,"about_ca_topic_score_gemma":0.0005186373,"teacher_disagreement_score":0.016618866,"about_ca_system_score_codex":0.00096721994,"about_ca_system_score_gemma":0.0005455566,"threshold_uncertainty_score":0.055595696},"labels":[],"label_agreement":null},{"id":"W4237199268","doi":"10.1007/3-540-44977-9_6","title":"The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Prince Edward Island","funders":"","keywords":"Deterministic finite automaton; Unary operation; Combinatorics; Equivalence relation; Nondeterministic finite automaton; Upper and lower bounds; Cover (algebra); Mathematics; Quantum finite automata; Discrete mathematics; Finite-state machine; Alphabet; DFA minimization; Similarity (geometry); Automaton; Algorithm; Automata theory; Computer science; Theoretical computer science","score_opus":0.011695310336480172,"score_gpt":0.2502640338655513,"score_spread":0.23856872352907113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237199268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85687095,0.0011737602,0.10384248,0.0024866639,0.00012193116,0.0001291244,0.0012383175,0.00047409863,0.033662606],"genre_scores_gemma":[0.96616125,0.0004062687,0.026400305,0.00017303054,0.00019000552,0.00017819602,0.0007738401,0.00010339922,0.005613626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99606603,0.0009249124,0.00038752938,0.0010243775,0.0011303348,0.00046687096],"domain_scores_gemma":[0.96282554,0.028618969,0.0024815793,0.0027871134,0.0012567189,0.002030019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002381784,0.0005269412,0.0019068897,0.0020208634,0.0028526739,0.005123566,0.0026951279,0.0027585367,0.008243915],"category_scores_gemma":[0.018037412,0.0012154666,0.001645832,0.0021737837,0.0042957827,0.010312854,0.002288439,0.0022045758,0.0007146714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010402583,0.0002208826,0.009014898,0.00052508817,0.00018643387,0.0002688222,0.0009404074,0.020875493,0.012177305,0.908823,0.0041141366,0.0418133],"study_design_scores_gemma":[0.00007282907,0.000090597496,0.0020565316,0.000037343318,0.0001030453,0.0005564576,0.00016552227,0.03943572,0.005409924,0.94911516,0.002915659,0.000041243617],"about_ca_topic_score_codex":0.00046461544,"about_ca_topic_score_gemma":0.00070425496,"teacher_disagreement_score":0.008243915,"about_ca_system_score_codex":0.0022242873,"about_ca_system_score_gemma":0.0011564564,"threshold_uncertainty_score":0.027578652},"labels":[],"label_agreement":null},{"id":"W4238159413","doi":"10.1017/cbo9780511546563","title":"Automatic Sequences","year":2003,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":609,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Subject (documents); Automaton; Transcendence (philosophy); Computation; Theoretical computer science; Graphics; Graduate students; Algebra over a field; Mathematics; Algorithm; Pure mathematics; Epistemology; Computer graphics (images); World Wide Web","score_opus":0.015414637350007707,"score_gpt":0.19083970741829215,"score_spread":0.17542507006828445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238159413","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051314607,0.005703499,0.08831704,0.00109749,0.002412356,0.00009169836,0.0005297712,0.00095855223,0.8957582],"genre_scores_gemma":[0.115102425,0.0071571725,0.07211664,0.000890679,0.0012967524,0.00023300586,0.0016240376,0.00062057085,0.80095863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995189,0.000063188665,0.000027973347,0.00011671824,0.0002307577,0.000042429132],"domain_scores_gemma":[0.999622,0.00011346876,0.0000245443,0.000072453906,0.00013694087,0.000030554645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024231114,0.00060412585,0.00032805654,0.0013837492,0.0013568916,0.0025912048,0.0005104131,0.0005313461,0.0489228],"category_scores_gemma":[0.0010477423,0.0002925313,0.0005029996,0.0012086809,0.0013182842,0.0033975453,0.0011567214,0.0012094295,0.015828453],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000088824545,0.000008418084,0.0000386835,0.000092096525,0.000002758979,0.000057454836,0.00031840295,0.00027393945,0.0014894803,0.9112782,0.023742812,0.06268887],"study_design_scores_gemma":[0.0000041418775,0.000014545148,0.000118720774,0.00006756415,0.000003337115,0.00029730776,0.00009365818,0.0009995505,0.0011848732,0.29816827,0.69903934,0.000008688154],"about_ca_topic_score_codex":0.00043194083,"about_ca_topic_score_gemma":0.0007466666,"teacher_disagreement_score":0.0489228,"about_ca_system_score_codex":0.0008830904,"about_ca_system_score_gemma":0.00066697365,"threshold_uncertainty_score":0.16366309},"labels":[],"label_agreement":null},{"id":"W4239483410","doi":"10.1017/9781108674553.015","title":"Appendix: Some Mathematical and Logical Notions Usefulto Linguistics","year":2020,"lang":"en","type":"other","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Université de Montréal","funders":"","keywords":"Linguistics; Appendix; Computer science; Philosophy","score_opus":0.02345099477219713,"score_gpt":0.2495428039868753,"score_spread":0.2260918092146782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239483410","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011804702,0.0010183415,0.037879772,0.0046694917,0.0026404415,0.0005379831,0.16266055,0.0045002396,0.7849127],"genre_scores_gemma":[0.011829058,0.0011787789,0.029573731,0.00094541255,0.0010436957,0.00055307377,0.07783252,0.003280489,0.87376326],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994217,0.00014506592,0.000056527122,0.00007992009,0.0002512234,0.000045533714],"domain_scores_gemma":[0.9958045,0.0014550653,0.00013022462,0.00046318807,0.0019900082,0.00015697292],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008447575,0.0012499695,0.0007227599,0.0029738944,0.0010897653,0.002051961,0.0014682491,0.0011463801,0.7196115],"category_scores_gemma":[0.007669597,0.00057729555,0.00052699394,0.004648286,0.00049388735,0.0034920387,0.0013201004,0.0013629269,0.36586556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001657472,0.000021552318,0.000059850314,0.00011619538,0.0000016014069,0.000029746565,0.000028294266,0.00013545665,0.000072550705,0.021307664,0.96077985,0.017430672],"study_design_scores_gemma":[0.00002085322,0.0000064399856,0.00030484406,0.000053166583,0.0000028756797,0.000092215596,0.000034475346,0.00042536246,0.0002281642,0.029582893,0.9692394,0.0000093736535],"about_ca_topic_score_codex":0.00758494,"about_ca_topic_score_gemma":0.009436405,"teacher_disagreement_score":0.7196115,"about_ca_system_score_codex":0.0017684848,"about_ca_system_score_gemma":0.0017582816,"threshold_uncertainty_score":0.39994013},"labels":[],"label_agreement":null},{"id":"W4244389874","doi":"10.1002/9781119105664.oth6","title":"Problem Set 6","year":2015,"lang":"en","type":"other","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Citation; Syntax; Set (abstract data type); Library science; Linguistics; Computer science; Information retrieval; Natural language processing; Programming language; Philosophy","score_opus":0.017582804488957025,"score_gpt":0.24185692555800786,"score_spread":0.22427412106905084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244389874","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072862003,0.0016529734,0.054604635,0.0659814,0.0051626363,0.0003563522,0.005886856,0.000843022,0.858226],"genre_scores_gemma":[0.1687973,0.002804908,0.09725333,0.020153826,0.004773034,0.001042325,0.015051983,0.0015296788,0.6885937],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99799323,0.0006426066,0.00009210336,0.0006002463,0.0004352975,0.00023650074],"domain_scores_gemma":[0.996804,0.0017188529,0.000110830515,0.00044882402,0.00064730557,0.0002702257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018615739,0.0008700859,0.0011730487,0.0010285793,0.0026082986,0.0062911566,0.0019922063,0.0039985953,0.26776254],"category_scores_gemma":[0.010232653,0.0003304944,0.0010074059,0.0013594126,0.0019575646,0.0063715386,0.00308092,0.004312173,0.061309706],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012944687,0.00013557445,0.00024081719,0.0005300033,0.000022162503,0.00009064175,0.00016686639,0.0017427944,0.00028301825,0.43623048,0.4671105,0.09331762],"study_design_scores_gemma":[0.000054152664,0.00003271854,0.00022036953,0.00031914064,0.00001852703,0.00024564267,0.0005533354,0.0039952626,0.0005692507,0.5012882,0.49268568,0.000017782299],"about_ca_topic_score_codex":0.0018935627,"about_ca_topic_score_gemma":0.0021631462,"teacher_disagreement_score":0.26776254,"about_ca_system_score_codex":0.0015047144,"about_ca_system_score_gemma":0.003481288,"threshold_uncertainty_score":0.89575493},"labels":[],"label_agreement":null},{"id":"W4252967799","doi":"10.1142/s0129054119400355","title":"State Complexity of Suffix Distance","year":2019,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Suffix; Prefix; Regular language; Mathematics; Upper and lower bounds; Neighbourhood (mathematics); Combinatorics; State (computer science); Discrete mathematics; Automaton; Computer science; Algorithm; Theoretical computer science","score_opus":0.020896797954858718,"score_gpt":0.29279449418749776,"score_spread":0.27189769623263904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252967799","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8134442,0.0003849263,0.16750906,0.0010254873,0.00006794259,0.00014904901,0.0018853938,0.0014445382,0.01408939],"genre_scores_gemma":[0.9763594,0.00015028367,0.01765112,0.00007535881,0.00003346337,0.0001383099,0.0010081965,0.00017678502,0.0044069365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710137,0.00044105912,0.00028966658,0.0008998579,0.0007984538,0.00046957977],"domain_scores_gemma":[0.98062205,0.012969368,0.0011481759,0.0030646524,0.0013097804,0.0008860367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009903399,0.0004384266,0.0013398157,0.00083850697,0.0013808031,0.0034005353,0.0019377143,0.0012294264,0.010209993],"category_scores_gemma":[0.01487553,0.0005067905,0.0019712988,0.00092146697,0.0022958072,0.006327237,0.0037237972,0.00199604,0.00093259825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003980555,0.00043369769,0.015125266,0.0011384254,0.00024193176,0.0008613929,0.0026233648,0.36777574,0.06565136,0.45232165,0.006077858,0.08376876],"study_design_scores_gemma":[0.00008113661,0.00029655083,0.0024199686,0.000045651967,0.000113036804,0.00030474842,0.0002357674,0.5339879,0.019937916,0.44047025,0.002001598,0.000105470666],"about_ca_topic_score_codex":0.0024006264,"about_ca_topic_score_gemma":0.0022087786,"teacher_disagreement_score":0.010209993,"about_ca_system_score_codex":0.0018828524,"about_ca_system_score_gemma":0.0015113443,"threshold_uncertainty_score":0.034155905},"labels":[],"label_agreement":null},{"id":"W4254341276","doi":"10.1016/j.tcs.2020.12.029","title":"Partial derivatives of regular expressions over alphabet-invariant and user-defined labels","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; St. Mary's University","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Regular language; Prefix; Free monoid; Regular expression; Invariant (physics); Mathematics; Bounded function; Discrete mathematics; Word (group theory); Existential quantification; Combinatorics; Set (abstract data type); Alphabet; Combinatorics on words; Automaton; Monoid; Computer science; Theoretical computer science","score_opus":0.014049410970877715,"score_gpt":0.24079460233805858,"score_spread":0.22674519136718085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254341276","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20959711,0.0007269955,0.7407072,0.0010435692,0.0005009746,0.00011218185,0.0010318805,0.004428759,0.041851293],"genre_scores_gemma":[0.89242095,0.00028604918,0.08640024,0.00020592152,0.0001822701,0.00007602874,0.00044801235,0.001139511,0.018841049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741095,0.0005888735,0.00021601761,0.0005520534,0.00088565436,0.0003464074],"domain_scores_gemma":[0.9947343,0.0023091533,0.00046576632,0.0012273906,0.00091169134,0.00035174988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002560358,0.00058607926,0.0007531759,0.0017881477,0.0011215018,0.003766242,0.0014808613,0.0011733035,0.0067519443],"category_scores_gemma":[0.009748189,0.0006262661,0.0009321207,0.001716208,0.0029074124,0.0068172626,0.0015106982,0.0018217926,0.0012952301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012939739,0.000041910866,0.0005310577,0.00007680974,0.000017906832,0.00051775196,0.00071641983,0.0048849788,0.0048370077,0.96624506,0.0013430887,0.0206587],"study_design_scores_gemma":[0.00003345331,0.00007455027,0.0004202587,0.00004609812,0.000048121063,0.00048999675,0.00020413249,0.039662037,0.014938377,0.9292012,0.014818691,0.00006303282],"about_ca_topic_score_codex":0.001161805,"about_ca_topic_score_gemma":0.0014576856,"teacher_disagreement_score":0.0067519443,"about_ca_system_score_codex":0.0018995806,"about_ca_system_score_gemma":0.0012638109,"threshold_uncertainty_score":0.022587538},"labels":[],"label_agreement":null},{"id":"W4281846588","doi":"10.1007/s00233-022-10285-3","title":"The stylic monoid","year":2022,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Monoid; Free monoid; Mathematics; Bijection; Combinatorics; Syntactic monoid; Quotient","score_opus":0.004120705925906042,"score_gpt":0.1916066612687809,"score_spread":0.18748595534287485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281846588","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018639822,0.0070640533,0.031311736,0.025889695,0.0023188516,0.000054819393,0.0005020941,0.00036307445,0.91385585],"genre_scores_gemma":[0.7023296,0.0032643648,0.008734507,0.0042797574,0.0024333796,0.00018383955,0.00034817617,0.00030507104,0.27812147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883944,0.00055591523,0.00005248015,0.00022044854,0.00021531948,0.000116420866],"domain_scores_gemma":[0.99893016,0.00044558154,0.00006367012,0.00023744334,0.0002355661,0.00008749968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011625533,0.0004586269,0.00040965437,0.0023285665,0.004330369,0.006137164,0.00048439705,0.002170242,0.016784923],"category_scores_gemma":[0.0045115096,0.00032857485,0.0002644929,0.0018329088,0.0058421534,0.0074827094,0.002558106,0.0030569488,0.0038826116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004366324,0.0000016205149,0.00003171835,0.0000056280924,5.0000585e-7,0.000011768103,0.00038578876,0.000021589769,0.000037998845,0.9911719,0.0062051616,0.0021217796],"study_design_scores_gemma":[0.000009580878,0.000010082549,0.00017282322,0.000038080547,0.00000296673,0.00013132999,0.00046644273,0.0003458575,0.0001374971,0.657766,0.34091058,0.0000087043345],"about_ca_topic_score_codex":0.0036388831,"about_ca_topic_score_gemma":0.0036219484,"teacher_disagreement_score":0.016784923,"about_ca_system_score_codex":0.0026571203,"about_ca_system_score_gemma":0.0014847924,"threshold_uncertainty_score":0.05615121},"labels":[],"label_agreement":null},{"id":"W4285104990","doi":"10.1007/978-3-662-64821-6_2","title":"Preliminaries","year":2022,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Psychology","score_opus":0.09760787903452407,"score_gpt":0.3414662935045868,"score_spread":0.24385841447006273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285104990","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025965718,0.008571957,0.057191957,0.0055092806,0.0030910042,0.0001464155,0.00357424,0.00058509095,0.9187335],"genre_scores_gemma":[0.0865325,0.016361682,0.04401655,0.0064795474,0.00422931,0.00096322544,0.010237488,0.0011435194,0.83003616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926215,0.00019809157,0.000051154744,0.00018713555,0.00020890121,0.0000925551],"domain_scores_gemma":[0.9992888,0.00026781988,0.000050623905,0.00013958632,0.00019340296,0.000059681228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068440713,0.0013476119,0.00091251335,0.0021339902,0.0026027446,0.003668636,0.0016162675,0.0012874894,0.13217743],"category_scores_gemma":[0.0028587107,0.00044638303,0.0006209367,0.002786923,0.001715783,0.0039582658,0.0021417781,0.0026265564,0.09538761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000166643,0.000026106596,0.00005111194,0.00014516029,0.0000026279765,0.000052023544,0.00024263821,0.0001454653,0.0002507069,0.8735102,0.102624185,0.022933096],"study_design_scores_gemma":[0.000004403015,0.000011655224,0.00007156145,0.000059873317,0.0000035131623,0.00011933867,0.00011844442,0.00019856829,0.00013210493,0.3444215,0.65485257,0.000006432986],"about_ca_topic_score_codex":0.0014055443,"about_ca_topic_score_gemma":0.0014128179,"teacher_disagreement_score":0.13217743,"about_ca_system_score_codex":0.001054688,"about_ca_system_score_gemma":0.00086629426,"threshold_uncertainty_score":0.44217753},"labels":[],"label_agreement":null},{"id":"W4285278578","doi":"10.1007/978-3-031-05578-2_15","title":"Visit-Bounded Stack Automata","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Stack (abstract data type); Bounded function; Automaton; Computer science; Theoretical computer science; Programming language; Mathematics; Mathematical analysis","score_opus":0.014314477135930469,"score_gpt":0.24041885681952363,"score_spread":0.22610437968359315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285278578","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07811336,0.0021035692,0.5136359,0.0021396605,0.0005795859,0.000119476295,0.0016248225,0.0052318927,0.39645174],"genre_scores_gemma":[0.7395695,0.0016372447,0.07185816,0.0004425958,0.0002010053,0.00026801525,0.0017559612,0.0013209855,0.18294656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993717,0.00010282531,0.000035784447,0.00015785571,0.0001959881,0.00013588612],"domain_scores_gemma":[0.9986811,0.00051870785,0.000057560042,0.00040590615,0.00020741022,0.0001293203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004132062,0.000650642,0.00072388735,0.0007895096,0.0016255248,0.0031993827,0.0014974987,0.0010822285,0.019265682],"category_scores_gemma":[0.0025511333,0.0006992302,0.0010249633,0.0013386703,0.0020160712,0.005730475,0.0032751735,0.0029244411,0.0057805614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005048777,0.00001583927,0.00012213155,0.000054518914,0.0000063901907,0.000050218518,0.00026888665,0.002797522,0.0014707487,0.96744394,0.005031526,0.022687888],"study_design_scores_gemma":[0.000009243817,0.000013314105,0.00008231455,0.000023585268,0.000014008033,0.00008242311,0.00009692404,0.012602669,0.0019581192,0.9594865,0.0256174,0.000013531602],"about_ca_topic_score_codex":0.0020999997,"about_ca_topic_score_gemma":0.002204466,"teacher_disagreement_score":0.019265682,"about_ca_system_score_codex":0.0016302693,"about_ca_system_score_gemma":0.0012534885,"threshold_uncertainty_score":0.064450145},"labels":[],"label_agreement":null},{"id":"W4287553630","doi":"10.4230/lipics.cpm.2022.2","title":"String Attractors for Automatic Sequences","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Attractor; String (physics); Combinatorics; Decidability; Sequence (biology); Mathematics; Prefix; Constant (computer programming); Upper and lower bounds; Discrete mathematics; Mathematical analysis; Mathematical physics; Computer science","score_opus":0.0406756292479632,"score_gpt":0.28597792565633673,"score_spread":0.24530229640837353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287553630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40596125,0.0021327948,0.5263838,0.0015261574,0.00021539269,0.000076542594,0.0006846906,0.00095517247,0.062064152],"genre_scores_gemma":[0.9536395,0.00074024877,0.03690501,0.00023240705,0.00025358575,0.00015676454,0.00062164874,0.00017228715,0.007278544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880195,0.00026736612,0.00010003994,0.00036213864,0.00037442904,0.000094062125],"domain_scores_gemma":[0.9951563,0.0031236173,0.00059527316,0.0002983338,0.0005194932,0.0003070036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010505934,0.00055603345,0.0006078071,0.0031602564,0.0010499811,0.0028930067,0.0005959015,0.0009426321,0.00746985],"category_scores_gemma":[0.006241812,0.0002932031,0.0008519852,0.0015503139,0.0027968027,0.004255654,0.0018610503,0.0018143842,0.0006630079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015236125,0.000007832481,0.00034162376,0.000043717995,0.000009077947,0.000033982793,0.00014237032,0.0020314874,0.0014021221,0.99065745,0.00040968604,0.004905405],"study_design_scores_gemma":[0.000006262518,0.000019861856,0.00033035115,0.000016580363,0.0000067622136,0.00006324436,0.000054832653,0.018811805,0.0009337771,0.9777711,0.0019730488,0.000012369952],"about_ca_topic_score_codex":0.0005159621,"about_ca_topic_score_gemma":0.00037207842,"teacher_disagreement_score":0.00746985,"about_ca_system_score_codex":0.001433655,"about_ca_system_score_gemma":0.0004453362,"threshold_uncertainty_score":0.024989188},"labels":[],"label_agreement":null},{"id":"W4287635429","doi":"10.48550/arxiv.2010.10956","title":"Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of\\n Dekking's conjecture","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fibonacci number; Conjecture; Sequence (biology); Morse code; Mathematics; Combinatorics; Discrete mathematics; Function (biology); Computer science; Biology; Genetics","score_opus":0.13769561284913848,"score_gpt":0.20700951862866188,"score_spread":0.0693139057795234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287635429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63572955,0.0020337843,0.2436914,0.009241464,0.0012252866,0.0000880427,0.0005462769,0.00047397855,0.10697014],"genre_scores_gemma":[0.9669165,0.00064639456,0.019187935,0.0005472628,0.0006677579,0.000092808914,0.0002464769,0.00010581911,0.011589029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992324,0.000157168,0.000037303413,0.00018387914,0.0002832404,0.0001059795],"domain_scores_gemma":[0.99380684,0.004632355,0.00023927647,0.0004888978,0.000546785,0.00028584164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012067546,0.00051657157,0.00084638584,0.0013821786,0.0015791812,0.0032310684,0.00093698426,0.001138744,0.0055201477],"category_scores_gemma":[0.009647228,0.00040577605,0.0009887947,0.00096434227,0.0027215742,0.0047042025,0.0021536425,0.0032464017,0.000755555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007797019,0.000029560126,0.0012671335,0.000081250175,0.000014510117,0.00018952566,0.0004898041,0.0048333425,0.0021338826,0.97607213,0.0038650997,0.01094581],"study_design_scores_gemma":[0.000011220534,0.000016810525,0.0007262521,0.000015307267,0.000009750715,0.00011968364,0.000068485926,0.026907329,0.0014300145,0.9666008,0.0040744334,0.000019887553],"about_ca_topic_score_codex":0.0018587417,"about_ca_topic_score_gemma":0.0014321377,"teacher_disagreement_score":0.0055201477,"about_ca_system_score_codex":0.0017703747,"about_ca_system_score_gemma":0.0008949852,"threshold_uncertainty_score":0.018466711},"labels":[],"label_agreement":null},{"id":"W4288413698","doi":"10.48550/arxiv.1903.07522","title":"Scaling limits of permutation classes with a finite specification: a dichotomy","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Random permutation; Permutation (music); Mathematics; Separable space; Limit (mathematics); Substitution (logic); Combinatorics; Discrete mathematics; Limiting; Scaling limit; Scaling; Symmetric group; Computer science","score_opus":0.07142885188841147,"score_gpt":0.18910285177086014,"score_spread":0.11767399988244867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288413698","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87227356,0.00035081984,0.113971174,0.00090606505,0.000028878207,0.000040588395,0.0001233067,0.00022758638,0.012078046],"genre_scores_gemma":[0.98970443,0.0001737835,0.0075851027,0.000104272935,0.00005017395,0.00007339421,0.00012278705,0.000063458785,0.0021226548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988574,0.00034604786,0.000061155246,0.00030430945,0.00027048477,0.00016047899],"domain_scores_gemma":[0.9929889,0.0040538134,0.00088111794,0.00078265445,0.00050269865,0.00079081784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018984582,0.00045409403,0.0008240878,0.0018373583,0.0013596779,0.0025879769,0.0009608265,0.0012021009,0.0030535995],"category_scores_gemma":[0.012253492,0.000411926,0.0010695425,0.00069894636,0.003839827,0.0033425002,0.0015858557,0.0014693079,0.00032838102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000389563,0.00004259683,0.0023158293,0.000045063658,0.00001387392,0.00022992998,0.00033191865,0.008367192,0.002690439,0.9816777,0.0003698696,0.0038765771],"study_design_scores_gemma":[0.000031896456,0.00007386671,0.0016959121,0.000043930002,0.000019630304,0.00038077883,0.0002413702,0.16086996,0.0024537216,0.8327647,0.0013865505,0.000037621106],"about_ca_topic_score_codex":0.0009541975,"about_ca_topic_score_gemma":0.0006039128,"teacher_disagreement_score":0.0030535995,"about_ca_system_score_codex":0.0016363326,"about_ca_system_score_gemma":0.0005000529,"threshold_uncertainty_score":0.011872411},"labels":[],"label_agreement":null},{"id":"W4297662269","doi":"10.1017/9781108775267","title":"The Logical Approach to Automatic Sequences","year":2022,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematical proof; Computation; Theoretical computer science; Phrase; Alphabet; Simple (philosophy); Finite-state machine; Algorithm; Artificial intelligence; Mathematics","score_opus":0.023868392797480875,"score_gpt":0.19979675527474963,"score_spread":0.17592836247726876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297662269","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024148335,0.01066274,0.24791998,0.0067946156,0.002977497,0.00011618286,0.0003639033,0.0011253476,0.72762483],"genre_scores_gemma":[0.11818923,0.019655962,0.1623251,0.006821915,0.0037625737,0.0006582478,0.0009259947,0.0010694228,0.6865917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99922156,0.00021451808,0.00004290067,0.00015719883,0.000300204,0.00006360808],"domain_scores_gemma":[0.9989843,0.0006588562,0.00004541904,0.0001179535,0.000144717,0.00004882427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007361401,0.000724066,0.00039821782,0.0013321324,0.002033663,0.0046524615,0.0010390289,0.00097327196,0.024689347],"category_scores_gemma":[0.001995474,0.0004977455,0.0007508583,0.0012969638,0.0056315097,0.0074888733,0.001568598,0.003605225,0.01009864],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048404686,0.0000044732274,0.00001887258,0.00005465996,0.0000015409927,0.0000283491,0.0001990746,0.00026578046,0.0002956299,0.9717615,0.013178863,0.01418629],"study_design_scores_gemma":[0.000004748465,0.000015752847,0.000050162518,0.00007446347,0.0000029642054,0.00015817978,0.000097899705,0.0013610707,0.0004200669,0.5677842,0.43002135,0.000009093794],"about_ca_topic_score_codex":0.00093293993,"about_ca_topic_score_gemma":0.001058019,"teacher_disagreement_score":0.024689347,"about_ca_system_score_codex":0.0017704809,"about_ca_system_score_gemma":0.0016258786,"threshold_uncertainty_score":0.0825941},"labels":[],"label_agreement":null},{"id":"W4297662415","doi":"10.1017/9781108775267.014","title":"Paperfolding sequences","year":2022,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Section (typography); State (computer science); Computer science; Mathematics; Algorithm; Biology; Genetics","score_opus":0.020684511516727913,"score_gpt":0.1883957201746928,"score_spread":0.1677112086579649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297662415","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008568498,0.00409194,0.0947664,0.0025744021,0.006556464,0.000097960314,0.0009985035,0.0016394272,0.8807064],"genre_scores_gemma":[0.09829558,0.002994547,0.036361977,0.000984529,0.0009237872,0.00013713964,0.0014593386,0.0009691303,0.85787404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993086,0.00013342989,0.000060822345,0.00020893702,0.00023261996,0.00005557614],"domain_scores_gemma":[0.99877447,0.0003447341,0.000058380232,0.00034097343,0.00034319726,0.0001383129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007267288,0.00073506625,0.00041286027,0.0012793727,0.0013900972,0.0027507218,0.00076788524,0.0008363394,0.11802175],"category_scores_gemma":[0.0030749647,0.00027000738,0.0004698309,0.0012835701,0.0013568714,0.0061905542,0.001549408,0.0016304486,0.02830648],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000804265,0.000026045254,0.00018848148,0.00018297265,0.000006594913,0.00013944485,0.00072906923,0.00045851458,0.0026925046,0.79163015,0.06920613,0.13465962],"study_design_scores_gemma":[0.000010801344,0.000037633577,0.00016048578,0.00013804034,0.0000043063183,0.00027241115,0.0002688881,0.00067701726,0.0032240166,0.27573982,0.71945304,0.000013633034],"about_ca_topic_score_codex":0.00036920773,"about_ca_topic_score_gemma":0.00045114674,"teacher_disagreement_score":0.11802175,"about_ca_system_score_codex":0.00079342886,"about_ca_system_score_gemma":0.00043342815,"threshold_uncertainty_score":0.39482212},"labels":[],"label_agreement":null},{"id":"W4308241043","doi":"10.4171/jems/1291","title":"Disproving Hooley’s conjecture","year":2022,"lang":"en","type":"article","venue":"Journal of the European Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Pure mathematics","score_opus":0.007920951339725382,"score_gpt":0.20045312659938355,"score_spread":0.19253217525965816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308241043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57920593,0.0031978518,0.21018516,0.0766237,0.0014737906,0.0000685458,0.0011037088,0.0016973851,0.12644392],"genre_scores_gemma":[0.9797053,0.00044881916,0.009400004,0.003929224,0.00084261765,0.000051156523,0.00022063093,0.00015822884,0.0052439687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99579793,0.0007936924,0.00016452538,0.0013072111,0.0011659955,0.00077066827],"domain_scores_gemma":[0.9575551,0.032227013,0.0013787186,0.0043131066,0.00319148,0.0013345502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045437734,0.0004991253,0.0017611302,0.0015860603,0.0026560123,0.0030302957,0.0023372276,0.0035787427,0.004666436],"category_scores_gemma":[0.034823265,0.0007430274,0.0013041372,0.0011419158,0.0070815836,0.007892992,0.0044250535,0.0052678916,0.0010514916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028104224,0.00006697165,0.0055550365,0.000085330445,0.000038669205,0.00046185544,0.0010989164,0.0038291097,0.0020854007,0.9503182,0.018679734,0.017499719],"study_design_scores_gemma":[0.000068288704,0.00007193634,0.0018079113,0.00004535809,0.000020152076,0.00050987233,0.00032628764,0.019718457,0.0021030572,0.9623496,0.012927259,0.000051781648],"about_ca_topic_score_codex":0.0031625677,"about_ca_topic_score_gemma":0.0017841994,"teacher_disagreement_score":0.004666436,"about_ca_system_score_codex":0.002095407,"about_ca_system_score_gemma":0.0012366057,"threshold_uncertainty_score":0.02403003},"labels":[],"label_agreement":null},{"id":"W4308675433","doi":"","title":"A characterization of words of linear complexity","year":2019,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Characterization (materials science); Mathematics; Computer science; Materials science; Nanotechnology","score_opus":0.013397088962668894,"score_gpt":0.21632830978130047,"score_spread":0.20293122081863157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308675433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5590677,0.0021664582,0.33814934,0.005771985,0.0003105379,0.00020170734,0.0020151248,0.0012176808,0.091099374],"genre_scores_gemma":[0.95228076,0.00045167436,0.024754714,0.00063379295,0.00061627943,0.00021245223,0.0012638494,0.0003046423,0.019481722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793917,0.00038246738,0.00017851402,0.00059734634,0.0005132305,0.0003892779],"domain_scores_gemma":[0.98727524,0.008831189,0.0011434666,0.00081807125,0.0011465392,0.0007854521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082751946,0.00079334725,0.0009662317,0.0029584852,0.0017570683,0.0068867253,0.0016085109,0.0017253458,0.010949658],"category_scores_gemma":[0.0072387652,0.00086988154,0.0010722103,0.00345376,0.0045439545,0.010494868,0.003002424,0.0034022392,0.0017471088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119108765,0.000047253474,0.0009378241,0.00013922571,0.000015024263,0.00018938395,0.0012904258,0.0015288934,0.0037971751,0.9797697,0.001941703,0.010224276],"study_design_scores_gemma":[0.0000257414,0.00006860073,0.00085236976,0.000034797,0.00002113945,0.00039509535,0.0005550982,0.011628902,0.0025053222,0.9739909,0.009879999,0.000041897212],"about_ca_topic_score_codex":0.00087482017,"about_ca_topic_score_gemma":0.00047477012,"teacher_disagreement_score":0.010949658,"about_ca_system_score_codex":0.0023772086,"about_ca_system_score_gemma":0.00090708374,"threshold_uncertainty_score":0.036630273},"labels":[],"label_agreement":null},{"id":"W4313382841","doi":"10.1007/978-3-031-21112-6_5","title":"Semantics","year":2023,"lang":"en","type":"book-chapter","venue":"Computer science foundations and applied logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Semantics (computer science); Programming language; Computer science; Philosophy; Linguistics","score_opus":0.03603268007389232,"score_gpt":0.25184359282526986,"score_spread":0.21581091275137754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313382841","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002646166,0.001067938,0.1299985,0.0026536188,0.00093075196,0.000121410245,0.0020553328,0.0022781985,0.858248],"genre_scores_gemma":[0.13904072,0.0020170098,0.055802215,0.001965858,0.0010214311,0.00033817874,0.005629539,0.0025815517,0.7916035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898416,0.00020299025,0.000064618325,0.00034635395,0.0002866867,0.00011518462],"domain_scores_gemma":[0.9994809,0.00011261752,0.000021066617,0.0001621912,0.00018260498,0.000040582963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007125971,0.0010418529,0.00064631726,0.0015566627,0.0019871178,0.00592345,0.0013914502,0.0010872906,0.12031447],"category_scores_gemma":[0.001791639,0.00051624794,0.00076252274,0.0013294688,0.0022372038,0.009176709,0.0029044873,0.0023279442,0.0589013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013644875,0.000011961955,0.000040781633,0.000044472337,0.0000041341896,0.000020535255,0.00021480196,0.00009958923,0.00030003104,0.95267737,0.024098951,0.022473747],"study_design_scores_gemma":[0.000007816537,0.000005462789,0.000044679568,0.000025803885,0.0000063511156,0.00006273715,0.00015077845,0.00035914907,0.0005839189,0.6215497,0.3771975,0.0000060717193],"about_ca_topic_score_codex":0.0014115471,"about_ca_topic_score_gemma":0.0011256514,"teacher_disagreement_score":0.12031447,"about_ca_system_score_codex":0.0014968672,"about_ca_system_score_gemma":0.0011727561,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4317438149","doi":"10.48550/arxiv.2301.06145","title":"Dyck Words, Pattern Avoidance, and Automatic Sequences","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Parenthesis; Binary number; Combinatorics; Mathematics; Word (group theory); Bounded function; Repetition (rhetorical device); Morse code; Upper and lower bounds; Discrete mathematics; Arithmetic; Computer science; Linguistics; Geometry; Mathematical analysis","score_opus":0.06713777086890493,"score_gpt":0.18761574572574571,"score_spread":0.12047797485684078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317438149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6842703,0.0016565564,0.26310423,0.0008155493,0.0002026637,0.00007239095,0.00023530977,0.00035602454,0.04928699],"genre_scores_gemma":[0.94051117,0.000468694,0.044111732,0.00014837093,0.00013410297,0.000095572286,0.00024962606,0.00010534167,0.0141753405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991709,0.0001599479,0.00006550297,0.00022623765,0.00023266979,0.00014481749],"domain_scores_gemma":[0.99684983,0.0016378458,0.0005027764,0.0003724566,0.00033402428,0.00030298793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056827685,0.0005908486,0.0005618575,0.0015387257,0.0016533479,0.0017642716,0.0007642596,0.000842316,0.006047155],"category_scores_gemma":[0.004406493,0.00038258283,0.0005229516,0.0011519158,0.0028445674,0.0037063723,0.0017857731,0.0013763255,0.0009311572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007748001,0.00003126349,0.001452654,0.000099437646,0.000007101877,0.00025549548,0.00070662,0.0028708975,0.0071232514,0.97130305,0.00082524214,0.015247404],"study_design_scores_gemma":[0.00001603396,0.00006940037,0.0008117975,0.000048137514,0.000013509443,0.00060838956,0.00037210845,0.022495793,0.00620999,0.96024674,0.009072494,0.0000355398],"about_ca_topic_score_codex":0.0010467197,"about_ca_topic_score_gemma":0.0012124706,"teacher_disagreement_score":0.006047155,"about_ca_system_score_codex":0.0009817863,"about_ca_system_score_gemma":0.00042864424,"threshold_uncertainty_score":0.020229757},"labels":[],"label_agreement":null},{"id":"W4318615114","doi":"10.2139/ssrn.4334369","title":"The Palindromization Map","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Geography; Cartography; Political science","score_opus":0.005689077971307171,"score_gpt":0.22057537200883875,"score_spread":0.2148862940375316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318615114","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18732801,0.0017321333,0.23222299,0.0051886723,0.0016014841,0.00010466284,0.0005878165,0.00092419476,0.5703101],"genre_scores_gemma":[0.876105,0.0008804931,0.020710107,0.00081496895,0.0009207603,0.00011664904,0.00041592994,0.0003447559,0.099691436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942183,0.000115566676,0.00003268667,0.00021687483,0.00011163174,0.000101432306],"domain_scores_gemma":[0.9992894,0.00029995936,0.000057855217,0.00013808548,0.00012784102,0.00008679276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042028265,0.0005197473,0.00061129045,0.001096927,0.0019520182,0.0026616494,0.0006823868,0.0011916948,0.018793477],"category_scores_gemma":[0.0016583027,0.0003849044,0.000729471,0.0010384569,0.0022717598,0.005349436,0.0022077742,0.0021765977,0.0046995273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021538735,0.000009404956,0.00004803318,0.000018167933,0.0000024218277,0.000085260326,0.00020651476,0.00008940039,0.0008598814,0.9894713,0.0013273396,0.007860684],"study_design_scores_gemma":[0.0000099381805,0.000015244188,0.00010767919,0.0000064273745,0.0000038227245,0.00025222223,0.00008115396,0.00063601445,0.00082935306,0.9863707,0.011679078,0.0000084241265],"about_ca_topic_score_codex":0.00025783255,"about_ca_topic_score_gemma":0.0001277185,"teacher_disagreement_score":0.018793477,"about_ca_system_score_codex":0.0005556168,"about_ca_system_score_gemma":0.0004312881,"threshold_uncertainty_score":0.06287038},"labels":[],"label_agreement":null},{"id":"W4319996143","doi":"10.1051/ita/2022010","title":"Properties of a ternary infinite word","year":2023,"lang":"en","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Word (group theory); Ternary operation; Exponent; Characterization (materials science); Mathematics; Word length; Abelian group; Point (geometry); Combinatorics; Discrete mathematics; Computer science; Linguistics; Physics; Natural language processing; Geometry","score_opus":0.013153909548090733,"score_gpt":0.22815904913692184,"score_spread":0.2150051395888311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319996143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91192317,0.00044331737,0.058505245,0.00026123755,0.000048237343,0.00005477121,0.0005231235,0.00018981182,0.028051],"genre_scores_gemma":[0.98544693,0.00014751466,0.010112077,0.00004234935,0.000041153995,0.00005334196,0.0002866475,0.000058937952,0.0038111187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995963,0.000055729044,0.000047625366,0.00008663688,0.00012851616,0.00008514505],"domain_scores_gemma":[0.99850035,0.0006916943,0.00027501013,0.00010915856,0.00029609675,0.00012771376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028729966,0.00027417848,0.00029080643,0.0012450923,0.001165339,0.0019639174,0.00022756156,0.00046161463,0.0058433693],"category_scores_gemma":[0.0020985592,0.00018699479,0.00033702588,0.0008577998,0.0010093825,0.0020489087,0.0005665192,0.00042085658,0.00068487326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004603516,0.00005974786,0.006440139,0.00035435244,0.00003297813,0.0016752181,0.0019172055,0.00883544,0.09478767,0.84707505,0.0014143722,0.036947444],"study_design_scores_gemma":[0.0000731886,0.00038674605,0.00617601,0.00014653035,0.00008278341,0.002797984,0.0011039968,0.05739573,0.07636537,0.8262032,0.02916142,0.00010706034],"about_ca_topic_score_codex":0.0006099493,"about_ca_topic_score_gemma":0.0004766172,"teacher_disagreement_score":0.0058433693,"about_ca_system_score_codex":0.00071669597,"about_ca_system_score_gemma":0.00051508646,"threshold_uncertainty_score":0.019547999},"labels":[],"label_agreement":null},{"id":"W4320854980","doi":"10.4230/lipics.stacs.2024.26","title":"A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Deterministic automaton; Mathematics; Discrete mathematics; Automata theory; Automaton; ω-automaton; Timed automaton; Combinatorics; Quantum finite automata; Algorithm; Finite-state machine; Computer science; Theoretical computer science","score_opus":0.06458233519008089,"score_gpt":0.21379232699199946,"score_spread":0.14920999180191857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320854980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013280741,0.0030262647,0.9590368,0.0013320742,0.00029596832,0.00009598427,0.0002652795,0.00043501126,0.022231864],"genre_scores_gemma":[0.3299729,0.006092774,0.6297413,0.0034890247,0.00105962,0.0010322722,0.00075601274,0.000701489,0.027154574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975073,0.00033259208,0.00026971116,0.0009120801,0.00078706647,0.00019127264],"domain_scores_gemma":[0.9968299,0.0015810147,0.00021961828,0.00069716375,0.00057445985,0.000097804535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016309432,0.0010530836,0.0014528262,0.0024251265,0.0020508743,0.0026330636,0.0019505101,0.002213219,0.00489039],"category_scores_gemma":[0.008254018,0.00088065537,0.0024926483,0.0026076797,0.005049013,0.0082775615,0.0040928638,0.0048837923,0.0018423541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026997128,0.000012210152,0.00023097561,0.0000846941,0.000015319138,0.000103233586,0.00023671477,0.004009351,0.0014474542,0.9670406,0.0020456528,0.024746746],"study_design_scores_gemma":[0.000013313542,0.0000374924,0.00012224505,0.000056825436,0.000018289717,0.00038832545,0.000042207983,0.018209923,0.0021000493,0.96231043,0.016670274,0.00003056567],"about_ca_topic_score_codex":0.001791779,"about_ca_topic_score_gemma":0.0014641443,"teacher_disagreement_score":0.00489039,"about_ca_system_score_codex":0.0025631713,"about_ca_system_score_gemma":0.0010608525,"threshold_uncertainty_score":0.018597245},"labels":[],"label_agreement":null},{"id":"W4323310070","doi":"10.1016/j.jalgebra.2023.02.011","title":"Corrigendum to “Inverse semigroups associated to subshifts” [J. Algebra 463 (2016) 211–233]","year":2023,"lang":"en","type":"erratum","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Generality; Inverse; Algebra over a field; Pure mathematics; Geometry","score_opus":0.020676528699374194,"score_gpt":0.24789816633314132,"score_spread":0.22722163763376713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323310070","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026101718,0.006300567,0.002741401,0.0817146,0.87539196,0.00004951391,0.0012664088,0.0005828834,0.031691592],"genre_scores_gemma":[0.013814556,0.015100557,0.005866809,0.079575896,0.31325406,0.00023810718,0.002772068,0.0014818608,0.5678961],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99663085,0.00058598426,0.0003833494,0.00067399297,0.0014714098,0.00025429187],"domain_scores_gemma":[0.99112505,0.0022439286,0.00036782742,0.0007940144,0.0050565205,0.00041271513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002281395,0.002029596,0.0022214507,0.004596865,0.003594757,0.004040274,0.0030148192,0.0045828717,0.10093305],"category_scores_gemma":[0.0196946,0.000982878,0.0024041976,0.0028627436,0.003000803,0.0046614683,0.0021356053,0.0062845573,0.0499126],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002177626,0.00000740325,0.000031855972,0.000115715455,0.0000114412105,0.000081667014,0.000024520159,0.00003977541,0.00005257068,0.0053003794,0.9904553,0.0038574084],"study_design_scores_gemma":[0.00002956307,0.000024910869,0.00068301655,0.00020303165,0.000037483085,0.00031748458,0.000057878533,0.00034748236,0.00032168743,0.020713707,0.97721714,0.000046537058],"about_ca_topic_score_codex":0.016707554,"about_ca_topic_score_gemma":0.022078952,"teacher_disagreement_score":0.10093305,"about_ca_system_score_codex":0.0049445196,"about_ca_system_score_gemma":0.0026589583,"threshold_uncertainty_score":0.33765465},"labels":[],"label_agreement":null},{"id":"W4328105802","doi":"10.1016/j.tcs.2023.113830","title":"On the average complexity of partial derivative transducers","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Centro de Matemática Universidade do Porto; Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bounded function; Algebraic number; Partial derivative; Expression (computer science); Combinatorics; Discrete mathematics; Pure mathematics; Applied mathematics; Mathematical analysis; Computer science","score_opus":0.03271519382222329,"score_gpt":0.2632422958027282,"score_spread":0.23052710198050488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4328105802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87653846,0.0007344199,0.11013557,0.0016884748,0.00005371775,0.000063089305,0.0014732006,0.0012410397,0.008072092],"genre_scores_gemma":[0.98066336,0.00027944834,0.015457497,0.00012324179,0.00005411575,0.0001162763,0.0012013201,0.0002707548,0.0018339388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951532,0.0010155325,0.00040588746,0.001274856,0.0012415005,0.00090906286],"domain_scores_gemma":[0.9394784,0.051518247,0.0017765103,0.0042496785,0.0018590842,0.0011181873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027917882,0.0005696065,0.0015115013,0.0012625373,0.0012797462,0.0045927274,0.0022390787,0.0016309781,0.006213326],"category_scores_gemma":[0.029641131,0.00068119256,0.0012352436,0.0017881019,0.0023966604,0.009478785,0.002704738,0.0022485135,0.0006680211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028766985,0.00035716975,0.026324447,0.0011957774,0.00032814394,0.00064170745,0.0018123577,0.5905762,0.049032953,0.20634747,0.0060119466,0.11449517],"study_design_scores_gemma":[0.000051273793,0.00016897882,0.002567148,0.000038548736,0.000108063345,0.00027673767,0.00022923722,0.8584896,0.01452265,0.12229401,0.0012008859,0.000052841093],"about_ca_topic_score_codex":0.0025574798,"about_ca_topic_score_gemma":0.003027232,"teacher_disagreement_score":0.006213326,"about_ca_system_score_codex":0.003093879,"about_ca_system_score_gemma":0.0031613864,"threshold_uncertainty_score":0.022447824},"labels":[],"label_agreement":null},{"id":"W4360604354","doi":"10.1016/j.ic.2023.105027","title":"New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines","year":2023,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decidability; Computer science; Turing machine; Pushdown automaton; Bounded function; Deterministic pushdown automaton; Deterministic context-free grammar; Model checking; Embedded pushdown automaton; Class (philosophy); Reachability problem; Automaton; Discrete mathematics; Theoretical computer science; Mathematics; Algorithm; Rule-based machine translation; Automata theory; Context-free grammar; Artificial intelligence","score_opus":0.0070638480504548636,"score_gpt":0.230268096332771,"score_spread":0.22320424828231614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360604354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3045437,0.0034393638,0.62322575,0.003419158,0.0005267215,0.00017364885,0.0008945234,0.0011895819,0.06258758],"genre_scores_gemma":[0.93045324,0.0007635949,0.053665806,0.00050585176,0.0007305216,0.00028359832,0.00077813957,0.00031481445,0.01250447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793005,0.00041917522,0.00018628925,0.00056772365,0.0005535425,0.00034323],"domain_scores_gemma":[0.9826775,0.011424735,0.0013279993,0.0016330363,0.0016724349,0.0012643248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021238695,0.0010216073,0.000984007,0.0024590876,0.0015482715,0.005320337,0.002698212,0.0020066097,0.008445926],"category_scores_gemma":[0.01363318,0.00065060507,0.0012702371,0.0016929093,0.0049898187,0.011701268,0.003817073,0.004898237,0.0010489533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001174989,0.00005297636,0.0008032043,0.00008443176,0.00000958374,0.00012527463,0.00048777708,0.0016824955,0.0025666861,0.9855827,0.0012823595,0.0072049843],"study_design_scores_gemma":[0.00002700602,0.00004072557,0.0006907785,0.000041379135,0.000020427447,0.00032771117,0.00027148033,0.027428385,0.002505861,0.9629916,0.005624455,0.000030124205],"about_ca_topic_score_codex":0.00023976823,"about_ca_topic_score_gemma":0.00029871476,"teacher_disagreement_score":0.008445926,"about_ca_system_score_codex":0.001580213,"about_ca_system_score_gemma":0.0009120948,"threshold_uncertainty_score":0.02825439},"labels":[],"label_agreement":null},{"id":"W4361994958","doi":"10.1051/ita/2022011","title":"Automatic sequences in negative bases and proofs of some conjectures of shevelev","year":2023,"lang":"en","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Mathematical proof; Simple (philosophy); Base (topology); Binary number; Automated theorem proving; Mathematics; Discrete mathematics; Computer science; Gas meter prover; Algorithm; Arithmetic; Epistemology; Philosophy","score_opus":0.008010339314147076,"score_gpt":0.24711813972543356,"score_spread":0.2391078004112865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361994958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16530704,0.0061288346,0.6787044,0.03128541,0.001855361,0.00010033449,0.00038096192,0.001399444,0.11483826],"genre_scores_gemma":[0.8957362,0.0023221597,0.07867082,0.0031053238,0.000813513,0.0001891929,0.0003396977,0.00039322994,0.018429799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997542,0.000926609,0.00011894417,0.0004216499,0.0007197709,0.00027098804],"domain_scores_gemma":[0.9862403,0.010451894,0.0005101082,0.0009600852,0.0013781384,0.0004593858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046278634,0.0006000767,0.0008240066,0.0017734871,0.0019860023,0.0025727921,0.0014294309,0.0013751823,0.0072071874],"category_scores_gemma":[0.018504094,0.0006719406,0.001464083,0.0015377245,0.0067493645,0.008736473,0.004813794,0.0057572485,0.0011339022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030770727,0.000022049671,0.0002782011,0.000065547814,0.000008372025,0.00011302815,0.0004234851,0.0010524738,0.00051536417,0.9906673,0.0016565486,0.00516684],"study_design_scores_gemma":[0.000012517747,0.000014066433,0.0000992061,0.000032195006,0.0000070574483,0.00005625173,0.000085902495,0.003228679,0.00076528214,0.9902351,0.005451044,0.000012720318],"about_ca_topic_score_codex":0.0012020619,"about_ca_topic_score_gemma":0.00086123496,"teacher_disagreement_score":0.0072071874,"about_ca_system_score_codex":0.0018323471,"about_ca_system_score_gemma":0.0012100593,"threshold_uncertainty_score":0.0244748},"labels":[],"label_agreement":null},{"id":"W4366547923","doi":"10.1007/978-3-031-30829-1_12","title":"Unboundedness Problems for Machines with Reversal-Bounded Counters","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Algorithm; Computer science; Artificial intelligence; Bounded function; Mathematics; Mathematical analysis","score_opus":0.017781245282572078,"score_gpt":0.23826780013101084,"score_spread":0.22048655484843876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366547923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44992593,0.0006123504,0.52763575,0.005559492,0.00026527152,0.0003920633,0.0010640491,0.0026264838,0.01191862],"genre_scores_gemma":[0.8904929,0.0001948011,0.10217416,0.00079652196,0.00014772062,0.00026571413,0.0011265604,0.00024840326,0.004553096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99120176,0.0028150303,0.0007460496,0.0021785346,0.0016549545,0.0014036901],"domain_scores_gemma":[0.9627295,0.0297605,0.0023132467,0.0020957713,0.0019273491,0.0011735639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047089625,0.0007984218,0.0011494856,0.0008750736,0.001556631,0.0048275245,0.002050722,0.0022147254,0.0049681063],"category_scores_gemma":[0.02286296,0.00083870674,0.002412702,0.0007832801,0.0045888317,0.009766941,0.0034011218,0.004365345,0.00064530317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013730066,0.00042683422,0.0036529787,0.0005872111,0.00012926199,0.0007957091,0.0011384048,0.084401384,0.020518674,0.83991843,0.0046730796,0.042384945],"study_design_scores_gemma":[0.0001586388,0.00013961931,0.00039192918,0.000056030407,0.000055606684,0.00022896353,0.00028171387,0.21406482,0.018803768,0.761625,0.0041145375,0.00007933017],"about_ca_topic_score_codex":0.0019791818,"about_ca_topic_score_gemma":0.0012008608,"teacher_disagreement_score":0.0049681063,"about_ca_system_score_codex":0.0025750592,"about_ca_system_score_gemma":0.0025302265,"threshold_uncertainty_score":0.024903655},"labels":[],"label_agreement":null},{"id":"W4377081443","doi":"10.1007/978-3-031-33264-7_14","title":"On the Simon’s Congruence Neighborhood of Languages","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Congruence (geometry); Computer science; Programming language; Theoretical computer science; Mathematics; Geometry","score_opus":0.013643250282226564,"score_gpt":0.2409676931564599,"score_spread":0.22732444287423334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377081443","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3053439,0.003717517,0.14456034,0.006032178,0.00073614065,0.00009033729,0.00043851748,0.0004218513,0.5386592],"genre_scores_gemma":[0.93374735,0.0011945012,0.018758645,0.0004997645,0.000767002,0.00011277468,0.00039095787,0.00018823164,0.04434082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991592,0.00021980586,0.0000455109,0.00019449556,0.00022527113,0.00015576732],"domain_scores_gemma":[0.99854714,0.0008759268,0.00010752025,0.00012068138,0.00017421994,0.00017441712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008616635,0.00046274936,0.001315768,0.0016853446,0.003553907,0.002708226,0.0009866571,0.00083749887,0.007266863],"category_scores_gemma":[0.0034054774,0.0004745348,0.0008908012,0.0014750325,0.004169369,0.00632882,0.0027093377,0.0026301276,0.0008865323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025634197,0.000006141269,0.00004570701,0.000009758879,0.0000015218053,0.000026692946,0.00012894314,0.00026294967,0.00021471338,0.9974299,0.0005156707,0.0013323615],"study_design_scores_gemma":[0.0000137775005,0.0000093022345,0.00007874571,0.0000064764295,0.0000026064827,0.00004118014,0.00008408154,0.0012874288,0.00020553346,0.99445254,0.00381334,0.000005030225],"about_ca_topic_score_codex":0.003326947,"about_ca_topic_score_gemma":0.002568508,"teacher_disagreement_score":0.007266863,"about_ca_system_score_codex":0.0019333508,"about_ca_system_score_gemma":0.00081863144,"threshold_uncertainty_score":0.024310052},"labels":[],"label_agreement":null},{"id":"W4378188697","doi":"10.4153/s0008414x23000342","title":"The first-order theory of binary overlap-free words is decidable","year":2023,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decidability; Mathematics; Mathematical proof; Binary number; Class (philosophy); Order (exchange); Discrete mathematics; Combinatorics; Arithmetic; Computer science; Artificial intelligence; Geometry","score_opus":0.01664385980543428,"score_gpt":0.22004236393609145,"score_spread":0.20339850413065716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378188697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21887496,0.0014684906,0.693927,0.006337131,0.0005063981,0.00028590873,0.0011107681,0.0021694493,0.075319886],"genre_scores_gemma":[0.92262065,0.0005085745,0.064952515,0.0007811737,0.00031700308,0.00018916035,0.00074315217,0.00020741032,0.009680467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962106,0.0006741761,0.00025838253,0.0007290548,0.0013021433,0.00082564296],"domain_scores_gemma":[0.9887095,0.008730424,0.0004435781,0.0005975565,0.0011064273,0.00041255922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038956811,0.0007115249,0.0010235304,0.0015927091,0.003692337,0.0069126873,0.0019623048,0.0014317647,0.006541378],"category_scores_gemma":[0.007240132,0.0010949449,0.0020692782,0.0011728855,0.006742853,0.010809522,0.0031714689,0.0045028105,0.00087036955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052153737,0.000042201078,0.0004543259,0.00010366293,0.0000219919,0.00019324204,0.00051979924,0.0018507316,0.0012162891,0.98778814,0.0014232268,0.006334236],"study_design_scores_gemma":[0.000034932444,0.000018107441,0.00016781891,0.000034094937,0.000034331682,0.00018030596,0.00025835863,0.013095328,0.004666721,0.9750518,0.0064327335,0.000025440691],"about_ca_topic_score_codex":0.0036634959,"about_ca_topic_score_gemma":0.0032096303,"teacher_disagreement_score":0.0069126873,"about_ca_system_score_codex":0.0032910004,"about_ca_system_score_gemma":0.0031813143,"threshold_uncertainty_score":0.023877978},"labels":[],"label_agreement":null},{"id":"W4378713939","doi":"10.7561/sacs.2023.1.53","title":"Maximal Existential and Universal Width","year":2023,"lang":"en","type":"article","venue":"Scientific Annals of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decidability; Mathematics; Computation; Exponential function; Automaton; Finite-state machine; Polynomial; Tree (set theory); Discrete mathematics; Existentialism; Combinatorics; Algorithm; Mathematical analysis; Computer science","score_opus":0.04369925376803686,"score_gpt":0.28322512489695034,"score_spread":0.2395258711289135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378713939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3546587,0.0010238673,0.6177697,0.0007454645,0.00009967325,0.000120417186,0.0015796187,0.0021351133,0.021867383],"genre_scores_gemma":[0.8864389,0.0003827756,0.10863729,0.00017318854,0.00007908231,0.00023460518,0.0006613715,0.0004187781,0.0029741516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954275,0.00048286965,0.0006225985,0.0018021001,0.0008015653,0.0008633091],"domain_scores_gemma":[0.9850092,0.008757539,0.0012737102,0.0026407035,0.0014396049,0.00087933417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025131067,0.0007626615,0.00083654013,0.0013090395,0.0010326476,0.00324493,0.0016772082,0.0010530334,0.004465462],"category_scores_gemma":[0.01731294,0.00093480264,0.0017082935,0.0011547299,0.0035118454,0.009381048,0.0038974856,0.0019522319,0.0007677733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066940906,0.00011716969,0.0117266225,0.00057511986,0.0001139926,0.00044107006,0.002104639,0.025797255,0.040720716,0.8469048,0.0018229226,0.06900621],"study_design_scores_gemma":[0.000042926433,0.00017462956,0.0035498356,0.00015635684,0.00015849546,0.0012065326,0.00048996886,0.07562333,0.048063435,0.8584048,0.012023452,0.00010620382],"about_ca_topic_score_codex":0.00070856686,"about_ca_topic_score_gemma":0.00061461044,"teacher_disagreement_score":0.004465462,"about_ca_system_score_codex":0.0010740887,"about_ca_system_score_gemma":0.0011581823,"threshold_uncertainty_score":0.014938474},"labels":[],"label_agreement":null},{"id":"W4381304074","doi":"10.1007/978-3-031-33180-0_17","title":"Dyck Words, Pattern Avoidance, and Automatic Sequences","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg; Thompson Rivers University","funders":"","keywords":"Parenthesis; Binary number; Bounded function; Word (group theory); Combinatorics; Repetition (rhetorical device); Discrete mathematics; Morse code; Mathematics; Upper and lower bounds; Computer science; Arithmetic; Geometry; Linguistics; Telecommunications","score_opus":0.015110211002564853,"score_gpt":0.2345265728146961,"score_spread":0.21941636181213126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381304074","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21553369,0.01370267,0.33641312,0.00223823,0.0011018708,0.00011809021,0.0003940889,0.00048234224,0.4300159],"genre_scores_gemma":[0.7865934,0.0050238203,0.063791014,0.00044481677,0.0004591627,0.00020368828,0.0005524016,0.00019835393,0.14273332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997551,0.00004936621,0.000020815676,0.0000618753,0.000073781164,0.00003900807],"domain_scores_gemma":[0.99958676,0.00021379044,0.00004539995,0.000059713602,0.00005981819,0.00003449455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025045956,0.00047187804,0.0004632699,0.0012974308,0.0010799922,0.0018570253,0.000541632,0.000644863,0.008247198],"category_scores_gemma":[0.0013893857,0.00031411258,0.0003009616,0.0013116922,0.0019686138,0.0034765785,0.0012469805,0.001350778,0.0012859955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021975895,0.000009880216,0.00007333791,0.000047651487,0.0000020301743,0.000043158918,0.00015230075,0.0006389933,0.0010046503,0.9792962,0.0014884609,0.0172213],"study_design_scores_gemma":[0.0000048244456,0.0000119311235,0.000065343535,0.000012342149,0.0000024575752,0.00010783278,0.000096416516,0.0016020219,0.0005146676,0.9890426,0.00853423,0.0000053831513],"about_ca_topic_score_codex":0.0005820201,"about_ca_topic_score_gemma":0.00070230995,"teacher_disagreement_score":0.008247198,"about_ca_system_score_codex":0.0007021687,"about_ca_system_score_gemma":0.0003811591,"threshold_uncertainty_score":0.02758962},"labels":[],"label_agreement":null},{"id":"W4381304387","doi":"10.1007/978-3-031-33180-0_14","title":"Smallest and Largest Block Palindrome Factorizations","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Factorization; Palindrome; Word (group theory); Prefix; Combinatorics; Mathematics; Suffix; Suffix array; Computer science; Arithmetic; Discrete mathematics; Algorithm; Linguistics","score_opus":0.018882904818249592,"score_gpt":0.23172284785981276,"score_spread":0.21283994304156317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381304387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1733155,0.0030300836,0.46680135,0.0010999923,0.0009134454,0.00015149088,0.0014486082,0.001462218,0.3517773],"genre_scores_gemma":[0.6642597,0.0014359842,0.1598033,0.00033233667,0.0005190018,0.00016510421,0.0013721008,0.0007742099,0.1713383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999729,0.000033642093,0.000017914956,0.00008830067,0.000060207785,0.00007096911],"domain_scores_gemma":[0.9995012,0.0002002575,0.00003526021,0.00011232088,0.00008180313,0.00006903009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002954905,0.000429391,0.0005815274,0.0005630082,0.0010366441,0.001423666,0.00048098352,0.00042345727,0.022688309],"category_scores_gemma":[0.00088824576,0.00043594485,0.0006307698,0.00051241834,0.0010289801,0.0032823556,0.0008349379,0.0012785645,0.0056837937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002678466,0.000028976887,0.00014460973,0.00014349792,0.0000050113117,0.00011879424,0.00039746653,0.0006981588,0.014739786,0.92566484,0.0055972068,0.052193742],"study_design_scores_gemma":[0.00003297783,0.00010006462,0.00031956323,0.000042169235,0.000016653945,0.0003971611,0.0001664322,0.0028892818,0.007764624,0.9405664,0.047680017,0.000024736712],"about_ca_topic_score_codex":0.00036177228,"about_ca_topic_score_gemma":0.00072371354,"teacher_disagreement_score":0.022688309,"about_ca_system_score_codex":0.00036152112,"about_ca_system_score_gemma":0.00035681837,"threshold_uncertainty_score":0.0758999},"labels":[],"label_agreement":null},{"id":"W4381304603","doi":"10.1007/978-3-031-33180-0_18","title":"Rudin-Shapiro Sums via Automata Theory and Logic","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Computer science; Mathematical proof; Automaton; Automata theory; Proof theory; Theoretical computer science; Algorithm; Mathematics","score_opus":0.019670691568446357,"score_gpt":0.24566659605152943,"score_spread":0.22599590448308307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381304603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042864,0.015237902,0.47713697,0.00474083,0.0013789077,0.00008595363,0.0004053939,0.0007705991,0.45737946],"genre_scores_gemma":[0.70642126,0.009956166,0.13333614,0.0014754446,0.003166881,0.00035078218,0.00050440617,0.00045901616,0.14433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939525,0.00018222506,0.00004348104,0.00012089003,0.00020863673,0.00004956852],"domain_scores_gemma":[0.9994435,0.00036404983,0.000028291293,0.00006641468,0.00006891731,0.000028988316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006954561,0.00080423336,0.0012558384,0.0017779125,0.0018326106,0.003435429,0.0010378942,0.0010292052,0.0077587585],"category_scores_gemma":[0.0015370548,0.00065265415,0.0010338505,0.001908611,0.0036339315,0.008131279,0.0019544305,0.0035755462,0.0020584115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009095431,0.0000073422943,0.00002198058,0.000029387531,0.0000053756935,0.000012280807,0.00006448061,0.00044997132,0.00018986278,0.9911675,0.0013334326,0.006709372],"study_design_scores_gemma":[0.0000025432635,0.0000028067989,0.000018949788,0.000004558205,0.0000045213096,0.000017854369,0.000011301103,0.00072073116,0.00014927113,0.99361235,0.005451362,0.0000036347524],"about_ca_topic_score_codex":0.00049839955,"about_ca_topic_score_gemma":0.00059931475,"teacher_disagreement_score":0.0077587585,"about_ca_system_score_codex":0.0016433257,"about_ca_system_score_gemma":0.0006284464,"threshold_uncertainty_score":0.025955677},"labels":[],"label_agreement":null},{"id":"W4381570207","doi":"10.12697/acutm.2023.27.02","title":"On dominions of certain ample monoids","year":2023,"lang":"en","type":"article","venue":"Acta et Commentationes Universitatis Tartuensis de Mathematica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Eesti Teadusfondi; Wilfrid Laurier University","keywords":"Mathematics; Semigroup; Inverse semigroup; Unary operation; Bijection, injection and surjection; Pure mathematics; Inverse; Monoid; Dominion; Inverse element; Combinatorics; Discrete mathematics; Special classes of semigroups; Law; Geometry","score_opus":0.020680379028901387,"score_gpt":0.2754125346414683,"score_spread":0.2547321556125669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381570207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9412435,0.0010052451,0.018685285,0.00036513302,0.000033227687,0.000019155957,0.000094408235,0.000064550135,0.0384895],"genre_scores_gemma":[0.98966813,0.00028163267,0.0029473684,0.000068793306,0.00006156772,0.000029904557,0.00008645581,0.000015916608,0.0068402584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993318,0.00015834908,0.000041159892,0.00013398076,0.0001961577,0.00013849387],"domain_scores_gemma":[0.99817526,0.00090090226,0.00025955017,0.00013248336,0.00021728915,0.00031457312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090350746,0.0001964683,0.0002869356,0.0013594027,0.001181084,0.0016643243,0.00028157866,0.0003365058,0.0031302571],"category_scores_gemma":[0.0020253612,0.00028160794,0.00038333784,0.000370675,0.0019443997,0.0023838491,0.0019654806,0.00067795435,0.00024008301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001664257,0.0000573977,0.0055208416,0.000065787404,0.00002125097,0.0014476762,0.003941968,0.00069253566,0.020954251,0.9568599,0.00054065534,0.009731194],"study_design_scores_gemma":[0.00008921327,0.00021766423,0.010838668,0.000098695666,0.000050145816,0.0033178867,0.0035934143,0.012413027,0.016537039,0.9196835,0.033103243,0.000057550445],"about_ca_topic_score_codex":0.000421755,"about_ca_topic_score_gemma":0.0005519434,"teacher_disagreement_score":0.0031302571,"about_ca_system_score_codex":0.000803314,"about_ca_system_score_gemma":0.000253223,"threshold_uncertainty_score":0.010471761},"labels":[],"label_agreement":null},{"id":"W4381856060","doi":"10.1007/978-3-031-34326-1_4","title":"Existential and Universal Width of Alternating Finite Automata","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Decidability; Bounded function; Computation; Automaton; Finite-state machine; String (physics); Nondeterministic finite automaton; Deterministic finite automaton; Integer (computer science); Existentialism; Nondeterministic algorithm; Discrete mathematics; Deterministic automaton; Computer science; Mathematics; Algorithm; Automata theory; Theoretical computer science; Mathematical analysis","score_opus":0.01791347460222524,"score_gpt":0.23648603760099757,"score_spread":0.2185725629987723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381856060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32963157,0.005737837,0.5289696,0.0016732785,0.0005441432,0.00008235533,0.0012099309,0.0016791885,0.13047212],"genre_scores_gemma":[0.9147517,0.0014953358,0.06321132,0.0002519335,0.00040873833,0.00015547007,0.00064616377,0.0006604839,0.018418882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984397,0.00032086525,0.00018086543,0.00046998993,0.00031378237,0.00027475858],"domain_scores_gemma":[0.9936785,0.0042231125,0.0003281283,0.00097537367,0.00040515268,0.00038975675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001823906,0.00089356524,0.0011171013,0.0016089518,0.0014362555,0.0042884382,0.0023745697,0.0010258758,0.0073484485],"category_scores_gemma":[0.009123818,0.0013471898,0.0013350543,0.0018296698,0.0035183476,0.016303672,0.003920281,0.0049586766,0.0009789104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015269514,0.000032746284,0.0004903853,0.000117418465,0.00001701751,0.00006126055,0.0007436673,0.0016679921,0.0024530657,0.97318846,0.0010319806,0.020043442],"study_design_scores_gemma":[0.000010631627,0.000017236373,0.0003230315,0.000035275993,0.000026309766,0.00009281311,0.00014473131,0.0046659866,0.0014291977,0.98992693,0.0033119267,0.000015986225],"about_ca_topic_score_codex":0.00068684504,"about_ca_topic_score_gemma":0.00064924726,"teacher_disagreement_score":0.0073484485,"about_ca_system_score_codex":0.0011927175,"about_ca_system_score_gemma":0.00060045486,"threshold_uncertainty_score":0.024582982},"labels":[],"label_agreement":null},{"id":"W4381895020","doi":"10.1007/978-3-031-34326-1","title":"Descriptional Complexity of Formal Systems","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Szegedi Tudományegyetem; Eötvös Loránd Tudományegyetem; Université de Bordeaux; Debreceni Egyetem; Universität Trier; Universidade do Porto; Univerzita Komenského v Bratislave; Slovenská Akadémia Vied; Universität Potsdam; Santa Clara University; Hebrew University of Jerusalem; Università degli Studi di Milano; Yonsei University; Queen's University","keywords":"Computer science; Automaton; Formal language; Rule-based machine translation; Programming language; Grammar systems theory; Formal system; Formal grammar; Formal methods; Theoretical computer science; Natural language processing; Artificial intelligence","score_opus":0.03960981579574425,"score_gpt":0.25225768808996296,"score_spread":0.21264787229421872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381895020","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14959791,0.013546647,0.4872979,0.016751079,0.0005942518,0.00015211328,0.0021497246,0.00068421644,0.32922614],"genre_scores_gemma":[0.9072059,0.0056535057,0.047121037,0.0006580698,0.00097203226,0.0002746037,0.0014608329,0.00024049438,0.036413584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759907,0.0005254097,0.0001527754,0.0003432695,0.0011836995,0.00019575038],"domain_scores_gemma":[0.9922586,0.006003327,0.00028057804,0.00074036414,0.0004760942,0.00024096052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012635948,0.00067537185,0.001105594,0.0019589718,0.0012266536,0.0061787167,0.0013917126,0.0009885314,0.00934051],"category_scores_gemma":[0.0070561776,0.0008187012,0.0012028464,0.0024571666,0.0038178368,0.012273998,0.0029656233,0.004687261,0.0008753676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013073801,0.000012422182,0.00011605451,0.000065775544,0.000008928992,0.0000221187,0.00016240805,0.0022604556,0.0002632505,0.98752856,0.0018143059,0.007732542],"study_design_scores_gemma":[0.0000035439712,0.0000029757516,0.00007619141,0.000007800921,0.0000035390165,0.000029693605,0.000027717448,0.004070562,0.00012073278,0.99280655,0.0028463074,0.000004399159],"about_ca_topic_score_codex":0.00096199126,"about_ca_topic_score_gemma":0.0006495716,"teacher_disagreement_score":0.00934051,"about_ca_system_score_codex":0.003556794,"about_ca_system_score_gemma":0.00096377457,"threshold_uncertainty_score":0.03124708},"labels":[],"label_agreement":null},{"id":"W4383554657","doi":"10.1145/3607471","title":"Co-lexicographically Ordering Automata and Regular Languages - Part I","year":2023,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"European Commission","keywords":"Lexicographical order; Regular language; Mathematics; Automaton; Discrete mathematics; Constant (computer programming); Nondeterministic finite automaton; ω-automaton; Combinatorics; Prefix; Deterministic automaton; Regular expression; Order (exchange); State (computer science); Nested word; Closure (psychology); Finite-state machine; Quantum finite automata; Automata theory; Computer science; Algorithm; Theoretical computer science","score_opus":0.015142524035447458,"score_gpt":0.27059090535303626,"score_spread":0.2554483813175888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383554657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092529245,0.0034072686,0.8811572,0.0024531959,0.00015622926,0.00014109157,0.0006524248,0.0008894586,0.018613907],"genre_scores_gemma":[0.7747181,0.0022686592,0.21207519,0.0007413092,0.00051422545,0.0004278529,0.0009619657,0.00023509079,0.0080576865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99617565,0.0007977163,0.00044873985,0.001335368,0.00090080977,0.0003416119],"domain_scores_gemma":[0.9863783,0.0085468665,0.0016463563,0.0022327623,0.00087935216,0.00031648195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013340337,0.0007858175,0.00084134704,0.0016362929,0.001227481,0.0047510155,0.0012208767,0.0017971429,0.0037458318],"category_scores_gemma":[0.008667706,0.0008525586,0.0021486536,0.0021897368,0.006355742,0.008895815,0.0021020132,0.0039494075,0.0007184935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007266073,0.000048988546,0.0014079292,0.00018971314,0.000030389872,0.00014758862,0.0005600457,0.015279366,0.0038871411,0.9570241,0.00095023133,0.020401893],"study_design_scores_gemma":[0.000013053255,0.00006993027,0.0006925706,0.00006163913,0.000021651367,0.00028384302,0.00016753544,0.054608304,0.0041419417,0.9329744,0.006923662,0.000041487907],"about_ca_topic_score_codex":0.0025416524,"about_ca_topic_score_gemma":0.0016500163,"teacher_disagreement_score":0.0047510155,"about_ca_system_score_codex":0.0025585797,"about_ca_system_score_gemma":0.0012370321,"threshold_uncertainty_score":0.018563867},"labels":[],"label_agreement":null},{"id":"W4384344706","doi":"10.1109/lics56636.2023.10175828","title":"Expressive Completeness of Two-Variable First-Order Logic with Counting for First-Order Logic Queries on Rooted Unranked Trees","year":2023,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Unary operation; Mathematics; Counting problem; Class (philosophy); Discrete mathematics; Node (physics); Completeness (order theory); Combinatorics; Tree (set theory); Binary tree; Equivalence relation; Monadic predicate calculus; Computer science; Theoretical computer science; Description logic; Higher-order logic; Artificial intelligence","score_opus":0.02875314544626035,"score_gpt":0.2594140852382687,"score_spread":0.23066093979200836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384344706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38645497,0.0009415771,0.5799254,0.0036788105,0.00011969392,0.00014981645,0.0016146111,0.0027409804,0.024374217],"genre_scores_gemma":[0.93156236,0.00029718672,0.06273406,0.0005078021,0.00013180038,0.00010585822,0.0010555197,0.00026919984,0.0033361576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99341077,0.0015065433,0.0005339996,0.0012497022,0.0024164962,0.0008825786],"domain_scores_gemma":[0.97902256,0.015555965,0.00085929997,0.0024520697,0.0014418163,0.0006682729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059687025,0.0008024532,0.0015633472,0.0014761862,0.0016002115,0.007563896,0.0026328608,0.0016313918,0.0029503244],"category_scores_gemma":[0.015432331,0.0007907682,0.0024413073,0.001615732,0.0041592293,0.015090066,0.0031187348,0.004183221,0.0004957126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028830764,0.00016638533,0.0016735952,0.00035219037,0.00009937426,0.0005063176,0.0017665615,0.026148904,0.0087094875,0.94002265,0.0017052267,0.018560989],"study_design_scores_gemma":[0.00007717018,0.000045912937,0.00033885136,0.000037890914,0.00006145711,0.00021337261,0.00022900471,0.09554685,0.005947997,0.8947717,0.002684381,0.000045529192],"about_ca_topic_score_codex":0.0034824412,"about_ca_topic_score_gemma":0.0032509149,"teacher_disagreement_score":0.007563896,"about_ca_system_score_codex":0.0034419831,"about_ca_system_score_gemma":0.0027264915,"threshold_uncertainty_score":0.031565905},"labels":[],"label_agreement":null},{"id":"W4384937916","doi":"10.1016/j.tcs.2023.114078","title":"On Simon's congruence closure of a string","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea; Ministry of Science, ICT and Future Planning","keywords":"Alphabet; Congruence (geometry); Mathematics; Combinatorics; String (physics); Closure (psychology); Regular language; Discrete mathematics; Computer science; Automaton; Linguistics; Theoretical computer science","score_opus":0.009520618453839953,"score_gpt":0.24837631272311528,"score_spread":0.23885569426927533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384937916","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36412373,0.0017938503,0.17793402,0.006272655,0.0017044599,0.00015757364,0.00070192333,0.0011563355,0.44615546],"genre_scores_gemma":[0.95733166,0.00048125925,0.014354668,0.00048192838,0.0006785328,0.00008167612,0.00029437194,0.00024093351,0.026054928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727017,0.00059457065,0.0001894512,0.0005374319,0.0007137292,0.00069451996],"domain_scores_gemma":[0.9964025,0.0021834662,0.00028054597,0.00030596633,0.00037940202,0.00044814355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002173252,0.001025503,0.00228113,0.0027755548,0.0054668034,0.0048930543,0.0012594123,0.0021640284,0.013148931],"category_scores_gemma":[0.0067411545,0.0008175954,0.0019524104,0.0028154524,0.0069343946,0.010081232,0.004515109,0.003358292,0.0014834569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005825076,0.000011383825,0.000052552656,0.0000147660285,0.0000026917696,0.00008608797,0.00032925067,0.00019721226,0.00042645767,0.99691015,0.00046268327,0.0014486382],"study_design_scores_gemma":[0.000033214306,0.000017927276,0.00008571446,0.000009916815,0.000005522698,0.00006360841,0.00011835582,0.0010835573,0.00038667346,0.9951042,0.0030795387,0.000011741208],"about_ca_topic_score_codex":0.0030889944,"about_ca_topic_score_gemma":0.001589247,"teacher_disagreement_score":0.013148931,"about_ca_system_score_codex":0.0028376225,"about_ca_system_score_gemma":0.0012099036,"threshold_uncertainty_score":0.043987572},"labels":[],"label_agreement":null},{"id":"W4384938342","doi":"10.1016/j.tcs.2023.114076","title":"Approximate NFA universality and related problems motivated by information theory","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Centro de Matemática Universidade do Porto; Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Universality (dynamical systems); Mathematics; Discrete mathematics; Automaton; Combinatorics; Computer science; Theoretical computer science","score_opus":0.005101673044156291,"score_gpt":0.2008103065029248,"score_spread":0.19570863345876852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384938342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18017283,0.0019706613,0.7974181,0.004644443,0.0001451956,0.00008854366,0.0003497084,0.000407405,0.014803102],"genre_scores_gemma":[0.9341843,0.0008081703,0.059483685,0.00044593046,0.00044758743,0.00012628088,0.0003372187,0.00017527147,0.0039916346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99397403,0.0020112603,0.00041986816,0.0015499259,0.001341683,0.00070330175],"domain_scores_gemma":[0.9428812,0.044847168,0.0021967543,0.0065337694,0.0021749362,0.0013661737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057936837,0.0006414323,0.00322395,0.0028959697,0.0033047413,0.0059945052,0.0038164805,0.0037309902,0.0047859303],"category_scores_gemma":[0.04724731,0.0012516791,0.0026837818,0.0044983607,0.009942725,0.023227349,0.0056433077,0.0056599244,0.0003311397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005985614,0.000037450587,0.00057663064,0.00008554174,0.000024297437,0.00007156993,0.0004788788,0.0070341234,0.00037814374,0.9843552,0.0004575703,0.0064407997],"study_design_scores_gemma":[0.0000074580134,0.0000066225743,0.0001029545,0.000012994806,0.000011609674,0.000055833254,0.000080772625,0.023314683,0.00021442321,0.97581416,0.0003695768,0.0000088636225],"about_ca_topic_score_codex":0.0023182118,"about_ca_topic_score_gemma":0.0015153324,"teacher_disagreement_score":0.0059945052,"about_ca_system_score_codex":0.0033649858,"about_ca_system_score_gemma":0.0014731116,"threshold_uncertainty_score":0.030640304},"labels":[],"label_agreement":null},{"id":"W4385071507","doi":"10.1016/j.dam.2023.07.008","title":"The palindromization map","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Suffix; Combinatorics; Rank (graph theory); Automaton; Context (archaeology); Deterministic automaton; Discrete mathematics; Algorithm; Theoretical computer science; Finite-state machine; Computer science; Linguistics; Geography","score_opus":0.011529498334838609,"score_gpt":0.23470012158322162,"score_spread":0.22317062324838302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385071507","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19204779,0.0034027742,0.31015497,0.0074519273,0.0018035918,0.00009191859,0.000457232,0.0007491081,0.48384055],"genre_scores_gemma":[0.89584094,0.0014601881,0.026324809,0.0009931352,0.0011788341,0.00012549407,0.00027975102,0.000256013,0.07354083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994041,0.00013245658,0.000032333457,0.00022500317,0.00011897463,0.00008719566],"domain_scores_gemma":[0.9992255,0.0003474027,0.00006387179,0.00014061399,0.00013749901,0.00008513968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050496345,0.00048269556,0.0006293347,0.0010965029,0.00175068,0.002566449,0.00062032003,0.0011039575,0.010933702],"category_scores_gemma":[0.0019068624,0.00040413364,0.00070924073,0.00096715416,0.0030485364,0.0058921636,0.0022042622,0.0024841216,0.0024831751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012937809,0.0000055917935,0.000032512122,0.00001197506,0.0000016244547,0.00004189692,0.00013475053,0.00009148362,0.00050320366,0.99370015,0.0007110911,0.004752798],"study_design_scores_gemma":[0.000007052418,0.0000100182415,0.00006115347,0.0000047089757,0.0000023705172,0.000121622485,0.0000482401,0.00065027166,0.000520424,0.9904867,0.008081922,0.0000055392297],"about_ca_topic_score_codex":0.00030717236,"about_ca_topic_score_gemma":0.00013790464,"teacher_disagreement_score":0.010933702,"about_ca_system_score_codex":0.0006773969,"about_ca_system_score_gemma":0.00049576507,"threshold_uncertainty_score":0.036576867},"labels":[],"label_agreement":null},{"id":"W4385173070","doi":"10.1007/s00224-023-10124-0","title":"Visit-Bounded Stack Automata","year":2023,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stack (abstract data type); Bounded function; Automaton; Computer science; Theoretical computer science; Mathematics; Discrete mathematics; Programming language; Mathematical analysis","score_opus":0.022901813855657052,"score_gpt":0.26026232340574407,"score_spread":0.23736050955008703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385173070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17129855,0.0011905594,0.72539324,0.003948105,0.0003421435,0.00011616958,0.0012076979,0.0027334555,0.093770064],"genre_scores_gemma":[0.9139836,0.00061841705,0.049846414,0.00050720235,0.00022348294,0.00021752002,0.0006981092,0.00045839723,0.03344689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983387,0.00036356814,0.00011592244,0.00037951407,0.0004687446,0.00033349052],"domain_scores_gemma":[0.99407166,0.0031066085,0.00030835086,0.0011521884,0.00082601095,0.0005352681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011615072,0.0007624864,0.0012943551,0.0016843075,0.0028838988,0.0050137965,0.0022780988,0.0018347122,0.012526327],"category_scores_gemma":[0.006343284,0.00089324557,0.0017704042,0.0020409683,0.0044828677,0.011074249,0.004865166,0.00418196,0.0019519522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031784908,0.000011619735,0.00015459287,0.00002446187,0.0000058378077,0.00004194176,0.00022173821,0.0015474495,0.00044515167,0.99389416,0.00083904166,0.0027821132],"study_design_scores_gemma":[0.000010405069,0.0000082103115,0.000056458495,0.0000076102897,0.000013438412,0.000038872247,0.000062196625,0.011040941,0.000428417,0.9862816,0.0020414807,0.000010354446],"about_ca_topic_score_codex":0.0028423949,"about_ca_topic_score_gemma":0.0026175154,"teacher_disagreement_score":0.012526327,"about_ca_system_score_codex":0.0023252966,"about_ca_system_score_gemma":0.0020600334,"threshold_uncertainty_score":0.041904747},"labels":[],"label_agreement":null},{"id":"W4385240321","doi":"10.1017/jsl.2023.55","title":"FRACTAL DIMENSIONS OF <i>k</i>-AUTOMATIC SETS","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hausdorff dimension; Minkowski–Bouligand dimension; Mathematics; Fractal; Digraph; Automaton; Box counting; Fractal dimension; Cellular automaton; Effective dimension; Packing dimension; Characterization (materials science); Hausdorff measure; Dimension function; Measure (data warehouse); Discrete mathematics; Hausdorff space; Dimension (graph theory); Entropy (arrow of time); Combinatorics; Fractal analysis; Theoretical computer science; Computer science; Algorithm; Data mining; Mathematical analysis","score_opus":0.02116319322224567,"score_gpt":0.270180949605909,"score_spread":0.24901775638366333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385240321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98032767,0.00013256066,0.014233691,0.0001316302,0.000011019421,0.000007813188,0.00012195533,0.00006459296,0.004969162],"genre_scores_gemma":[0.9979395,0.000030392646,0.0017700947,0.000009329958,0.000011431653,0.000008990897,0.00005553087,0.000006602581,0.00016808722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962795,0.00006260738,0.000028977965,0.000098284305,0.000109741144,0.00007238928],"domain_scores_gemma":[0.99690765,0.0015149567,0.00072545063,0.00026803126,0.00030761954,0.00027632227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044657712,0.00018656666,0.00036440088,0.0020326239,0.0005749341,0.0019418475,0.0004398272,0.0003703331,0.0014519957],"category_scores_gemma":[0.0026908566,0.0002526028,0.00028547848,0.0004985808,0.0021910458,0.0015080839,0.0007232798,0.00043106428,0.00010706567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021263315,0.000049393613,0.019736521,0.0001253659,0.000048485676,0.00030010685,0.001185413,0.0247317,0.028964438,0.91532505,0.0008999866,0.008420937],"study_design_scores_gemma":[0.000037016813,0.00014902107,0.049427833,0.000056841745,0.000039949555,0.00095067953,0.00089700555,0.1768564,0.01615343,0.7523024,0.0030212204,0.00010808653],"about_ca_topic_score_codex":0.00039364048,"about_ca_topic_score_gemma":0.00023316297,"teacher_disagreement_score":0.0020326239,"about_ca_system_score_codex":0.00083158916,"about_ca_system_score_gemma":0.00020231974,"threshold_uncertainty_score":0.006033659},"labels":[],"label_agreement":null},{"id":"W4385360076","doi":"10.37236/11659","title":"The Lexicographically Least Square-Free Word with a Given Prefix","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Lexicographical order; Prefix; Mathematics; Combinatorics; Word (group theory); Morphism; Square-free integer; Alphabet; Sequence (biology); Arithmetic; Ruler; Discrete mathematics; Linguistics","score_opus":0.00559057445222522,"score_gpt":0.2058071930271715,"score_spread":0.20021661857494627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385360076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.558352,0.0020553581,0.31273127,0.0021787141,0.001467023,0.00016156585,0.0021465027,0.0018508369,0.119056754],"genre_scores_gemma":[0.8212383,0.0008936808,0.13952065,0.0007470705,0.00032353518,0.00018247995,0.0019240859,0.00058924576,0.034581006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949217,0.000076985605,0.00005861366,0.00020038501,0.00009131706,0.00008054506],"domain_scores_gemma":[0.9992551,0.00026019994,0.000104047074,0.000114460294,0.00016638683,0.0000997739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028111486,0.00034022026,0.0004044273,0.0005386634,0.0011726901,0.0016324011,0.000306615,0.00088505825,0.006555213],"category_scores_gemma":[0.0014528781,0.00023697417,0.00036746764,0.0005245986,0.0020243987,0.0020047019,0.00097232807,0.0006513228,0.00279534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044424823,0.000054374996,0.0022150474,0.00047588028,0.000028428318,0.0016967056,0.0018052639,0.0013639601,0.07385907,0.8309531,0.006674657,0.08042912],"study_design_scores_gemma":[0.00006140333,0.00029006234,0.0021618681,0.0002212938,0.00006019759,0.004414314,0.00107492,0.008081459,0.062031154,0.7749122,0.14655241,0.00013875062],"about_ca_topic_score_codex":0.00037495286,"about_ca_topic_score_gemma":0.0003850471,"teacher_disagreement_score":0.006555213,"about_ca_system_score_codex":0.0003938839,"about_ca_system_score_gemma":0.0007305998,"threshold_uncertainty_score":0.021929324},"labels":[],"label_agreement":null},{"id":"W4385710887","doi":"10.1007/978-3-031-40247-0_20","title":"Transduction of Automatic Sequences and Applications","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Fibonacci number; Computer science; Transduction (biophysics); Software; Theoretical computer science; Artificial intelligence; Algebra over a field; Combinatorics; Mathematics; Programming language; Pure mathematics","score_opus":0.015946788389805955,"score_gpt":0.24140513683281806,"score_spread":0.2254583484430121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385710887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041997224,0.007175204,0.49800995,0.0015060038,0.0016097195,0.00012231563,0.0005273611,0.001500802,0.4475515],"genre_scores_gemma":[0.57670957,0.009151607,0.13110648,0.0009701116,0.0016969318,0.00040747513,0.0013295929,0.0009205092,0.27770776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959046,0.00007491685,0.000029836774,0.00010142805,0.00015969583,0.00004379632],"domain_scores_gemma":[0.99972934,0.00011880821,0.000014886697,0.0000493231,0.00006184497,0.00002572875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036560412,0.0006054839,0.00054469565,0.0012925129,0.0007548687,0.0024616776,0.000589135,0.00063347246,0.015036978],"category_scores_gemma":[0.0009195887,0.00039674572,0.00082458503,0.0016061539,0.0016475768,0.0027559157,0.0019478246,0.0015863146,0.004221206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010020104,0.000018109457,0.000042160234,0.00006127857,0.0000039620777,0.00005522464,0.00017363149,0.00051250117,0.0018331009,0.9606701,0.003126604,0.033493303],"study_design_scores_gemma":[0.000004303852,0.000019622945,0.000109892404,0.000025443675,0.0000056732024,0.00019084611,0.00007581893,0.0038386155,0.0013553365,0.95717883,0.03718633,0.000009255003],"about_ca_topic_score_codex":0.0002608986,"about_ca_topic_score_gemma":0.00017723742,"teacher_disagreement_score":0.015036978,"about_ca_system_score_codex":0.0006936851,"about_ca_system_score_gemma":0.00040934555,"threshold_uncertainty_score":0.050303698},"labels":[],"label_agreement":null},{"id":"W4386143380","doi":"10.1016/j.ic.2023.105080","title":"On the complexity of decision problems for some classes of machines and applications","year":2023,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Decision problem; Discrete mathematics; Regular language; Automaton; Mathematics; Bounded function; NP; Equivalence (formal languages); Theoretical computer science; Computer science; Time complexity; Turing machine; Algorithm","score_opus":0.036784323443912706,"score_gpt":0.2845674218857239,"score_spread":0.24778309844181123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386143380","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4526488,0.008726509,0.4234035,0.033375766,0.00054682733,0.0006280846,0.0043142703,0.00078635267,0.0755698],"genre_scores_gemma":[0.90912044,0.0031702227,0.070550576,0.0011844771,0.0012371064,0.0006349288,0.0023945607,0.00028906774,0.011418654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922363,0.0028279347,0.00051238865,0.0013596046,0.0020651645,0.0009986483],"domain_scores_gemma":[0.8373725,0.14987755,0.003726307,0.004106905,0.0025112403,0.0024055683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068243267,0.0014365577,0.0033150762,0.0032281594,0.0027551898,0.009942505,0.004008823,0.0041900342,0.016247846],"category_scores_gemma":[0.059594624,0.0014715785,0.0034900699,0.0042613414,0.005963186,0.020187616,0.0045315735,0.009050392,0.0007677375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050951476,0.0003487616,0.002676113,0.00052319025,0.00013168847,0.00018027097,0.00068004295,0.07113148,0.0007357732,0.8905919,0.008645212,0.02384609],"study_design_scores_gemma":[0.000060196846,0.000024625559,0.00050324126,0.000030251991,0.000027497956,0.00009770688,0.00011164766,0.12764002,0.00017663871,0.87013113,0.0011763124,0.000020670339],"about_ca_topic_score_codex":0.0036762375,"about_ca_topic_score_gemma":0.0028691387,"teacher_disagreement_score":0.016247846,"about_ca_system_score_codex":0.0057158605,"about_ca_system_score_gemma":0.002894753,"threshold_uncertainty_score":0.05435443},"labels":[],"label_agreement":null},{"id":"W4386297699","doi":"10.1007/978-3-031-42753-4_18","title":"Proving Results About OEIS Sequences with Walnut","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Encyclopedia; Computer science; Integer sequence; Line (geometry); Software; Algorithm; Discrete mathematics; Mathematics; Programming language; Geometry; Library science","score_opus":0.016788354721212297,"score_gpt":0.232384581580104,"score_spread":0.2155962268588917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386297699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06415454,0.0020992116,0.6505875,0.0024770026,0.0014427409,0.00017800501,0.0005547762,0.0019524212,0.27655384],"genre_scores_gemma":[0.6916613,0.0030509417,0.1640715,0.0019166429,0.0011528907,0.00039266897,0.0017747766,0.0015790627,0.13440034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984901,0.0002807005,0.00011071158,0.00030332067,0.00056658813,0.00024854866],"domain_scores_gemma":[0.9977302,0.0014867651,0.00008684232,0.0002664648,0.0002745958,0.00015510846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014269467,0.0021767085,0.0014483526,0.0034489117,0.0032401863,0.003925763,0.0020113545,0.0017261262,0.013034169],"category_scores_gemma":[0.0040208586,0.0016550685,0.0027213877,0.0032657029,0.0034688571,0.01246288,0.0054365955,0.0062886146,0.0032554946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052457854,0.00005112478,0.00020664251,0.00012981734,0.00002924359,0.00019797008,0.00043065823,0.0015231583,0.002201753,0.9723317,0.0030412467,0.01980429],"study_design_scores_gemma":[0.000011971067,0.000024363795,0.0001239904,0.000041559626,0.000037645492,0.00010389347,0.00012790259,0.0039122645,0.0026082909,0.9812509,0.01174036,0.000016827515],"about_ca_topic_score_codex":0.0014660968,"about_ca_topic_score_gemma":0.0017213328,"teacher_disagreement_score":0.013034169,"about_ca_system_score_codex":0.0015102624,"about_ca_system_score_gemma":0.0007419865,"threshold_uncertainty_score":0.0436036},"labels":[],"label_agreement":null},{"id":"W4386399952","doi":"10.4204/eptcs.386.18","title":"A General Approach to Proving Properties of Fibonacci Representations via Automata Theory","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Correctness; Fibonacci number; Automaton; Computer science; Representation (politics); Mathematical proof; Automata theory; Expression (computer science); Computation; Theoretical computer science; Algorithm; Mathematics; Algebra over a field; Discrete mathematics; Pure mathematics; Programming language","score_opus":0.011136977253306984,"score_gpt":0.2418375955661348,"score_spread":0.23070061831282782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386399952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021681797,0.00016957436,0.9910581,0.00038075773,0.0001333145,0.00008248159,0.00006661711,0.0005349261,0.005406018],"genre_scores_gemma":[0.15416035,0.0008083183,0.8360066,0.0010808068,0.00042449593,0.0007007103,0.00030854385,0.00038037598,0.0061297817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99636924,0.0009092138,0.00035553833,0.000676948,0.0014511608,0.00023786453],"domain_scores_gemma":[0.9960705,0.0019955395,0.00018619232,0.0011719251,0.00048256564,0.00009330357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040913615,0.001382166,0.0010995991,0.0024544413,0.002347803,0.0032777928,0.0033885303,0.0025450967,0.0072870837],"category_scores_gemma":[0.008608683,0.0010307104,0.004763776,0.0017191243,0.0077807247,0.0072835386,0.0043956744,0.0058017396,0.002590091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013942149,0.000028386217,0.00011021005,0.00012224552,0.000020470134,0.0001196523,0.00022703288,0.0040877485,0.0033018477,0.97619766,0.0013086596,0.014462192],"study_design_scores_gemma":[0.000017783512,0.000035880676,0.00004672525,0.000038054546,0.00001858001,0.00011140982,0.000029020031,0.012416249,0.004031936,0.9733617,0.009862611,0.000030169756],"about_ca_topic_score_codex":0.0013949117,"about_ca_topic_score_gemma":0.0011476617,"teacher_disagreement_score":0.0072870837,"about_ca_system_score_codex":0.0020029119,"about_ca_system_score_gemma":0.0018741115,"threshold_uncertainty_score":0.024377704},"labels":[],"label_agreement":null},{"id":"W4386476920","doi":"10.46298/dmtcs.10063","title":"Antisquares and Critical Exponents","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University; University of Winnipeg; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Word (group theory); Binary number; Complement (music); Combinatorics; Repetition (rhetorical device); Word length; Exponential function; Exponent; Polynomial; Discrete mathematics; Arithmetic; Mathematical analysis; Linguistics; Geometry","score_opus":0.01649650406576732,"score_gpt":0.2822118731444805,"score_spread":0.2657153690787132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386476920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9326546,0.0017286153,0.028066644,0.0012466836,0.00019864339,0.00004643858,0.00017698367,0.00036080985,0.035520513],"genre_scores_gemma":[0.99128985,0.0003380159,0.004178404,0.000117866046,0.0001686432,0.00003881872,0.00006996352,0.00007666246,0.0037217971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999368,0.00012900654,0.000045092704,0.00014434288,0.00016382498,0.00014964551],"domain_scores_gemma":[0.9927315,0.004451008,0.0009809678,0.00048345583,0.00065437716,0.0006986533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078945543,0.00046979083,0.00058285135,0.0018199232,0.0010886354,0.0019799042,0.00051050045,0.00072027807,0.005063543],"category_scores_gemma":[0.008257446,0.00037193854,0.00053181546,0.00050533225,0.003084799,0.002516816,0.0011494615,0.001451784,0.0007458865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002495597,0.00007201652,0.0038893076,0.000202121,0.000025696923,0.0006880924,0.0010085109,0.006249116,0.018811127,0.9533619,0.0032904097,0.012151927],"study_design_scores_gemma":[0.000055522873,0.00010716694,0.0019642636,0.000065625645,0.000020016256,0.0004775394,0.00022077608,0.037195288,0.0063386625,0.94923306,0.004281238,0.000040875937],"about_ca_topic_score_codex":0.00057521305,"about_ca_topic_score_gemma":0.00051766087,"teacher_disagreement_score":0.005063543,"about_ca_system_score_codex":0.001074317,"about_ca_system_score_gemma":0.00058499357,"threshold_uncertainty_score":0.016939223},"labels":[],"label_agreement":null},{"id":"W4386573223","doi":"10.1016/j.tcs.2023.114144","title":"Quantitative estimates for the size of an intersection of sparse automatic sets","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Intersection (aeronautics); Extension (predicate logic); Bounded function; Automaton; Mathematics; Natural number; Cellular automaton; Discrete mathematics; Fully automatic; Algorithm; Combinatorics; Computer science; Theoretical computer science","score_opus":0.025482411979982925,"score_gpt":0.3108738027439796,"score_spread":0.28539139076399667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386573223","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49306968,0.00067256414,0.48479506,0.0018601615,0.00012313,0.000080860664,0.0007757358,0.00063777796,0.017985033],"genre_scores_gemma":[0.9492059,0.0002625619,0.04568905,0.0001232722,0.00030716715,0.00014317277,0.00056575675,0.0002186168,0.003484481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701536,0.0007369439,0.00014663045,0.00061910716,0.0011812667,0.00030069574],"domain_scores_gemma":[0.905062,0.077245906,0.004685026,0.0043616137,0.0042488547,0.00439659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004133552,0.00079754763,0.0012724361,0.0042520706,0.0014866833,0.003951717,0.0029393074,0.0017692896,0.008006228],"category_scores_gemma":[0.041525666,0.0011984651,0.00093710696,0.0016325605,0.0055510644,0.0100107435,0.0035895158,0.0034208617,0.00041437024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003117516,0.00012056647,0.005246352,0.0002547045,0.000067756446,0.00016139238,0.00075378624,0.031662907,0.015283822,0.9334185,0.0014574068,0.011261027],"study_design_scores_gemma":[0.000028042337,0.00015088264,0.00419872,0.00005971831,0.000045805788,0.00039884393,0.0004538165,0.2965422,0.0072050183,0.68898,0.0018663184,0.00007068875],"about_ca_topic_score_codex":0.0007091789,"about_ca_topic_score_gemma":0.00058489654,"teacher_disagreement_score":0.008006228,"about_ca_system_score_codex":0.0019289771,"about_ca_system_score_gemma":0.00078000943,"threshold_uncertainty_score":0.026783466},"labels":[],"label_agreement":null},{"id":"W4387210513","doi":"10.48550/arxiv.2309.16100","title":"Generating functions of substitutions","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Substitution (logic); Aperiodic graph; Fibonacci number; Transcendental number; Mathematics; Generating function; Transcendental function; Combinatorics; Discrete mathematics; Pure mathematics; Computer science; Programming language; Mathematical analysis","score_opus":0.10465305964806462,"score_gpt":0.189659855983854,"score_spread":0.08500679633578936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387210513","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45924416,0.0022479645,0.40698233,0.0010118914,0.00038873288,0.0001406126,0.00036586382,0.00043697222,0.12918134],"genre_scores_gemma":[0.94222337,0.0013849896,0.03061883,0.00019981345,0.00042801336,0.0001360398,0.0002735341,0.0002491806,0.024486292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919075,0.00024232782,0.00004423158,0.00011439683,0.00024470495,0.00016365974],"domain_scores_gemma":[0.9978962,0.0012961933,0.00019344423,0.00015901958,0.00033107275,0.00012409568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011016363,0.0006341539,0.00047499823,0.0031125024,0.0011358876,0.0021400973,0.0006991649,0.00090424553,0.006477808],"category_scores_gemma":[0.0047258516,0.0002868713,0.00085185573,0.001456665,0.0017289962,0.0026850635,0.0011071202,0.001096801,0.0015975275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055782316,0.0000060031753,0.00020091193,0.00001906743,0.0000022749703,0.00007185357,0.00023760903,0.00096298405,0.00076156296,0.9910869,0.00028596932,0.006359299],"study_design_scores_gemma":[0.000006230318,0.000016499502,0.00022583621,0.000025050185,0.0000061875726,0.00033919915,0.00011907146,0.010417162,0.0017391866,0.9800412,0.00704675,0.000017659499],"about_ca_topic_score_codex":0.00043458122,"about_ca_topic_score_gemma":0.0002769143,"teacher_disagreement_score":0.006477808,"about_ca_system_score_codex":0.00096258434,"about_ca_system_score_gemma":0.00051104155,"threshold_uncertainty_score":0.021670401},"labels":[],"label_agreement":null},{"id":"W4387579616","doi":"10.1016/j.ipl.2023.106452","title":"Ranking and unranking bordered and unbordered words","year":2023,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"University of Winnipeg","keywords":"Suffix; Prefix; Word (group theory); Rank (graph theory); Ranking (information retrieval); Alphabet; Combinatorics; Space (punctuation); Mathematics; Computer science; Unit (ring theory); Arithmetic; Artificial intelligence; Linguistics; Geometry","score_opus":0.006699653823596698,"score_gpt":0.21484779076425592,"score_spread":0.20814813694065923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387579616","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53253096,0.0010837816,0.44782636,0.00036152228,0.00033678242,0.00036799334,0.0013889592,0.0037425477,0.012361055],"genre_scores_gemma":[0.60277426,0.00035567896,0.38192394,0.00009751406,0.00014543206,0.000116569994,0.0028143034,0.00035045968,0.011421848],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879956,0.00022009398,0.0001710219,0.00029211736,0.00029345736,0.00022374232],"domain_scores_gemma":[0.9963252,0.0014781,0.00054449326,0.0006255023,0.0007265766,0.00030023782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073061447,0.00071998435,0.0011987123,0.0017162103,0.00083984877,0.0020378092,0.00093470834,0.00056233193,0.006747738],"category_scores_gemma":[0.0054217675,0.0003107876,0.00066990504,0.0012648416,0.00078358734,0.0030690548,0.0011325517,0.000575047,0.0023230442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019268598,0.00036738973,0.007935417,0.0012058485,0.00012376654,0.0013181046,0.0012830463,0.04879247,0.09144631,0.10396897,0.015018567,0.7266133],"study_design_scores_gemma":[0.00029469255,0.0017560283,0.0043678526,0.00025493765,0.00020796494,0.0018344189,0.0022560037,0.38261616,0.12513895,0.4360297,0.044979844,0.0002634299],"about_ca_topic_score_codex":0.0009669713,"about_ca_topic_score_gemma":0.0025451353,"teacher_disagreement_score":0.006747738,"about_ca_system_score_codex":0.00046801186,"about_ca_system_score_gemma":0.00089084834,"threshold_uncertainty_score":0.022573471},"labels":[],"label_agreement":null},{"id":"W4387672295","doi":"10.46298/dmtcs.9919","title":"Pseudoperiodic Words and a Question of Shevelev","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Mathematics; Word (group theory); Exponent; Combinatorics; Linguistics; Philosophy","score_opus":0.01141992789671988,"score_gpt":0.2606217039301331,"score_spread":0.24920177603341323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387672295","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65816855,0.009525433,0.21533461,0.020981055,0.0009292132,0.00010429982,0.0003663362,0.000416931,0.094173655],"genre_scores_gemma":[0.9661414,0.0015375146,0.023889331,0.0014074536,0.0005376332,0.000087369524,0.0001621739,0.00007717919,0.0061599696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927014,0.00021237037,0.00006689665,0.00018200358,0.00019100479,0.000077555684],"domain_scores_gemma":[0.9940744,0.004448956,0.00036061555,0.00054602826,0.00034780067,0.00022219421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011479848,0.00025781462,0.0006536467,0.0008410445,0.0014015456,0.0014983047,0.0005309661,0.0014609721,0.0028004344],"category_scores_gemma":[0.009123986,0.0003223139,0.0004887648,0.0008213475,0.003898182,0.0058423947,0.0019498755,0.0018883591,0.0004882051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001643982,0.00003591847,0.0012819387,0.00015819614,0.000015544148,0.0004186513,0.00090980914,0.0029011315,0.0039574127,0.95980114,0.0034292624,0.026926551],"study_design_scores_gemma":[0.000021261547,0.000037521004,0.0003846486,0.00003555047,0.0000072130865,0.00028112027,0.00022552098,0.005009473,0.0013882528,0.98313165,0.009462396,0.000015424546],"about_ca_topic_score_codex":0.00023182188,"about_ca_topic_score_gemma":0.00015516987,"teacher_disagreement_score":0.0028004344,"about_ca_system_score_codex":0.000663256,"about_ca_system_score_gemma":0.0004418039,"threshold_uncertainty_score":0.00936836},"labels":[],"label_agreement":null},{"id":"W4387793828","doi":"10.1016/j.jcta.2023.105828","title":"Non-expansive matrix number systems with bases similar to certain Jordan blocks","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Expansive; Dimension (graph theory); Numerical digit; Eigenvalues and eigenvectors; Matrix (chemical analysis); Block (permutation group theory); Set (abstract data type); Base (topology); Context (archaeology); Jordan matrix; Logarithm; Combinatorics; Arithmetic; Representation (politics); Discrete mathematics; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.006912436830327222,"score_gpt":0.24505233938173857,"score_spread":0.23813990255141135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387793828","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6540375,0.0005583509,0.25818112,0.0006692477,0.000442378,0.00013389319,0.00034032512,0.0003498535,0.08528731],"genre_scores_gemma":[0.931936,0.00020448938,0.03900457,0.00020943375,0.00021532693,0.00015462012,0.00032573793,0.0001075729,0.027842205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994593,0.00014402687,0.000038959213,0.00009412287,0.00015800225,0.00010558053],"domain_scores_gemma":[0.9984085,0.0005938996,0.00023595153,0.00019380488,0.00029165458,0.00027628103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005182252,0.00043848882,0.0005608179,0.0010134957,0.0012152288,0.0022276551,0.00079723995,0.00066945865,0.008452893],"category_scores_gemma":[0.0022588659,0.0003921141,0.0004372346,0.0008002353,0.0015101208,0.0024013093,0.0011687151,0.001331504,0.0013139579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054296062,0.00003524245,0.00016192597,0.000029646708,0.000006900133,0.00011988256,0.00020529673,0.0012063088,0.0047419895,0.98995095,0.00054523186,0.002942203],"study_design_scores_gemma":[0.000039782073,0.000074864256,0.00040163565,0.000016201575,0.000010863995,0.00036375652,0.00021690495,0.017638925,0.004706419,0.97198355,0.00451799,0.000029086317],"about_ca_topic_score_codex":0.0002468699,"about_ca_topic_score_gemma":0.00046025455,"teacher_disagreement_score":0.008452893,"about_ca_system_score_codex":0.00038519892,"about_ca_system_score_gemma":0.00041990698,"threshold_uncertainty_score":0.028277755},"labels":[],"label_agreement":null},{"id":"W4388038106","doi":"10.4171/jems/1376","title":"A Tits alternative for endomorphisms of the projective line","year":2023,"lang":"en","type":"article","venue":"Journal of the European Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Endomorphism; Mathematics; Semigroup; Bounded function; Combinatorics; Field (mathematics); Finitely-generated abelian group; Line (geometry); Pure mathematics; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.03220973432744556,"score_gpt":0.26607491508387443,"score_spread":0.23386518075642887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388038106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43181428,0.00056852325,0.41984698,0.0032583517,0.0007085265,0.0001198216,0.00044284365,0.00060580455,0.14263494],"genre_scores_gemma":[0.9441348,0.00015771958,0.031931646,0.00046741462,0.00023748174,0.000095995965,0.0001729632,0.0001298023,0.022672249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998716,0.00023710598,0.00006963627,0.00035065124,0.00035516344,0.00027145966],"domain_scores_gemma":[0.99783045,0.0008118367,0.000228493,0.0003842276,0.00031231108,0.00043255856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012035542,0.00031244985,0.00040277152,0.0008126903,0.0015120108,0.0025878486,0.00051428284,0.00085112796,0.008365366],"category_scores_gemma":[0.0022708694,0.0003112698,0.0012265402,0.00040408468,0.0035920816,0.004666744,0.0030330992,0.0028501737,0.0010284048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026939746,0.000013229859,0.00018495218,0.000013118883,0.000003487557,0.00012780172,0.00021686294,0.00021730826,0.001858527,0.9952981,0.00031670585,0.0017230228],"study_design_scores_gemma":[0.000035222853,0.00009375837,0.00045727091,0.000014138061,0.000010867322,0.0004642352,0.00023229975,0.005808937,0.0029202874,0.98032093,0.009620219,0.000021980268],"about_ca_topic_score_codex":0.0003345952,"about_ca_topic_score_gemma":0.00033266356,"teacher_disagreement_score":0.008365366,"about_ca_system_score_codex":0.00083229796,"about_ca_system_score_gemma":0.00039443516,"threshold_uncertainty_score":0.027984917},"labels":[],"label_agreement":null},{"id":"W4388127845","doi":"10.1007/s12188-023-00270-0","title":"An example of Tateno disproving conjectures of Bonato–Tardif, Thomasse, and Tyomkyn","year":2023,"lang":"de","type":"article","venue":"Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Counterexample; Exposition (narrative); Mathematics; Conjecture; Calculus (dental); Combinatorics; Discrete mathematics; Medicine; Literature","score_opus":0.022345725724244484,"score_gpt":0.24257450578485876,"score_spread":0.22022878006061428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388127845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37624285,0.0044555753,0.17992797,0.060354292,0.004360979,0.00024544596,0.002311511,0.002964326,0.36913705],"genre_scores_gemma":[0.93432736,0.0006432266,0.03797144,0.0017543789,0.00033933631,0.000094517665,0.00082728773,0.00030171065,0.02374064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795216,0.0007237135,0.00010559207,0.00030561074,0.00058101735,0.00033184237],"domain_scores_gemma":[0.98869497,0.0070276246,0.00030857918,0.002075752,0.0015070246,0.00038612512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019780875,0.0005579936,0.0011187237,0.0018845918,0.007363504,0.0018944065,0.0014203753,0.0034020466,0.012973744],"category_scores_gemma":[0.017621353,0.00048408733,0.0014174255,0.0018296498,0.0034158782,0.003034648,0.002989595,0.0033661933,0.001626899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006951638,0.00013603555,0.0029803454,0.00023554853,0.00011249598,0.0036949974,0.0030396855,0.005809206,0.0032803363,0.8996326,0.06172792,0.018655676],"study_design_scores_gemma":[0.00015687433,0.000064370666,0.0020412612,0.000109782806,0.00006713576,0.0011826301,0.0011526527,0.025584197,0.004148828,0.8929214,0.072477356,0.00009351783],"about_ca_topic_score_codex":0.0047794436,"about_ca_topic_score_gemma":0.0063154623,"teacher_disagreement_score":0.012973744,"about_ca_system_score_codex":0.0010174181,"about_ca_system_score_gemma":0.0009191779,"threshold_uncertainty_score":0.04340154},"labels":[],"label_agreement":null},{"id":"W4388317930","doi":"10.1093/oso/9780198505617.003.0005","title":"Interacting models of walks and polygons","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Combinatorics; Connection (principal bundle); Lattice (music); Order (exchange); Discrete mathematics; Physics; Geometry","score_opus":0.01825915297163308,"score_gpt":0.21343921491232112,"score_spread":0.19518006194068804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388317930","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6047537,0.002260091,0.15042146,0.0023258608,0.00044173127,0.000075859745,0.0002650097,0.00047259917,0.23898375],"genre_scores_gemma":[0.9725522,0.0003749302,0.009011257,0.00013654091,0.00009685681,0.00004182954,0.00007672681,0.00003516342,0.017674569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952793,0.00015537474,0.000018614099,0.0000774007,0.00016760743,0.00005304292],"domain_scores_gemma":[0.9993568,0.00026825143,0.000073728,0.00013329729,0.00005989039,0.00010800583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033674165,0.00033497723,0.00044282168,0.00055143406,0.0006103192,0.0021455155,0.00078443345,0.0008673803,0.006673358],"category_scores_gemma":[0.0012243481,0.00021000461,0.00038996726,0.00056334824,0.0017230132,0.0031073284,0.0012548879,0.00094101514,0.0005293074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016043541,0.000017085722,0.00019538996,0.000023529328,0.0000036137285,0.00012219172,0.0002500208,0.004950944,0.0009628508,0.99115014,0.00045240764,0.0018557886],"study_design_scores_gemma":[0.00001135222,0.000018449913,0.00014953605,0.000015678677,0.000004050018,0.0001276152,0.00014885307,0.039721597,0.00048774894,0.953227,0.0060810153,0.000007143694],"about_ca_topic_score_codex":0.0006683105,"about_ca_topic_score_gemma":0.0006715264,"teacher_disagreement_score":0.006673358,"about_ca_system_score_codex":0.00058862503,"about_ca_system_score_gemma":0.00024814278,"threshold_uncertainty_score":0.022324622},"labels":[],"label_agreement":null},{"id":"W4388976593","doi":"10.1007/s00605-023-01923-1","title":"Infinite products involving the period-doubling sequence","year":2023,"lang":"de","type":"article","venue":"Monatshefte für Mathematik","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Period (music); Sequence (biology); Period-doubling bifurcation; Mathematics; Chemistry; Physics; Nonlinear system; Biochemistry","score_opus":0.061072183985952704,"score_gpt":0.2963607394206391,"score_spread":0.2352885554346864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388976593","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48824912,0.0019404513,0.28919962,0.0011210692,0.0007252096,0.000059472142,0.00039832608,0.00044871168,0.21785796],"genre_scores_gemma":[0.93346435,0.0007675864,0.020828824,0.0001895107,0.0003686993,0.00006382864,0.00021768117,0.00015228482,0.043947317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996464,0.000087514,0.000026407073,0.00006990946,0.00012411314,0.000045526234],"domain_scores_gemma":[0.99867463,0.00075195316,0.00013360045,0.00013906883,0.00016767402,0.00013317075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054158736,0.0004689823,0.00034015684,0.00080267916,0.0007517697,0.0019219375,0.00041826884,0.0006043038,0.0075037633],"category_scores_gemma":[0.0022922668,0.0002841967,0.0004040799,0.0005413164,0.0010943965,0.0031076414,0.0011754793,0.0010418677,0.0011571534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004898488,0.000011060858,0.00012004999,0.00004407834,0.000005154983,0.00021812195,0.00015063402,0.00078876095,0.003183647,0.988672,0.0007335185,0.0060238987],"study_design_scores_gemma":[0.000010913705,0.00002552103,0.0001489966,0.0000123877535,0.0000076221263,0.00030036832,0.000052576826,0.0050082924,0.0028896404,0.9863913,0.0051411763,0.000011252254],"about_ca_topic_score_codex":0.000097839504,"about_ca_topic_score_gemma":0.00011730149,"teacher_disagreement_score":0.0075037633,"about_ca_system_score_codex":0.00043878387,"about_ca_system_score_gemma":0.00028089868,"threshold_uncertainty_score":0.025102615},"labels":[],"label_agreement":null},{"id":"W4389314516","doi":"10.1145/3636362.3636364","title":"Complexity Column","year":2023,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Undecidable problem; Word problem (mathematics education); Decidability; Semigroup; Intersection (aeronautics); Mathematics; Group (periodic table); Column (typography); Decision problem; Computational complexity theory; Word (group theory); Discrete mathematics; Computer science; Theoretical computer science; Algebra over a field; Algorithm; Arithmetic; Pure mathematics","score_opus":0.06774780822632265,"score_gpt":0.28834727794661924,"score_spread":0.2205994697202966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389314516","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015310464,0.013629863,0.1988688,0.039365027,0.0056981384,0.00039165103,0.014198928,0.00295796,0.70957917],"genre_scores_gemma":[0.31800735,0.014925356,0.10765279,0.009751987,0.0077744094,0.0011368443,0.026996706,0.0026602033,0.51109433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99736625,0.00032649116,0.00013838844,0.00090362114,0.0009723281,0.0002929312],"domain_scores_gemma":[0.9950159,0.0020245125,0.00021736976,0.0014039085,0.0009327837,0.00040541447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009797739,0.0010913159,0.0011061629,0.0013167314,0.0022879525,0.0077844323,0.0019070222,0.0014966448,0.1359043],"category_scores_gemma":[0.006821978,0.0005219342,0.0014017259,0.002374853,0.0016436152,0.008890691,0.0028310486,0.005634648,0.035512716],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085393716,0.00008830292,0.0004532455,0.00036294217,0.000046934645,0.00007301187,0.00015523325,0.0024200797,0.0014308662,0.6601587,0.23895046,0.09577478],"study_design_scores_gemma":[0.000023456327,0.000033710752,0.0006100362,0.00008454879,0.000024702578,0.0002882506,0.00010717302,0.008597164,0.0012046105,0.6774459,0.31155285,0.000027648695],"about_ca_topic_score_codex":0.0019493594,"about_ca_topic_score_gemma":0.002223591,"teacher_disagreement_score":0.1359043,"about_ca_system_score_codex":0.0029482292,"about_ca_system_score_gemma":0.0020930534,"threshold_uncertainty_score":0.45464516},"labels":[],"label_agreement":null},{"id":"W4389719752","doi":"10.1016/j.tcs.2023.114343","title":"A note on the Lie complexity and beyond","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Simple Lie group; Lie theory; Representation of a Lie group; Adjoint representation of a Lie algebra; Prefix; Algebra over a field; Discrete mathematics; Pure mathematics; Lie group; Lie conformal algebra; Linguistics; Philosophy","score_opus":0.02409785001389637,"score_gpt":0.2646157875610625,"score_spread":0.24051793754716616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389719752","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024428269,0.08135949,0.14270966,0.287172,0.02167237,0.00004450062,0.00047600735,0.0003342753,0.44180351],"genre_scores_gemma":[0.68164605,0.047006823,0.05816794,0.04614896,0.07061575,0.0002398331,0.00040223307,0.0005006855,0.09527175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998638,0.00057392655,0.000054885568,0.00023911337,0.0003840687,0.00011009116],"domain_scores_gemma":[0.99287134,0.0056832116,0.0001590283,0.00059532,0.0004514247,0.00023959375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002473897,0.0007032238,0.001417223,0.0019486219,0.0030544868,0.004107935,0.0017137342,0.0034916026,0.0101406295],"category_scores_gemma":[0.0070885303,0.0003799814,0.0010618439,0.0015877511,0.01289038,0.01956604,0.0045155142,0.009053673,0.0016833616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050485883,0.0000037761224,0.000023068767,0.000016407046,0.000002294374,0.000022111975,0.00007151965,0.000090972106,0.00004333181,0.9939964,0.004225596,0.001499358],"study_design_scores_gemma":[0.000002418555,0.0000020499365,0.000018858831,0.00000808555,9.0259203e-7,0.0000133010635,0.000019166357,0.0001978796,0.000020730731,0.9898517,0.009860969,0.000003937461],"about_ca_topic_score_codex":0.0012739962,"about_ca_topic_score_gemma":0.0012691886,"teacher_disagreement_score":0.0101406295,"about_ca_system_score_codex":0.0017508967,"about_ca_system_score_gemma":0.00086350297,"threshold_uncertainty_score":0.033923805},"labels":[],"label_agreement":null},{"id":"W4390338595","doi":"10.1016/j.tcs.2023.114363","title":"Proving properties of some greedily-defined integer recurrences via automata theory","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Simple (philosophy); Conjecture; Automaton; Integer (computer science); Property (philosophy); Sequence (biology); Integer sequence; Discrete mathematics; Mathematics; Automata theory; Computer science; Combinatorics; Integer programming; Algorithm; Theoretical computer science; Generating function; Programming language","score_opus":0.01861407997515179,"score_gpt":0.2358628531487552,"score_spread":0.21724877317360342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390338595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24896379,0.0004921905,0.72463197,0.000986888,0.00014549296,0.00012018972,0.00018731548,0.0006626789,0.023809494],"genre_scores_gemma":[0.8703451,0.00027611354,0.12330064,0.00037874808,0.0000735137,0.00013445654,0.00015228194,0.00012767255,0.005211381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838734,0.0005034179,0.00015619419,0.00040612297,0.00034128613,0.00020560595],"domain_scores_gemma":[0.9928698,0.005014816,0.00060050003,0.0007463454,0.00056847365,0.00020006429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019949537,0.00046736433,0.0005358666,0.0013647517,0.0015367036,0.002216396,0.0010173125,0.0009010861,0.0030138132],"category_scores_gemma":[0.012213343,0.0004395359,0.0014275502,0.000875829,0.0033290882,0.005933212,0.0013510507,0.0023691787,0.0005391226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005651112,0.00003145005,0.0009215778,0.000062895335,0.000015914644,0.0001535755,0.0006412269,0.0044163275,0.005647637,0.9760449,0.00047940263,0.011528586],"study_design_scores_gemma":[0.000028417226,0.00007509775,0.00037926144,0.000030783012,0.00002969447,0.00023568743,0.00023911327,0.039918747,0.015616372,0.9390247,0.0043834574,0.000038685037],"about_ca_topic_score_codex":0.0011338022,"about_ca_topic_score_gemma":0.001041772,"teacher_disagreement_score":0.0030138132,"about_ca_system_score_codex":0.001580359,"about_ca_system_score_gemma":0.00082563824,"threshold_uncertainty_score":0.011466324},"labels":[],"label_agreement":null},{"id":"W4390604910","doi":"10.1007/s00283-023-10316-z","title":"On the Three-Distance Theorem","year":2024,"lang":"en","type":"article","venue":"The Mathematical Intelligencer","topic":"semigroups and automata theory","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Mathematics","score_opus":0.03363884972925238,"score_gpt":0.2801526812953224,"score_spread":0.24651383156607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390604910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07856628,0.004427444,0.5152835,0.019952225,0.0015336828,0.00006671902,0.0006105907,0.00042754444,0.37913194],"genre_scores_gemma":[0.8611879,0.0018403262,0.08046323,0.004739576,0.0010583949,0.00022973373,0.0005715695,0.00026201707,0.04964723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987643,0.0003369209,0.000067798464,0.0003564368,0.00032427366,0.0001503221],"domain_scores_gemma":[0.9975121,0.0013944342,0.00010464947,0.0004266025,0.00036920002,0.00019304418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016305449,0.00050408795,0.00090882083,0.0012320246,0.0024538497,0.0026203291,0.0015112767,0.0016469024,0.0122855995],"category_scores_gemma":[0.0040210057,0.00026658765,0.0011368244,0.0011845733,0.0056869555,0.009313544,0.0049652667,0.0043362593,0.0022244926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008343261,0.000003878263,0.000034110188,0.000010733605,0.000002084268,0.000011349831,0.000054450724,0.00008598115,0.00007011195,0.9968123,0.0008216907,0.0020848834],"study_design_scores_gemma":[0.0000054759894,0.0000043021846,0.000039990224,0.0000041898866,0.0000015174937,0.000023574934,0.00002474438,0.0005164781,0.000085165426,0.9955112,0.003780491,0.0000029724858],"about_ca_topic_score_codex":0.0010936857,"about_ca_topic_score_gemma":0.0006448704,"teacher_disagreement_score":0.0122855995,"about_ca_system_score_codex":0.0015012188,"about_ca_system_score_gemma":0.0006207175,"threshold_uncertainty_score":0.04109937},"labels":[],"label_agreement":null},{"id":"W4390659634","doi":"10.5802/alco.322","title":"A <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>q</mml:mi> </mml:math> -analog of the Markoff injectivity conjecture holds","year":2024,"lang":"en","type":"article","venue":"Algebraic Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Conjecture; Uniqueness; Mathematics; Christoffel symbols; Pure mathematics; Discrete mathematics; Algebra over a field; Mathematical analysis","score_opus":0.011110837522224365,"score_gpt":0.2229008874173038,"score_spread":0.21179004989507944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390659634","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034409378,0.0014824547,0.26235348,0.034086578,0.004102638,0.0005677345,0.008491752,0.008131575,0.6463744],"genre_scores_gemma":[0.51449597,0.005237893,0.10104154,0.0145688355,0.0031104672,0.0009550863,0.017285302,0.00595172,0.33735314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822646,0.00032140518,0.00010903883,0.0005515813,0.0005506584,0.00024092874],"domain_scores_gemma":[0.99754035,0.00075938413,0.0002687498,0.00058252964,0.0006372343,0.00021172999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019046504,0.0014014769,0.0010096851,0.0011674111,0.0024029685,0.0041152122,0.0014434988,0.0020972935,0.16139945],"category_scores_gemma":[0.0042799353,0.00088298315,0.001441927,0.0020720125,0.0025491961,0.010533837,0.0033674878,0.0044388324,0.039475612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002195365,0.00023452213,0.0011380691,0.0002958997,0.000044131262,0.00037658084,0.00062197674,0.00061005715,0.0052817552,0.7729636,0.16499805,0.05321577],"study_design_scores_gemma":[0.0001678369,0.00016692161,0.0028032518,0.00015434119,0.000050142524,0.0011620885,0.00047575854,0.006475267,0.014365299,0.50275606,0.47125918,0.00016379206],"about_ca_topic_score_codex":0.004069272,"about_ca_topic_score_gemma":0.0043653655,"teacher_disagreement_score":0.16139945,"about_ca_system_score_codex":0.0021350128,"about_ca_system_score_gemma":0.0012480672,"threshold_uncertainty_score":0.539935},"labels":[],"label_agreement":null},{"id":"W4390714611","doi":"10.55016/ojs/cdm.v17i1.67951","title":"Pushes in words-a primitive sorting algorithm","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation","keywords":"Alphabet; Sorting; Combinatorics; Mathematics; Statistic; Order (exchange); Word (group theory); Degree (music); Function (biology); Algorithm; Discrete mathematics; Arithmetic; Statistics; Geometry","score_opus":0.010191505785043426,"score_gpt":0.2709214146603092,"score_spread":0.2607299088752658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30357128,0.00016890792,0.6836823,0.0004635772,0.0000928529,0.0000970957,0.00041813162,0.0020286373,0.009477162],"genre_scores_gemma":[0.8469541,0.0001657656,0.14167945,0.00018306107,0.00012179876,0.00017055815,0.00057617476,0.0004722344,0.009676882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984779,0.00030437697,0.000117319454,0.000355475,0.0005441253,0.00020080173],"domain_scores_gemma":[0.9934807,0.0034884026,0.00060844474,0.001286721,0.0006846959,0.00045111455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014777839,0.00044551966,0.00078247255,0.0017087254,0.00090868573,0.0027678024,0.0010278965,0.00082695985,0.0042028343],"category_scores_gemma":[0.009349056,0.00033576362,0.0007420354,0.0015202514,0.002658378,0.0032137565,0.0017381087,0.0013174119,0.0011576412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032647344,0.000067270266,0.0036869568,0.00011091445,0.000027887332,0.00023881152,0.00057048426,0.030459387,0.012945129,0.8736559,0.0020064896,0.07590425],"study_design_scores_gemma":[0.00004007047,0.00012996844,0.0011528328,0.000027716804,0.00001942616,0.00025836687,0.00013791595,0.20788744,0.011612122,0.7730913,0.005592854,0.000050028033],"about_ca_topic_score_codex":0.00064808474,"about_ca_topic_score_gemma":0.0006492071,"teacher_disagreement_score":0.0042028343,"about_ca_system_score_codex":0.00088616105,"about_ca_system_score_gemma":0.0011617651,"threshold_uncertainty_score":0.014059901},"labels":[],"label_agreement":null},{"id":"W4391197450","doi":"10.1016/j.disc.2024.113902","title":"An upper bound of the number of distinct powers in binary words","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Binary number; Upper and lower bounds; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.009969578661615004,"score_gpt":0.2774593452152697,"score_spread":0.2674897665536547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391197450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22146131,0.007856663,0.5816106,0.014937841,0.0026434471,0.00025521062,0.002670416,0.0018421503,0.16672227],"genre_scores_gemma":[0.8291588,0.003532572,0.122422606,0.002352758,0.0029802662,0.000491275,0.0016256712,0.0012211436,0.036214832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99037325,0.0024352851,0.00068921834,0.0024728132,0.002321033,0.001708462],"domain_scores_gemma":[0.9106205,0.07261873,0.0020664786,0.008146207,0.002604587,0.003943545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055024778,0.0025032237,0.003352362,0.0032840848,0.004153464,0.010089329,0.0062873126,0.0045915134,0.019936543],"category_scores_gemma":[0.04566629,0.002376492,0.0027905777,0.0031425762,0.007685971,0.023804883,0.008488449,0.008797626,0.004677365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013504067,0.0002861428,0.0022467307,0.0006569392,0.000098308046,0.00054763525,0.0006920039,0.0135438815,0.012417476,0.92493,0.009963103,0.03326743],"study_design_scores_gemma":[0.00005847786,0.00006894918,0.00054407155,0.00010835286,0.00007021814,0.00055980444,0.00008494443,0.03443425,0.0047031255,0.9524022,0.0069065536,0.00005901069],"about_ca_topic_score_codex":0.00053678243,"about_ca_topic_score_gemma":0.0006621564,"teacher_disagreement_score":0.019936543,"about_ca_system_score_codex":0.0026180795,"about_ca_system_score_gemma":0.0016465166,"threshold_uncertainty_score":0.06669432},"labels":[],"label_agreement":null},{"id":"W4391425602","doi":"10.1016/j.aam.2024.102673","title":"Block-counting sequences are not purely morphic","year":2024,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Block (permutation group theory); Arithmetic; Combinatorics; Discrete mathematics","score_opus":0.013040888794188792,"score_gpt":0.25576779638567254,"score_spread":0.24272690759148374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391425602","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5529731,0.00082711386,0.30062443,0.001270554,0.00077945745,0.0001530071,0.0009708195,0.001748567,0.14065298],"genre_scores_gemma":[0.91637284,0.0003287787,0.038808092,0.000486118,0.00020824575,0.00021997547,0.0008369653,0.00048232605,0.042256646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991347,0.00013088151,0.00007229445,0.0002363843,0.00025416384,0.00017161673],"domain_scores_gemma":[0.995572,0.002206203,0.00048563693,0.00075481966,0.00061776384,0.00036354494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005926498,0.0005609949,0.000790003,0.0012871106,0.0015076351,0.0025518383,0.00077486987,0.0014481691,0.010474639],"category_scores_gemma":[0.0052805427,0.000698431,0.0005727046,0.0010448581,0.002169825,0.0059214784,0.0015275875,0.0015191531,0.001769838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008191959,0.000022494074,0.000324372,0.000061436316,0.0000070789993,0.00011429754,0.00020600553,0.0005185077,0.004500034,0.98563737,0.0011577273,0.0073687807],"study_design_scores_gemma":[0.000016377317,0.000029281664,0.000458098,0.000017955259,0.000012791309,0.00029348998,0.000087597335,0.0052334354,0.0027457268,0.9843501,0.006736514,0.000018657112],"about_ca_topic_score_codex":0.00041956909,"about_ca_topic_score_gemma":0.0007216178,"teacher_disagreement_score":0.010474639,"about_ca_system_score_codex":0.0007197134,"about_ca_system_score_gemma":0.0006108144,"threshold_uncertainty_score":0.035041213},"labels":[],"label_agreement":null},{"id":"W4391582431","doi":"10.2139/ssrn.4718463","title":"Strongly K-Recursive Sequences","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009025874379821783,"score_gpt":0.24931339586989018,"score_spread":0.2402875214900684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391582431","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5065253,0.0010118926,0.19329202,0.002127804,0.000517495,0.000105957035,0.0014123657,0.0012442209,0.29376298],"genre_scores_gemma":[0.9330163,0.00034066234,0.012816004,0.00031146008,0.00013016505,0.00007480263,0.00061871565,0.00019487181,0.05249698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908125,0.00016673272,0.00006780782,0.00028643938,0.00020736612,0.0001904854],"domain_scores_gemma":[0.99763966,0.0012121754,0.00015539848,0.00025522013,0.0005026409,0.00023499764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049633416,0.0006359039,0.0004913541,0.0008193116,0.0013227894,0.003052501,0.0005707796,0.000977607,0.0116630215],"category_scores_gemma":[0.002595,0.0004960272,0.0005542656,0.00089268875,0.0016046689,0.0031751054,0.002155539,0.0021109148,0.004110175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014037454,0.000043378768,0.00081589585,0.0001081221,0.000015552092,0.00025939662,0.0007051771,0.00076343067,0.010996752,0.97053415,0.0026432418,0.012974564],"study_design_scores_gemma":[0.000028442942,0.000043987424,0.0015407002,0.00003670117,0.000021926204,0.0006205543,0.000291912,0.0052973493,0.00894741,0.96731436,0.015824191,0.000032595784],"about_ca_topic_score_codex":0.00037426935,"about_ca_topic_score_gemma":0.0004472809,"teacher_disagreement_score":0.0116630215,"about_ca_system_score_codex":0.00091193005,"about_ca_system_score_gemma":0.0005559831,"threshold_uncertainty_score":0.039016664},"labels":[],"label_agreement":null},{"id":"W4392637423","doi":"10.1007/978-3-031-42891-3_4","title":"Polák Theorem","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on mathematics and statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lattice (music); Mathematics; Combinatorics; Discrete mathematics; Physics","score_opus":0.01263921902068846,"score_gpt":0.22713107458747436,"score_spread":0.2144918555667859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392637423","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002846044,0.0023070686,0.0285772,0.0024072195,0.0011966836,0.00003627081,0.00062635,0.00029995164,0.9617032],"genre_scores_gemma":[0.18776788,0.005951367,0.018803257,0.0052604494,0.0015480064,0.00034644792,0.0016569083,0.0010302381,0.7776354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993667,0.00009712453,0.000028390876,0.00021246626,0.00018693108,0.00010840636],"domain_scores_gemma":[0.9996772,0.00009011111,0.000018636596,0.00008446382,0.000096093354,0.000033591074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004346991,0.0009286215,0.0008762676,0.001980204,0.002484326,0.0036910062,0.0010661472,0.001190554,0.060433816],"category_scores_gemma":[0.0014378821,0.0005358084,0.00083988917,0.0014200481,0.0027093994,0.0061706966,0.003108633,0.0048915152,0.021131426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019095802,0.000011190302,0.00003967129,0.00006475601,0.000005627814,0.000021896618,0.000093728864,0.00008120257,0.00022733721,0.9607466,0.024611948,0.014076918],"study_design_scores_gemma":[0.000008613185,0.0000060467505,0.000119118005,0.000024242843,0.000009436999,0.000100097,0.00005430623,0.00031634432,0.00038861154,0.85555243,0.1434134,0.00000737956],"about_ca_topic_score_codex":0.0014425548,"about_ca_topic_score_gemma":0.0012393355,"teacher_disagreement_score":0.060433816,"about_ca_system_score_codex":0.0015388136,"about_ca_system_score_gemma":0.0010444118,"threshold_uncertainty_score":0.20217127},"labels":[],"label_agreement":null},{"id":"W4392637424","doi":"10.1007/978-3-031-42891-3","title":"Completely Regular Semigroup Varieties","year":2024,"lang":"en","type":"book","venue":"Synthesis lectures on mathematics and statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Semigroup; Mathematics; Pure mathematics; Algebra over a field","score_opus":0.013641426260821954,"score_gpt":0.2234866828034824,"score_spread":0.20984525654266045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392637424","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009549615,0.003789357,0.017424045,0.0009707731,0.000582693,0.000016420248,0.00033701985,0.00032068678,0.96700937],"genre_scores_gemma":[0.15419912,0.003000768,0.00614508,0.00033847513,0.00061567384,0.000031412823,0.0005529773,0.00025705007,0.83485943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998492,0.000025318794,0.0000043254586,0.0000347266,0.00007022442,0.000016295458],"domain_scores_gemma":[0.9998951,0.000029253695,0.000006433536,0.00002363972,0.000029193772,0.000016402824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001607497,0.00037332645,0.00033048305,0.000553807,0.0005746651,0.001592236,0.0002690997,0.00023461203,0.023884555],"category_scores_gemma":[0.0004377217,0.00024078447,0.00018892008,0.0006359254,0.00082674355,0.0014872836,0.0006290001,0.0008317366,0.0049898233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013187524,0.0000071732425,0.00002603516,0.000028458768,0.0000023224056,0.000016863545,0.00011938633,0.00029079535,0.000970562,0.94336075,0.031280976,0.023883503],"study_design_scores_gemma":[0.0000057587217,0.000011509621,0.00022179061,0.00002280492,0.000003889514,0.00009817928,0.000066951616,0.0009403523,0.0009575207,0.67923135,0.31843373,0.0000060788275],"about_ca_topic_score_codex":0.00047231792,"about_ca_topic_score_gemma":0.00063025276,"teacher_disagreement_score":0.023884555,"about_ca_system_score_codex":0.0007502314,"about_ca_system_score_gemma":0.0003716739,"threshold_uncertainty_score":0.079901814},"labels":[],"label_agreement":null},{"id":"W4392666729","doi":"10.1007/978-3-031-42891-3_1","title":"Fully Invariant Relations","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on mathematics and statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Unary operation; Semigroup; Mathematics; Congruence relation; Invariant (physics); Pure mathematics; Special classes of semigroups; Simple (philosophy); Lattice (music); Discrete mathematics; Physics; Mathematical physics; Philosophy","score_opus":0.014132907423223737,"score_gpt":0.2223231287260272,"score_spread":0.20819022130280346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392666729","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009279522,0.0021792962,0.048535194,0.001028922,0.00060587603,0.000027501446,0.00047519305,0.0004088326,0.9374597],"genre_scores_gemma":[0.4127156,0.0038952837,0.026431346,0.0011952503,0.001367499,0.00012914823,0.0014991941,0.00063208333,0.5521346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947816,0.00008211507,0.000024277311,0.000148454,0.00019310287,0.00007388429],"domain_scores_gemma":[0.99967694,0.00009052254,0.000020714522,0.00011422112,0.00007173568,0.000025856634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003413235,0.0005341982,0.00043252943,0.001079028,0.0012352684,0.0023543513,0.00047466537,0.0005645388,0.030009644],"category_scores_gemma":[0.0009675872,0.0003436784,0.00040556898,0.0011104505,0.0021577268,0.0043353615,0.0012962044,0.0018316532,0.0080185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040492123,0.0000034601899,0.000012323252,0.000011217785,0.0000012714257,0.000007686575,0.00007553674,0.00006732507,0.00030166647,0.98608184,0.0047354293,0.008698291],"study_design_scores_gemma":[0.0000020442653,0.000004939935,0.00006753157,0.000008723892,0.0000028955121,0.00004470508,0.00003665379,0.0003158024,0.0005113038,0.92226595,0.076735415,0.0000040103328],"about_ca_topic_score_codex":0.00070601155,"about_ca_topic_score_gemma":0.0006473671,"teacher_disagreement_score":0.030009644,"about_ca_system_score_codex":0.0009818953,"about_ca_system_score_gemma":0.00046476495,"threshold_uncertainty_score":0.10039228},"labels":[],"label_agreement":null},{"id":"W4392733094","doi":"10.1017/9781108874144.021","title":"Residue forms and classical Morse theory","year":2024,"lang":"en","type":"other","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Residue (chemistry); Morse code; Mathematics; Computer science; Chemistry; Biochemistry; Telecommunications","score_opus":0.007096372368530567,"score_gpt":0.23025699159241575,"score_spread":0.2231606192238852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392733094","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025482919,0.0051169754,0.07825081,0.0026166462,0.0009567018,0.000030582854,0.00095178,0.0005935701,0.886],"genre_scores_gemma":[0.48338944,0.009930529,0.04804393,0.0009573387,0.0016683749,0.00008832981,0.002009145,0.0007102081,0.45320266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997806,0.000044976387,0.0000106102525,0.000041840165,0.00009357593,0.000028376453],"domain_scores_gemma":[0.99977547,0.000083982704,0.000015254401,0.000036061345,0.00006707362,0.000022152264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002793635,0.0004067185,0.00039154966,0.0011448435,0.00064341945,0.0017208388,0.00053515733,0.00036024986,0.060735878],"category_scores_gemma":[0.0014247498,0.00013268314,0.00026481564,0.0011128268,0.0009698176,0.003063041,0.0010171207,0.0008733993,0.010094879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003900448,0.000004052043,0.000049154893,0.000036150064,0.0000013273075,0.00002967756,0.00007245512,0.00027921353,0.00018927862,0.97874486,0.009280453,0.011309427],"study_design_scores_gemma":[0.0000023206264,0.0000055777396,0.00017972749,0.000028157845,0.000001588569,0.0000927237,0.00006986621,0.0010740107,0.00038855433,0.8989569,0.0991941,0.00000651053],"about_ca_topic_score_codex":0.00076764193,"about_ca_topic_score_gemma":0.00090425846,"teacher_disagreement_score":0.060735878,"about_ca_system_score_codex":0.000835419,"about_ca_system_score_gemma":0.00037731152,"threshold_uncertainty_score":0.20318174},"labels":[],"label_agreement":null},{"id":"W4392869357","doi":"10.1016/j.tcs.2024.114506","title":"Converting finite width AFAs to nondeterministic and universal finite automata","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic finite automaton; Mathematics; Deterministic finite automaton; Multiplicative function; Finite-state machine; Discrete mathematics; Combinatorics; Deterministic automaton; ω-automaton; String (physics); Automaton; Quantum finite automata; Algorithm; Automata theory; Computer science; Mathematical analysis; Theoretical computer science","score_opus":0.008332763396113298,"score_gpt":0.24151685799936656,"score_spread":0.23318409460325326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392869357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07873728,0.00032449237,0.89099026,0.0004926548,0.00044416427,0.0001076791,0.00044173698,0.004930906,0.023530869],"genre_scores_gemma":[0.69721735,0.00036392096,0.2879393,0.0003249749,0.00018993403,0.00014841008,0.0007287747,0.0017036531,0.011383665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986816,0.00025884117,0.00013958375,0.0003301854,0.0003770077,0.00021273266],"domain_scores_gemma":[0.9951066,0.0025527522,0.00019820046,0.0013184696,0.0006886517,0.00013531857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011087159,0.00047070862,0.00061492395,0.0009396895,0.0009126568,0.0034517713,0.0013663261,0.0010270639,0.0051627913],"category_scores_gemma":[0.008846097,0.0007066568,0.0013955649,0.00093418924,0.0018739775,0.0060271802,0.0028930686,0.0027821618,0.0015581948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017672191,0.000082108505,0.00070918543,0.00014480889,0.00002491172,0.0002341109,0.0008834898,0.013225986,0.009473276,0.8906321,0.0026642154,0.08174912],"study_design_scores_gemma":[0.000023059147,0.000026125601,0.00016258872,0.000040689105,0.00003543897,0.0001179002,0.00019694786,0.04898898,0.011527684,0.9266732,0.01218141,0.00002606612],"about_ca_topic_score_codex":0.0014527017,"about_ca_topic_score_gemma":0.001683284,"teacher_disagreement_score":0.0051627913,"about_ca_system_score_codex":0.0010735824,"about_ca_system_score_gemma":0.0008728298,"threshold_uncertainty_score":0.01727128},"labels":[],"label_agreement":null},{"id":"W4392927464","doi":"10.4171/jca/86","title":"MV polytopes and reduced double Bruhat cells","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polytope; Combinatorics; Mathematics","score_opus":0.008454146210108456,"score_gpt":0.23359797268799598,"score_spread":0.22514382647788753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392927464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81579375,0.00016868352,0.13647245,0.00015654597,0.00008509682,0.0000819324,0.00024109881,0.00021610246,0.046784338],"genre_scores_gemma":[0.96841127,0.000114529925,0.016344728,0.00004013839,0.00006014962,0.00009210808,0.00025432752,0.00007211817,0.014610716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996731,0.00004388666,0.000017372075,0.000079624595,0.00007852204,0.00010740749],"domain_scores_gemma":[0.9995975,0.00008623027,0.000076567856,0.000086988264,0.00005885314,0.00009377845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014259329,0.00025761386,0.0002620154,0.00068550964,0.0010161705,0.0015731796,0.00044240718,0.00032631351,0.0053901044],"category_scores_gemma":[0.0005749533,0.00023024797,0.00041288213,0.00039034977,0.0019987205,0.0016329141,0.001272767,0.00091531023,0.0007596351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006964469,0.000025335452,0.0005679485,0.000030361049,0.000006092744,0.00023561664,0.000583878,0.0020492312,0.012450612,0.9769184,0.0004283567,0.006634478],"study_design_scores_gemma":[0.00006409669,0.00018001391,0.00273924,0.0000377872,0.000022218968,0.0008989826,0.0013141437,0.022727102,0.02848911,0.91413784,0.029326113,0.00006324599],"about_ca_topic_score_codex":0.00062198204,"about_ca_topic_score_gemma":0.00070964743,"teacher_disagreement_score":0.0053901044,"about_ca_system_score_codex":0.00045684667,"about_ca_system_score_gemma":0.00020492832,"threshold_uncertainty_score":0.018031716},"labels":[],"label_agreement":null},{"id":"W4394793213","doi":"10.61091/ars158-11","title":"Prefixes of Stanley’s Catalan Paths with Odd Returns to the \\(x\\)-axis–Standard Version and Skew Catalan-Stanley Paths","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Catalan number; Catalan; Combinatorics; Skew; Tuple; Alphabet; Order (exchange); Set (abstract data type); Discrete mathematics; Computer science; Humanities; Telecommunications","score_opus":0.006239565600843324,"score_gpt":0.2159879738433406,"score_spread":0.20974840824249727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793213","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59502757,0.0005877871,0.27474,0.0009014514,0.00043030988,0.0001346601,0.0005917495,0.0006600819,0.12692639],"genre_scores_gemma":[0.9009784,0.00029530333,0.06118513,0.00028182342,0.00017334626,0.00021272374,0.00048661337,0.00037298488,0.036013603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991897,0.00018967796,0.000060137216,0.00016817522,0.00020212344,0.0001901766],"domain_scores_gemma":[0.9974261,0.0011578074,0.000264794,0.00045145542,0.0004372375,0.0002626687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097496674,0.00044352934,0.0004939836,0.0014787173,0.0014437112,0.0023378935,0.00065420516,0.0009277689,0.009389831],"category_scores_gemma":[0.0047979597,0.000398301,0.0008695522,0.001282121,0.002074017,0.0027528035,0.0010350016,0.0012989666,0.0018379786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045785764,0.0000145634085,0.00040186403,0.000021724325,0.0000032007097,0.00018497507,0.00026399852,0.0013241894,0.0013657886,0.98694044,0.0009334477,0.0084999455],"study_design_scores_gemma":[0.000015321708,0.000029178856,0.00059567514,0.000024806579,0.0000059035365,0.0003606255,0.000106759406,0.017553926,0.0029177954,0.9699425,0.008417122,0.000030441812],"about_ca_topic_score_codex":0.0011434648,"about_ca_topic_score_gemma":0.0014354324,"teacher_disagreement_score":0.009389831,"about_ca_system_score_codex":0.0012614315,"about_ca_system_score_gemma":0.0008752167,"threshold_uncertainty_score":0.031412065},"labels":[],"label_agreement":null},{"id":"W4394868300","doi":"10.4230/lipics.icalp.2024.43","title":"Robot Positioning Using Torus Packing for Multisets","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nokia (Canada); McGill University; Bell (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Position (finance); Constant (computer programming); Computer science; De Bruijn sequence; Window (computing); Code (set theory); Intersection (aeronautics); Autonomous robot; Torus; Theoretical computer science; Algorithm; Artificial intelligence; Mobile robot; Mathematics; Discrete mathematics; Geometry; Engineering; Programming language","score_opus":0.10768418472347757,"score_gpt":0.21603687344914627,"score_spread":0.1083526887256687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394868300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07581787,0.00036937534,0.9122599,0.0002949864,0.00017719949,0.00007255696,0.00013988414,0.0007483458,0.0101199495],"genre_scores_gemma":[0.70416427,0.00039743958,0.28421578,0.00010408112,0.00013540938,0.0002168577,0.00032935734,0.00021418328,0.010222758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987393,0.0003559072,0.00011307487,0.00033708249,0.00030347685,0.0001511276],"domain_scores_gemma":[0.99793315,0.0010087921,0.00029339606,0.0004470747,0.00013118518,0.00018641476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009884353,0.00073826464,0.00095735415,0.00073307037,0.0011422347,0.0017336162,0.0012717333,0.0012681675,0.0051916577],"category_scores_gemma":[0.0030118078,0.0006846814,0.0011212074,0.00095319067,0.0020979582,0.0023133755,0.0027911668,0.0011326871,0.0017468418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036319916,0.00008858002,0.0011037831,0.00036770478,0.00004686546,0.00095653505,0.000837265,0.3198853,0.015109261,0.610245,0.0026010869,0.048395324],"study_design_scores_gemma":[0.000044347653,0.00023092871,0.00035194107,0.000052150008,0.00002250488,0.00035035994,0.00018021729,0.5189348,0.0077790525,0.46417013,0.007829704,0.000053886924],"about_ca_topic_score_codex":0.0006347951,"about_ca_topic_score_gemma":0.00048581293,"teacher_disagreement_score":0.0051916577,"about_ca_system_score_codex":0.0011029106,"about_ca_system_score_gemma":0.0004742142,"threshold_uncertainty_score":0.01736784},"labels":[],"label_agreement":null},{"id":"W4394992383","doi":"10.1051/ita/2024011","title":"A Small Morphism for which the Fixed Point has an Abelian Critical Exponent Less than 2","year":2024,"lang":"en","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Morphism; Abelian group; Exponent; Mathematics; Fixed point; Critical exponent; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.03330787741572297,"score_gpt":0.2718876770391584,"score_spread":0.23857979962343542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394992383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84324384,0.0013720142,0.09190749,0.0012240577,0.0005244385,0.0001504046,0.00014399718,0.00090784294,0.06052598],"genre_scores_gemma":[0.94175583,0.0004831932,0.039102852,0.00017852576,0.00012200386,0.000119689306,0.000118301425,0.00014052767,0.017979113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998293,0.000026302612,0.000012851001,0.000043371467,0.000040926836,0.000047220612],"domain_scores_gemma":[0.9992379,0.00036651123,0.00009590687,0.00010532676,0.00008249771,0.00011186535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002980136,0.000418334,0.00034298512,0.0008312585,0.0014386469,0.00068283733,0.00018635881,0.0010292522,0.00495664],"category_scores_gemma":[0.0012543878,0.00020315677,0.0005414506,0.00040094022,0.001314043,0.0012128478,0.0011259232,0.00093578786,0.001035322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005986735,0.00022341541,0.004736026,0.0005167428,0.00006323828,0.0048117638,0.0018933078,0.0032589582,0.26858065,0.6315271,0.0036387388,0.080151275],"study_design_scores_gemma":[0.00015654527,0.0012633732,0.007679045,0.00025722253,0.00020002158,0.0062394007,0.0008632082,0.016731592,0.19975202,0.66793233,0.09867831,0.0002469282],"about_ca_topic_score_codex":0.00029034237,"about_ca_topic_score_gemma":0.0003195559,"teacher_disagreement_score":0.00495664,"about_ca_system_score_codex":0.00059359724,"about_ca_system_score_gemma":0.00048170847,"threshold_uncertainty_score":0.016581595},"labels":[],"label_agreement":null},{"id":"W4396697277","doi":"10.2139/ssrn.4819005","title":"Cornering Robots to Synchronize a Dfa","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Robot; Synchronization (alternating current); Computer science; Artificial intelligence; Computer network","score_opus":0.008451019599908616,"score_gpt":0.24259134608042224,"score_spread":0.2341403264805136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396697277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2014564,0.00018543223,0.7721811,0.00047843106,0.00033520488,0.00015559662,0.00017732177,0.0027233115,0.022307223],"genre_scores_gemma":[0.8958337,0.00011143216,0.090388924,0.00015738208,0.00005808096,0.00024694804,0.00019598102,0.00034619126,0.012661423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991272,0.0001787054,0.00008031657,0.00027343165,0.00017562739,0.00016466771],"domain_scores_gemma":[0.9971257,0.0015013776,0.00019523178,0.0006818777,0.0002677983,0.00022807717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096690806,0.00058380875,0.00088773307,0.000749234,0.0011000937,0.0013548081,0.0011924527,0.001505909,0.011081678],"category_scores_gemma":[0.0048902505,0.0006399375,0.001176338,0.0006113706,0.0021501696,0.0028483206,0.0035691727,0.00182854,0.001310828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006333712,0.00017760802,0.0024535363,0.00032036754,0.00014086739,0.0010683794,0.0023867018,0.1297572,0.037981052,0.73783034,0.0040360303,0.08321452],"study_design_scores_gemma":[0.00031534355,0.0003239378,0.0006212513,0.000062498875,0.00011286195,0.0002855068,0.00045642033,0.46813744,0.012028128,0.50453484,0.013045177,0.000076489756],"about_ca_topic_score_codex":0.0010516184,"about_ca_topic_score_gemma":0.0013775312,"teacher_disagreement_score":0.011081678,"about_ca_system_score_codex":0.00058228977,"about_ca_system_score_gemma":0.0006457172,"threshold_uncertainty_score":0.037071884},"labels":[],"label_agreement":null},{"id":"W4398195493","doi":"10.1016/j.jcta.2024.105910","title":"Power-free complementary binary morphisms","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Binary number; Power (physics); Mathematics; Computer science; Arithmetic; Pure mathematics; Physics; Thermodynamics","score_opus":0.008167672429959087,"score_gpt":0.2369642211132666,"score_spread":0.2287965486833075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398195493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4572746,0.00095119723,0.28643486,0.0019004568,0.0010513572,0.00011230498,0.00046666377,0.0008365544,0.25097206],"genre_scores_gemma":[0.9046546,0.0005260759,0.03356949,0.00040762615,0.00044427652,0.000108129214,0.0002861026,0.0002656218,0.059738006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878186,0.0002246734,0.00007748474,0.0002843867,0.0004029261,0.00022867638],"domain_scores_gemma":[0.99476826,0.0030357323,0.00022245028,0.000605383,0.0007287727,0.0006392948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012659078,0.0005943066,0.00091522513,0.00250845,0.0026428653,0.003932935,0.0008848592,0.001203498,0.011614484],"category_scores_gemma":[0.0045965053,0.0007614278,0.0009852664,0.0013119021,0.0037492835,0.0062202755,0.0035447886,0.002423978,0.0018128201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028108136,0.000025565183,0.00014330221,0.0000183413,0.0000041026296,0.0001210535,0.00028674997,0.0001704096,0.0014180677,0.99255556,0.00073713827,0.00449156],"study_design_scores_gemma":[0.000023289736,0.000015745494,0.00019499923,0.000014483175,0.000015111078,0.00033903224,0.000119772216,0.0021991835,0.0024556932,0.9874527,0.0071505285,0.00001952835],"about_ca_topic_score_codex":0.0004123814,"about_ca_topic_score_gemma":0.00050204736,"teacher_disagreement_score":0.011614484,"about_ca_system_score_codex":0.0010375007,"about_ca_system_score_gemma":0.0006942294,"threshold_uncertainty_score":0.0388543},"labels":[],"label_agreement":null},{"id":"W4399602825","doi":"10.37236/12115","title":"Asymptotic Bounds for the Number of Closed and Privileged Words","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Combinatorics; Word (group theory); Suffix; Prefix; Mathematics; Upper and lower bounds; Alphabet; Linguistics; Geometry; Philosophy; Mathematical analysis","score_opus":0.005746212735170773,"score_gpt":0.2510511144270334,"score_spread":0.2453049016918626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399602825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2146348,0.01619661,0.6282604,0.012246825,0.0018046993,0.0002626293,0.0030125694,0.0050239693,0.11855744],"genre_scores_gemma":[0.8189657,0.0069539077,0.13561389,0.0030456218,0.004536635,0.0011268237,0.0030840847,0.0024764617,0.024196891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9870151,0.0023226484,0.00083301275,0.003640779,0.0037433614,0.0024450356],"domain_scores_gemma":[0.8789766,0.0922285,0.004315617,0.013015008,0.0062989215,0.0051653986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007264576,0.0023402392,0.0029404215,0.004677749,0.003914394,0.0063393903,0.006618493,0.0035867011,0.013966726],"category_scores_gemma":[0.09312141,0.001550283,0.0022905588,0.0034911016,0.007192266,0.020104151,0.008013384,0.00948838,0.004251227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017567959,0.00083393493,0.015865207,0.0016020433,0.00026627575,0.0009081167,0.0019729813,0.048469026,0.027204532,0.73226094,0.030893544,0.1379666],"study_design_scores_gemma":[0.00008589874,0.00021796695,0.0038774638,0.00037864552,0.0002061793,0.0012922462,0.00023593596,0.20697956,0.010430788,0.7619141,0.014146272,0.00023494531],"about_ca_topic_score_codex":0.0018371468,"about_ca_topic_score_gemma":0.0024739148,"teacher_disagreement_score":0.013966726,"about_ca_system_score_codex":0.0057257656,"about_ca_system_score_gemma":0.0032017329,"threshold_uncertainty_score":0.046723425},"labels":[],"label_agreement":null},{"id":"W4399803900","doi":"10.4204/eptcs.403.7","title":"Power Quotients of Plactic-like Monoids","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Monoid; Quotient; Congruence relation; Syntactic monoid; Mathematics; Free monoid; Pure mathematics; Set (abstract data type); Generator (circuit theory); Power (physics); Combinatorics; Algebra over a field; Computer science; Physics","score_opus":0.0032465031534163933,"score_gpt":0.22655064517696422,"score_spread":0.2233041420235478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399803900","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70060605,0.001618236,0.20025466,0.0005069392,0.00021791167,0.00019100118,0.00041993763,0.0006685611,0.0955167],"genre_scores_gemma":[0.9479982,0.0003605726,0.03764685,0.00010530353,0.00011869134,0.00010939939,0.00035988263,0.0001318122,0.013169296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988187,0.00017508626,0.00013361512,0.00027307076,0.0004419734,0.00015759934],"domain_scores_gemma":[0.9984694,0.0005007994,0.00015661158,0.00019833805,0.00044076334,0.00023403385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094847573,0.00037872704,0.0005300981,0.0010929758,0.0009902153,0.001914858,0.0004324031,0.00027919683,0.00644641],"category_scores_gemma":[0.0029544863,0.00030479077,0.0006441876,0.0004611955,0.0023999105,0.0038998576,0.001695293,0.0008700254,0.00091626705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020189722,0.00003478218,0.0013599909,0.00010625385,0.000015087198,0.0005212035,0.0012673227,0.00082807546,0.012657875,0.96312493,0.0007256792,0.019156914],"study_design_scores_gemma":[0.00010704572,0.00023930102,0.001996392,0.000047688984,0.000050425937,0.0012041472,0.00089727924,0.010146771,0.02337107,0.9189542,0.042931244,0.000054509448],"about_ca_topic_score_codex":0.00070231827,"about_ca_topic_score_gemma":0.0006261166,"teacher_disagreement_score":0.00644641,"about_ca_system_score_codex":0.00085722614,"about_ca_system_score_gemma":0.00039335148,"threshold_uncertainty_score":0.021565437},"labels":[],"label_agreement":null},{"id":"W4399804111","doi":"10.4204/eptcs.403.29","title":"On the Orthogonality of Generalized Pattern Sequences","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Integer (computer science); Combinatorics; Mathematics; Orthogonality; Word (group theory); Binary number; Finite set; Set (abstract data type); Discrete mathematics; Arithmetic","score_opus":0.007625491408060929,"score_gpt":0.24426465859038907,"score_spread":0.23663916718232814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399804111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7462431,0.00086183404,0.22630669,0.00033622351,0.00017800978,0.000075674725,0.00033676103,0.00017777397,0.025483811],"genre_scores_gemma":[0.9455138,0.0007086461,0.045134492,0.00018557862,0.00030805034,0.00015078575,0.0004311375,0.00013291309,0.007434456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982317,0.00038949808,0.00015544475,0.00033336668,0.00061398617,0.0002760446],"domain_scores_gemma":[0.9960139,0.0018575016,0.0006660246,0.00042319056,0.00062548585,0.00041399177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012920346,0.00052017655,0.0006937509,0.002677403,0.0007227444,0.0020044337,0.0007193767,0.00044456765,0.0036814478],"category_scores_gemma":[0.007312487,0.00030100066,0.0005488914,0.0020091448,0.0021567086,0.004171884,0.002050523,0.0008370023,0.00036488092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012429176,0.000053205767,0.0017826204,0.00008158252,0.000019889241,0.00021406946,0.00028802155,0.0038273192,0.0065009557,0.9627617,0.00056470453,0.02378169],"study_design_scores_gemma":[0.00001972348,0.0000838062,0.0013167245,0.000038920163,0.000021472593,0.00040753905,0.00017206857,0.046469342,0.0023461166,0.94513136,0.003957974,0.00003495825],"about_ca_topic_score_codex":0.0005600917,"about_ca_topic_score_gemma":0.0005271057,"teacher_disagreement_score":0.0036814478,"about_ca_system_score_codex":0.0005508059,"about_ca_system_score_gemma":0.00051236484,"threshold_uncertainty_score":0.0123156905},"labels":[],"label_agreement":null},{"id":"W4399830286","doi":"10.4204/eptcs.403.26","title":"A Symmetry Property of Christoffel Words","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Christoffel symbols; Symmetry (geometry); Cardinality (data modeling); Property (philosophy); Mathematics; Bivariate analysis; Pure mathematics; Algebra over a field; Computer science; Geometry; Philosophy; Statistics; Epistemology","score_opus":0.004598778382710914,"score_gpt":0.22805784423766448,"score_spread":0.22345906585495356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399830286","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5755056,0.00053386996,0.3565961,0.00062786037,0.00034184507,0.00014199033,0.000717285,0.00040675869,0.06512868],"genre_scores_gemma":[0.9637823,0.00028614505,0.026331445,0.00016690342,0.00023726554,0.00009495117,0.00034416627,0.00011911499,0.008637825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866354,0.0001937923,0.00011166594,0.00033991356,0.0004046018,0.00028642613],"domain_scores_gemma":[0.9972173,0.0008685776,0.00041207904,0.00053992396,0.00063916453,0.00032299824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095569505,0.0003084739,0.000538199,0.0008832297,0.001369096,0.0019034052,0.0006579179,0.00052672,0.004847907],"category_scores_gemma":[0.005243573,0.000247091,0.0006576587,0.000978991,0.0023751345,0.0033872796,0.0011779385,0.0011434349,0.0009985898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057612284,0.00001980462,0.0006997774,0.00002506532,0.0000049599075,0.00013593039,0.0003010325,0.00085449143,0.005082056,0.98387825,0.0005590946,0.008381954],"study_design_scores_gemma":[0.000022369653,0.00009805267,0.000759907,0.000019588906,0.000011973978,0.0005634411,0.00025766878,0.009529661,0.007264338,0.97326475,0.008164478,0.000043817625],"about_ca_topic_score_codex":0.001022789,"about_ca_topic_score_gemma":0.0005411808,"teacher_disagreement_score":0.004847907,"about_ca_system_score_codex":0.0009234683,"about_ca_system_score_gemma":0.000928257,"threshold_uncertainty_score":0.016217887},"labels":[],"label_agreement":null},{"id":"W4399830315","doi":"10.4204/eptcs.403.28","title":"Perfectly Clustering Words and Iterated Palindromes over a Ternary Alphabet","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Palindrome; Alphabet; Ternary operation; Iterated function; Combinatorics; Cluster analysis; Mathematics; Word (group theory); Computer science; Biology; Genetics; Linguistics; Statistics; Philosophy","score_opus":0.0036366341824186185,"score_gpt":0.2320275942637919,"score_spread":0.2283909600813733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399830315","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8130543,0.0013346899,0.15322024,0.00023918788,0.00011070123,0.00005164913,0.00031390844,0.00035813535,0.031317215],"genre_scores_gemma":[0.95927036,0.00025713467,0.03313474,0.00010771159,0.00007975886,0.000052476014,0.00027737344,0.00004523672,0.006775247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993724,0.00011738202,0.00006287353,0.00020069489,0.00013824705,0.00010839365],"domain_scores_gemma":[0.99777395,0.0007741512,0.00063112745,0.00030877342,0.00034827384,0.0001637319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041092825,0.00033390912,0.0003202241,0.00126723,0.0011231535,0.0012430275,0.00057947,0.00080349116,0.0028928805],"category_scores_gemma":[0.0021256143,0.00028233862,0.0004865069,0.0011219521,0.0019269318,0.0021346463,0.0008102703,0.00063874654,0.0005118716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028815566,0.000047031688,0.0047009895,0.00021610985,0.000034248635,0.0018065792,0.0025672396,0.005746808,0.04663083,0.9083026,0.0008476364,0.028811816],"study_design_scores_gemma":[0.00003412739,0.00027581924,0.0052372133,0.00008823013,0.00005360203,0.0032286805,0.0012602751,0.030331047,0.02221821,0.9158382,0.02131794,0.00011666254],"about_ca_topic_score_codex":0.00081379456,"about_ca_topic_score_gemma":0.00078558805,"teacher_disagreement_score":0.0028928805,"about_ca_system_score_codex":0.0006344435,"about_ca_system_score_gemma":0.00039541215,"threshold_uncertainty_score":0.009677649},"labels":[],"label_agreement":null},{"id":"W4400596818","doi":"10.55016/ojs/cdm.v16i1.70710","title":"Symmetric association schemes arising from abstract regular polytopes","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Coxeter group; Mathematics; Combinatorics; Polytope; Coset; Vertex (graph theory); Symmetric group; Type (biology); Finite group; Group (periodic table); Graph; Physics","score_opus":0.009539156373322692,"score_gpt":0.2651140095327008,"score_spread":0.2555748531593781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596818","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81163144,0.0002940605,0.123252764,0.0005282683,0.00019449831,0.00009992074,0.00027537296,0.00033495427,0.06338868],"genre_scores_gemma":[0.97788197,0.00013780037,0.010443575,0.00006427598,0.00008360262,0.000071068294,0.00017323742,0.000047748046,0.011096689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990375,0.00015263456,0.00007191624,0.0002390216,0.00027357455,0.00022541454],"domain_scores_gemma":[0.99921715,0.00022943283,0.00013969671,0.00016627883,0.00008005492,0.00016735443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004615566,0.00036917886,0.000474493,0.0009724489,0.0015924817,0.0032917466,0.00052784785,0.0006691017,0.0059292195],"category_scores_gemma":[0.0013136356,0.0003824042,0.0006763909,0.00096933026,0.0026887513,0.003404243,0.0025379537,0.001161863,0.0007970557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023363264,0.000013638984,0.00021917962,0.00001290493,0.0000030897872,0.00014314192,0.00025328354,0.00076958985,0.0012382627,0.9945648,0.00020725087,0.0025516031],"study_design_scores_gemma":[0.000039653263,0.000041684867,0.00039415117,0.00001667405,0.000012422292,0.00026668687,0.00044392108,0.008756205,0.0027725706,0.9782079,0.0090274,0.000020776954],"about_ca_topic_score_codex":0.00055547967,"about_ca_topic_score_gemma":0.00052061945,"teacher_disagreement_score":0.0059292195,"about_ca_system_score_codex":0.0011151014,"about_ca_system_score_gemma":0.000512243,"threshold_uncertainty_score":0.019835234},"labels":[],"label_agreement":null},{"id":"W4400596853","doi":"10.55016/ojs/cdm.v16i1.69831","title":"Lengths of extremal square-free ternary words","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Square-free integer; Ternary operation; Word (group theory); Mathematics; Square (algebra); Alphabet; Combinatorics; Sigma; Discrete mathematics; Geometry; Computer science; Linguistics; Physics","score_opus":0.010786793229228257,"score_gpt":0.27178721306637393,"score_spread":0.26100041983714567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596853","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91987705,0.0015785384,0.05668714,0.00044626743,0.00013326432,0.000029949822,0.0006467481,0.00027816923,0.020322917],"genre_scores_gemma":[0.9788366,0.00033089521,0.017717518,0.0000705797,0.00009717879,0.000063274776,0.00035431975,0.00009850676,0.00243112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991346,0.0001477401,0.000114884126,0.00023477634,0.00022510045,0.00014283523],"domain_scores_gemma":[0.9955668,0.0022545923,0.0008592742,0.00032508632,0.00058219355,0.00041201696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004835812,0.00034134448,0.0003834727,0.0013417719,0.0009666589,0.0015888135,0.0005938816,0.00067833526,0.004213683],"category_scores_gemma":[0.006314625,0.00042666803,0.0003218398,0.00085649255,0.0013772722,0.0021103204,0.0012412487,0.00070191856,0.00056039524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080843834,0.00008213421,0.007411156,0.0006764122,0.00006864665,0.0010287055,0.00133497,0.021002738,0.059291113,0.8553895,0.003179107,0.04972717],"study_design_scores_gemma":[0.000054463148,0.00021948901,0.0054246658,0.00012897066,0.00006679535,0.0017855064,0.000751327,0.05304984,0.034948826,0.89059424,0.012817598,0.00015823107],"about_ca_topic_score_codex":0.00014246228,"about_ca_topic_score_gemma":0.00019133314,"teacher_disagreement_score":0.004213683,"about_ca_system_score_codex":0.0006147578,"about_ca_system_score_gemma":0.00031493718,"threshold_uncertainty_score":0.0140962005},"labels":[],"label_agreement":null},{"id":"W4400914530","doi":"10.3233/fi-242180","title":"Descriptional Complexity of Finite Automata – Selected Highlights","year":2024,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University; Queen's University","funders":"","keywords":"DFA minimization; Automaton; Deterministic finite automaton; Computer science; Theoretical computer science; Finite-state machine; Nondeterministic finite automaton; Mathematics; Automata theory; Discrete mathematics; Algorithm","score_opus":0.032925345192854935,"score_gpt":0.25028295416166,"score_spread":0.21735760896880507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400914530","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01909687,0.62894857,0.11880321,0.034857884,0.0062960354,0.000179328,0.0013955914,0.00041512182,0.1900074],"genre_scores_gemma":[0.24346367,0.62291473,0.05349491,0.003933532,0.038333055,0.00043957343,0.0030534875,0.00043865925,0.033928372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978829,0.00050663087,0.00014332435,0.00056209514,0.0007599115,0.00014509668],"domain_scores_gemma":[0.99181366,0.006160783,0.00030345062,0.00039395856,0.0010709707,0.00025714646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025854057,0.0011098556,0.001013388,0.0029596696,0.0008924986,0.0061177867,0.0013335801,0.0010925704,0.010270817],"category_scores_gemma":[0.007795787,0.0007935794,0.0009833848,0.006364044,0.0026290757,0.009094607,0.0021488909,0.0038441464,0.0026540528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069794194,0.00011889683,0.0006744009,0.0018501197,0.000057979407,0.00022000258,0.00038833078,0.010694977,0.0011961915,0.7647432,0.053959496,0.16602665],"study_design_scores_gemma":[0.000012911981,0.00005699745,0.0009162569,0.0007822257,0.00001799468,0.0003660199,0.00018736017,0.009298117,0.00079098984,0.79564095,0.19187444,0.000055752076],"about_ca_topic_score_codex":0.003232291,"about_ca_topic_score_gemma":0.001707752,"teacher_disagreement_score":0.010270817,"about_ca_system_score_codex":0.004771489,"about_ca_system_score_gemma":0.0014779451,"threshold_uncertainty_score":0.03461969},"labels":[],"label_agreement":null},{"id":"W4401033940","doi":"10.1007/978-3-031-66159-4_12","title":"Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Decidability; Computer science; Programming language; Algorithm; Theoretical computer science","score_opus":0.013464643293944919,"score_gpt":0.25891717032706923,"score_spread":0.2454525270331243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401033940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015503368,0.00102563,0.94489676,0.00315598,0.00036466916,0.00015448678,0.00039556006,0.002368289,0.032135233],"genre_scores_gemma":[0.4196459,0.0027950383,0.5392297,0.0027303158,0.0015064677,0.0012216477,0.0025433877,0.002417275,0.027910251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99189913,0.0026042485,0.0005606541,0.0017231829,0.0022743118,0.0009384239],"domain_scores_gemma":[0.9483032,0.0442338,0.0007703457,0.004888746,0.0012107283,0.00059319666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0082256505,0.0023165538,0.002076224,0.0023185993,0.003480605,0.0070719705,0.009576733,0.0038916108,0.014053251],"category_scores_gemma":[0.031299576,0.0032820124,0.0073567834,0.0031669468,0.008821367,0.02564188,0.012703483,0.025963929,0.0026406166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015860738,0.00016890238,0.00033052612,0.00041769427,0.000072912546,0.00025359503,0.00084166403,0.006161879,0.0056453273,0.94757235,0.0065102773,0.031866305],"study_design_scores_gemma":[0.000040313585,0.000020380541,0.000084232284,0.0000361571,0.000044198267,0.00010294473,0.00006913715,0.017068285,0.0035776335,0.97446805,0.0044630095,0.000025659549],"about_ca_topic_score_codex":0.0017901848,"about_ca_topic_score_gemma":0.0019213677,"teacher_disagreement_score":0.014053251,"about_ca_system_score_codex":0.0030874251,"about_ca_system_score_gemma":0.002089627,"threshold_uncertainty_score":0.047012806},"labels":[],"label_agreement":null},{"id":"W4401033946","doi":"10.1007/978-3-031-66159-4_6","title":"Universal Rewriting Rules for the Parikh Matrix Injectivity Problem","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Rewriting; Computer science; Matrix (chemical analysis); Programming language; Theoretical computer science; Algorithm","score_opus":0.01327607138326478,"score_gpt":0.24817184624092264,"score_spread":0.23489577485765786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401033946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055529434,0.002270227,0.78069633,0.0034951407,0.0008084931,0.00013659243,0.0004468552,0.0010327011,0.15558426],"genre_scores_gemma":[0.81047976,0.001585318,0.14906912,0.0011438956,0.0011889404,0.00036368202,0.00081037875,0.0008361404,0.034522817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833715,0.00045661145,0.00013695528,0.0003665257,0.00047834107,0.00022441684],"domain_scores_gemma":[0.99629384,0.0026120362,0.00012727972,0.0005215491,0.00032311145,0.00012201445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018752713,0.0006038023,0.00091973506,0.0010788143,0.0014344055,0.0034991247,0.0014793229,0.0014702945,0.008184434],"category_scores_gemma":[0.005530429,0.0006604154,0.0013716473,0.0013179535,0.0030844104,0.007298697,0.002464349,0.0050282106,0.0019580193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017376498,0.000020687163,0.00005473406,0.00004454093,0.000006535337,0.00005263573,0.00019680778,0.00089070486,0.0007783932,0.9867018,0.001423512,0.00981229],"study_design_scores_gemma":[0.000006288598,0.0000040008954,0.00002248263,0.000008406051,0.0000051704974,0.000030575036,0.000021032722,0.003006828,0.0006813273,0.99389136,0.0023163327,0.0000061645956],"about_ca_topic_score_codex":0.0004992349,"about_ca_topic_score_gemma":0.00048287646,"teacher_disagreement_score":0.008184434,"about_ca_system_score_codex":0.0013630528,"about_ca_system_score_gemma":0.0006940346,"threshold_uncertainty_score":0.027379632},"labels":[],"label_agreement":null},{"id":"W4401259877","doi":"10.46298/cm.12695","title":"Dyck Words, Pattern Avoidance, and Automatic Sequences","year":2024,"lang":"en","type":"article","venue":"Communications in Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Thompson Rivers University; University of Waterloo","funders":"","keywords":"Mathematics; Binary number; Bounded function; Parenthesis; Combinatorics; Word (group theory); Repetition (rhetorical device); Morse code; Upper and lower bounds; Discrete mathematics; Counterexample; Arithmetic; Computer science; Geometry; Mathematical analysis; Linguistics","score_opus":0.03426910240024929,"score_gpt":0.3052477267424467,"score_spread":0.27097862434219744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401259877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.658431,0.0018551557,0.28691116,0.00075465825,0.0001987417,0.000078110854,0.00021186129,0.00038341578,0.051175836],"genre_scores_gemma":[0.93413365,0.00059331936,0.048689898,0.00016058452,0.00013945121,0.00011158682,0.00026390553,0.00012292498,0.015784707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999166,0.00015153384,0.00006768403,0.00021525516,0.00024661573,0.00015302777],"domain_scores_gemma":[0.9968226,0.0015613809,0.0005524915,0.0003813329,0.00037436228,0.00030792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005542033,0.0006239762,0.0006078685,0.0016599353,0.0016603677,0.0018020296,0.00078456657,0.00083079876,0.0060031232],"category_scores_gemma":[0.0045653097,0.00040610167,0.0005113308,0.0013155206,0.0028644756,0.00403121,0.0018499424,0.0014223076,0.0010162396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008046081,0.000031942618,0.0013446969,0.00010966093,0.0000074083946,0.0002728821,0.0006824038,0.003317237,0.007189744,0.96899104,0.00085003464,0.0171225],"study_design_scores_gemma":[0.000017517808,0.000076735836,0.00078442646,0.00005314682,0.000014487483,0.00065728877,0.00037640656,0.023799213,0.006766814,0.95772195,0.009692616,0.00003937258],"about_ca_topic_score_codex":0.0011494746,"about_ca_topic_score_gemma":0.0013345338,"teacher_disagreement_score":0.0060031232,"about_ca_system_score_codex":0.0009967192,"about_ca_system_score_gemma":0.0004735195,"threshold_uncertainty_score":0.020082414},"labels":[],"label_agreement":null},{"id":"W4401382307","doi":"10.1007/978-3-031-52163-8_4","title":"Sums of Proper Divisors with Missing Digits","year":2024,"lang":"en","type":"book-chapter","venue":"Association for Women in Mathematics series","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Arithmetic; Computer science","score_opus":0.011121901017395387,"score_gpt":0.21117165137403882,"score_spread":0.20004975035664344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401382307","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11075986,0.0042361855,0.33762306,0.0018216724,0.0047112405,0.00020033859,0.001540686,0.0016427818,0.5374642],"genre_scores_gemma":[0.4321989,0.0024919705,0.10949681,0.00075061555,0.002252779,0.00029090373,0.0015433361,0.0011158587,0.4498588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988815,0.00015500824,0.00013254094,0.00028442513,0.00038879825,0.00015778265],"domain_scores_gemma":[0.9980254,0.0009868171,0.00012982398,0.00036173925,0.00029280546,0.0002034147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009957895,0.0009950958,0.001367449,0.002156643,0.0022890128,0.003947099,0.0011727639,0.0007929852,0.030853132],"category_scores_gemma":[0.0047653066,0.00076799426,0.0011060955,0.0020266639,0.0023778216,0.0068342206,0.00327793,0.0022104639,0.010894895],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011454536,0.00003269459,0.0002839143,0.00020928259,0.000023062581,0.00033414585,0.00037833347,0.00045789708,0.0029238262,0.93159556,0.0105076395,0.053139072],"study_design_scores_gemma":[0.000015686726,0.000042134438,0.00028525267,0.00008578007,0.000035871613,0.001098143,0.00013254872,0.0014656988,0.003655117,0.92578334,0.067370325,0.000030169154],"about_ca_topic_score_codex":0.00014113748,"about_ca_topic_score_gemma":0.00024867305,"teacher_disagreement_score":0.030853132,"about_ca_system_score_codex":0.00070221024,"about_ca_system_score_gemma":0.0006118238,"threshold_uncertainty_score":0.103213966},"labels":[],"label_agreement":null},{"id":"W4401560526","doi":"10.1016/j.tcs.2024.114780","title":"On the difference set of two transductions","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Centro de Matemática Universidade do Porto; Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Set (abstract data type); Mathematics; Combinatorics; Discrete mathematics; Computer science; Programming language","score_opus":0.015666242829783853,"score_gpt":0.26695198594823516,"score_spread":0.2512857431184513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401560526","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5853982,0.0013335325,0.31689203,0.0029305222,0.00057481916,0.00007687651,0.00072878745,0.00042376865,0.09164146],"genre_scores_gemma":[0.949737,0.0004399155,0.033856124,0.00047319438,0.00022249631,0.00011251406,0.00076380855,0.0001441442,0.014250768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969361,0.00079929805,0.00023291666,0.00072351954,0.0008732776,0.00043484653],"domain_scores_gemma":[0.99145526,0.006081252,0.00042199995,0.00060500664,0.0007647848,0.00067156163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024518485,0.00074134977,0.0014262784,0.0034899635,0.0026287157,0.0061585405,0.00207558,0.0023024168,0.0077788024],"category_scores_gemma":[0.006782816,0.0010762669,0.0017286077,0.002121487,0.006292391,0.011233348,0.005648592,0.0042900895,0.0009168849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068775065,0.000023339051,0.0001940346,0.000020702351,0.000007178161,0.00007533608,0.0003210407,0.0006940801,0.0007534588,0.99448955,0.00027591136,0.0030766225],"study_design_scores_gemma":[0.000020511865,0.000026217218,0.00015586735,0.000015098215,0.000007757943,0.00009198375,0.000109660316,0.005495803,0.0004823324,0.992342,0.0012376291,0.000015101339],"about_ca_topic_score_codex":0.0010006179,"about_ca_topic_score_gemma":0.0005571061,"teacher_disagreement_score":0.0077788024,"about_ca_system_score_codex":0.002668482,"about_ca_system_score_gemma":0.0008390572,"threshold_uncertainty_score":0.026022673},"labels":[],"label_agreement":null},{"id":"W4402145822","doi":"10.1007/978-3-031-71112-1_10","title":"From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Emulation; Lemma (botany); Computer science; Algebra over a field; Relation (database); Interpretation (philosophy); Transformation (genetics); Theoretical computer science; Programming language; Mathematics; Pure mathematics; Data mining","score_opus":0.010909739660623159,"score_gpt":0.2545275003182736,"score_spread":0.24361776065765042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402145822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019743683,0.000580081,0.8832818,0.0012339688,0.00028908352,0.000053927695,0.000115263836,0.0025139016,0.09218826],"genre_scores_gemma":[0.7268845,0.00073334354,0.25077513,0.0005079412,0.0003252138,0.00013630564,0.00035741736,0.0015783099,0.018701863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876606,0.00048648537,0.000074474534,0.00023245664,0.00030084164,0.00013966532],"domain_scores_gemma":[0.99793684,0.0011934196,0.000049168033,0.0005953888,0.00016686606,0.000058297457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012179594,0.0004158871,0.0005714774,0.00065950525,0.0010042221,0.004578154,0.0015167183,0.0009654767,0.010508836],"category_scores_gemma":[0.0038005637,0.00067129766,0.0011692747,0.0008567346,0.0037858333,0.01130566,0.0029423917,0.0028699902,0.001983084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020554178,0.000011301074,0.000041213065,0.000023775032,0.0000036473825,0.000037446454,0.00030630265,0.00059831823,0.0010710219,0.9856227,0.0011381735,0.011125524],"study_design_scores_gemma":[0.000011586813,0.000013625535,0.00004713174,0.00002190204,0.000011335991,0.000109124776,0.00010604481,0.014549222,0.004209202,0.9642434,0.01666511,0.000012286927],"about_ca_topic_score_codex":0.00088296336,"about_ca_topic_score_gemma":0.00087419647,"teacher_disagreement_score":0.010508836,"about_ca_system_score_codex":0.0012815936,"about_ca_system_score_gemma":0.0008647207,"threshold_uncertainty_score":0.035155535},"labels":[],"label_agreement":null},{"id":"W4402161717","doi":"10.1016/j.tcs.2024.114782","title":"Binary distinguishability operation","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Computer science; Mathematics; Algorithm; Programming language","score_opus":0.008019538985371126,"score_gpt":0.2567818053675138,"score_spread":0.2487622663821427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402161717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06760219,0.0017720561,0.49111116,0.0082605565,0.0050136987,0.00021602746,0.001740324,0.0022742718,0.4220097],"genre_scores_gemma":[0.7473212,0.0011463497,0.07933542,0.0022694683,0.0019215281,0.0004287701,0.0015414227,0.0009878862,0.16504796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975539,0.00042327895,0.00018800721,0.00082145556,0.000574715,0.0004386558],"domain_scores_gemma":[0.9969976,0.0013727496,0.0001402261,0.0006919587,0.0004790135,0.00031853933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015808669,0.0007222287,0.00087323744,0.0019907742,0.0035092747,0.0049419557,0.0011112387,0.0017308556,0.028900454],"category_scores_gemma":[0.0037523909,0.0005412166,0.0010253702,0.0015770406,0.0047657616,0.010906127,0.0045879083,0.006583429,0.007656996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034691206,0.000018735625,0.000061314924,0.000023725897,0.0000031142893,0.000028422704,0.00011585127,0.00004631256,0.0014701065,0.9870936,0.001978321,0.009125737],"study_design_scores_gemma":[0.000017342358,0.0000311062,0.0001926934,0.000022575427,0.000015159212,0.00031226888,0.00011457357,0.000881983,0.008278975,0.9409839,0.04911933,0.000030039986],"about_ca_topic_score_codex":0.0003005135,"about_ca_topic_score_gemma":0.00024467777,"teacher_disagreement_score":0.028900454,"about_ca_system_score_codex":0.0011318986,"about_ca_system_score_gemma":0.0011675078,"threshold_uncertainty_score":0.096681595},"labels":[],"label_agreement":null},{"id":"W4402509715","doi":"10.46298/cm.12627","title":"Proving Properties of $\\varphi$-Representations with the Walnut Theorem-Prover","year":2024,"lang":"en","type":"article","venue":"Communications in Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Simple (philosophy); Mathematical proof; Mathematics; Automaton; Automated theorem proving; Algebra over a field; Mathematical induction; Calculus (dental); Discrete mathematics; Pure mathematics; Algorithm; Theoretical computer science; Computer science; Epistemology","score_opus":0.045360690033433244,"score_gpt":0.2867431072126072,"score_spread":0.24138241717917397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402509715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019114811,0.0002737148,0.95024973,0.0019284836,0.00026874596,0.00013742757,0.0003453522,0.0029011837,0.02478054],"genre_scores_gemma":[0.59443635,0.0009061339,0.38136226,0.002516855,0.00051352876,0.0005343127,0.0015458779,0.0018754154,0.016309166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943627,0.0015091134,0.00037383792,0.0010458069,0.0020198578,0.0006886516],"domain_scores_gemma":[0.98931444,0.0075146374,0.00040534616,0.0018100105,0.00075098913,0.00020453139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046795676,0.0010900898,0.0009921518,0.0017712042,0.0018637088,0.0048021055,0.003910315,0.001737241,0.0101721445],"category_scores_gemma":[0.022829758,0.001667264,0.0028755835,0.0017813457,0.005420968,0.015589003,0.0083180955,0.0068795215,0.0025578812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033647928,0.000027825978,0.00019885144,0.000107424545,0.000027130813,0.00012449194,0.0004712866,0.0019041238,0.0016243231,0.9788023,0.0031805236,0.013498069],"study_design_scores_gemma":[0.00003181293,0.00002636019,0.00009325778,0.00004574749,0.000035065248,0.00013401678,0.00014826824,0.014177028,0.0060169823,0.9688256,0.010439791,0.000026206088],"about_ca_topic_score_codex":0.0017620618,"about_ca_topic_score_gemma":0.001761442,"teacher_disagreement_score":0.0101721445,"about_ca_system_score_codex":0.0018818304,"about_ca_system_score_gemma":0.0021440764,"threshold_uncertainty_score":0.034029245},"labels":[],"label_agreement":null},{"id":"W4403165746","doi":"10.61091/ars-160-11","title":"The Monophonic-triangular Number of a Graph","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.006335626600193409,"score_gpt":0.23845258957322277,"score_spread":0.23211696297302936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165746","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.783995,0.0005757188,0.11198204,0.0005926079,0.0002792908,0.00008537163,0.0011702445,0.00043590303,0.10088399],"genre_scores_gemma":[0.96300834,0.00018183138,0.02948181,0.000092120594,0.0001116503,0.000078943165,0.0003807645,0.00005020829,0.0066143046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942976,0.00010729259,0.00005038678,0.000202167,0.000113979295,0.00009630982],"domain_scores_gemma":[0.9982667,0.00074450683,0.00028122365,0.0002700901,0.00018542848,0.00025209013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032049074,0.00022675822,0.00026571675,0.0012315965,0.0008769258,0.0016796237,0.00049159786,0.00050903007,0.005288383],"category_scores_gemma":[0.0016355102,0.00016724097,0.0002854907,0.0007327641,0.0018672417,0.0017975142,0.0007282659,0.0004910488,0.0005594896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022221351,0.000034380904,0.0021676712,0.00013783886,0.000014027299,0.00029924433,0.0007608284,0.0035940292,0.019446477,0.9413575,0.0020198193,0.029945891],"study_design_scores_gemma":[0.0000325367,0.00017733179,0.003426254,0.00006904317,0.00003649091,0.001469489,0.0004800514,0.03760403,0.0137649225,0.92026806,0.022604616,0.00006725007],"about_ca_topic_score_codex":0.0005188274,"about_ca_topic_score_gemma":0.0007551577,"teacher_disagreement_score":0.005288383,"about_ca_system_score_codex":0.0006997228,"about_ca_system_score_gemma":0.00039081578,"threshold_uncertainty_score":0.017691433},"labels":[],"label_agreement":null},{"id":"W4403577631","doi":"10.48550/arxiv.2410.12173","title":"Relative position in binary substitutions","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; MacEwan University","keywords":"Position (finance); Binary number; Mathematics; Economics; Arithmetic","score_opus":0.04864594281658247,"score_gpt":0.1861836278559793,"score_spread":0.13753768503939684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403577631","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5315156,0.002545778,0.4240492,0.0012269146,0.0004110519,0.0000516081,0.00023057175,0.0005614482,0.039407846],"genre_scores_gemma":[0.94031835,0.00063053885,0.04922579,0.00019015485,0.00025185948,0.0000728324,0.00012897271,0.00016335957,0.009018097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841726,0.0005202728,0.0000924473,0.00039265867,0.0003961573,0.00018122117],"domain_scores_gemma":[0.9966798,0.0022440725,0.00023773384,0.00038614334,0.0003207961,0.00013152935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015653373,0.00043069216,0.0006626595,0.0021039927,0.0016217397,0.0024055361,0.0008266089,0.0012944117,0.0045953314],"category_scores_gemma":[0.007847695,0.00044370204,0.0006370501,0.0013854488,0.0033633853,0.003751042,0.0014994435,0.0016503369,0.0010987713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005413753,0.0000116992,0.0006785092,0.00004303782,0.0000054829175,0.00013270017,0.0007891976,0.0018704596,0.0029858404,0.97520554,0.00032104758,0.01790237],"study_design_scores_gemma":[0.000013120087,0.00005000289,0.00050936354,0.000034764587,0.000012214428,0.00029441295,0.00025648854,0.016028378,0.0032394705,0.9735951,0.0059419503,0.000024750276],"about_ca_topic_score_codex":0.00071985705,"about_ca_topic_score_gemma":0.0004260929,"teacher_disagreement_score":0.0045953314,"about_ca_system_score_codex":0.0011741673,"about_ca_system_score_gemma":0.0004716484,"threshold_uncertainty_score":0.015372932},"labels":[],"label_agreement":null},{"id":"W4404194047","doi":"10.1017/s0960129524000276","title":"Optimal approximate minimization of one-letter weighted finite automata","year":2024,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Canadian Institute for Advanced Research; McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Minification; Automaton; DFA minimization; Computer science; Mathematics; Algorithm; Nondeterministic finite automaton; Mathematical optimization; Automata theory; Theoretical computer science","score_opus":0.014219542662139094,"score_gpt":0.25226532507429367,"score_spread":0.23804578241215457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404194047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15987924,0.00026664382,0.8353563,0.00038752222,0.0000667441,0.00004832283,0.00013985581,0.0004967942,0.003358595],"genre_scores_gemma":[0.79984564,0.000120040684,0.19675289,0.00009950479,0.000037650952,0.00012368121,0.00023101426,0.00015542554,0.0026341076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867094,0.0004949124,0.00008503492,0.0003003698,0.00030594197,0.0001428256],"domain_scores_gemma":[0.99465936,0.003862902,0.00023674383,0.00061659334,0.00047813993,0.00014622175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012601076,0.00061187975,0.0011167912,0.00052290596,0.00047300002,0.0012367659,0.001414484,0.001067466,0.0024637734],"category_scores_gemma":[0.0094511835,0.0003289839,0.0006690922,0.00061493035,0.0010933658,0.0023238477,0.0010707363,0.0011028197,0.0003444338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030754445,0.000087140754,0.00081581564,0.0002597226,0.000053217904,0.000115701856,0.00020604441,0.7887083,0.009159695,0.14235967,0.0014119307,0.056515127],"study_design_scores_gemma":[0.0000051481325,0.000021375832,0.000039326864,0.0000073511605,0.000004127609,0.000013073216,0.000018551944,0.949066,0.0015178422,0.04908651,0.00021663899,0.0000040835066],"about_ca_topic_score_codex":0.0010754613,"about_ca_topic_score_gemma":0.0012731762,"teacher_disagreement_score":0.0024637734,"about_ca_system_score_codex":0.0011331048,"about_ca_system_score_gemma":0.0007739814,"threshold_uncertainty_score":0.00824219},"labels":[],"label_agreement":null},{"id":"W4404312157","doi":"10.1103/8sbs-t24w","title":"The Product Structure of Matrix Product States under Permutations","year":2025,"lang":"en","type":"preprint","venue":"PRX Quantum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut Périmètre de physique théorique; Ministerio de Ciencia e Innovación; Government of Canada; Agencia Estatal de Investigación; International Max Planck Research School for Quantum Science and Technology; Austrian Science Fund; European Commission; International Max Planck Research School for Advanced Methods in Process and Systems Engineering; International Max Planck Research School for Environmental, Cellular and Molecular Microbiology","keywords":"Product (mathematics); Combinatorics; Mathematics; Computer science; Geometry","score_opus":0.013577309723948494,"score_gpt":0.28552048709218525,"score_spread":0.27194317736823675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404312157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43038762,0.00052330364,0.4698178,0.0013273641,0.0003230246,0.0001161449,0.00038792467,0.00048049222,0.096636295],"genre_scores_gemma":[0.9558102,0.00035498667,0.032099877,0.00019759848,0.00013967016,0.00012435524,0.0002014285,0.00016065623,0.010911306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991667,0.0002542527,0.000052029427,0.00018286295,0.0002011719,0.00014290905],"domain_scores_gemma":[0.9986228,0.00041331796,0.00022495145,0.00041730676,0.0001763991,0.00014515454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010949064,0.00037203764,0.0004115292,0.0009843549,0.0013003994,0.0024710065,0.00068491144,0.001078904,0.0075629866],"category_scores_gemma":[0.0026357872,0.00034118976,0.0006561661,0.00064689835,0.003587502,0.0050817677,0.001497943,0.001064958,0.0008295659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009492578,0.000005511631,0.00007182413,0.000012644194,0.0000019597228,0.000040393486,0.00009141281,0.0013271078,0.0008651801,0.9957883,0.00021470043,0.0015714914],"study_design_scores_gemma":[0.0000060101343,0.000023177243,0.00015145175,0.000008349961,0.000003525152,0.000096204516,0.00006018018,0.026561156,0.0012395844,0.97011435,0.0017239081,0.00001212752],"about_ca_topic_score_codex":0.0006515479,"about_ca_topic_score_gemma":0.00047456764,"teacher_disagreement_score":0.0075629866,"about_ca_system_score_codex":0.00076135487,"about_ca_system_score_gemma":0.000598919,"threshold_uncertainty_score":0.025300741},"labels":[],"label_agreement":null},{"id":"W4404582541","doi":"10.1007/978-3-031-77019-7_7","title":"On Concurrent Program Algebra and Demonic Automata","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Automaton; Programming language; Algebra over a field; Theoretical computer science; Mathematics; Pure mathematics","score_opus":0.012291815710185047,"score_gpt":0.257131009493719,"score_spread":0.24483919378353391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404582541","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017465034,0.02233016,0.57960767,0.0041773054,0.0026897637,0.00010859002,0.0003004985,0.0005625091,0.37275842],"genre_scores_gemma":[0.6064393,0.021272251,0.1756885,0.002611623,0.0050388565,0.0004833606,0.00081242016,0.00049469393,0.187159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928975,0.00022639579,0.000050987583,0.00014044813,0.0002148298,0.000077661345],"domain_scores_gemma":[0.9990808,0.00053959846,0.000047660626,0.00014978166,0.00013943075,0.000042688214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095358666,0.0010338288,0.000834969,0.001512692,0.00181181,0.002794778,0.0012176422,0.0010564986,0.009763395],"category_scores_gemma":[0.0023122644,0.0007501742,0.0012949298,0.0028523863,0.004175075,0.008104099,0.0016406439,0.0035106293,0.001992338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050373387,0.0000053905683,0.00001860398,0.000027044762,0.000002308764,0.000017718012,0.00008989766,0.00047083717,0.00017715537,0.9927893,0.0010577446,0.005338888],"study_design_scores_gemma":[0.0000019865208,0.000003167324,0.000019819636,0.0000100692205,0.0000023266905,0.000027979262,0.0000144906635,0.00093211833,0.0001150002,0.98888236,0.009986932,0.0000037203145],"about_ca_topic_score_codex":0.0023109973,"about_ca_topic_score_gemma":0.0019796302,"teacher_disagreement_score":0.009763395,"about_ca_system_score_codex":0.0022883008,"about_ca_system_score_gemma":0.0009320812,"threshold_uncertainty_score":0.032661796},"labels":[],"label_agreement":null},{"id":"W4404601874","doi":"10.1007/978-3-476-05416-6_17","title":"Modularität","year":2024,"lang":"de","type":"book-chapter","venue":"J.B. Metzler eBooks","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Medicine","score_opus":0.023153044902375502,"score_gpt":0.23388886953971774,"score_spread":0.21073582463734225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404601874","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013400842,0.0042363233,0.34466416,0.0045274426,0.0015317054,0.00034203997,0.0013981374,0.0029868316,0.6269126],"genre_scores_gemma":[0.35810834,0.0067737023,0.22202918,0.002740932,0.0016894575,0.001000934,0.0026719477,0.0022885667,0.40269697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981756,0.00031152923,0.0001410214,0.0005778093,0.00058452296,0.0002095829],"domain_scores_gemma":[0.9981988,0.000457953,0.00014670988,0.00058497384,0.00048574858,0.00012580538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015733705,0.0012645393,0.0006444495,0.0014683799,0.0013970123,0.0037925798,0.0011590067,0.0011828397,0.04510266],"category_scores_gemma":[0.003958813,0.00072470005,0.0016971083,0.0012224859,0.0034276275,0.005882948,0.003783354,0.0025242502,0.015138384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032348253,0.000019172616,0.00023469383,0.00021146362,0.000033362816,0.00008770504,0.00028129815,0.0011106179,0.0017912528,0.9338025,0.012640515,0.049755152],"study_design_scores_gemma":[0.000021323684,0.00004166328,0.0003554863,0.000115982686,0.00003313833,0.00046438893,0.00008116442,0.0023318976,0.0022926806,0.6483829,0.34585792,0.000021393467],"about_ca_topic_score_codex":0.0008624615,"about_ca_topic_score_gemma":0.0010178719,"teacher_disagreement_score":0.04510266,"about_ca_system_score_codex":0.0018898993,"about_ca_system_score_gemma":0.0013979191,"threshold_uncertainty_score":0.15088344},"labels":[],"label_agreement":null},{"id":"W4405466740","doi":"10.1016/j.aam.2024.102834","title":"Letter frequency vs factor frequency in pure morphic words","year":2024,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Factor (programming language); Frequency factor; Arithmetic; Combinatorics; Statistics; Discrete mathematics; Computer science; Physics; Programming language","score_opus":0.010677687350299388,"score_gpt":0.25297696468321423,"score_spread":0.24229927733291484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405466740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91796875,0.0005621276,0.059070922,0.00032171496,0.00012637702,0.000019010131,0.00029329336,0.00041424748,0.021223426],"genre_scores_gemma":[0.9935509,0.0000888371,0.0040026214,0.000033578468,0.00008523889,0.000009134326,0.00008770228,0.00008205722,0.0020598995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992173,0.00021335707,0.000057161684,0.00016705769,0.0002096904,0.00013549403],"domain_scores_gemma":[0.9897995,0.0074623823,0.0006586883,0.0007967894,0.000955102,0.00032761382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008974629,0.00022005198,0.0004186534,0.00198722,0.00073290453,0.0028256557,0.00042586957,0.0006047264,0.009136306],"category_scores_gemma":[0.010127362,0.00023930258,0.00024399773,0.0012037691,0.0012590195,0.003047735,0.0006431503,0.00052190264,0.0008894175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029126804,0.0001801947,0.0228217,0.00037782767,0.00007629093,0.0007442948,0.0033164583,0.009004396,0.06929098,0.7100243,0.0028201647,0.17843078],"study_design_scores_gemma":[0.00010239271,0.00045507873,0.030891879,0.000080311875,0.00014931477,0.0018539422,0.002080516,0.05777712,0.026996247,0.86971796,0.009789954,0.00010520224],"about_ca_topic_score_codex":0.0005846248,"about_ca_topic_score_gemma":0.00042645147,"teacher_disagreement_score":0.009136306,"about_ca_system_score_codex":0.00047704173,"about_ca_system_score_gemma":0.00028691045,"threshold_uncertainty_score":0.03056401},"labels":[],"label_agreement":null},{"id":"W4405697651","doi":"10.1142/s0129054124420061","title":"Compressed Structures for Partial Derivative Automata Constructions","year":2024,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Mathematics; Combinatorics; Quadratic equation; Discrete mathematics; Star (game theory); Expression (computer science); Computer science; Geometry; Mathematical analysis","score_opus":0.019820882502079015,"score_gpt":0.3248887273504064,"score_spread":0.3050678448483274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405697651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11466658,0.00057013775,0.85219646,0.0011770917,0.00016856518,0.00042371827,0.0015906743,0.016608316,0.01259843],"genre_scores_gemma":[0.5934881,0.00025599403,0.3941824,0.0003386571,0.000120565375,0.0007171682,0.0030891031,0.0015545931,0.0062534213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969138,0.00082368846,0.00028387943,0.0005963011,0.0010885334,0.00029366548],"domain_scores_gemma":[0.98812336,0.005306468,0.00062267896,0.004643198,0.0009992146,0.00030508463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016081524,0.00074970035,0.000760067,0.0012834435,0.0011886441,0.0021271715,0.002156762,0.0010484009,0.012959921],"category_scores_gemma":[0.013873925,0.00078690524,0.0012992127,0.001963781,0.0022912866,0.0058939345,0.0038189976,0.0020470405,0.0026617188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012273038,0.00033408168,0.0025731735,0.0006294212,0.000053501928,0.00031647703,0.0013831964,0.0675945,0.0276705,0.52392614,0.017449735,0.356842],"study_design_scores_gemma":[0.0001605658,0.00034877576,0.0004050769,0.00009147961,0.000064045555,0.0003123049,0.00021232924,0.29660264,0.03643826,0.6431144,0.022189835,0.000060237333],"about_ca_topic_score_codex":0.001499762,"about_ca_topic_score_gemma":0.0025030072,"teacher_disagreement_score":0.012959921,"about_ca_system_score_codex":0.002323441,"about_ca_system_score_gemma":0.0022001874,"threshold_uncertainty_score":0.043355286},"labels":[],"label_agreement":null},{"id":"W4405718309","doi":"10.1109/tit.2024.3521236","title":"On Constructing Bent Functions From Cyclotomic Mappings","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Key Research and Development Program of China; Natural Science Foundation of Hubei Province; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Bent molecular geometry; Bent function; Mathematics; Discrete mathematics; Computer science; Boolean function; Combinatorics; Algebra over a field; Pure mathematics; Engineering; Structural engineering","score_opus":0.00626930448683798,"score_gpt":0.20340754927411842,"score_spread":0.19713824478728043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405718309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2768455,0.0013417244,0.61945003,0.0008863949,0.00035611083,0.00010583767,0.00021729407,0.00048389938,0.10031321],"genre_scores_gemma":[0.828516,0.0018544978,0.14004165,0.00069460116,0.0002930486,0.00022851049,0.00040077537,0.00032657842,0.027644297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960357,0.00011742071,0.000020796035,0.000082411025,0.000089894536,0.00008594804],"domain_scores_gemma":[0.99966633,0.000115919735,0.000037403985,0.00006756677,0.000070241855,0.00004256355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048601977,0.0008156932,0.00040792525,0.0012189506,0.0009039307,0.0011796835,0.000535076,0.00064594747,0.005066768],"category_scores_gemma":[0.001264027,0.00023943378,0.0008264895,0.0008110107,0.001310134,0.0019315133,0.0011788297,0.0014331221,0.0012473006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037705307,0.000025671428,0.00019189248,0.00006237108,0.0000061451933,0.00008915527,0.00017452825,0.0021833777,0.004711562,0.9624461,0.00072536274,0.029346038],"study_design_scores_gemma":[0.000021628239,0.00010702666,0.00034960816,0.00004489273,0.0000151835475,0.00032521397,0.00013286153,0.026309557,0.009818533,0.9457736,0.017063012,0.000038813465],"about_ca_topic_score_codex":0.00040595344,"about_ca_topic_score_gemma":0.00034095373,"teacher_disagreement_score":0.005066768,"about_ca_system_score_codex":0.0008437761,"about_ca_system_score_gemma":0.0003403153,"threshold_uncertainty_score":0.01695007},"labels":[],"label_agreement":null},{"id":"W4406150722","doi":"10.5802/alco.386","title":"Torsors and Tilings from Toric Toggling","year":2025,"lang":"en","type":"article","venue":"Algebraic Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Harvard University; National Science Foundation","keywords":"Computer science","score_opus":0.0021959821081968646,"score_gpt":0.19712789959254468,"score_spread":0.19493191748434782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406150722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78087926,0.00068104384,0.09311663,0.0007079271,0.00023462853,0.0000771343,0.00024756716,0.0005207577,0.123535],"genre_scores_gemma":[0.9818471,0.00021511507,0.008428953,0.000079722704,0.00005781489,0.000049558155,0.00011296011,0.00007613551,0.009132604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997851,0.000031336145,0.00001423875,0.000050418013,0.00006035259,0.00005864286],"domain_scores_gemma":[0.99958354,0.000111121226,0.0000752051,0.00009234307,0.000040415634,0.000097449025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018474052,0.00022977777,0.00025008444,0.00074065523,0.001105446,0.0013067295,0.00027498795,0.00041656,0.005785741],"category_scores_gemma":[0.0009149109,0.00018205613,0.000535549,0.00026350876,0.0023985582,0.0018244296,0.0012674828,0.0005917253,0.000480118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002642402,0.000008812917,0.00042916197,0.000026593045,0.0000040827285,0.00020494606,0.0006122435,0.0027596648,0.0028147318,0.98725486,0.00063337834,0.0052251527],"study_design_scores_gemma":[0.00001432319,0.00003235396,0.0007794182,0.000020771247,0.000009917931,0.00033803488,0.00055411656,0.01346809,0.0032452897,0.9703178,0.01119895,0.000020864181],"about_ca_topic_score_codex":0.001042964,"about_ca_topic_score_gemma":0.0010113656,"teacher_disagreement_score":0.005785741,"about_ca_system_score_codex":0.0006693023,"about_ca_system_score_gemma":0.0003147391,"threshold_uncertainty_score":0.019355178},"labels":[],"label_agreement":null},{"id":"W4406486971","doi":"10.1016/s0197-2510(10)70261-8","title":"10.1016/s0197-2510(10)70261-8","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.004565753882900736,"score_gpt":0.16226693367637665,"score_spread":0.15770117979347592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406486971","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003638241,0.00046561492,0.0007632604,0.00039185042,0.00032221567,0.00008782765,0.00083761587,0.0009290118,0.99583876],"genre_scores_gemma":[0.0005102471,0.00020224805,0.00034277744,0.00017160558,0.000058200072,0.000047431346,0.00045152265,0.00017173788,0.99804425],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912256,0.00006618183,0.000080487574,0.00031679907,0.0002424657,0.00017141721],"domain_scores_gemma":[0.9974408,0.00069871487,0.00020832823,0.00033192165,0.0005187825,0.0008013881],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012570891,0.0032841798,0.0021363012,0.003117211,0.002579299,0.0046465076,0.004023682,0.006572977,0.989077],"category_scores_gemma":[0.001851002,0.0010559155,0.0016131679,0.0031821737,0.0022569022,0.0064039454,0.0036856441,0.0028716992,0.99227434],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002963376,0.00019534606,0.00075963885,0.00078564265,0.000039666073,0.00026478054,0.00012426393,0.000483187,0.0020724288,0.010815787,0.33742285,0.64674014],"study_design_scores_gemma":[0.000042447922,0.00010810529,0.0005154637,0.00039423493,0.000013271062,0.00028900063,0.00011976612,0.00024215165,0.00041413025,0.0010407475,0.9967956,0.000025037707],"about_ca_topic_score_codex":0.0035689608,"about_ca_topic_score_gemma":0.0029414461,"teacher_disagreement_score":0.010923028,"about_ca_system_score_codex":0.0015179066,"about_ca_system_score_gemma":0.0016568564,"threshold_uncertainty_score":0.0155802965},"labels":[],"label_agreement":null},{"id":"W4406779735","doi":"10.1007/s00224-025-10214-1","title":"Rudin-Shapiro Sums Via Automata Theory and Logic","year":2025,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Automaton; Computer science; Discrete mathematics; Algebra over a field; Calculus (dental); Pure mathematics; Theoretical computer science","score_opus":0.012222276497982786,"score_gpt":0.2517760887789627,"score_spread":0.23955381228097988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406779735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04362912,0.0021446163,0.8636955,0.0020143287,0.00041005283,0.00006141654,0.00019618127,0.00088278577,0.08696608],"genre_scores_gemma":[0.7180628,0.002905655,0.24905656,0.0012312061,0.0011226506,0.00034920184,0.00031841558,0.00034571957,0.026607724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875605,0.00037704228,0.000099003126,0.000265538,0.0003630631,0.00013925828],"domain_scores_gemma":[0.99868613,0.0007465278,0.000096793,0.00017671035,0.0001906541,0.00010324887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013824372,0.0007861441,0.0009596774,0.0020109515,0.0019816095,0.003155791,0.0013280901,0.0008018367,0.0045243944],"category_scores_gemma":[0.0029325192,0.00042997487,0.0014283778,0.0014657583,0.0040239473,0.0073723337,0.0038128474,0.0025611082,0.001397162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010840592,0.000007824735,0.00006928918,0.000024867382,0.0000067442493,0.000050104118,0.00012756667,0.0012617111,0.0003159842,0.9923523,0.00061230717,0.0051603694],"study_design_scores_gemma":[0.000004908685,0.000007917408,0.000038405356,0.000007817767,0.000011331292,0.000040783376,0.000025463967,0.005569756,0.0004945219,0.9900477,0.0037414155,0.000009811954],"about_ca_topic_score_codex":0.0010069505,"about_ca_topic_score_gemma":0.0013873251,"teacher_disagreement_score":0.0045243944,"about_ca_system_score_codex":0.0013915217,"about_ca_system_score_gemma":0.0010279503,"threshold_uncertainty_score":0.015135586},"labels":[],"label_agreement":null},{"id":"W4407127330","doi":"10.1007/978-3-031-48825-2","title":"Completely Regular Semigroup Varieties","year":2025,"lang":"en","type":"book","venue":"Synthesis lectures on mathematics and statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Semigroup; Mathematics; Pure mathematics","score_opus":0.011285050740788147,"score_gpt":0.22099848980265546,"score_spread":0.20971343906186732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407127330","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008863865,0.0037629788,0.016888194,0.000935896,0.0006081712,0.000016261853,0.0003445076,0.00031588538,0.96826416],"genre_scores_gemma":[0.13912699,0.0029725046,0.005973072,0.00031618634,0.00061932526,0.000029564872,0.00056161254,0.0002577407,0.8501431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984396,0.000025794525,0.0000045570914,0.000036082187,0.00007314036,0.000016387196],"domain_scores_gemma":[0.9998915,0.000029708768,0.0000066159,0.000024007735,0.000030755364,0.000017290477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001644595,0.00038603452,0.0003358662,0.0005839532,0.00057928887,0.001689885,0.00027558111,0.00023712851,0.026291242],"category_scores_gemma":[0.0004428375,0.00024302608,0.00019250337,0.00067333394,0.00081843993,0.0014900083,0.0006419332,0.00083106244,0.0054621077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013362695,0.000007393515,0.000026019814,0.000030526175,0.0000023896202,0.000017546214,0.00011836327,0.00030440165,0.0009830551,0.9392804,0.033763587,0.02545289],"study_design_scores_gemma":[0.0000057754464,0.0000116084775,0.00022425778,0.000024766665,0.0000039952083,0.00010033131,0.00006605987,0.0009734994,0.00094956264,0.65899116,0.33864275,0.000006282049],"about_ca_topic_score_codex":0.0004824428,"about_ca_topic_score_gemma":0.0006565727,"teacher_disagreement_score":0.026291242,"about_ca_system_score_codex":0.0007835795,"about_ca_system_score_gemma":0.0003839427,"threshold_uncertainty_score":0.08795297},"labels":[],"label_agreement":null},{"id":"W4407774368","doi":"10.37256/cm.6120256175","title":"Word Motifs and a Generalized Hamming Distance","year":2025,"lang":"en","type":"article","venue":"Contemporary Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"China Scholarship Council","keywords":"Mathematics; Hamming distance; Word (group theory); Hamming graph; Hamming code; Combinatorics; Algorithm; Geometry; Decoding methods","score_opus":0.019554020566804376,"score_gpt":0.24775935032072055,"score_spread":0.22820532975391616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407774368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6533823,0.0011141504,0.33680868,0.00037952798,0.000088459776,0.00006955078,0.00053625926,0.00033044466,0.007290632],"genre_scores_gemma":[0.9066127,0.00026351857,0.09039645,0.00010628667,0.000085243366,0.00008608326,0.00039818508,0.00008150852,0.0019700003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984321,0.0003838901,0.00014702108,0.0004899937,0.00038217547,0.000164776],"domain_scores_gemma":[0.9949334,0.0027457015,0.00069740124,0.00070416316,0.00054248597,0.00037677807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009574901,0.00036648317,0.0007207697,0.0024514638,0.0008296769,0.0012761076,0.0011111781,0.0009942193,0.0031651726],"category_scores_gemma":[0.008429032,0.00027792866,0.0005590173,0.0019291156,0.0021781495,0.0039975205,0.001760406,0.0007238477,0.00047517914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034148485,0.00010558125,0.010939679,0.0002582286,0.00009786402,0.00045305153,0.0007442202,0.046885468,0.014312082,0.84564245,0.0016475274,0.07857252],"study_design_scores_gemma":[0.000029365927,0.00018914673,0.004245948,0.00004592839,0.00002880843,0.00068993215,0.00023703462,0.14132293,0.0045603453,0.8447638,0.0038171813,0.00006954305],"about_ca_topic_score_codex":0.0007831092,"about_ca_topic_score_gemma":0.0006673453,"teacher_disagreement_score":0.0031651726,"about_ca_system_score_codex":0.0009332573,"about_ca_system_score_gemma":0.0004512362,"threshold_uncertainty_score":0.010588586},"labels":[],"label_agreement":null},{"id":"W4408444984","doi":"10.5070/c65165014","title":"On the number of squares in a finite word","year":2025,"lang":"en","type":"article","venue":"Combinatorial Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université du Québec à Montréal","keywords":"Word (group theory); Computer science; Least-squares function approximation; Mathematics; Arithmetic; Statistics; Geometry","score_opus":0.008094390021761747,"score_gpt":0.25462337723611894,"score_spread":0.2465289872143572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408444984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73122036,0.0029574444,0.186893,0.0045432863,0.0005670265,0.00009956684,0.0006271382,0.0008305367,0.07226174],"genre_scores_gemma":[0.9634221,0.000564753,0.025800502,0.0004948261,0.00039578803,0.0001549136,0.0002819023,0.00020686621,0.008678335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973024,0.0006443401,0.000155039,0.0009848687,0.00054845377,0.00036484218],"domain_scores_gemma":[0.9760935,0.019225473,0.0011907297,0.0014975565,0.0009304195,0.0010623788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016389941,0.0007225213,0.0011350358,0.0014169761,0.0018966122,0.0032853477,0.0018891809,0.0012257029,0.0071268044],"category_scores_gemma":[0.013551514,0.0006867033,0.0009899522,0.0009845847,0.005326533,0.007525859,0.003349158,0.0025944938,0.0013963026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007625456,0.00011229949,0.009372568,0.00046227447,0.00009577311,0.00088329206,0.0020046602,0.01224123,0.017716113,0.918282,0.0040790774,0.03398807],"study_design_scores_gemma":[0.000065906934,0.00014204762,0.002190158,0.00009905974,0.00007619521,0.0010611163,0.00032687065,0.045522753,0.009179282,0.93305963,0.008206943,0.00007008515],"about_ca_topic_score_codex":0.00082443544,"about_ca_topic_score_gemma":0.00076209416,"teacher_disagreement_score":0.0071268044,"about_ca_system_score_codex":0.0014694092,"about_ca_system_score_gemma":0.0008695361,"threshold_uncertainty_score":0.02384156},"labels":[],"label_agreement":null},{"id":"W4408567163","doi":"10.61091/jcmcc124-27","title":"Graphs of reduced words and some connections","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Linguistics; Combinatorics; Computer science; Philosophy","score_opus":0.009923363222652895,"score_gpt":0.2516400508154038,"score_spread":0.24171668759275092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408567163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8690991,0.0011995229,0.037067067,0.0009119295,0.000086084,0.000059783983,0.0006004393,0.00028720734,0.090688854],"genre_scores_gemma":[0.9819218,0.0003828361,0.0052225515,0.000092318856,0.000058769587,0.00005322825,0.00038165244,0.000053174568,0.01183369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970275,0.00007716796,0.000013699092,0.00008030606,0.00007659578,0.000049375067],"domain_scores_gemma":[0.9995685,0.00015646075,0.00007772948,0.00006201668,0.0000779449,0.0000574018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016855357,0.00023314363,0.0002710985,0.0015340821,0.000891016,0.0012782636,0.0004698882,0.0004596874,0.0062581575],"category_scores_gemma":[0.0010644742,0.00021714406,0.00028890872,0.0011246685,0.0011272674,0.0016082703,0.00079635874,0.0004471012,0.00054593605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027440468,0.000011785701,0.00060858583,0.00003535607,0.0000069429148,0.00030006497,0.00033602733,0.0021300777,0.0018564194,0.9854525,0.0010755424,0.0081593925],"study_design_scores_gemma":[0.000011109836,0.000020681593,0.001356616,0.000020240668,0.000014942465,0.00040771844,0.00029252953,0.011066154,0.0010615821,0.9704846,0.015251696,0.00001209413],"about_ca_topic_score_codex":0.0010984809,"about_ca_topic_score_gemma":0.00096898444,"teacher_disagreement_score":0.0062581575,"about_ca_system_score_codex":0.00076737645,"about_ca_system_score_gemma":0.00020753611,"threshold_uncertainty_score":0.020935655},"labels":[],"label_agreement":null},{"id":"W4408707386","doi":"10.1016/j.disc.2025.114487","title":"Combinatorics on words and generating Dirichlet series of automatic sequences","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS","keywords":"Mathematics; Combinatorics; Series (stratigraphy); Dirichlet distribution; Dirichlet series; Discrete mathematics","score_opus":0.011094295410950547,"score_gpt":0.2498030594622259,"score_spread":0.23870876405127534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408707386","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5982208,0.0018779059,0.2622476,0.0032575792,0.00070422015,0.00011273143,0.0005753304,0.00046930235,0.13253462],"genre_scores_gemma":[0.943461,0.0011077882,0.023533069,0.00044626347,0.0010171582,0.00020738241,0.00048574278,0.00025165264,0.029489921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980683,0.0006622189,0.00013520652,0.00033592887,0.0004913441,0.00030704806],"domain_scores_gemma":[0.99172723,0.0056098374,0.0007528953,0.0006019269,0.00063051865,0.0006776633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023697456,0.001243801,0.0017093291,0.0051519214,0.003227348,0.0068009873,0.0021424845,0.0017964047,0.011484826],"category_scores_gemma":[0.009227295,0.0010718589,0.001753893,0.00378263,0.0062374542,0.008781454,0.0034357097,0.00352093,0.0013406575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015475238,0.000013713295,0.00010845053,0.00001601561,0.0000033200515,0.00004351282,0.0001812137,0.0004580568,0.00024601736,0.99689,0.00023987188,0.0017844535],"study_design_scores_gemma":[0.0000076177294,0.0000056913295,0.00007120186,0.000006982712,0.0000035022058,0.000060404323,0.000047887446,0.0020838042,0.00018023083,0.9969644,0.0005600174,0.000008328942],"about_ca_topic_score_codex":0.00086932356,"about_ca_topic_score_gemma":0.000897129,"teacher_disagreement_score":0.011484826,"about_ca_system_score_codex":0.002563486,"about_ca_system_score_gemma":0.000944413,"threshold_uncertainty_score":0.038420618},"labels":[],"label_agreement":null},{"id":"W4409442370","doi":"10.1142/s0129054125430026","title":"Language Quotients Revisited","year":2025,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Quotient; Mathematics; Computer science; Linguistics; Programming language; Pure mathematics; Discrete mathematics; Philosophy","score_opus":0.008207469668431198,"score_gpt":0.3085720398270894,"score_spread":0.3003645701586582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409442370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12528072,0.00094495626,0.85005206,0.0015006784,0.00022290536,0.00021863819,0.000360568,0.0040023546,0.017417058],"genre_scores_gemma":[0.7821642,0.00040765057,0.20703842,0.00046904874,0.000113666225,0.00018872251,0.00039334802,0.0012187217,0.008006224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921089,0.0016891691,0.0010168231,0.0017657861,0.0027990772,0.00062022],"domain_scores_gemma":[0.98627466,0.0060697487,0.00069003424,0.004373064,0.002256294,0.00033612142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033980866,0.00065508985,0.0010040399,0.001092956,0.0011513474,0.0036648975,0.002249712,0.0009350333,0.0054455264],"category_scores_gemma":[0.01996671,0.0007048451,0.0021543384,0.00094860006,0.0056443783,0.012866036,0.0049704053,0.0034879392,0.0010606571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029913164,0.00006525319,0.002293024,0.00026946262,0.000030321251,0.0004170268,0.0021225198,0.021732455,0.013412595,0.88415146,0.0018431584,0.07336361],"study_design_scores_gemma":[0.000051660023,0.0001536042,0.00041517615,0.00008613129,0.000059844093,0.00060834724,0.00036868438,0.12554798,0.03735541,0.80625254,0.029015906,0.000084741536],"about_ca_topic_score_codex":0.0039456524,"about_ca_topic_score_gemma":0.002197599,"teacher_disagreement_score":0.0054455264,"about_ca_system_score_codex":0.0029357108,"about_ca_system_score_gemma":0.0019997852,"threshold_uncertainty_score":0.021300137},"labels":[],"label_agreement":null},{"id":"W4410091070","doi":"10.1016/j.tcs.2025.115280","title":"Maximal universal width of an AFA is NP-hard","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Computer science; Algorithm; Discrete mathematics","score_opus":0.006597708026147521,"score_gpt":0.2374176688564213,"score_spread":0.23081996083027378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410091070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66078305,0.0020282173,0.27553108,0.009858514,0.00045765555,0.00042994745,0.006802767,0.0049366406,0.039172076],"genre_scores_gemma":[0.91591,0.0006860005,0.07037992,0.00093591434,0.00037377476,0.0002676251,0.0025479977,0.00063881045,0.008259919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974769,0.00033774722,0.0002473357,0.0009638812,0.0003452308,0.0006289834],"domain_scores_gemma":[0.97886294,0.01656619,0.0010182392,0.0013744022,0.0006998933,0.0014782606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020076232,0.001451742,0.0030634457,0.001215869,0.003199714,0.0074823685,0.0035892972,0.0029216032,0.011436132],"category_scores_gemma":[0.012986683,0.0017838301,0.003438844,0.0021248327,0.0029277536,0.016069027,0.0043563554,0.0058236136,0.0012457691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004566738,0.0013298119,0.014501304,0.0039482345,0.0010458028,0.0017315705,0.004693275,0.10774555,0.040239155,0.6116365,0.033820674,0.17474134],"study_design_scores_gemma":[0.00026969519,0.00015146863,0.0010839205,0.00015978866,0.00032434208,0.0008631229,0.0010417423,0.10168655,0.008913507,0.87856,0.006866231,0.000079684956],"about_ca_topic_score_codex":0.0022714583,"about_ca_topic_score_gemma":0.0032414878,"teacher_disagreement_score":0.011436132,"about_ca_system_score_codex":0.0024482661,"about_ca_system_score_gemma":0.0022965248,"threshold_uncertainty_score":0.03825766},"labels":[],"label_agreement":null},{"id":"W4410231175","doi":"10.1007/s00233-025-10527-0","title":"Descending chains of varieties of completely regular semigroups","year":2025,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Algebra over a field; Regular semigroup; Pure mathematics; Semigroup; Arithmetic; Special classes of semigroups; Combinatorics; Discrete mathematics","score_opus":0.005350251740365935,"score_gpt":0.2239998652729443,"score_spread":0.21864961353257836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410231175","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72160643,0.0019228994,0.21533357,0.00062035583,0.00022714569,0.00008885063,0.0007196069,0.00065616245,0.058824908],"genre_scores_gemma":[0.948531,0.00061427377,0.022759313,0.00011724325,0.00015083763,0.00009055053,0.00066488737,0.00016483787,0.026906969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989919,0.00021750551,0.00007808669,0.0002746084,0.00023110831,0.00020675578],"domain_scores_gemma":[0.9968675,0.0014671003,0.00030802022,0.00023311576,0.00042487372,0.00069943466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011196096,0.0006472089,0.00090039737,0.0027280957,0.0026032238,0.0042567593,0.00093931454,0.00058836397,0.007944876],"category_scores_gemma":[0.0027033684,0.00080455036,0.00082518125,0.0019767485,0.002668973,0.005902949,0.0024779697,0.0013639099,0.0007283065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010017062,0.00003145816,0.000555969,0.0000417625,0.000012606163,0.00021119436,0.0009717457,0.0006797663,0.0021650344,0.99006826,0.0006068391,0.004555175],"study_design_scores_gemma":[0.000045796973,0.000053086118,0.0006738052,0.000031544914,0.000022841572,0.00023928918,0.00045110352,0.004891572,0.0017735905,0.9850482,0.0067439796,0.000025302417],"about_ca_topic_score_codex":0.0010214385,"about_ca_topic_score_gemma":0.0013156591,"teacher_disagreement_score":0.007944876,"about_ca_system_score_codex":0.0011214996,"about_ca_system_score_gemma":0.0005118213,"threshold_uncertainty_score":0.026578307},"labels":[],"label_agreement":null},{"id":"W4410741100","doi":"10.1016/j.jalgebra.2025.05.012","title":"Generalised power series determined by linear recurrence relations","year":2025,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fields Institute for Research in Mathematical Sciences","keywords":"Mathematics; Series (stratigraphy); Recurrence relation; Power (physics); Power series; Statistics; Combinatorics; Mathematical analysis; Thermodynamics; Geology","score_opus":0.006032807190838684,"score_gpt":0.23703522189640114,"score_spread":0.23100241470556246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410741100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74369633,0.0012844295,0.21517333,0.00048240714,0.00019172704,0.000115624614,0.00025324017,0.000534098,0.03826874],"genre_scores_gemma":[0.97266567,0.00036624176,0.019132456,0.00007740947,0.00015406801,0.000053504282,0.0001302232,0.00007873272,0.0073416904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895895,0.00018672887,0.000111213216,0.00028958308,0.0002929991,0.00016056052],"domain_scores_gemma":[0.9981602,0.00071252126,0.00043118742,0.00031169233,0.00027024958,0.000114188864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008576596,0.00041925564,0.00054529926,0.0015298264,0.0008542581,0.0018008051,0.00058139744,0.0005645824,0.0033464883],"category_scores_gemma":[0.005873257,0.0003155157,0.00084494264,0.0010314697,0.0026754772,0.0035260562,0.0010080645,0.0010390754,0.0008437908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008347293,0.000018424495,0.0015029642,0.000078520025,0.000017871687,0.0007893631,0.000979567,0.005610696,0.010419222,0.9600515,0.00059011934,0.019858308],"study_design_scores_gemma":[0.000027432246,0.00006729576,0.0010298515,0.00003468482,0.000029193123,0.00077178335,0.00018442002,0.020427352,0.008187055,0.96181226,0.0073785353,0.000050235965],"about_ca_topic_score_codex":0.00066035904,"about_ca_topic_score_gemma":0.0005587717,"teacher_disagreement_score":0.0033464883,"about_ca_system_score_codex":0.00083741586,"about_ca_system_score_gemma":0.00032562856,"threshold_uncertainty_score":0.011195183},"labels":[],"label_agreement":null},{"id":"W4411169467","doi":"10.1007/s11047-025-10022-z","title":"Algorithms for maximal existential and universal width","year":2025,"lang":"en","type":"article","venue":"Natural Computing","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Existentialism; Theory of computation; Computer science; Mathematics; Algorithm; Epistemology; Philosophy","score_opus":0.010669383250928591,"score_gpt":0.2648285221914973,"score_spread":0.2541591389405687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411169467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030093415,0.0007111982,0.9491393,0.0015028594,0.00021261096,0.00018560553,0.00067147834,0.004249524,0.013234039],"genre_scores_gemma":[0.28322458,0.0006364021,0.69719124,0.0006376645,0.0003019795,0.00048602046,0.001709321,0.0023781925,0.013434553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954833,0.0009385623,0.00043268586,0.0016129519,0.0009132837,0.0006193023],"domain_scores_gemma":[0.9834953,0.010067735,0.00044872315,0.0042182817,0.0011157534,0.0006542172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043509193,0.0018505862,0.001965824,0.0030680979,0.0028862746,0.007929035,0.006311693,0.0026409808,0.02231616],"category_scores_gemma":[0.02369663,0.0019302932,0.004271833,0.004003125,0.0042563668,0.032745287,0.011001745,0.006309083,0.0040786145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046747868,0.00015816417,0.0009525358,0.000411802,0.00007604108,0.00004307595,0.0009768361,0.00869735,0.0022781873,0.82814556,0.009441114,0.14835183],"study_design_scores_gemma":[0.000055728382,0.00002047483,0.00010565237,0.000069354035,0.000067607776,0.00005528405,0.00020471837,0.029296586,0.0032236832,0.96111864,0.00575474,0.000027390932],"about_ca_topic_score_codex":0.0019151488,"about_ca_topic_score_gemma":0.003179035,"teacher_disagreement_score":0.02231616,"about_ca_system_score_codex":0.0038603183,"about_ca_system_score_gemma":0.002791379,"threshold_uncertainty_score":0.074655},"labels":[],"label_agreement":null},{"id":"W4411300943","doi":"10.1007/s11047-025-10032-x","title":"On decidability of problems involving insertion operations","year":2025,"lang":"en","type":"article","venue":"Natural Computing","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decidability; Theory of computation; Computer science; Mathematics; Calculus (dental); Algorithm","score_opus":0.008204423882996022,"score_gpt":0.25574242990320906,"score_spread":0.24753800602021303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411300943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18828847,0.0069578825,0.6591859,0.040780522,0.0012454789,0.00055752497,0.0022726646,0.002491218,0.09822043],"genre_scores_gemma":[0.8204208,0.0033295474,0.14254037,0.0046160375,0.0024302201,0.00066310936,0.0040703183,0.0010580719,0.020871667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98349667,0.0056386665,0.0012109258,0.0043274155,0.0030756933,0.0022506586],"domain_scores_gemma":[0.80715144,0.18090324,0.002537057,0.005430085,0.0023790863,0.0015990683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013973556,0.0020107545,0.0033733423,0.00302775,0.0058321566,0.012995158,0.009698102,0.007258416,0.012322873],"category_scores_gemma":[0.07456632,0.002895167,0.008585725,0.005265468,0.014257392,0.045360647,0.008733718,0.018361436,0.0011739597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005022851,0.00037601514,0.0015878229,0.00065017596,0.00014704687,0.00048078096,0.002033819,0.019376634,0.0012885584,0.94011337,0.007949659,0.025493896],"study_design_scores_gemma":[0.000059238355,0.00001711057,0.00011782683,0.000044849683,0.000041499316,0.00008929059,0.00016613696,0.018671473,0.0006747246,0.97873986,0.0013585804,0.000019476583],"about_ca_topic_score_codex":0.007078299,"about_ca_topic_score_gemma":0.007169676,"teacher_disagreement_score":0.013973556,"about_ca_system_score_codex":0.0076338467,"about_ca_system_score_gemma":0.0052565993,"threshold_uncertainty_score":0.073900044},"labels":[],"label_agreement":null},{"id":"W4411442212","doi":"10.1007/978-3-662-69359-9_521","title":"Recursive Partitioning","year":2025,"lang":"en","type":"book-chapter","venue":"International Encyclopedia of Statistical Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Computer science","score_opus":0.008509289670155485,"score_gpt":0.2628516792246103,"score_spread":0.2543423895544548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411442212","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013038442,0.0011072305,0.71343017,0.0004994064,0.0003317601,0.00035627815,0.0017574043,0.004998097,0.2644812],"genre_scores_gemma":[0.17386204,0.0011652646,0.5594106,0.00065668393,0.0002508766,0.00049669686,0.0083391825,0.0036406135,0.25217798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928695,0.000110570036,0.00003152316,0.0002432556,0.00020846498,0.00011921406],"domain_scores_gemma":[0.999178,0.00019801107,0.00001760219,0.0003811721,0.00018586645,0.000039317936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004027299,0.00076799723,0.0007966813,0.0010927686,0.0013148197,0.0021301107,0.0014721847,0.0008602795,0.06627651],"category_scores_gemma":[0.0020067932,0.00052484666,0.0010751283,0.0012771386,0.00081953837,0.0024517437,0.002132624,0.0014357858,0.033458523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100142424,0.000085929634,0.00033092764,0.00025724023,0.00002982981,0.00012305002,0.00034904174,0.0063791415,0.011575677,0.5193702,0.053626798,0.40777206],"study_design_scores_gemma":[0.000036753696,0.00007210272,0.0007221394,0.00011814898,0.000060348044,0.00050043245,0.00023605797,0.04791797,0.014828299,0.58694965,0.34851584,0.000042346277],"about_ca_topic_score_codex":0.001627284,"about_ca_topic_score_gemma":0.0025797088,"teacher_disagreement_score":0.06627651,"about_ca_system_score_codex":0.00084866805,"about_ca_system_score_gemma":0.0009311044,"threshold_uncertainty_score":0.22171706},"labels":[],"label_agreement":null},{"id":"W4411450127","doi":"10.37236/13499","title":"The Repetition Threshold for Ternary Rich Words","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ternary operation; Repetition (rhetorical device); Conjecture; Mathematics; Combinatorics; Binary number; Polynomial; Root (linguistics); Discrete mathematics; Arithmetic; Computer science; Mathematical analysis; Linguistics; Philosophy","score_opus":0.004598387732743194,"score_gpt":0.23934507771130026,"score_spread":0.23474668997855708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411450127","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7181075,0.0017010331,0.23581594,0.0012221873,0.00015144133,0.000106630876,0.0006544553,0.0009914358,0.041249298],"genre_scores_gemma":[0.9772535,0.00023124958,0.018266043,0.00020764334,0.000102094724,0.000074537325,0.00026233713,0.00011566752,0.0034869707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976418,0.0002896092,0.00020102834,0.00068584527,0.00077023386,0.0004115633],"domain_scores_gemma":[0.992007,0.0049158107,0.0009643893,0.0008656197,0.00081080175,0.00043636397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001028714,0.000415871,0.0007967823,0.0017086498,0.0014244994,0.0026083295,0.0010598268,0.0011624858,0.005690627],"category_scores_gemma":[0.009459226,0.0005422087,0.00094035466,0.0009034688,0.00315302,0.0042582853,0.002424836,0.0018482818,0.0013559181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047384432,0.000055455606,0.0032584942,0.0002766394,0.00004646264,0.0006151177,0.0017629446,0.010547942,0.033935692,0.92133635,0.0020351727,0.025655903],"study_design_scores_gemma":[0.000044736422,0.000136216,0.0012841352,0.00005860762,0.00005170531,0.0007041508,0.0002826124,0.035772778,0.021517701,0.93488747,0.0051766965,0.000083318875],"about_ca_topic_score_codex":0.0007638001,"about_ca_topic_score_gemma":0.00051521533,"teacher_disagreement_score":0.005690627,"about_ca_system_score_codex":0.0014959957,"about_ca_system_score_gemma":0.0008150315,"threshold_uncertainty_score":0.019037068},"labels":[],"label_agreement":null},{"id":"W4411720705","doi":"10.61091/ars163-01","title":"Monophonic and edge monophonic numbers of corona product graphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Corona (planetary geology); Enhanced Data Rates for GSM Evolution; Product (mathematics); Combinatorics; Telecommunications; Computer science; Geometry; Physics","score_opus":0.005726198067973053,"score_gpt":0.2221859811168071,"score_spread":0.21645978304883404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411720705","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7013442,0.00062691903,0.15580985,0.000554989,0.00022255554,0.00010150879,0.001789428,0.0007572335,0.13879332],"genre_scores_gemma":[0.9379207,0.00029546366,0.028224405,0.0001883719,0.00018611623,0.00012670956,0.0010696704,0.00023143063,0.031757157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996228,0.000046620047,0.000023786839,0.00012335362,0.00009653388,0.000086786036],"domain_scores_gemma":[0.9986688,0.000506287,0.00020515244,0.00012902833,0.00019570853,0.00029502812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029926034,0.00035188836,0.00027303124,0.0013550345,0.000638494,0.0014175267,0.0005942029,0.00042171942,0.01507216],"category_scores_gemma":[0.001806864,0.0002578279,0.00035258968,0.000869319,0.00090420333,0.0020722481,0.00089431053,0.0006569711,0.0014952965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003115217,0.00008285017,0.0023063736,0.00018414152,0.000020663454,0.00031449663,0.0007790907,0.0072264066,0.01212144,0.872698,0.012176316,0.09177876],"study_design_scores_gemma":[0.000057094927,0.00019805184,0.006353753,0.000070921946,0.00003805838,0.0009159589,0.00041234365,0.04712806,0.006752395,0.8983271,0.039683267,0.00006316489],"about_ca_topic_score_codex":0.0010017301,"about_ca_topic_score_gemma":0.0013665733,"teacher_disagreement_score":0.01507216,"about_ca_system_score_codex":0.00072629785,"about_ca_system_score_gemma":0.00029232833,"threshold_uncertainty_score":0.050421417},"labels":[],"label_agreement":null},{"id":"W4411772012","doi":"10.1007/978-3-031-97548-6_8","title":"Words Avoiding Half-Flips","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Artificial intelligence; Algorithm","score_opus":0.013169856159038025,"score_gpt":0.23666817123818085,"score_spread":0.22349831507914283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411772012","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17136402,0.0015660275,0.27655056,0.0014840297,0.0019025792,0.00023518791,0.0010021261,0.001781769,0.5441137],"genre_scores_gemma":[0.6246322,0.0014000203,0.060183417,0.00090971316,0.0004664621,0.00037314015,0.0012524254,0.0015564271,0.3092263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995328,0.000083354214,0.00003989939,0.00010173394,0.000108660184,0.00013347038],"domain_scores_gemma":[0.99900633,0.00033775013,0.000062664716,0.00024327033,0.00025742344,0.00009250722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034579955,0.000706201,0.00079846586,0.0009568125,0.0018772259,0.0023969188,0.0008053696,0.0013028509,0.02928344],"category_scores_gemma":[0.002174816,0.00057837943,0.0007254895,0.00086345355,0.00179621,0.004464718,0.0022265553,0.0017158892,0.010501694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104281266,0.000019543668,0.00009109306,0.00010860923,0.000008170355,0.00021714898,0.00038619412,0.00065126707,0.0039453343,0.94114566,0.0081213685,0.045201454],"study_design_scores_gemma":[0.000012835205,0.000025524076,0.00006585788,0.000038811966,0.00001022859,0.00023592733,0.00018970731,0.0014853402,0.003065275,0.9645925,0.030264905,0.000012988212],"about_ca_topic_score_codex":0.0002182479,"about_ca_topic_score_gemma":0.00029941017,"teacher_disagreement_score":0.02928344,"about_ca_system_score_codex":0.00043889662,"about_ca_system_score_gemma":0.0004782357,"threshold_uncertainty_score":0.09796286},"labels":[],"label_agreement":null},{"id":"W4411772245","doi":"10.1007/978-3-031-97548-6_4","title":"Maximal 2-Dimensional Binary Words of Bounded Degree","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Montreal Police Service; Université du Québec à Montréal","funders":"","keywords":"Degree (music); Computer science; Bounded function; Binary number; Algorithm; Arithmetic; Mathematics; Mathematical analysis; Physics","score_opus":0.017779266767959392,"score_gpt":0.2397637187666649,"score_spread":0.22198445199870553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411772245","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53111714,0.003503364,0.12726483,0.002120605,0.00069664605,0.00011763147,0.002449095,0.00082613423,0.3319045],"genre_scores_gemma":[0.8911091,0.0010005176,0.022057353,0.00036598547,0.0002568224,0.00014707842,0.0012985284,0.0002289357,0.0835356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967015,0.000061801155,0.000024885912,0.00006874675,0.00006917508,0.00010526566],"domain_scores_gemma":[0.99942374,0.00030940463,0.000051416486,0.000053016352,0.000068381465,0.00009405025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020858277,0.00066946883,0.0006755862,0.0009089724,0.0012031811,0.0022914982,0.0006256859,0.00082000165,0.012260582],"category_scores_gemma":[0.0010356412,0.0005911782,0.000435691,0.0009433859,0.0011279178,0.0029607252,0.0021028975,0.0012037473,0.0026006745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019255916,0.000028851511,0.0002247675,0.00017991177,0.000009621011,0.00024863693,0.0005922597,0.0013038005,0.01018334,0.96911687,0.005279745,0.012639496],"study_design_scores_gemma":[0.000032166015,0.000035832047,0.00061671674,0.000051692416,0.000013700222,0.00045573237,0.00028085348,0.0037718883,0.007496132,0.9633013,0.023915391,0.000028486915],"about_ca_topic_score_codex":0.0003167366,"about_ca_topic_score_gemma":0.00047605028,"teacher_disagreement_score":0.012260582,"about_ca_system_score_codex":0.00059674156,"about_ca_system_score_gemma":0.00028788863,"threshold_uncertainty_score":0.041015744},"labels":[],"label_agreement":null},{"id":"W4411772259","doi":"10.1007/978-3-031-97548-6_18","title":"Purely Automatic Sequences with the Uniform Distribution Property","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Property (philosophy); Distribution (mathematics); Theoretical computer science; Mathematics; Mathematical analysis","score_opus":0.009956550483565524,"score_gpt":0.21527595654168058,"score_spread":0.20531940605811505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411772259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11498738,0.0014213421,0.6192109,0.00080534915,0.0008553437,0.00006860434,0.00044421435,0.0007408527,0.261466],"genre_scores_gemma":[0.81962734,0.0010877154,0.078973204,0.00050514576,0.0011607305,0.00020777177,0.0005814935,0.000381875,0.09747473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933547,0.00013811963,0.000044111894,0.00015828248,0.0002546869,0.00006936943],"domain_scores_gemma":[0.99778265,0.0013791214,0.00014271488,0.00030041562,0.00026556174,0.00012944642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051736145,0.00044554428,0.00042376172,0.0009456443,0.0008141607,0.0015107782,0.0005924242,0.0007485831,0.00855099],"category_scores_gemma":[0.003522553,0.00039563008,0.00040556237,0.0009741644,0.0015286308,0.0032714629,0.0012369362,0.0011908408,0.0017437398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022240725,0.000009570544,0.00006560996,0.000032554515,0.0000023733849,0.000055594315,0.000063834574,0.0005730363,0.0017867534,0.9819436,0.0011562267,0.014288528],"study_design_scores_gemma":[0.0000115251105,0.000024250681,0.00015956284,0.000012634739,0.000004030637,0.0002835921,0.000022339562,0.0060188165,0.0019118658,0.9821791,0.0093620885,0.000010300172],"about_ca_topic_score_codex":0.00022356851,"about_ca_topic_score_gemma":0.00022283877,"teacher_disagreement_score":0.00855099,"about_ca_system_score_codex":0.0004355639,"about_ca_system_score_gemma":0.00046810068,"threshold_uncertainty_score":0.028605938},"labels":[],"label_agreement":null},{"id":"W4411772264","doi":"10.1007/978-3-031-97548-6_3","title":"Avoiding Abelian and Additive Powers in Rich Words","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University; University of Victoria","funders":"","keywords":"Computer science; Abelian group; Algebra over a field; Artificial intelligence; Theoretical computer science; Mathematics; Pure mathematics","score_opus":0.008010118868852199,"score_gpt":0.22909934543379187,"score_spread":0.22108922656493968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411772264","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40888205,0.0020887086,0.17709818,0.00152429,0.0005892594,0.00008393523,0.0002620097,0.0005466483,0.40892497],"genre_scores_gemma":[0.9158963,0.0006160179,0.013323733,0.00020293666,0.00028655143,0.00007410365,0.00013351384,0.00020651655,0.069260344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993055,0.00020469713,0.000052227766,0.000106539555,0.00016599691,0.00016516141],"domain_scores_gemma":[0.99841094,0.00090448564,0.00012915615,0.00023581287,0.00015970544,0.00015991347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006398991,0.00066489837,0.0007754165,0.0014760443,0.001886566,0.003257835,0.00073795684,0.0009069844,0.008251341],"category_scores_gemma":[0.0022856023,0.0007239863,0.00082620606,0.0011753181,0.0037554475,0.007398047,0.0031332239,0.002134052,0.0015326228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020124276,0.000006796249,0.000048980706,0.00001858708,0.0000026552354,0.000058296864,0.00032418343,0.00015782738,0.00050041045,0.99643743,0.0003258153,0.0020988693],"study_design_scores_gemma":[0.00000588164,0.000007751085,0.000050581566,0.0000062284566,0.000005261509,0.00010809088,0.00013061808,0.00037451394,0.00041853468,0.9957724,0.0031151315,0.000004918064],"about_ca_topic_score_codex":0.00036192735,"about_ca_topic_score_gemma":0.0005574315,"teacher_disagreement_score":0.008251341,"about_ca_system_score_codex":0.0007365802,"about_ca_system_score_gemma":0.00030223312,"threshold_uncertainty_score":0.027603507},"labels":[],"label_agreement":null},{"id":"W4411806180","doi":"10.1007/978-3-031-97100-6_15","title":"Small Balanced Vertex Separators in NFA to Regular Expression Conversion","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Vertex (graph theory); Expression (computer science); Parallel computing; Algorithm; Arithmetic; Theoretical computer science; Programming language; Mathematics; Graph","score_opus":0.010585043622686908,"score_gpt":0.2266176578072556,"score_spread":0.21603261418456868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411806180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0926041,0.00071332994,0.824858,0.00049952423,0.000288847,0.00015885016,0.00037443262,0.004059367,0.07644354],"genre_scores_gemma":[0.6909435,0.0005859664,0.24854003,0.0003272704,0.00012398539,0.00035200204,0.0007883303,0.0021991003,0.056139857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992125,0.00019196469,0.000058962916,0.00022075644,0.00020685431,0.000108909895],"domain_scores_gemma":[0.9984536,0.00081581983,0.000054132364,0.00045879342,0.00015260268,0.000065048225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006435494,0.0005306355,0.00081583153,0.0007883782,0.0010244426,0.0021982694,0.0013625713,0.00085381296,0.011985309],"category_scores_gemma":[0.0028644728,0.0005626831,0.00085722574,0.0011163077,0.001452905,0.0038112812,0.0023269684,0.0019353974,0.003057097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032833178,0.00011681925,0.00030310205,0.00023785056,0.000029137655,0.0002949722,0.00062117196,0.0126303965,0.016609116,0.8117496,0.0044344384,0.15264516],"study_design_scores_gemma":[0.000036772577,0.000036657417,0.00010992763,0.000063180574,0.000032678956,0.00019587677,0.00009278427,0.04071236,0.014699868,0.92145944,0.022538599,0.000021927879],"about_ca_topic_score_codex":0.0006819132,"about_ca_topic_score_gemma":0.0011686038,"teacher_disagreement_score":0.011985309,"about_ca_system_score_codex":0.0010482246,"about_ca_system_score_gemma":0.0005577022,"threshold_uncertainty_score":0.040094852},"labels":[],"label_agreement":null},{"id":"W4412648270","doi":"10.55016/ojs/cdm.v13i1.62475","title":"String C-groups of order 1024","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Council of the Philippines; Commission on Higher Education","keywords":"Mathematics; Combinatorics; Order (exchange); String (physics); Mathematical physics","score_opus":0.01049363309361958,"score_gpt":0.2827691279041704,"score_spread":0.27227549481055086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648270","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89828295,0.00036946437,0.032573637,0.0004611369,0.00020685748,0.000037740803,0.00015202019,0.0002775532,0.067638636],"genre_scores_gemma":[0.98162985,0.00011109984,0.00965238,0.00006210528,0.00008031258,0.000020252977,0.00015796708,0.00006031609,0.008225797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994925,0.000072281866,0.00002981684,0.00009866333,0.00014951391,0.00015718915],"domain_scores_gemma":[0.99910337,0.00026727136,0.00015543573,0.00016945228,0.00011317014,0.00019133915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003470206,0.00044338222,0.0004289342,0.0012762947,0.0012392215,0.001083647,0.00044987234,0.00052524277,0.008530954],"category_scores_gemma":[0.0020227423,0.00014718076,0.00047429377,0.0005424013,0.0018309836,0.0026948652,0.0016445458,0.0010906787,0.0011406787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002732701,0.00006961137,0.0025052426,0.0001123813,0.000010998877,0.00047143947,0.0009808791,0.0021536679,0.011378971,0.94322807,0.0016158748,0.037199616],"study_design_scores_gemma":[0.00003250398,0.0001672558,0.0015750852,0.000052165004,0.000018646608,0.00083294266,0.0005552234,0.008710018,0.013402372,0.95859253,0.016004173,0.00005701853],"about_ca_topic_score_codex":0.00049172045,"about_ca_topic_score_gemma":0.00057721575,"teacher_disagreement_score":0.008530954,"about_ca_system_score_codex":0.0006468324,"about_ca_system_score_gemma":0.00067024544,"threshold_uncertainty_score":0.028538823},"labels":[],"label_agreement":null},{"id":"W4412656973","doi":"10.1016/j.ejc.2025.104224","title":"Stability properties for subgroups generated by return words","year":2025,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Mathematics; Combinatorics; Stability (learning theory)","score_opus":0.019218019895092715,"score_gpt":0.22186009486592484,"score_spread":0.20264207497083211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412656973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8571551,0.00048801248,0.12513456,0.0005045022,0.00005249586,0.00009005672,0.00036953684,0.0004137835,0.015791932],"genre_scores_gemma":[0.987976,0.00015670476,0.0062149637,0.00007557236,0.000114783965,0.000083700776,0.00041381555,0.00008214435,0.00488226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991855,0.00013846012,0.00007303869,0.00024726582,0.0002258831,0.00012988555],"domain_scores_gemma":[0.99644756,0.0019687677,0.00046689296,0.00035215047,0.00046314232,0.00030134933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071864045,0.0003653087,0.00046546786,0.0015346593,0.0010005969,0.002176027,0.00044323833,0.0006676726,0.0041449564],"category_scores_gemma":[0.004233909,0.00020638804,0.00077782985,0.00054183416,0.0019887167,0.0029810185,0.0013137751,0.0009069683,0.0009347746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028772868,0.00008057834,0.005391645,0.00010987736,0.000035639754,0.00057199446,0.0028388475,0.0051715993,0.033924233,0.9328241,0.0009351434,0.017828612],"study_design_scores_gemma":[0.000048112342,0.00020579399,0.0020773713,0.00002847948,0.00004190179,0.0006172457,0.00072353345,0.029664177,0.025228452,0.9356071,0.0057072146,0.000050648057],"about_ca_topic_score_codex":0.0003592039,"about_ca_topic_score_gemma":0.00018904495,"teacher_disagreement_score":0.0041449564,"about_ca_system_score_codex":0.00071725255,"about_ca_system_score_gemma":0.00030549508,"threshold_uncertainty_score":0.013866305},"labels":[],"label_agreement":null},{"id":"W4412755235","doi":"10.1007/978-3-031-97274-4_2","title":"Binary Right-Distinguishability Operation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Computer science; Binary number; Arithmetic; Mathematics","score_opus":0.01011225097890231,"score_gpt":0.2407523893566184,"score_spread":0.2306401383777161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412755235","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016948579,0.002004674,0.1633766,0.0022961905,0.0035098975,0.000058959205,0.000574124,0.00094896834,0.810282],"genre_scores_gemma":[0.41949397,0.002440031,0.052107472,0.0015483496,0.0018896717,0.00013765063,0.0009340847,0.00095715467,0.5204916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934596,0.000094872215,0.000043925633,0.00018932337,0.00021457956,0.00011130299],"domain_scores_gemma":[0.9993523,0.00025266144,0.000028809047,0.00016433156,0.00013150624,0.00007036149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057548756,0.00048821676,0.00045652717,0.0008936815,0.0012230625,0.0024298457,0.00056836865,0.0006861074,0.03350931],"category_scores_gemma":[0.0010438497,0.000250376,0.00042962437,0.0006755927,0.0026121817,0.0054722712,0.001981719,0.0028566576,0.009976489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004172688,0.000018962484,0.000032129537,0.000052827458,0.0000025053776,0.000041380918,0.00011753079,0.000082859646,0.004873879,0.9570947,0.0062563973,0.03138506],"study_design_scores_gemma":[0.00001771376,0.00003835675,0.0002712785,0.000042466367,0.0000116814035,0.0004827696,0.000095508876,0.00080391916,0.01816308,0.74248314,0.23756218,0.000027884593],"about_ca_topic_score_codex":0.00025571176,"about_ca_topic_score_gemma":0.00027396475,"teacher_disagreement_score":0.03350931,"about_ca_system_score_codex":0.00067843904,"about_ca_system_score_gemma":0.00054228964,"threshold_uncertainty_score":0.11209983},"labels":[],"label_agreement":null},{"id":"W4413160469","doi":"10.1016/j.ic.2025.105337","title":"Existential and universal width of alternating finite automata","year":2025,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; Yonsei University","keywords":"Existentialism; Automaton; Finite-state machine; Mathematics; Computer science; Philosophy; Algorithm; Theoretical computer science; Epistemology","score_opus":0.006225159939000734,"score_gpt":0.2358706380819668,"score_spread":0.22964547814296604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413160469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5371708,0.0024714014,0.41834015,0.0018879086,0.000249651,0.00006960149,0.0012166979,0.0010136161,0.037580077],"genre_scores_gemma":[0.96385205,0.00048730592,0.030044693,0.0001914959,0.00019458165,0.00010500117,0.0004146197,0.00026265657,0.0044474984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970829,0.00069033005,0.00036739858,0.0008920871,0.00044719398,0.0005201382],"domain_scores_gemma":[0.9813467,0.013006074,0.0011268513,0.0021341639,0.0011128499,0.0012733374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036165027,0.0008972004,0.0014636382,0.0021923282,0.0018755185,0.0059490805,0.0025914514,0.0014716071,0.0067922603],"category_scores_gemma":[0.01891855,0.0014258329,0.001620407,0.0019144007,0.00494122,0.018954454,0.004840485,0.0043771383,0.00071981625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023326035,0.000041234587,0.0008407689,0.00009658534,0.00002371433,0.00006996081,0.0011045692,0.0018402862,0.0019794917,0.9853365,0.00048201755,0.007951594],"study_design_scores_gemma":[0.000022230943,0.000025491572,0.00040247975,0.00003541045,0.000044136144,0.00009389357,0.00022342858,0.008585792,0.0015765054,0.9876488,0.0013179202,0.000023834586],"about_ca_topic_score_codex":0.0010205178,"about_ca_topic_score_gemma":0.0008882623,"teacher_disagreement_score":0.0067922603,"about_ca_system_score_codex":0.001489065,"about_ca_system_score_gemma":0.0010332828,"threshold_uncertainty_score":0.022722304},"labels":[],"label_agreement":null},{"id":"W4413290211","doi":"10.1007/978-3-032-01475-7_9","title":"Left Quotients of Deterministic Context-Free Languages","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Quotient; Context-free language; Programming language; Context (archaeology); Theoretical computer science; Natural language processing; Mathematics; Combinatorics; Rule-based machine translation; History","score_opus":0.009272351827042124,"score_gpt":0.24334797840927214,"score_spread":0.23407562658223002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413290211","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45321807,0.0034185934,0.3487379,0.0012806248,0.0005593955,0.0001371023,0.0007152615,0.0018750364,0.19005802],"genre_scores_gemma":[0.93890846,0.00038983044,0.02086362,0.00018415043,0.00017555927,0.00010651854,0.00032243333,0.00044172566,0.0386077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888986,0.00025267364,0.00008224465,0.00021486284,0.00035252442,0.00020785794],"domain_scores_gemma":[0.9981041,0.0010254227,0.00012656105,0.00022218406,0.00028179525,0.0002398756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008619689,0.000453964,0.00071156764,0.0008961397,0.0010829701,0.0029871757,0.0007642567,0.00051573495,0.009614101],"category_scores_gemma":[0.0028087504,0.000492775,0.00066460785,0.00043061908,0.002347862,0.0041010412,0.0021893303,0.0015056625,0.00148504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086419255,0.000019497691,0.00016838778,0.000042920725,0.000004870259,0.00011183504,0.0005283679,0.0006900564,0.0034587837,0.9872121,0.00061052496,0.007066275],"study_design_scores_gemma":[0.000022977623,0.00003293757,0.0001768581,0.000017375894,0.000009269132,0.00014501365,0.00015505674,0.0059396913,0.0041427705,0.98162353,0.0077184783,0.000016177897],"about_ca_topic_score_codex":0.00076231605,"about_ca_topic_score_gemma":0.0007133561,"teacher_disagreement_score":0.009614101,"about_ca_system_score_codex":0.0012708433,"about_ca_system_score_gemma":0.00055699464,"threshold_uncertainty_score":0.032162428},"labels":[],"label_agreement":null},{"id":"W4413302136","doi":"10.1007/978-3-032-01475-7_5","title":"Relativized Codes, Finite Decodability, and Bounded Languages","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Bounded function; Programming language; Theoretical computer science; Algorithm; Mathematics","score_opus":0.010051892593447598,"score_gpt":0.25190771235810155,"score_spread":0.24185581976465395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413302136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18343556,0.023633378,0.437872,0.009190352,0.0016008229,0.00009968194,0.00073337543,0.0009553933,0.3424794],"genre_scores_gemma":[0.91182536,0.00520638,0.03158336,0.0009298124,0.0010682992,0.00018879335,0.0005129754,0.00026111238,0.048423927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781847,0.0006570088,0.000118528435,0.00041675504,0.0006972178,0.00029212644],"domain_scores_gemma":[0.9935248,0.004111974,0.00033558425,0.0014038628,0.00045851347,0.00016537288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014873459,0.0006466977,0.0011398081,0.001325617,0.0019177619,0.0039256285,0.0015394966,0.002131228,0.005475285],"category_scores_gemma":[0.007531685,0.00058204896,0.00095252745,0.0019131884,0.008943088,0.009336015,0.002916646,0.0057940357,0.001013966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000103466855,0.0000051676407,0.000029866324,0.000019318526,0.0000023101202,0.00001307855,0.00011061248,0.000655631,0.00017994152,0.9956298,0.0007207126,0.002623126],"study_design_scores_gemma":[0.0000025031422,0.000004568569,0.000020886462,0.000008745453,0.0000021496726,0.000019024234,0.000021937934,0.0010062562,0.00016185903,0.99715436,0.0015916086,0.0000061253954],"about_ca_topic_score_codex":0.0017376819,"about_ca_topic_score_gemma":0.0010541179,"teacher_disagreement_score":0.005475285,"about_ca_system_score_codex":0.0024545745,"about_ca_system_score_gemma":0.0011974741,"threshold_uncertainty_score":0.018316627},"labels":[],"label_agreement":null},{"id":"W4413333548","doi":"10.1007/s00224-025-10234-x","title":"The Reflection Complexity of Sequences Over Finite Alphabets","year":2025,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts; Fonds De La Recherche Scientifique - FNRS","keywords":"Reflection (computer programming); Computer science; Mathematics; Theoretical computer science; Programming language","score_opus":0.03375936000535939,"score_gpt":0.29392277937979244,"score_spread":0.26016341937443305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413333548","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7187889,0.0017777142,0.21339686,0.006485556,0.00022573314,0.000067053326,0.00065488263,0.0004841099,0.058119252],"genre_scores_gemma":[0.9805895,0.00075366127,0.0107388375,0.00023830151,0.0003414081,0.0000964932,0.00042623995,0.00013934259,0.00667625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99686986,0.0010113218,0.00018961514,0.0005572756,0.0008592787,0.00051261013],"domain_scores_gemma":[0.9632167,0.030147562,0.0020220822,0.0022745125,0.0011192112,0.0012199985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002491233,0.0007788479,0.0018136089,0.0021196797,0.0014003824,0.0070140637,0.0026455126,0.0019647211,0.009325194],"category_scores_gemma":[0.021469008,0.00080543675,0.0012415661,0.002150982,0.0054878066,0.017776243,0.0029775894,0.004786578,0.001006066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017902085,0.000055983885,0.00071942376,0.000092394024,0.000017759694,0.00010019152,0.0005270343,0.0124396235,0.0015467894,0.97597706,0.0012255772,0.0071192496],"study_design_scores_gemma":[0.000020922484,0.00002723944,0.0002587148,0.000016079197,0.000010128302,0.000065578875,0.00008074028,0.027451776,0.0006188843,0.97081393,0.0006173466,0.00001871013],"about_ca_topic_score_codex":0.0010280797,"about_ca_topic_score_gemma":0.0005414271,"teacher_disagreement_score":0.009325194,"about_ca_system_score_codex":0.002679051,"about_ca_system_score_gemma":0.001468203,"threshold_uncertainty_score":0.031195939},"labels":[],"label_agreement":null},{"id":"W4413433805","doi":"10.1007/978-3-032-02602-6_17","title":"Self-verifying Predicates in Büchi Arithmetic","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Arithmetic; Programming language; Theoretical computer science; Mathematics","score_opus":0.008840546809535327,"score_gpt":0.2269995450683038,"score_spread":0.21815899825876847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413433805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09044567,0.003046903,0.51743984,0.0019258258,0.00078733684,0.00011030326,0.0005834164,0.0015896468,0.3840711],"genre_scores_gemma":[0.81336033,0.0019220113,0.09088637,0.00037942306,0.0005287356,0.0001494739,0.00066592405,0.00053907145,0.09156877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959666,0.00009855211,0.00003335274,0.000075603464,0.0001367967,0.00005903612],"domain_scores_gemma":[0.99905604,0.00064316974,0.000042153075,0.00015057898,0.00007924828,0.00002882653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076658675,0.0003828895,0.0005150806,0.000725983,0.0010604585,0.0020140354,0.00067167485,0.0005904146,0.007706003],"category_scores_gemma":[0.0015556797,0.00057188096,0.0006170336,0.0013454662,0.0024528601,0.0070208185,0.0012485791,0.0022151552,0.0015358676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017784334,0.000007285671,0.00003370827,0.00003256352,0.0000018961201,0.00001820545,0.00013932225,0.0005443613,0.00058983226,0.9867264,0.0013780493,0.01051063],"study_design_scores_gemma":[0.0000056415865,0.000009693602,0.000050599298,0.000011104521,0.000004229111,0.000045472163,0.000035023884,0.0019130025,0.0013402015,0.9873653,0.009214831,0.000005093435],"about_ca_topic_score_codex":0.0003114945,"about_ca_topic_score_gemma":0.00036945366,"teacher_disagreement_score":0.007706003,"about_ca_system_score_codex":0.0008403306,"about_ca_system_score_gemma":0.0005150518,"threshold_uncertainty_score":0.025779188},"labels":[],"label_agreement":null},{"id":"W4413470498","doi":"10.1007/978-3-031-84869-8_2","title":"On Constructing Finite Automata by Relational Programming","year":2025,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Programming language; Automaton; Theoretical computer science","score_opus":0.014394458148780332,"score_gpt":0.23842962934714856,"score_spread":0.22403517119836824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413470498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071684998,0.0010408697,0.9611593,0.0007806105,0.00014890402,0.000079150304,0.00018940438,0.0017901536,0.027643137],"genre_scores_gemma":[0.16024622,0.0020694644,0.8112566,0.00060537877,0.0002501936,0.00030311113,0.0009995525,0.0019308598,0.022338688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985617,0.00044685465,0.00011057886,0.00036407047,0.00038437793,0.00013245897],"domain_scores_gemma":[0.99729246,0.0019221469,0.000056264587,0.0005382988,0.00013022135,0.000060687427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014235685,0.0011361144,0.0014120721,0.0010935164,0.0015344117,0.0035465676,0.0025501482,0.0010512453,0.015362752],"category_scores_gemma":[0.0048981626,0.0014010686,0.0028869181,0.0021811144,0.004354383,0.00885101,0.00380162,0.004125183,0.0040594013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003368225,0.000039749735,0.00015451941,0.00023117756,0.000020122105,0.00004960952,0.00058606715,0.008242812,0.0017906993,0.90893537,0.0041935607,0.07572271],"study_design_scores_gemma":[0.000013473744,0.000012439258,0.00007001726,0.000049850885,0.000016130805,0.00004092238,0.00007896509,0.015005863,0.001556331,0.9693959,0.013742663,0.00001747936],"about_ca_topic_score_codex":0.0024314842,"about_ca_topic_score_gemma":0.0030059903,"teacher_disagreement_score":0.015362752,"about_ca_system_score_codex":0.0015535428,"about_ca_system_score_gemma":0.00091180013,"threshold_uncertainty_score":0.05139351},"labels":[],"label_agreement":null},{"id":"W4413477173","doi":"10.1007/978-3-031-84869-8_3","title":"Skeleton Key: Subduction Classes in Finite Transformation Semigroups and Green’s Relations","year":2025,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Transformation (genetics); Key (lock); Subduction; Skeleton (computer programming); Geology; Pure mathematics; Computer science; Mathematics; Paleontology; Chemistry; Tectonics; Programming language; Computer security","score_opus":0.011172413936260332,"score_gpt":0.22784367110798887,"score_spread":0.21667125717172853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413477173","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058486857,0.0069447323,0.2846084,0.0075047864,0.0026032827,0.00017256901,0.0014036527,0.0011213009,0.6371545],"genre_scores_gemma":[0.64259213,0.0050894916,0.06430854,0.0011824899,0.0023241846,0.00023033732,0.0017743101,0.0010560732,0.28144237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971515,0.0000504418,0.000019454095,0.000091222704,0.000083226514,0.000040593175],"domain_scores_gemma":[0.9994962,0.00026571605,0.00003488988,0.000080068414,0.00007453652,0.000048511367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000511352,0.00063532236,0.00075578975,0.0014917289,0.0014068639,0.0030265497,0.00071066566,0.0009758278,0.024779024],"category_scores_gemma":[0.0012602973,0.00040784516,0.00075386703,0.0025495065,0.0030708045,0.007627044,0.0013535408,0.003048474,0.0041260878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012019773,0.0000052606533,0.000022271326,0.0000244542,0.0000010979572,0.000017903192,0.00014338345,0.00008637746,0.00037360177,0.9875329,0.0039682565,0.0078124525],"study_design_scores_gemma":[0.0000046145906,0.0000055299624,0.00008870989,0.000010178863,0.0000024476233,0.00007294906,0.000044893688,0.00035928088,0.00027226476,0.9766618,0.022473052,0.000004320619],"about_ca_topic_score_codex":0.0009359541,"about_ca_topic_score_gemma":0.00077622005,"teacher_disagreement_score":0.024779024,"about_ca_system_score_codex":0.0015752113,"about_ca_system_score_gemma":0.0005441129,"threshold_uncertainty_score":0.08289409},"labels":[],"label_agreement":null},{"id":"W4413477249","doi":"10.1007/978-3-031-84869-8_4","title":"The Attractor-Cycle Notation for Finite Transformations","year":2025,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Notation; Attractor; Computer science; Algebra over a field; Mathematics; Pure mathematics; Arithmetic; Mathematical analysis","score_opus":0.014884106416907796,"score_gpt":0.25057014519092946,"score_spread":0.23568603877402167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413477249","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008692446,0.009838889,0.60759705,0.0018651275,0.0035307158,0.00008647445,0.00078349275,0.0010049084,0.3666009],"genre_scores_gemma":[0.4554807,0.01333575,0.30285546,0.0022990035,0.0051402994,0.0007923741,0.0026108003,0.002441919,0.21504366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954164,0.00016885973,0.00004355211,0.00010088327,0.0000987692,0.00004630822],"domain_scores_gemma":[0.99961877,0.00013064193,0.00003716707,0.00010183548,0.00007727636,0.00003428294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006938408,0.0011580184,0.0006857361,0.0022565757,0.0010468554,0.0036503042,0.0012278424,0.00111553,0.01665515],"category_scores_gemma":[0.0013631994,0.00044318993,0.00078408973,0.0031306883,0.0025395283,0.0046558785,0.001330116,0.0032715779,0.007222564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036782083,0.0000030565448,0.000013180626,0.00002405849,0.0000018063874,0.000025295789,0.00010726433,0.00017568422,0.00038256778,0.9862628,0.0046520354,0.008348586],"study_design_scores_gemma":[0.0000031009624,0.000007499354,0.000031527063,0.000018726558,0.0000032615635,0.00007952979,0.000033311062,0.0016830973,0.0003484141,0.92737114,0.070412636,0.000007754517],"about_ca_topic_score_codex":0.0006408472,"about_ca_topic_score_gemma":0.00055312837,"teacher_disagreement_score":0.01665515,"about_ca_system_score_codex":0.0009201983,"about_ca_system_score_gemma":0.00044126975,"threshold_uncertainty_score":0.05571699},"labels":[],"label_agreement":null},{"id":"W4413876139","doi":"10.1017/s0004972725100440","title":"RUNS IN PAPERFOLDING SEQUENCES","year":2025,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics","score_opus":0.014247800964222474,"score_gpt":0.25413000553046466,"score_spread":0.23988220456624218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413876139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85752165,0.0008568733,0.12316775,0.00037942777,0.00012169359,0.00006167378,0.00034296687,0.0007303649,0.016817626],"genre_scores_gemma":[0.9801354,0.0001685631,0.013452866,0.00007473412,0.00007194688,0.00006987843,0.00024336785,0.00009771095,0.0056855287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999027,0.00018252205,0.00009988515,0.00034288716,0.00021141916,0.00013628772],"domain_scores_gemma":[0.99517727,0.0026205226,0.0006996622,0.0005185429,0.0005004597,0.00048339277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005963597,0.00038732286,0.0005806548,0.0013124077,0.0009807551,0.0018721287,0.00053229474,0.00080508535,0.0049336553],"category_scores_gemma":[0.0048902016,0.0003518075,0.00054928387,0.00073089544,0.0018612896,0.0030668627,0.0012318915,0.00096156466,0.00071361003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043206656,0.00009248497,0.008067714,0.00026991864,0.000040059993,0.0015526593,0.0030115594,0.024651509,0.02988655,0.89990455,0.001545781,0.030545177],"study_design_scores_gemma":[0.000027468177,0.00016022605,0.0029820495,0.00008607033,0.000023564631,0.0007430599,0.00046308877,0.050532293,0.012103001,0.9233252,0.009491509,0.00006246684],"about_ca_topic_score_codex":0.0004862649,"about_ca_topic_score_gemma":0.00039734872,"teacher_disagreement_score":0.0049336553,"about_ca_system_score_codex":0.0007711268,"about_ca_system_score_gemma":0.00034744118,"threshold_uncertainty_score":0.016504705},"labels":[],"label_agreement":null},{"id":"W4413966079","doi":"10.70930/tac/adc8tpfc","title":"Finitely presentable morphisms in exact sequences","year":2010,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Morphism; Mathematics; Pure mathematics; Finitely-generated abelian group","score_opus":0.00910223455600371,"score_gpt":0.24638602555346836,"score_spread":0.23728379099746466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413966079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6098713,0.0043184897,0.28003082,0.001981651,0.00046345234,0.00009984793,0.00071502145,0.0008807055,0.101638645],"genre_scores_gemma":[0.9428713,0.00093112816,0.034299597,0.00020368483,0.00023804903,0.00012481617,0.0005940175,0.00005297528,0.02068445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987483,0.00023556546,0.000120950455,0.0002755429,0.00037579835,0.00024385082],"domain_scores_gemma":[0.9971934,0.0013385674,0.00029375567,0.00021338026,0.0005664887,0.00039448257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011242641,0.0004265944,0.0004158478,0.0024307405,0.0013907758,0.0027919873,0.0007264944,0.0011244954,0.0064209164],"category_scores_gemma":[0.003295519,0.00038689922,0.0005111758,0.0015458858,0.0031970583,0.006219258,0.003186095,0.0016967295,0.0011566095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008635189,0.000047938374,0.0011791523,0.00013009668,0.000015619846,0.0005400435,0.002024499,0.0008604637,0.0042826934,0.97377557,0.00077995803,0.016277665],"study_design_scores_gemma":[0.000017416092,0.000058034882,0.0013648211,0.000047599086,0.000017259857,0.0007062481,0.0007478446,0.0022355695,0.0026673474,0.9795617,0.012543877,0.00003237727],"about_ca_topic_score_codex":0.00057249964,"about_ca_topic_score_gemma":0.00055904983,"teacher_disagreement_score":0.0064209164,"about_ca_system_score_codex":0.0009787948,"about_ca_system_score_gemma":0.0004179127,"threshold_uncertainty_score":0.021480083},"labels":[],"label_agreement":null},{"id":"W4414163255","doi":"10.1080/00029890.2025.2545706","title":"A Lebesgue Integral Variant of the Additive Square Problem","year":2025,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lebesgue integration; Square (algebra); Riemann integral; Lebesgue–Stieltjes integration; Lebesgue measure; Mean square","score_opus":0.0049397729517786605,"score_gpt":0.2273676459635397,"score_spread":0.22242787301176103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414163255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081853874,0.0015890395,0.85162556,0.008920886,0.00093725487,0.000065286666,0.00018904751,0.00026662412,0.05455244],"genre_scores_gemma":[0.8076651,0.0023286485,0.14682943,0.0029677884,0.0025652905,0.00016875406,0.00039889745,0.00022783854,0.03684815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978655,0.00053010654,0.000097069766,0.00058790005,0.0006720256,0.0002474373],"domain_scores_gemma":[0.99226004,0.005873994,0.00031532597,0.0004970937,0.0006982382,0.0003552965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021898097,0.0006279884,0.0010729249,0.0008777839,0.001647598,0.0025582719,0.0013747822,0.00170466,0.0061500655],"category_scores_gemma":[0.01339118,0.00043578882,0.0012563147,0.001368686,0.005644694,0.008812967,0.0048098667,0.006081959,0.0008651979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028286328,0.00001709877,0.00018663406,0.000054011387,0.00001406273,0.00010535366,0.00018401869,0.002190409,0.00064988947,0.9848958,0.0026332592,0.009041152],"study_design_scores_gemma":[0.000012819992,0.000014689842,0.0000959757,0.000010582593,0.00001048079,0.00014243403,0.00008294716,0.012017959,0.0007051027,0.98227453,0.004619537,0.000013013808],"about_ca_topic_score_codex":0.00081671594,"about_ca_topic_score_gemma":0.00047076898,"teacher_disagreement_score":0.0061500655,"about_ca_system_score_codex":0.00096892496,"about_ca_system_score_gemma":0.0010669607,"threshold_uncertainty_score":0.020574033},"labels":[],"label_agreement":null},{"id":"W4414533853","doi":"10.5539/jmr.v17n3p1","title":"On the Palindromic Complexity of Words by Substitution of Letter Power in Modulo-recurrent Words","year":2025,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Palindrome; Word (group theory); Substitution (logic); Integer (computer science); Power (physics); Word length; Combinatorics on words","score_opus":0.08914577765917518,"score_gpt":0.3731454157720771,"score_spread":0.2839996381129019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414533853","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85943174,0.00083482516,0.114350885,0.00041888724,0.000052400246,0.00004679355,0.00014341937,0.00012126679,0.024599938],"genre_scores_gemma":[0.98057747,0.00039900537,0.014396395,0.000064743625,0.00013403298,0.00006430678,0.00011898413,0.00004949426,0.004195405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992895,0.00016668701,0.000047860674,0.00013908943,0.00021779555,0.00013908399],"domain_scores_gemma":[0.99724305,0.0017098016,0.00038774466,0.00020645131,0.00026284624,0.00019004644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076709286,0.0005180543,0.0005512625,0.0015872477,0.00093641615,0.001965521,0.0006692462,0.0006476093,0.0039045063],"category_scores_gemma":[0.004211507,0.0003134939,0.00077551807,0.001034283,0.002296987,0.0037588354,0.0011758293,0.0010309279,0.00046631633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110623005,0.000033810775,0.0012378519,0.00010121544,0.000015383966,0.0002559065,0.00093528454,0.008606641,0.007818355,0.96864575,0.00046576868,0.011773334],"study_design_scores_gemma":[0.000023721672,0.00011274071,0.0017673183,0.000028196144,0.000022730623,0.0003444405,0.00018442814,0.039826255,0.0052958457,0.94915575,0.0031930332,0.000045707755],"about_ca_topic_score_codex":0.00069207954,"about_ca_topic_score_gemma":0.0006129278,"teacher_disagreement_score":0.0039045063,"about_ca_system_score_codex":0.0012969441,"about_ca_system_score_gemma":0.00042827337,"threshold_uncertainty_score":0.013061821},"labels":[],"label_agreement":null},{"id":"W4414699161","doi":"10.4230/lipics.itcs.2026.9","title":"On Closure Properties of Read-Once Oblivious Algebraic Branching Programs","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Université Savoie Mont Blanc; Bhabha Atomic Research Centre; Agence Nationale de la Recherche; Villum Fonden","keywords":"Symmetric polynomial; Polynomial; Branching (polymer chemistry); Difference polynomials; Algebraic number; Elementary symmetric polynomial; Exponential function; Sequence (biology); Lift (data mining)","score_opus":0.04169909323450253,"score_gpt":0.2504516048642412,"score_spread":0.20875251162973865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414699161","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7703826,0.00074677495,0.20978907,0.0015781006,0.000058201116,0.00020527784,0.0005922993,0.0011485027,0.015499158],"genre_scores_gemma":[0.9676362,0.00038437484,0.028189225,0.00026782363,0.00009739649,0.00021806825,0.0006222266,0.00026647057,0.0023181003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99600214,0.00072766526,0.00024366088,0.00095315697,0.0010680029,0.0010054209],"domain_scores_gemma":[0.96919346,0.02195038,0.0029996303,0.0026795731,0.0013733617,0.0018034793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004052742,0.00074692845,0.0014498588,0.0010936289,0.0018932745,0.0040144646,0.001786294,0.0011195558,0.0034727643],"category_scores_gemma":[0.025422841,0.00056527974,0.0022167799,0.0011526122,0.006079069,0.011907568,0.003973134,0.0047412557,0.00031078974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001453605,0.00067260856,0.0074895215,0.0004149296,0.00009137191,0.0012132578,0.0035103683,0.042499043,0.026420576,0.88123375,0.0013825679,0.033618405],"study_design_scores_gemma":[0.00022151266,0.00043726157,0.001564801,0.000091330236,0.00008861288,0.00068990095,0.00056257565,0.114588566,0.015519752,0.86334944,0.0028139355,0.00007228214],"about_ca_topic_score_codex":0.001957249,"about_ca_topic_score_gemma":0.00091400254,"teacher_disagreement_score":0.004052742,"about_ca_system_score_codex":0.003150421,"about_ca_system_score_gemma":0.0019395448,"threshold_uncertainty_score":0.022857964},"labels":[],"label_agreement":null},{"id":"W4415311421","doi":"10.48550/arxiv.2506.14072","title":"A generalization of Deterministic Finite Automata related to discharging","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Killam Trusts","keywords":"Generalization; Deterministic finite automaton; Finite-state machine; Büchi automaton; Vertex (graph theory); State (computer science); Automaton; String (physics); Deterministic automaton; Path (computing)","score_opus":0.025927597049094264,"score_gpt":0.28203219298740223,"score_spread":0.256104595938308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415311421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051104747,0.0008337864,0.92572826,0.000524935,0.00027800712,0.000120758195,0.0003270206,0.0009725442,0.020110017],"genre_scores_gemma":[0.6784552,0.00078230764,0.3096977,0.0005136998,0.0003014703,0.00023460278,0.00033383357,0.00024428096,0.009436967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982558,0.00030272678,0.00019756868,0.00079155696,0.0003022358,0.00015013585],"domain_scores_gemma":[0.9971681,0.0010534357,0.00026179786,0.0010166132,0.00031957217,0.00018051609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013012971,0.00042374377,0.0005468013,0.0007547141,0.0008829449,0.0018511246,0.0012074072,0.0008903298,0.0034760267],"category_scores_gemma":[0.0040265014,0.00035104767,0.0017638392,0.00067999226,0.003718119,0.0045577185,0.0017818605,0.0020098782,0.0006295183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028301827,0.000018289666,0.0003279757,0.000060253034,0.0000088336155,0.0001267337,0.00043124132,0.0075972346,0.0044855224,0.97340506,0.00041281187,0.013097695],"study_design_scores_gemma":[0.000025781068,0.000097395794,0.00026678518,0.00003952262,0.00002692185,0.00049093884,0.0000968604,0.06295617,0.0074920338,0.89923024,0.029220017,0.000057285582],"about_ca_topic_score_codex":0.0011455973,"about_ca_topic_score_gemma":0.0005373089,"teacher_disagreement_score":0.0034760267,"about_ca_system_score_codex":0.0011767335,"about_ca_system_score_gemma":0.00083999644,"threshold_uncertainty_score":0.011628449},"labels":[],"label_agreement":null},{"id":"W4415651320","doi":"10.1215/00127094-2025-0017","title":"Reciprocity obstructions in semigroup orbits in SL(2,Z)","year":2025,"lang":"","type":"article","venue":"Duke Mathematical Journal","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Semigroup; Conjecture; Reciprocity (cultural anthropology); Algebraic number; Finite set; Rational number; Congruence (geometry); Hausdorff dimension","score_opus":0.012829907226058982,"score_gpt":0.273142923055323,"score_spread":0.260313015829264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415651320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9625269,0.00016488349,0.023926813,0.00012261013,0.00003552709,0.000024922118,0.000079871104,0.00011042487,0.013007937],"genre_scores_gemma":[0.9917671,0.00007384588,0.0052299863,0.000021913651,0.000029421437,0.000026631815,0.00011904245,0.000027469707,0.00270461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996526,0.000045813274,0.000029370925,0.00006384366,0.00010475838,0.000103687606],"domain_scores_gemma":[0.99889416,0.00045032008,0.00023302341,0.0001433018,0.000094631476,0.00018451082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041420397,0.0002949096,0.0003313298,0.00090048485,0.0010777274,0.0012870868,0.00023976067,0.00033680364,0.0033078385],"category_scores_gemma":[0.0020373128,0.00020433597,0.0006151842,0.00030002595,0.0018384956,0.0012417294,0.0012771173,0.00067590177,0.00036119507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020704286,0.000044806147,0.005234497,0.00008201893,0.0000149475745,0.0012046755,0.0018818061,0.0055023907,0.013218016,0.9626425,0.0005963839,0.009370908],"study_design_scores_gemma":[0.000079703146,0.0002090192,0.00621095,0.000060083963,0.000028550458,0.0011554619,0.0009828429,0.044110335,0.011846805,0.9261914,0.009056183,0.00006865031],"about_ca_topic_score_codex":0.00094954367,"about_ca_topic_score_gemma":0.0005614929,"teacher_disagreement_score":0.0033078385,"about_ca_system_score_codex":0.0005537025,"about_ca_system_score_gemma":0.0003392046,"threshold_uncertainty_score":0.011065841},"labels":[],"label_agreement":null},{"id":"W4415937484","doi":"10.46298/dmtcs.15140","title":"On the conjugates of Christoffel words","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Christoffel symbols; Graph; Conjugate; Integer (computer science); Algebra over a field","score_opus":0.008876415764861333,"score_gpt":0.25009222166563855,"score_spread":0.2412158059007772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415937484","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4235771,0.0017735998,0.3912849,0.0009920843,0.000694705,0.00011529223,0.00034279664,0.00060209096,0.18061744],"genre_scores_gemma":[0.92061067,0.0009314677,0.047335602,0.0004544519,0.00044933282,0.0001030557,0.00028990555,0.0003680153,0.029457493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992679,0.0001742104,0.000055016437,0.00017977678,0.00019676963,0.00012629975],"domain_scores_gemma":[0.99931514,0.00024054946,0.00011951363,0.00010160067,0.00014459109,0.00007857076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054260454,0.0005519252,0.00041824533,0.001745817,0.0010375907,0.0024801902,0.00057277555,0.0007891874,0.0060260263],"category_scores_gemma":[0.0022388124,0.00027377598,0.000509483,0.0011436663,0.0024556057,0.0047773775,0.0012624598,0.0011529811,0.0014684951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001537258,0.000005291818,0.00009049807,0.000011324981,0.0000014478813,0.0000794307,0.00019350051,0.000516323,0.00109775,0.9940977,0.00023982633,0.0036515375],"study_design_scores_gemma":[0.000009992076,0.000044598204,0.0002651364,0.00002164429,0.000006995753,0.0002522755,0.00017201922,0.006046995,0.0034715103,0.9689002,0.02078112,0.000027574859],"about_ca_topic_score_codex":0.0004516483,"about_ca_topic_score_gemma":0.00028032987,"teacher_disagreement_score":0.0060260263,"about_ca_system_score_codex":0.0009413205,"about_ca_system_score_gemma":0.00037067468,"threshold_uncertainty_score":0.020159066},"labels":[],"label_agreement":null},{"id":"W4416007859","doi":"","title":"Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Abelian group; Bounded function; Equivalence (formal languages); Substitution (logic); Fixed point; Type (biology); Function (biology)","score_opus":0.04945202475005005,"score_gpt":0.3168927961153011,"score_spread":0.267440771365251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416007859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42835987,0.00018099195,0.55469096,0.0004002815,0.00004730417,0.000073301075,0.0002471947,0.0008790151,0.015121136],"genre_scores_gemma":[0.93576676,0.00008938212,0.060586896,0.000060121394,0.000053863947,0.00007986917,0.00025053255,0.00015569931,0.0029569287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987771,0.00026068708,0.00009662989,0.00027421597,0.0003865804,0.0002046693],"domain_scores_gemma":[0.99686915,0.0020515737,0.00023828865,0.0004438143,0.0002574859,0.00013967606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010091129,0.00049173663,0.00066938205,0.0018941829,0.00091242115,0.0031071792,0.00089239574,0.0006806371,0.004927797],"category_scores_gemma":[0.0058458108,0.0002959204,0.0009728043,0.0015382767,0.0026618214,0.0054624393,0.0021411097,0.0014018527,0.00052029605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010119374,0.000026642609,0.0016371825,0.00007391929,0.000016931857,0.000115471135,0.0004479673,0.011965708,0.005413087,0.9570267,0.00053926086,0.022635952],"study_design_scores_gemma":[0.000020056636,0.000054125707,0.0007847673,0.000023926576,0.000030405263,0.00013207483,0.00012303263,0.12575072,0.01645285,0.85355866,0.0030286035,0.000040764804],"about_ca_topic_score_codex":0.0008883889,"about_ca_topic_score_gemma":0.0012121727,"teacher_disagreement_score":0.004927797,"about_ca_system_score_codex":0.0027142677,"about_ca_system_score_gemma":0.0006092611,"threshold_uncertainty_score":0.019693434},"labels":[],"label_agreement":null},{"id":"W4416348003","doi":"10.1051/ita/2025016","title":"A symmetry property of Christoffel words","year":2025,"lang":"","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Christoffel symbols; Property (philosophy); Cardinality (data modeling); Symmetry (geometry); Bivariate analysis","score_opus":0.005791708219538981,"score_gpt":0.240717505541032,"score_spread":0.23492579732149302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416348003","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60756594,0.00055345695,0.3258083,0.0006556981,0.000287912,0.00011869678,0.00067816407,0.00037563537,0.06395615],"genre_scores_gemma":[0.9711274,0.0002465772,0.021020705,0.0001335896,0.00018707705,0.000070627895,0.00028411814,0.00008888647,0.006841093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893326,0.0001655292,0.000089813184,0.00027460273,0.00032369475,0.00021310023],"domain_scores_gemma":[0.997414,0.0009108484,0.0004116104,0.0004840705,0.0005150384,0.00026433181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007903734,0.00026577784,0.00048316605,0.0008029179,0.0012057027,0.001734909,0.0005610489,0.0004658352,0.0041040746],"category_scores_gemma":[0.004698419,0.00022469943,0.00061017607,0.0009389271,0.0022022172,0.003085651,0.0010437638,0.0009886684,0.00082016224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006617965,0.000021065483,0.00097378925,0.000030974537,0.000006582217,0.0001675819,0.00034671658,0.0011335736,0.006650448,0.97882515,0.0006451659,0.011132758],"study_design_scores_gemma":[0.000022333657,0.000103823186,0.0009651711,0.000020269392,0.00001491295,0.0006478261,0.0002938142,0.011827211,0.009783866,0.96731234,0.008966047,0.000042385553],"about_ca_topic_score_codex":0.0009321918,"about_ca_topic_score_gemma":0.0005467284,"teacher_disagreement_score":0.0041040746,"about_ca_system_score_codex":0.00088021613,"about_ca_system_score_gemma":0.0008144753,"threshold_uncertainty_score":0.013729513},"labels":[],"label_agreement":null},{"id":"W4416802214","doi":"10.37236/13609","title":"Word Length, Bias and Bijections in Penney's Ante","year":2025,"lang":"","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection, injection and surjection; Conjecture; Word (group theory); Simple (philosophy); Alphabet; Binary number","score_opus":0.010032848477251673,"score_gpt":0.24379329358904528,"score_spread":0.2337604451117936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416802214","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71837145,0.0008259359,0.22140393,0.0027371868,0.00018483863,0.00019979685,0.0004739047,0.00045330383,0.055349737],"genre_scores_gemma":[0.95544255,0.0003261481,0.03270052,0.00037017986,0.00013713333,0.00034657217,0.00020198531,0.00017706746,0.010297844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967777,0.0013147511,0.00018575181,0.00063614326,0.00063354714,0.0004521022],"domain_scores_gemma":[0.9783972,0.015202179,0.0022581264,0.0021571836,0.0010738588,0.0009115129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004299029,0.00044854623,0.0009589151,0.0015700206,0.0019601795,0.003394708,0.0012057981,0.0013663175,0.00841116],"category_scores_gemma":[0.034325622,0.0006722436,0.0006307644,0.0012565384,0.0041627223,0.0074012657,0.0025362195,0.0024271484,0.0013365822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015563458,0.000048079957,0.0015509007,0.00005708199,0.000012062593,0.0000922443,0.00038195623,0.0059332424,0.0014236488,0.97707635,0.00093385606,0.012334991],"study_design_scores_gemma":[0.000034272456,0.00007411999,0.00065885193,0.00002434315,0.000013628196,0.00020115111,0.0001392435,0.023172347,0.0016665035,0.9714315,0.0025505638,0.000033469754],"about_ca_topic_score_codex":0.0003954106,"about_ca_topic_score_gemma":0.00046787073,"teacher_disagreement_score":0.00841116,"about_ca_system_score_codex":0.0014630292,"about_ca_system_score_gemma":0.0010464989,"threshold_uncertainty_score":0.02813816},"labels":[],"label_agreement":null},{"id":"W4417182444","doi":"10.1017/s0963548325100242","title":"Sidorenko’s conjecture for subdivisions and theta substitutions","year":2025,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Bipartite graph; Conjecture; Line graph; Graph; Graph minor; Edge-transitive graph; Voltage graph; Homomorphism; 1-planar graph","score_opus":0.012298313793150262,"score_gpt":0.26165046518098756,"score_spread":0.24935215138783728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417182444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8257061,0.00037225737,0.12891647,0.0033862726,0.00020948067,0.000077309414,0.00041207668,0.0003189549,0.040601026],"genre_scores_gemma":[0.98484343,0.00012635125,0.010061715,0.0003583262,0.00006938025,0.00007345066,0.0002928351,0.000040293962,0.004134247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983021,0.00037452765,0.00012485309,0.000546241,0.00031859375,0.00033373854],"domain_scores_gemma":[0.9902111,0.0052351546,0.0007312075,0.0023400749,0.00071595394,0.00076663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019521324,0.0003123462,0.0010300134,0.0005842338,0.0017082992,0.0017008617,0.0012241337,0.0013974081,0.0083510345],"category_scores_gemma":[0.011019254,0.00043154307,0.0012340107,0.00071939966,0.0037543168,0.004400788,0.002467842,0.0019736728,0.00079947466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002815209,0.00007241675,0.004273528,0.000087789136,0.000015830137,0.00016707946,0.0005341803,0.008079012,0.0041164523,0.9700041,0.002175065,0.01019305],"study_design_scores_gemma":[0.00005816977,0.000059898834,0.0012388136,0.000022846705,0.000016374584,0.00021983442,0.00019143583,0.030191155,0.0020638085,0.9621136,0.003806744,0.000017272987],"about_ca_topic_score_codex":0.001285194,"about_ca_topic_score_gemma":0.0011877702,"teacher_disagreement_score":0.0083510345,"about_ca_system_score_codex":0.0014107474,"about_ca_system_score_gemma":0.0010075249,"threshold_uncertainty_score":0.027936995},"labels":[],"label_agreement":null},{"id":"W4417293759","doi":"10.48550/arxiv.2512.10017","title":"Complexity of Linear Subsequences of $k$-Automatic Sequences","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subsequence; Construct (python library); Sequence (biology); State (computer science); Base (topology); Time complexity; Automaton","score_opus":0.11134954949633394,"score_gpt":0.31482737259856325,"score_spread":0.2034778231022293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417293759","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8635123,0.000151945,0.12529677,0.0007438092,0.000044093875,0.0001085076,0.0009638297,0.0012775442,0.007901263],"genre_scores_gemma":[0.9410811,0.000094394374,0.053276453,0.00009890248,0.00004075131,0.00015663524,0.001737786,0.00025569327,0.003258293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830973,0.00027404167,0.00020565272,0.0005992026,0.00033969805,0.00027175274],"domain_scores_gemma":[0.9878248,0.008828983,0.0009896355,0.0012075934,0.00070258026,0.00044644155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093938794,0.0005260196,0.0006086746,0.0007365086,0.0010345317,0.002636552,0.0016555074,0.0009887998,0.008372057],"category_scores_gemma":[0.009310404,0.0005206587,0.0015041278,0.0009964216,0.0016893639,0.004575771,0.0013951748,0.0014943797,0.00086519873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018300959,0.00042772008,0.018122686,0.0010760333,0.00019310493,0.0008304298,0.0036304074,0.19973637,0.08227205,0.591595,0.005025258,0.09526079],"study_design_scores_gemma":[0.00007377094,0.00022856309,0.0023019875,0.000046145615,0.00007930114,0.00029605144,0.0003932837,0.32066336,0.031907056,0.64165914,0.0022830516,0.00006838957],"about_ca_topic_score_codex":0.0013399057,"about_ca_topic_score_gemma":0.0014926816,"teacher_disagreement_score":0.008372057,"about_ca_system_score_codex":0.0017070132,"about_ca_system_score_gemma":0.0012775565,"threshold_uncertainty_score":0.028007388},"labels":[],"label_agreement":null},{"id":"W48869925","doi":"10.1007/978-3-642-31623-4_20","title":"State Complexity and Limited Nondeterminism","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; State (computer science); Theoretical computer science; Programming language","score_opus":0.029295499903910758,"score_gpt":0.24702390674879915,"score_spread":0.2177284068448884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W48869925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17482361,0.008499645,0.52082485,0.008173081,0.00052249007,0.00013327747,0.00077385275,0.00049666956,0.28575248],"genre_scores_gemma":[0.9356129,0.0024006832,0.031794455,0.00030567808,0.0005019971,0.00019800237,0.0003390556,0.0001283207,0.028718783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985233,0.00034767992,0.00011878422,0.00030692303,0.0005758095,0.00012756675],"domain_scores_gemma":[0.9913209,0.0066562253,0.00029525062,0.0011700051,0.0004093207,0.0001482839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010084597,0.00046529667,0.000900826,0.0008519304,0.0010710306,0.002900964,0.0012618154,0.0010307889,0.007868141],"category_scores_gemma":[0.0072092693,0.0006581967,0.0011578233,0.0011009654,0.004244202,0.01104945,0.0022893255,0.0039181327,0.00072759576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001567332,0.000010547808,0.00010378157,0.00006442488,0.000005968413,0.00003685847,0.0001321377,0.0027490961,0.0003692963,0.9882747,0.0006453938,0.0075920583],"study_design_scores_gemma":[0.0000030980852,0.000003983935,0.00006472183,0.000006814355,0.0000042080032,0.00003299067,0.000012238474,0.004190481,0.00027778742,0.99357444,0.0018247069,0.000004331637],"about_ca_topic_score_codex":0.00052027847,"about_ca_topic_score_gemma":0.00045442831,"teacher_disagreement_score":0.007868141,"about_ca_system_score_codex":0.0016610958,"about_ca_system_score_gemma":0.00070409995,"threshold_uncertainty_score":0.02632153},"labels":[],"label_agreement":null},{"id":"W49365848","doi":"10.46298/dmtcs.279","title":"Defect Effect of Bi-infinite Words in the Two-element Case","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Word (group theory); Element (criminal law); Sharpening; Set (abstract data type); Alphabet; Mathematics; Word problem (mathematics education); Maximal element; Closure (psychology); Discrete mathematics; Combinatorics; Pure mathematics; Algebra over a field; Arithmetic; Computer science; Artificial intelligence; Linguistics; Geometry","score_opus":0.010857745900750023,"score_gpt":0.2739245430268805,"score_spread":0.2630667971261305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49365848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93450534,0.00020673493,0.05167902,0.00029477404,0.000069029076,0.000037358837,0.00008662168,0.00027584497,0.012845257],"genre_scores_gemma":[0.9893734,0.00007647967,0.008061229,0.000057643127,0.00001829905,0.000041552732,0.00007264106,0.00003689061,0.0022618703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901175,0.00019252558,0.00014848649,0.00022474394,0.0002312143,0.00019132452],"domain_scores_gemma":[0.9941532,0.0033679153,0.0005608649,0.00093048206,0.0004457546,0.00054174935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011808359,0.00038306642,0.0007265367,0.0010089211,0.001004534,0.0023540156,0.0006005684,0.00090379594,0.0030030836],"category_scores_gemma":[0.005393761,0.0004353792,0.00074489054,0.00038497263,0.003410378,0.004018287,0.0029202783,0.0012308119,0.00037823725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009787888,0.00010706719,0.0040290016,0.0001662043,0.000033808374,0.0013514719,0.0013913794,0.008138085,0.03839757,0.9310682,0.0004725849,0.01386579],"study_design_scores_gemma":[0.00025560783,0.0007180508,0.0024110724,0.000102986916,0.00010701206,0.0019316706,0.0012343882,0.06737578,0.05924246,0.8592236,0.007253558,0.00014380396],"about_ca_topic_score_codex":0.00050720875,"about_ca_topic_score_gemma":0.00031052582,"teacher_disagreement_score":0.0030030836,"about_ca_system_score_codex":0.0007092648,"about_ca_system_score_gemma":0.00039324537,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W5713621","doi":"10.1007/bfb0035863","title":"Darwin: Computer algebra and enumerative combinatorics","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Enumerative combinatorics; Darwin (ADL); Extremal combinatorics; Combinatorics; Algebra over a field; Mathematics; Algebraic combinatorics; Computer science; Pure mathematics","score_opus":0.008530677949465895,"score_gpt":0.21402830139210896,"score_spread":0.20549762344264305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5713621","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026095686,0.038604658,0.47181997,0.01095343,0.0027424307,0.000080876176,0.0006933653,0.0016014194,0.44740808],"genre_scores_gemma":[0.4648328,0.034495194,0.1559511,0.0020441809,0.005894319,0.00031609304,0.0011710728,0.0010806186,0.3342146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997743,0.00006006432,0.000013378334,0.00004331105,0.00009190301,0.000017171553],"domain_scores_gemma":[0.99962246,0.00021735407,0.000021479958,0.00006309525,0.00005030838,0.000025370015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003541359,0.00051680085,0.0005702505,0.001062227,0.0007573813,0.0024183115,0.00074548495,0.0007669076,0.009520516],"category_scores_gemma":[0.0012756548,0.00034968936,0.00047139404,0.0020284797,0.0020405604,0.006087337,0.0011192573,0.0018555288,0.0021169027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005593798,0.000006564694,0.0001068149,0.0000799999,0.000005918853,0.000030176434,0.000126683,0.0008676871,0.00030098646,0.9477087,0.011181544,0.039579343],"study_design_scores_gemma":[0.0000019810977,0.0000029777204,0.00009205398,0.00002039394,0.0000034005434,0.000089799614,0.000021463336,0.001628777,0.00024240738,0.9407609,0.057130594,0.00000516694],"about_ca_topic_score_codex":0.0005135542,"about_ca_topic_score_gemma":0.00061547686,"teacher_disagreement_score":0.009520516,"about_ca_system_score_codex":0.0011364601,"about_ca_system_score_gemma":0.0005041516,"threshold_uncertainty_score":0.031849265},"labels":[],"label_agreement":null},{"id":"W593488378","doi":"10.71781/27187","title":"Approches algorithmiques pour l’inférence d’histoires de duplication en tandem avec inversions et délétions pour des familles multigéniques","year":2009,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Geology; Philosophy","score_opus":0.04339017769682606,"score_gpt":0.32686682869411887,"score_spread":0.2834766509972928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W593488378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014871728,0.00092013425,0.97758776,0.00037100492,0.0001165949,0.00022094006,0.00064358726,0.0036842015,0.0015839644],"genre_scores_gemma":[0.061143585,0.00051658036,0.93244976,0.0002414596,0.000068855836,0.00038506434,0.0022607555,0.00041661476,0.002517398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669504,0.00079782243,0.00031069183,0.0011185668,0.00083596574,0.00024190242],"domain_scores_gemma":[0.9937484,0.0033590507,0.0004122367,0.00084861653,0.0014758154,0.00015584046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00429044,0.0020044232,0.002118651,0.0037598298,0.0020703136,0.004919361,0.004261105,0.0036793912,0.006221142],"category_scores_gemma":[0.010957314,0.0013570265,0.0038591032,0.0030491538,0.0012472782,0.0030925306,0.0019115065,0.0029391607,0.0040057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007872983,0.00029641303,0.021454845,0.0011106265,0.0012098548,0.00034842984,0.000950193,0.28869337,0.017180277,0.024260119,0.009282456,0.6344261],"study_design_scores_gemma":[0.0001631878,0.00009784534,0.003701219,0.00018120647,0.00023693786,0.00030916877,0.00037374103,0.9240174,0.008411171,0.046597894,0.015820507,0.000089666675],"about_ca_topic_score_codex":0.014367952,"about_ca_topic_score_gemma":0.016959477,"teacher_disagreement_score":0.014367952,"about_ca_system_score_codex":0.002173104,"about_ca_system_score_gemma":0.0035435506,"threshold_uncertainty_score":0.028568625},"labels":[],"label_agreement":null},{"id":"W61028124","doi":"10.1007/978-3-642-31623-4_22","title":"State Complexity of Projection and Quotient on Unranked Trees","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Quotient; Concatenation (mathematics); Tree (set theory); State (computer science); String (physics); Combinatorics; Computer science; Finite-state machine; Discrete mathematics; Automaton; Tree automaton; Mathematics; Theoretical computer science; Algorithm","score_opus":0.030803970627065858,"score_gpt":0.24875383992393624,"score_spread":0.21794986929687038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61028124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.796293,0.000834548,0.16509321,0.0018039254,0.000092861344,0.00009035054,0.0012158835,0.0005196485,0.03405653],"genre_scores_gemma":[0.979983,0.00031400897,0.012778716,0.00006317001,0.00011190794,0.00007553679,0.00071751996,0.00013030965,0.0058258297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978339,0.00040272684,0.00014755945,0.00039255575,0.0007716889,0.00045160728],"domain_scores_gemma":[0.98909014,0.007920191,0.0005873584,0.0010424644,0.00073267147,0.00062721386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012957804,0.0005249342,0.0015163443,0.0012868936,0.0013512727,0.0062571936,0.0018217214,0.001469126,0.010278303],"category_scores_gemma":[0.009664638,0.0006651823,0.0015513381,0.0019484774,0.0028874113,0.014281216,0.002622462,0.0030700779,0.0005830553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026916023,0.00009930704,0.0014534188,0.00013189361,0.000028196142,0.0001387626,0.0006123742,0.029646216,0.0022049204,0.94830155,0.0017287928,0.015385517],"study_design_scores_gemma":[0.000021456271,0.000023887036,0.00046765982,0.0000101257865,0.000014614822,0.000054511045,0.00007457915,0.07898066,0.001079378,0.9187857,0.00046903596,0.000018366494],"about_ca_topic_score_codex":0.0027637188,"about_ca_topic_score_gemma":0.002425746,"teacher_disagreement_score":0.010278303,"about_ca_system_score_codex":0.0026374739,"about_ca_system_score_gemma":0.0016117954,"threshold_uncertainty_score":0.03438437},"labels":[],"label_agreement":null},{"id":"W6135152","doi":"10.1159/000407528","title":"Characterizing hardness in parameterized complexity","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Complexity class; Mathematical proof; Bounded function; Normalization (sociology); Theoretical computer science; Descriptive complexity theory; Computational complexity theory; Parametric statistics; Mathematics; Discrete mathematics; Completeness (order theory); Generality; Computer science; Algebra over a field; Algorithm; Pure mathematics","score_opus":0.040739438232526695,"score_gpt":0.3152530219448646,"score_spread":0.2745135837123379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6135152","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074243754,0.0013572854,0.86764324,0.0056359037,0.00014057111,0.00022597403,0.0010783868,0.00068687194,0.048988048],"genre_scores_gemma":[0.86722827,0.0021378566,0.10959802,0.0013921616,0.00094307726,0.0011154056,0.002388084,0.00060613366,0.014590996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99160963,0.0023779806,0.0005452539,0.0021884236,0.0023706895,0.000908018],"domain_scores_gemma":[0.96565866,0.02489981,0.0017586576,0.005581671,0.0014774686,0.0006237784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032107227,0.0011513574,0.0012175796,0.002142359,0.0018376005,0.006177004,0.0031021424,0.0024338504,0.009737189],"category_scores_gemma":[0.026807845,0.0010859004,0.0027611654,0.0030884233,0.0075410753,0.018112132,0.005684023,0.0066682682,0.0008122803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003775231,0.00004794528,0.00089550426,0.00022474855,0.00004234672,0.000075294825,0.00036856616,0.028253317,0.0009614076,0.95370966,0.0022622158,0.013121313],"study_design_scores_gemma":[0.000011260328,0.000022301916,0.00043613158,0.00003509849,0.000017178301,0.00007119482,0.00008001649,0.0458634,0.00080184895,0.9470676,0.005573921,0.000019835583],"about_ca_topic_score_codex":0.0019342371,"about_ca_topic_score_gemma":0.0011009334,"teacher_disagreement_score":0.009737189,"about_ca_system_score_codex":0.004640225,"about_ca_system_score_gemma":0.0020990928,"threshold_uncertainty_score":0.033667326},"labels":[],"label_agreement":null},{"id":"W644746544","doi":"","title":"Canadian sum set","year":2013,"lang":"en","type":"article","venue":"AeroSafety world./AeroSafety world","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Set (abstract data type); Aeronautics; Engineering; Transport engineering; Operations research; Computer science","score_opus":0.010138403264871818,"score_gpt":0.21261695351951265,"score_spread":0.20247855025464084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W644746544","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004466395,0.00093436835,0.005542492,0.002631323,0.0013038665,0.000101336984,0.011419835,0.0005786286,0.9730217],"genre_scores_gemma":[0.08744139,0.0019241436,0.00940136,0.00092450227,0.0004496084,0.00015081569,0.01783046,0.00058951805,0.8812881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833614,0.00010696331,0.00007794016,0.00041053194,0.0007924652,0.0002759358],"domain_scores_gemma":[0.9984425,0.00011285857,0.00003832956,0.0002419612,0.00091367384,0.0002507428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055619515,0.0012644479,0.00132104,0.0036925476,0.012171517,0.007882869,0.0022164434,0.0013760955,0.27630705],"category_scores_gemma":[0.0026595222,0.0005637922,0.0009341465,0.0047978624,0.002000779,0.004544472,0.0035805083,0.0026297485,0.07316307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011047078,0.000026860584,0.00029850248,0.00015186878,0.000019199524,0.00014212854,0.00027254125,0.00062211056,0.00046767195,0.6041846,0.33639693,0.0573071],"study_design_scores_gemma":[0.0000134911825,0.000008927483,0.00040816944,0.000056222587,0.000014105776,0.00010718309,0.00026765777,0.0005548217,0.0006129792,0.10502985,0.8928945,0.000032061933],"about_ca_topic_score_codex":0.23784612,"about_ca_topic_score_gemma":0.31399924,"teacher_disagreement_score":0.27630705,"about_ca_system_score_codex":0.013490132,"about_ca_system_score_gemma":0.01103755,"threshold_uncertainty_score":0.9243392},"labels":[],"label_agreement":null},{"id":"W68106085","doi":"10.1007/978-3-319-09704-6_14","title":"Computation Width and Deviation Number","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Computation; Algorithm; Computer science; Measure (data warehouse); Tree (set theory); Mathematics; Discrete mathematics; Combinatorics; Data mining","score_opus":0.010084060871777527,"score_gpt":0.23601668796522018,"score_spread":0.22593262709344267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68106085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17008436,0.006298674,0.5614804,0.0077551077,0.0011698517,0.00013546608,0.00083947676,0.0013520794,0.25088465],"genre_scores_gemma":[0.86014026,0.0022834064,0.08755168,0.00061384006,0.0007270792,0.0002779711,0.0007758142,0.00085402007,0.046775926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773186,0.00036627482,0.00017238222,0.0007387892,0.00074650545,0.00024427543],"domain_scores_gemma":[0.9952252,0.002801939,0.00021804319,0.0010117346,0.00042212338,0.0003209799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012833672,0.00066439377,0.0011540948,0.001220562,0.0012434645,0.004350139,0.0017450608,0.0012304421,0.009681023],"category_scores_gemma":[0.008150927,0.0007283513,0.0010049102,0.002099946,0.0038361514,0.010273658,0.0035652304,0.005287199,0.002277789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086979424,0.000015800933,0.0001967138,0.00007130843,0.0000075506828,0.000025793268,0.0001224149,0.0025324675,0.0016204623,0.9669476,0.002669149,0.025703687],"study_design_scores_gemma":[0.00000844772,0.000009397125,0.0000810482,0.000017009506,0.000006876212,0.0000587177,0.000026466065,0.0060786707,0.0014765768,0.9875309,0.004696558,0.000009335635],"about_ca_topic_score_codex":0.00026312214,"about_ca_topic_score_gemma":0.00023849693,"teacher_disagreement_score":0.009681023,"about_ca_system_score_codex":0.0015582029,"about_ca_system_score_gemma":0.0008056174,"threshold_uncertainty_score":0.032386243},"labels":[],"label_agreement":null},{"id":"W6891618358","doi":"10.48550/arxiv.1405.5605","title":"Similarity density of the Thue-Morse word with overlap-free infinite binary words","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Complement (music); Word (group theory); Generalization; Similarity (geometry); Measure (data warehouse); Binary number","score_opus":0.03220823274732787,"score_gpt":0.16721629180853217,"score_spread":0.1350080590612043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891618358","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8550068,0.0006453249,0.12728782,0.0004152803,0.00008445178,0.000035688372,0.00013273465,0.00011464124,0.01627722],"genre_scores_gemma":[0.98901355,0.00010241458,0.008864554,0.00005120727,0.00009076796,0.000047914717,0.00008260844,0.000020102685,0.0017268277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838734,0.00041849198,0.00011779052,0.00036973617,0.00052737293,0.00017929747],"domain_scores_gemma":[0.9942525,0.0030317504,0.0007383151,0.00047410306,0.0008283054,0.0006751199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013278022,0.0002815945,0.0006813208,0.0023337333,0.0013162061,0.0023337256,0.0008460714,0.0008986104,0.0026345344],"category_scores_gemma":[0.010297836,0.00028279712,0.00045429706,0.0014204003,0.003077091,0.0036470678,0.0022345548,0.00079224544,0.00032784895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017166729,0.00004306647,0.0038158144,0.00009771834,0.000025591047,0.00031921084,0.0014486411,0.0033593662,0.006606694,0.9737908,0.00044247805,0.00987886],"study_design_scores_gemma":[0.000027113876,0.00014970927,0.0047762017,0.000056174937,0.000031165324,0.0010641873,0.0009102293,0.058495767,0.004414999,0.9262664,0.0037392539,0.0000688353],"about_ca_topic_score_codex":0.0006445463,"about_ca_topic_score_gemma":0.0003560574,"teacher_disagreement_score":0.0026345344,"about_ca_system_score_codex":0.00090785976,"about_ca_system_score_gemma":0.00031910834,"threshold_uncertainty_score":0.008813381},"labels":[],"label_agreement":null},{"id":"W6903307295","doi":"10.1051/ita/2016010/pdf","title":"Decision algorithms for Fibonacci-automatic Words, I: Basic results","year":2016,"lang":"en","type":"article","venue":"Springer Link (Chiba Institute of Technology)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Class (philosophy); Fibonacci number; Morphism; Word (group theory); Point (geometry); Decision tree","score_opus":0.016612907101449106,"score_gpt":0.25247097542458025,"score_spread":0.23585806832313114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6903307295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021743707,0.00060748996,0.96175003,0.0010819093,0.00017180087,0.0002867976,0.00042505635,0.0011902348,0.012743077],"genre_scores_gemma":[0.33065397,0.0006658927,0.65206677,0.0012237875,0.0005315198,0.0008239377,0.0019660788,0.00047012776,0.011597918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99404126,0.0015086147,0.0006053636,0.0014902243,0.0016972905,0.00065724755],"domain_scores_gemma":[0.9824149,0.0133806355,0.00069490523,0.0014632067,0.0015622095,0.00048415232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049449652,0.0010931856,0.0012673446,0.0022389765,0.0018040042,0.0053997533,0.0037209396,0.0025905566,0.0106311245],"category_scores_gemma":[0.024415473,0.0008662579,0.0025680745,0.002212483,0.002951998,0.008900184,0.0042823358,0.0045202384,0.0031023975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032501097,0.0003164741,0.0016516772,0.0003418285,0.000087929264,0.00009982893,0.00045549782,0.017887337,0.0035853263,0.86398387,0.008412077,0.10285305],"study_design_scores_gemma":[0.000071173345,0.00006619341,0.00019432201,0.00006391123,0.000035710233,0.00007361275,0.00009228996,0.12849808,0.0034062534,0.86325747,0.004208167,0.000032868895],"about_ca_topic_score_codex":0.0015944534,"about_ca_topic_score_gemma":0.0016237745,"teacher_disagreement_score":0.0106311245,"about_ca_system_score_codex":0.0027671484,"about_ca_system_score_gemma":0.0026343162,"threshold_uncertainty_score":0.0355646},"labels":[],"label_agreement":null},{"id":"W6910534332","doi":"10.48550/arxiv.1308.4368","title":"Maximally Atomic Languages","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quotient; Regular language; Semigroup; Class (philosophy); Rank (graph theory); Transitive relation; Upper and lower bounds","score_opus":0.03786647705391654,"score_gpt":0.173637450744865,"score_spread":0.13577097369094845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910534332","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57764494,0.0007857539,0.36933592,0.0011928409,0.00012972676,0.00026677302,0.0023746593,0.0017272473,0.046542104],"genre_scores_gemma":[0.92628086,0.00018014961,0.0649144,0.00018355073,0.00014243778,0.000209508,0.0009789914,0.00015992991,0.006950217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978192,0.00044670084,0.0002430554,0.0006204149,0.0005508065,0.00031980095],"domain_scores_gemma":[0.99583805,0.0017843154,0.0006078895,0.00084934046,0.00061132223,0.00030906027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000994172,0.0004011568,0.00057555886,0.0009359894,0.0011975664,0.002488082,0.0010012353,0.000594822,0.005496208],"category_scores_gemma":[0.004592771,0.00048438576,0.00097576174,0.00057909376,0.0023215064,0.0042458004,0.0019852784,0.0010811187,0.0008041622],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018584485,0.000036170437,0.0017973313,0.00016168409,0.000028520706,0.00030768014,0.0011173498,0.0018388801,0.014996285,0.9620299,0.0017053229,0.01579511],"study_design_scores_gemma":[0.000037110534,0.00008893597,0.0011782041,0.000042590716,0.000043953925,0.0008033987,0.0005179144,0.018118624,0.012165542,0.9453131,0.02165065,0.000040027335],"about_ca_topic_score_codex":0.0006338333,"about_ca_topic_score_gemma":0.00068053487,"teacher_disagreement_score":0.005496208,"about_ca_system_score_codex":0.00096893415,"about_ca_system_score_gemma":0.0009193943,"threshold_uncertainty_score":0.018386662},"labels":[],"label_agreement":null},{"id":"W6922026402","doi":"10.1051/ita/2018015/pdf","title":"Randomized generation of error control codes with automata and transducers","year":2019,"lang":"en","type":"article","venue":"Springer Link (Chiba Institute of Technology)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Block (permutation group theory); Code (set theory); Synchronization (alternating current); Automaton; Error detection and correction; Substitution (logic); Block code","score_opus":0.014277441038391934,"score_gpt":0.22923656828082614,"score_spread":0.2149591272424342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6922026402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036856372,0.000052321397,0.9587691,0.00017851859,0.000060533126,0.000098245124,0.00010522528,0.0021413143,0.0017384323],"genre_scores_gemma":[0.48960742,0.000072487484,0.5056709,0.00015473615,0.000045287034,0.00040888853,0.00031161096,0.00044944466,0.0032791977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583983,0.0014192454,0.00035155914,0.00085417344,0.001148689,0.00038655283],"domain_scores_gemma":[0.98870754,0.007156874,0.00076396833,0.00198119,0.0011788713,0.00021150857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027417268,0.00049990776,0.00059506524,0.00066858035,0.0006252278,0.0011904463,0.0014589868,0.000919149,0.0022834039],"category_scores_gemma":[0.013277555,0.00041991583,0.000901111,0.0005537281,0.0023212514,0.002006012,0.001600485,0.0013139697,0.00061189086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064192555,0.00015172223,0.0022755177,0.00026118176,0.0000526806,0.00044998806,0.00067487074,0.2532494,0.048560742,0.63241696,0.0024728745,0.058792178],"study_design_scores_gemma":[0.00009329254,0.00012313934,0.00016032087,0.000035581,0.000028550605,0.00010308408,0.00005574403,0.8101619,0.04908415,0.13530943,0.0048015513,0.000043361524],"about_ca_topic_score_codex":0.0016129491,"about_ca_topic_score_gemma":0.001735683,"teacher_disagreement_score":0.0027417268,"about_ca_system_score_codex":0.0012018101,"about_ca_system_score_gemma":0.0020794957,"threshold_uncertainty_score":0.0144997835},"labels":[],"label_agreement":null},{"id":"W6929454940","doi":"10.48660/08060180","title":"Non-Gaussianities from modified initial states","year":2008,"lang":"en","type":"other","venue":"PIRSA","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"State (computer science); Work (physics); Set (abstract data type); Feature (linguistics); Product (mathematics)","score_opus":0.017544952221732565,"score_gpt":0.23696681339591022,"score_spread":0.21942186117417767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929454940","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08002995,0.0006557525,0.78100055,0.0017977286,0.0006025114,0.00010444424,0.00044597418,0.002642447,0.1327207],"genre_scores_gemma":[0.7956373,0.0004906633,0.09332949,0.0005207271,0.00029446284,0.00016945336,0.0005267464,0.00094541756,0.1080857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905163,0.00026131314,0.000051586747,0.00022387927,0.0003007498,0.00011083725],"domain_scores_gemma":[0.9964457,0.0014759207,0.00020785659,0.0012617417,0.00045321087,0.00015560986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010003662,0.000698724,0.00078836695,0.00059339614,0.001159856,0.001980845,0.001393921,0.0011312056,0.01709457],"category_scores_gemma":[0.0057137148,0.00042271393,0.0008791969,0.00064671435,0.0029019709,0.004427413,0.0032764114,0.0027205972,0.0040114],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009511576,0.000024286357,0.00023088226,0.00008698672,0.000013235693,0.000200338,0.00029049878,0.00526145,0.0032245063,0.9706673,0.0029144587,0.01699086],"study_design_scores_gemma":[0.000016420458,0.000018177021,0.00011955843,0.000023037392,0.000010764045,0.0001791286,0.00006099759,0.04637158,0.0050424477,0.9407557,0.007383829,0.00001831665],"about_ca_topic_score_codex":0.0006050645,"about_ca_topic_score_gemma":0.00089679274,"teacher_disagreement_score":0.01709457,"about_ca_system_score_codex":0.0009957667,"about_ca_system_score_gemma":0.0010311061,"threshold_uncertainty_score":0.05718708},"labels":[],"label_agreement":null},{"id":"W6930119680","doi":"10.5281/zenodo.11744478","title":"Nissan qashqai 2021 bedienungsanleitung deutsch pdf","year":2024,"lang":"de","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Population; Corporate governance; Investment (military); Sustainable development; Event (particle physics)","score_opus":0.02263068288089578,"score_gpt":0.2391320038926278,"score_spread":0.216501321011732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930119680","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006169757,0.0012796525,0.00053782895,0.002159812,0.0025355648,0.00018143792,0.0032965315,0.0014076438,0.9879844],"genre_scores_gemma":[0.0019580242,0.00056369614,0.0002293993,0.00048737472,0.0002220399,0.00004350306,0.00129999,0.00031587016,0.9948801],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999049,0.00006388256,0.00004846645,0.00009570576,0.0005843341,0.00015860984],"domain_scores_gemma":[0.9979931,0.00017170665,0.000074596384,0.00017697887,0.0011212204,0.00046240335],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012549357,0.001120348,0.0008201169,0.0018134312,0.0026296072,0.006586273,0.0010594896,0.0021803665,0.8682493],"category_scores_gemma":[0.0028844005,0.0005292686,0.00059997715,0.0017338225,0.0007844906,0.0033093703,0.002741281,0.002016477,0.76782006],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005841942,0.000032183383,0.00013517444,0.0001371988,0.0000027678734,0.000088333094,0.00007511289,0.000076507764,0.00052320986,0.0040407088,0.9314687,0.06336176],"study_design_scores_gemma":[0.0000053751746,0.000009985603,0.00020465783,0.000036683083,7.576609e-7,0.000036273213,0.000054367807,0.000032349868,0.00012918223,0.0003496216,0.9991374,0.0000034352893],"about_ca_topic_score_codex":0.009938914,"about_ca_topic_score_gemma":0.014950435,"teacher_disagreement_score":0.1317507,"about_ca_system_score_codex":0.002302637,"about_ca_system_score_gemma":0.0038958867,"threshold_uncertainty_score":0.18792629},"labels":[],"label_agreement":null},{"id":"W6930519633","doi":"10.5281/zenodo.15717730","title":"astropy/astropy-iers-data: v0.2025.6.23.0.39.50","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Process (computing); Identification (biology); Work (physics)","score_opus":0.03354579442460469,"score_gpt":0.25337827385756984,"score_spread":0.21983247943296513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930519633","genre_codex":"dataset","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052605366,0.0003537334,0.009657732,0.0008957179,0.0005977167,0.00007195486,0.6319879,0.22956733,0.12634183],"genre_scores_gemma":[0.007466808,0.00043624546,0.009929243,0.0007723221,0.0002551119,0.00021515238,0.78336275,0.13851029,0.05905203],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99868363,0.00014334977,0.00006133436,0.00023049802,0.00066750706,0.00021364026],"domain_scores_gemma":[0.99698275,0.00045069866,0.00012248835,0.0011314275,0.0009648275,0.00034776874],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013934055,0.002670296,0.0019243319,0.0032802802,0.0014884468,0.005703976,0.00440999,0.0022843208,0.655197],"category_scores_gemma":[0.008183133,0.0014055824,0.001708993,0.0047023497,0.00065620244,0.005747693,0.0042514545,0.0024992859,0.76728183],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004363869,0.000009226305,0.00012837297,0.00011622809,0.000008348653,0.000012744656,0.000019334346,0.0002706916,0.00009694195,0.0013806383,0.993224,0.0046898546],"study_design_scores_gemma":[0.000082247025,0.000008369281,0.00049452734,0.000057770852,0.0000072362304,0.000048729376,0.000028291539,0.0011359407,0.000873309,0.0072824867,0.98994803,0.000032977263],"about_ca_topic_score_codex":0.018507035,"about_ca_topic_score_gemma":0.014492025,"teacher_disagreement_score":0.655197,"about_ca_system_score_codex":0.0021432065,"about_ca_system_score_gemma":0.0013884276,"threshold_uncertainty_score":0.49181956},"labels":[],"label_agreement":null},{"id":"W6932125911","doi":"10.5683/sp3/jihz4u","title":"Reference Mysteries, Part One","year":2004,"lang":"en","type":"dataset","venue":"Borealis","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Statistics Canada; University of Alberta; University of New Brunswick","funders":"","keywords":"Desk; Reference data; Component (thermodynamics); Term (time); Reference desk","score_opus":0.034466271637968365,"score_gpt":0.24800944539779768,"score_spread":0.2135431737598293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6932125911","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025965404,0.0005533125,0.0011501461,0.0009566178,0.00045507558,0.00015942755,0.98358375,0.0040440517,0.0065011247],"genre_scores_gemma":[0.0018276854,0.00008498919,0.0012554043,0.00026875356,0.000041684023,0.00020834916,0.9930125,0.00027491417,0.0030257234],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9940568,0.0009837745,0.00087328826,0.0015250264,0.0019471697,0.0006139617],"domain_scores_gemma":[0.9840439,0.0020183346,0.00083822664,0.007768793,0.0040543834,0.0012763134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037446627,0.0019248475,0.0016728514,0.004772463,0.0027514633,0.0053175217,0.004659677,0.0029837294,0.045897588],"category_scores_gemma":[0.028283158,0.00088952464,0.0014875606,0.007962722,0.000889437,0.004252309,0.003655542,0.0031427434,0.10252585],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087865345,0.000056272278,0.00076964614,0.00017795507,0.000012282705,0.00001901006,0.000026522523,0.000117165684,0.000108451204,0.00066152384,0.9936899,0.0042734356],"study_design_scores_gemma":[0.00020118862,0.000049382677,0.0056229937,0.00015909215,0.000019892293,0.00018678003,0.00014680791,0.0010329036,0.0012335321,0.002491283,0.98881733,0.00003889748],"about_ca_topic_score_codex":0.01677093,"about_ca_topic_score_gemma":0.032562193,"teacher_disagreement_score":0.045897588,"about_ca_system_score_codex":0.002416798,"about_ca_system_score_gemma":0.0042777616,"threshold_uncertainty_score":0.1535427},"labels":[],"label_agreement":null},{"id":"W6948345171","doi":"10.48550/arxiv.math-ph/0509053","title":"Dynamique des nombres et physique des oscillateurs","year":2005,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"","keywords":"Arithmetic function; Natural number; Spectrum (functional analysis); Natural (archaeology); Multiple","score_opus":0.06089217963575034,"score_gpt":0.1929795415762158,"score_spread":0.13208736194046547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948345171","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71863335,0.0023602287,0.2526052,0.0023392274,0.000339246,0.000039613147,0.00026444352,0.00020834917,0.023210285],"genre_scores_gemma":[0.97467357,0.0012856827,0.017300902,0.000095588526,0.00029855795,0.00007169287,0.00010884047,0.00005305953,0.0061120177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973196,0.000088197165,0.000009321578,0.00006870479,0.00006483157,0.00003702876],"domain_scores_gemma":[0.99910057,0.0005185353,0.00016676853,0.00007521931,0.000066492896,0.00007253258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006865937,0.00041432914,0.00040555792,0.0010186242,0.0010444223,0.0017886594,0.00065652863,0.0008774612,0.0027851954],"category_scores_gemma":[0.0028913429,0.0003424291,0.00027597733,0.0006625923,0.002256215,0.002203283,0.00084302586,0.00095729757,0.00043546635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006151728,0.000033590597,0.0020742284,0.00008709498,0.000021414537,0.00024127684,0.0004934476,0.025225166,0.012849525,0.9478809,0.0010105676,0.010021335],"study_design_scores_gemma":[0.000050072096,0.000049207167,0.0031259477,0.000025754585,0.000011478216,0.00040615397,0.00026209795,0.35358974,0.003577729,0.6319996,0.0068304753,0.00007173741],"about_ca_topic_score_codex":0.0013717643,"about_ca_topic_score_gemma":0.0006776197,"teacher_disagreement_score":0.0027851954,"about_ca_system_score_codex":0.0008154825,"about_ca_system_score_gemma":0.00025921955,"threshold_uncertainty_score":0.009317458},"labels":[],"label_agreement":null},{"id":"W6950569497","doi":"10.5683/sp3/85uio7","title":"Published or Perished: thoughts on the publication of mediocrity","year":2024,"lang":"en","type":"dataset","venue":"Borealis","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Discoverability; Mediocrity principle; Publishing; Foundation (evidence); Government (linguistics); Position (finance)","score_opus":0.02170709880225972,"score_gpt":0.2700045867916483,"score_spread":0.24829748798938858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6950569497","genre_codex":"commentary","genre_gemma":"dataset","domain_codex":null,"domain_gemma":"incentives","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":"incentives","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012794155,0.026488606,0.008751505,0.77540964,0.057559133,0.000053399337,0.017136144,0.0012772075,0.100530215],"genre_scores_gemma":[0.36344936,0.043243714,0.023068177,0.30220252,0.13420716,0.0005083218,0.033648614,0.010536044,0.089136176],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98026365,0.008391654,0.0017645877,0.0026418406,0.005999157,0.0009391289],"domain_scores_gemma":[0.8385081,0.106498934,0.011173098,0.026085006,0.013349588,0.0043852483],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.040206756,0.0004719061,0.00078853336,0.0071791047,0.0056459066,0.027634235,0.0022117337,0.0030871741,0.033339918],"category_scores_gemma":[0.19856127,0.0005987903,0.00069490285,0.01407292,0.012540668,0.03745853,0.008524193,0.008703804,0.009236389],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013227701,0.000010389707,0.0019179679,0.00034892152,0.000025675074,0.00008326654,0.0039986395,0.00009838809,0.00009056375,0.1574913,0.80990994,0.025892723],"study_design_scores_gemma":[0.000024771714,0.0000087441895,0.0010998375,0.0006619826,0.000013932561,0.00012925679,0.0019364906,0.0001406723,0.00027442563,0.049195014,0.9464779,0.000037027396],"about_ca_topic_score_codex":0.0029395449,"about_ca_topic_score_gemma":0.004564094,"teacher_disagreement_score":0.95979327,"about_ca_system_score_codex":0.005588894,"about_ca_system_score_gemma":0.0033788567,"threshold_uncertainty_score":0.21263623},"labels":[],"label_agreement":null},{"id":"W6958675902","doi":"10.71352/ac.58.170125","title":"New families of normal numbers constructed from existing ones","year":2025,"lang":"en","type":"article","venue":"Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae Sectio computatorica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nucleofection; Gestational period; Dysgeusia; TSG101; Liquation; Diafiltration; Emperipolesis; Fusible alloy; Hyporeflexia","score_opus":0.006754939549440321,"score_gpt":0.21971335200467756,"score_spread":0.21295841245523725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958675902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5556421,0.0011103761,0.33768514,0.0009225669,0.0011127354,0.00023329283,0.00073413644,0.0016538079,0.10090581],"genre_scores_gemma":[0.81292415,0.0006833071,0.13683671,0.00038068966,0.00045640735,0.00052900973,0.0013753356,0.0006504375,0.046163894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795985,0.0005019758,0.000111698195,0.00052641163,0.00059092056,0.0003092011],"domain_scores_gemma":[0.993342,0.0028839386,0.0005585089,0.001082991,0.0013446067,0.00078793714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019258215,0.0007080265,0.0006370847,0.0023980686,0.0026917655,0.0026835944,0.0015323609,0.000963127,0.008675899],"category_scores_gemma":[0.009350283,0.0007708575,0.0012070588,0.0009598177,0.0025970356,0.003921184,0.002266152,0.0018030566,0.0013669834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002655171,0.00009223279,0.002855099,0.00014829471,0.000027662949,0.0010511237,0.0016057796,0.0038448016,0.007837667,0.94868815,0.0039144205,0.029669251],"study_design_scores_gemma":[0.00012970614,0.00027060087,0.0023823702,0.00012224035,0.000072210314,0.0028893107,0.00081943546,0.045226585,0.009111754,0.85920763,0.0796358,0.00013238918],"about_ca_topic_score_codex":0.00037972632,"about_ca_topic_score_gemma":0.00057156134,"teacher_disagreement_score":0.008675899,"about_ca_system_score_codex":0.001922761,"about_ca_system_score_gemma":0.0007365061,"threshold_uncertainty_score":0.029023767},"labels":[],"label_agreement":null},{"id":"W6959215644","doi":"10.7282/t38k7dgb","title":"Better Complexity Bounds for Cost Register Automata","year":2018,"lang":"en","type":"article","venue":"View","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Semiring; Automaton; Class (philosophy); Set (abstract data type); Polynomial; State (computer science); Time complexity; Finite-state machine","score_opus":0.07476690809554878,"score_gpt":0.31480131052407545,"score_spread":0.24003440242852667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6959215644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27095965,0.007531215,0.53415525,0.027940206,0.0011411268,0.00026523948,0.0023750397,0.0024342877,0.15319797],"genre_scores_gemma":[0.90254605,0.0021300276,0.07294519,0.0019670962,0.0013907518,0.0003276168,0.0013663023,0.0007718607,0.016555136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939573,0.0011770524,0.00032089304,0.0016645371,0.002002367,0.00087784906],"domain_scores_gemma":[0.9539487,0.034853198,0.0014102109,0.0065496177,0.002007413,0.0012308891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004276405,0.0011056494,0.0015399446,0.0020931351,0.0016619571,0.0066592847,0.0029466837,0.0021623333,0.016682616],"category_scores_gemma":[0.02783722,0.00069373765,0.002773995,0.0019423539,0.004240596,0.022229843,0.0048486595,0.009460826,0.0020002667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020479692,0.00010480514,0.0010771358,0.00024287001,0.000034350076,0.00008707215,0.00037912375,0.0167976,0.002431813,0.95787156,0.005916639,0.014852125],"study_design_scores_gemma":[0.000025799187,0.00004725106,0.00041155488,0.000042737025,0.00003120574,0.00007243992,0.00008744874,0.07120513,0.0016097106,0.92027634,0.006160432,0.000029939625],"about_ca_topic_score_codex":0.0023616361,"about_ca_topic_score_gemma":0.00231972,"teacher_disagreement_score":0.016682616,"about_ca_system_score_codex":0.0059153857,"about_ca_system_score_gemma":0.0020779031,"threshold_uncertainty_score":0.05580896},"labels":[],"label_agreement":null},{"id":"W6966730854","doi":"10.48550/arxiv.2309.02765","title":"A General Approach to Proving Properties of Fibonacci Representations via Automata Theory","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Correctness; Fibonacci number; Automaton; Representation (politics); Mathematical proof; Automata theory","score_opus":0.10933613675663038,"score_gpt":0.20021450915030511,"score_spread":0.09087837239367473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966730854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002546055,0.00020113532,0.989794,0.00041798805,0.00014764744,0.00007960387,0.00007669665,0.00054259377,0.0061942968],"genre_scores_gemma":[0.17715472,0.0009297802,0.81205195,0.0011118078,0.00048365063,0.0006921378,0.00036972392,0.00041459434,0.006791579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99639577,0.00090893847,0.00034005515,0.0006939781,0.0014441054,0.00021709506],"domain_scores_gemma":[0.9960879,0.0020447634,0.0001682554,0.0011568189,0.00045418605,0.00008811914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041019954,0.0013169384,0.0010267327,0.002400608,0.0021864115,0.0031908322,0.0031404183,0.0023650469,0.007362284],"category_scores_gemma":[0.008441607,0.00096055237,0.0042780745,0.00172586,0.007382786,0.0071405442,0.0042875055,0.005699732,0.0025084205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012723394,0.000026264937,0.00010665682,0.00011381322,0.00001874963,0.00010249488,0.00021659072,0.0037726462,0.0028879424,0.97775024,0.0012745255,0.013717425],"study_design_scores_gemma":[0.000015258858,0.000028358114,0.00004510719,0.00003267281,0.000016479356,0.000093334485,0.000026071231,0.011205567,0.0035960237,0.9752237,0.009692024,0.000025461512],"about_ca_topic_score_codex":0.0012781103,"about_ca_topic_score_gemma":0.00108685,"teacher_disagreement_score":0.007362284,"about_ca_system_score_codex":0.00197752,"about_ca_system_score_gemma":0.0017339843,"threshold_uncertainty_score":0.024629295},"labels":[],"label_agreement":null},{"id":"W6967093038","doi":"10.48550/arxiv.2406.16410","title":"Perfectly Clustering Words and Iterated Palindromes over a Ternary Alphabet","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Palindrome; Alphabet; Iterated function; Ternary operation; Cluster analysis; Characterization (materials science); Word (group theory)","score_opus":0.03537752939519934,"score_gpt":0.18425379905808842,"score_spread":0.14887626966288908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6967093038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7897654,0.0015945893,0.17672443,0.00035536234,0.00013684365,0.000048143494,0.00040269727,0.0004175922,0.030554818],"genre_scores_gemma":[0.9620421,0.00027041516,0.03103818,0.00011922648,0.00010115821,0.00004574113,0.00030457802,0.000050264214,0.006028322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992986,0.00013510697,0.00006686615,0.00023867127,0.000152335,0.000108479435],"domain_scores_gemma":[0.99737906,0.0010173852,0.00065380486,0.0003819958,0.00037523307,0.00019256468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044203937,0.00034782762,0.00033490348,0.0013232392,0.0011329758,0.0013878933,0.0005811598,0.0008626008,0.003014339],"category_scores_gemma":[0.0024959464,0.00031202834,0.0005467932,0.0011257811,0.002129978,0.0021974307,0.00090508256,0.00075482414,0.00050014944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023213183,0.00003751212,0.0039163455,0.0001804293,0.000031242846,0.0012352073,0.0021991145,0.0050016665,0.032409333,0.9309646,0.0008804537,0.022911908],"study_design_scores_gemma":[0.000026852522,0.0001656844,0.0035348567,0.000070716815,0.000041507104,0.00207836,0.0008066204,0.025434505,0.015171887,0.9361778,0.016403766,0.00008748983],"about_ca_topic_score_codex":0.00078717934,"about_ca_topic_score_gemma":0.00074549345,"teacher_disagreement_score":0.003014339,"about_ca_system_score_codex":0.00069225335,"about_ca_system_score_gemma":0.00039510615,"threshold_uncertainty_score":0.010083914},"labels":[],"label_agreement":null},{"id":"W6967846720","doi":"10.5281/zenodo.10822743","title":"IOT FUNDAMENTALS AND COMPREHENSIVE INTRODUCTION","year":2024,"lang":"en","type":"book","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Internet of Things; Key (lock); Automation; Focus (optics)","score_opus":0.026488963487036363,"score_gpt":0.23348331822156,"score_spread":0.20699435473452363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6967846720","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016941762,0.09859711,0.05720883,0.0027569884,0.010845095,0.00011248279,0.00073491293,0.0007429124,0.82730764],"genre_scores_gemma":[0.020294137,0.11959595,0.018984353,0.0030923616,0.0075373086,0.00032589815,0.0015040598,0.00049827073,0.8281677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99976844,0.000026095839,0.000016638443,0.000053019718,0.000105574916,0.000030221972],"domain_scores_gemma":[0.9998759,0.00003852946,0.0000076254973,0.000020264019,0.000038240007,0.000019389427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024304508,0.0014565476,0.0006506506,0.001930158,0.00084612786,0.0027943088,0.00075946643,0.0013164011,0.04269904],"category_scores_gemma":[0.00041023214,0.0005417541,0.0005506282,0.0024054982,0.000899725,0.004165702,0.0017044029,0.0018364664,0.024555068],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003180583,0.00005952695,0.00013763011,0.00074024405,0.000009422853,0.00015689351,0.00022595661,0.001998411,0.0024627722,0.42576745,0.28490913,0.28350076],"study_design_scores_gemma":[0.0000011290656,0.00001386048,0.000098652745,0.00016840814,0.0000029433036,0.00013300942,0.000035650624,0.0004526477,0.00016375484,0.037255403,0.9616679,0.0000066141833],"about_ca_topic_score_codex":0.00074547465,"about_ca_topic_score_gemma":0.0013138414,"teacher_disagreement_score":0.04269904,"about_ca_system_score_codex":0.00091211346,"about_ca_system_score_gemma":0.0006545403,"threshold_uncertainty_score":0.14284253},"labels":[],"label_agreement":null},{"id":"W6968884023","doi":"10.5281/zenodo.8099770","title":"Proof of a Conjecture of Krawchuk and Rampersad on the Cyclic Complexity of the Thue-Morse Sequence","year":2023,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Sequence (biology); Class (philosophy); Counterexample; Constant (computer programming)","score_opus":0.07561945392711303,"score_gpt":0.2598799954518017,"score_spread":0.18426054152468865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6968884023","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49627942,0.0056070765,0.28546834,0.03784467,0.0029892274,0.00021458544,0.0019787485,0.0016977552,0.16792023],"genre_scores_gemma":[0.9565136,0.0012782211,0.02585127,0.0024070803,0.0014824838,0.00017977969,0.0006464762,0.00023519066,0.011405897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984719,0.00029227565,0.00006680715,0.0004200601,0.00045914412,0.00028988524],"domain_scores_gemma":[0.9876274,0.008065401,0.0008036829,0.001721816,0.00090306695,0.00087868155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019426367,0.0010293395,0.0013548409,0.0019023119,0.0018185109,0.0023786079,0.0017608226,0.0016895022,0.015647402],"category_scores_gemma":[0.01680672,0.00074201095,0.0016459118,0.0017051956,0.0054841433,0.0057497425,0.0059230984,0.0064276243,0.001341899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023296657,0.0000735233,0.0013776715,0.00023827456,0.00004823896,0.00026234536,0.0008444128,0.00521037,0.0028722396,0.9631646,0.012202241,0.013473213],"study_design_scores_gemma":[0.000075871685,0.00006932237,0.0011165224,0.00005641957,0.000027313363,0.00027829673,0.00013077422,0.0141496165,0.0016462612,0.9728276,0.0095712375,0.00005065213],"about_ca_topic_score_codex":0.0017144964,"about_ca_topic_score_gemma":0.00084870245,"teacher_disagreement_score":0.015647402,"about_ca_system_score_codex":0.0015704534,"about_ca_system_score_gemma":0.0011003499,"threshold_uncertainty_score":0.052345812},"labels":[],"label_agreement":null},{"id":"W6979243950","doi":"","title":"Words with factor complexity $2n+1$ and minimal critical exponent","year":2025,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Exponent; Morphism; Word (group theory); Factor (programming language); Zero (linguistics); Critical exponent; Point (geometry)","score_opus":0.0628256291133757,"score_gpt":0.19627006834454125,"score_spread":0.13344443923116556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6979243950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8528014,0.00084713567,0.050899275,0.0030433007,0.00016140104,0.00008156351,0.001118747,0.00031656638,0.09073054],"genre_scores_gemma":[0.9803437,0.00013821817,0.011277026,0.00015487644,0.000105694744,0.000058751622,0.00037234777,0.000063855965,0.007485619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994603,0.000070997485,0.00004341073,0.00014439752,0.00012926217,0.00015172051],"domain_scores_gemma":[0.99750817,0.0013084845,0.000283913,0.00028473485,0.0003725846,0.0002420469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033703572,0.00045763276,0.0005193378,0.0010541937,0.0014060645,0.001979662,0.0004379483,0.0007798527,0.0071834964],"category_scores_gemma":[0.0033484846,0.00036949027,0.0006151074,0.0006799326,0.0026324713,0.00274737,0.0010673876,0.0010650073,0.00091206614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005226801,0.000048555383,0.0072771776,0.00026276743,0.000029667135,0.0011468527,0.0017095107,0.0039519737,0.014849279,0.9456707,0.00599018,0.018540611],"study_design_scores_gemma":[0.00007900626,0.000066067,0.0060003656,0.00007375482,0.00003287989,0.00093385077,0.0005063972,0.009995684,0.008607213,0.95111275,0.022527207,0.00006479013],"about_ca_topic_score_codex":0.0014848129,"about_ca_topic_score_gemma":0.002380828,"teacher_disagreement_score":0.0071834964,"about_ca_system_score_codex":0.0017925245,"about_ca_system_score_gemma":0.00058259926,"threshold_uncertainty_score":0.024031162},"labels":[],"label_agreement":null},{"id":"W6980074172","doi":"","title":"Aspects of endomorphism monoids of certain algebras","year":2023,"lang":"en","type":"dissertation","venue":"White Rose eTheses Online (University of Leeds, The University of Sheffield, University of York)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Endomorphism; Monoid; Semigroup; Ideal (ethics); Free monoid; Bicyclic semigroup; Isomorphism (crystallography); Algebra over a field","score_opus":0.016108120118876544,"score_gpt":0.2044737606117129,"score_spread":0.18836564049283636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6980074172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87028515,0.0011179461,0.07554284,0.0006073335,0.00009624655,0.00007915779,0.00023071464,0.00009612546,0.051944498],"genre_scores_gemma":[0.97122025,0.0004600106,0.016841492,0.000082434395,0.00019964702,0.000060682414,0.00019319476,0.000021956681,0.010920314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989723,0.00019146444,0.00007247522,0.00017032416,0.0004458063,0.00014753999],"domain_scores_gemma":[0.9985227,0.00055666163,0.0002925644,0.00013954185,0.00023806556,0.00025050336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013052629,0.00020419378,0.00025787437,0.0015782882,0.0013144742,0.0019375511,0.00047833854,0.00037158874,0.0031378097],"category_scores_gemma":[0.0013759263,0.0002977452,0.00063743786,0.00069015427,0.0026521601,0.0029785282,0.0015809912,0.00097169314,0.00029958636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037106096,0.000039860468,0.0012643727,0.00003889872,0.000007744227,0.00033820883,0.0013754156,0.00068278925,0.0060094427,0.9852963,0.00019335438,0.0047165127],"study_design_scores_gemma":[0.00003249284,0.00019527637,0.0064022583,0.000030079813,0.000017175185,0.0009199832,0.0011425844,0.009855771,0.007847121,0.95646715,0.017052071,0.00003792109],"about_ca_topic_score_codex":0.00066450116,"about_ca_topic_score_gemma":0.00049343635,"teacher_disagreement_score":0.0031378097,"about_ca_system_score_codex":0.0010922992,"about_ca_system_score_gemma":0.0005207783,"threshold_uncertainty_score":0.010496974},"labels":[],"label_agreement":null},{"id":"W7006278250","doi":"","title":"There are Ternary Circular Square-Free Words of Length n for n ≥ 18","year":2018,"lang":"en","type":"article","venue":"WinnSpace (University of Winnipeg)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Ternary operation; Word (group theory); Integer (computer science)","score_opus":0.016225733882351604,"score_gpt":0.21164643216202794,"score_spread":0.19542069827967634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7006278250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95914143,0.0013455459,0.010029064,0.0007769163,0.0001488741,0.000027405686,0.0005876764,0.00020749918,0.02773562],"genre_scores_gemma":[0.9702326,0.00045343227,0.012925248,0.0002403016,0.00004729915,0.000059878697,0.00075720693,0.00005163934,0.01523246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997533,0.000019315226,0.000020167994,0.00007350797,0.000047669153,0.000086028405],"domain_scores_gemma":[0.99838245,0.0006384782,0.00042601884,0.00013140294,0.0002183081,0.00020346067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018093025,0.00035954942,0.00031106273,0.0003876564,0.0013509806,0.0009203268,0.00034398682,0.0006288886,0.009951788],"category_scores_gemma":[0.0011925373,0.00030530643,0.0004457911,0.00055327726,0.00082369766,0.0013045992,0.0009451678,0.00034313084,0.0016124739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0054002185,0.0004422344,0.07490461,0.0019633402,0.0001269989,0.008157424,0.010376216,0.00338209,0.30091023,0.30181006,0.01981883,0.2727077],"study_design_scores_gemma":[0.00036012375,0.0009958828,0.09888368,0.00057012116,0.0002731739,0.00910432,0.010173357,0.009558625,0.19519797,0.38386473,0.2907226,0.00029544457],"about_ca_topic_score_codex":0.0016282898,"about_ca_topic_score_gemma":0.0035703327,"teacher_disagreement_score":0.009951788,"about_ca_system_score_codex":0.00058484916,"about_ca_system_score_gemma":0.0006405798,"threshold_uncertainty_score":0.033292115},"labels":[],"label_agreement":null},{"id":"W7007562860","doi":"","title":"Adolescence and identity in Inuit territory: filmed introspections","year":2021,"lang":"fr","type":"article","venue":"Publication Database IASS (Institute for Advanced Sustainability Studies (IASS))","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Identity (music); Population; Colonisation; Poison control; Portrait","score_opus":0.0304305812654177,"score_gpt":0.3470000003685839,"score_spread":0.3165694191031662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7007562860","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9210238,0.0034668758,0.00051336584,0.007578991,0.00046994202,0.000049112172,0.00015161684,0.000024043573,0.06672224],"genre_scores_gemma":[0.9802679,0.0020021973,0.00018949363,0.0006632953,0.0000713809,0.000025625226,0.00005757774,0.000037194488,0.016685413],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99927634,0.0003513256,0.000020896605,0.00007924096,0.00009209206,0.0001801253],"domain_scores_gemma":[0.9990533,0.00049212034,0.00009478169,0.000038426046,0.00010178195,0.00021955506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011981867,0.000518795,0.00033986496,0.0009038411,0.01255597,0.005769268,0.0007049147,0.0012396708,0.004184906],"category_scores_gemma":[0.0022816283,0.00041768828,0.0002910724,0.0008432315,0.008267409,0.0033559261,0.0040822905,0.00419001,0.00037868897],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008913902,0.0000080238015,0.0015598785,0.000020774025,0.00000160959,0.00039773562,0.9936562,0.000006254547,0.00017882515,0.0017404265,0.0010263768,0.0013948218],"study_design_scores_gemma":[0.0000012848376,0.000009426759,0.004405983,0.00009965026,0.000004051156,0.00023747252,0.9642128,0.000028025925,0.0001128491,0.00019326329,0.030686714,0.000008429833],"about_ca_topic_score_codex":0.15088786,"about_ca_topic_score_gemma":0.28486678,"teacher_disagreement_score":0.84911215,"about_ca_system_score_codex":0.0049073193,"about_ca_system_score_gemma":0.0025044587,"threshold_uncertainty_score":0.30001915},"labels":[],"label_agreement":null},{"id":"W7018230187","doi":"","title":"Computation Widths for Alternating Finite Automata","year":2025,"lang":"en","type":"dissertation","venue":"QSpace (Queen's University Library)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Finite-state machine; Decidability; Automaton; Generalization; Set (abstract data type); Parallelism (grammar); Integer (computer science); Computation; Exponential function","score_opus":0.007969632091149615,"score_gpt":0.21204069502908976,"score_spread":0.20407106293794014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7018230187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03680531,0.0006954149,0.9515282,0.00054962793,0.000103068545,0.00015768096,0.00053577236,0.0022599888,0.007364976],"genre_scores_gemma":[0.3222313,0.0006305462,0.6696731,0.0004318053,0.00015052734,0.0005239445,0.0011286181,0.0008395785,0.0043905117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99505484,0.00094156794,0.00068773876,0.0015489205,0.0012632906,0.0005035786],"domain_scores_gemma":[0.98672825,0.008647895,0.0010052001,0.002212374,0.0009634042,0.00044288093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025631886,0.0014424669,0.0011852093,0.0017542029,0.0012280324,0.0047529186,0.0026325742,0.0015304806,0.0061040325],"category_scores_gemma":[0.022059908,0.0010775102,0.002939922,0.0020128195,0.002503362,0.01130663,0.0047663585,0.0044738073,0.0013975585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004529354,0.00012727613,0.0022192218,0.00065756845,0.00009175279,0.00014341134,0.0008515101,0.064942196,0.0128623005,0.7692057,0.0042016027,0.1442446],"study_design_scores_gemma":[0.000029167077,0.000056725163,0.00018133692,0.00009551575,0.000046009467,0.000138869,0.00012062699,0.14046128,0.006736328,0.8460147,0.0060777236,0.000041757838],"about_ca_topic_score_codex":0.0010903775,"about_ca_topic_score_gemma":0.0014042218,"teacher_disagreement_score":0.0061040325,"about_ca_system_score_codex":0.002449191,"about_ca_system_score_gemma":0.0015640603,"threshold_uncertainty_score":0.020420015},"labels":[],"label_agreement":null},{"id":"W7022341136","doi":"","title":"","year":2024,"lang":"es","type":"other","venue":"Directory of Open access Books (OAPEN Foundation)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; McGill University","keywords":"Center (category theory); Unit (ring theory); Socialism; Research center; History of science","score_opus":0.08062522829405998,"score_gpt":0.40759108183262066,"score_spread":0.32696585353856067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7022341136","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002298216,0.016346406,0.0039988,0.0045287693,0.003906319,0.000022854802,0.00046564091,0.0003899565,0.968043],"genre_scores_gemma":[0.025088653,0.014655052,0.0026924384,0.0012285435,0.0014389384,0.000035078974,0.0007445253,0.0002718513,0.9538449],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972004,0.000043648044,0.000012704098,0.00005193224,0.00014360069,0.000027955559],"domain_scores_gemma":[0.9997559,0.000082754625,0.000011769776,0.000043781183,0.00006490122,0.000040791507],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020822907,0.00042410867,0.00034583546,0.0012164442,0.0013437996,0.0037342634,0.0003752205,0.00044269275,0.08376536],"category_scores_gemma":[0.0008182232,0.00018259333,0.00029118455,0.0021097118,0.0012202506,0.0024116416,0.0010303692,0.00085879466,0.050307117],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038580492,0.000024066298,0.00033445266,0.00022771145,0.000005799386,0.000064388914,0.0015265148,0.00018685305,0.00063130213,0.21549642,0.56745696,0.21400705],"study_design_scores_gemma":[9.566704e-7,0.0000035519345,0.00018679968,0.00004307605,8.9696715e-7,0.000058239886,0.00019776262,0.000047733207,0.00005993192,0.010107164,0.989292,0.0000018033351],"about_ca_topic_score_codex":0.0016766893,"about_ca_topic_score_gemma":0.0037674445,"teacher_disagreement_score":0.9162346,"about_ca_system_score_codex":0.0010849434,"about_ca_system_score_gemma":0.0007254926,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W7023854535","doi":"","title":"The physiographical basis of human geography in Quebec","year":2016,"lang":"en","type":"other","venue":"OpenBU (Boston University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Basis (linear algebra); Field (mathematics); Human geography; Work (physics)","score_opus":0.005272788216648633,"score_gpt":0.20318014255734423,"score_spread":0.1979073543406956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023854535","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6377502,0.008340134,0.00922579,0.011668638,0.00020423753,0.00009247194,0.009913443,0.00012988456,0.32267514],"genre_scores_gemma":[0.9760163,0.0010321268,0.00092852267,0.000087245884,0.00001727163,0.00001244119,0.0005160545,0.000014112365,0.021375924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996877,0.00008853716,0.000012913195,0.0000522597,0.00006812402,0.00009045681],"domain_scores_gemma":[0.99935,0.00017062304,0.00008314979,0.0000452395,0.0002709358,0.00008002358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032115504,0.00016243024,0.00020689599,0.0021760943,0.0027144665,0.0024029536,0.00064316986,0.00033163634,0.015498875],"category_scores_gemma":[0.0014676026,0.00013474097,0.00019528402,0.0063251746,0.0019537888,0.00083260407,0.0006557829,0.00038508658,0.0003645805],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010437574,0.00005399121,0.11305594,0.00021438007,0.00010250512,0.00077555433,0.012325209,0.010146493,0.00089951383,0.7489394,0.02179401,0.09158862],"study_design_scores_gemma":[0.00003392503,0.00003334163,0.4777604,0.0005461158,0.00006576288,0.00034560787,0.022116033,0.02115049,0.00046805225,0.12617642,0.35119218,0.0001116998],"about_ca_topic_score_codex":0.9845322,"about_ca_topic_score_gemma":0.99002725,"teacher_disagreement_score":0.023450878,"about_ca_system_score_codex":0.023450878,"about_ca_system_score_gemma":0.014632559,"threshold_uncertainty_score":0.17014885},"labels":[],"label_agreement":null},{"id":"W7025205473","doi":"","title":"Trois-Rivières – Rivière du Petit-Carbet","year":2022,"lang":"fr","type":"other","venue":"Industrias Culturais (Universidade de Coimbra)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"West indies; Medium term; Context (archaeology); Field (mathematics)","score_opus":0.021747198421171503,"score_gpt":0.22196300152248002,"score_spread":0.20021580310130851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025205473","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088686556,0.003786255,0.005718533,0.0030486132,0.0006407938,0.00006914843,0.00054451195,0.0002594559,0.8972461],"genre_scores_gemma":[0.42010558,0.0013837318,0.0046916567,0.00026845527,0.0000911275,0.000044413264,0.00030148443,0.0002641334,0.57284945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959046,0.00008346402,0.000009347461,0.00010807467,0.0001318698,0.00007681474],"domain_scores_gemma":[0.99965584,0.00009391504,0.000057476882,0.000050655635,0.0000889772,0.00005315616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032029918,0.00030601982,0.00018654336,0.00061653776,0.0035501975,0.00299842,0.00046415266,0.00073187257,0.03459762],"category_scores_gemma":[0.0007880815,0.00018970927,0.00027301276,0.00082564884,0.0020129536,0.0009859678,0.00091246585,0.0011986044,0.004239928],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059713627,0.000041695752,0.008872161,0.0003318903,0.000032871412,0.002666455,0.023863003,0.0013564343,0.006333386,0.73486966,0.054710917,0.16632435],"study_design_scores_gemma":[0.0000139110425,0.00003340642,0.010939896,0.00010256436,0.000004747505,0.000614524,0.003290187,0.00033038663,0.001197004,0.0068403534,0.9766119,0.000021114265],"about_ca_topic_score_codex":0.064509645,"about_ca_topic_score_gemma":0.13272916,"teacher_disagreement_score":0.064509645,"about_ca_system_score_codex":0.0033938775,"about_ca_system_score_gemma":0.0017196211,"threshold_uncertainty_score":0.1282683},"labels":[],"label_agreement":null},{"id":"W7097080367","doi":"","title":"On Sparse Languages Such That LL= \\\\Sigma*","year":2007,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cardinality (data modeling); Notation; Generalization; Fraction (chemistry); Set (abstract data type); Constant (computer programming); Regular language","score_opus":0.015787304185732133,"score_gpt":0.26086181464364183,"score_spread":0.2450745104579097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097080367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5048087,0.0017486496,0.42253512,0.0048297145,0.0002533214,0.00018437418,0.0018897442,0.00086322887,0.06288714],"genre_scores_gemma":[0.8923777,0.00078888435,0.08812115,0.0010075398,0.0003903045,0.0005019008,0.0019944306,0.0002129686,0.014605118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987533,0.0003779791,0.000091883885,0.00028904233,0.00026088778,0.00022691562],"domain_scores_gemma":[0.993206,0.0043485477,0.0007981124,0.00066928874,0.00054343056,0.00043452127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011206132,0.00048108603,0.0006034919,0.0009834915,0.0013003746,0.0015201349,0.0005612043,0.0008648443,0.0051031993],"category_scores_gemma":[0.007063287,0.00037347022,0.000602231,0.0011392637,0.0029039227,0.0045485445,0.0023350925,0.0013461064,0.0009374481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020709816,0.0000487621,0.0012280426,0.00018000585,0.000022432545,0.00029534262,0.0009673538,0.005472752,0.0072182924,0.95541894,0.0042426423,0.024698332],"study_design_scores_gemma":[0.000038201615,0.000066277324,0.0007467307,0.000062973,0.000015459183,0.00056013966,0.00037430602,0.023575826,0.0020114898,0.9635151,0.009006266,0.00002712188],"about_ca_topic_score_codex":0.0004806705,"about_ca_topic_score_gemma":0.0006633587,"teacher_disagreement_score":0.0051031993,"about_ca_system_score_codex":0.00081231474,"about_ca_system_score_gemma":0.00061441626,"threshold_uncertainty_score":0.017071903},"labels":[],"label_agreement":null},{"id":"W7099777956","doi":"","title":"Council of Canada.","year":2012,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.02242976058912066,"score_gpt":0.18304500531874285,"score_spread":0.1606152447296222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099777956","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011837251,0.0059490846,0.0015907902,0.010417938,0.0015881815,0.00013176768,0.051338024,0.0017822022,0.9260183],"genre_scores_gemma":[0.0035076805,0.0021935513,0.0010742949,0.00068473927,0.000045231078,0.000027114005,0.007978196,0.00027619672,0.9842129],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988091,0.000066300025,0.000033800465,0.00020927079,0.00060248526,0.00027898638],"domain_scores_gemma":[0.9958906,0.0002981081,0.00008361051,0.00030528204,0.0024953384,0.0009269861],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00093229575,0.0010429526,0.0011453617,0.0022173242,0.003524895,0.0046501085,0.0023421738,0.0023678287,0.62714857],"category_scores_gemma":[0.0028895014,0.00065567164,0.0004642564,0.004074108,0.0010045345,0.0016900364,0.0018588533,0.001673405,0.3643328],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102405436,0.000038648897,0.0004956168,0.0002173641,0.00000835676,0.0000963843,0.00013137498,0.00010591116,0.00045433926,0.011029269,0.91948634,0.06783389],"study_design_scores_gemma":[0.000010196489,0.0000070548567,0.0008870678,0.00008071531,0.000004786451,0.000040077073,0.0001543269,0.00006953538,0.00014725524,0.0008509129,0.9977398,0.000008303494],"about_ca_topic_score_codex":0.7902089,"about_ca_topic_score_gemma":0.8843221,"teacher_disagreement_score":0.7902089,"about_ca_system_score_codex":0.011544059,"about_ca_system_score_gemma":0.031808607,"threshold_uncertainty_score":0.53182733},"labels":[],"label_agreement":null},{"id":"W7110165342","doi":"10.4230/lipics.cpm.2025.11","title":"On Palindromic Periodicities","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Palindrome; Prefix; Palindromic sequence; Word (group theory); Sequence (biology)","score_opus":0.006257707685843562,"score_gpt":0.24302485724839054,"score_spread":0.236767149562547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110165342","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7516774,0.0038058527,0.15481979,0.0007765798,0.00033521524,0.00010915957,0.00040177332,0.00029086033,0.0877833],"genre_scores_gemma":[0.9552875,0.0011527675,0.033453353,0.00018381169,0.00043482322,0.00016633818,0.00033143896,0.00006326975,0.008926772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907035,0.00014415148,0.0001030326,0.00038483972,0.00017373997,0.0001239333],"domain_scores_gemma":[0.9975103,0.0014180614,0.00037617894,0.00030000985,0.00021190602,0.00018352269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007699784,0.00061486533,0.00054762803,0.0016187832,0.0013290505,0.0012084473,0.00056704757,0.000662585,0.0045526116],"category_scores_gemma":[0.0028485532,0.00032301032,0.00042435477,0.001258788,0.003354692,0.003137613,0.0012398255,0.00093649334,0.0008244967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017725903,0.000060160222,0.0018878803,0.00023215577,0.000016052223,0.0010032578,0.0015282347,0.0028752412,0.016075036,0.94129467,0.0007645284,0.034085564],"study_design_scores_gemma":[0.000028797953,0.00026612313,0.0019982052,0.00007641479,0.00002536275,0.0011750954,0.00053892273,0.010252752,0.0064727585,0.96684283,0.012282528,0.00004021147],"about_ca_topic_score_codex":0.00027362068,"about_ca_topic_score_gemma":0.00024713107,"teacher_disagreement_score":0.0045526116,"about_ca_system_score_codex":0.00059121253,"about_ca_system_score_gemma":0.00026945295,"threshold_uncertainty_score":0.01523},"labels":[],"label_agreement":null},{"id":"W7116681940","doi":"10.1016/j.tcs.2025.115721","title":"A self-generating sequence","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Sequence (biology); Mathematical proof; Connection (principal bundle); Term (time); Property (philosophy)","score_opus":0.00951093124382479,"score_gpt":0.2583813853861232,"score_spread":0.24887045414229841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116681940","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4217357,0.0007172932,0.35876533,0.0029481412,0.0016596813,0.00033074495,0.0014971724,0.0019406455,0.21040529],"genre_scores_gemma":[0.8308667,0.00047845818,0.054102194,0.0005750707,0.00054799684,0.0003870265,0.001316112,0.00043336645,0.11129304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994779,0.0001253468,0.00003497506,0.00012679523,0.00014234462,0.00009250943],"domain_scores_gemma":[0.9972754,0.0014762792,0.00012723124,0.00025606295,0.00060308696,0.0002619194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059300155,0.0006958267,0.00041737544,0.0017121516,0.0016809264,0.001712842,0.0005581979,0.0011819804,0.017145608],"category_scores_gemma":[0.0023729368,0.0003256624,0.00063102116,0.0008999085,0.0011647402,0.002299012,0.0012545664,0.001247539,0.0047635413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107263164,0.000114440605,0.00068912475,0.00011972829,0.000022270817,0.00052013324,0.000438256,0.00070689764,0.012994914,0.9537802,0.004876649,0.025630066],"study_design_scores_gemma":[0.000044500604,0.000100841535,0.00079518225,0.00003985719,0.000028157894,0.0013118937,0.00018092008,0.007494936,0.011564268,0.9508251,0.027581206,0.000033105032],"about_ca_topic_score_codex":0.0001269901,"about_ca_topic_score_gemma":0.000110307614,"teacher_disagreement_score":0.017145608,"about_ca_system_score_codex":0.00040383884,"about_ca_system_score_gemma":0.0005814653,"threshold_uncertainty_score":0.057357788},"labels":[],"label_agreement":null},{"id":"W7133057181","doi":"","title":"Canonical equivalence relations","year":2002,"lang":"","type":"dissertation","venue":"TSpace","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Equivalence relation; Equivalence (formal languages); Quotient algebra; Property (philosophy); Type (biology); Logical equivalence; Relation (database); Congruence relation","score_opus":0.03317110921045126,"score_gpt":0.3327673224710263,"score_spread":0.29959621326057506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133057181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054167483,0.001367586,0.7465788,0.0021338665,0.0009934267,0.00018542608,0.0005615857,0.0006463858,0.19336538],"genre_scores_gemma":[0.70666426,0.0020570983,0.21602705,0.0012171515,0.0010248036,0.00046963381,0.0019576496,0.00066439895,0.069917984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99538136,0.0013393686,0.00030432965,0.0014803051,0.00092110573,0.0005734489],"domain_scores_gemma":[0.99659854,0.0012727289,0.0001667569,0.000764457,0.00094487186,0.00025260137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002928991,0.00070418516,0.00086155516,0.0016096766,0.0024078956,0.0036640777,0.0013413994,0.0010155326,0.016337622],"category_scores_gemma":[0.0061566583,0.000612011,0.0014227756,0.0014663258,0.003720169,0.01145197,0.0039279973,0.0039684195,0.0042429487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004846994,0.00000853152,0.000041109062,0.000011862952,0.0000014713748,0.000012207243,0.00008743168,0.000101692945,0.000120911776,0.99515605,0.000566237,0.0038876391],"study_design_scores_gemma":[0.0000070868214,0.000008772121,0.000044111202,0.0000142256495,0.000004412111,0.0000445299,0.000105641324,0.0013176673,0.0004408225,0.98381364,0.014192932,0.0000061265555],"about_ca_topic_score_codex":0.0009207973,"about_ca_topic_score_gemma":0.0008892633,"teacher_disagreement_score":0.016337622,"about_ca_system_score_codex":0.0016396545,"about_ca_system_score_gemma":0.0011154535,"threshold_uncertainty_score":0.054654837},"labels":[],"label_agreement":null},{"id":"W72689024","doi":"10.1007/978-1-4614-1695-1_26","title":"Decidable Containment Problems of Rational Word Relations","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in electrical engineering","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Decidability; Containment (computer programming); Relation (database); Word (group theory); Rational number; Mathematics; Prefix; Closure (psychology); Arity; Constant (computer programming); Commutative property; Combinatorics; Discrete mathematics; Computer science; Linguistics; Programming language; Law; Philosophy","score_opus":0.008888405961319621,"score_gpt":0.18622989849271201,"score_spread":0.1773414925313924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W72689024","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21282648,0.010840586,0.5722256,0.01260145,0.0007063181,0.00029175245,0.001790896,0.0016856088,0.18703128],"genre_scores_gemma":[0.8087141,0.003980806,0.14750358,0.0012567083,0.0012715105,0.00042090844,0.004288568,0.0006321152,0.0319317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951798,0.0015889985,0.00036748417,0.0012168469,0.0010402567,0.0006065629],"domain_scores_gemma":[0.9756144,0.022241881,0.0004245419,0.0008892074,0.0005843456,0.000245639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027498507,0.0012300735,0.0014928778,0.0012384729,0.002412734,0.007029557,0.0034265122,0.0030562847,0.009442803],"category_scores_gemma":[0.014553104,0.0018961447,0.002403873,0.0023314361,0.0056101084,0.018649315,0.0032402526,0.009132193,0.001317626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012689296,0.00012416337,0.00022847137,0.00037620563,0.00003691845,0.0001971999,0.0013806479,0.0066781193,0.0015672798,0.95277125,0.005754513,0.030758336],"study_design_scores_gemma":[0.000039260965,0.000010141761,0.000085420725,0.000038267637,0.000019307598,0.000082750375,0.00022226035,0.008702874,0.0011817894,0.9854613,0.0041442146,0.000012489567],"about_ca_topic_score_codex":0.0024794966,"about_ca_topic_score_gemma":0.0023491627,"teacher_disagreement_score":0.009442803,"about_ca_system_score_codex":0.0032193277,"about_ca_system_score_gemma":0.0016134322,"threshold_uncertainty_score":0.03158933},"labels":[],"label_agreement":null},{"id":"W75575088","doi":"","title":"Minimum Degree and the Number of Chords.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics","score_opus":0.01162912980185739,"score_gpt":0.2325658678797465,"score_spread":0.2209367380778891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75575088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6755708,0.005748613,0.1986187,0.005567288,0.000854696,0.00015310357,0.0048408895,0.00071093685,0.107934915],"genre_scores_gemma":[0.96107006,0.001331216,0.024377549,0.00016350922,0.00032257926,0.000070956004,0.0008799836,0.00010232945,0.011681744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982723,0.00033472592,0.00014072953,0.0005324925,0.00035814062,0.00036154588],"domain_scores_gemma":[0.9836062,0.009372665,0.0019744951,0.0016269179,0.0011337945,0.002285956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013530968,0.0004646192,0.0011105901,0.001889259,0.001766854,0.005012184,0.0019217968,0.0013344567,0.008547207],"category_scores_gemma":[0.014608049,0.0005539754,0.0006472231,0.0017375131,0.0032543996,0.007190117,0.0018865921,0.00177398,0.001538604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072417496,0.00010689641,0.007252946,0.0004227682,0.00007325852,0.0004203051,0.00086901075,0.008908553,0.007955228,0.9201385,0.008282983,0.044845354],"study_design_scores_gemma":[0.000060255243,0.0000637208,0.0023009845,0.0000699273,0.00005378115,0.0010921371,0.00043626508,0.010211463,0.0030461934,0.97034115,0.012288431,0.00003565908],"about_ca_topic_score_codex":0.00077907497,"about_ca_topic_score_gemma":0.0012629565,"teacher_disagreement_score":0.008547207,"about_ca_system_score_codex":0.001465498,"about_ca_system_score_gemma":0.0007129027,"threshold_uncertainty_score":0.028593302},"labels":[],"label_agreement":null},{"id":"W76241432","doi":"10.1007/978-3-642-39310-5_21","title":"Comparisons between Measures of Nondeterminism on Finite Automata","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; TRACE (psycholinguistics); Tree (set theory); Nondeterministic finite automaton; Computation; Automaton; Exponential function; Computer science; Function (biology); Finite-state machine; Deterministic finite automaton; Discrete mathematics; Tree automaton; Mathematics; Algorithm; Combinatorics; Automata theory; Theoretical computer science","score_opus":0.04331961617756693,"score_gpt":0.26054602926907344,"score_spread":0.2172264130915065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76241432","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57722455,0.008799171,0.3457097,0.0030853227,0.00058188953,0.00011824893,0.0012042426,0.00045873836,0.06281815],"genre_scores_gemma":[0.9658233,0.0010288416,0.029228123,0.000125963,0.0003850942,0.00013256015,0.0004800871,0.000118178235,0.0026778472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98905677,0.004660816,0.0008664984,0.0017607627,0.0030398755,0.0006152838],"domain_scores_gemma":[0.8776561,0.10333478,0.0049485,0.006957123,0.004799097,0.0023042848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009776081,0.00082625565,0.0015317576,0.0050149453,0.0013737475,0.006861016,0.002183428,0.0020864636,0.0064650206],"category_scores_gemma":[0.06219976,0.0009640882,0.0011350791,0.0042499756,0.005111529,0.020116415,0.0030435058,0.0026568829,0.00039645348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002071216,0.000028898983,0.0016650785,0.0001200714,0.000044443797,0.00004580088,0.00048409245,0.0040071793,0.0008615918,0.97660214,0.0005716452,0.015362069],"study_design_scores_gemma":[0.000013772401,0.00007085663,0.0014046415,0.000049418653,0.000022335698,0.00009038214,0.00018319945,0.011447297,0.00070583256,0.9843853,0.0016045948,0.000022349548],"about_ca_topic_score_codex":0.0002869482,"about_ca_topic_score_gemma":0.00030111117,"teacher_disagreement_score":0.009776081,"about_ca_system_score_codex":0.0029968082,"about_ca_system_score_gemma":0.00077146816,"threshold_uncertainty_score":0.051701486},"labels":[],"label_agreement":null},{"id":"W779556307","doi":"10.1007/978-3-319-19225-3_18","title":"Quasi-Distances and Weighted Finite Automata","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Automaton; Finite-state machine; Algorithm; Theoretical computer science","score_opus":0.01961018906781621,"score_gpt":0.24542673802829337,"score_spread":0.22581654896047715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W779556307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097156204,0.018699238,0.7290912,0.0029644934,0.0020944644,0.00007057959,0.0005069856,0.0004333154,0.14898352],"genre_scores_gemma":[0.72574604,0.0105057815,0.16434807,0.00085639814,0.0019481636,0.00032597283,0.00075638015,0.00043185495,0.095081426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991748,0.00022388485,0.00007161757,0.00020122781,0.00026304994,0.0000655106],"domain_scores_gemma":[0.9988306,0.0006735946,0.000089438145,0.00015529967,0.00017558363,0.000075425014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068185345,0.0006691489,0.00075569795,0.0013031928,0.0010927311,0.0022168958,0.0011288379,0.0008713491,0.007332473],"category_scores_gemma":[0.0025145486,0.0005082638,0.0007010357,0.001974008,0.0023071482,0.006217715,0.0015433413,0.0023536494,0.0010672442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009552556,0.0000051833076,0.00004424072,0.00004225285,0.0000046069385,0.000016071775,0.00007830074,0.00090162887,0.00047220985,0.9873706,0.000813916,0.010241329],"study_design_scores_gemma":[0.0000020282298,0.0000060106327,0.000041664603,0.000010180996,0.000003116771,0.000030048923,0.000026105938,0.0017531076,0.0001673233,0.9923408,0.005615206,0.0000044637086],"about_ca_topic_score_codex":0.0007007175,"about_ca_topic_score_gemma":0.00075507525,"teacher_disagreement_score":0.007332473,"about_ca_system_score_codex":0.0014267531,"about_ca_system_score_gemma":0.00046376302,"threshold_uncertainty_score":0.024529576},"labels":[],"label_agreement":null},{"id":"W785014139","doi":"","title":"Exactness of Proximal Groupoid Homomorphisms","year":2015,"lang":"tr","type":"article","venue":"DergiPark (Istanbul University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Homomorphism; Mathematics; Humanities; Combinatorics; Philosophy","score_opus":0.029678235323987362,"score_gpt":0.20481526789448384,"score_spread":0.17513703257049648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W785014139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40242726,0.0009017518,0.5583671,0.00082421757,0.00020525615,0.00011138106,0.00037221287,0.00039287016,0.036397967],"genre_scores_gemma":[0.9412535,0.00038348034,0.047147032,0.00014283934,0.00012591829,0.00009209472,0.00027655,0.00006210682,0.0105164945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687576,0.0006313572,0.0002861911,0.0010408704,0.0008650472,0.0003007764],"domain_scores_gemma":[0.99651295,0.0012403375,0.00042506505,0.0006246675,0.0007637684,0.00043333462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001837032,0.0003750653,0.0005825701,0.0020976819,0.0018783128,0.0030603646,0.00086056313,0.0009185931,0.005508548],"category_scores_gemma":[0.006184233,0.00043949907,0.0009800835,0.0012015703,0.003981572,0.007827653,0.0036999388,0.0019893139,0.0007041922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027046706,0.000014763213,0.00041006794,0.000035489757,0.000009496188,0.0001298705,0.0010328784,0.0007739266,0.0011142546,0.98971075,0.00014972544,0.006591803],"study_design_scores_gemma":[0.000012727688,0.000052618685,0.0003012405,0.0000170469,0.00001185799,0.00030224826,0.00047821095,0.0049186815,0.0013105586,0.98808926,0.004484921,0.000020574571],"about_ca_topic_score_codex":0.00066183525,"about_ca_topic_score_gemma":0.00041372844,"teacher_disagreement_score":0.005508548,"about_ca_system_score_codex":0.0012570089,"about_ca_system_score_gemma":0.00056078,"threshold_uncertainty_score":0.018427908},"labels":[],"label_agreement":null},{"id":"W796701085","doi":"10.1007/s00236-015-0245-y","title":"State complexity of deletion and bipolar deletion","year":2015,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Upper and lower bounds; Deterministic finite automaton; Theory of computation; Combinatorics; State (computer science); Regular language; Matching (statistics); Mathematics; Finite-state machine; Nondeterministic finite automaton; Discrete mathematics; Computational complexity theory; Time complexity; DFA minimization; Automaton; Automata theory; Algorithm; Computer science; Theoretical computer science","score_opus":0.03540657342730158,"score_gpt":0.23946816796394238,"score_spread":0.2040615945366408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W796701085","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7714636,0.0006367267,0.18542846,0.0032554714,0.00009766201,0.000092326,0.0015163111,0.00040669652,0.037102763],"genre_scores_gemma":[0.9850449,0.00026675564,0.007471853,0.000114960494,0.00008498486,0.000075680444,0.0007106831,0.000087019886,0.006143149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978758,0.0005167701,0.00014432351,0.00036870624,0.0006331259,0.0004612889],"domain_scores_gemma":[0.9713109,0.02270707,0.0014043171,0.0017039209,0.0015345755,0.0013393251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019772593,0.0005958198,0.0015187996,0.0016626534,0.0019211153,0.006321935,0.0019652075,0.001961641,0.014221417],"category_scores_gemma":[0.01759791,0.0007156732,0.0015946947,0.0021402196,0.0030412509,0.011277941,0.003026035,0.0033019327,0.00067513407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035286488,0.00007381876,0.0016854971,0.00012260088,0.000028470036,0.00017133956,0.00070241676,0.025189044,0.0014957007,0.95916206,0.0016402098,0.009376048],"study_design_scores_gemma":[0.000038546008,0.000024260637,0.0006424452,0.000014599055,0.000026363443,0.000103631115,0.00016559716,0.07766016,0.00087914657,0.9196923,0.00072622305,0.000026850543],"about_ca_topic_score_codex":0.0027703529,"about_ca_topic_score_gemma":0.0019264687,"teacher_disagreement_score":0.014221417,"about_ca_system_score_codex":0.0023379305,"about_ca_system_score_gemma":0.001601212,"threshold_uncertainty_score":0.047575414},"labels":[],"label_agreement":null},{"id":"W801472226","doi":"10.1007/978-3-319-19225-3_4","title":"Nondeterministic Tree Width of Regular Languages","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Prince Edward Island","funders":"","keywords":"Computer science; Nondeterministic algorithm; Programming language; Tree (set theory); Theoretical computer science; Mathematics; Combinatorics","score_opus":0.01794984032262465,"score_gpt":0.2570241980910572,"score_spread":0.23907435776843255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W801472226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29448342,0.002582841,0.6234864,0.0015009892,0.00031614065,0.000086429354,0.0009500323,0.0014140896,0.07517959],"genre_scores_gemma":[0.89240605,0.0010680093,0.08593372,0.00020625339,0.00024926572,0.00016830282,0.00073234073,0.00083964,0.018396419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987698,0.0002730475,0.00011211064,0.0003170592,0.00036215133,0.0001657482],"domain_scores_gemma":[0.9954124,0.0031175283,0.00026160022,0.0006483002,0.0003398887,0.00022026068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012095406,0.0004090721,0.00068468304,0.0009008573,0.00081125455,0.002819068,0.0016467402,0.00075488526,0.0053574336],"category_scores_gemma":[0.0073275184,0.0008043227,0.0007148117,0.001276144,0.0015774297,0.00699344,0.0018588478,0.0029515952,0.00092376355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017085744,0.00003444127,0.00041102982,0.00014043254,0.00001086773,0.00006115959,0.0004626796,0.006078828,0.006253584,0.95057696,0.001629434,0.03416963],"study_design_scores_gemma":[0.000018361698,0.000020241194,0.00019991123,0.000030932173,0.000013665622,0.00007267901,0.00006289928,0.018116739,0.0031721783,0.974378,0.003900062,0.000014340419],"about_ca_topic_score_codex":0.0004447853,"about_ca_topic_score_gemma":0.00053800666,"teacher_disagreement_score":0.0053574336,"about_ca_system_score_codex":0.0010982957,"about_ca_system_score_gemma":0.0007555949,"threshold_uncertainty_score":0.017922461},"labels":[],"label_agreement":null},{"id":"W847683642","doi":"10.1016/j.tcs.2015.07.006","title":"Operational state complexity of unary NFAs with finite nondeterminism","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Science Council","keywords":"Unary operation; Concatenation (mathematics); TRACE (psycholinguistics); Regular language; State (computer science); Discrete mathematics; Upper and lower bounds; Property (philosophy); Mathematics; Tree (set theory); Computer science; Combinatorics; Finite-state machine; Algorithm; Theoretical computer science; Automaton","score_opus":0.033405676861885426,"score_gpt":0.2602477206608893,"score_spread":0.22684204379900388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W847683642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.815486,0.00041239604,0.16516769,0.0021548362,0.00006605303,0.00009217051,0.0008593757,0.00049766834,0.015263751],"genre_scores_gemma":[0.98978055,0.00011759011,0.007703299,0.00007538417,0.00006843871,0.000060544113,0.00034859544,0.000074032214,0.0017715162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993846,0.0013931884,0.0005198537,0.0011379197,0.0018101401,0.0012928027],"domain_scores_gemma":[0.9522688,0.038036413,0.0025567808,0.0036875973,0.0020452556,0.0014051751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034442425,0.00065209216,0.0018630667,0.0017435023,0.0017547599,0.008229125,0.002810506,0.0019465254,0.008083137],"category_scores_gemma":[0.023835838,0.000849807,0.0022940333,0.0016655735,0.0041021765,0.016054647,0.0032055597,0.0039018665,0.00046889094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005927876,0.00019885744,0.0038905744,0.00022112482,0.00009042547,0.000283244,0.0012710821,0.069534265,0.0035648106,0.9048467,0.0013192632,0.01418683],"study_design_scores_gemma":[0.00004595961,0.0000404443,0.00069062406,0.000020001227,0.00004691764,0.0000883298,0.00014036077,0.1481396,0.001701427,0.8485956,0.00045312862,0.000037507598],"about_ca_topic_score_codex":0.0035331422,"about_ca_topic_score_gemma":0.0028740745,"teacher_disagreement_score":0.008229125,"about_ca_system_score_codex":0.0039004765,"about_ca_system_score_gemma":0.0026929164,"threshold_uncertainty_score":0.028300107},"labels":[],"label_agreement":null},{"id":"W92501153","doi":"10.37236/12156","title":"Computation in Coxeter Groups—I. Multiplication","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Coxeter group; Mathematics; Coxeter element; Artin group; Coxeter complex; Multiplication (music); Computation; Mathematical proof; Reflection (computer programming); Combinatorics; Algebra over a field; Algorithm; Pure mathematics; Computer science; Geometry; Programming language","score_opus":0.010280974980870687,"score_gpt":0.21943738770983814,"score_spread":0.20915641272896746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W92501153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06709658,0.0019998231,0.8677091,0.0011354258,0.00049061544,0.00015668935,0.00026516386,0.0018945666,0.059252035],"genre_scores_gemma":[0.5658866,0.0013754742,0.40560842,0.00030985748,0.00050425396,0.00023493086,0.00062278396,0.0006609713,0.024796696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887437,0.00027583327,0.000084533414,0.0002855145,0.00032243683,0.00015722426],"domain_scores_gemma":[0.99904865,0.00043017764,0.00007478874,0.00026790542,0.00010633132,0.0000721491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011355532,0.0008787614,0.0008275282,0.0011788101,0.0014573892,0.0038741434,0.00164247,0.0008577213,0.014073389],"category_scores_gemma":[0.0033470944,0.00054632674,0.0011384371,0.0015817614,0.003263985,0.008329639,0.002859687,0.0017248129,0.0035963166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016896919,0.00005054627,0.0005826122,0.00020452974,0.000021668497,0.00012963437,0.00038201624,0.0031134079,0.0032631548,0.90186036,0.005662018,0.084561035],"study_design_scores_gemma":[0.00003747059,0.00007815368,0.00021099279,0.000041105028,0.00001566446,0.00023981484,0.00013637642,0.012794993,0.0059801387,0.9580066,0.02242611,0.00003255585],"about_ca_topic_score_codex":0.00057646807,"about_ca_topic_score_gemma":0.0004900292,"teacher_disagreement_score":0.014073389,"about_ca_system_score_codex":0.0012162043,"about_ca_system_score_gemma":0.00070126087,"threshold_uncertainty_score":0.04708022},"labels":[],"label_agreement":null},{"id":"W95660754","doi":"","title":"Languages convex with respect to binary relations, and their closure properties","year":2009,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Prefix; Closure (psychology); Suffix; Mathematics; Regular language; Prefix code; Abstract family of languages; Set (abstract data type); Regular polygon; Combinatorics; Discrete mathematics; Computer science; Linguistics; Theoretical computer science; Programming language; Algorithm; Second-generation programming language; Decoding methods; Block code; Linear code","score_opus":0.008254940453334412,"score_gpt":0.2102712785417305,"score_spread":0.20201633808839609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95660754","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5207175,0.00164776,0.38714218,0.0015951558,0.00024063187,0.00020634652,0.0014526739,0.0006352557,0.086362466],"genre_scores_gemma":[0.9152223,0.0008587485,0.06764612,0.00030107787,0.00038376282,0.00036541422,0.0013375134,0.00022750818,0.013657672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968622,0.00069128984,0.00037248625,0.0006955675,0.0009789253,0.0003995596],"domain_scores_gemma":[0.99247676,0.0040712417,0.0008615886,0.00081133615,0.0011696981,0.0006093727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016887916,0.0006193671,0.00068278523,0.0022256593,0.0020463879,0.0044310275,0.0007949686,0.00079166616,0.0041003907],"category_scores_gemma":[0.008576796,0.0006280839,0.0011097905,0.0015365126,0.006097137,0.0060569793,0.002287034,0.0015945815,0.0006257617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046922767,0.000018477844,0.00033833142,0.00004101976,0.00001115779,0.00025574255,0.0009956768,0.0018011796,0.0025178867,0.98668194,0.0005026961,0.006788984],"study_design_scores_gemma":[0.000024066574,0.00004641697,0.0005593818,0.000039640603,0.000015813152,0.00077806145,0.000577419,0.011648617,0.0025572928,0.9741779,0.009541263,0.000034028173],"about_ca_topic_score_codex":0.0022165184,"about_ca_topic_score_gemma":0.0011853041,"teacher_disagreement_score":0.0044310275,"about_ca_system_score_codex":0.0014776052,"about_ca_system_score_gemma":0.0014453522,"threshold_uncertainty_score":0.0137171745},"labels":[],"label_agreement":null}]}