{"meta":{"query_hash":"9c80b3aca78d","filters":{"venue":"RAIRO - Theoretical Informatics and Applications"},"cohort_total":14,"direct_labels_cover":0,"predictions_cover":14,"exported":14,"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/9c80b3aca78d","api":"https://metacan.xera.ac/api/v1/cohort?venue=RAIRO+-+Theoretical+Informatics+and+Applications"},"results":[{"id":"W1927155547","doi":"10.1051/ita/2017004","title":"Interval exchanges, admissibility and branching Rauzy induction","year":2017,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Branching (polymer chemistry); Interval (graph theory); Mathematics; Mathematical economics; Chemistry; Combinatorics; Organic chemistry","score_opus":0.01511514287224976,"score_gpt":0.27387760225122476,"score_spread":0.258762459378975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1927155547","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.17799172,0.0005994812,0.7676135,0.0008630603,0.00010865761,0.00011066077,0.00022136577,0.0004339659,0.052057587],"genre_scores_gemma":[0.8706093,0.00032027814,0.11545503,0.0002466701,0.00011130461,0.00017154995,0.0002644613,0.00016713153,0.012654338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981198,0.00039034864,0.00015599815,0.0004725179,0.0005384385,0.00032289245],"domain_scores_gemma":[0.9955988,0.0020276757,0.00041568934,0.0010073925,0.0006438691,0.0003065902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020720994,0.00042381365,0.0006091357,0.0012963865,0.0017359053,0.002165179,0.0012003913,0.00092100794,0.0039728303],"category_scores_gemma":[0.0051081358,0.00040003884,0.0014091985,0.0009385018,0.00576371,0.005263875,0.0029250265,0.0035640227,0.0007275091],"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.000026293415,0.000013958524,0.0002941003,0.000017543543,0.0000036016913,0.000087603854,0.0003141763,0.0011719584,0.0020906639,0.99080175,0.00013960566,0.0050386973],"study_design_scores_gemma":[0.000021771091,0.000055209,0.00045442473,0.000024921503,0.000013630017,0.0002567774,0.0001934007,0.009471281,0.0065161693,0.97487664,0.008091129,0.00002449513],"about_ca_topic_score_codex":0.001000768,"about_ca_topic_score_gemma":0.0006822545,"teacher_disagreement_score":0.0039728303,"about_ca_system_score_codex":0.0015865784,"about_ca_system_score_gemma":0.00068329496,"threshold_uncertainty_score":0.013290405},"labels":[],"label_agreement":null},{"id":"W2053649470","doi":"10.1051/ita:2003019","title":"On ƒ-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes","year":2003,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hypercube; Computer science; Disjoint sets; Node (physics); Set (abstract data type); Arc (geometry); Routing (electronic design automation); Wavelength-division multiplexing; Computer network; Algorithm; Theoretical computer science; Combinatorics; Mathematics; Wavelength; Parallel computing; Physics","score_opus":0.007382309847206504,"score_gpt":0.2297986927931896,"score_spread":0.2224163829459831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053649470","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.56655824,0.0007585808,0.42441797,0.000456956,0.00005989573,0.00006462145,0.00012901612,0.00031422862,0.007240455],"genre_scores_gemma":[0.92952263,0.00046420086,0.06808429,0.00005912361,0.000054290067,0.00006668723,0.00013425444,0.0000641147,0.0015503791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924064,0.00028935826,0.00004058157,0.0000823368,0.0002188221,0.00012829338],"domain_scores_gemma":[0.9958911,0.0026336678,0.000664337,0.00034181832,0.00033418203,0.00013482642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016125599,0.00050784834,0.000535325,0.0011976265,0.0007799006,0.001171683,0.0010364974,0.0006692124,0.0009611286],"category_scores_gemma":[0.008813154,0.00030446638,0.00024960874,0.0011872002,0.0018362305,0.0027558461,0.0010049476,0.0008335591,0.00011613742],"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.00029034092,0.00006136517,0.0026320918,0.000080404476,0.000019768504,0.00012144383,0.00024728276,0.81628317,0.0041193757,0.14667915,0.00097250694,0.028493138],"study_design_scores_gemma":[0.00002325715,0.00006503677,0.0004128928,0.000014070353,0.00001202846,0.000057101846,0.00014625727,0.85077626,0.0039123013,0.14400709,0.0005584932,0.000015280772],"about_ca_topic_score_codex":0.0011828064,"about_ca_topic_score_gemma":0.0011259533,"teacher_disagreement_score":0.0016125599,"about_ca_system_score_codex":0.0013068022,"about_ca_system_score_gemma":0.0006137032,"threshold_uncertainty_score":0.009481549},"labels":[],"label_agreement":null},{"id":"W2072570893","doi":"10.1051/ita/2011112","title":"Multi-dimensional sets recognizable in all abstract numeration systems","year":2011,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Arithmetic; Discrete mathematics; Algebra over a field; Combinatorics; Pure mathematics","score_opus":0.03686374755198837,"score_gpt":0.2659644655075115,"score_spread":0.22910071795552314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072570893","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.67809844,0.0008536206,0.27630243,0.0006456836,0.00018444384,0.00008047634,0.0005387739,0.00151299,0.041783124],"genre_scores_gemma":[0.9663644,0.00015890179,0.027192296,0.00015453386,0.000071974864,0.00010075773,0.0004329517,0.00007357967,0.0054506687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798054,0.00028217907,0.00018019872,0.0007580807,0.00052177504,0.0002772466],"domain_scores_gemma":[0.99631846,0.0014354107,0.00067311,0.0008570984,0.00048722408,0.00022875066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000741284,0.0004966874,0.0007418671,0.0011923795,0.0011878925,0.0035414214,0.0007605264,0.0011072741,0.0040773614],"category_scores_gemma":[0.0034849176,0.0005631174,0.0009565008,0.0007810285,0.0027604182,0.004086241,0.0023639852,0.0017672832,0.0006443046],"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.00024741545,0.00010422735,0.0031802,0.0002372189,0.000050961236,0.00059614104,0.0026815797,0.009332916,0.033875823,0.9129623,0.001011512,0.03571961],"study_design_scores_gemma":[0.00004107296,0.00014195213,0.0029066515,0.000069659814,0.00004084998,0.00082224066,0.00052905316,0.017854588,0.018686272,0.94847554,0.0103630815,0.00006914026],"about_ca_topic_score_codex":0.0004064981,"about_ca_topic_score_gemma":0.00029416042,"teacher_disagreement_score":0.0040773614,"about_ca_system_score_codex":0.0007783296,"about_ca_system_score_gemma":0.0004794656,"threshold_uncertainty_score":0.013640165},"labels":[],"label_agreement":null},{"id":"W2077168540","doi":"10.1051/ita:2007042","title":"On Critical exponents in fixed points of<i>k</i>-uniform binary morphisms","year":2007,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Mathematics; Sketch; Bounded function; Binary number; Fixed point; Extension (predicate logic); Exponent; Discrete mathematics; Critical exponent; Combinatorics; Pure mathematics; Mathematical analysis; Algorithm; Arithmetic; Geometry; Computer science; Scaling","score_opus":0.00819716597446658,"score_gpt":0.2613758560435292,"score_spread":0.25317869006906263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077168540","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.8098894,0.0017014906,0.14849652,0.0009182679,0.00014453818,0.00010784068,0.000239683,0.00030543204,0.038196903],"genre_scores_gemma":[0.97699964,0.00053520047,0.017450726,0.000084968306,0.00012386004,0.0001036702,0.00012963053,0.00008165659,0.0044906503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928576,0.00014516519,0.00006467674,0.00014797822,0.00014186981,0.00021456725],"domain_scores_gemma":[0.9943346,0.0036874504,0.00057696714,0.0002961742,0.0005860137,0.0005187149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018901773,0.0008029906,0.0008859463,0.0034818288,0.0016227367,0.00302236,0.0007786582,0.0010259363,0.004762332],"category_scores_gemma":[0.009586544,0.0005157312,0.0008452555,0.0010456707,0.0034027903,0.0046525835,0.0022626314,0.0019880787,0.00050667697],"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.00013113208,0.00002981045,0.0028012875,0.00009722741,0.000013922423,0.00053138257,0.0010010981,0.0030111005,0.0053768074,0.98041785,0.0004644853,0.0061238892],"study_design_scores_gemma":[0.000058145677,0.00006906379,0.001649127,0.00012435633,0.000022973814,0.000286566,0.00050033274,0.025689311,0.0050464463,0.9634777,0.0030296876,0.000046411693],"about_ca_topic_score_codex":0.0009797581,"about_ca_topic_score_gemma":0.0008547564,"teacher_disagreement_score":0.004762332,"about_ca_system_score_codex":0.0023464006,"about_ca_system_score_gemma":0.0005336338,"threshold_uncertainty_score":0.017024398},"labels":[],"label_agreement":null},{"id":"W2081090714","doi":"10.1051/ita:2005038","title":"On Christoffel classes","year":2005,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Christoffel symbols; Mathematics; Computer science; Arithmetic; Pure mathematics","score_opus":0.005503843000699254,"score_gpt":0.23442778575729287,"score_spread":0.2289239427565936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081090714","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.69391876,0.0010179764,0.13417386,0.0012135603,0.0002612112,0.00011072345,0.00037545277,0.00028292474,0.1686455],"genre_scores_gemma":[0.9682898,0.00053768756,0.012653024,0.00023280752,0.00028570346,0.000082582745,0.0002611063,0.00008722792,0.017570144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901557,0.0001369377,0.000057521036,0.00025925488,0.00028162444,0.00024910146],"domain_scores_gemma":[0.9985025,0.0005649994,0.00025504117,0.00019679526,0.00023034569,0.00025037673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007122549,0.0006220802,0.0004758282,0.002143135,0.0017132292,0.0022698187,0.0006211835,0.0006992152,0.011733089],"category_scores_gemma":[0.0026015476,0.00020388603,0.00060557394,0.0014682435,0.0037874917,0.0047887564,0.0018368816,0.0011917992,0.0012633451],"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.000027340386,0.000017514842,0.00048447668,0.000020330985,0.0000030738727,0.000044037726,0.00015363746,0.00041332844,0.0015171001,0.9887243,0.0006029232,0.0079917805],"study_design_scores_gemma":[0.000014169505,0.00006110206,0.0016211332,0.000018438162,0.000010285231,0.00024182124,0.0002174969,0.004524419,0.0036881182,0.9779544,0.011625073,0.000023679519],"about_ca_topic_score_codex":0.00064892654,"about_ca_topic_score_gemma":0.00038865808,"teacher_disagreement_score":0.011733089,"about_ca_system_score_codex":0.0017212639,"about_ca_system_score_gemma":0.00029078007,"threshold_uncertainty_score":0.03925109},"labels":[],"label_agreement":null},{"id":"W2101596584","doi":"10.1051/ita:2008006","title":"Least Periods of Factors of Infinite Words","year":2008,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Fibonacci number; Word (group theory); Mathematics; Mathematical proof; Set (abstract data type); Integer (computer science); Combinatorics; Product (mathematics); Factor (programming language); Infinite set; Discrete mathematics; Arithmetic; Computer science","score_opus":0.011671359484466765,"score_gpt":0.23001026543767186,"score_spread":0.2183389059532051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101596584","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.72235197,0.002141586,0.20687665,0.0004928974,0.00022550978,0.000059910086,0.00075554295,0.0006083836,0.066487454],"genre_scores_gemma":[0.9667641,0.00051425816,0.026764436,0.00010631807,0.0002662794,0.000086144,0.00034967766,0.00014702666,0.005001675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993806,0.00009605449,0.000061097424,0.00018485964,0.00014303453,0.00013428972],"domain_scores_gemma":[0.99821657,0.0009511867,0.00031195677,0.0001737346,0.00018078915,0.00016571075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062600116,0.0005162359,0.0006253437,0.0013169352,0.00095731084,0.0024168498,0.000473267,0.0004399002,0.0050832336],"category_scores_gemma":[0.0032570749,0.000451721,0.0007520384,0.00079894497,0.0015347828,0.002997166,0.0011384538,0.0009830362,0.0007645783],"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.00023403122,0.00002942821,0.0020843474,0.00018454726,0.000032442735,0.00037751364,0.000778665,0.003072043,0.020506714,0.94933504,0.0014334632,0.02193183],"study_design_scores_gemma":[0.000040878764,0.00013772395,0.0029880702,0.00007442152,0.000054853484,0.000976684,0.00034856756,0.0146705,0.014713978,0.95009744,0.015832389,0.0000645618],"about_ca_topic_score_codex":0.00031867574,"about_ca_topic_score_gemma":0.0003688649,"teacher_disagreement_score":0.0050832336,"about_ca_system_score_codex":0.00068862975,"about_ca_system_score_gemma":0.00032233048,"threshold_uncertainty_score":0.017005086},"labels":[],"label_agreement":null},{"id":"W2170247267","doi":"10.1051/ita/2009017","title":"Dejean's conjecture holds for N ≥ 27","year":2009,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Conjecture; Combinatorics; Mathematics; Computer science","score_opus":0.014746001853592736,"score_gpt":0.2931907409636114,"score_spread":0.27844473911001866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170247267","genre_codex":"other","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.2551293,0.0027442824,0.08690006,0.032588664,0.0031905868,0.00009108946,0.0007570211,0.00039227525,0.6182066],"genre_scores_gemma":[0.9005772,0.0019350162,0.025695307,0.0032189065,0.0007797982,0.00014580716,0.0006887956,0.00011412743,0.06684506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986916,0.00016508058,0.00004351889,0.0003565448,0.00020651316,0.0005366217],"domain_scores_gemma":[0.996509,0.0015083695,0.00037124855,0.00069533207,0.00049272255,0.00042324714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017747299,0.00061699364,0.00082944817,0.001046792,0.0044507454,0.0026471675,0.0012765774,0.0012945887,0.014999467],"category_scores_gemma":[0.0047842953,0.00029555333,0.0011189007,0.00086346676,0.0035990619,0.005267784,0.003682994,0.0029497142,0.003777491],"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.00017529645,0.00005403382,0.0026002545,0.00010013011,0.000014681353,0.000439149,0.00034629297,0.0017956152,0.0011471948,0.9536178,0.019118637,0.020590847],"study_design_scores_gemma":[0.000020897922,0.00005178238,0.001319954,0.000046996298,0.000016066817,0.00035356975,0.00033094198,0.0033211024,0.0012968375,0.9445219,0.048692934,0.00002703982],"about_ca_topic_score_codex":0.0020902855,"about_ca_topic_score_gemma":0.0038437943,"teacher_disagreement_score":0.014999467,"about_ca_system_score_codex":0.0011945866,"about_ca_system_score_gemma":0.0011224801,"threshold_uncertainty_score":0.05017823},"labels":[],"label_agreement":null},{"id":"W2422636290","doi":"10.1051/ita/2016010","title":"Decision algorithms for Fibonacci-automatic Words, I: Basic results","year":2016,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fibonacci number; Morphism; Class (philosophy); Word (group theory); Algorithm; Computer science; Point (geometry); Palindrome; Arithmetic; Combinatorics; Mathematics; Discrete mathematics; Artificial intelligence","score_opus":0.011414138565296647,"score_gpt":0.26358908885084137,"score_spread":0.2521749502855447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2422636290","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.024132578,0.00060055515,0.95782936,0.0011911257,0.00017417276,0.00030492657,0.00045186325,0.0011734108,0.014141987],"genre_scores_gemma":[0.35441813,0.0006583935,0.6275564,0.0012540836,0.00051452714,0.0008362997,0.0019591441,0.00044901465,0.012354077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99424475,0.0014968691,0.0005581445,0.0014292866,0.0016214213,0.0006495753],"domain_scores_gemma":[0.98290586,0.012974139,0.0006855387,0.0014193534,0.0015347155,0.00048033116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004852324,0.001073495,0.001264714,0.002187605,0.0018244531,0.005344085,0.003621071,0.0025572646,0.010791009],"category_scores_gemma":[0.024319924,0.00084144727,0.0025674505,0.0021027634,0.0029543429,0.008636977,0.0041834456,0.004431383,0.0030426118],"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.00031404887,0.00030207547,0.0016162868,0.00032120058,0.00008271218,0.000093237875,0.00044867772,0.016605083,0.0032596348,0.8778575,0.0077195545,0.09137999],"study_design_scores_gemma":[0.00007257447,0.000066895656,0.00019525825,0.00006404913,0.00003574706,0.00007242009,0.00009565872,0.123177215,0.003337057,0.8686998,0.0041510942,0.000032236745],"about_ca_topic_score_codex":0.0016242826,"about_ca_topic_score_gemma":0.001677982,"teacher_disagreement_score":0.010791009,"about_ca_system_score_codex":0.002762573,"about_ca_system_score_gemma":0.002746939,"threshold_uncertainty_score":0.036099494},"labels":[],"label_agreement":null},{"id":"W2747855459","doi":"10.1051/ita/2017013","title":"On avoidability of formulas with reversal","year":2017,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Characterization (materials science); Variable (mathematics); Class (philosophy); Relation (database); Term (time)","score_opus":0.01926367236373752,"score_gpt":0.30213015519371705,"score_spread":0.28286648282997956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747855459","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.7380265,0.0019203022,0.22458598,0.0013925747,0.00016557363,0.00008622472,0.0005659025,0.00062507635,0.032631822],"genre_scores_gemma":[0.9660473,0.00066468964,0.027733967,0.00031099352,0.0002967459,0.00008848745,0.0006998399,0.00015669459,0.0040012603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99629444,0.00063593604,0.00039807972,0.0008312709,0.0011862611,0.00065398077],"domain_scores_gemma":[0.98913467,0.0060810624,0.0015832356,0.001169913,0.0014220186,0.0006090322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022668627,0.0008889942,0.0011832207,0.0024060523,0.0019424953,0.0025187165,0.0015376543,0.0011236324,0.0035744046],"category_scores_gemma":[0.010977527,0.00051017426,0.0019278381,0.0017532094,0.0041590654,0.0058584525,0.0029942633,0.0035886543,0.0003858868],"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.00025724503,0.00009156412,0.0051992415,0.00025313706,0.00007339276,0.00089016,0.0009948091,0.0038498007,0.0060372334,0.962203,0.0008572676,0.019293094],"study_design_scores_gemma":[0.00005033821,0.00015127358,0.0014156691,0.000051848176,0.000084223335,0.0009632243,0.000371104,0.011720024,0.0035104256,0.97670424,0.004923113,0.000054521937],"about_ca_topic_score_codex":0.0012522307,"about_ca_topic_score_gemma":0.00093287777,"teacher_disagreement_score":0.0035744046,"about_ca_system_score_codex":0.0014336571,"about_ca_system_score_gemma":0.0010583249,"threshold_uncertainty_score":0.011988521},"labels":[],"label_agreement":null},{"id":"W2885423836","doi":"10.1051/ita/2018008","title":"Circular critical exponents for Thue–Morse factors","year":2019,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morse code; Exponent; Word (group theory); Repetition (rhetorical device); Mathematics; Critical exponent; Factor (programming language); Discrete Morse theory; Combinatorics; Morse theory; Discrete mathematics; Pure mathematics; Geometry; Computer science; Linguistics; Philosophy","score_opus":0.009138817957750053,"score_gpt":0.25539041598198997,"score_spread":0.2462515980242399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885423836","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.8448093,0.0017286342,0.0936618,0.0008977475,0.00027114112,0.000082984254,0.00010785661,0.0002642264,0.058176313],"genre_scores_gemma":[0.9883477,0.00037372197,0.006746096,0.00006593515,0.00023779059,0.000052712316,0.00003642459,0.00005717237,0.0040824194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995989,0.00007910177,0.000030352621,0.00009122722,0.000096805925,0.00010365683],"domain_scores_gemma":[0.9941268,0.0034146716,0.000867699,0.00039066287,0.0005741855,0.0006259667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094543025,0.00063827645,0.00058111077,0.0022534947,0.00149193,0.0018394688,0.0004989488,0.0009223836,0.0074759694],"category_scores_gemma":[0.010062756,0.00029773326,0.00060788036,0.0007155133,0.0032265407,0.0026895737,0.0014200493,0.0014330688,0.0008195771],"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.00021037734,0.000040533527,0.0036066931,0.00016182191,0.000023717044,0.0009527973,0.001374194,0.0043173935,0.011747667,0.96513546,0.0012339054,0.0111955255],"study_design_scores_gemma":[0.000055115608,0.00013794043,0.0030895658,0.00010890102,0.000039382176,0.00078359735,0.000603723,0.036579598,0.012115037,0.9404389,0.005979689,0.00006857535],"about_ca_topic_score_codex":0.00056107243,"about_ca_topic_score_gemma":0.00047149113,"teacher_disagreement_score":0.0074759694,"about_ca_system_score_codex":0.00078190904,"about_ca_system_score_gemma":0.0003799474,"threshold_uncertainty_score":0.025009632},"labels":[],"label_agreement":null},{"id":"W2911506693","doi":"10.1051/ita/2018015","title":"Randomized generation of error control codes with automata and transducers","year":2018,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Error detection and correction; Algorithm; Computer science; Block (permutation group theory); Code (set theory); Automaton; Theoretical computer science; Mathematics; Programming language","score_opus":0.014520461654828115,"score_gpt":0.25472337989382593,"score_spread":0.2402029182389978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911506693","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.035033476,0.00005514756,0.9604809,0.00019229033,0.0000589811,0.00009792937,0.00010526557,0.0022099172,0.0017661026],"genre_scores_gemma":[0.4845988,0.00007376935,0.5108305,0.00016700407,0.00004469011,0.0003960595,0.00031476317,0.00043728182,0.0031370441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955041,0.0015284371,0.00037583036,0.00092516135,0.0012492795,0.00041723167],"domain_scores_gemma":[0.9864682,0.00864969,0.00086351053,0.0024441897,0.0013425321,0.00023187029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002901012,0.00051652896,0.0006353786,0.0006860351,0.00066420925,0.0012712779,0.0015935228,0.0010011061,0.002374555],"category_scores_gemma":[0.015538017,0.0004336288,0.0009470008,0.0005822956,0.002383027,0.002172053,0.0017231732,0.0013981655,0.0006319074],"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.00066216115,0.00015753646,0.002372322,0.00026770934,0.000055915294,0.0004323161,0.0006694045,0.27031633,0.041829526,0.61840326,0.0024233048,0.062410243],"study_design_scores_gemma":[0.00009449959,0.00011912206,0.00014929987,0.000037392336,0.000029825562,0.000103141705,0.000056850145,0.8067509,0.046757378,0.1412024,0.004657217,0.000041957184],"about_ca_topic_score_codex":0.0016351583,"about_ca_topic_score_gemma":0.0018303468,"teacher_disagreement_score":0.002901012,"about_ca_system_score_codex":0.0012904727,"about_ca_system_score_gemma":0.0022822374,"threshold_uncertainty_score":0.015342236},"labels":[],"label_agreement":null},{"id":"W2963042803","doi":"10.1051/ita/2010007","title":"Infinite words containing squares at every position","year":2010,"lang":"en","type":"article","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Infimum and supremum; Alphabet; Word (group theory); Position (finance); Mathematics; Combinatorics; Binary number; Arithmetic; Existential quantification; Discrete mathematics; Linguistics; Philosophy","score_opus":0.00508258092233842,"score_gpt":0.23085131560883587,"score_spread":0.22576873468649744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963042803","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.69119096,0.0025719076,0.21752538,0.007065486,0.00076521246,0.000044074677,0.00032704734,0.0009648104,0.07954515],"genre_scores_gemma":[0.9333757,0.0004268871,0.049283687,0.0008302378,0.00026914882,0.000070720926,0.00018150937,0.00019024851,0.015371739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991321,0.0002448834,0.00009658379,0.000285629,0.00013531269,0.000105554725],"domain_scores_gemma":[0.99461293,0.0036027555,0.0005017941,0.00044629193,0.00055061234,0.0002856095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008333037,0.0004962623,0.0007200221,0.00063553854,0.001343339,0.0020856299,0.0005185728,0.0012784646,0.0041301535],"category_scores_gemma":[0.005645853,0.0006355867,0.0005175938,0.0005786595,0.0037321865,0.005960814,0.0013550306,0.0017479147,0.0016201757],"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.00057581207,0.000055585857,0.0015850839,0.00034662432,0.000029260835,0.0009983965,0.0024404062,0.0026835958,0.039805345,0.91928077,0.0032057234,0.028993381],"study_design_scores_gemma":[0.000048988175,0.00010350868,0.000397385,0.00007253993,0.000025856423,0.0006505802,0.00069804693,0.0055473386,0.016433267,0.9570242,0.018951518,0.000046819576],"about_ca_topic_score_codex":0.00017945918,"about_ca_topic_score_gemma":0.00024235643,"teacher_disagreement_score":0.0041301535,"about_ca_system_score_codex":0.00058968243,"about_ca_system_score_gemma":0.00029519398,"threshold_uncertainty_score":0.013816774},"labels":[],"label_agreement":null},{"id":"W2997558551","doi":"10.1051/ita/2020006","title":"The weak circular repetition threshold over large alphabets","year":2020,"lang":"en","type":"preprint","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"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":"Conjecture; Repetition (rhetorical device); Physics; Combinatorics; Infimum and supremum; Mathematics; Philosophy","score_opus":0.010011638184957341,"score_gpt":0.2504297073528558,"score_spread":0.24041806916789846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997558551","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.7884979,0.0013809674,0.16632876,0.0013227281,0.00013452626,0.000060618677,0.00038941842,0.0011783541,0.040706642],"genre_scores_gemma":[0.98571175,0.00017622167,0.011395004,0.00016366201,0.00012486494,0.000063390944,0.00011578556,0.00007112704,0.0021781712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971148,0.00047072273,0.00024519136,0.00088968483,0.0008229483,0.00045664317],"domain_scores_gemma":[0.98149645,0.011331795,0.002014982,0.002392148,0.00152941,0.0012352417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019390419,0.00039546544,0.000680059,0.0016430574,0.0010571731,0.0026521473,0.0010093056,0.0009447887,0.0023304373],"category_scores_gemma":[0.014394758,0.00045081915,0.00057834195,0.00083074055,0.0034164463,0.0041034743,0.0026852435,0.00153733,0.00078005187],"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.0005041006,0.000060247872,0.005667812,0.00024262302,0.000034522956,0.0005840207,0.001228882,0.01637803,0.057755187,0.89022094,0.0018147925,0.025508817],"study_design_scores_gemma":[0.000050932285,0.00018244458,0.0029533398,0.000048939404,0.000038189322,0.00073306233,0.00029705637,0.0665322,0.02782285,0.89555097,0.0057010944,0.00008893021],"about_ca_topic_score_codex":0.0005243759,"about_ca_topic_score_gemma":0.0002457996,"teacher_disagreement_score":0.0026521473,"about_ca_system_score_codex":0.0011160664,"about_ca_system_score_gemma":0.00079242996,"threshold_uncertainty_score":0.010254741},"labels":[],"label_agreement":null},{"id":"W3042874346","doi":"10.1051/ita/2021001","title":"The simplest binary word with only three squares","year":2021,"lang":"en","type":"preprint","venue":"RAIRO - Theoretical Informatics and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"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":"Correctness; Word (group theory); Binary number; Property (philosophy); Computer science; Mathematics; Binary operation; Software; Discrete mathematics; Algebra over a field; Theoretical computer science; Arithmetic; Algorithm; Pure mathematics; Programming language; Epistemology; Philosophy","score_opus":0.008547743220322503,"score_gpt":0.23700780590173773,"score_spread":0.22846006268141522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042874346","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.30535272,0.0010300722,0.55988634,0.006149323,0.0019052968,0.00015969308,0.000588302,0.0018999152,0.12302841],"genre_scores_gemma":[0.7512894,0.00037484747,0.2252786,0.0009901364,0.00019551293,0.00016902591,0.00033087496,0.00072797143,0.02064352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918336,0.0002241051,0.000076736964,0.00022242514,0.0002036775,0.00008972171],"domain_scores_gemma":[0.9979075,0.00071593066,0.00019038212,0.0006062085,0.0003253039,0.00025462196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075966946,0.00044332558,0.0005939099,0.00051526964,0.0018976985,0.0018082882,0.00081900007,0.0010518524,0.010225218],"category_scores_gemma":[0.0027343584,0.00044721566,0.0008606788,0.0005129373,0.003366379,0.0040405216,0.0026968445,0.0019247999,0.003114385],"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.00033950835,0.000059306018,0.0010195279,0.00047429,0.00002712163,0.00067165494,0.0018138945,0.0013112988,0.040589385,0.91023064,0.0051494525,0.038313802],"study_design_scores_gemma":[0.000084520514,0.0001836391,0.00078724587,0.00020910132,0.00008603676,0.0020959435,0.0009416979,0.007250675,0.039520014,0.8472972,0.10141771,0.00012630457],"about_ca_topic_score_codex":0.00023175312,"about_ca_topic_score_gemma":0.00037430198,"teacher_disagreement_score":0.010225218,"about_ca_system_score_codex":0.0005389115,"about_ca_system_score_gemma":0.00066805835,"threshold_uncertainty_score":0.034206748},"labels":[],"label_agreement":null}]}