{"meta":{"query_hash":"078d9a77f7c1","filters":{"venue":"RAIRO. Theoretical informatics and applications"},"cohort_total":10,"direct_labels_cover":0,"predictions_cover":10,"exported":10,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/078d9a77f7c1","api":"https://metacan.xera.ac/api/v1/cohort?venue=RAIRO.+Theoretical+informatics+and+applications"},"results":[{"id":"W3189147489","doi":"10.1051/ita/2022006","title":"Automatic sequences of rank two","year":2022,"lang":"en","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Decidability; Rank (graph theory); Concatenation (mathematics); Property (philosophy); Combinatorics; Class (philosophy); Mathematics; Word (group theory); Set (abstract data type); Integer (computer science); Discrete mathematics; Computer science; Artificial intelligence; Linguistics","score_opus":0.0063962751302120155,"score_gpt":0.2407304873681937,"score_spread":0.23433421223798168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189147489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8415286,0.0006132935,0.09449368,0.0007167478,0.00018456588,0.00011232621,0.0013916806,0.0017346605,0.059224326],"genre_scores_gemma":[0.9708092,0.00010820411,0.017112985,0.00010061965,0.00013381854,0.0001249725,0.0008590272,0.000086546366,0.0106646875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985587,0.00029194335,0.00014988336,0.00038413014,0.0003381061,0.0002773316],"domain_scores_gemma":[0.9935044,0.0032496608,0.0009271165,0.0007297432,0.0009933352,0.00059576036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058016,0.0004670933,0.00038316575,0.0012734619,0.0012352854,0.0022237708,0.0005392306,0.0005475936,0.005807392],"category_scores_gemma":[0.0043823035,0.00035636724,0.00056420587,0.00059715833,0.0019847031,0.003145275,0.0011819814,0.0009794837,0.001059419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043251622,0.00010002668,0.0029925844,0.00023602629,0.000023959265,0.0007606182,0.0016952469,0.0049943444,0.03389076,0.92624515,0.0027084313,0.025920225],"study_design_scores_gemma":[0.00008783864,0.00021383309,0.002668132,0.00008023384,0.00003321126,0.0010606075,0.00056999,0.034054253,0.019849954,0.9182213,0.023033015,0.00012766049],"about_ca_topic_score_codex":0.0005979648,"about_ca_topic_score_gemma":0.00061568397,"teacher_disagreement_score":0.005807392,"about_ca_system_score_codex":0.0009064024,"about_ca_system_score_gemma":0.0008031214,"threshold_uncertainty_score":0.019427717},"labels":[],"label_agreement":null},{"id":"W4319996143","doi":"10.1051/ita/2022010","title":"Properties of a ternary infinite word","year":2023,"lang":"en","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Word (group theory); Ternary operation; Exponent; Characterization (materials science); Mathematics; Word length; Abelian group; Point (geometry); Combinatorics; Discrete mathematics; Computer science; Linguistics; Physics; Natural language processing; Geometry","score_opus":0.013153909548090733,"score_gpt":0.22815904913692184,"score_spread":0.2150051395888311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319996143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91192317,0.00044331737,0.058505245,0.00026123755,0.000048237343,0.00005477121,0.0005231235,0.00018981182,0.028051],"genre_scores_gemma":[0.98544693,0.00014751466,0.010112077,0.00004234935,0.000041153995,0.00005334196,0.0002866475,0.000058937952,0.0038111187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995963,0.000055729044,0.000047625366,0.00008663688,0.00012851616,0.00008514505],"domain_scores_gemma":[0.99850035,0.0006916943,0.00027501013,0.00010915856,0.00029609675,0.00012771376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028729966,0.00027417848,0.00029080643,0.0012450923,0.001165339,0.0019639174,0.00022756156,0.00046161463,0.0058433693],"category_scores_gemma":[0.0020985592,0.00018699479,0.00033702588,0.0008577998,0.0010093825,0.0020489087,0.0005665192,0.00042085658,0.00068487326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004603516,0.00005974786,0.006440139,0.00035435244,0.00003297813,0.0016752181,0.0019172055,0.00883544,0.09478767,0.84707505,0.0014143722,0.036947444],"study_design_scores_gemma":[0.0000731886,0.00038674605,0.00617601,0.00014653035,0.00008278341,0.002797984,0.0011039968,0.05739573,0.07636537,0.8262032,0.02916142,0.00010706034],"about_ca_topic_score_codex":0.0006099493,"about_ca_topic_score_gemma":0.0004766172,"teacher_disagreement_score":0.0058433693,"about_ca_system_score_codex":0.00071669597,"about_ca_system_score_gemma":0.00051508646,"threshold_uncertainty_score":0.019547999},"labels":[],"label_agreement":null},{"id":"W4361994958","doi":"10.1051/ita/2022011","title":"Automatic sequences in negative bases and proofs of some conjectures of shevelev","year":2023,"lang":"en","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Mathematical proof; Simple (philosophy); Base (topology); Binary number; Automated theorem proving; Mathematics; Discrete mathematics; Computer science; Gas meter prover; Algorithm; Arithmetic; Epistemology; Philosophy","score_opus":0.008010339314147076,"score_gpt":0.24711813972543356,"score_spread":0.2391078004112865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361994958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16530704,0.0061288346,0.6787044,0.03128541,0.001855361,0.00010033449,0.00038096192,0.001399444,0.11483826],"genre_scores_gemma":[0.8957362,0.0023221597,0.07867082,0.0031053238,0.000813513,0.0001891929,0.0003396977,0.00039322994,0.018429799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997542,0.000926609,0.00011894417,0.0004216499,0.0007197709,0.00027098804],"domain_scores_gemma":[0.9862403,0.010451894,0.0005101082,0.0009600852,0.0013781384,0.0004593858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046278634,0.0006000767,0.0008240066,0.0017734871,0.0019860023,0.0025727921,0.0014294309,0.0013751823,0.0072071874],"category_scores_gemma":[0.018504094,0.0006719406,0.001464083,0.0015377245,0.0067493645,0.008736473,0.004813794,0.0057572485,0.0011339022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030770727,0.000022049671,0.0002782011,0.000065547814,0.000008372025,0.00011302815,0.0004234851,0.0010524738,0.00051536417,0.9906673,0.0016565486,0.00516684],"study_design_scores_gemma":[0.000012517747,0.000014066433,0.0000992061,0.000032195006,0.0000070574483,0.00005625173,0.000085902495,0.003228679,0.00076528214,0.9902351,0.005451044,0.000012720318],"about_ca_topic_score_codex":0.0012020619,"about_ca_topic_score_gemma":0.00086123496,"teacher_disagreement_score":0.0072071874,"about_ca_system_score_codex":0.0018323471,"about_ca_system_score_gemma":0.0012100593,"threshold_uncertainty_score":0.0244748},"labels":[],"label_agreement":null},{"id":"W4394992383","doi":"10.1051/ita/2024011","title":"A Small Morphism for which the Fixed Point has an Abelian Critical Exponent Less than 2","year":2024,"lang":"en","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Morphism; Abelian group; Exponent; Mathematics; Fixed point; Critical exponent; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.03330787741572297,"score_gpt":0.2718876770391584,"score_spread":0.23857979962343542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394992383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84324384,0.0013720142,0.09190749,0.0012240577,0.0005244385,0.0001504046,0.00014399718,0.00090784294,0.06052598],"genre_scores_gemma":[0.94175583,0.0004831932,0.039102852,0.00017852576,0.00012200386,0.000119689306,0.000118301425,0.00014052767,0.017979113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998293,0.000026302612,0.000012851001,0.000043371467,0.000040926836,0.000047220612],"domain_scores_gemma":[0.9992379,0.00036651123,0.00009590687,0.00010532676,0.00008249771,0.00011186535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002980136,0.000418334,0.00034298512,0.0008312585,0.0014386469,0.00068283733,0.00018635881,0.0010292522,0.00495664],"category_scores_gemma":[0.0012543878,0.00020315677,0.0005414506,0.00040094022,0.001314043,0.0012128478,0.0011259232,0.00093578786,0.001035322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005986735,0.00022341541,0.004736026,0.0005167428,0.00006323828,0.0048117638,0.0018933078,0.0032589582,0.26858065,0.6315271,0.0036387388,0.080151275],"study_design_scores_gemma":[0.00015654527,0.0012633732,0.007679045,0.00025722253,0.00020002158,0.0062394007,0.0008632082,0.016731592,0.19975202,0.66793233,0.09867831,0.0002469282],"about_ca_topic_score_codex":0.00029034237,"about_ca_topic_score_gemma":0.0003195559,"teacher_disagreement_score":0.00495664,"about_ca_system_score_codex":0.00059359724,"about_ca_system_score_gemma":0.00048170847,"threshold_uncertainty_score":0.016581595},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science","score_opus":0.013351831561535923,"score_gpt":0.26040870585712084,"score_spread":0.24705687429558493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401963033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14968,0.00030742004,0.82233524,0.0003793545,0.0000828565,0.00012688104,0.00034616352,0.00074057817,0.026001526],"genre_scores_gemma":[0.4652707,0.00038822272,0.524323,0.00011656821,0.00003803788,0.00020210969,0.00092161086,0.00025777184,0.008481942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962866,0.00009618542,0.0000172178,0.000085621235,0.00012643359,0.000045937253],"domain_scores_gemma":[0.99812084,0.0012462517,0.00012146797,0.00029993648,0.00015047676,0.00006092214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002994313,0.00030351806,0.00037056196,0.0006479189,0.00046691726,0.0008305883,0.00068437774,0.00044434884,0.006894181],"category_scores_gemma":[0.0031163103,0.00028582214,0.0004301278,0.00087371434,0.00079761643,0.0014222405,0.00083840673,0.00050799694,0.00087466894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024803705,0.000099836136,0.0014652105,0.00030290513,0.000028179094,0.0005001308,0.0003313051,0.42892992,0.021878924,0.30940926,0.00696839,0.22983791],"study_design_scores_gemma":[0.00005185627,0.00010323694,0.00038914074,0.000034218854,0.000018000112,0.00031623812,0.00009701062,0.82563186,0.011486941,0.14622177,0.015628474,0.000021203772],"about_ca_topic_score_codex":0.0008903527,"about_ca_topic_score_gemma":0.0013566001,"teacher_disagreement_score":0.006894181,"about_ca_system_score_codex":0.0004841616,"about_ca_system_score_gemma":0.00039141066,"threshold_uncertainty_score":0.023063302},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.008375581791291243,"score_gpt":0.26857800056655173,"score_spread":0.2602024187752605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405592103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51968133,0.0006747052,0.47300047,0.00040451146,0.00003215132,0.00014359961,0.0021074698,0.0011725116,0.0027832468],"genre_scores_gemma":[0.7245295,0.00026252892,0.2707459,0.000092232636,0.000016459839,0.00020053683,0.0024838455,0.00013774035,0.001531222],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992545,0.00016971081,0.00007611131,0.00019112405,0.00020748023,0.00010101783],"domain_scores_gemma":[0.996009,0.0028294965,0.00029473612,0.00033376834,0.00033470354,0.0001983314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008351297,0.00041537758,0.00094854226,0.0013553894,0.00087077514,0.0012478705,0.0014327794,0.001038782,0.0017335361],"category_scores_gemma":[0.007162745,0.0004750123,0.0007085699,0.0015478566,0.0006943961,0.0032657431,0.0012276232,0.0010018173,0.00029124034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001094321,0.00046003112,0.017537387,0.0015070419,0.00014737873,0.00055031374,0.0017245706,0.35950503,0.03728012,0.20223814,0.009424415,0.36853123],"study_design_scores_gemma":[0.00007704228,0.00016430592,0.0014565523,0.00012117459,0.000046139416,0.0004733631,0.00049341633,0.7044943,0.017874362,0.27067995,0.0040823636,0.00003701803],"about_ca_topic_score_codex":0.001512545,"about_ca_topic_score_gemma":0.0028107932,"teacher_disagreement_score":0.0017335361,"about_ca_system_score_codex":0.0009468126,"about_ca_system_score_gemma":0.0009911408,"threshold_uncertainty_score":0.0068696737},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.004015590339300469,"score_gpt":0.27015127496014324,"score_spread":0.26613568462084275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413806378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35486564,0.0017627452,0.40010908,0.0019081691,0.0006848173,0.000114326635,0.00036184498,0.00041147656,0.23978187],"genre_scores_gemma":[0.9171944,0.00045121025,0.05941206,0.000548893,0.000504441,0.00012975233,0.00017332142,0.00010119433,0.021484563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877757,0.00015519682,0.00012058819,0.00039111826,0.00033958783,0.00021595802],"domain_scores_gemma":[0.9966967,0.0018664267,0.0003576057,0.00037977475,0.0005064989,0.00019290589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011386892,0.00047239964,0.00063476275,0.0018191438,0.0026687903,0.0029692915,0.00048333668,0.0013230363,0.007269777],"category_scores_gemma":[0.004330959,0.00042758128,0.0007629905,0.0010697652,0.005503138,0.005301281,0.0019040945,0.0015460956,0.0010245137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021959306,0.000007422035,0.00030160078,0.00003281405,0.0000039480356,0.00019581526,0.00039107632,0.00030284125,0.0019376691,0.98917085,0.00034385483,0.007290103],"study_design_scores_gemma":[0.0000118681655,0.000033901335,0.0006956999,0.00003122292,0.000012746241,0.00094317924,0.00020686086,0.0017367577,0.0033892563,0.9779378,0.014969747,0.000030916424],"about_ca_topic_score_codex":0.0010868981,"about_ca_topic_score_gemma":0.00080332195,"teacher_disagreement_score":0.007269777,"about_ca_system_score_codex":0.0012040294,"about_ca_system_score_gemma":0.0006201105,"threshold_uncertainty_score":0.024319828},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.010358751724870477,"score_gpt":0.28663921932323977,"score_spread":0.2762804675983693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415210014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14452213,0.00036722835,0.8394155,0.0010714754,0.000056793244,0.00040966037,0.0005369643,0.0015275783,0.0120927235],"genre_scores_gemma":[0.64080375,0.00050914806,0.348602,0.00035649788,0.00008418514,0.0003900199,0.0011512502,0.0004806999,0.0076225586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981376,0.00058204826,0.000110418325,0.00045852317,0.00043492037,0.00027654026],"domain_scores_gemma":[0.9941414,0.004148943,0.00028641004,0.00085808244,0.00034764357,0.0002174728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015223237,0.0006694513,0.0008165463,0.0007985043,0.0013154736,0.0013069025,0.0013792267,0.0009012097,0.003073521],"category_scores_gemma":[0.0072044753,0.00044462146,0.001605826,0.0009029262,0.0017845774,0.003014859,0.002360167,0.0026808071,0.0005683673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007342265,0.00062888535,0.0028215505,0.0010323721,0.0001670416,0.0009796509,0.0021756706,0.34591568,0.046494134,0.38206413,0.008783706,0.2082029],"study_design_scores_gemma":[0.00013962026,0.00021996752,0.0008679825,0.00008098021,0.00012703116,0.00043166918,0.0005580932,0.3311479,0.037010204,0.6179704,0.011393226,0.000052915802],"about_ca_topic_score_codex":0.0027572603,"about_ca_topic_score_gemma":0.0043811114,"teacher_disagreement_score":0.003073521,"about_ca_system_score_codex":0.0013104203,"about_ca_system_score_gemma":0.0018586074,"threshold_uncertainty_score":0.01028192},"labels":[],"label_agreement":null},{"id":"W4416348003","doi":"10.1051/ita/2025016","title":"A symmetry property of Christoffel words","year":2025,"lang":"","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Christoffel symbols; Property (philosophy); Cardinality (data modeling); Symmetry (geometry); Bivariate analysis","score_opus":0.005791708219538981,"score_gpt":0.240717505541032,"score_spread":0.23492579732149302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416348003","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60756594,0.00055345695,0.3258083,0.0006556981,0.000287912,0.00011869678,0.00067816407,0.00037563537,0.06395615],"genre_scores_gemma":[0.9711274,0.0002465772,0.021020705,0.0001335896,0.00018707705,0.000070627895,0.00028411814,0.00008888647,0.006841093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893326,0.0001655292,0.000089813184,0.00027460273,0.00032369475,0.00021310023],"domain_scores_gemma":[0.997414,0.0009108484,0.0004116104,0.0004840705,0.0005150384,0.00026433181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007903734,0.00026577784,0.00048316605,0.0008029179,0.0012057027,0.001734909,0.0005610489,0.0004658352,0.0041040746],"category_scores_gemma":[0.004698419,0.00022469943,0.00061017607,0.0009389271,0.0022022172,0.003085651,0.0010437638,0.0009886684,0.00082016224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006617965,0.000021065483,0.00097378925,0.000030974537,0.000006582217,0.0001675819,0.00034671658,0.0011335736,0.006650448,0.97882515,0.0006451659,0.011132758],"study_design_scores_gemma":[0.000022333657,0.000103823186,0.0009651711,0.000020269392,0.00001491295,0.0006478261,0.0002938142,0.011827211,0.009783866,0.96731234,0.008966047,0.000042385553],"about_ca_topic_score_codex":0.0009321918,"about_ca_topic_score_gemma":0.0005467284,"teacher_disagreement_score":0.0041040746,"about_ca_system_score_codex":0.00088021613,"about_ca_system_score_gemma":0.0008144753,"threshold_uncertainty_score":0.013729513},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"De Bruijn sequence; De Bruijn graph; Multiset; Las vegas; Random walk; Cover (algebra); Graph; Constant (computer programming)","score_opus":0.009271029239274333,"score_gpt":0.28958112972029804,"score_spread":0.2803101004810237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416981033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058930397,0.00018577487,0.9263017,0.00026213052,0.00007317159,0.0003290278,0.0002428115,0.004433703,0.009241235],"genre_scores_gemma":[0.4079167,0.00013827521,0.5825728,0.00018221734,0.000038970597,0.0010656794,0.0007028499,0.00071822316,0.0066642673],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838114,0.00050706277,0.00011658471,0.00032907556,0.0004342476,0.00023185086],"domain_scores_gemma":[0.99515307,0.0026104369,0.00029985484,0.0013691478,0.0004004321,0.0001670219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016009208,0.0008269839,0.0006072266,0.0012292004,0.001107351,0.0011619134,0.001660962,0.0009855847,0.006527838],"category_scores_gemma":[0.009014536,0.00050331035,0.000675564,0.0010735614,0.0010315365,0.0019380723,0.0013777346,0.0010650955,0.0013163653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010114725,0.0005054573,0.0028328397,0.00033861253,0.00014631772,0.00024603217,0.0005472567,0.29989716,0.030521622,0.262279,0.010951605,0.39072263],"study_design_scores_gemma":[0.00022926039,0.00019880987,0.00020420537,0.000033638935,0.00003052397,0.00018032234,0.0000722948,0.87415856,0.01778255,0.09667041,0.0104064215,0.000032997425],"about_ca_topic_score_codex":0.0018101049,"about_ca_topic_score_gemma":0.003239789,"teacher_disagreement_score":0.006527838,"about_ca_system_score_codex":0.0011644101,"about_ca_system_score_gemma":0.0014487492,"threshold_uncertainty_score":0.02183783},"labels":[],"label_agreement":null}]}