{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Stavros Konstantinidis","is_ca":true},{"name":"Elena Losseva","is_ca":true},{"name":"Geoff Wozniak","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001680263,0.0005451161,0.000632405,0.0009566306,0.00106476,0.002686517,0.001451969,0.001109975,0.008376155],"category_scores_gemma":[0.005474428,0.0005508282,0.0009531217,0.001566291,0.002200369,0.007443583,0.002858897,0.002561162,0.001788734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008131434,"about_ca_system_score_gemma":0.001127896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006535414,"about_ca_topic_score_gemma":0.0007777283,"domain_scores_codex":[0.9984453,0.0003155369,0.0002069385,0.0002602692,0.0005359965,0.0002359161],"domain_scores_gemma":[0.9958105,0.001937357,0.0002590215,0.001280723,0.0004631291,0.0002493345],"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.0001955342,0.00002440401,0.0002380416,0.0001389717,0.00001254951,0.0001114681,0.0005258138,0.006780759,0.005112234,0.9393297,0.002991086,0.04453947],"study_design_scores_gemma":[0.00002839906,0.0000408041,0.0001078768,0.00004450461,0.00002113899,0.000215751,0.0001393865,0.01949979,0.01084843,0.9453318,0.02367434,0.00004776798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08109,0.001166316,0.8813997,0.001343917,0.0002862532,0.00007911362,0.0009963948,0.003089038,0.03054933],"genre_scores_gemma":[0.684597,0.001307809,0.2577662,0.00113717,0.0002326128,0.0003406503,0.001902929,0.002757751,0.04995802],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008376155,"threshold_uncertainty_score":0.02802104,"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","authors":[{"name":"John Aycock","is_ca":true},{"name":"Nigel Horspool","is_ca":true},{"name":"Jan Janoušek","is_ca":false},{"name":"Bořivoj Melichar","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002974675,0.002422023,0.002472005,0.00156699,0.001626392,0.005929313,0.002896006,0.003651557,0.06876382],"category_scores_gemma":[0.01280018,0.001498247,0.002664708,0.002501512,0.002107461,0.01492674,0.005679809,0.004737345,0.03063398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001342271,"about_ca_system_score_gemma":0.002279536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002236115,"about_ca_topic_score_gemma":0.004418231,"domain_scores_codex":[0.9935644,0.002466763,0.0004104605,0.001661813,0.001131847,0.000764785],"domain_scores_gemma":[0.9820886,0.005352348,0.000279265,0.01053472,0.00146078,0.0002844047],"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.001299909,0.0003391422,0.001460897,0.001650022,0.0003061993,0.0009872202,0.001235764,0.01083635,0.04249352,0.282291,0.2236057,0.4334943],"study_design_scores_gemma":[0.0002349642,0.0001318617,0.001183155,0.0002247086,0.0004082722,0.001156602,0.0006420787,0.09833328,0.03783109,0.7239553,0.1356693,0.000229371],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07113798,0.003672008,0.6657683,0.0100623,0.003784771,0.0003251706,0.006118571,0.1227182,0.1164128],"genre_scores_gemma":[0.467121,0.001192416,0.4302823,0.005438549,0.001655709,0.0002200321,0.01186816,0.02583499,0.05638696],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06876382,"threshold_uncertainty_score":0.2300379,"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","authors":[{"name":"Naomi Nishimura","is_ca":true},{"name":"Prabhakar Ragde","is_ca":true},{"name":"Stefan Szeider","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007902266,0.001178794,0.0009998627,0.000989345,0.000998929,0.002698715,0.002026862,0.001401604,0.01179578],"category_scores_gemma":[0.005361162,0.0009294452,0.001953477,0.00191352,0.00098095,0.004380394,0.00260483,0.002637743,0.001794928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001354437,"about_ca_system_score_gemma":0.001602966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004333425,"about_ca_topic_score_gemma":0.008359846,"domain_scores_codex":[0.9986847,0.0004170212,0.00005634066,0.0002851093,0.0002759724,0.0002808886],"domain_scores_gemma":[0.9952627,0.003729399,0.0001732357,0.0005181904,0.0001823019,0.0001341133],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001427232,0.000486348,0.004180402,0.00125972,0.0003972657,0.0004294298,0.0006126569,0.271956,0.01396163,0.2180185,0.04130205,0.445969],"study_design_scores_gemma":[0.0002281925,0.0001579029,0.0009203078,0.00008661373,0.0001890983,0.0002045525,0.0002789052,0.5210271,0.01111042,0.4515659,0.01419996,0.00003113311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3120993,0.001395142,0.5995672,0.005592315,0.0003766796,0.0002897975,0.003072188,0.006049828,0.07155762],"genre_scores_gemma":[0.6470575,0.0005848004,0.3299653,0.0005460305,0.0002169322,0.0001940953,0.00407248,0.0009512243,0.01641165],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01179578,"threshold_uncertainty_score":0.03946084,"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","authors":[{"name":"Philippe Chanzy","is_ca":true},{"name":"Luc Devroye","is_ca":true},{"name":"Carlos Zamora-Cura","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003118158,0.0004662061,0.001363084,0.002479661,0.0008384466,0.001471787,0.002213343,0.00141201,0.00718216],"category_scores_gemma":[0.03435514,0.0006409947,0.0009441848,0.002086767,0.001446809,0.002823842,0.002022168,0.001045671,0.0006104148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001559073,"about_ca_system_score_gemma":0.00111866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002162992,"about_ca_topic_score_gemma":0.002081783,"domain_scores_codex":[0.9981219,0.0007420895,0.00006780638,0.0001790094,0.0006197612,0.0002693043],"domain_scores_gemma":[0.9674063,0.02882425,0.0009856876,0.001006622,0.001234262,0.0005428416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004064697,0.0001272099,0.003172997,0.0003070215,0.00007199606,0.0001259268,0.000171678,0.8144604,0.001898788,0.1379557,0.004390959,0.0369109],"study_design_scores_gemma":[0.00001703467,0.00003208685,0.0003028869,0.0000202861,0.00001177055,0.00006186136,0.0000317468,0.9776149,0.0003355547,0.02118269,0.0003812827,0.000007842776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3424763,0.004884756,0.621604,0.001564935,0.00009310107,0.0002304368,0.000626948,0.0009538902,0.02756566],"genre_scores_gemma":[0.915819,0.001025558,0.07644429,0.0002022588,0.00008586027,0.0001676827,0.000613148,0.0003673081,0.005274963],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00718216,"threshold_uncertainty_score":0.02402669,"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","authors":[{"name":"Danny Dubé","is_ca":true},{"name":"Marc Feeley","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008835605,0.001130497,0.00167408,0.001485029,0.001069747,0.002212041,0.001508021,0.001514107,0.009242496],"category_scores_gemma":[0.006677561,0.001199129,0.002228941,0.001880154,0.001018412,0.004365948,0.002449265,0.00256542,0.005680338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007081183,"about_ca_system_score_gemma":0.002172488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001789438,"about_ca_topic_score_gemma":0.003449479,"domain_scores_codex":[0.9987705,0.0002863921,0.00009655934,0.0002765571,0.0004438782,0.0001260753],"domain_scores_gemma":[0.9951504,0.003622693,0.0001096824,0.0004627479,0.000576194,0.00007826204],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006726094,0.0003864703,0.002416902,0.002081222,0.0002188864,0.002095241,0.001672525,0.03825595,0.04938561,0.1205101,0.09405928,0.6882452],"study_design_scores_gemma":[0.0002501465,0.0002273564,0.001027913,0.000262934,0.000338372,0.001157008,0.0008379933,0.5001781,0.06122985,0.3609203,0.0734181,0.0001519923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03654708,0.0004589978,0.9146314,0.001170399,0.0002521972,0.0003196261,0.003360836,0.03582777,0.007431667],"genre_scores_gemma":[0.1596499,0.0004937692,0.8175924,0.0003924021,0.0001179027,0.0002749118,0.008401017,0.006201248,0.006876411],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009242496,"threshold_uncertainty_score":0.03091925,"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","authors":[{"name":"Ryszard Janicki","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001996132,0.000710276,0.0008538309,0.001769465,0.0017946,0.006598461,0.001976938,0.00165178,0.008959395],"category_scores_gemma":[0.007084411,0.0008800668,0.001343773,0.00193105,0.004625521,0.009971851,0.002170621,0.002677767,0.001603582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002356638,"about_ca_system_score_gemma":0.002258243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006414923,"about_ca_topic_score_gemma":0.003802771,"domain_scores_codex":[0.9975294,0.0007141878,0.000197839,0.000488043,0.0008368746,0.0002336049],"domain_scores_gemma":[0.9961392,0.001775404,0.0003125421,0.000888764,0.0006358164,0.0002483222],"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.000007948645,0.000006412916,0.00005735668,0.000007998864,0.000004597994,0.00003500224,0.0001098338,0.002564939,0.0001466126,0.9954745,0.0002229658,0.001361788],"study_design_scores_gemma":[0.00001759397,0.000009288416,0.00003994035,0.00001118693,0.00001899469,0.00004619327,0.00005588197,0.02151811,0.0003016972,0.9726389,0.005331967,0.00001032065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03180827,0.001126449,0.9014618,0.002639855,0.0002256881,0.0001578126,0.0007019891,0.0006245761,0.06125361],"genre_scores_gemma":[0.7483772,0.00126551,0.2121508,0.0005871494,0.0004356717,0.0004717307,0.0008298712,0.0002111745,0.03567094],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008959395,"threshold_uncertainty_score":0.02997214,"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","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Kalpana Mahalingam","is_ca":true},{"name":"G. Thierrin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001849611,0.000501612,0.0009719539,0.002671469,0.002643983,0.004823583,0.001103732,0.001500451,0.007456509],"category_scores_gemma":[0.005062335,0.001066877,0.001333054,0.003177571,0.003788757,0.01134676,0.003211941,0.002231953,0.00161134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001433103,"about_ca_system_score_gemma":0.001249787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001103857,"about_ca_topic_score_gemma":0.0008829305,"domain_scores_codex":[0.9978764,0.0006929389,0.0002616105,0.0004008751,0.0004863831,0.0002818527],"domain_scores_gemma":[0.9956916,0.002306604,0.0003268924,0.0007707161,0.0006897167,0.0002144334],"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.00002718105,0.000006228485,0.0001601156,0.00003555898,0.000007352932,0.00004971574,0.0002991688,0.0003230282,0.0006229311,0.991384,0.0008288027,0.006255846],"study_design_scores_gemma":[0.000009966491,0.00001385258,0.0001641199,0.00001976707,0.0000159928,0.00011574,0.00008457907,0.002503146,0.0008866864,0.9888732,0.007289653,0.00002318762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.190431,0.002443679,0.7256936,0.00345677,0.0005999821,0.0001137337,0.001599574,0.002015843,0.07364574],"genre_scores_gemma":[0.9061062,0.0009314396,0.07305036,0.000991519,0.0005170639,0.0001953389,0.001281736,0.0006744363,0.01625187],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007456509,"threshold_uncertainty_score":0.02494454,"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","authors":[{"name":"Alex Aravind","is_ca":true},{"name":"Wim H. Hesselink","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001490748,0.0005239202,0.001188115,0.0008326141,0.001788588,0.001720566,0.002521074,0.001189061,0.006368653],"category_scores_gemma":[0.003479497,0.0003831597,0.0005028814,0.001139448,0.0004924792,0.001775512,0.001785796,0.001265827,0.001442941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000971554,"about_ca_system_score_gemma":0.0025796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003272413,"about_ca_topic_score_gemma":0.004450431,"domain_scores_codex":[0.9989981,0.0002705244,0.00006133834,0.0001678445,0.0003561223,0.0001461044],"domain_scores_gemma":[0.9982048,0.0007449167,0.00007186186,0.000329397,0.0004953708,0.0001536459],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00231632,0.00115815,0.001662936,0.0003129374,0.0001903214,0.0001450061,0.0003407861,0.1651017,0.02387379,0.1399551,0.02383465,0.6411082],"study_design_scores_gemma":[0.0004103238,0.0003161443,0.0003277279,0.00001953884,0.00007455212,0.0001077848,0.00004101952,0.9378672,0.00814158,0.04002519,0.01262329,0.00004561733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02151859,0.0004179051,0.9690532,0.0003733952,0.0002634999,0.0001853403,0.0001370562,0.00264719,0.005403893],"genre_scores_gemma":[0.3261665,0.0002786547,0.6596407,0.0003292325,0.0001425468,0.0003067095,0.0004462601,0.0003326402,0.01235677],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006368653,"threshold_uncertainty_score":0.02130532,"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","authors":[{"name":"Nicolas Broutin","is_ca":true},{"name":"Luc Devroye","is_ca":true},{"name":"Erin McLeish","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002327544,0.0006151214,0.001443434,0.003151032,0.001386995,0.003178314,0.002454147,0.001991062,0.00845368],"category_scores_gemma":[0.02169998,0.0009766202,0.0009139773,0.002925499,0.001964307,0.005409203,0.002608926,0.002443715,0.001102089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001787108,"about_ca_system_score_gemma":0.0008843725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001551102,"about_ca_topic_score_gemma":0.002490404,"domain_scores_codex":[0.9983668,0.0005406999,0.00007722309,0.0002623759,0.0004680676,0.0002847906],"domain_scores_gemma":[0.9836909,0.01141921,0.00111337,0.001425071,0.001000709,0.001350727],"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.0002286597,0.00005726817,0.001591497,0.0001753305,0.00006020266,0.0001329017,0.0002547208,0.06176869,0.002178523,0.8979176,0.005205378,0.03042917],"study_design_scores_gemma":[0.00003437914,0.00004167182,0.0006124651,0.00003134474,0.00003426507,0.0001459313,0.00005647237,0.1850951,0.0006357037,0.810743,0.00254899,0.00002063853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.393115,0.002870009,0.5726547,0.002600337,0.0003122388,0.00009628805,0.001134677,0.0009021804,0.02631467],"genre_scores_gemma":[0.8792141,0.001616054,0.09685416,0.0005281445,0.0005354173,0.0001665158,0.001524691,0.0005292745,0.01903176],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00845368,"threshold_uncertainty_score":0.02828032,"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","authors":[{"name":"Rudolf Berghammer","is_ca":false},{"name":"Michael Winter","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001855613,0.0009026229,0.0009518194,0.002408763,0.002069601,0.002695717,0.001244224,0.00164851,0.009295611],"category_scores_gemma":[0.005373682,0.0007628942,0.001355931,0.003119765,0.004067533,0.009802089,0.004515227,0.003905958,0.001133924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008602213,"about_ca_system_score_gemma":0.0004120203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000433189,"about_ca_topic_score_gemma":0.0004659031,"domain_scores_codex":[0.9987742,0.0004776181,0.00009804578,0.0003252643,0.0002100595,0.000114816],"domain_scores_gemma":[0.9973425,0.001534029,0.0001349932,0.00043888,0.0003372301,0.0002124033],"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.00002086074,0.00001642864,0.00009612628,0.00003108573,0.000006587471,0.00005936814,0.0002766243,0.0007430257,0.000357799,0.9833843,0.0009413795,0.01406651],"study_design_scores_gemma":[0.000003409101,0.000005059066,0.00003263369,0.000006091845,0.000003765768,0.00004775517,0.00005977902,0.001794415,0.0001410188,0.9954088,0.002493882,0.000003377027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1107732,0.006905586,0.7813712,0.004164082,0.0007792591,0.0000675887,0.0002678219,0.0004292364,0.095242],"genre_scores_gemma":[0.7442316,0.005030313,0.2064157,0.0007090042,0.0009558327,0.0001900864,0.0004290411,0.0003750035,0.04166336],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009295611,"threshold_uncertainty_score":0.03109694,"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","authors":[{"name":"Edward G. Coffman","is_ca":false},{"name":"Dariusz Dereniowski","is_ca":false},{"name":"Wiesław Kubiak","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002106678,0.001314114,0.001401676,0.002376142,0.001430667,0.001534173,0.002137554,0.001143963,0.008423164],"category_scores_gemma":[0.007151952,0.001017121,0.001164254,0.002436791,0.001205784,0.00243867,0.002021923,0.001578661,0.001767563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001692319,"about_ca_system_score_gemma":0.003823216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002894259,"about_ca_topic_score_gemma":0.004417006,"domain_scores_codex":[0.9987902,0.0003308609,0.00007014054,0.0002292897,0.0004066854,0.0001727559],"domain_scores_gemma":[0.9978637,0.001303337,0.0001526123,0.0002819747,0.0003008549,0.00009758474],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007201703,0.0002545236,0.0006779985,0.0003885691,0.00008061137,0.0001515936,0.0002985477,0.4667116,0.004388608,0.1147543,0.01628752,0.3952858],"study_design_scores_gemma":[0.0001804105,0.000133822,0.0001365928,0.00003817536,0.0000386065,0.0001240546,0.00008556883,0.891627,0.002236326,0.09842807,0.006944782,0.00002669557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005364931,0.0001722304,0.9893919,0.0001420207,0.00005361621,0.0001229798,0.0001177026,0.0008081601,0.003826414],"genre_scores_gemma":[0.05889463,0.0001842685,0.9380245,0.00005640082,0.00003181663,0.0002216572,0.0002939124,0.0001544053,0.002138464],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008423164,"threshold_uncertainty_score":0.02817822,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002885014,0.0009708696,0.00212637,0.004277317,0.0009631425,0.004936334,0.00201027,0.00257969,0.003385179],"category_scores_gemma":[0.02184722,0.001051395,0.001749378,0.006537326,0.001852539,0.01169507,0.003499359,0.002035477,0.001810057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001123406,"about_ca_system_score_gemma":0.001574625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002270108,"about_ca_topic_score_gemma":0.001996832,"domain_scores_codex":[0.9946826,0.001307613,0.000847019,0.0009031165,0.002028125,0.000231546],"domain_scores_gemma":[0.985575,0.01011354,0.0004036285,0.002442035,0.001252808,0.000213032],"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.002198314,0.0004377683,0.007917009,0.001543462,0.000413888,0.001688372,0.002167605,0.0926416,0.04412044,0.2867221,0.02540436,0.5347452],"study_design_scores_gemma":[0.0001194423,0.0001649628,0.0005637764,0.0001360634,0.000176572,0.0009291783,0.0006316975,0.510396,0.04473447,0.4219077,0.02014661,0.00009356567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0704647,0.001320513,0.9087593,0.001459317,0.0002115303,0.0001491786,0.003108704,0.01092563,0.003601093],"genre_scores_gemma":[0.5497038,0.001711243,0.4319922,0.0008118004,0.0003010142,0.0003622106,0.00953503,0.001381502,0.004201089],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004936334,"threshold_uncertainty_score":0.0152576,"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","authors":[{"name":"Boting Yang","is_ca":true},{"name":"Paul Gillard","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003278365,0.001964836,0.002261898,0.00332399,0.001760514,0.004355611,0.004013218,0.003225619,0.01388848],"category_scores_gemma":[0.02314342,0.0009328249,0.002620809,0.004267665,0.00201811,0.006714938,0.003138945,0.003879281,0.001316453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003144502,"about_ca_system_score_gemma":0.002536232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002555561,"about_ca_topic_score_gemma":0.003686264,"domain_scores_codex":[0.9965019,0.001060705,0.0001622508,0.0005366608,0.001239178,0.0004993759],"domain_scores_gemma":[0.9751152,0.02082636,0.0008633361,0.001490046,0.001052162,0.0006529058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001363629,0.0006716929,0.003033897,0.001366073,0.0002563641,0.000369598,0.0003509781,0.4215618,0.006524265,0.2455442,0.06235039,0.2566072],"study_design_scores_gemma":[0.0001376137,0.0001708349,0.0005455245,0.00009814512,0.0001031674,0.0002973482,0.0001019711,0.79943,0.002726862,0.1915105,0.004850097,0.00002786916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06536133,0.002295841,0.8921192,0.005610892,0.0002974578,0.0005216671,0.002030274,0.001287908,0.03047528],"genre_scores_gemma":[0.49735,0.002429329,0.4740975,0.001307771,0.001069847,0.0009995583,0.006337905,0.001353112,0.01505489],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01388848,"threshold_uncertainty_score":0.04646158,"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","authors":[{"name":"Yo-Sub Han","is_ca":false},{"name":"Sang‐Ki Ko","is_ca":false},{"name":"Kai Salomaa","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001977259,0.0005958198,0.0015188,0.001662653,0.001921115,0.006321935,0.001965208,0.001961641,0.01422142],"category_scores_gemma":[0.01759791,0.0007156732,0.001594695,0.00214022,0.003041251,0.01127794,0.003026035,0.003301933,0.0006751341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00233793,"about_ca_system_score_gemma":0.001601212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002770353,"about_ca_topic_score_gemma":0.001926469,"domain_scores_codex":[0.9978758,0.0005167701,0.0001443235,0.0003687062,0.0006331259,0.0004612889],"domain_scores_gemma":[0.9713109,0.02270707,0.001404317,0.001703921,0.001534575,0.001339325],"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.0003528649,0.00007381876,0.001685497,0.0001226009,0.00002847004,0.0001713396,0.0007024168,0.02518904,0.001495701,0.9591621,0.00164021,0.009376048],"study_design_scores_gemma":[0.00003854601,0.00002426064,0.0006424452,0.00001459906,0.00002636344,0.0001036311,0.0001655972,0.07766016,0.0008791466,0.9196923,0.0007262231,0.00002685054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7714636,0.0006367267,0.1854285,0.003255471,0.00009766201,0.000092326,0.001516311,0.0004066965,0.03710276],"genre_scores_gemma":[0.9850449,0.0002667556,0.007471853,0.0001149605,0.00008498486,0.00007568044,0.0007106831,0.00008701989,0.006143149],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01422142,"threshold_uncertainty_score":0.04757541,"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","authors":[{"name":"James D. Currie","is_ca":true},{"name":"Terry I. Visentin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007223268,0.0007585735,0.0009568066,0.001744625,0.001811787,0.002758277,0.001080736,0.001460163,0.01242277],"category_scores_gemma":[0.003827529,0.0007040426,0.0008750207,0.001864173,0.002128848,0.005184954,0.002955326,0.001763304,0.0015329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000725772,"about_ca_system_score_gemma":0.0004791864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004984434,"about_ca_topic_score_gemma":0.0004969704,"domain_scores_codex":[0.9987082,0.0003014756,0.0001065609,0.0002721546,0.0003109852,0.0003005423],"domain_scores_gemma":[0.9967344,0.001901209,0.0003813883,0.0004228361,0.0002931991,0.0002668312],"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.0001287962,0.00003414784,0.0003857065,0.00006835454,0.00001043538,0.000393012,0.0005920791,0.0009634569,0.002498493,0.9820694,0.001270009,0.01158612],"study_design_scores_gemma":[0.00002411528,0.00002430254,0.0002042963,0.00001530175,0.000007885187,0.0003663274,0.0001281218,0.003483044,0.0007331534,0.9921744,0.002824854,0.00001431496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6338987,0.0009659952,0.2535164,0.001851198,0.0007440717,0.0001184631,0.0005720424,0.0006770638,0.107656],"genre_scores_gemma":[0.9151036,0.0004556284,0.03424954,0.000509942,0.000352345,0.0001780596,0.0004846015,0.0002386561,0.04842767],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01242277,"threshold_uncertainty_score":0.04155833,"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","authors":[{"name":"John Aycock","is_ca":true},{"name":"Angelo Borsotti","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006726165,0.001761782,0.002104113,0.002082978,0.001819818,0.005298122,0.003568408,0.003750613,0.02514048],"category_scores_gemma":[0.01469206,0.003233499,0.001455618,0.002664943,0.002303035,0.01114777,0.004176717,0.004269903,0.007914979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00193703,"about_ca_system_score_gemma":0.003475239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006348438,"about_ca_topic_score_gemma":0.006265264,"domain_scores_codex":[0.9953181,0.001235522,0.000462564,0.00109336,0.001330606,0.0005599317],"domain_scores_gemma":[0.9841287,0.01141411,0.0003985078,0.002147851,0.001685966,0.0002248128],"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.001984278,0.0002569928,0.004191349,0.001033419,0.0001321217,0.003102948,0.004551397,0.0104652,0.03406305,0.4961763,0.06395022,0.3800928],"study_design_scores_gemma":[0.0002847592,0.0002263882,0.001796195,0.0003874969,0.0005580411,0.001613363,0.0009460551,0.160953,0.1715405,0.5073641,0.1538778,0.0004522679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05127667,0.0006818679,0.8460914,0.002538695,0.0007371977,0.0001911643,0.002124063,0.06718192,0.02917697],"genre_scores_gemma":[0.4552094,0.000693002,0.4778767,0.001409594,0.0005457345,0.0001446145,0.002911695,0.02669277,0.03451649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02514048,"threshold_uncertainty_score":0.08410335,"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","authors":[{"name":"Alex Aravind","is_ca":true},{"name":"Wim H. Hesselink","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001414223,0.0006262652,0.001455583,0.0009157709,0.001209165,0.002259332,0.002520762,0.001275709,0.01068595],"category_scores_gemma":[0.003472895,0.0005691248,0.0005167774,0.001426495,0.0008478198,0.003082268,0.002717605,0.002251005,0.001527654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001129541,"about_ca_system_score_gemma":0.002544857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001242605,"about_ca_topic_score_gemma":0.002324894,"domain_scores_codex":[0.999267,0.0002060237,0.00003890657,0.0001315982,0.0002167767,0.0001396014],"domain_scores_gemma":[0.9988641,0.0004473917,0.00008249311,0.0002801442,0.0001848832,0.0001409847],"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.003099609,0.0009097526,0.0008421912,0.0005349761,0.0001078606,0.0001619666,0.0002553146,0.1816469,0.00849532,0.422179,0.01713504,0.3646322],"study_design_scores_gemma":[0.0004001529,0.0002392512,0.0002074357,0.00003649406,0.00003837453,0.000110165,0.0000772939,0.814858,0.005323487,0.1710776,0.00760159,0.00003013942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03661511,0.0005090507,0.9502811,0.0006563758,0.000341122,0.00009358988,0.0001257943,0.001107893,0.01027001],"genre_scores_gemma":[0.3455736,0.000270558,0.6324722,0.0002189964,0.000148247,0.0002065386,0.0003485951,0.0004461761,0.02031516],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01068595,"threshold_uncertainty_score":0.03574806,"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","authors":[{"name":"Stavros Konstantinidis","is_ca":true},{"name":"Nicolae Sântean","is_ca":true},{"name":"Sheng Yü","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002654731,0.0006050547,0.001008629,0.002054963,0.001599259,0.004900941,0.001693644,0.00107351,0.007096879],"category_scores_gemma":[0.005880918,0.0007255403,0.001785527,0.002524824,0.003890117,0.009858115,0.005041657,0.002929515,0.0009362574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001419877,"about_ca_system_score_gemma":0.0007087056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007982198,"about_ca_topic_score_gemma":0.0006155525,"domain_scores_codex":[0.9964396,0.001021826,0.0004362743,0.00100919,0.0005332567,0.0005598143],"domain_scores_gemma":[0.9946339,0.002176379,0.000445837,0.001411327,0.001013923,0.0003187101],"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.00004360062,0.0000228546,0.0001322423,0.00002572868,0.000007071651,0.00003808659,0.0003681275,0.0008065908,0.001019613,0.9876802,0.0003874273,0.009468535],"study_design_scores_gemma":[0.00001924762,0.00004191028,0.0002448722,0.00001696558,0.0000239901,0.0001006287,0.0001733628,0.009851759,0.002016446,0.9833213,0.004167173,0.00002221059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1433998,0.0006988019,0.817077,0.0008623058,0.0002506892,0.00006792622,0.0004881381,0.001208017,0.03594732],"genre_scores_gemma":[0.8828164,0.0005384885,0.09877397,0.0002876788,0.0003883914,0.0001528527,0.0008492009,0.0003690812,0.0158239],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007096879,"threshold_uncertainty_score":0.02374142,"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","authors":[{"name":"James D. Currie","is_ca":true},{"name":"Erica E. M. Moodie","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003105169,0.0006472372,0.0005515398,0.0006220802,0.002327446,0.00160582,0.0005719289,0.00166727,0.01422832],"category_scores_gemma":[0.001153119,0.0003580794,0.0007672431,0.0007398831,0.001663767,0.001679026,0.001076344,0.00112706,0.004438358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005681769,"about_ca_system_score_gemma":0.0007603807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003840853,"about_ca_topic_score_gemma":0.0005161763,"domain_scores_codex":[0.999499,0.00007401086,0.00005041185,0.000132699,0.00009064896,0.0001531947],"domain_scores_gemma":[0.9989508,0.0003397661,0.0001575634,0.0001566766,0.0002442611,0.0001508936],"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.0008916582,0.0001598431,0.001120323,0.0005046854,0.00005924023,0.006856649,0.00391378,0.0008077358,0.08630811,0.8265266,0.01183822,0.06101306],"study_design_scores_gemma":[0.0001289586,0.0007783697,0.002513974,0.0002700412,0.0001203573,0.006249651,0.002756532,0.005099197,0.05570849,0.7657132,0.1604891,0.0001721237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6657583,0.0009059437,0.1115972,0.002971009,0.002846587,0.0002364536,0.0010133,0.002259723,0.2124114],"genre_scores_gemma":[0.8510399,0.0002413427,0.06013019,0.0007077799,0.0003003034,0.0001759012,0.0009640137,0.0003592208,0.08608134],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01422832,"threshold_uncertainty_score":0.04759848,"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","authors":[{"name":"Stavros Konstantinidis","is_ca":true},{"name":"António Machiavelo","is_ca":false},{"name":"Nelma Moreira","is_ca":false},{"name":"Rogério Reis","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008167137,0.0007354239,0.003078426,0.002160868,0.002217239,0.007621635,0.003687517,0.003669975,0.01161246],"category_scores_gemma":[0.06603964,0.001196097,0.001299931,0.002782556,0.008592311,0.02855769,0.004759311,0.005160015,0.0005973342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002740684,"about_ca_system_score_gemma":0.00172612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001252156,"about_ca_topic_score_gemma":0.0008261171,"domain_scores_codex":[0.994303,0.002655575,0.000353188,0.0009702125,0.001130245,0.0005877488],"domain_scores_gemma":[0.8226803,0.1618473,0.003224176,0.005868383,0.002725639,0.003654247],"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.0003872408,0.0001189659,0.001683183,0.000161994,0.00003491089,0.0001533104,0.0006064139,0.01162759,0.001377937,0.966771,0.003278361,0.01379918],"study_design_scores_gemma":[0.0000368867,0.00002337624,0.0002366209,0.00001650283,0.00001220416,0.00007754236,0.00009931231,0.02768641,0.0004128753,0.9707618,0.0006174907,0.0000189288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6280048,0.002756074,0.2933418,0.02629715,0.0004289653,0.0001382051,0.00153755,0.0008187995,0.04667662],"genre_scores_gemma":[0.9668145,0.0007128111,0.02376136,0.0005992395,0.0005105106,0.0001446566,0.000512693,0.0002950092,0.006649255],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01161246,"threshold_uncertainty_score":0.04319245,"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","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Manasi S. Kulkarni","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002392316,0.0004572039,0.0009319098,0.002664138,0.002950917,0.006603005,0.001627488,0.001055901,0.005436183],"category_scores_gemma":[0.01074482,0.0009263592,0.001458567,0.002289252,0.005387526,0.008095648,0.002640451,0.002369439,0.0005547524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00103251,"about_ca_system_score_gemma":0.0004669268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005175235,"about_ca_topic_score_gemma":0.0004269337,"domain_scores_codex":[0.9970292,0.000686662,0.0003365968,0.0008776387,0.0007536661,0.0003161869],"domain_scores_gemma":[0.9865279,0.009351639,0.0009572219,0.001050101,0.001247502,0.0008657025],"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.0001747484,0.00003902578,0.001273503,0.00008526551,0.00003273741,0.0003227008,0.001307989,0.00102054,0.003649318,0.9856793,0.0004830694,0.005931902],"study_design_scores_gemma":[0.00003984507,0.00004155784,0.0008463837,0.00002727125,0.00003131887,0.0005447295,0.0004692663,0.006810581,0.002934696,0.9846312,0.003595738,0.00002740408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6064214,0.001102712,0.3286216,0.00131042,0.000212116,0.0001163489,0.001181528,0.000394562,0.06063941],"genre_scores_gemma":[0.9401403,0.0003101624,0.05096184,0.00030256,0.0002132223,0.0001910625,0.001148401,0.0001239901,0.006608366],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006603005,"threshold_uncertainty_score":0.01818585,"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","authors":[{"name":"Jürgen Dassow","is_ca":false},{"name":"Gheorghe Pǎun","is_ca":false},{"name":"G. Thierrin","is_ca":true},{"name":"Sheng Yü","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001610013,0.0007020611,0.000926008,0.00361672,0.002793997,0.00615566,0.001227292,0.002111823,0.01135716],"category_scores_gemma":[0.005325781,0.0009876315,0.001692099,0.004476658,0.003835218,0.009324581,0.003639111,0.00273185,0.002557997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002081001,"about_ca_system_score_gemma":0.0008083558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002371369,"about_ca_topic_score_gemma":0.002232832,"domain_scores_codex":[0.9979651,0.0006034965,0.0001570978,0.0004712598,0.000506633,0.0002963529],"domain_scores_gemma":[0.9962291,0.002018114,0.0002674843,0.000511052,0.0006466861,0.0003275424],"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.00001555457,0.00000724574,0.000187679,0.00002909501,0.000007782282,0.00007150906,0.0002567492,0.0007191675,0.0003903397,0.9936227,0.0006387998,0.004053328],"study_design_scores_gemma":[0.00001128917,0.000007465254,0.0001506497,0.00001453019,0.00001106835,0.0001024387,0.00008768325,0.003815665,0.0003533878,0.9887061,0.006726654,0.00001305816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1365742,0.002748496,0.7897645,0.001988458,0.0003748416,0.000107835,0.001382398,0.001528829,0.06553044],"genre_scores_gemma":[0.7559925,0.001806989,0.2072667,0.0004460698,0.0002445415,0.0002313136,0.001813842,0.0005838298,0.03161419],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01135716,"threshold_uncertainty_score":0.03799349,"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","authors":[{"name":"Michael Lamoureux","is_ca":true},{"name":"Bradford G. Nickerson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002203973,0.0008178362,0.002009232,0.001766498,0.001611626,0.002030602,0.003525391,0.001550174,0.01299001],"category_scores_gemma":[0.01059145,0.0008501885,0.0009545448,0.003206991,0.0009150961,0.003880775,0.00430724,0.001519045,0.003598546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001101098,"about_ca_system_score_gemma":0.003851335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004335747,"about_ca_topic_score_gemma":0.007821101,"domain_scores_codex":[0.9978577,0.0005266558,0.0002398406,0.0003229065,0.0007265023,0.0003264303],"domain_scores_gemma":[0.9940506,0.002791187,0.0002512995,0.001604001,0.001049641,0.000253219],"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.002549252,0.0004134935,0.002082944,0.0008723914,0.0001276348,0.0002171767,0.0003198759,0.2077917,0.007596912,0.07541709,0.02928488,0.6733266],"study_design_scores_gemma":[0.0002246479,0.0002933221,0.0002883189,0.00007081377,0.00006889961,0.0001295937,0.00007887591,0.8929481,0.00398152,0.0946041,0.007252585,0.00005912284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01836815,0.0006741803,0.9722053,0.0002661037,0.0001138424,0.0001766441,0.0007908507,0.003515775,0.003889134],"genre_scores_gemma":[0.2010265,0.0003964143,0.787095,0.0002812185,0.00009645784,0.0005116703,0.002292781,0.0005610886,0.00773891],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01299001,"threshold_uncertainty_score":0.0434559,"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","authors":[{"name":"Debajyoti Mondal","is_ca":true},{"name":"Md. Saidur Rahman","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004563472,0.0005267516,0.001065855,0.001900946,0.001280333,0.002738909,0.001133592,0.001394233,0.009690197],"category_scores_gemma":[0.003245818,0.0006401163,0.0006647735,0.002012431,0.001547459,0.003574208,0.001685178,0.0020842,0.001654901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009253853,"about_ca_system_score_gemma":0.000537294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003639054,"about_ca_topic_score_gemma":0.004288491,"domain_scores_codex":[0.9995926,0.0001026164,0.0000142107,0.00007944753,0.0001078824,0.000103378],"domain_scores_gemma":[0.9981177,0.0009293847,0.0002694737,0.000164235,0.0002493787,0.0002698477],"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.0002330958,0.00006811335,0.0008947302,0.0001498276,0.00002283005,0.0001981359,0.0006516475,0.008172369,0.003545736,0.9606991,0.007537086,0.01782732],"study_design_scores_gemma":[0.00002949775,0.00002838822,0.0007437497,0.00004830606,0.00001775365,0.0001498448,0.0002407666,0.02757341,0.0007886419,0.966556,0.003812944,0.00001080033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7609815,0.001633231,0.1325251,0.002072342,0.000135522,0.0001092364,0.001180442,0.0003805925,0.100982],"genre_scores_gemma":[0.9300653,0.001746611,0.04533667,0.0007266363,0.0002073977,0.00009617819,0.001722163,0.000314094,0.0197849],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009690197,"threshold_uncertainty_score":0.03241694,"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","authors":[{"name":"Alon Efrat","is_ca":false},{"name":"William Evans","is_ca":true},{"name":"Kassian Köck","is_ca":false},{"name":"Stephen Kobourov","is_ca":false},{"name":"Jacob Miller","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008877047,0.0009957502,0.001092342,0.001336397,0.0005667712,0.001751958,0.001077376,0.0007005055,0.004870236],"category_scores_gemma":[0.005036995,0.0005712615,0.0007449637,0.001479857,0.0004524776,0.002556538,0.001970984,0.001114276,0.0007793033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001003989,"about_ca_system_score_gemma":0.0005153202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002648747,"about_ca_topic_score_gemma":0.002678657,"domain_scores_codex":[0.9991531,0.000337255,0.00004657388,0.0001637851,0.0001860759,0.0001132195],"domain_scores_gemma":[0.9972615,0.001421125,0.0002513291,0.0004003671,0.0003914872,0.0002741686],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002187032,0.0002952457,0.002997975,0.001025825,0.0001775269,0.000971953,0.001119427,0.4924259,0.1114558,0.1054083,0.03280672,0.2491282],"study_design_scores_gemma":[0.00009084436,0.0000895224,0.0008585867,0.0000657391,0.00002382275,0.0001819762,0.000201218,0.8961655,0.01554107,0.07646335,0.0102835,0.00003485525],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07198087,0.000696019,0.9144925,0.0007265194,0.00008840871,0.0001009365,0.001219293,0.006638206,0.004057178],"genre_scores_gemma":[0.4401804,0.0007351367,0.5529102,0.0001490766,0.00004680929,0.0002395443,0.001927653,0.001253181,0.002557963],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004870236,"threshold_uncertainty_score":0.01629257,"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","authors":[{"name":"Marek Chrobák","is_ca":false},{"name":"Mordecai J. Golin","is_ca":false},{"name":"J. Ian Munro","is_ca":true},{"name":"Neal E. Young","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001383154,0.0005766241,0.0008737235,0.001224942,0.0007771679,0.001194541,0.001814123,0.001144915,0.005252604],"category_scores_gemma":[0.005602912,0.0004619261,0.0007543205,0.00219495,0.001028129,0.002852273,0.002286654,0.001716859,0.001242234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001161242,"about_ca_system_score_gemma":0.002040464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003922618,"about_ca_topic_score_gemma":0.004886625,"domain_scores_codex":[0.9986449,0.0003376829,0.00009906114,0.0002869342,0.0004313012,0.0002001531],"domain_scores_gemma":[0.9983639,0.000775673,0.00008399516,0.000367613,0.0003404748,0.00006830582],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007378787,0.000161362,0.001294894,0.0002236116,0.00007696641,0.0003023215,0.0005859418,0.1070438,0.01424405,0.2250766,0.01443763,0.635815],"study_design_scores_gemma":[0.0002950748,0.0001527377,0.0004306451,0.00004794163,0.0000469446,0.0002046662,0.0001728593,0.7116011,0.01027425,0.2587397,0.01798634,0.00004782459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04101315,0.0003712907,0.9503887,0.0007432023,0.0001152654,0.0002606851,0.0001538912,0.001661128,0.005292648],"genre_scores_gemma":[0.1633267,0.0001578244,0.8304384,0.0002424575,0.0000532805,0.0002687907,0.0004550444,0.0004083808,0.004649092],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005252604,"threshold_uncertainty_score":0.01757169,"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","authors":[{"name":"Cezar Câmpeanu","is_ca":true},{"name":"Nicolae Sântean","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007591623,0.0009325214,0.002575401,0.003409391,0.005215161,0.009536231,0.002313422,0.00239034,0.007289309],"category_scores_gemma":[0.02057724,0.001517808,0.00362409,0.002564183,0.008687785,0.02119669,0.006988199,0.00549254,0.0008850115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002436523,"about_ca_system_score_gemma":0.002166436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001360908,"about_ca_topic_score_gemma":0.0005980646,"domain_scores_codex":[0.9918507,0.002109459,0.0007973684,0.001950201,0.001934222,0.001357957],"domain_scores_gemma":[0.9740024,0.01614425,0.002527128,0.001810266,0.00305478,0.002461239],"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.00059404,0.0001306428,0.001204426,0.00008907146,0.00004281475,0.0005798774,0.00262038,0.001020072,0.002696719,0.9819658,0.0008237438,0.008232372],"study_design_scores_gemma":[0.00008306294,0.0001444904,0.0006374092,0.00005770152,0.00005219718,0.0006921829,0.0008371572,0.006508056,0.002433153,0.9853477,0.003155895,0.00005089495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6447857,0.001757566,0.2765168,0.003477121,0.000583783,0.0002087647,0.0009764085,0.001240807,0.07045307],"genre_scores_gemma":[0.9361898,0.0009935832,0.04556175,0.000700113,0.0007833411,0.0003087015,0.001427654,0.0006802087,0.01335488],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009536231,"threshold_uncertainty_score":0.04014879,"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","authors":[{"name":"Andrew Bloch-Hansen","is_ca":true},{"name":"Roberto Solis-Oba","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005969375,0.001045078,0.001233884,0.0009027721,0.001101763,0.002044138,0.001459714,0.002170968,0.01343059],"category_scores_gemma":[0.002919667,0.0005474866,0.0008215538,0.001891922,0.001098838,0.003248504,0.001398562,0.002051484,0.001073744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009050727,"about_ca_system_score_gemma":0.0006070226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00240454,"about_ca_topic_score_gemma":0.001732359,"domain_scores_codex":[0.9995835,0.0001036038,0.00002068316,0.0001063563,0.00006927756,0.0001165475],"domain_scores_gemma":[0.9987242,0.00071854,0.0001439903,0.0001520933,0.00009942707,0.0001618562],"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.0005179456,0.0002976017,0.0009842613,0.0004854599,0.00007251029,0.001033592,0.0003498544,0.3133665,0.007505259,0.5587986,0.02413201,0.09245649],"study_design_scores_gemma":[0.00007747914,0.0001248084,0.0006181098,0.00005404625,0.00003502966,0.000432879,0.0002842972,0.436996,0.003821583,0.5476769,0.00984686,0.00003205031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4621255,0.0008320725,0.4291863,0.002450683,0.0003649994,0.0002018954,0.001340498,0.000388839,0.1031092],"genre_scores_gemma":[0.8153333,0.001427854,0.1250318,0.000421252,0.0002642445,0.0001948644,0.001886371,0.00036377,0.05507658],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01343059,"threshold_uncertainty_score":0.0449298,"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","authors":[{"name":"Zhengyang Lu","is_ca":true},{"name":"Joel D. Day","is_ca":false},{"name":"Piyush Jha","is_ca":false},{"name":"Paul Sarnighausen-Cahn","is_ca":false},{"name":"Stefan Siemer","is_ca":false},{"name":"Florín Manea","is_ca":false},{"name":"Vijay Ganesh","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001258939,0.001033788,0.0006907267,0.001286382,0.000446145,0.001044203,0.001297884,0.001081083,0.01100072],"category_scores_gemma":[0.005354581,0.0005760792,0.001226267,0.0009693312,0.000855341,0.001119302,0.001347464,0.001114475,0.002022506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001049429,"about_ca_system_score_gemma":0.002754979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00355138,"about_ca_topic_score_gemma":0.006956123,"domain_scores_codex":[0.9990507,0.0002722864,0.00007103975,0.0001739541,0.0003333749,0.00009878878],"domain_scores_gemma":[0.9981981,0.001240635,0.0001105646,0.0001480463,0.0002434512,0.00005920041],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002160064,0.0001406432,0.001794697,0.0005381597,0.000093549,0.0002778265,0.0002296288,0.5115232,0.01214351,0.0800471,0.008295622,0.3847],"study_design_scores_gemma":[0.0000470312,0.00004047451,0.00006047306,0.00002915798,0.00001542858,0.00004289021,0.00002295163,0.9787724,0.002669837,0.01446859,0.003824124,0.000006631258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008179506,0.0001524617,0.9846814,0.0001257962,0.00003424046,0.0001347632,0.0001574274,0.002023056,0.004511354],"genre_scores_gemma":[0.1305401,0.0001269184,0.8659161,0.0001386424,0.00001700867,0.0002394946,0.000451588,0.0005543751,0.002015726],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01100072,"threshold_uncertainty_score":0.0368011,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}