{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":10,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":10,"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":"078d9a77f7c1","filters":{"venue":"RAIRO. Theoretical informatics and applications"}},"results":[{"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,"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; 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","authors":[{"name":"Jeffrey Shallit","is_ca":true},{"name":"Sonja Linghui Shan","is_ca":true},{"name":"Kai Hsiang Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008010339314147076,"gpt":0.2471181397254336,"spread":0.2391078004112865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004627863,0.0006000767,0.0008240066,0.001773487,0.001986002,0.002572792,0.001429431,0.001375182,0.007207187],"category_scores_gemma":[0.01850409,0.0006719406,0.001464083,0.001537725,0.006749365,0.008736473,0.004813794,0.005757248,0.001133902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001832347,"about_ca_system_score_gemma":0.001210059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001202062,"about_ca_topic_score_gemma":0.000861235,"domain_scores_codex":[0.997542,0.000926609,0.0001189442,0.0004216499,0.0007197709,0.000270988],"domain_scores_gemma":[0.9862403,0.01045189,0.0005101082,0.0009600852,0.001378138,0.0004593858],"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.00003077073,0.00002204967,0.0002782011,0.00006554781,0.000008372025,0.0001130282,0.0004234851,0.001052474,0.0005153642,0.9906673,0.001656549,0.00516684],"study_design_scores_gemma":[0.00001251775,0.00001406643,0.0000992061,0.00003219501,0.000007057448,0.00005625173,0.00008590249,0.003228679,0.0007652821,0.9902351,0.005451044,0.00001272032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.165307,0.006128835,0.6787044,0.03128541,0.001855361,0.0001003345,0.0003809619,0.001399444,0.1148383],"genre_scores_gemma":[0.8957362,0.00232216,0.07867082,0.003105324,0.000813513,0.0001891929,0.0003396977,0.0003932299,0.0184298],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007207187,"threshold_uncertainty_score":0.0244748,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"James D. Currie","is_ca":true},{"name":"Pascal Ochem","is_ca":false},{"name":"Narad Rampersad","is_ca":true},{"name":"Jeffrey Shallit","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01315390954809073,"gpt":0.2281590491369218,"spread":0.2150051395888311,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002872997,0.0002741785,0.0002908064,0.001245092,0.001165339,0.001963917,0.0002275616,0.0004616146,0.005843369],"category_scores_gemma":[0.002098559,0.0001869948,0.0003370259,0.0008577998,0.001009383,0.002048909,0.0005665192,0.0004208566,0.0006848733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000716696,"about_ca_system_score_gemma":0.0005150865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006099493,"about_ca_topic_score_gemma":0.0004766172,"domain_scores_codex":[0.9995963,0.00005572904,0.00004762537,0.00008663688,0.0001285162,0.00008514505],"domain_scores_gemma":[0.9985003,0.0006916943,0.0002750101,0.0001091586,0.0002960968,0.0001277138],"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.0004603516,0.00005974786,0.006440139,0.0003543524,0.00003297813,0.001675218,0.001917206,0.00883544,0.09478767,0.847075,0.001414372,0.03694744],"study_design_scores_gemma":[0.0000731886,0.000386746,0.00617601,0.0001465304,0.00008278341,0.002797984,0.001103997,0.05739573,0.07636537,0.8262032,0.02916142,0.0001070603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9119232,0.0004433174,0.05850524,0.0002612376,0.00004823734,0.00005477121,0.0005231235,0.0001898118,0.028051],"genre_scores_gemma":[0.9854469,0.0001475147,0.01011208,0.00004234935,0.00004115399,0.00005334196,0.0002866475,0.00005893795,0.003811119],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005843369,"threshold_uncertainty_score":0.019548,"prediction_status":"machine_predicted_unvalidated"},"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,"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":"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","authors":[{"name":"Jason P. Bell","is_ca":true},{"name":"Jeffrey Shallit","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006396275130212016,"gpt":0.2407304873681937,"spread":0.2343342122379817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058016,0.0004670933,0.0003831658,0.001273462,0.001235285,0.002223771,0.0005392306,0.0005475936,0.005807392],"category_scores_gemma":[0.004382303,0.0003563672,0.0005642059,0.0005971583,0.001984703,0.003145275,0.001181981,0.0009794837,0.001059419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009064024,"about_ca_system_score_gemma":0.0008031214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005979648,"about_ca_topic_score_gemma":0.000615684,"domain_scores_codex":[0.9985587,0.0002919433,0.0001498834,0.0003841301,0.0003381061,0.0002773316],"domain_scores_gemma":[0.9935044,0.003249661,0.0009271165,0.0007297432,0.0009933352,0.0005957604],"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.0004325162,0.0001000267,0.002992584,0.0002360263,0.00002395926,0.0007606182,0.001695247,0.004994344,0.03389076,0.9262452,0.002708431,0.02592023],"study_design_scores_gemma":[0.00008783864,0.0002138331,0.002668132,0.00008023384,0.00003321126,0.001060607,0.00056999,0.03405425,0.01984995,0.9182213,0.02303302,0.0001276605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8415286,0.0006132935,0.09449368,0.0007167478,0.0001845659,0.0001123262,0.001391681,0.00173466,0.05922433],"genre_scores_gemma":[0.9708092,0.0001082041,0.01711299,0.0001006196,0.0001338185,0.0001249725,0.0008590272,0.00008654637,0.01066469],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005807392,"threshold_uncertainty_score":0.01942772,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4416981033","doi":"10.1051/ita/2025019","title":"Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random","year":2025,"lang":"","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"De Bruijn sequence; De Bruijn graph; Multiset; Las vegas; Random walk; Cover (algebra); Graph; Constant (computer programming)","authors":[{"name":"Joe Sawada","is_ca":false},{"name":"Daniel Gabrić","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009271029239274333,"gpt":0.289581129720298,"spread":0.2803101004810237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001600921,0.0008269839,0.0006072266,0.0012292,0.001107351,0.001161913,0.001660962,0.0009855847,0.006527838],"category_scores_gemma":[0.009014536,0.0005033104,0.000675564,0.001073561,0.001031536,0.001938072,0.001377735,0.001065096,0.001316365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00116441,"about_ca_system_score_gemma":0.001448749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001810105,"about_ca_topic_score_gemma":0.003239789,"domain_scores_codex":[0.9983811,0.0005070628,0.0001165847,0.0003290756,0.0004342476,0.0002318509],"domain_scores_gemma":[0.9951531,0.002610437,0.0002998548,0.001369148,0.0004004321,0.0001670219],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001011473,0.0005054573,0.00283284,0.0003386125,0.0001463177,0.0002460322,0.0005472567,0.2998972,0.03052162,0.262279,0.0109516,0.3907226],"study_design_scores_gemma":[0.0002292604,0.0001988099,0.0002042054,0.00003363893,0.00003052397,0.0001803223,0.0000722948,0.8741586,0.01778255,0.09667041,0.01040642,0.00003299742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0589304,0.0001857749,0.9263017,0.0002621305,0.00007317159,0.0003290278,0.0002428115,0.004433703,0.009241235],"genre_scores_gemma":[0.4079167,0.0001382752,0.5825728,0.0001822173,0.0000389706,0.001065679,0.0007028499,0.0007182232,0.006664267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006527838,"threshold_uncertainty_score":0.02183783,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4413806378","doi":"10.1051/ita/2025009","title":"The analogue of overlap-freeness for the Fibonacci morphism","year":2025,"lang":"en","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","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; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fibonacci number; Morphism; Mathematics; Arithmetic; Combinatorics; Algebra over a field; Pure mathematics","authors":[{"name":"James D. Currie","is_ca":true},{"name":"Narad Rampersad","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004015590339300469,"gpt":0.2701512749601432,"spread":0.2661356846208427,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001138689,0.0004723996,0.0006347627,0.001819144,0.00266879,0.002969292,0.0004833367,0.001323036,0.007269777],"category_scores_gemma":[0.004330959,0.0004275813,0.0007629905,0.001069765,0.005503138,0.005301281,0.001904094,0.001546096,0.001024514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001204029,"about_ca_system_score_gemma":0.0006201105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001086898,"about_ca_topic_score_gemma":0.0008033219,"domain_scores_codex":[0.9987776,0.0001551968,0.0001205882,0.0003911183,0.0003395878,0.000215958],"domain_scores_gemma":[0.9966967,0.001866427,0.0003576057,0.0003797747,0.0005064989,0.0001929059],"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.00002195931,0.000007422035,0.0003016008,0.00003281405,0.000003948036,0.0001958153,0.0003910763,0.0003028412,0.001937669,0.9891708,0.0003438548,0.007290103],"study_design_scores_gemma":[0.00001186817,0.00003390133,0.0006956999,0.00003122292,0.00001274624,0.0009431792,0.0002068609,0.001736758,0.003389256,0.9779378,0.01496975,0.00003091642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3548656,0.001762745,0.4001091,0.001908169,0.0006848173,0.0001143266,0.000361845,0.0004114766,0.2397819],"genre_scores_gemma":[0.9171944,0.0004512102,0.05941206,0.000548893,0.000504441,0.0001297523,0.0001733214,0.0001011943,0.02148456],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007269777,"threshold_uncertainty_score":0.02431983,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405592103","doi":"10.1051/ita/2024015","title":"Enumerating Minimum Feedback Vertex Sets in directed graphs with union-cat trees","year":2024,"lang":"en","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Vertex (graph theory); Combinatorics; Feedback vertex set; Mathematics; Discrete mathematics; Graph; Computer science","authors":[{"name":"Moussa Abdenbi","is_ca":false},{"name":"Alexandre Blondin Massé","is_ca":false},{"name":"A Goupil","is_ca":false},{"name":"Mélodie Lapointe","is_ca":false},{"name":"Martin Lavoie","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008375581791291243,"gpt":0.2685780005665517,"spread":0.2602024187752605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008351297,0.0004153776,0.0009485423,0.001355389,0.0008707751,0.001247871,0.001432779,0.001038782,0.001733536],"category_scores_gemma":[0.007162745,0.0004750123,0.0007085699,0.001547857,0.0006943961,0.003265743,0.001227623,0.001001817,0.0002912403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009468126,"about_ca_system_score_gemma":0.0009911408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001512545,"about_ca_topic_score_gemma":0.002810793,"domain_scores_codex":[0.9992545,0.0001697108,0.00007611131,0.0001911241,0.0002074802,0.0001010178],"domain_scores_gemma":[0.996009,0.002829497,0.0002947361,0.0003337683,0.0003347035,0.0001983314],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001094321,0.0004600311,0.01753739,0.001507042,0.0001473787,0.0005503137,0.001724571,0.359505,0.03728012,0.2022381,0.009424415,0.3685312],"study_design_scores_gemma":[0.00007704228,0.0001643059,0.001456552,0.0001211746,0.00004613942,0.0004733631,0.0004934163,0.7044943,0.01787436,0.27068,0.004082364,0.00003701803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5196813,0.0006747052,0.4730005,0.0004045115,0.00003215132,0.0001435996,0.00210747,0.001172512,0.002783247],"genre_scores_gemma":[0.7245295,0.0002625289,0.2707459,0.00009223264,0.00001645984,0.0002005368,0.002483845,0.0001377404,0.001531222],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001733536,"threshold_uncertainty_score":0.006869674,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4415210014","doi":"10.1051/ita/2025010","title":"Superfluous Arcs and Confluent Reductions in the Minimum Feedback Vertex Set Problem","year":2025,"lang":"en","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Trois-Rivières; Université du Québec à Montréal","funders":"","keywords":"Digraph; Feedback arc set; Vertex (graph theory); Feedback vertex set; Bounded function; Directed graph; Graph; Reduction (mathematics)","authors":[{"name":"Moussa Abdenbi","is_ca":true},{"name":"Alexandre Blondin Massé","is_ca":true},{"name":"A Goupil","is_ca":true},{"name":"Odile Marcotte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01035875172487048,"gpt":0.2866392193232398,"spread":0.2762804675983693,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001522324,0.0006694513,0.0008165463,0.0007985043,0.001315474,0.001306903,0.001379227,0.0009012097,0.003073521],"category_scores_gemma":[0.007204475,0.0004446215,0.001605826,0.0009029262,0.001784577,0.003014859,0.002360167,0.002680807,0.0005683673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00131042,"about_ca_system_score_gemma":0.001858607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00275726,"about_ca_topic_score_gemma":0.004381111,"domain_scores_codex":[0.9981376,0.0005820483,0.0001104183,0.0004585232,0.0004349204,0.0002765403],"domain_scores_gemma":[0.9941414,0.004148943,0.00028641,0.0008580824,0.0003476436,0.0002174728],"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.0007342265,0.0006288853,0.00282155,0.001032372,0.0001670416,0.0009796509,0.002175671,0.3459157,0.04649413,0.3820641,0.008783706,0.2082029],"study_design_scores_gemma":[0.0001396203,0.0002199675,0.0008679825,0.00008098021,0.0001270312,0.0004316692,0.0005580932,0.3311479,0.0370102,0.6179704,0.01139323,0.0000529158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1445221,0.0003672283,0.8394155,0.001071475,0.00005679324,0.0004096604,0.0005369643,0.001527578,0.01209272],"genre_scores_gemma":[0.6408038,0.0005091481,0.348602,0.0003564979,0.00008418514,0.0003900199,0.00115125,0.0004806999,0.007622559],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003073521,"threshold_uncertainty_score":0.01028192,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Yan Lanciault","is_ca":true},{"name":"Christophe Reutenauer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005791708219538981,"gpt":0.240717505541032,"spread":0.234925797321493,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007903734,0.0002657778,0.000483166,0.0008029179,0.001205703,0.001734909,0.0005610489,0.0004658352,0.004104075],"category_scores_gemma":[0.004698419,0.0002246994,0.0006101761,0.0009389271,0.002202217,0.003085651,0.001043764,0.0009886684,0.0008201622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008802161,"about_ca_system_score_gemma":0.0008144753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009321918,"about_ca_topic_score_gemma":0.0005467284,"domain_scores_codex":[0.9989333,0.0001655292,0.00008981318,0.0002746027,0.0003236948,0.0002131002],"domain_scores_gemma":[0.997414,0.0009108484,0.0004116104,0.0004840705,0.0005150384,0.0002643318],"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.00006617965,0.00002106548,0.0009737893,0.00003097454,0.000006582217,0.0001675819,0.0003467166,0.001133574,0.006650448,0.9788252,0.0006451659,0.01113276],"study_design_scores_gemma":[0.00002233366,0.0001038232,0.0009651711,0.00002026939,0.00001491295,0.0006478261,0.0002938142,0.01182721,0.009783866,0.9673123,0.008966047,0.00004238555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6075659,0.000553457,0.3258083,0.0006556981,0.000287912,0.0001186968,0.0006781641,0.0003756354,0.06395615],"genre_scores_gemma":[0.9711274,0.0002465772,0.0210207,0.0001335896,0.0001870771,0.0000706279,0.0002841181,0.00008888647,0.006841093],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004104075,"threshold_uncertainty_score":0.01372951,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401963033","doi":"10.1051/ita/2024013","title":"On the generation of discrete figures with connectivity constraints","year":2024,"lang":"en","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"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 à Chicoutimi","funders":"","keywords":"Computer science","authors":[{"name":"Hugo Tremblay","is_ca":true},{"name":"Julien Vernay","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01335183156153592,"gpt":0.2604087058571208,"spread":0.2470568742955849,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002994313,0.0003035181,0.000370562,0.0006479189,0.0004669173,0.0008305883,0.0006843777,0.0004443488,0.006894181],"category_scores_gemma":[0.00311631,0.0002858221,0.0004301278,0.0008737143,0.0007976164,0.001422241,0.0008384067,0.0005079969,0.0008746689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004841616,"about_ca_system_score_gemma":0.0003914107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008903527,"about_ca_topic_score_gemma":0.0013566,"domain_scores_codex":[0.9996287,0.00009618542,0.0000172178,0.00008562124,0.0001264336,0.00004593725],"domain_scores_gemma":[0.9981208,0.001246252,0.000121468,0.0002999365,0.0001504768,0.00006092214],"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.000248037,0.00009983614,0.00146521,0.0003029051,0.00002817909,0.0005001308,0.0003313051,0.4289299,0.02187892,0.3094093,0.00696839,0.2298379],"study_design_scores_gemma":[0.00005185627,0.0001032369,0.0003891407,0.00003421885,0.00001800011,0.0003162381,0.00009701062,0.8256319,0.01148694,0.1462218,0.01562847,0.00002120377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.14968,0.00030742,0.8223352,0.0003793545,0.0000828565,0.000126881,0.0003461635,0.0007405782,0.02600153],"genre_scores_gemma":[0.4652707,0.0003882227,0.524323,0.0001165682,0.00003803788,0.0002021097,0.0009216109,0.0002577718,0.008481942],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006894181,"threshold_uncertainty_score":0.0230633,"prediction_status":"machine_predicted_unvalidated"},"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,"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":"Morphism; Abelian group; Exponent; Mathematics; Fixed point; Critical exponent; Pure mathematics; Mathematical analysis; Geometry","authors":[{"name":"James D. Currie","is_ca":true},{"name":"Narad Rampersad","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03330787741572297,"gpt":0.2718876770391584,"spread":0.2385797996234354,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002980136,0.000418334,0.0003429851,0.0008312585,0.001438647,0.0006828373,0.0001863588,0.001029252,0.00495664],"category_scores_gemma":[0.001254388,0.0002031568,0.0005414506,0.0004009402,0.001314043,0.001212848,0.001125923,0.0009357879,0.001035322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005935972,"about_ca_system_score_gemma":0.0004817085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002903424,"about_ca_topic_score_gemma":0.0003195559,"domain_scores_codex":[0.9998293,0.00002630261,0.000012851,0.00004337147,0.00004092684,0.00004722061],"domain_scores_gemma":[0.9992379,0.0003665112,0.00009590687,0.0001053268,0.00008249771,0.0001118654],"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.0005986735,0.0002234154,0.004736026,0.0005167428,0.00006323828,0.004811764,0.001893308,0.003258958,0.2685806,0.6315271,0.003638739,0.08015127],"study_design_scores_gemma":[0.0001565453,0.001263373,0.007679045,0.0002572225,0.0002000216,0.006239401,0.0008632082,0.01673159,0.199752,0.6679323,0.09867831,0.0002469282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8432438,0.001372014,0.09190749,0.001224058,0.0005244385,0.0001504046,0.0001439972,0.0009078429,0.06052598],"genre_scores_gemma":[0.9417558,0.0004831932,0.03910285,0.0001785258,0.0001220039,0.0001196893,0.0001183014,0.0001405277,0.01797911],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00495664,"threshold_uncertainty_score":0.01658159,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}