{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":14,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":14,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"9c80b3aca78d","filters":{"venue":"RAIRO - Theoretical Informatics and Applications"}},"results":[{"id":"W2081090714","doi":"10.1051/ita:2005038","title":"On Christoffel classes","year":2005,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Christoffel symbols; Mathematics; Computer science; Arithmetic; Pure mathematics","authors":[{"name":"Jean-Pierre Borel","is_ca":false},{"name":"Christophe Reutenauer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005503843000699254,"gpt":0.2344277857572929,"spread":0.2289239427565936,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007122549,0.0006220802,0.0004758282,0.002143135,0.001713229,0.002269819,0.0006211835,0.0006992152,0.01173309],"category_scores_gemma":[0.002601548,0.000203886,0.0006055739,0.001468244,0.003787492,0.004788756,0.001836882,0.001191799,0.001263345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001721264,"about_ca_system_score_gemma":0.0002907801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006489265,"about_ca_topic_score_gemma":0.0003886581,"domain_scores_codex":[0.9990156,0.0001369377,0.00005752104,0.0002592549,0.0002816244,0.0002491015],"domain_scores_gemma":[0.9985025,0.0005649994,0.0002550412,0.0001967953,0.0002303457,0.0002503767],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002734039,0.00001751484,0.0004844767,0.00002033098,0.000003073873,0.00004403773,0.0001536375,0.0004133284,0.0015171,0.9887243,0.0006029232,0.007991781],"study_design_scores_gemma":[0.00001416951,0.00006110206,0.001621133,0.00001843816,0.00001028523,0.0002418212,0.0002174969,0.004524419,0.003688118,0.9779544,0.01162507,0.00002367952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6939188,0.001017976,0.1341739,0.00121356,0.0002612112,0.0001107234,0.0003754528,0.0002829247,0.1686455],"genre_scores_gemma":[0.9682898,0.0005376876,0.01265302,0.0002328075,0.0002857035,0.00008258274,0.0002611063,0.00008722792,0.01757014],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01173309,"threshold_uncertainty_score":0.03925109,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101596584","doi":"10.1051/ita:2008006","title":"Least Periods of Factors of Infinite Words","year":2008,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Fibonacci number; Word (group theory); Mathematics; Mathematical proof; Set (abstract data type); Integer (computer science); Combinatorics; Product (mathematics); Factor (programming language); Infinite set; Discrete mathematics; Arithmetic; Computer science","authors":[{"name":"James D. Currie","is_ca":true},{"name":"Kalle Saari","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01167135948446676,"gpt":0.2300102654376719,"spread":0.2183389059532051,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006260012,0.0005162359,0.0006253437,0.001316935,0.0009573108,0.00241685,0.000473267,0.0004399002,0.005083234],"category_scores_gemma":[0.003257075,0.000451721,0.0007520384,0.000798945,0.001534783,0.002997166,0.001138454,0.0009830362,0.0007645783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006886297,"about_ca_system_score_gemma":0.0003223305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003186757,"about_ca_topic_score_gemma":0.0003688649,"domain_scores_codex":[0.9993806,0.00009605449,0.00006109742,0.0001848596,0.0001430345,0.0001342897],"domain_scores_gemma":[0.9982166,0.0009511867,0.0003119568,0.0001737346,0.0001807892,0.0001657107],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002340312,0.00002942821,0.002084347,0.0001845473,0.00003244273,0.0003775136,0.000778665,0.003072043,0.02050671,0.949335,0.001433463,0.02193183],"study_design_scores_gemma":[0.00004087876,0.000137724,0.00298807,0.00007442152,0.00005485348,0.000976684,0.0003485676,0.0146705,0.01471398,0.9500974,0.01583239,0.0000645618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.722352,0.002141586,0.2068767,0.0004928974,0.0002255098,0.00005991009,0.0007555429,0.0006083836,0.06648745],"genre_scores_gemma":[0.9667641,0.0005142582,0.02676444,0.0001063181,0.0002662794,0.000086144,0.0003496777,0.0001470267,0.005001675],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005083234,"threshold_uncertainty_score":0.01700509,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Hamoon Mousavi","is_ca":true},{"name":"Luke Schaeffer","is_ca":false},{"name":"Jeffrey Shallit","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01141413856529665,"gpt":0.2635890888508414,"spread":0.2521749502855447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004852324,0.001073495,0.001264714,0.002187605,0.001824453,0.005344085,0.003621071,0.002557265,0.01079101],"category_scores_gemma":[0.02431992,0.0008414473,0.002567451,0.002102763,0.002954343,0.008636977,0.004183446,0.004431383,0.003042612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002762573,"about_ca_system_score_gemma":0.002746939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001624283,"about_ca_topic_score_gemma":0.001677982,"domain_scores_codex":[0.9942448,0.001496869,0.0005581445,0.001429287,0.001621421,0.0006495753],"domain_scores_gemma":[0.9829059,0.01297414,0.0006855387,0.001419353,0.001534716,0.0004803312],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003140489,0.0003020755,0.001616287,0.0003212006,0.00008271218,0.00009323788,0.0004486777,0.01660508,0.003259635,0.8778575,0.007719554,0.09137999],"study_design_scores_gemma":[0.00007257447,0.00006689566,0.0001952583,0.00006404913,0.00003574706,0.00007242009,0.00009565872,0.1231772,0.003337057,0.8686998,0.004151094,0.00003223675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02413258,0.0006005552,0.9578294,0.001191126,0.0001741728,0.0003049266,0.0004518632,0.001173411,0.01414199],"genre_scores_gemma":[0.3544181,0.0006583935,0.6275564,0.001254084,0.0005145271,0.0008362997,0.001959144,0.0004490147,0.01235408],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01079101,"threshold_uncertainty_score":0.03609949,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170247267","doi":"10.1051/ita/2009017","title":"Dejean's conjecture holds for N ≥ 27","year":2009,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Conjecture; Combinatorics; Mathematics; Computer science","authors":[{"name":"James D. Currie","is_ca":true},{"name":"Narad Rampersad","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01474600185359274,"gpt":0.2931907409636114,"spread":0.2784447391100187,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00177473,0.0006169936,0.0008294482,0.001046792,0.004450745,0.002647168,0.001276577,0.001294589,0.01499947],"category_scores_gemma":[0.004784295,0.0002955533,0.001118901,0.0008634668,0.003599062,0.005267784,0.003682994,0.002949714,0.003777491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001194587,"about_ca_system_score_gemma":0.00112248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002090286,"about_ca_topic_score_gemma":0.003843794,"domain_scores_codex":[0.9986916,0.0001650806,0.00004351889,0.0003565448,0.0002065132,0.0005366217],"domain_scores_gemma":[0.996509,0.001508369,0.0003712485,0.0006953321,0.0004927226,0.0004232471],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001752964,0.00005403382,0.002600254,0.0001001301,0.00001468135,0.000439149,0.000346293,0.001795615,0.001147195,0.9536178,0.01911864,0.02059085],"study_design_scores_gemma":[0.00002089792,0.00005178238,0.001319954,0.0000469963,0.00001606682,0.0003535697,0.000330942,0.003321102,0.001296837,0.9445219,0.04869293,0.00002703982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2551293,0.002744282,0.08690006,0.03258866,0.003190587,0.00009108946,0.0007570211,0.0003922753,0.6182066],"genre_scores_gemma":[0.9005772,0.001935016,0.02569531,0.003218906,0.0007797982,0.0001458072,0.0006887956,0.0001141274,0.06684506],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01499947,"threshold_uncertainty_score":0.05017823,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053649470","doi":"10.1051/ita:2003019","title":"On ƒ-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes","year":2003,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hypercube; Computer science; Disjoint sets; Node (physics); Set (abstract data type); Arc (geometry); Routing (electronic design automation); Wavelength-division multiplexing; Computer network; Algorithm; Theoretical computer science; Combinatorics; Mathematics; Wavelength; Parallel computing; Physics","authors":[{"name":"Ján Maňuch","is_ca":true},{"name":"Ladislav Stacho","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007382309847206504,"gpt":0.2297986927931896,"spread":0.2224163829459831,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00161256,0.0005078483,0.000535325,0.001197626,0.0007799006,0.001171683,0.001036497,0.0006692124,0.0009611286],"category_scores_gemma":[0.008813154,0.0003044664,0.0002496087,0.0011872,0.001836231,0.002755846,0.001004948,0.0008335591,0.0001161374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001306802,"about_ca_system_score_gemma":0.0006137032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001182806,"about_ca_topic_score_gemma":0.001125953,"domain_scores_codex":[0.9992406,0.0002893583,0.00004058157,0.0000823368,0.0002188221,0.0001282934],"domain_scores_gemma":[0.9958911,0.002633668,0.000664337,0.0003418183,0.000334182,0.0001348264],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002903409,0.00006136517,0.002632092,0.00008040448,0.0000197685,0.0001214438,0.0002472828,0.8162832,0.004119376,0.1466791,0.0009725069,0.02849314],"study_design_scores_gemma":[0.00002325715,0.00006503677,0.0004128928,0.00001407035,0.00001202846,0.00005710185,0.0001462573,0.8507763,0.003912301,0.1440071,0.0005584932,0.00001528077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5665582,0.0007585808,0.424418,0.000456956,0.00005989573,0.00006462145,0.0001290161,0.0003142286,0.007240455],"genre_scores_gemma":[0.9295226,0.0004642009,0.06808429,0.00005912361,0.00005429007,0.00006668723,0.0001342544,0.0000641147,0.001550379],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00161256,"threshold_uncertainty_score":0.009481549,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jeffrey Shallit","is_ca":true},{"name":"Ramin Zarifi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009138817957750053,"gpt":0.25539041598199,"spread":0.2462515980242399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009454302,0.0006382765,0.0005811108,0.002253495,0.00149193,0.001839469,0.0004989488,0.0009223836,0.007475969],"category_scores_gemma":[0.01006276,0.0002977333,0.0006078804,0.0007155133,0.003226541,0.002689574,0.001420049,0.001433069,0.0008195771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000781909,"about_ca_system_score_gemma":0.0003799474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005610724,"about_ca_topic_score_gemma":0.0004714911,"domain_scores_codex":[0.9995989,0.00007910177,0.00003035262,0.00009122722,0.00009680592,0.0001036568],"domain_scores_gemma":[0.9941268,0.003414672,0.000867699,0.0003906629,0.0005741855,0.0006259667],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002103773,0.00004053353,0.003606693,0.0001618219,0.00002371704,0.0009527973,0.001374194,0.004317394,0.01174767,0.9651355,0.001233905,0.01119553],"study_design_scores_gemma":[0.00005511561,0.0001379404,0.003089566,0.000108901,0.00003938218,0.0007835974,0.000603723,0.0365796,0.01211504,0.9404389,0.005979689,0.00006857535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8448093,0.001728634,0.0936618,0.0008977475,0.0002711411,0.00008298425,0.0001078566,0.0002642264,0.05817631],"genre_scores_gemma":[0.9883477,0.000373722,0.006746096,0.00006593515,0.0002377906,0.00005271232,0.00003642459,0.00005717237,0.004082419],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007475969,"threshold_uncertainty_score":0.02500963,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Dalia Krieger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00819716597446658,"gpt":0.2613758560435292,"spread":0.2531786900690626,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001890177,0.0008029906,0.0008859463,0.003481829,0.001622737,0.00302236,0.0007786582,0.001025936,0.004762332],"category_scores_gemma":[0.009586544,0.0005157312,0.0008452555,0.001045671,0.00340279,0.004652584,0.002262631,0.001988079,0.000506677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002346401,"about_ca_system_score_gemma":0.0005336338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009797581,"about_ca_topic_score_gemma":0.0008547564,"domain_scores_codex":[0.9992858,0.0001451652,0.00006467674,0.0001479782,0.0001418698,0.0002145672],"domain_scores_gemma":[0.9943346,0.00368745,0.0005769671,0.0002961742,0.0005860137,0.0005187149],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001311321,0.00002981045,0.002801287,0.00009722741,0.00001392242,0.0005313826,0.001001098,0.0030111,0.005376807,0.9804178,0.0004644853,0.006123889],"study_design_scores_gemma":[0.00005814568,0.00006906379,0.001649127,0.0001243563,0.00002297381,0.000286566,0.0005003327,0.02568931,0.005046446,0.9634777,0.003029688,0.00004641169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8098894,0.001701491,0.1484965,0.0009182679,0.0001445382,0.0001078407,0.000239683,0.000305432,0.0381969],"genre_scores_gemma":[0.9769996,0.0005352005,0.01745073,0.00008496831,0.00012386,0.0001036702,0.0001296305,0.00008165659,0.00449065],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004762332,"threshold_uncertainty_score":0.0170244,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"James D. Currie","is_ca":true},{"name":"Narad Rampersad","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00508258092233842,"gpt":0.2308513156088359,"spread":0.2257687346864974,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008333037,0.0004962623,0.0007200221,0.0006355385,0.001343339,0.00208563,0.0005185728,0.001278465,0.004130153],"category_scores_gemma":[0.005645853,0.0006355867,0.0005175938,0.0005786595,0.003732187,0.005960814,0.001355031,0.001747915,0.001620176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005896824,"about_ca_system_score_gemma":0.000295194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001794592,"about_ca_topic_score_gemma":0.0002423564,"domain_scores_codex":[0.9991321,0.0002448834,0.00009658379,0.000285629,0.0001353127,0.0001055547],"domain_scores_gemma":[0.9946129,0.003602755,0.0005017941,0.0004462919,0.0005506123,0.0002856095],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005758121,0.00005558586,0.001585084,0.0003466243,0.00002926083,0.0009983965,0.002440406,0.002683596,0.03980535,0.9192808,0.003205723,0.02899338],"study_design_scores_gemma":[0.00004898817,0.0001035087,0.000397385,0.00007253993,0.00002585642,0.0006505802,0.0006980469,0.005547339,0.01643327,0.9570242,0.01895152,0.00004681958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.691191,0.002571908,0.2175254,0.007065486,0.0007652125,0.00004407468,0.0003270473,0.0009648104,0.07954515],"genre_scores_gemma":[0.9333757,0.0004268871,0.04928369,0.0008302378,0.0002691488,0.00007072093,0.0001815094,0.0001902485,0.01537174],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004130153,"threshold_uncertainty_score":0.01381677,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Arithmetic; Discrete mathematics; Algebra over a field; Combinatorics; Pure mathematics","authors":[{"name":"Émilie Charlier","is_ca":true},{"name":"Anne Lacroix","is_ca":false},{"name":"Narad Rampersad","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03686374755198837,"gpt":0.2659644655075115,"spread":0.2291007179555231,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000741284,0.0004966874,0.0007418671,0.00119238,0.001187893,0.003541421,0.0007605264,0.001107274,0.004077361],"category_scores_gemma":[0.003484918,0.0005631174,0.0009565008,0.0007810285,0.002760418,0.004086241,0.002363985,0.001767283,0.0006443046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007783296,"about_ca_system_score_gemma":0.0004794656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004064981,"about_ca_topic_score_gemma":0.0002941604,"domain_scores_codex":[0.9979805,0.0002821791,0.0001801987,0.0007580807,0.000521775,0.0002772466],"domain_scores_gemma":[0.9963185,0.001435411,0.00067311,0.0008570984,0.0004872241,0.0002287507],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002474154,0.0001042274,0.0031802,0.0002372189,0.00005096124,0.000596141,0.00268158,0.009332916,0.03387582,0.9129623,0.001011512,0.03571961],"study_design_scores_gemma":[0.00004107296,0.0001419521,0.002906651,0.00006965981,0.00004084998,0.0008222407,0.0005290532,0.01785459,0.01868627,0.9484755,0.01036308,0.00006914026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6780984,0.0008536206,0.2763024,0.0006456836,0.0001844438,0.00008047634,0.0005387739,0.00151299,0.04178312],"genre_scores_gemma":[0.9663644,0.0001589018,0.0271923,0.0001545339,0.00007197486,0.0001007577,0.0004329517,0.00007357967,0.005450669],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004077361,"threshold_uncertainty_score":0.01364017,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Stavros Konstantinidis","is_ca":true},{"name":"Nelma Moreira","is_ca":false},{"name":"Rogério Reis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01452046165482812,"gpt":0.2547233798938259,"spread":0.2402029182389978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002901012,0.000516529,0.0006353786,0.0006860351,0.0006642092,0.001271278,0.001593523,0.001001106,0.002374555],"category_scores_gemma":[0.01553802,0.0004336288,0.0009470008,0.0005822956,0.002383027,0.002172053,0.001723173,0.001398165,0.0006319074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001290473,"about_ca_system_score_gemma":0.002282237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001635158,"about_ca_topic_score_gemma":0.001830347,"domain_scores_codex":[0.9955041,0.001528437,0.0003758304,0.0009251614,0.001249279,0.0004172317],"domain_scores_gemma":[0.9864682,0.00864969,0.0008635105,0.00244419,0.001342532,0.0002318703],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006621612,0.0001575365,0.002372322,0.0002677093,0.00005591529,0.0004323161,0.0006694045,0.2703163,0.04182953,0.6184033,0.002423305,0.06241024],"study_design_scores_gemma":[0.00009449959,0.0001191221,0.0001492999,0.00003739234,0.00002982556,0.0001031417,0.00005685015,0.8067509,0.04675738,0.1412024,0.004657217,0.00004195718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03503348,0.00005514756,0.9604809,0.0001922903,0.0000589811,0.00009792937,0.0001052656,0.002209917,0.001766103],"genre_scores_gemma":[0.4845988,0.00007376935,0.5108305,0.0001670041,0.00004469011,0.0003960595,0.0003147632,0.0004372818,0.003137044],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002901012,"threshold_uncertainty_score":0.01534224,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Francesco Dolce","is_ca":true},{"name":"Dominique Perrin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01511514287224976,"gpt":0.2738776022512248,"spread":0.258762459378975,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002072099,0.0004238136,0.0006091357,0.001296386,0.001735905,0.002165179,0.001200391,0.0009210079,0.00397283],"category_scores_gemma":[0.005108136,0.0004000388,0.001409199,0.0009385018,0.00576371,0.005263875,0.002925026,0.003564023,0.0007275091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001586578,"about_ca_system_score_gemma":0.000683295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001000768,"about_ca_topic_score_gemma":0.0006822545,"domain_scores_codex":[0.9981198,0.0003903486,0.0001559981,0.0004725179,0.0005384385,0.0003228924],"domain_scores_gemma":[0.9955988,0.002027676,0.0004156893,0.001007393,0.0006438691,0.0003065902],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002629342,0.00001395852,0.0002941003,0.00001754354,0.000003601691,0.00008760385,0.0003141763,0.001171958,0.002090664,0.9908018,0.0001396057,0.005038697],"study_design_scores_gemma":[0.00002177109,0.000055209,0.0004544247,0.0000249215,0.00001363002,0.0002567774,0.0001934007,0.009471281,0.006516169,0.9748766,0.008091129,0.00002449513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1779917,0.0005994812,0.7676135,0.0008630603,0.0001086576,0.0001106608,0.0002213658,0.0004339659,0.05205759],"genre_scores_gemma":[0.8706093,0.0003202781,0.115455,0.0002466701,0.0001113046,0.00017155,0.0002644613,0.0001671315,0.01265434],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00397283,"threshold_uncertainty_score":0.01329041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2747855459","doi":"10.1051/ita/2017013","title":"On avoidability of formulas with reversal","year":2017,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Characterization (materials science); Variable (mathematics); Class (philosophy); Relation (database); Term (time)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01926367236373752,"gpt":0.3021301551937171,"spread":0.2828664828299796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002266863,0.0008889942,0.001183221,0.002406052,0.001942495,0.002518717,0.001537654,0.001123632,0.003574405],"category_scores_gemma":[0.01097753,0.0005101743,0.001927838,0.001753209,0.004159065,0.005858453,0.002994263,0.003588654,0.0003858868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001433657,"about_ca_system_score_gemma":0.001058325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001252231,"about_ca_topic_score_gemma":0.0009328778,"domain_scores_codex":[0.9962944,0.000635936,0.0003980797,0.0008312709,0.001186261,0.0006539808],"domain_scores_gemma":[0.9891347,0.006081062,0.001583236,0.001169913,0.001422019,0.0006090322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000257245,0.00009156412,0.005199241,0.0002531371,0.00007339276,0.00089016,0.0009948091,0.003849801,0.006037233,0.962203,0.0008572676,0.01929309],"study_design_scores_gemma":[0.00005033821,0.0001512736,0.001415669,0.00005184818,0.00008422333,0.0009632243,0.000371104,0.01172002,0.003510426,0.9767042,0.004923113,0.00005452194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7380265,0.001920302,0.224586,0.001392575,0.0001655736,0.00008622472,0.0005659025,0.0006250764,0.03263182],"genre_scores_gemma":[0.9660473,0.0006646896,0.02773397,0.0003109935,0.0002967459,0.00008848745,0.0006998399,0.0001566946,0.00400126],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003574405,"threshold_uncertainty_score":0.01198852,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","authors":[{"name":"Daniel Gabrić","is_ca":true},{"name":"Jeffrey Shallit","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008547743220322503,"gpt":0.2370078059017377,"spread":0.2284600626814152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007596695,0.0004433256,0.0005939099,0.0005152696,0.001897699,0.001808288,0.0008190001,0.001051852,0.01022522],"category_scores_gemma":[0.002734358,0.0004472157,0.0008606788,0.0005129373,0.003366379,0.004040522,0.002696845,0.0019248,0.003114385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005389115,"about_ca_system_score_gemma":0.0006680583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002317531,"about_ca_topic_score_gemma":0.000374302,"domain_scores_codex":[0.9991834,0.0002241051,0.00007673696,0.0002224251,0.0002036775,0.00008972171],"domain_scores_gemma":[0.9979075,0.0007159307,0.0001903821,0.0006062085,0.0003253039,0.000254622],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003395083,0.00005930602,0.001019528,0.00047429,0.00002712163,0.0006716549,0.001813894,0.001311299,0.04058938,0.9102306,0.005149452,0.0383138],"study_design_scores_gemma":[0.00008452051,0.0001836391,0.0007872459,0.0002091013,0.00008603676,0.002095944,0.0009416979,0.007250675,0.03952001,0.8472972,0.1014177,0.0001263046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3053527,0.001030072,0.5598863,0.006149323,0.001905297,0.0001596931,0.000588302,0.001899915,0.1230284],"genre_scores_gemma":[0.7512894,0.0003748475,0.2252786,0.0009901364,0.0001955129,0.0001690259,0.000330875,0.0007279714,0.02064352],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01022522,"threshold_uncertainty_score":0.03420675,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Repetition (rhetorical device); Physics; Combinatorics; Infimum and supremum; Mathematics; Philosophy","authors":[{"name":"Lucas Mol","is_ca":true},{"name":"Narad Rampersad","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01001163818495734,"gpt":0.2504297073528558,"spread":0.2404180691678985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001939042,0.0003954654,0.000680059,0.001643057,0.001057173,0.002652147,0.001009306,0.0009447887,0.002330437],"category_scores_gemma":[0.01439476,0.0004508191,0.0005783419,0.0008307406,0.003416446,0.004103474,0.002685243,0.00153733,0.0007800519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001116066,"about_ca_system_score_gemma":0.00079243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005243759,"about_ca_topic_score_gemma":0.0002457996,"domain_scores_codex":[0.9971148,0.0004707227,0.0002451914,0.0008896848,0.0008229483,0.0004566432],"domain_scores_gemma":[0.9814965,0.01133179,0.002014982,0.002392148,0.00152941,0.001235242],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005041006,0.00006024787,0.005667812,0.000242623,0.00003452296,0.0005840207,0.001228882,0.01637803,0.05775519,0.8902209,0.001814793,0.02550882],"study_design_scores_gemma":[0.00005093229,0.0001824446,0.00295334,0.0000489394,0.00003818932,0.0007330623,0.0002970564,0.0665322,0.02782285,0.895551,0.005701094,0.00008893021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7884979,0.001380967,0.1663288,0.001322728,0.0001345263,0.00006061868,0.0003894184,0.001178354,0.04070664],"genre_scores_gemma":[0.9857118,0.0001762217,0.011395,0.000163662,0.0001248649,0.00006339094,0.0001157856,0.00007112704,0.002178171],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002652147,"threshold_uncertainty_score":0.01025474,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}