{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":29,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":29,"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":"6f385c39db7e","filters":{"venue":"Acta Informatica"}},"results":[{"id":"W2025553490","doi":"10.1007/s00236-003-0118-7","title":"Sticky-free and overhang-free DNA languages","year":2003,"lang":"en","type":"article","venue":"Acta Informatica","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"DNA computing; Theory of computation; Computer science; Computation; DNA; Theoretical computer science; Set (abstract data type); Algorithm; Programming language; Genetics; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.006728166659572096,"gpt":0.2258984392369812,"spread":0.2191702725774091,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001513986,0.0001079653,0.0000999534,0.00001834396,0.00006750847,0.00003824859,0.0002386092,0.0001027191,0.00004337633],"category_scores_gemma":[0.0009195181,0.00007965577,0.00003552805,0.00004292066,0.00006051354,0.000007320071,0.0002629881,0.00006387734,0.00001127716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003735244,"about_ca_system_score_gemma":0.00001675885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002615863,"about_ca_topic_score_gemma":0.000003515768,"domain_scores_codex":[0.9994167,0.00002415635,0.0001632872,0.0001117478,0.00007792685,0.0002061762],"domain_scores_gemma":[0.9994231,0.00002845526,0.00005159167,0.0003996972,0.00002515558,0.00007196227],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002092716,0.0003009429,0.01654859,0.0004788756,0.0003888628,0.00003149986,0.001332939,0.00001452859,0.7261154,0.03596305,0.1688535,0.04976255],"study_design_scores_gemma":[0.003252263,0.001344404,0.01568864,0.00006740274,0.00006468262,0.000199709,0.001660466,0.0002864289,0.2134247,0.004610469,0.7583234,0.001077509],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9171472,0.0002361092,0.0003170804,0.0001880214,0.00005550247,0.00009697217,0.00001308376,0.00002235703,0.08192363],"genre_scores_gemma":[0.9958327,0.000051764,0.002753534,0.0009317757,0.00005948732,0.000003832521,0.00002691802,0.000005615203,0.0003343622],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5894699,"threshold_uncertainty_score":0.3248268,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984007424","doi":"10.1007/pl00013319","title":"Even faster generalized LR parsing","year":2001,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Parsing; LR parser; Parsing expression grammar; Computer science; Property (philosophy); Top-down parsing; Parser combinator; Constant (computer programming); Grammar; Theory of computation; Rule-based machine translation; Symbol (formal); Algorithm; Artificial intelligence; Natural language processing; Programming language; Context-free grammar; L-attributed grammar","retraction":null,"screen_n_in":null,"score":{"opus":0.0139724967697632,"gpt":0.2294504689361343,"spread":0.2154779721663711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002359439,0.0001143568,0.0001407213,0.00007569585,0.0001083079,0.0002471168,0.0007308706,0.00004642492,0.0001358577],"category_scores_gemma":[0.00002908662,0.00009240111,0.00005551336,0.0002221417,0.00002668232,0.001686825,0.000229793,0.00008611847,0.0004554535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002265305,"about_ca_system_score_gemma":0.00002657963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000723215,"about_ca_topic_score_gemma":7.434633e-7,"domain_scores_codex":[0.9990576,0.00002640024,0.0002885309,0.0001098339,0.0002099727,0.0003076845],"domain_scores_gemma":[0.9991853,0.00006440959,0.00008615831,0.0005465903,0.00002811482,0.00008942796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003790629,0.0001680868,0.00109629,0.0001048618,0.0001158587,0.0000752243,0.01990519,0.0001327368,0.003724138,0.278916,0.0523417,0.643382],"study_design_scores_gemma":[0.001309546,0.00011297,0.003368207,0.0001092657,0.0000159538,0.0003921799,0.0003295171,0.5096484,0.002091364,0.02270836,0.4592009,0.0007132968],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.559592,0.00007132386,0.3298467,0.003860339,0.0006257072,0.0002600799,0.000002394183,0.0006537932,0.1050876],"genre_scores_gemma":[0.9622141,0.00002177434,0.03367914,0.003476924,0.0000640521,0.000009047437,0.000004466293,0.000006879849,0.0005236041],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6426687,"threshold_uncertainty_score":0.5854085,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093939144","doi":"10.1007/s00236-007-0056-x","title":"Solving #SAT using vertex covers","year":2007,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Bounded function; Mathematics; Combinatorics; Discrete mathematics; Cluster analysis; Vertex (graph theory); Time complexity; Graph; Pathwidth; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.0258547673811828,"gpt":0.3054329410701412,"spread":0.2795781736889584,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008646733,0.0001107125,0.0001206321,0.0002089049,0.0002028554,0.0001606748,0.0009356678,0.00005088808,0.00003366382],"category_scores_gemma":[0.0002980168,0.0001016517,0.0000522069,0.0005267265,0.00008132228,0.002640533,0.0004192069,0.0001941263,0.0002044694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000946322,"about_ca_system_score_gemma":0.00007007971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005305632,"about_ca_topic_score_gemma":0.000001948988,"domain_scores_codex":[0.9985926,0.00001868331,0.0002975571,0.00012429,0.0004195947,0.0005473287],"domain_scores_gemma":[0.9986932,0.0004203648,0.0000853987,0.0005682791,0.00007596191,0.0001567985],"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.0001499944,0.0001264146,0.001826622,0.0001921269,0.0001299481,0.0001128462,0.01577614,0.001293023,0.02390253,0.7348701,0.002733651,0.2188866],"study_design_scores_gemma":[0.001494881,0.0003297832,0.002791373,0.0001696976,0.00001491858,0.0002490214,0.001458161,0.857229,0.01997811,0.06829675,0.04692291,0.001065396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1044266,0.00001654641,0.8634289,0.0001231954,0.0002271228,0.0001503091,9.277121e-7,0.0001552744,0.0314711],"genre_scores_gemma":[0.9121026,0.000004582374,0.08733039,0.0004783952,0.00001672202,0.000001293515,0.000001243139,0.000006665294,0.00005805234],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.855936,"threshold_uncertainty_score":0.4145235,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065795466","doi":"10.1007/s002360000044","title":"Analysis of range search for random k-d trees","year":2001,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Hypercube; Combinatorics; Mathematics; Range (aeronautics); Binary search tree; Nearest neighbor search; Range tree; Conjecture; Theory of computation; Search tree; Regular polygon; Tree (set theory); Probabilistic logic; k-nearest neighbors algorithm; Discrete mathematics; Search algorithm; Algorithm; Computer science; Interval tree; Binary tree; Statistics; Data mining; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02391396967433926,"gpt":0.2798554499238107,"spread":0.2559414802494714,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003743357,0.00005622856,0.000168353,0.0003923209,0.00006374319,0.00005697194,0.0003001786,0.00002494986,0.00003607429],"category_scores_gemma":[0.00005609803,0.00004792557,0.000123518,0.001254849,0.0000155145,0.0005981223,0.00005209048,0.00002877425,0.000008541562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001044823,"about_ca_system_score_gemma":0.00003869987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006398639,"about_ca_topic_score_gemma":0.000007619487,"domain_scores_codex":[0.9992957,0.00001763387,0.0002754395,0.00007444091,0.0002125,0.0001242824],"domain_scores_gemma":[0.9992024,0.000317124,0.00007191489,0.0002187884,0.0001479274,0.00004189156],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005125296,0.0003963622,0.009913599,0.0002141176,0.002749619,0.000002543338,0.01743171,0.1826733,0.001827649,0.1510584,0.008654566,0.6245655],"study_design_scores_gemma":[0.0008577061,0.00006281076,0.008137691,0.000004080449,0.00008682165,0.000001470657,0.00004028732,0.980004,0.0009935846,0.0002819952,0.009453805,0.00007575035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1264734,0.00001645426,0.8692681,0.0005028269,0.00005550277,0.00016762,0.000005626689,0.00002728531,0.003483167],"genre_scores_gemma":[0.9779598,0.00001573398,0.02160116,0.0001898007,0.00002678431,0.00001704773,0.00003269213,0.000001543552,0.000155425],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8514864,"threshold_uncertainty_score":0.1954348,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071685823","doi":"10.1007/s002360000037","title":"Efficiently building a parse tree from a regular expression","year":2000,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Parse tree; Parsing; Computer science; String (physics); Theory of computation; Tree (set theory); Regular expression; Representation (politics); Time complexity; Parsing expression grammar; Rule-based machine translation; Context (archaeology); Theoretical computer science; S-attributed grammar; Algorithm; Artificial intelligence; Context-free grammar; L-attributed grammar; Mathematics; Programming language; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.005874499761680074,"gpt":0.2030990138928541,"spread":0.197224514131174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002221318,0.0001450048,0.0001677138,0.00007011356,0.0001450876,0.0002573608,0.001046447,0.00006607582,0.0004719384],"category_scores_gemma":[0.00003556237,0.0001152194,0.00006996842,0.0002359754,0.00003714444,0.00138974,0.000200598,0.0001142085,0.0004815801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002286132,"about_ca_system_score_gemma":0.0000259382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001443778,"about_ca_topic_score_gemma":4.696008e-7,"domain_scores_codex":[0.9988283,0.00003486835,0.0003342646,0.0001830996,0.0003090244,0.0003104743],"domain_scores_gemma":[0.998804,0.0001407363,0.00008661456,0.0008357471,0.00001828989,0.0001146558],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003801852,0.0001649995,0.00005138201,0.00003559939,0.00003530694,0.0000296161,0.01280311,0.000253675,0.02544765,0.02201578,0.01584723,0.9232776],"study_design_scores_gemma":[0.0014761,0.0001444327,0.001967787,0.0004517284,0.00002040291,0.00004784707,0.0003342541,0.7297812,0.06331852,0.02239158,0.1792775,0.0007886083],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.916049,0.00005976435,0.06382956,0.0004145597,0.000143947,0.000152709,0.000006173874,0.0004152546,0.01892904],"genre_scores_gemma":[0.9343826,0.00001288764,0.06448846,0.0008451972,0.0000467446,0.00001325126,0.000007370376,0.000007326315,0.0001961483],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.922489,"threshold_uncertainty_score":0.6189898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043947609","doi":"10.1007/s00236-008-0071-6","title":"Relational structures model of concurrency","year":2008,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Concurrency; Computer science; Theory of computation; Programming language; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.06551122478231355,"gpt":0.2522191826321599,"spread":0.1867079578498463,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001327849,0.00008439676,0.0001420603,0.0001046308,0.00008742216,0.00001629602,0.0006184658,0.00005168713,0.0000134029],"category_scores_gemma":[0.00009088957,0.00007277526,0.00004426195,0.000196469,0.00005414478,0.001182776,0.0001686518,0.00009627275,0.00002285937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000221063,"about_ca_system_score_gemma":0.0001553217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002795493,"about_ca_topic_score_gemma":1.616932e-7,"domain_scores_codex":[0.9989066,0.00001249147,0.0004567839,0.00008530917,0.000389368,0.0001494479],"domain_scores_gemma":[0.9991597,0.00008399499,0.0001855559,0.0004089409,0.0001103759,0.00005142127],"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.000005116751,0.00002632497,0.0005761405,0.00009839008,0.00003276163,0.000002008959,0.0122087,0.06681771,0.0005878377,0.9103592,0.005171018,0.004114768],"study_design_scores_gemma":[0.0001529014,0.00001356214,0.0002323071,0.00001453455,0.000001604089,0.00003901187,0.00001038691,0.993237,0.0004222602,0.005312474,0.0004788231,0.00008520351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07891888,0.00003905908,0.8955398,0.0001041123,0.0001645195,0.0000909731,0.000008553453,0.00007974444,0.02505433],"genre_scores_gemma":[0.8561803,0.00001032453,0.1436451,0.00009105416,0.0000132301,0.000003167696,0.000002791311,0.000002511155,0.00005149853],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9264192,"threshold_uncertainty_score":0.2967689,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966644481","doi":"10.1007/s00236-007-0041-4","title":"The syntactic monoid of hairpin-free languages","year":2007,"lang":"en","type":"article","venue":"Acta Informatica","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"DNA computing; String (physics); Formal language; Computer science; Rewriting; DNA; Free monoid; Alphabet; Context (archaeology); Characterization (materials science); Mathematics; Discrete mathematics; Monoid; Physics; Algorithm; Biology; Genetics; Programming language; Linguistics; Theoretical physics","retraction":null,"screen_n_in":null,"score":{"opus":0.005987572387986165,"gpt":0.2497809497333986,"spread":0.2437933773454125,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003902153,0.0000702813,0.00007410707,0.00001332298,0.000087312,0.00002201476,0.0003312432,0.0000711143,0.000006499844],"category_scores_gemma":[0.0004885424,0.00004014104,0.00005356673,0.00004912591,0.00007444649,0.00000540809,0.0001930024,0.00006229796,0.000008036785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003888457,"about_ca_system_score_gemma":0.00001445548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004649991,"about_ca_topic_score_gemma":0.000009550708,"domain_scores_codex":[0.9994165,0.00001257432,0.0002365465,0.00005990452,0.00008340685,0.0001910388],"domain_scores_gemma":[0.9994063,0.00008686449,0.0001016082,0.0003274016,0.00003959714,0.00003823362],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004209355,0.000135932,0.006778725,0.0001656027,0.0002500089,0.000007329499,0.00061693,0.00001556131,0.8210523,0.007914195,0.01468362,0.1479589],"study_design_scores_gemma":[0.0008202824,0.0009348248,0.02954059,0.00004331961,0.00003262576,0.00004669889,0.003225516,0.0002863227,0.6382055,0.0005826581,0.3258724,0.0004092463],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9512791,0.0002044233,0.0008404809,0.0002501838,0.00006806241,0.00008897275,0.000002802419,0.0000123536,0.04725361],"genre_scores_gemma":[0.9986999,0.00004179183,0.0007821446,0.0002417375,0.00007027303,0.000001429682,0.00001133006,0.000003376809,0.0001480046],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3111888,"threshold_uncertainty_score":0.1636904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045395233","doi":"10.1007/s00236-008-0086-z","title":"A queue based mutual exclusion algorithm","year":2008,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Mutual exclusion; Theory of computation; Computer science; Concurrency; Algorithm; Critical section; Conjecture; Semaphore; Automaton; Atomicity; Queue; Theoretical computer science; Mathematics; Discrete mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01278905392554578,"gpt":0.2150766795726819,"spread":0.2022876256471361,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001814564,0.000131742,0.0001730787,0.00007477695,0.0002391997,0.00009645836,0.0007345034,0.00006948506,0.00003551897],"category_scores_gemma":[0.00004017782,0.000109482,0.00006576069,0.0003384534,0.00004571174,0.001202354,0.0001698087,0.0001212584,0.0004540283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003722595,"about_ca_system_score_gemma":0.0001287695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000238038,"about_ca_topic_score_gemma":0.0000010778,"domain_scores_codex":[0.9987997,0.00002373927,0.0003695132,0.0001380661,0.0003777142,0.0002912475],"domain_scores_gemma":[0.9990527,0.00005830696,0.0001140862,0.0005625848,0.00008522412,0.0001271024],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003248532,0.0005802315,0.0006046292,0.0002915403,0.00008579232,0.0003545743,0.01877241,0.0004946711,0.0005539567,0.03299854,0.3093013,0.6359298],"study_design_scores_gemma":[0.000477378,0.00006435815,0.0009638853,0.00003865435,0.000001675835,0.0001154689,0.00003716432,0.8123742,0.0003146045,0.00007580943,0.1853403,0.0001964698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007774894,0.00002236223,0.9700917,0.0006854715,0.0003235335,0.0001815991,0.00001740124,0.0002546674,0.02064837],"genre_scores_gemma":[0.91415,0.000007484738,0.08415147,0.001279362,0.00005882608,0.00002235736,0.00002102744,0.000005878755,0.0003036069],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9063751,"threshold_uncertainty_score":0.5835767,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112729204","doi":"10.1007/s00236-008-0069-0","title":"Weighted height of random trees","year":2008,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Weight-balanced tree; Combinatorics; Binary search tree; Theory of computation; Extension (predicate logic); Tree (set theory); Set (abstract data type); Random binary tree; Binary logarithm; Discrete mathematics; Ternary search tree; Constant (computer programming); Binary tree; Algorithm; Tree structure; Computer science; Interval tree","retraction":null,"screen_n_in":null,"score":{"opus":0.01295459785249171,"gpt":0.2064052363635437,"spread":0.193450638511052,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001318521,0.00008374704,0.0001548039,0.0001059351,0.00007629194,0.0000452263,0.0008834621,0.00002305521,0.00005868233],"category_scores_gemma":[0.000022768,0.00006331052,0.00005015631,0.0002744292,0.00005378665,0.002073481,0.0002770886,0.00005065349,0.0001400226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005930881,"about_ca_system_score_gemma":0.00002130929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000654346,"about_ca_topic_score_gemma":7.721592e-7,"domain_scores_codex":[0.9991951,0.00001207002,0.0003028599,0.00007841755,0.0002476482,0.0001638887],"domain_scores_gemma":[0.9992496,0.0000607279,0.0001104229,0.00049614,0.00003566494,0.00004744183],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009744929,0.0005008515,0.001508515,0.0003039096,0.0003800756,0.00008173556,0.01454439,0.00002022416,0.0003767944,0.2512127,0.4203132,0.3106602],"study_design_scores_gemma":[0.005458079,0.000261177,0.009328156,0.00007638707,0.00002923909,0.00006900748,0.0001458848,0.371096,0.006222144,0.003048141,0.6036345,0.0006313222],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05508727,0.00008651767,0.6363025,0.002277233,0.0005801659,0.0005414004,0.00001794979,0.0004240253,0.3046829],"genre_scores_gemma":[0.9117178,0.0001285483,0.08661316,0.0004459159,0.00003688478,0.00001003209,0.00002355846,0.000004681769,0.001019454],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8566305,"threshold_uncertainty_score":0.2581728,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012307294","doi":"10.1007/s00236-009-0109-4","title":"Embedding mappings and splittings with applications","year":2009,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Embedding; Equivalence relation; Injective function; Axiom; Algebraic number; Relation algebra; Mathematics; Relation (database); Theory of computation; Equivalence (formal languages); Algebra over a field; Isomorphism (crystallography); Algebraic analysis; Discrete mathematics; Theoretical computer science; Computer science; Pure mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.005333039337177925,"gpt":0.2237554967756333,"spread":0.2184224574384553,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006932207,0.00007907588,0.00008362914,0.00004768594,0.000130342,0.000125917,0.0002836616,0.00002281321,0.000003770239],"category_scores_gemma":[0.00001156518,0.00005828865,0.00001148604,0.0001933077,0.00002863881,0.001148696,0.00006139013,0.00007705178,0.00002658711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009188374,"about_ca_system_score_gemma":0.0000139272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.050934e-7,"about_ca_topic_score_gemma":7.269573e-8,"domain_scores_codex":[0.9994726,0.000003300512,0.0001446079,0.0001021022,0.0001062627,0.0001711933],"domain_scores_gemma":[0.9995353,0.0000384893,0.00007308596,0.0002570015,0.00002753869,0.00006857702],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004092167,0.00003123731,0.000153518,0.00004275204,0.00001052602,0.000002718816,0.003802138,0.00006682728,0.0002940721,0.7291185,0.0004924618,0.2659812],"study_design_scores_gemma":[0.002252361,0.001239111,0.02421338,0.0002798228,0.00004230495,0.0007672638,0.001579426,0.2886449,0.002199281,0.3048902,0.3719674,0.001924527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02251903,0.00002119391,0.9549217,0.002012857,0.000009576347,0.0001949301,3.461855e-7,0.0001922319,0.02012812],"genre_scores_gemma":[0.7935231,0.000007388228,0.2046941,0.001697973,0.00001313379,0.00001387929,0.000001027884,0.000001627631,0.00004780642],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.771004,"threshold_uncertainty_score":0.2376942,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095614028","doi":"10.1007/s00236-011-0146-7","title":"An efficient algorithm for finding ideal schedules","year":2011,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Ideal (ethics); Theory of computation; Schedule; Computer science; Scheduling (production processes); Algorithm; Time complexity; Mathematics; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.0219740094869949,"gpt":0.2399925613728733,"spread":0.2180185518858784,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001676222,0.0001247407,0.000122521,0.0001061276,0.0000934993,0.00005418044,0.0001803395,0.00007620065,0.0001071404],"category_scores_gemma":[0.00003165492,0.000118105,0.00004561905,0.0001164666,0.00002137646,0.0002862893,0.00001408906,0.00008999883,0.0000727317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002671365,"about_ca_system_score_gemma":0.00001451137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002554801,"about_ca_topic_score_gemma":3.471594e-7,"domain_scores_codex":[0.9992754,0.000004972223,0.0002759759,0.00007114104,0.0001132777,0.0002592492],"domain_scores_gemma":[0.9995559,0.00003769212,0.00003603215,0.0002051081,0.00005128013,0.0001140291],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002874472,0.0002345386,0.0001653582,0.0004056478,0.0002426478,0.000004031439,0.02338757,0.350792,0.0001831379,0.0107832,0.001071067,0.6127021],"study_design_scores_gemma":[0.0002873731,0.00004524246,0.0001177043,0.00002083231,0.00001204935,0.00000371963,0.0005499217,0.9964714,0.001746961,0.00008764974,0.0004882546,0.0001688611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0398907,0.00002746362,0.9530604,0.000009692807,0.000407039,0.0002182389,0.00002135181,0.0005321331,0.005832953],"genre_scores_gemma":[0.2856219,0.000007585777,0.7141602,0.00005555741,0.00005671687,0.00003556818,0.00003255902,0.00002065059,0.000009221515],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6456794,"threshold_uncertainty_score":0.4816181,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000098237","doi":"10.1007/s002360050001","title":"Querying sequence databases with transducers","year":2000,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Datalog; Computer science; Ackermann function; Subroutine; Theory of computation; Theoretical computer science; Hierarchy; Programming language; Sequence (biology); Database; P; Query language; Workstation; Transducer; Time complexity; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02632146965480677,"gpt":0.2518736810062855,"spread":0.2255522113514788,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001056636,0.0001123881,0.000107469,0.0000440857,0.0001488211,0.0001595698,0.0007058589,0.00001957327,0.0003067901],"category_scores_gemma":[0.000007832563,0.00007755527,0.00002078219,0.0002182821,0.00004498599,0.003991719,0.00007485667,0.0001055707,0.0001892796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001667901,"about_ca_system_score_gemma":0.00006792666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006135127,"about_ca_topic_score_gemma":0.000003621097,"domain_scores_codex":[0.9991435,0.00001327131,0.0001969477,0.0001417855,0.0002643028,0.0002401258],"domain_scores_gemma":[0.9991333,0.00005212207,0.00004440681,0.0006498146,0.00002370922,0.00009659927],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003368661,0.00006110583,0.0001059498,0.00007942283,0.00002972965,0.00003740741,0.004251197,0.0003689054,0.0004002207,0.01234669,0.006820628,0.9754651],"study_design_scores_gemma":[0.0009137453,0.0002268535,0.000976856,0.0003241512,0.00001648202,0.0002956993,0.0002166365,0.4387614,0.002708432,0.0003492337,0.5544991,0.0007114382],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1063875,0.00005094942,0.8179498,0.001594532,0.0001496897,0.0003757466,0.00006561795,0.0006207116,0.07280545],"genre_scores_gemma":[0.7161655,0.00008098142,0.2820602,0.00134436,0.00003487543,0.00001707959,0.00005576751,0.000008225936,0.000232999],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9747536,"threshold_uncertainty_score":0.3359136,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984586534","doi":"10.1007/s002360000042","title":"The class Steiner minimal tree problem: a lower bound and test problem generation","year":2000,"lang":"en","type":"article","venue":"Acta Informatica","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Steiner tree problem; Mathematics; Upper and lower bounds; Linear programming relaxation; Theory of computation; Subgradient method; k-minimum spanning tree; Combinatorics; Discrete mathematics; Approximation algorithm; Time complexity; Integer programming; Tree (set theory); Heuristic; K-ary tree; Mathematical optimization; Algorithm; Binary tree; Tree structure","retraction":null,"screen_n_in":null,"score":{"opus":0.007904042051019923,"gpt":0.1912008434298315,"spread":0.1832968013788116,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001567208,0.0001403506,0.000108717,0.00003510507,0.0001517,0.0002411721,0.0001268611,0.00008192207,0.00008892612],"category_scores_gemma":[0.00001752999,0.00009573877,0.00002705916,0.00009230849,0.00005376488,0.0005356526,0.00001716446,0.0001324069,0.00006515961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002716335,"about_ca_system_score_gemma":0.00001484281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003706632,"about_ca_topic_score_gemma":0.00001944377,"domain_scores_codex":[0.99924,0.000008122824,0.0003140474,0.0000667221,0.0001321091,0.000238965],"domain_scores_gemma":[0.9996155,0.00008816999,0.00002841329,0.0001862776,0.00002495587,0.00005670427],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003511489,0.00009260212,0.0002452353,0.0003872484,0.0001216195,0.00000666305,0.004076261,0.0002358186,0.02821869,0.003501507,0.2336052,0.729474],"study_design_scores_gemma":[0.0007558152,0.0005757498,0.0008173962,0.0001041166,0.00005495672,0.00008255637,0.0001292431,0.2073,0.01070915,0.001373566,0.7774022,0.0006953385],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.523075,0.0003730466,0.001076395,0.001361419,0.0001203317,0.001519471,0.00001947223,0.001302537,0.4711523],"genre_scores_gemma":[0.9940793,0.0002702271,0.00413308,0.0001287577,0.00008149973,0.0001122918,0.00001142056,0.00002081468,0.001162646],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7287787,"threshold_uncertainty_score":0.3904114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W796701085","doi":"10.1007/s00236-015-0245-y","title":"State complexity of deletion and bipolar deletion","year":2015,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Upper and lower bounds; Deterministic finite automaton; Theory of computation; Combinatorics; State (computer science); Regular language; Matching (statistics); Mathematics; Finite-state machine; Nondeterministic finite automaton; Discrete mathematics; Computational complexity theory; Time complexity; DFA minimization; Automaton; Automata theory; Algorithm; Computer science; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03540657342730158,"gpt":0.2394681679639424,"spread":0.2040615945366408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004216593,0.00006758806,0.0001130528,0.00006624642,0.00003747808,0.0000607808,0.0002616176,0.00002602402,0.000005219235],"category_scores_gemma":[0.00005386757,0.00005688185,0.00001771155,0.0001328326,0.00009207311,0.001050842,0.0001654121,0.00005416373,0.00002624263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001612803,"about_ca_system_score_gemma":0.00003186457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002733623,"about_ca_topic_score_gemma":0.000002316469,"domain_scores_codex":[0.9993509,0.00002804726,0.0002405828,0.00006754003,0.0001851027,0.0001278173],"domain_scores_gemma":[0.9994232,0.00003813763,0.0001199843,0.0002559233,0.00007677392,0.00008598984],"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.00004970587,0.0001458043,0.001922903,0.0003056402,0.00006015652,0.000004290333,0.02334799,0.00008632259,0.002498644,0.5699022,0.007910532,0.3937659],"study_design_scores_gemma":[0.001141591,0.0003898352,0.01204714,0.00008013201,0.00001265611,0.00008348327,0.0005015793,0.7887721,0.007621734,0.1470546,0.04190551,0.0003896618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7561382,0.000107307,0.2404097,0.0006105981,0.0001098577,0.0001272677,0.000006818826,0.0001225879,0.002367722],"genre_scores_gemma":[0.974381,0.00002190353,0.02533279,0.0002348166,0.000007795197,0.000002303865,0.000005838792,0.000002433434,0.00001111979],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7886857,"threshold_uncertainty_score":0.2319575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982010621","doi":"10.1007/s00236-006-0030-z","title":"On Abelian 2-avoidable binary patterns","year":2006,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Theory of computation; Binary number; Abelian group; Computer science; Mathematics; Combinatorics; Algorithm; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.00457864365006878,"gpt":0.1923357870594094,"spread":0.1877571434093406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001809307,0.0001268235,0.000122114,0.0001127685,0.000125867,0.0002174986,0.0007728132,0.00004959453,0.0001035377],"category_scores_gemma":[0.00001741134,0.0001018579,0.00004980576,0.0002025458,0.00002112477,0.00105846,0.0001828047,0.0001119884,0.000827915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002904928,"about_ca_system_score_gemma":0.0000254512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005089513,"about_ca_topic_score_gemma":0.000002496849,"domain_scores_codex":[0.999046,0.00001767618,0.0002685966,0.0001249602,0.0002384604,0.0003043592],"domain_scores_gemma":[0.9991037,0.000118814,0.00008569308,0.0006097972,0.00002180191,0.00006018338],"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.00001182941,0.0002868125,0.000662679,0.000119978,0.00002410832,0.00004609858,0.001272219,0.0003227979,0.001057038,0.8479697,0.1172798,0.03094698],"study_design_scores_gemma":[0.002405277,0.001186816,0.04789502,0.0004997273,0.00002407425,0.0001617741,0.000404363,0.568207,0.01530643,0.1830592,0.1789068,0.001943439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.800073,0.00002505173,0.05108546,0.002440731,0.0005223607,0.000288657,0.00001470593,0.0008117633,0.1447383],"genre_scores_gemma":[0.9937164,0.000003462551,0.003795652,0.001920863,0.00004311146,0.00001312928,0.00001023416,0.000006693724,0.0004904247],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6649104,"threshold_uncertainty_score":0.9999501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036780516","doi":"10.1007/s00236-009-0107-6","title":"Early action in an Earley parser","year":2009,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Software Engineering Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Parsing; Compiler; Natural language processing; Artificial intelligence; Programming language; Action (physics); Theory of computation; LR parser; Top-down parsing","retraction":null,"screen_n_in":null,"score":{"opus":0.02749241761183544,"gpt":0.2901093124590566,"spread":0.2626168948472211,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002393665,0.00007607848,0.00008270854,0.0001869811,0.00003264172,0.0002146495,0.0006207324,0.00005114642,0.00001440147],"category_scores_gemma":[0.0001854149,0.00007143824,0.00001856312,0.000398867,0.000009780714,0.003039183,0.00006161152,0.0001930669,0.0001874376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004964215,"about_ca_system_score_gemma":0.00003559747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001472895,"about_ca_topic_score_gemma":0.000002415015,"domain_scores_codex":[0.9991445,0.00001591911,0.0001876932,0.00009714925,0.0002757187,0.0002790255],"domain_scores_gemma":[0.9992657,0.0001070119,0.00002670535,0.0004673062,0.00003628909,0.00009698077],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00003973295,0.0003548698,0.03420275,0.00008761362,0.00001981585,0.00005326716,0.02434035,0.001797941,0.002946825,0.02162475,0.004295847,0.9102362],"study_design_scores_gemma":[0.000307329,0.0002857009,0.9289567,0.00002576899,8.220369e-7,0.00001112468,0.00003861176,0.06596567,0.0008954179,0.0008846084,0.002435379,0.0001928863],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9721816,0.000004893072,0.02556543,0.0005232122,0.00009689803,0.0001134219,2.569091e-7,0.0002575225,0.001256829],"genre_scores_gemma":[0.9876229,0.000003864406,0.01209387,0.0002141504,0.00002105002,0.000006496504,0.000001290408,0.000003117278,0.00003331398],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9100434,"threshold_uncertainty_score":0.2913167,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138502430","doi":"10.1007/s00236-011-0132-0","title":"Nonatomic dual bakery algorithm with bounded tokens","year":2011,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Theory of computation; Bounded function; Dual (grammatical number); Computer science; Algorithm; Mathematics; Theoretical computer science; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01118819269320874,"gpt":0.179943442593136,"spread":0.1687552498999272,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000852717,0.0001542383,0.0001448873,0.0000944469,0.00006608645,0.00005632648,0.0001243444,0.00007619799,0.000390635],"category_scores_gemma":[0.00001302928,0.0001290834,0.0000322304,0.000172985,0.00004356563,0.0005017427,0.0000226171,0.0001618743,0.0003378705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003436591,"about_ca_system_score_gemma":0.00003143562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006454407,"about_ca_topic_score_gemma":0.000001976224,"domain_scores_codex":[0.9992339,0.000005491567,0.0002589831,0.00006866163,0.0001686036,0.0002643504],"domain_scores_gemma":[0.9995452,0.0000249172,0.00003629782,0.0002322579,0.00004947114,0.0001118255],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004143539,0.0009128179,0.002642078,0.00174054,0.003642771,0.0003957809,0.173056,0.0722566,0.0003531666,0.01415697,0.05008316,0.6803458],"study_design_scores_gemma":[0.0007325524,0.00007267327,0.0006013357,0.00003828766,0.00003167025,0.0001062933,0.0007822238,0.9906002,0.001692102,0.0001140774,0.004838821,0.0003897236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1890413,0.0001023962,0.465156,0.0001234684,0.001308396,0.0006075913,0.0000527319,0.002891638,0.3407165],"genre_scores_gemma":[0.4084301,0.00003356484,0.5909478,0.0002528954,0.00006838774,0.00002480204,0.00003611615,0.00004116659,0.0001651097],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9183437,"threshold_uncertainty_score":0.5263867,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141718869","doi":"10.1007/s00236-006-0027-7","title":"Representation and uniformization of algebraic transductions","year":2006,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; University of Waterloo; Saint Mary's University","funders":"","keywords":"Algebraic number; Formalism (music); Computer science; Representation (politics); Stack (abstract data type); Theory of computation; Context (archaeology); Mathematics; Algebra over a field; Theoretical computer science; Programming language; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.004762714598113413,"gpt":0.1991153075103327,"spread":0.1943525929122193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001002434,0.0000448802,0.00007115734,0.00007581962,0.00005082526,0.00004508606,0.0001440329,0.00002329531,0.00001061853],"category_scores_gemma":[0.00001510038,0.00003945469,0.00001939408,0.0002492541,0.00003492121,0.001252111,0.00003119054,0.0000278578,0.000005787463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005421735,"about_ca_system_score_gemma":0.00001200409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003373266,"about_ca_topic_score_gemma":0.000002694968,"domain_scores_codex":[0.9995393,0.00001117986,0.00021801,0.00005675948,0.00009949513,0.00007527497],"domain_scores_gemma":[0.9996292,0.00004675803,0.00008003411,0.0001958365,0.0000302384,0.0000179629],"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.000003207698,0.00004088198,0.0004537184,0.00005993472,0.00001148751,5.613657e-7,0.00244163,0.0002171628,0.002414829,0.9531176,0.001312098,0.0399269],"study_design_scores_gemma":[0.001342243,0.0001693822,0.07451053,0.00008580052,0.00003853307,0.0001756055,0.0009589911,0.6040679,0.04078922,0.2702428,0.007130963,0.0004880485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4608587,0.00003005482,0.5228857,0.0008749043,0.0001084676,0.0001414412,0.000003075001,0.0001319344,0.01496575],"genre_scores_gemma":[0.985598,0.00001033073,0.01425362,0.00005865314,0.00001258688,0.000003619265,0.00001055499,0.000001867657,0.00005081221],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6828748,"threshold_uncertainty_score":0.1608915,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W266933206","doi":"10.1007/s00236-003-0110-2","title":"A word on 7 letters which is non-repetitive up to mod 5","year":2003,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mod; Theory of computation; Construct (python library); Word (group theory); Combinatorics; Mathematics; Plane (geometry); Discrete mathematics; Arithmetic; Computer science; Algorithm; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.008311424531101974,"gpt":0.2235434308793063,"spread":0.2152320063482044,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002919183,0.0001608664,0.0001639806,0.0001383039,0.0001100111,0.0002220142,0.0007235016,0.00004469065,0.0001183064],"category_scores_gemma":[0.0001326581,0.0001355647,0.00005154929,0.0005099042,0.0000192684,0.0008952962,0.0001459209,0.0001388476,0.001543838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004307928,"about_ca_system_score_gemma":0.00004549349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006002117,"about_ca_topic_score_gemma":0.000001232393,"domain_scores_codex":[0.9988531,0.00002659728,0.0002692968,0.0001877277,0.0003036275,0.000359638],"domain_scores_gemma":[0.9988617,0.0001276395,0.00007575571,0.0007299481,0.00005489484,0.0001500973],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005802046,0.0001906224,0.0001415571,0.0001375711,0.0001613188,0.00002741771,0.1078987,0.0003394885,0.004660035,0.5302857,0.2694922,0.08660727],"study_design_scores_gemma":[0.004338868,0.001450297,0.007451352,0.00112977,0.00005829566,0.0002278733,0.00452442,0.1827343,0.1403656,0.02409235,0.6297071,0.003919758],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6200605,0.000005935935,0.2209545,0.01219405,0.0009786889,0.0005768485,0.00001052948,0.0003544805,0.1448644],"genre_scores_gemma":[0.956499,0.000002571663,0.01389343,0.02926181,0.00002206733,0.00002892704,0.000001552296,0.000008126384,0.0002824935],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5061933,"threshold_uncertainty_score":0.9992336,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3183377724","doi":"10.1007/s00236-021-00399-6","title":"On the size of partial derivatives and the word membership problem","year":2021,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"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; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Word (group theory); Computer science; Mathematics; Linguistics; Algorithm; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.01160276228681798,"gpt":0.2121827242589413,"spread":0.2005799619721234,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005609163,0.00007463815,0.0001208004,0.00001149081,0.0001125389,0.0001358459,0.0004749204,0.00002268121,0.00008430855],"category_scores_gemma":[0.0005007284,0.00003469218,0.00003882783,0.0001825592,0.0001896771,0.0003685356,0.0002597229,0.00009952555,0.00001201889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000431788,"about_ca_system_score_gemma":0.00003927061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002621983,"about_ca_topic_score_gemma":7.221756e-7,"domain_scores_codex":[0.9992899,0.0001037445,0.000220875,0.00007263113,0.0001786756,0.0001341609],"domain_scores_gemma":[0.9970223,0.002363886,0.0001104647,0.0004401008,0.00003678736,0.00002643292],"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.00001312603,0.00001321965,0.00001068377,0.00002352102,0.00002261054,8.137813e-7,0.00999752,0.000004583859,0.00008927456,0.9824948,0.0008771376,0.006452718],"study_design_scores_gemma":[0.002938326,0.0001816132,0.003589461,0.000391163,0.00004473634,0.00009021196,0.007463969,0.1163947,0.05484427,0.7953657,0.01818403,0.0005118837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8168854,0.0001742591,0.01437063,0.05608784,0.0002338425,0.0006620389,0.000004961023,0.0001552139,0.1114258],"genre_scores_gemma":[0.9941646,0.00001417896,0.003447635,0.002267126,0.00001183259,0.00001584418,3.844571e-7,0.000002334525,0.00007608577],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1871291,"threshold_uncertainty_score":0.1414706,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2273670553","doi":"10.1007/s00236-016-0258-1","title":"Disjunctivity and other properties of sets of pseudo-bordered words","year":2016,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Combinatorics on words; Mathematics; Combinatorics; Morphism; Suffix; Theta function; Prefix; Word (group theory); Discrete mathematics; Pure mathematics; Geometry; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01445349805396633,"gpt":0.2166454802145087,"spread":0.2021919821605423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002246472,0.0000771609,0.0001591543,0.00005192286,0.00002422692,0.00002110652,0.0003304395,0.00003174145,0.00002137983],"category_scores_gemma":[0.00007666191,0.00004107444,0.00002739487,0.00009834223,0.0001302374,0.0008300245,0.0002051896,0.00002704019,0.000007737766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005815142,"about_ca_system_score_gemma":0.00002721506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001358086,"about_ca_topic_score_gemma":0.000001496138,"domain_scores_codex":[0.9993837,0.00002143081,0.0002491413,0.0000716201,0.000147796,0.0001262381],"domain_scores_gemma":[0.9993423,0.00007877342,0.0001424986,0.0003672147,0.00003349948,0.00003574164],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000100363,0.0002567056,0.006552206,0.0009051965,0.0001541135,0.000001265962,0.02552668,0.000001877394,0.1566423,0.1523905,0.001555981,0.6559128],"study_design_scores_gemma":[0.005419992,0.001174504,0.05526525,0.003196276,0.00007254402,0.0001156214,0.002068369,0.08993272,0.7752869,0.04424902,0.02158006,0.001638814],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.977722,0.00003671728,0.01842481,0.0004815124,0.00005367972,0.0001017158,0.000006906794,0.00004684653,0.003125847],"genre_scores_gemma":[0.9964294,0.000009355917,0.0033636,0.0001345786,0.000004629477,0.000004455728,9.710378e-8,0.000003348111,0.00005057292],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6542739,"threshold_uncertainty_score":0.1674967,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007676477","doi":"10.1007/s002360100072","title":"Tree-systems of morphisms","year":2001,"lang":"en","type":"article","venue":"Acta Informatica","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Morphism; Theory of computation; Tree (set theory); Alphabet; Mathematics; Regular language; Hierarchy; Substring; Root (linguistics); Discrete mathematics; Computer science; Combinatorics; Automaton; Theoretical computer science; Algorithm; Data structure; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01382949110947762,"gpt":0.2309483918935203,"spread":0.2171189007840427,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001132667,0.00007416395,0.0001076468,0.00001977475,0.00002912218,0.00001229132,0.000157499,0.00008472752,0.00002617121],"category_scores_gemma":[0.00006619077,0.00005303111,0.00005168091,0.00006161702,0.00004283632,0.000004181584,0.00008361236,0.00003939855,0.00001840253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002306161,"about_ca_system_score_gemma":0.00001317115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000735453,"about_ca_topic_score_gemma":0.000001248689,"domain_scores_codex":[0.9994487,0.00001402798,0.0002461602,0.00006941693,0.00007474876,0.0001469785],"domain_scores_gemma":[0.9996322,0.00001162782,0.00009221571,0.0001800327,0.00004110851,0.00004278879],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001773821,0.0001565601,0.01834483,0.000123076,0.0001318648,0.000006209531,0.0002302996,0.0001526225,0.9139272,0.001576201,0.0159381,0.04923568],"study_design_scores_gemma":[0.001468944,0.001897192,0.01756582,0.00008516372,0.00003862791,0.0001908397,0.0008456737,0.007704801,0.1288468,0.0001738121,0.8404751,0.0007071404],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9461776,0.00008094969,0.001000183,0.00005791377,0.00008657499,0.00008273367,0.000003102351,0.00001096156,0.05249998],"genre_scores_gemma":[0.9988705,0.00004776469,0.0004579856,0.0001620616,0.00008019706,0.000003497722,0.00003511824,0.000003471905,0.0003393861],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.824537,"threshold_uncertainty_score":0.2162546,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984054760","doi":"10.1007/s00236-004-0157-8","title":"A deterministic skip list for k-dimensional range search","year":2005,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; Nova Scotia Community College","funders":"","keywords":"Range (aeronautics); Data structure; Commutative property; Mathematics; Set (abstract data type); Theory of computation; Discrete mathematics; Combinatorics; Cartesian product; Extension (predicate logic); Associative property; Computer science; Algorithm; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02194112664209232,"gpt":0.2681676960358217,"spread":0.2462265693937294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003310551,0.0001051084,0.0001151762,0.0001032314,0.0001469015,0.000325624,0.0008995492,0.00002936136,0.0000614528],"category_scores_gemma":[0.00005692045,0.00008949316,0.00005435193,0.0001562538,0.00003452283,0.002028773,0.0004119409,0.00007115377,0.0003906628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002371729,"about_ca_system_score_gemma":0.00003861076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003201596,"about_ca_topic_score_gemma":0.000002894811,"domain_scores_codex":[0.9990036,0.000009999969,0.0002585514,0.0001336391,0.0002791036,0.0003151084],"domain_scores_gemma":[0.9991957,0.0001477498,0.00005216569,0.0004609742,0.00005306791,0.00009032492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002750299,0.0001621805,0.00005989338,0.0002257763,0.00006066952,0.000006668141,0.001847199,0.0001251507,0.00004164601,0.08853278,0.186649,0.7222615],"study_design_scores_gemma":[0.0005131248,0.00007655806,0.0002431886,0.00001618129,0.00000703854,0.00000583745,0.00001992996,0.7006685,0.0001094024,0.000339453,0.2978472,0.0001535841],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01392938,0.00003223083,0.9183105,0.01135022,0.0006498395,0.001363907,0.00008533199,0.0004959948,0.05378261],"genre_scores_gemma":[0.6267565,0.00000573138,0.3671941,0.003485905,0.000280281,0.00007569116,0.0000654791,0.00001067145,0.002125692],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7221079,"threshold_uncertainty_score":0.502131,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4413297002","doi":"10.1007/s00236-025-00503-0","title":"On the 3-tree core of plane graphs","year":2025,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Bangladesh University of Engineering and Technology","keywords":"Theory of computation; Core (optical fiber); Tree (set theory); Combinatorics; Mathematics; Computer science; Plane (geometry); Discrete mathematics; Algorithm; Geometry; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02111892525438423,"gpt":0.2857842315970918,"spread":0.2646653063427076,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003551844,0.00007799948,0.000108177,0.0001795568,0.00009977388,0.00004204346,0.001390553,0.0000307534,0.00003124029],"category_scores_gemma":[0.0003068841,0.000047374,0.00004752221,0.000671325,0.0001334071,0.0003507418,0.0002966498,0.0001731314,0.00005720795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000110199,"about_ca_system_score_gemma":0.00004842043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002109356,"about_ca_topic_score_gemma":0.000001738966,"domain_scores_codex":[0.9991937,0.00002734473,0.0002274775,0.00007853941,0.0002746776,0.0001982308],"domain_scores_gemma":[0.9980624,0.0009644598,0.00007164578,0.0008074231,0.00006072866,0.00003335864],"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.00001190839,0.00001466261,0.00005640055,0.00002283617,0.00001471272,6.24264e-7,0.0003830826,0.00001066908,0.0001296473,0.9855483,0.0049721,0.008835013],"study_design_scores_gemma":[0.0002914296,0.0001521762,0.001627105,0.00009812783,0.000003813525,0.000003723651,0.0001816589,0.01323976,0.005570477,0.9713287,0.007392888,0.0001101358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2325833,0.00005335834,0.1231024,0.008271416,0.0004019325,0.0009184903,0.00001548843,0.0002442017,0.6344094],"genre_scores_gemma":[0.9957093,0.000009429232,0.002897733,0.001047515,0.000002300979,0.000015265,0.000001465344,0.000002134263,0.0003148625],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.763126,"threshold_uncertainty_score":0.2584016,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4409157006","doi":"10.1007/s00236-025-00483-1","title":"Visualization of bipartite graphs in limited window size","year":2025,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Technische Universität München","keywords":"Bipartite graph; Theory of computation; Window (computing); Computer science; Visualization; Graph drawing; Theoretical computer science; Combinatorics; Mathematics; Algorithm; Graph; Artificial intelligence; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01232327487995153,"gpt":0.2879504429206937,"spread":0.2756271680407421,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002168506,0.00007524508,0.0001401893,0.0003363768,0.00003125521,0.00008705106,0.0004754651,0.00004357086,0.00002220722],"category_scores_gemma":[0.0003809758,0.00006995811,0.00003261839,0.00175713,0.0000319605,0.001023572,0.0001604622,0.0000463738,0.00001748645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001511978,"about_ca_system_score_gemma":0.00006817404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008749196,"about_ca_topic_score_gemma":0.00000736356,"domain_scores_codex":[0.9991117,0.00002740075,0.0004685648,0.000084374,0.0001710104,0.0001369989],"domain_scores_gemma":[0.9992657,0.000133839,0.0001268772,0.0003529411,0.00008794219,0.00003272583],"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.00000616933,0.0001255047,0.009716414,0.0001673237,0.00002404602,8.662751e-7,0.0017588,0.0001373309,0.0004477908,0.9774454,0.004934125,0.005236215],"study_design_scores_gemma":[0.00136647,0.00008835125,0.04515012,0.0003446379,0.00001936662,0.000001909692,0.000261969,0.8977397,0.00737073,0.01143755,0.03590746,0.0003117144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09610902,0.0000462392,0.8291143,0.002139455,0.000449683,0.0005412634,0.00001724063,0.0003178515,0.07126493],"genre_scores_gemma":[0.9950897,0.00003906662,0.003270946,0.001382913,0.000002651264,0.000004401558,0.00002000317,0.00000241303,0.0001879541],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9660079,"threshold_uncertainty_score":0.2852809,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2908903570","doi":"10.1007/s00236-021-00411-z","title":"On Huang and Wong’s algorithm for generalized binary split trees","year":2022,"lang":"en","type":"preprint","venue":"Acta Informatica","topic":"Advanced Graph Theory Research","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; Canada Research Chairs; Hong Kong University of Science and Technology; University of Waterloo; Research Grants Council, University Grants Committee; National Science Foundation","keywords":"Algorithm; Mathematics; Binary number; Dynamic programming; Property (philosophy); Time complexity; Optimal binary search tree; Binary tree; Computer science; Tree structure; Interval tree","retraction":null,"screen_n_in":null,"score":{"opus":0.02943207565423358,"gpt":0.3137747860426243,"spread":0.2843427103883907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007593385,0.000320856,0.0004100516,0.0004352191,0.0003412148,0.0003633757,0.001922608,0.0001484724,0.0001084731],"category_scores_gemma":[0.0001596537,0.0002950059,0.0001619394,0.0002638822,0.000111272,0.0006938629,0.004229287,0.0007171375,0.00001904895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001113072,"about_ca_system_score_gemma":0.0001483019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008644566,"about_ca_topic_score_gemma":0.000001112013,"domain_scores_codex":[0.9978831,0.00009762428,0.000483704,0.0004386015,0.0005720753,0.0005248668],"domain_scores_gemma":[0.9975522,0.0006168978,0.0002383677,0.001331171,0.00008725964,0.0001740777],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001096761,0.0001369151,0.00001112272,0.0006351577,0.0001991896,0.00002459729,0.003994562,0.001544486,0.00006536029,0.4133101,0.01126794,0.5687009],"study_design_scores_gemma":[0.0009789303,0.0004866908,0.0001880787,0.00009213983,0.00002057693,0.00001724611,0.0001579073,0.7057574,0.0001370618,0.2546099,0.03696222,0.0005917401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0388743,0.0004333509,0.9382555,0.002932037,0.001479559,0.003726725,0.0003851644,0.0006676862,0.01324569],"genre_scores_gemma":[0.0263349,0.0003542409,0.9666672,0.001795642,0.0001400492,0.001963625,0.0002850541,0.00006730246,0.002391981],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.704213,"threshold_uncertainty_score":0.9999502,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995220817","doi":"10.1007/s00236-009-0090-y","title":"On the closure of pattern expressions languages under intersection with regular languages","year":2009,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Abstract family of languages; Intersection (aeronautics); Closure (psychology); Complement (music); Theory of computation; Language family; Cone (formal languages); Computer science; Second-generation programming language; Regular language; Mathematics; Linguistics; Programming language; Artificial intelligence; Fifth-generation programming language; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.005861879333243367,"gpt":0.225533461348524,"spread":0.2196715820152806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001611046,0.00009032618,0.00009814963,0.00005642806,0.00007030698,0.00006523928,0.0004859479,0.00003488502,0.00004469393],"category_scores_gemma":[0.00003023405,0.00004658886,0.00003594027,0.0001116983,0.00003548477,0.0004183565,0.00006007285,0.0001090234,0.00001916182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001111761,"about_ca_system_score_gemma":0.00001355844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008902917,"about_ca_topic_score_gemma":0.000002560119,"domain_scores_codex":[0.9993998,0.00003404094,0.0001589725,0.00007793566,0.0001988963,0.0001303925],"domain_scores_gemma":[0.9991571,0.0001557205,0.0001085199,0.0005237734,0.00002543531,0.00002940516],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005774196,0.0002997502,0.000274849,0.00009875704,0.0001348605,0.00002353572,0.03589805,0.0003221697,0.01227105,0.7716542,0.0235886,0.1553764],"study_design_scores_gemma":[0.006399761,0.00880624,0.1613436,0.006411221,0.0002188303,0.0007447284,0.1657112,0.1108865,0.3887028,0.1353283,0.01179286,0.003654035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.871696,0.00003403511,0.09592893,0.005747696,0.00005217822,0.0002001139,0.000004770813,0.0001911194,0.02614517],"genre_scores_gemma":[0.9967322,0.000002830707,0.0009413261,0.002220362,0.00001669748,0.000004460438,0.000002750721,0.000003218664,0.00007612431],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.636326,"threshold_uncertainty_score":0.1899838,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4408882635","doi":"10.1007/s00236-025-00486-y","title":"The thief orienteering problem on 2-terminal series–parallel graphs","year":2025,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Mount Royal University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orienteering; Terminal (telecommunication); Theory of computation; Computer science; Series (stratigraphy); GRASP; Mathematics; Combinatorics; Theoretical computer science; Mathematical optimization; Algorithm; Computer network; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.004946546587709932,"gpt":0.2047632126414121,"spread":0.1998166660537022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001388002,0.0001296649,0.0001006405,0.00008543042,0.0002251739,0.0001704063,0.0002195611,0.00005558242,0.00003584435],"category_scores_gemma":[0.00002714081,0.00009327379,0.0000425799,0.0002607818,0.00004071775,0.0003336033,0.00003861338,0.000188869,0.00008249615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002993995,"about_ca_system_score_gemma":0.00002070836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001349493,"about_ca_topic_score_gemma":0.000003844596,"domain_scores_codex":[0.9992762,0.000008241188,0.0002943469,0.00005697987,0.0001257284,0.0002384799],"domain_scores_gemma":[0.9995707,0.0000672014,0.0000321281,0.0002569709,0.00003246838,0.0000405374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001030231,0.00004729947,0.0003085824,0.001001586,0.0002630519,0.000005029901,0.005764617,0.3040604,0.00009486004,0.5601162,0.09456857,0.03366682],"study_design_scores_gemma":[0.0005659282,0.00008686281,0.0003227427,0.0002876041,0.00002135699,0.00001650045,0.0003914193,0.1508024,0.0004116306,0.004017377,0.8427519,0.0003242812],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.006875002,0.00008337181,0.01259331,0.001569265,0.001102127,0.0006080107,0.000007045572,0.0008876295,0.9762743],"genre_scores_gemma":[0.9836273,0.0004545532,0.00919801,0.0007741087,0.00003217184,0.0001278927,0.00002328032,0.00003099612,0.005731726],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9767523,"threshold_uncertainty_score":0.3803595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4412934941","doi":"10.1007/s00236-025-00495-x","title":"Novel tree-search method for synthesizing SMT strategies","year":2025,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Software Engineering Research","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":"Alliance de recherche numérique du Canada; Georg-August-Universität Göttingen","keywords":"Computer science; Theory of computation; Tree (set theory); Search tree; Theoretical computer science; Programming language; Parallel computing; Search algorithm; Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.03024586843626352,"gpt":0.3359139184326752,"spread":0.3056680499964117,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009473382,0.000124817,0.0001722397,0.0003085467,0.000131542,0.0005239904,0.001251599,0.00006845433,0.000007653503],"category_scores_gemma":[0.001338066,0.0001117666,0.00006918611,0.0005639333,0.00002963828,0.00126986,0.000356154,0.0001863966,0.00002889197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006806564,"about_ca_system_score_gemma":0.0003210447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002297119,"about_ca_topic_score_gemma":0.000002128141,"domain_scores_codex":[0.9987879,0.00001896579,0.0002854539,0.0001629854,0.000302223,0.0004424957],"domain_scores_gemma":[0.995591,0.003569851,0.00003155581,0.0006009692,0.0001325157,0.00007406137],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002169599,0.00008312456,0.0001078821,0.0009786948,0.0001518938,0.000002245888,0.00369326,0.002346895,0.009394422,0.4816117,0.005445162,0.496163],"study_design_scores_gemma":[0.0006621963,0.000104782,0.002425743,0.0001818877,0.00001211148,0.00001386106,0.0007215659,0.9372982,0.02205866,0.003282333,0.03290372,0.0003349857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001200578,0.00002117669,0.9888698,0.001144417,0.0001606771,0.0003158998,0.000003324857,0.0003065452,0.007977566],"genre_scores_gemma":[0.1558188,0.000003901316,0.8435434,0.0001954453,0.00002281837,0.00009551168,0.000002061489,0.00000791294,0.0003101678],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9349512,"threshold_uncertainty_score":0.5052851,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}