{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118768536,0.00009938651,0.8705052,0.0016641385,0.00006833515,0.0003086741,0.0000099268245,0.00011907133,0.0084567005],"genre_scores_gemma":[0.97674555,0.0000805023,0.022683531,0.00031828298,0.00007771022,0.00005563242,0.0000044488806,0.0000051324528,0.000029218372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992644,0.000022367049,0.00026511916,0.00016156016,0.00011390575,0.00017263368],"domain_scores_gemma":[0.99878633,0.00010270147,0.00014515471,0.000771531,0.000034602563,0.00015965616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050779566,0.00011380239,0.00014119862,0.000039492104,0.00065557315,0.0006342535,0.00050958025,0.00007008232,0.000017949213],"category_scores_gemma":[0.00007373425,0.0000924456,0.000030345434,0.000048606704,0.00053244736,0.00069517654,0.0005164509,0.00015095332,0.000012165693],"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.0000016801121,0.000017938575,0.000074120275,0.000029821136,0.000004688283,1.215031e-7,0.00056845794,6.439007e-7,0.00004892625,0.81590986,0.000033680568,0.18331006],"study_design_scores_gemma":[0.00032266325,0.0000460847,0.0053833663,0.000043617183,0.0000134772035,0.000038627008,0.00027028355,0.15985578,0.0003811594,0.82749045,0.005930897,0.0002235673],"about_ca_topic_score_codex":0.0000052782316,"about_ca_topic_score_gemma":0.0000011050953,"teacher_disagreement_score":0.85797703,"about_ca_system_score_codex":0.0000112790585,"about_ca_system_score_gemma":0.000015096835,"threshold_uncertainty_score":0.61161214},"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":"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.2771773,0.00015548967,0.6781495,0.0003912655,0.000028915054,0.0007587404,0.000018368248,0.0004600784,0.042860292],"genre_scores_gemma":[0.9526414,0.00042747293,0.04655165,0.000118664924,0.00001197188,0.00021489819,0.0000089285695,0.000019268586,0.000005727864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990541,0.000009676395,0.00037603953,0.00012429636,0.00011911594,0.0003167713],"domain_scores_gemma":[0.9991019,0.0004543682,0.000022241149,0.00026436124,0.000023953258,0.00013317571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015155046,0.00017840152,0.00020867545,0.00010780813,0.000089715286,0.00005362971,0.00011130366,0.0001533975,0.000015103479],"category_scores_gemma":[0.00015772485,0.00015786939,0.000026769914,0.00023145255,0.000491961,0.00012693889,0.00005199999,0.00034527047,0.000017790793],"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.0000025969969,0.000029674202,0.000065795306,0.000035654914,0.000011541732,3.2293258e-7,0.00012717175,0.0060580582,0.000034400702,0.9724552,0.000019204259,0.021160377],"study_design_scores_gemma":[0.00036468194,0.00003781609,0.0003206933,0.000034973393,0.00001858556,0.0000113928745,0.00087455154,0.46358725,0.00018640235,0.5306337,0.003659093,0.00027082895],"about_ca_topic_score_codex":3.2922205e-7,"about_ca_topic_score_gemma":0.0000017073448,"teacher_disagreement_score":0.6754641,"about_ca_system_score_codex":0.00004058811,"about_ca_system_score_gemma":0.0000075788334,"threshold_uncertainty_score":0.6437727},"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":"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.037064813,0.000138447,0.9481109,0.00019017678,0.00010151462,0.00073455245,0.000023001478,0.00018651849,0.013450116],"genre_scores_gemma":[0.8879453,0.000028661416,0.11141091,0.00037531467,0.00001842961,0.00015896957,0.000025905598,0.000007541525,0.000028960369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990158,0.000023134113,0.00045309358,0.00014731793,0.00013894857,0.00022170393],"domain_scores_gemma":[0.99925977,0.00012488251,0.00010311444,0.00034383882,0.000049481892,0.000118908916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046003377,0.00012273747,0.00014411652,0.000082838495,0.00010189927,0.00013354747,0.00030930658,0.000084570296,0.000049029462],"category_scores_gemma":[0.000016535208,0.00010252416,0.000028398248,0.000177948,0.00014365886,0.0004328425,0.00012853702,0.00013636526,0.00011707504],"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.0000023788202,0.0001063515,0.000038761693,0.000026379485,0.0000067132314,7.438997e-7,0.0008918543,0.00009673366,0.00008141463,0.9901055,0.00009132668,0.008551834],"study_design_scores_gemma":[0.00034046549,0.000027240409,0.001134959,0.00003523066,0.000006645372,0.000026761874,0.00020538703,0.8885929,0.00021376605,0.10766876,0.0015495011,0.00019837334],"about_ca_topic_score_codex":0.000018001174,"about_ca_topic_score_gemma":0.0000014800472,"teacher_disagreement_score":0.88849616,"about_ca_system_score_codex":0.000018640794,"about_ca_system_score_gemma":0.00002434094,"threshold_uncertainty_score":0.41808137},"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":"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.0857165,0.00003290912,0.903037,0.0006255218,0.00004325932,0.0002878643,0.000013010218,0.00007001616,0.0101738935],"genre_scores_gemma":[0.9381771,0.000018769759,0.061006635,0.00071788015,0.000019290137,0.00003745906,0.000007745443,0.0000069675475,0.000008125782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987093,0.00002129814,0.00058135286,0.00014392265,0.00023924783,0.00030484563],"domain_scores_gemma":[0.9983678,0.0008642768,0.000083903935,0.00047873025,0.00004619371,0.00015908702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081166497,0.00013661713,0.00019419787,0.00017676405,0.000094671675,0.00005487303,0.0004634895,0.000091176364,0.00003345492],"category_scores_gemma":[0.000090362155,0.00011453373,0.00004883583,0.000359567,0.00048159066,0.00026023446,0.00021515443,0.00017553373,0.00004374582],"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.000010775286,0.00015487226,0.000031904496,0.000032715106,0.0000034434856,0.000001715444,0.00039871607,0.00001716084,0.00018756084,0.98806465,0.000049059177,0.011047408],"study_design_scores_gemma":[0.00038182593,0.00011728002,0.00081605103,0.000062291416,0.0000055030855,0.000015206094,0.0002492251,0.09917749,0.0015664352,0.8969374,0.0004904338,0.00018091101],"about_ca_topic_score_codex":0.0000018166431,"about_ca_topic_score_gemma":3.738097e-7,"teacher_disagreement_score":0.8524606,"about_ca_system_score_codex":0.000022533577,"about_ca_system_score_gemma":0.000018663097,"threshold_uncertainty_score":0.46705502},"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":"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.006741637,0.000058917652,0.9391026,0.0020927368,0.000022560504,0.00021748942,0.000008072863,0.00019912187,0.05155685],"genre_scores_gemma":[0.9373593,0.000057705205,0.05960417,0.0026825026,0.00009500223,0.000100951176,0.0000070634746,0.000007072133,0.00008624723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992388,0.000014640767,0.00027446912,0.00012062162,0.000154842,0.0001966281],"domain_scores_gemma":[0.9990338,0.00027958257,0.00006466123,0.00046394003,0.000028127894,0.00012986477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020570176,0.00011523552,0.00011531772,0.00005801428,0.00018373801,0.0001698735,0.00043363732,0.000057829136,0.000053439555],"category_scores_gemma":[0.000020374828,0.00009010233,0.000038894155,0.00016341338,0.00025650123,0.00026425126,0.00014754306,0.00012808469,0.0002950218],"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.0000011789435,0.000045295874,0.0000020710893,0.000008115573,0.000003789432,9.159692e-8,0.00019236462,0.00004843458,0.000018603145,0.914645,0.0008548173,0.08418024],"study_design_scores_gemma":[0.00019650931,0.000045766792,0.000053158823,0.000012974041,0.000005668462,0.00001331621,0.00007989478,0.3142241,0.00037123734,0.6091459,0.07568579,0.0001657413],"about_ca_topic_score_codex":3.2852932e-7,"about_ca_topic_score_gemma":1.5277749e-7,"teacher_disagreement_score":0.93061763,"about_ca_system_score_codex":0.000017008872,"about_ca_system_score_gemma":0.000016817796,"threshold_uncertainty_score":0.3792007},"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":"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.295137,0.00005740681,0.69570106,0.00008084098,0.000016374144,0.0001583111,0.000022546476,0.00004628684,0.00878014],"genre_scores_gemma":[0.9758405,0.0000716287,0.023966188,0.00006181607,0.0000121370895,0.000018870476,0.0000058902096,0.0000042999463,0.000018635803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915725,0.000015400323,0.0004444275,0.000079556004,0.00016580829,0.00013758514],"domain_scores_gemma":[0.9990806,0.00019994301,0.00015803867,0.00041072606,0.00006247734,0.00008823881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015958666,0.00009953547,0.00019545273,0.00007619703,0.00010721512,0.000021377138,0.00039527274,0.000054317712,0.00003295302],"category_scores_gemma":[0.000023936256,0.00007727805,0.00005813694,0.00028251254,0.00082242873,0.00019080107,0.00017936357,0.000082905906,0.000006582413],"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.0000015299154,0.000045326844,0.00039178843,0.000035304136,0.0000083326195,8.693307e-8,0.002465325,0.000017464807,0.00012805198,0.9907274,0.000023407727,0.006155956],"study_design_scores_gemma":[0.001148038,0.0003665215,0.014669688,0.00012993604,0.00005423957,0.0000984431,0.0036502548,0.32127962,0.014060367,0.62890786,0.014834069,0.0008009843],"about_ca_topic_score_codex":0.0000025523464,"about_ca_topic_score_gemma":1.0790886e-7,"teacher_disagreement_score":0.6807035,"about_ca_system_score_codex":0.0000051712072,"about_ca_system_score_gemma":0.000032755415,"threshold_uncertainty_score":0.31513074},"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":"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.030126575,0.00007677156,0.9241015,0.001900447,0.000046055047,0.0012987206,0.00007855,0.00018192967,0.04218946],"genre_scores_gemma":[0.9421955,0.000034690253,0.05554452,0.0014408951,0.0001687103,0.0001660951,0.000043401942,0.00001743424,0.00038876972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990096,0.000018215851,0.0004342635,0.00012108761,0.00013638542,0.00028046442],"domain_scores_gemma":[0.9985258,0.00077026477,0.00011869401,0.00035658042,0.000065488086,0.00016318457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043545009,0.00017713805,0.00024356318,0.00006187325,0.00023357062,0.000070083566,0.00019423642,0.00014906988,0.00012300901],"category_scores_gemma":[0.00015630302,0.00014162644,0.000092743874,0.0001748325,0.00032979748,0.0001072616,0.000038857987,0.00015948985,0.00003275519],"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.000014807763,0.000077217104,0.0000052213404,0.000071039496,0.000016687733,1.15713014e-7,0.00036417064,0.0000026941898,0.000023759358,0.9859761,0.0018326971,0.011615465],"study_design_scores_gemma":[0.0004251843,0.00010516807,0.00002453831,0.000016206193,0.00005900661,0.000019366093,0.00036657113,0.0018547343,0.00043738048,0.96896255,0.027540071,0.00018923996],"about_ca_topic_score_codex":1.4402393e-7,"about_ca_topic_score_gemma":1.1321548e-7,"teacher_disagreement_score":0.9120689,"about_ca_system_score_codex":0.000013745519,"about_ca_system_score_gemma":0.00001957516,"threshold_uncertainty_score":0.57753587},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033273206,0.0000485928,0.9909751,0.0021739968,0.00007014931,0.0006410899,0.000101462414,0.00023285217,0.0024294772],"genre_scores_gemma":[0.48953825,0.00013887777,0.50809646,0.0011579451,0.00014124258,0.000688726,0.000027483464,0.000022825152,0.00018818206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855554,0.000021335334,0.0006395025,0.00023229828,0.00022127345,0.00033006555],"domain_scores_gemma":[0.9970206,0.0017895695,0.00015806808,0.0007574728,0.00008248879,0.00019179916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006767252,0.00017664373,0.00020847171,0.00009434211,0.00025140023,0.00019839297,0.00066202215,0.000094631025,0.000026603648],"category_scores_gemma":[0.00016480166,0.00010942342,0.0000822128,0.0002493042,0.00030022464,0.0004265137,0.00026158325,0.00007030594,0.00009483223],"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.000004569472,0.000022042843,0.0000011872024,0.000012238205,0.0000049999535,8.960391e-8,0.0001282861,0.0000017217304,0.000042299107,0.5773824,0.0006189002,0.42178124],"study_design_scores_gemma":[0.00087035866,0.000068975285,0.00009326598,0.00007820855,0.000010947864,0.000014609033,0.000070767725,0.26739514,0.00035243193,0.701748,0.029094718,0.00020256072],"about_ca_topic_score_codex":5.371708e-7,"about_ca_topic_score_gemma":2.255475e-7,"teacher_disagreement_score":0.48621094,"about_ca_system_score_codex":0.000026294376,"about_ca_system_score_gemma":0.000034966757,"threshold_uncertainty_score":0.44621575},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67205846,0.0000074241357,0.18222994,0.00051053497,0.000019059427,0.0010353365,0.00009028955,0.00006003008,0.14398892],"genre_scores_gemma":[0.98610926,0.00000842479,0.01356931,0.000114492796,0.000022507918,0.00008201219,0.000004164962,0.000010713363,0.000079119876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924314,0.000018919112,0.0003355585,0.00008868812,0.00016482973,0.00014889403],"domain_scores_gemma":[0.9983602,0.00046274808,0.00020600569,0.00078347925,0.00008146077,0.00010610721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045288462,0.0001186021,0.000218831,0.000026173271,0.00037063131,0.00005920047,0.00025760554,0.000076520126,0.00010068115],"category_scores_gemma":[0.0002389415,0.00007911083,0.000040231884,0.000035317553,0.001230091,0.00011392581,0.000085601874,0.00014830804,0.000018840292],"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.00004131088,0.00009144486,0.000104543244,0.000101039324,0.000016422071,1.8334455e-7,0.00034811127,0.0000025350714,0.000016220343,0.99729306,0.00012115999,0.0018639647],"study_design_scores_gemma":[0.00048455113,0.00014431073,0.00022365742,0.000049333416,0.00004018192,0.0000058177898,0.00032843408,0.0018405266,0.0007632909,0.9950044,0.0009878384,0.00012765457],"about_ca_topic_score_codex":0.0000015355002,"about_ca_topic_score_gemma":0.0000013812574,"teacher_disagreement_score":0.3140508,"about_ca_system_score_codex":0.000012605166,"about_ca_system_score_gemma":0.000027669466,"threshold_uncertainty_score":0.45323217},"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":"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.05227844,0.00004132583,0.94184595,0.0004948546,0.000082287384,0.0006434491,0.00003374358,0.0001414325,0.0044385027],"genre_scores_gemma":[0.96231824,0.000012684709,0.03682488,0.0005359385,0.00004147187,0.00018653955,0.000024679994,0.000011074135,0.000044491688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895364,0.000018183411,0.00035803654,0.0001837876,0.00018383766,0.0003025059],"domain_scores_gemma":[0.9984737,0.0006377597,0.00006194622,0.00057743303,0.00006755075,0.00018161046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028865493,0.00015278406,0.00019121538,0.00006150633,0.00018277696,0.00021789494,0.00051839114,0.00008862388,0.000066625056],"category_scores_gemma":[0.00006196982,0.00012140544,0.00008580928,0.0001533152,0.00028542854,0.000371306,0.00020123321,0.00010938176,0.00011174816],"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.000001809739,0.00004753809,0.000084362255,0.00007063817,0.000008508353,8.925631e-8,0.00040545763,0.000008149642,0.00015532604,0.9949235,0.00009568286,0.004198944],"study_design_scores_gemma":[0.00035261488,0.00007265549,0.00032117934,0.000023009632,0.00001756661,0.000010022288,0.00048888143,0.2885023,0.0006664754,0.69410765,0.015165972,0.00027169424],"about_ca_topic_score_codex":7.043601e-7,"about_ca_topic_score_gemma":3.518946e-8,"teacher_disagreement_score":0.9100398,"about_ca_system_score_codex":0.00001533265,"about_ca_system_score_gemma":0.00002314243,"threshold_uncertainty_score":0.495077},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045261603,0.00004490457,0.9504731,0.0006006451,0.000013317638,0.00052811025,0.00001797285,0.000071226605,0.0029890705],"genre_scores_gemma":[0.9468452,0.000039563532,0.05258541,0.0003563071,0.00004098896,0.00011204048,0.00000762574,0.0000050994454,0.000007771197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999199,0.000050419934,0.00036137685,0.000115353105,0.00013761783,0.00013624242],"domain_scores_gemma":[0.9990964,0.0002955689,0.00012287628,0.0003111722,0.000084369305,0.00008963413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056990964,0.00011113013,0.00027884252,0.000053234744,0.00014536829,0.000100291945,0.00021256715,0.00004851089,0.000014738739],"category_scores_gemma":[0.000021374994,0.00007381014,0.000032323416,0.0001371036,0.0015039936,0.00023137759,0.000045566132,0.000056263474,0.000004378115],"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.00021178053,0.000024037005,0.0000035961436,0.000024473127,0.000025423431,5.9896244e-8,0.0008816255,0.000011152721,0.00026269394,0.98864526,0.00003874793,0.009871136],"study_design_scores_gemma":[0.016527014,0.00010000582,0.00002499721,0.000019182839,0.000047310532,0.000017074934,0.00013546812,0.9061252,0.0013195887,0.07513468,0.00042174855,0.00012774492],"about_ca_topic_score_codex":0.000002239269,"about_ca_topic_score_gemma":7.198496e-7,"teacher_disagreement_score":0.9135106,"about_ca_system_score_codex":0.000004842009,"about_ca_system_score_gemma":0.000024317835,"threshold_uncertainty_score":0.5541527},"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":"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.16543615,0.00003528531,0.8104636,0.0013689005,0.00009265057,0.00033387763,0.000020105037,0.00026136014,0.021988085],"genre_scores_gemma":[0.9588639,0.000018969013,0.039649177,0.0012207978,0.00007378865,0.000105635285,0.000020923919,0.000007438901,0.000039333703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910057,0.000017289416,0.00035090037,0.00013455392,0.00016652321,0.0002301423],"domain_scores_gemma":[0.9988836,0.00030318886,0.00010233323,0.00048753223,0.000067380155,0.0001559562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035695458,0.0001301772,0.00013511893,0.000071908486,0.00033213157,0.00023744929,0.00040160495,0.00009573998,0.00008136877],"category_scores_gemma":[0.000038882572,0.00010936234,0.00004634695,0.0001980921,0.00036413438,0.00038444414,0.00032726084,0.00021795604,0.00008136032],"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.0000035523233,0.000022645903,0.00003798875,0.000013215131,0.000005839801,3.089297e-7,0.00067090866,0.0000059436934,0.00083109393,0.9757504,0.00014139322,0.022516726],"study_design_scores_gemma":[0.00042360535,0.00009162227,0.000796098,0.000027843951,0.000019179948,0.00009840631,0.00039696236,0.28226298,0.0013444157,0.67328143,0.04088083,0.00037664868],"about_ca_topic_score_codex":0.0000014342032,"about_ca_topic_score_gemma":0.0000013676085,"teacher_disagreement_score":0.79342777,"about_ca_system_score_codex":0.000015412366,"about_ca_system_score_gemma":0.000023464438,"threshold_uncertainty_score":0.4459667},"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":"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.0012155405,0.0004912099,0.97154385,0.0041611716,0.00014142077,0.00083644653,0.000094214774,0.00030881766,0.021207316],"genre_scores_gemma":[0.97826713,0.0011592457,0.01601685,0.0030751582,0.00034913438,0.00084437255,0.00018880208,0.00003622194,0.00006308638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818045,0.000049708928,0.00065793673,0.00034065198,0.00038162628,0.00038963972],"domain_scores_gemma":[0.9976885,0.00033040287,0.0002779779,0.0013959166,0.000080201375,0.00022704969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007326535,0.00028897857,0.00028519236,0.00005110396,0.000600056,0.00090040243,0.0013925872,0.0002357054,0.000032942473],"category_scores_gemma":[0.000048690585,0.00020681822,0.00015509427,0.00021481053,0.0004760894,0.00020965903,0.0021585575,0.00064897176,0.00008333729],"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.0000020595767,0.000034969176,0.0000075568323,0.00008854569,0.00003217834,4.9168943e-7,0.00030989604,0.000027950102,0.000017070173,0.9885226,0.0010489702,0.009907736],"study_design_scores_gemma":[0.00013001799,0.000014055697,0.00006690225,0.000043124466,0.000022588936,0.0000071047916,0.00014756109,0.34838006,0.000044401193,0.61110276,0.039837677,0.00020375535],"about_ca_topic_score_codex":0.0000017809132,"about_ca_topic_score_gemma":6.4817647e-7,"teacher_disagreement_score":0.9770516,"about_ca_system_score_codex":0.000047089175,"about_ca_system_score_gemma":0.00007550171,"threshold_uncertainty_score":0.86826015},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02276922,0.00059490284,0.9675848,0.0024359992,0.00007595778,0.0007530902,0.000036874477,0.00023105941,0.005518126],"genre_scores_gemma":[0.9089769,0.00064668927,0.08836016,0.0009412546,0.00016132466,0.0006991372,0.00012261789,0.0000322126,0.000059666232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983901,0.000048382786,0.0005473191,0.00030310964,0.0003391445,0.00037198572],"domain_scores_gemma":[0.9971053,0.00074408646,0.0002455306,0.0016005911,0.00013610923,0.00016836642],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00047813336,0.00030643816,0.00029855044,0.00005898055,0.0006303172,0.0014202246,0.0014399578,0.00018014498,0.00001682395],"category_scores_gemma":[0.000029286837,0.00018666765,0.000097921176,0.0002856792,0.0009826605,0.00021390304,0.0020133737,0.0005802461,0.000020471842],"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.0000041119547,0.000041682793,0.000024120232,0.000075762,0.00003577698,0.0000016480394,0.0005312338,0.00018208507,0.0000031422894,0.9189919,0.00014530229,0.079963215],"study_design_scores_gemma":[0.00021102496,0.00006156758,0.0007199717,0.00015991983,0.000048669997,0.00006651458,0.0007878343,0.32258785,0.00004232806,0.66215664,0.012699413,0.00045828286],"about_ca_topic_score_codex":0.000007629549,"about_ca_topic_score_gemma":0.00001784775,"teacher_disagreement_score":0.8862077,"about_ca_system_score_codex":0.00002764282,"about_ca_system_score_gemma":0.00023436542,"threshold_uncertainty_score":0.9996164},"labels":[],"label_agreement":null}]}