{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056705605,0.0001507305,0.929541,0.00071567326,0.000044607536,0.0003766327,0.00003417395,0.00018049519,0.012251104],"genre_scores_gemma":[0.95254827,0.00001641218,0.04673259,0.000429973,0.000015887876,0.00022801865,0.000008323462,0.00000484637,0.000015706573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990032,0.000049387974,0.00041547528,0.00010943027,0.0002517289,0.00017078276],"domain_scores_gemma":[0.9990223,0.00025702873,0.00014939735,0.00045232242,0.000036743633,0.00008217822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052373274,0.00009698668,0.00016355036,0.000073823874,0.0002960112,0.00007429885,0.0006597178,0.000019857816,0.00029704886],"category_scores_gemma":[0.000014099906,0.000082850886,0.00004985622,0.00032074112,0.0003700486,0.00021435873,0.0004868002,0.0001289962,0.000016846221],"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":[8.1813073e-7,0.00004029039,0.000013413672,0.000028021472,0.0000066888633,2.2379963e-7,0.0006661302,0.00016352489,0.00017011006,0.95904535,0.00007345806,0.039791998],"study_design_scores_gemma":[0.00019071464,0.000044896053,0.000038692466,0.0000059611048,0.000007666336,0.000029127988,0.00046004105,0.5431325,0.00044775457,0.4528938,0.002647448,0.000101412974],"about_ca_topic_score_codex":0.000002342992,"about_ca_topic_score_gemma":8.5996916e-8,"teacher_disagreement_score":0.8958426,"about_ca_system_score_codex":0.000016642227,"about_ca_system_score_gemma":0.00004005403,"threshold_uncertainty_score":0.3378561},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16487671,0.00014213081,0.8186457,0.0015088548,0.00005137159,0.00055914966,0.000019822324,0.0005442094,0.013652027],"genre_scores_gemma":[0.98759115,0.00009964635,0.011811742,0.00027687592,0.000027042215,0.000117027725,0.000005819209,0.0000059219487,0.0000647823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924725,0.000015246818,0.00033410356,0.00008794454,0.00014518668,0.00017027323],"domain_scores_gemma":[0.9992977,0.000110724824,0.00008155863,0.0003913589,0.000041719966,0.00007698528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027150242,0.00008872516,0.00013032151,0.00009896848,0.00009924101,0.000078477664,0.0004179554,0.0000433345,0.000010722031],"category_scores_gemma":[0.000021397269,0.00006597117,0.00003786955,0.00044833924,0.00036791267,0.00021395284,0.00032508513,0.000078387246,0.00009630454],"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.0000015886487,0.00001823567,0.000021139236,0.000054794284,0.000006805146,2.0080297e-7,0.0008311684,0.0000240246,0.00037524974,0.9595206,0.00010882008,0.03903739],"study_design_scores_gemma":[0.000207696,0.00003772565,0.00036844172,0.00006909254,0.000009068634,0.000013401822,0.00052740064,0.51601404,0.0023114716,0.47176683,0.008491713,0.00018311838],"about_ca_topic_score_codex":0.0000011559018,"about_ca_topic_score_gemma":8.018639e-8,"teacher_disagreement_score":0.82271445,"about_ca_system_score_codex":0.000004656714,"about_ca_system_score_gemma":0.000019841727,"threshold_uncertainty_score":0.26902264},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86800563,0.00017975949,0.12794259,0.00081602816,0.000029746465,0.0008036778,0.000056927693,0.00017065126,0.0019949686],"genre_scores_gemma":[0.98474944,0.00009100652,0.014933231,0.00012156254,0.0000081007665,0.00008235574,0.0000046094547,0.0000036981653,0.000006013581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913937,0.00003069755,0.00044052151,0.00010027923,0.00014095225,0.00014818138],"domain_scores_gemma":[0.998848,0.0006812983,0.00014094642,0.00023626038,0.000036309506,0.00005716017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038145986,0.00009536805,0.0002126458,0.00014545974,0.000052707655,0.000038880193,0.00026649804,0.000047075664,0.000011062996],"category_scores_gemma":[0.000074609896,0.00007261464,0.00002505977,0.00045423376,0.0007006072,0.00025168617,0.0001829476,0.00007199929,0.000003670156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012362682,0.000021787666,0.00013533971,0.0001549426,0.0000069328503,2.2464926e-7,0.0017760221,0.000052591986,0.00017936902,0.9750946,0.000019906385,0.02255705],"study_design_scores_gemma":[0.00016479199,0.000042584477,0.0018769865,0.000063888474,0.0000049550395,0.0000044056746,0.0006275109,0.36177108,0.0026021895,0.63270503,0.000056250054,0.000080334066],"about_ca_topic_score_codex":0.0000056351023,"about_ca_topic_score_gemma":8.690726e-7,"teacher_disagreement_score":0.3617185,"about_ca_system_score_codex":0.0000059493595,"about_ca_system_score_gemma":0.000036064826,"threshold_uncertainty_score":0.29611388},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005855561,0.00021273782,0.9726465,0.018669633,0.00010998146,0.0006726384,0.000055316992,0.0002878129,0.0014898694],"genre_scores_gemma":[0.9414118,0.00003998405,0.05633165,0.0011504918,0.000165301,0.00081661274,0.00003153471,0.000018703493,0.00003393491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987315,0.00004504725,0.00043775173,0.00024667205,0.00018332544,0.0003557313],"domain_scores_gemma":[0.9979401,0.00096056046,0.00004231282,0.0007348836,0.00010574608,0.00021637922],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007749991,0.0001870872,0.00017396943,0.00007339771,0.0005217121,0.001178902,0.00078864984,0.00009458815,0.000019716037],"category_scores_gemma":[0.000071733004,0.00012096091,0.000084771236,0.0003265132,0.0006351861,0.00038980079,0.00025732417,0.00021128668,0.00004196809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031046175,0.000056167555,0.0000012071813,0.00008741606,0.0000132761415,4.5732284e-7,0.0017387238,0.000015016436,0.00008827867,0.966521,0.00034605616,0.031129284],"study_design_scores_gemma":[0.000098601275,0.00006147249,0.000024791403,0.00003644818,0.000020573581,0.000026828826,0.00057496765,0.49253985,0.00020558601,0.4935948,0.012672642,0.00014344121],"about_ca_topic_score_codex":0.000004937523,"about_ca_topic_score_gemma":0.0000040024584,"teacher_disagreement_score":0.93555623,"about_ca_system_score_codex":0.000020600035,"about_ca_system_score_gemma":0.000069941794,"threshold_uncertainty_score":0.99985796},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004218027,0.000031963795,0.9619134,0.0012747938,0.000007653641,0.00023828133,0.000014732976,0.00013151395,0.032169603],"genre_scores_gemma":[0.96417975,0.000010339388,0.035421204,0.00025006876,0.000012916215,0.00010165425,0.000004286092,0.000003977764,0.00001578443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950653,0.000013291789,0.0001701599,0.00008990082,0.00013294476,0.00008714691],"domain_scores_gemma":[0.9992594,0.00034715454,0.00004292297,0.00026324074,0.000050513197,0.00003673747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002139719,0.00007656623,0.00007511423,0.000037180762,0.000090235706,0.00038328278,0.00023398163,0.000026433803,0.000010004364],"category_scores_gemma":[0.000037605594,0.000041833737,0.000019937053,0.00018587681,0.00079591305,0.00030059324,0.00007509706,0.0000913156,0.000007871648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.665344e-7,0.00001310978,0.0000010038677,0.000037275477,0.0000068187815,1.5380111e-7,0.00020789447,0.000010700539,0.00011840937,0.96270186,0.00024189407,0.03666004],"study_design_scores_gemma":[0.000036656544,0.0000693144,0.000006890819,0.00007490117,0.0000070509145,0.000012014421,0.000039774153,0.34522152,0.0073382715,0.6462799,0.00083440635,0.000079367914],"about_ca_topic_score_codex":3.4851544e-7,"about_ca_topic_score_gemma":1.7399204e-7,"teacher_disagreement_score":0.9599618,"about_ca_system_score_codex":0.000007127553,"about_ca_system_score_gemma":0.00003404228,"threshold_uncertainty_score":0.36960047},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04074567,0.00029557978,0.944842,0.0014423106,0.000041082534,0.0007650602,0.000024694174,0.00043309166,0.011410524],"genre_scores_gemma":[0.9415291,0.00011241022,0.057885535,0.00013013872,0.000012453515,0.00025118428,0.000017680362,0.000014376574,0.000047109646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876916,0.000063306434,0.00035709265,0.00022424641,0.00025076876,0.00033544961],"domain_scores_gemma":[0.9986939,0.0005988176,0.000040766485,0.00044488913,0.00006336905,0.00015828383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043880558,0.00016504235,0.00017203875,0.00023845729,0.00017616374,0.0003557458,0.00044795737,0.00006623598,0.000017138986],"category_scores_gemma":[0.00003198175,0.000123609,0.000037641705,0.0012381438,0.0005376335,0.00048174412,0.00019670451,0.00023492015,0.000045037727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004531504,0.00003110527,0.000052058534,0.00005190696,0.000012360204,0.0000020098937,0.00094355457,0.00008491652,0.00010714602,0.94502014,0.00003961735,0.053650666],"study_design_scores_gemma":[0.00019645083,0.000055360975,0.00025727865,0.0000886811,0.000005864804,0.000022444492,0.00024156092,0.4963888,0.00018309079,0.5010199,0.0013713657,0.00016919464],"about_ca_topic_score_codex":0.00000230049,"about_ca_topic_score_gemma":0.0000066667358,"teacher_disagreement_score":0.9007834,"about_ca_system_score_codex":0.000028034552,"about_ca_system_score_gemma":0.00005991687,"threshold_uncertainty_score":0.5040629},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054089644,0.00012153344,0.9761443,0.0024862774,0.000021728976,0.0009629595,0.00014624947,0.000016237846,0.01955979],"genre_scores_gemma":[0.9878876,0.000075406286,0.009265397,0.00020484086,0.00009651172,0.0020011023,0.00003942519,0.000010575344,0.00041914804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919814,0.000010319052,0.00043554226,0.00008449949,0.000086991735,0.00018450708],"domain_scores_gemma":[0.9970293,0.0022055889,0.00013422743,0.00047292857,0.00011081104,0.000047130357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026924865,0.000115129485,0.00016108765,0.000019370154,0.0006918295,0.00006303376,0.000328397,0.000032566604,0.000028769371],"category_scores_gemma":[0.000030048099,0.000062620886,0.000098800396,0.00022030587,0.00088609365,0.000049268587,0.00011769634,0.000103825005,0.0000044121844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006822724,0.000034351542,0.000030834613,0.00003082945,0.000044221288,1.8304861e-9,0.00005584039,0.000091196154,0.000017288063,0.9644508,0.00026474203,0.03497307],"study_design_scores_gemma":[0.00018898201,0.000009722289,0.0000460657,0.0000135506925,0.00005919013,1.9390733e-7,0.0012733821,0.017615816,0.00028289156,0.8840756,0.09636674,0.00006790257],"about_ca_topic_score_codex":0.0000038162584,"about_ca_topic_score_gemma":4.949022e-7,"teacher_disagreement_score":0.9873467,"about_ca_system_score_codex":0.0000064189935,"about_ca_system_score_gemma":0.000029856727,"threshold_uncertainty_score":0.53210634},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043676,0.0003162864,0.9048789,0.0122646075,0.000041173313,0.0018626428,0.000029355775,0.00010005521,0.036830988],"genre_scores_gemma":[0.9750905,0.00021659417,0.022963291,0.0010530195,0.000013952472,0.0005350056,0.000009784223,0.0000054883994,0.00011238632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989816,0.000068154,0.00034918135,0.00016555015,0.00017194635,0.00026354793],"domain_scores_gemma":[0.99879104,0.00049391255,0.000038588118,0.0005265878,0.00006600671,0.00008389389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056439586,0.00011832871,0.00013588191,0.00013913024,0.0002942425,0.00022450167,0.0005684876,0.000059287788,0.000007656106],"category_scores_gemma":[0.000044515436,0.00008407169,0.000027934684,0.00065790286,0.0009096664,0.00022690342,0.0002841449,0.00026047105,0.000014055248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039798756,0.000043020198,0.000041630887,0.00003843326,0.0000072476255,2.4428414e-7,0.0015676266,0.000032770608,0.000043010812,0.9835072,0.00023595581,0.014478842],"study_design_scores_gemma":[0.00031388242,0.00003780982,0.00034267333,0.000029143874,0.00000866365,0.00002484646,0.0015740723,0.04967831,0.00008678392,0.9344825,0.013307386,0.0001138875],"about_ca_topic_score_codex":0.0000021828305,"about_ca_topic_score_gemma":0.0000013143094,"teacher_disagreement_score":0.9314145,"about_ca_system_score_codex":0.000018274663,"about_ca_system_score_gemma":0.000049785023,"threshold_uncertainty_score":0.34283438},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032060917,0.0010422468,0.91493136,0.0018137452,0.00013229491,0.00097460486,0.00005838646,0.000094693845,0.07774656],"genre_scores_gemma":[0.9711594,0.0006560186,0.025884574,0.0012327599,0.0000672362,0.00021343253,0.000012721756,0.000013889223,0.00075999514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975721,0.00007680596,0.0012721812,0.0003041427,0.0003241237,0.00045063221],"domain_scores_gemma":[0.9976162,0.00047222225,0.00033807536,0.0011620694,0.00019343007,0.00021801994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086816476,0.00032775526,0.00052707363,0.00025862388,0.0003652545,0.00028535057,0.0011014885,0.00023717254,0.00009031794],"category_scores_gemma":[0.00009458439,0.00023038527,0.00015972064,0.001230941,0.0020131934,0.00034586774,0.0009025046,0.00037315162,0.000050627947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010261304,0.00018816504,0.000028509869,0.0004707122,0.000051103234,2.1626201e-7,0.00086591736,0.000010618107,0.00006464644,0.7843234,0.0004955391,0.21349093],"study_design_scores_gemma":[0.0005455351,0.00009497914,0.00015669785,0.00036884093,0.00010492363,0.000011405536,0.0008054479,0.4743621,0.0008940894,0.49258992,0.02973343,0.00033260463],"about_ca_topic_score_codex":0.000007632729,"about_ca_topic_score_gemma":3.3701025e-7,"teacher_disagreement_score":0.96795326,"about_ca_system_score_codex":0.000040444378,"about_ca_system_score_gemma":0.00021263886,"threshold_uncertainty_score":0.9394839},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08819727,0.00053081487,0.8808135,0.0023089482,0.0002008152,0.0028960404,0.0002063247,0.00017684152,0.024669465],"genre_scores_gemma":[0.687712,0.002683429,0.30503678,0.001407788,0.0003021002,0.0004999816,0.000047850375,0.00010437918,0.002205674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970651,0.00011067131,0.0013344153,0.00036658195,0.00037280822,0.00075039204],"domain_scores_gemma":[0.99612355,0.0018846622,0.0003670638,0.0007718372,0.00026006077,0.0005928253],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008980827,0.00056054804,0.0008155249,0.00025793913,0.00092559785,0.00037056624,0.0005136646,0.00036078086,0.000080515216],"category_scores_gemma":[0.00041762495,0.0005178883,0.00012594527,0.0007047121,0.001555336,0.00029852803,0.0008689087,0.0004264724,0.0000691626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089569105,0.0001564397,0.000020618076,0.0007613692,0.0001323983,0.0000018392383,0.0028154494,0.0003542227,0.00015290166,0.98698366,0.00035288028,0.008178658],"study_design_scores_gemma":[0.0019445018,0.00012463982,0.000011591928,0.0003150633,0.00035495582,0.000035638186,0.0024477704,0.11757363,0.0014519646,0.863412,0.011827635,0.00050056924],"about_ca_topic_score_codex":0.0000066921016,"about_ca_topic_score_gemma":0.000004646837,"teacher_disagreement_score":0.5995147,"about_ca_system_score_codex":0.00031033639,"about_ca_system_score_gemma":0.00023932396,"threshold_uncertainty_score":0.99972725},"labels":[],"label_agreement":null}]}