{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003814599,0.00009536805,0.0002126458,0.0001454597,0.00005270766,0.00003888019,0.000266498,0.00004707566,0.000011063],"category_scores_gemma":[0.0000746099,0.00007261464,0.00002505977,0.0004542338,0.0007006072,0.0002516862,0.0001829476,0.00007199929,0.000003670156],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000594936,"about_ca_system_score_gemma":0.00003606483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005635102,"about_ca_topic_score_gemma":8.690726e-7,"domain_scores_codex":[0.9991394,0.00003069755,0.0004405215,0.0001002792,0.0001409523,0.0001481814],"domain_scores_gemma":[0.998848,0.0006812983,0.0001409464,0.0002362604,0.00003630951,0.00005716017],"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.000001236268,0.00002178767,0.0001353397,0.0001549426,0.00000693285,2.246493e-7,0.001776022,0.00005259199,0.000179369,0.9750946,0.00001990639,0.02255705],"study_design_scores_gemma":[0.000164792,0.00004258448,0.001876986,0.00006388847,0.000004955039,0.000004405675,0.0006275109,0.3617711,0.00260219,0.632705,0.00005625005,0.00008033407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8680056,0.0001797595,0.1279426,0.0008160282,0.00002974646,0.0008036778,0.00005692769,0.0001706513,0.001994969],"genre_scores_gemma":[0.9847494,0.00009100652,0.01493323,0.0001215625,0.000008100767,0.00008235574,0.000004609455,0.000003698165,0.000006013581],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3617185,"threshold_uncertainty_score":0.2961139,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002715024,0.00008872516,0.0001303215,0.00009896848,0.00009924101,0.00007847766,0.0004179554,0.0000433345,0.00001072203],"category_scores_gemma":[0.00002139727,0.00006597117,0.00003786955,0.0004483392,0.0003679127,0.0002139528,0.0003250851,0.00007838725,0.00009630454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004656714,"about_ca_system_score_gemma":0.00001984173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001155902,"about_ca_topic_score_gemma":8.018639e-8,"domain_scores_codex":[0.9992473,0.00001524682,0.0003341036,0.00008794454,0.0001451867,0.0001702732],"domain_scores_gemma":[0.9992977,0.0001107248,0.00008155863,0.0003913589,0.00004171997,0.00007698528],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001588649,0.00001823567,0.00002113924,0.00005479428,0.000006805146,2.00803e-7,0.0008311684,0.0000240246,0.0003752497,0.9595206,0.0001088201,0.03903739],"study_design_scores_gemma":[0.000207696,0.00003772565,0.0003684417,0.00006909254,0.000009068634,0.00001340182,0.0005274006,0.516014,0.002311472,0.4717668,0.008491713,0.0001831184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1648767,0.0001421308,0.8186457,0.001508855,0.00005137159,0.0005591497,0.00001982232,0.0005442094,0.01365203],"genre_scores_gemma":[0.9875911,0.00009964635,0.01181174,0.0002768759,0.00002704222,0.0001170277,0.000005819209,0.000005921949,0.0000647823],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8227144,"threshold_uncertainty_score":0.2690226,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005237327,0.00009698668,0.0001635504,0.00007382387,0.0002960112,0.00007429885,0.0006597178,0.00001985782,0.0002970489],"category_scores_gemma":[0.00001409991,0.00008285089,0.00004985622,0.0003207411,0.0003700486,0.0002143587,0.0004868002,0.0001289962,0.00001684622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001664223,"about_ca_system_score_gemma":0.00004005403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002342992,"about_ca_topic_score_gemma":8.599692e-8,"domain_scores_codex":[0.9990032,0.00004938797,0.0004154753,0.0001094303,0.0002517289,0.0001707828],"domain_scores_gemma":[0.9990223,0.0002570287,0.0001493974,0.0004523224,0.00003674363,0.00008217822],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[8.181307e-7,0.00004029039,0.00001341367,0.00002802147,0.000006688863,2.237996e-7,0.0006661302,0.0001635249,0.0001701101,0.9590454,0.00007345806,0.039792],"study_design_scores_gemma":[0.0001907146,0.00004489605,0.00003869247,0.000005961105,0.000007666336,0.00002912799,0.000460041,0.5431325,0.0004477546,0.4528938,0.002647448,0.000101413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05670561,0.0001507305,0.929541,0.0007156733,0.00004460754,0.0003766327,0.00003417395,0.0001804952,0.0122511],"genre_scores_gemma":[0.9525483,0.00001641218,0.04673259,0.000429973,0.00001588788,0.0002280186,0.000008323462,0.00000484637,0.00001570657],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8958426,"threshold_uncertainty_score":0.3378561,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008980827,0.000560548,0.0008155249,0.0002579391,0.0009255979,0.0003705662,0.0005136646,0.0003607809,0.00008051522],"category_scores_gemma":[0.0004176249,0.0005178883,0.0001259453,0.0007047121,0.001555336,0.000298528,0.0008689087,0.0004264724,0.0000691626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003103364,"about_ca_system_score_gemma":0.000239324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006692102,"about_ca_topic_score_gemma":0.000004646837,"domain_scores_codex":[0.9970651,0.0001106713,0.001334415,0.000366582,0.0003728082,0.000750392],"domain_scores_gemma":[0.9961236,0.001884662,0.0003670638,0.0007718372,0.0002600608,0.0005928253],"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.0000895691,0.0001564397,0.00002061808,0.0007613692,0.0001323983,0.000001839238,0.002815449,0.0003542227,0.0001529017,0.9869837,0.0003528803,0.008178658],"study_design_scores_gemma":[0.001944502,0.0001246398,0.00001159193,0.0003150633,0.0003549558,0.00003563819,0.00244777,0.1175736,0.001451965,0.863412,0.01182763,0.0005005692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08819727,0.0005308149,0.8808135,0.002308948,0.0002008152,0.00289604,0.0002063247,0.0001768415,0.02466946],"genre_scores_gemma":[0.687712,0.002683429,0.3050368,0.001407788,0.0003021002,0.0004999816,0.00004785038,0.0001043792,0.002205674],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5995147,"threshold_uncertainty_score":0.9997272,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002692486,0.0001151295,0.0001610876,0.00001937015,0.0006918295,0.00006303376,0.000328397,0.0000325666,0.00002876937],"category_scores_gemma":[0.0000300481,0.00006262089,0.0000988004,0.0002203059,0.0008860937,0.00004926859,0.0001176963,0.000103825,0.000004412184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006418994,"about_ca_system_score_gemma":0.00002985673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003816258,"about_ca_topic_score_gemma":4.949022e-7,"domain_scores_codex":[0.9991981,0.00001031905,0.0004355423,0.00008449949,0.00008699173,0.0001845071],"domain_scores_gemma":[0.9970293,0.002205589,0.0001342274,0.0004729286,0.000110811,0.00004713036],"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.000006822724,0.00003435154,0.00003083461,0.00003082945,0.00004422129,1.830486e-9,0.00005584039,0.00009119615,0.00001728806,0.9644508,0.000264742,0.03497307],"study_design_scores_gemma":[0.000188982,0.000009722289,0.0000460657,0.00001355069,0.00005919013,1.939073e-7,0.001273382,0.01761582,0.0002828916,0.8840756,0.09636674,0.00006790257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005408964,0.0001215334,0.9761443,0.002486277,0.00002172898,0.0009629595,0.0001462495,0.00001623785,0.01955979],"genre_scores_gemma":[0.9878876,0.00007540629,0.009265397,0.0002048409,0.00009651172,0.002001102,0.00003942519,0.00001057534,0.000419148],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9873467,"threshold_uncertainty_score":0.5321063,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004388056,0.0001650424,0.0001720388,0.0002384573,0.0001761637,0.0003557458,0.0004479574,0.00006623598,0.00001713899],"category_scores_gemma":[0.00003198175,0.000123609,0.0000376417,0.001238144,0.0005376335,0.0004817441,0.0001967045,0.0002349202,0.00004503773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002803455,"about_ca_system_score_gemma":0.00005991687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000230049,"about_ca_topic_score_gemma":0.000006666736,"domain_scores_codex":[0.9987692,0.00006330643,0.0003570926,0.0002242464,0.0002507688,0.0003354496],"domain_scores_gemma":[0.9986939,0.0005988176,0.00004076648,0.0004448891,0.00006336905,0.0001582838],"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.000004531504,0.00003110527,0.00005205853,0.00005190696,0.0000123602,0.000002009894,0.0009435546,0.00008491652,0.000107146,0.9450201,0.00003961735,0.05365067],"study_design_scores_gemma":[0.0001964508,0.00005536098,0.0002572786,0.0000886811,0.000005864804,0.00002244449,0.0002415609,0.4963888,0.0001830908,0.5010199,0.001371366,0.0001691946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04074567,0.0002955798,0.944842,0.001442311,0.00004108253,0.0007650602,0.00002469417,0.0004330917,0.01141052],"genre_scores_gemma":[0.9415291,0.0001124102,0.05788554,0.0001301387,0.00001245352,0.0002511843,0.00001768036,0.00001437657,0.00004710965],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9007834,"threshold_uncertainty_score":0.5040629,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005643959,0.0001183287,0.0001358819,0.0001391302,0.0002942425,0.0002245017,0.0005684876,0.00005928779,0.000007656106],"category_scores_gemma":[0.00004451544,0.00008407169,0.00002793468,0.0006579029,0.0009096664,0.0002269034,0.0002841449,0.000260471,0.00001405525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001827466,"about_ca_system_score_gemma":0.00004978502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000218283,"about_ca_topic_score_gemma":0.000001314309,"domain_scores_codex":[0.9989816,0.000068154,0.0003491814,0.0001655502,0.0001719463,0.0002635479],"domain_scores_gemma":[0.998791,0.0004939126,0.00003858812,0.0005265878,0.00006600671,0.00008389389],"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.000003979876,0.0000430202,0.00004163089,0.00003843326,0.000007247625,2.442841e-7,0.001567627,0.00003277061,0.00004301081,0.9835072,0.0002359558,0.01447884],"study_design_scores_gemma":[0.0003138824,0.00003780982,0.0003426733,0.00002914387,0.00000866365,0.00002484646,0.001574072,0.04967831,0.00008678392,0.9344825,0.01330739,0.0001138875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.043676,0.0003162864,0.9048789,0.01226461,0.00004117331,0.001862643,0.00002935578,0.0001000552,0.03683099],"genre_scores_gemma":[0.9750905,0.0002165942,0.02296329,0.00105302,0.00001395247,0.0005350056,0.000009784223,0.000005488399,0.0001123863],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9314145,"threshold_uncertainty_score":0.3428344,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008681648,0.0003277553,0.0005270736,0.0002586239,0.0003652545,0.0002853506,0.001101488,0.0002371725,0.00009031794],"category_scores_gemma":[0.00009458439,0.0002303853,0.0001597206,0.001230941,0.002013193,0.0003458677,0.0009025046,0.0003731516,0.00005062795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004044438,"about_ca_system_score_gemma":0.0002126389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007632729,"about_ca_topic_score_gemma":3.370102e-7,"domain_scores_codex":[0.9975721,0.00007680596,0.001272181,0.0003041427,0.0003241237,0.0004506322],"domain_scores_gemma":[0.9976162,0.0004722223,0.0003380754,0.001162069,0.0001934301,0.0002180199],"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.0000102613,0.000188165,0.00002850987,0.0004707122,0.00005110323,2.16262e-7,0.0008659174,0.00001061811,0.00006464644,0.7843234,0.0004955391,0.2134909],"study_design_scores_gemma":[0.0005455351,0.00009497914,0.0001566978,0.0003688409,0.0001049236,0.00001140554,0.0008054479,0.4743621,0.0008940894,0.4925899,0.02973343,0.0003326046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003206092,0.001042247,0.9149314,0.001813745,0.0001322949,0.0009746049,0.00005838646,0.00009469385,0.07774656],"genre_scores_gemma":[0.9711594,0.0006560186,0.02588457,0.00123276,0.0000672362,0.0002134325,0.00001272176,0.00001388922,0.0007599951],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9679533,"threshold_uncertainty_score":0.9394839,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002139719,0.00007656623,0.00007511423,0.00003718076,0.00009023571,0.0003832828,0.0002339816,0.0000264338,0.00001000436],"category_scores_gemma":[0.00003760559,0.00004183374,0.00001993705,0.0001858768,0.000795913,0.0003005932,0.00007509706,0.0000913156,0.000007871648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007127553,"about_ca_system_score_gemma":0.00003404228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.485154e-7,"about_ca_topic_score_gemma":1.73992e-7,"domain_scores_codex":[0.9995065,0.00001329179,0.0001701599,0.00008990082,0.0001329448,0.00008714691],"domain_scores_gemma":[0.9992594,0.0003471545,0.00004292297,0.0002632407,0.0000505132,0.00003673747],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[8.665344e-7,0.00001310978,0.000001003868,0.00003727548,0.000006818781,1.538011e-7,0.0002078945,0.00001070054,0.0001184094,0.9627019,0.0002418941,0.03666004],"study_design_scores_gemma":[0.00003665654,0.0000693144,0.000006890819,0.00007490117,0.000007050915,0.00001201442,0.00003977415,0.3452215,0.007338271,0.6462799,0.0008344064,0.00007936791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004218027,0.00003196379,0.9619134,0.001274794,0.000007653641,0.0002382813,0.00001473298,0.000131514,0.0321696],"genre_scores_gemma":[0.9641798,0.00001033939,0.0354212,0.0002500688,0.00001291622,0.0001016543,0.000004286092,0.000003977764,0.00001578443],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9599618,"threshold_uncertainty_score":0.3696005,"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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007749991,0.0001870872,0.0001739694,0.00007339771,0.0005217121,0.001178902,0.0007886498,0.00009458815,0.00001971604],"category_scores_gemma":[0.000071733,0.0001209609,0.00008477124,0.0003265132,0.0006351861,0.0003898008,0.0002573242,0.0002112867,0.00004196809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002060003,"about_ca_system_score_gemma":0.00006994179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004937523,"about_ca_topic_score_gemma":0.000004002458,"domain_scores_codex":[0.9987315,0.00004504725,0.0004377517,0.000246672,0.0001833254,0.0003557313],"domain_scores_gemma":[0.9979401,0.0009605605,0.00004231282,0.0007348836,0.0001057461,0.0002163792],"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.000003104617,0.00005616756,0.000001207181,0.00008741606,0.00001327614,4.573228e-7,0.001738724,0.00001501644,0.00008827867,0.966521,0.0003460562,0.03112928],"study_design_scores_gemma":[0.00009860127,0.00006147249,0.0000247914,0.00003644818,0.00002057358,0.00002682883,0.0005749676,0.4925399,0.000205586,0.4935948,0.01267264,0.0001434412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005855561,0.0002127378,0.9726465,0.01866963,0.0001099815,0.0006726384,0.00005531699,0.0002878129,0.001489869],"genre_scores_gemma":[0.9414118,0.00003998405,0.05633165,0.001150492,0.000165301,0.0008166127,0.00003153471,0.00001870349,0.00003393491],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9355562,"threshold_uncertainty_score":0.999858,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}