{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":14,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":14,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"9c80b3aca78d","filters":{"venue":"RAIRO - Theoretical Informatics and Applications"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Christoffel symbols; Mathematics; Computer science; Arithmetic; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.005503843000699254,"gpt":0.2344277857572929,"spread":0.2289239427565936,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002057018,0.0001152355,0.0001153177,0.00005801428,0.000183738,0.0001698735,0.0004336373,0.00005782914,0.00005343955],"category_scores_gemma":[0.00002037483,0.00009010233,0.00003889416,0.0001634134,0.0002565012,0.0002642513,0.0001475431,0.0001280847,0.0002950218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001700887,"about_ca_system_score_gemma":0.0000168178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.285293e-7,"about_ca_topic_score_gemma":1.527775e-7,"domain_scores_codex":[0.9992388,0.00001464077,0.0002744691,0.0001206216,0.000154842,0.0001966281],"domain_scores_gemma":[0.9990338,0.0002795826,0.00006466123,0.00046394,0.00002812789,0.0001298648],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001178944,0.00004529587,0.000002071089,0.000008115573,0.000003789432,9.159692e-8,0.0001923646,0.00004843458,0.00001860314,0.914645,0.0008548173,0.08418024],"study_design_scores_gemma":[0.0001965093,0.00004576679,0.00005315882,0.00001297404,0.000005668462,0.00001331621,0.00007989478,0.3142241,0.0003712373,0.6091459,0.07568579,0.0001657413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006741637,0.00005891765,0.9391026,0.002092737,0.0000225605,0.0002174894,0.000008072863,0.0001991219,0.05155685],"genre_scores_gemma":[0.9373593,0.00005770521,0.05960417,0.002682503,0.00009500223,0.0001009512,0.000007063475,0.000007072133,0.00008624723],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9306176,"threshold_uncertainty_score":0.3792007,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01167135948446676,"gpt":0.2300102654376719,"spread":0.2183389059532051,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001595867,0.00009953547,0.0001954527,0.00007619703,0.0001072151,0.00002137714,0.0003952727,0.00005431771,0.00003295302],"category_scores_gemma":[0.00002393626,0.00007727805,0.00005813694,0.0002825125,0.0008224287,0.0001908011,0.0001793636,0.00008290591,0.000006582413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005171207,"about_ca_system_score_gemma":0.00003275542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002552346,"about_ca_topic_score_gemma":1.079089e-7,"domain_scores_codex":[0.9991572,0.00001540032,0.0004444275,0.000079556,0.0001658083,0.0001375851],"domain_scores_gemma":[0.9990806,0.000199943,0.0001580387,0.0004107261,0.00006247734,0.00008823881],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001529915,0.00004532684,0.0003917884,0.00003530414,0.000008332619,8.693307e-8,0.002465325,0.00001746481,0.000128052,0.9907274,0.00002340773,0.006155956],"study_design_scores_gemma":[0.001148038,0.0003665215,0.01466969,0.000129936,0.00005423957,0.0000984431,0.003650255,0.3212796,0.01406037,0.6289079,0.01483407,0.0008009843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.295137,0.00005740681,0.6957011,0.00008084098,0.00001637414,0.0001583111,0.00002254648,0.00004628684,0.00878014],"genre_scores_gemma":[0.9758405,0.0000716287,0.02396619,0.00006181607,0.00001213709,0.00001887048,0.00000589021,0.000004299946,0.0000186358],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6807035,"threshold_uncertainty_score":0.3151307,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01141413856529665,"gpt":0.2635890888508414,"spread":0.2521749502855447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006767252,0.0001766437,0.0002084717,0.00009434211,0.0002514002,0.000198393,0.0006620222,0.00009463102,0.00002660365],"category_scores_gemma":[0.0001648017,0.0001094234,0.0000822128,0.0002493042,0.0003002246,0.0004265137,0.0002615832,0.00007030594,0.00009483223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002629438,"about_ca_system_score_gemma":0.00003496676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.371708e-7,"about_ca_topic_score_gemma":2.255475e-7,"domain_scores_codex":[0.9985555,0.00002133533,0.0006395025,0.0002322983,0.0002212735,0.0003300656],"domain_scores_gemma":[0.9970206,0.00178957,0.0001580681,0.0007574728,0.00008248879,0.0001917992],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004569472,0.00002204284,0.000001187202,0.00001223821,0.000004999953,8.960391e-8,0.0001282861,0.00000172173,0.00004229911,0.5773824,0.0006189002,0.4217812],"study_design_scores_gemma":[0.0008703587,0.00006897529,0.00009326598,0.00007820855,0.00001094786,0.00001460903,0.00007076772,0.2673951,0.0003524319,0.701748,0.02909472,0.0002025607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003327321,0.0000485928,0.9909751,0.002173997,0.00007014931,0.0006410899,0.0001014624,0.0002328522,0.002429477],"genre_scores_gemma":[0.4895383,0.0001388778,0.5080965,0.001157945,0.0001412426,0.000688726,0.00002748346,0.00002282515,0.0001881821],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4862109,"threshold_uncertainty_score":0.4462157,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Conjecture; Combinatorics; Mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01474600185359274,"gpt":0.2931907409636114,"spread":0.2784447391100187,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004354501,0.000177138,0.0002435632,0.00006187325,0.0002335706,0.00007008357,0.0001942364,0.0001490699,0.000123009],"category_scores_gemma":[0.000156303,0.0001416264,0.00009274387,0.0001748325,0.0003297975,0.0001072616,0.00003885799,0.0001594898,0.00003275519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001374552,"about_ca_system_score_gemma":0.00001957516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.440239e-7,"about_ca_topic_score_gemma":1.132155e-7,"domain_scores_codex":[0.9990096,0.00001821585,0.0004342635,0.0001210876,0.0001363854,0.0002804644],"domain_scores_gemma":[0.9985258,0.0007702648,0.000118694,0.0003565804,0.00006548809,0.0001631846],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001480776,0.0000772171,0.00000522134,0.0000710395,0.00001668773,1.15713e-7,0.0003641706,0.00000269419,0.00002375936,0.9859761,0.001832697,0.01161547],"study_design_scores_gemma":[0.0004251843,0.0001051681,0.00002453831,0.00001620619,0.00005900661,0.00001936609,0.0003665711,0.001854734,0.0004373805,0.9689626,0.02754007,0.00018924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03012658,0.00007677156,0.9241015,0.001900447,0.00004605505,0.001298721,0.00007855,0.0001819297,0.04218946],"genre_scores_gemma":[0.9421955,0.00003469025,0.05554452,0.001440895,0.0001687103,0.0001660951,0.00004340194,0.00001743424,0.0003887697],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9120689,"threshold_uncertainty_score":0.5775359,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007382309847206504,"gpt":0.2297986927931896,"spread":0.2224163829459831,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001515505,0.0001784015,0.0002086755,0.0001078081,0.00008971529,0.00005362971,0.0001113037,0.0001533975,0.00001510348],"category_scores_gemma":[0.0001577248,0.0001578694,0.00002676991,0.0002314525,0.000491961,0.0001269389,0.00005199999,0.0003452705,0.00001779079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004058811,"about_ca_system_score_gemma":0.000007578833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.29222e-7,"about_ca_topic_score_gemma":0.000001707345,"domain_scores_codex":[0.9990541,0.000009676395,0.0003760395,0.0001242964,0.0001191159,0.0003167713],"domain_scores_gemma":[0.9991019,0.0004543682,0.00002224115,0.0002643612,0.00002395326,0.0001331757],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002596997,0.0000296742,0.00006579531,0.00003565491,0.00001154173,3.229326e-7,0.0001271717,0.006058058,0.0000344007,0.9724552,0.00001920426,0.02116038],"study_design_scores_gemma":[0.0003646819,0.00003781609,0.0003206933,0.00003497339,0.00001858556,0.00001139287,0.0008745515,0.4635873,0.0001864024,0.5306337,0.003659093,0.000270829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2771773,0.0001554897,0.6781495,0.0003912655,0.00002891505,0.0007587404,0.00001836825,0.0004600784,0.04286029],"genre_scores_gemma":[0.9526414,0.0004274729,0.04655165,0.0001186649,0.00001197188,0.0002148982,0.00000892857,0.00001926859,0.000005727864],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6754641,"threshold_uncertainty_score":0.6437727,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009138817957750053,"gpt":0.25539041598199,"spread":0.2462515980242399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002886549,0.0001527841,0.0001912154,0.00006150633,0.000182777,0.0002178949,0.0005183911,0.00008862388,0.00006662506],"category_scores_gemma":[0.00006196982,0.0001214054,0.00008580928,0.0001533152,0.0002854285,0.000371306,0.0002012332,0.0001093818,0.0001117482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001533265,"about_ca_system_score_gemma":0.00002314243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.043601e-7,"about_ca_topic_score_gemma":3.518946e-8,"domain_scores_codex":[0.9989536,0.00001818341,0.0003580365,0.0001837876,0.0001838377,0.0003025059],"domain_scores_gemma":[0.9984737,0.0006377597,0.00006194622,0.000577433,0.00006755075,0.0001816105],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001809739,0.00004753809,0.00008436225,0.00007063817,0.000008508353,8.925631e-8,0.0004054576,0.000008149642,0.000155326,0.9949235,0.00009568286,0.004198944],"study_design_scores_gemma":[0.0003526149,0.00007265549,0.0003211793,0.00002300963,0.00001756661,0.00001002229,0.0004888814,0.2885023,0.0006664754,0.6941077,0.01516597,0.0002716942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05227844,0.00004132583,0.941846,0.0004948546,0.00008228738,0.0006434491,0.00003374358,0.0001414325,0.004438503],"genre_scores_gemma":[0.9623182,0.00001268471,0.03682488,0.0005359385,0.00004147187,0.0001865395,0.00002467999,0.00001107413,0.00004449169],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9100398,"threshold_uncertainty_score":0.495077,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.00819716597446658,"gpt":0.2613758560435292,"spread":0.2531786900690626,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000811665,0.0001366171,0.0001941979,0.000176764,0.00009467168,0.00005487303,0.0004634895,0.00009117636,0.00003345492],"category_scores_gemma":[0.00009036215,0.0001145337,0.00004883583,0.000359567,0.0004815907,0.0002602345,0.0002151544,0.0001755337,0.00004374582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002253358,"about_ca_system_score_gemma":0.0000186631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001816643,"about_ca_topic_score_gemma":3.738097e-7,"domain_scores_codex":[0.9987093,0.00002129814,0.0005813529,0.0001439226,0.0002392478,0.0003048456],"domain_scores_gemma":[0.9983678,0.0008642768,0.00008390393,0.0004787302,0.00004619371,0.000159087],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001077529,0.0001548723,0.0000319045,0.00003271511,0.000003443486,0.000001715444,0.0003987161,0.00001716084,0.0001875608,0.9880646,0.00004905918,0.01104741],"study_design_scores_gemma":[0.0003818259,0.00011728,0.000816051,0.00006229142,0.000005503086,0.00001520609,0.0002492251,0.09917749,0.001566435,0.8969374,0.0004904338,0.000180911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0857165,0.00003290912,0.903037,0.0006255218,0.00004325932,0.0002878643,0.00001301022,0.00007001616,0.01017389],"genre_scores_gemma":[0.9381771,0.00001876976,0.06100664,0.0007178801,0.00001929014,0.00003745906,0.000007745443,0.000006967548,0.000008125782],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8524606,"threshold_uncertainty_score":0.467055,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.00508258092233842,"gpt":0.2308513156088359,"spread":0.2257687346864974,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003569546,0.0001301772,0.0001351189,0.00007190849,0.0003321316,0.0002374493,0.0004016049,0.00009573998,0.00008136877],"category_scores_gemma":[0.00003888257,0.0001093623,0.00004634695,0.0001980921,0.0003641344,0.0003844441,0.0003272608,0.000217956,0.00008136032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001541237,"about_ca_system_score_gemma":0.00002346444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001434203,"about_ca_topic_score_gemma":0.000001367609,"domain_scores_codex":[0.9991006,0.00001728942,0.0003509004,0.0001345539,0.0001665232,0.0002301423],"domain_scores_gemma":[0.9988836,0.0003031889,0.0001023332,0.0004875322,0.00006738016,0.0001559562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003552323,0.0000226459,0.00003798875,0.00001321513,0.000005839801,3.089297e-7,0.0006709087,0.000005943693,0.0008310939,0.9757504,0.0001413932,0.02251673],"study_design_scores_gemma":[0.0004236054,0.00009162227,0.000796098,0.00002784395,0.00001917995,0.00009840631,0.0003969624,0.282263,0.001344416,0.6732814,0.04088083,0.0003766487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1654361,0.00003528531,0.8104636,0.001368901,0.00009265057,0.0003338776,0.00002010504,0.0002613601,0.02198808],"genre_scores_gemma":[0.9588639,0.00001896901,0.03964918,0.001220798,0.00007378865,0.0001056353,0.00002092392,0.000007438901,0.0000393337],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7934278,"threshold_uncertainty_score":0.4459667,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Arithmetic; Discrete mathematics; Algebra over a field; Combinatorics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03686374755198837,"gpt":0.2659644655075115,"spread":0.2291007179555231,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004600338,0.0001227375,0.0001441165,0.00008283849,0.0001018993,0.0001335475,0.0003093066,0.0000845703,0.00004902946],"category_scores_gemma":[0.00001653521,0.0001025242,0.00002839825,0.000177948,0.0001436589,0.0004328425,0.000128537,0.0001363653,0.000117075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001864079,"about_ca_system_score_gemma":0.00002434094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001800117,"about_ca_topic_score_gemma":0.000001480047,"domain_scores_codex":[0.9990158,0.00002313411,0.0004530936,0.0001473179,0.0001389486,0.0002217039],"domain_scores_gemma":[0.9992598,0.0001248825,0.0001031144,0.0003438388,0.00004948189,0.0001189089],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000237882,0.0001063515,0.00003876169,0.00002637948,0.000006713231,7.438997e-7,0.0008918543,0.00009673366,0.00008141463,0.9901055,0.00009132668,0.008551834],"study_design_scores_gemma":[0.0003404655,0.00002724041,0.001134959,0.00003523066,0.000006645372,0.00002676187,0.000205387,0.8885929,0.000213766,0.1076688,0.001549501,0.0001983733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03706481,0.000138447,0.9481109,0.0001901768,0.0001015146,0.0007345525,0.00002300148,0.0001865185,0.01345012],"genre_scores_gemma":[0.8879453,0.00002866142,0.1114109,0.0003753147,0.00001842961,0.0001589696,0.0000259056,0.000007541525,0.00002896037],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8884962,"threshold_uncertainty_score":0.4180814,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01452046165482812,"gpt":0.2547233798938259,"spread":0.2402029182389978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005699096,0.0001111301,0.0002788425,0.00005323474,0.0001453683,0.0001002919,0.0002125671,0.00004851089,0.00001473874],"category_scores_gemma":[0.00002137499,0.00007381014,0.00003232342,0.0001371036,0.001503994,0.0002313776,0.00004556613,0.00005626347,0.000004378115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004842009,"about_ca_system_score_gemma":0.00002431783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002239269,"about_ca_topic_score_gemma":7.198496e-7,"domain_scores_codex":[0.999199,0.00005041993,0.0003613768,0.0001153531,0.0001376178,0.0001362424],"domain_scores_gemma":[0.9990964,0.0002955689,0.0001228763,0.0003111722,0.00008436931,0.00008963413],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002117805,0.000024037,0.000003596144,0.00002447313,0.00002542343,5.989624e-8,0.0008816255,0.00001115272,0.0002626939,0.9886453,0.00003874793,0.009871136],"study_design_scores_gemma":[0.01652701,0.0001000058,0.00002499721,0.00001918284,0.00004731053,0.00001707493,0.0001354681,0.9061252,0.001319589,0.07513468,0.0004217486,0.0001277449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0452616,0.00004490457,0.9504731,0.0006006451,0.00001331764,0.0005281102,0.00001797285,0.0000712266,0.00298907],"genre_scores_gemma":[0.9468452,0.00003956353,0.05258541,0.0003563071,0.00004098896,0.0001120405,0.00000762574,0.000005099445,0.000007771197],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9135106,"threshold_uncertainty_score":0.5541527,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01511514287224976,"gpt":0.2738776022512248,"spread":0.258762459378975,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005077957,0.0001138024,0.0001411986,0.0000394921,0.0006555732,0.0006342535,0.0005095802,0.00007008232,0.00001794921],"category_scores_gemma":[0.00007373425,0.0000924456,0.00003034543,0.0000486067,0.0005324474,0.0006951765,0.0005164509,0.0001509533,0.00001216569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001127906,"about_ca_system_score_gemma":0.00001509684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005278232,"about_ca_topic_score_gemma":0.000001105095,"domain_scores_codex":[0.9992644,0.00002236705,0.0002651192,0.0001615602,0.0001139057,0.0001726337],"domain_scores_gemma":[0.9987863,0.0001027015,0.0001451547,0.000771531,0.00003460256,0.0001596562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001680112,0.00001793858,0.00007412027,0.00002982114,0.000004688283,1.215031e-7,0.0005684579,6.439007e-7,0.00004892625,0.8159099,0.00003368057,0.1833101],"study_design_scores_gemma":[0.0003226633,0.0000460847,0.005383366,0.00004361718,0.0000134772,0.00003862701,0.0002702835,0.1598558,0.0003811594,0.8274904,0.005930897,0.0002235673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1187685,0.00009938651,0.8705052,0.001664139,0.00006833515,0.0003086741,0.000009926825,0.0001190713,0.0084567],"genre_scores_gemma":[0.9767455,0.0000805023,0.02268353,0.000318283,0.00007771022,0.00005563242,0.000004448881,0.000005132453,0.00002921837],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.857977,"threshold_uncertainty_score":0.6116121,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Characterization (materials science); Variable (mathematics); Class (philosophy); Relation (database); Term (time)","retraction":null,"screen_n_in":null,"score":{"opus":0.01926367236373752,"gpt":0.3021301551937171,"spread":0.2828664828299796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004528846,0.0001186021,0.000218831,0.00002617327,0.0003706313,0.00005920047,0.0002576055,0.00007652013,0.0001006812],"category_scores_gemma":[0.0002389415,0.00007911083,0.00004023188,0.00003531755,0.001230091,0.0001139258,0.00008560187,0.000148308,0.00001884029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001260517,"about_ca_system_score_gemma":0.00002766947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000015355,"about_ca_topic_score_gemma":0.000001381257,"domain_scores_codex":[0.9992431,0.00001891911,0.0003355585,0.00008868812,0.0001648297,0.000148894],"domain_scores_gemma":[0.9983602,0.0004627481,0.0002060057,0.0007834792,0.00008146077,0.0001061072],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004131088,0.00009144486,0.0001045432,0.0001010393,0.00001642207,1.833446e-7,0.0003481113,0.000002535071,0.00001622034,0.9972931,0.00012116,0.001863965],"study_design_scores_gemma":[0.0004845511,0.0001443107,0.0002236574,0.00004933342,0.00004018192,0.00000581779,0.0003284341,0.001840527,0.0007632909,0.9950044,0.0009878384,0.0001276546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6720585,0.000007424136,0.1822299,0.000510535,0.00001905943,0.001035337,0.00009028955,0.00006003008,0.1439889],"genre_scores_gemma":[0.9861093,0.00000842479,0.01356931,0.0001144928,0.00002250792,0.00008201219,0.000004164962,0.00001071336,0.00007911988],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3140508,"threshold_uncertainty_score":0.4532322,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008547743220322503,"gpt":0.2370078059017377,"spread":0.2284600626814152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004781334,0.0003064382,0.0002985504,0.00005898055,0.0006303172,0.001420225,0.001439958,0.000180145,0.00001682395],"category_scores_gemma":[0.00002928684,0.0001866676,0.00009792118,0.0002856792,0.0009826605,0.000213903,0.002013374,0.0005802461,0.00002047184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002764282,"about_ca_system_score_gemma":0.0002343654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007629549,"about_ca_topic_score_gemma":0.00001784775,"domain_scores_codex":[0.9983901,0.00004838279,0.0005473191,0.0003031096,0.0003391445,0.0003719857],"domain_scores_gemma":[0.9971053,0.0007440865,0.0002455306,0.001600591,0.0001361092,0.0001683664],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004111955,0.00004168279,0.00002412023,0.000075762,0.00003577698,0.000001648039,0.0005312338,0.0001820851,0.000003142289,0.9189919,0.0001453023,0.07996321],"study_design_scores_gemma":[0.000211025,0.00006156758,0.0007199717,0.0001599198,0.00004867,0.00006651458,0.0007878343,0.3225878,0.00004232806,0.6621566,0.01269941,0.0004582829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02276922,0.0005949028,0.9675848,0.002435999,0.00007595778,0.0007530902,0.00003687448,0.0002310594,0.005518126],"genre_scores_gemma":[0.9089769,0.0006466893,0.08836016,0.0009412546,0.0001613247,0.0006991372,0.0001226179,0.0000322126,0.00005966623],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8862077,"threshold_uncertainty_score":0.9996164,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Repetition (rhetorical device); Physics; Combinatorics; Infimum and supremum; Mathematics; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.01001163818495734,"gpt":0.2504297073528558,"spread":0.2404180691678985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007326535,0.0002889786,0.0002851924,0.00005110396,0.000600056,0.0009004024,0.001392587,0.0002357054,0.00003294247],"category_scores_gemma":[0.00004869058,0.0002068182,0.0001550943,0.0002148105,0.0004760894,0.000209659,0.002158558,0.0006489718,0.00008333729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004708918,"about_ca_system_score_gemma":0.00007550171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001780913,"about_ca_topic_score_gemma":6.481765e-7,"domain_scores_codex":[0.9981804,0.00004970893,0.0006579367,0.000340652,0.0003816263,0.0003896397],"domain_scores_gemma":[0.9976885,0.0003304029,0.0002779779,0.001395917,0.00008020137,0.0002270497],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002059577,0.00003496918,0.000007556832,0.00008854569,0.00003217834,4.916894e-7,0.000309896,0.0000279501,0.00001707017,0.9885226,0.00104897,0.009907736],"study_design_scores_gemma":[0.000130018,0.0000140557,0.00006690225,0.00004312447,0.00002258894,0.000007104792,0.0001475611,0.3483801,0.00004440119,0.6111028,0.03983768,0.0002037553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00121554,0.0004912099,0.9715438,0.004161172,0.0001414208,0.0008364465,0.00009421477,0.0003088177,0.02120732],"genre_scores_gemma":[0.9782671,0.001159246,0.01601685,0.003075158,0.0003491344,0.0008443726,0.0001888021,0.00003622194,0.00006308638],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9770516,"threshold_uncertainty_score":0.8682601,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}