{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":58,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":58,"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":"82ccd528164e","filters":{"venue":"The Computer Journal"}},"results":[{"id":"W2155056246","doi":"10.1093/comjnl/bxs018","title":"A Source Code Similarity System for Plagiarism Detection","year":2012,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Academic integrity and plagiarism","field":"Social Sciences","cited_by":109,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Athabasca University","funders":"","keywords":"Library science; Computer science; Similarity (geometry); Information retrieval; Source code; World Wide Web; Database; Operating system; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03357069603471791,"gpt":0.294971855487683,"spread":0.2614011594529651,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.006118626,0.00008848985,0.000126659,0.00004160528,0.002070225,0.0001571902,0.0004102248,0.0004162097,0.00002219652],"category_scores_gemma":[0.0001102482,0.0000607667,0.0001201236,0.00009306213,0.0001143268,0.000232105,0.00004493108,0.0017157,0.00003468674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001836982,"about_ca_system_score_gemma":0.00007123258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001503071,"about_ca_topic_score_gemma":0.00006730249,"domain_scores_codex":[0.9983636,0.0005795202,0.0002103426,0.00007957988,0.0003233041,0.00044371],"domain_scores_gemma":[0.9989201,0.0005134419,0.0001636949,0.00009522343,0.0001323165,0.0001751529],"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.0002886022,0.0001879853,0.006805251,0.0001199053,0.0004072468,0.000006816102,0.2242665,0.001082013,0.0006143552,0.1677851,0.1329468,0.4654895],"study_design_scores_gemma":[0.0005418913,0.00006857843,0.001128621,0.0000753206,0.00008889884,0.0004494315,0.006299549,0.01729472,0.0006097971,0.005079003,0.9681095,0.0002547132],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03398203,0.0002409163,0.955578,0.003316255,0.004116686,0.0002165539,0.000004867695,0.00008440032,0.002460286],"genre_scores_gemma":[0.9860751,0.00002672533,0.002693725,0.0007274063,0.01002367,0.000005364284,6.528538e-7,0.000009273996,0.000438097],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9528843,"threshold_uncertainty_score":0.999229,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158156456","doi":"10.1093/comjnl/bxm034","title":"Parameterized Complexity in Cognitive Modeling: Foundations, Applications and Opportunities","year":2007,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Cognitive Science and Mapping","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universiteit Eindhoven","keywords":"Parameterized complexity; Computer science; Cognition; Library science; Cognitive science; Information retrieval; Psychology; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.2729334040908656,"gpt":0.3571283984029792,"spread":0.08419499431211358,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001819916,0.00009860863,0.0001218564,0.00019393,0.000490446,0.000440642,0.0005285129,0.00002314751,0.000005988039],"category_scores_gemma":[0.000018836,0.00007329349,0.00003856979,0.000263608,0.0001945596,0.0005833516,0.0002911272,0.0002636993,0.000005782497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002911278,"about_ca_system_score_gemma":0.00008339861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009326484,"about_ca_topic_score_gemma":0.00001747167,"domain_scores_codex":[0.9989353,0.0001012769,0.0002904409,0.0001931701,0.0002082752,0.0002715258],"domain_scores_gemma":[0.9991348,0.0003093506,0.0001000274,0.000158211,0.0001859722,0.0001116531],"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.00001527683,0.00007393772,0.0003062162,0.000004766047,0.0000210235,0.00003843843,0.002793092,0.0001788676,0.0000817063,0.07993651,0.00007712639,0.916473],"study_design_scores_gemma":[0.0007628931,0.00007177008,0.005185844,0.00006877015,0.00001013713,0.0007294749,0.0007693438,0.8249798,0.00003418903,0.1656528,0.001509804,0.0002251539],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05406054,0.0001252214,0.9420506,0.002562177,0.0001344191,0.0001818288,0.000001037779,0.00003241262,0.0008517797],"genre_scores_gemma":[0.9522129,0.000127987,0.04568844,0.00174025,0.0001871452,0.000009779365,0.000001725349,0.000003761024,0.00002803345],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9162479,"threshold_uncertainty_score":0.4249121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017809384","doi":"10.1093/comjnl/bxm116","title":"An Introduction to Reversible Latches","year":2008,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Power consumption; Power (physics); Electrical engineering; Engineering; Physics; Thermodynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.01334348157824486,"gpt":0.2281239872367485,"spread":0.2147805056585037,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000557856,0.0001217766,0.0001256277,0.0001154379,0.0008431299,0.0002489792,0.001439391,0.00002745419,0.000009133843],"category_scores_gemma":[0.000008605422,0.00007808129,0.00007055851,0.0003800273,0.0000419959,0.0003291624,0.0002560771,0.0004001696,0.00005395265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002929622,"about_ca_system_score_gemma":0.00005959871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004240649,"about_ca_topic_score_gemma":5.93215e-7,"domain_scores_codex":[0.9988238,0.0001634071,0.0001882307,0.0002600379,0.0002806375,0.0002839095],"domain_scores_gemma":[0.9990136,0.00004621191,0.00007874766,0.0005751382,0.00009726717,0.0001890117],"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.00002607621,0.0001834097,0.0004007454,0.00000532041,0.00006162028,0.00024506,0.0143668,0.299892,0.001176215,0.008240815,0.2062112,0.4691907],"study_design_scores_gemma":[0.0002895517,0.0005471465,0.009262388,0.00001419864,0.000005212141,0.01036137,0.00001882188,0.9172837,0.0006473574,0.006250576,0.05504671,0.0002729481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2061859,0.00003465927,0.7653236,0.0265993,0.001666848,0.0000513454,1.984071e-7,0.0001063422,0.00003182626],"genre_scores_gemma":[0.4445885,0.00001457021,0.5408983,0.002934704,0.01138491,0.000001182272,5.839678e-7,0.00001357127,0.0001637283],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6173917,"threshold_uncertainty_score":0.6484759,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971911274","doi":"10.1093/comjnl/bxu148","title":"Annotated Control Flow Graph for Metamorphic Malware Detection","year":2014,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Malware; Computer science; Library science; Control flow; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.00841837464510147,"gpt":0.2215254810976054,"spread":0.2131071064525039,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001196543,0.0001938127,0.0002357261,0.000208233,0.0006421117,0.0003461971,0.00112493,0.00006724751,0.00000600177],"category_scores_gemma":[0.00006298287,0.000134005,0.0002174048,0.0003624843,0.00005542148,0.0004597724,0.0001181065,0.0004029049,0.00001313091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004988948,"about_ca_system_score_gemma":0.00002480636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001694313,"about_ca_topic_score_gemma":0.000002790359,"domain_scores_codex":[0.9984517,0.0002908304,0.0003533509,0.0002817049,0.0002658803,0.0003564993],"domain_scores_gemma":[0.9983963,0.0003226359,0.0002746632,0.000519686,0.0003696032,0.0001170819],"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.00006239822,0.00003212501,0.0000181644,0.00001110901,0.00009455951,0.000007584605,0.0001907352,0.01367746,0.003247774,0.004090013,0.00241092,0.9761571],"study_design_scores_gemma":[0.001080039,0.0005649636,0.0004388787,0.00001872852,0.00002652225,0.0009951929,0.000003410861,0.8770071,0.01113372,0.09559315,0.0129068,0.0002314668],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001227547,0.00007629286,0.9948456,0.001413272,0.001544341,0.0003343453,0.000002462542,0.0005261296,0.00003004007],"genre_scores_gemma":[0.6462036,0.00001346793,0.351489,0.00138805,0.0008142063,0.00004295456,6.539942e-7,0.0000197189,0.00002835392],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9759257,"threshold_uncertainty_score":0.5464565,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026184507","doi":"10.1093/comjnl/bxm096","title":"The Effect of the Distributed Test Architecture on the Power of Testing","year":2007,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Observability; Controllability; Finite-state machine; Computer science; Equivalence (formal languages); Conformance testing; Architecture; Mathematics; Algorithm; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01203245191790277,"gpt":0.2411612543432611,"spread":0.2291288024253583,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004600862,0.0001638697,0.0001711065,0.00004278666,0.0008160158,0.0001683491,0.002994733,0.0000409809,0.000001260374],"category_scores_gemma":[0.001833885,0.00005273254,0.0001602706,0.0005864032,0.0002692326,0.00004294717,0.0005453811,0.0007641062,0.000001809966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002873529,"about_ca_system_score_gemma":0.00004744054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008413074,"about_ca_topic_score_gemma":0.000001183571,"domain_scores_codex":[0.9982392,0.0004362071,0.0003750853,0.0001408312,0.00049553,0.0003131489],"domain_scores_gemma":[0.9789176,0.0194368,0.0004555706,0.0009778477,0.0001649642,0.00004721305],"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.0001425993,0.0002191494,0.09781213,0.00004986339,0.0002255622,0.00006026448,0.004087463,0.005621076,0.002244285,0.008141104,0.09775137,0.7836452],"study_design_scores_gemma":[0.001903207,0.008811815,0.4910167,0.002823208,0.0001431464,0.006437279,0.00004271641,0.1294718,0.08041006,0.2734515,0.004504855,0.0009836811],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1655219,0.0001397679,0.8273381,0.005315108,0.0006989802,0.000258195,0.000003230136,0.0004344258,0.0002902602],"genre_scores_gemma":[0.9850399,0.000001561299,0.01437865,0.0003532142,0.0002041387,0.000002002561,1.203041e-7,0.000009312205,0.00001110635],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.819518,"threshold_uncertainty_score":0.6276216,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030553922","doi":"10.1093/comjnl/bxp073","title":"Fault Coverage-Driven Incremental Test Generation","year":2009,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Test suite; Fault coverage; Computer science; Generalization; Completeness (order theory); Test case; Finite-state machine; Fault (geology); Algorithm; Automatic test pattern generation; Test (biology); Code coverage; Programming language; Mathematics; Software; Machine learning; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02684795604525467,"gpt":0.2612589342968718,"spread":0.2344109782516171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004881779,0.0001218801,0.0001079566,0.00007353425,0.0004537809,0.0006225308,0.001038958,0.0000348161,0.000005859772],"category_scores_gemma":[0.00005542429,0.00008185911,0.00006671166,0.0001749014,0.00002344749,0.0003617926,0.0001536048,0.0003047714,0.00002739822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006086713,"about_ca_system_score_gemma":0.00004703595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004362009,"about_ca_topic_score_gemma":5.182861e-7,"domain_scores_codex":[0.9989848,0.0001019633,0.0002242124,0.0001705255,0.0002987792,0.0002197688],"domain_scores_gemma":[0.9991516,0.0001709447,0.0001318326,0.0003679686,0.00009794876,0.00007963824],"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.000003103951,0.0001508294,0.002051103,0.000001495061,0.00001776378,0.00009219054,0.0008225388,0.002306354,0.002445939,0.002735811,0.3502071,0.6391658],"study_design_scores_gemma":[0.0003916076,0.0006007895,0.008791755,0.0000428842,0.000008554766,0.002469827,0.000001069209,0.9334044,0.001584447,0.05079427,0.001662178,0.0002482122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01905352,0.00006952461,0.9746991,0.00371502,0.0005041243,0.00007248657,5.212725e-7,0.001640713,0.0002449697],"genre_scores_gemma":[0.7429659,0.00001644155,0.2521612,0.003687617,0.001135147,0.00000111131,0.000001179595,0.000004914715,0.00002647436],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.931098,"threshold_uncertainty_score":0.6003078,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1911143988","doi":"10.1093/comjnl/bxv039","title":"Narrowing the Complexity Gap for Colouring (<i>C<sub>s</sub>, P<sub>t</sub></i>)-Free Graphs","year":2015,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Library science; Computer science; Media studies; Sociology","retraction":null,"screen_n_in":null,"score":{"opus":0.09799493135422839,"gpt":0.3015809355838471,"spread":0.2035860042296188,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00600085,0.0004573751,0.0004844439,0.0003198187,0.002095739,0.001147821,0.006902678,0.00011385,0.000002084657],"category_scores_gemma":[0.0002585228,0.0002930718,0.0004801709,0.001004232,0.0008088706,0.001122598,0.002417318,0.001479797,0.00005015378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002078224,"about_ca_system_score_gemma":0.0003199661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002950689,"about_ca_topic_score_gemma":0.00001813752,"domain_scores_codex":[0.9948785,0.001118794,0.0007193545,0.0006320718,0.001324853,0.001326387],"domain_scores_gemma":[0.9951364,0.001168246,0.0004423842,0.001920808,0.0007336657,0.000598438],"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.0007149627,0.0005167944,0.0006997654,0.0001039592,0.0007857403,0.0003920945,0.01190943,0.02211395,0.09587763,0.5277371,0.08786553,0.251283],"study_design_scores_gemma":[0.002230413,0.0004543908,0.0009105555,0.0001017262,0.00003232409,0.001627777,0.0001571959,0.08433868,0.0429776,0.8648075,0.001866623,0.0004952208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3171371,0.0004467231,0.6725615,0.007140261,0.00176656,0.0006013396,0.000008287363,0.0001779424,0.00016029],"genre_scores_gemma":[0.9491031,0.00008677718,0.04688964,0.002182825,0.001582558,0.00006203954,0.000002882058,0.00007630826,0.00001394575],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6319659,"threshold_uncertainty_score":0.9999521,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030187589","doi":"10.1093/comjnl/bxm053","title":"Parameterized Complexity of Geometric Problems","year":2007,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Parameterized complexity; Computer science; Theoretical computer science; Computational geometry; Graph; Geometric modeling; Computational complexity theory; Algorithm; Mathematical optimization; Mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.06078954693481944,"gpt":0.2733559608578666,"spread":0.2125664139230472,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002306503,0.0001110265,0.0001764147,0.0003677681,0.0002538302,0.0001721688,0.001001991,0.00003356624,0.00001735683],"category_scores_gemma":[0.00003081437,0.00007474455,0.0001179196,0.001263755,0.0001038312,0.0003016477,0.0002380839,0.0002463761,0.00001535145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003365251,"about_ca_system_score_gemma":0.00006300297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003983018,"about_ca_topic_score_gemma":0.000001602791,"domain_scores_codex":[0.9985207,0.000129493,0.0004771921,0.0001587765,0.0004541514,0.0002597163],"domain_scores_gemma":[0.9986836,0.0003253688,0.0003086847,0.0003082303,0.0002693509,0.0001047458],"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.00005083762,0.0003406148,0.0006378393,0.00003248957,0.0001537506,0.00003803589,0.001494772,0.03883338,0.004610004,0.1118293,0.00434675,0.8376322],"study_design_scores_gemma":[0.002586665,0.0009920497,0.1187447,0.00007999324,0.00003762673,0.003257528,0.00002817179,0.6154374,0.0140945,0.2297955,0.01433641,0.0006094343],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09303594,0.0002049306,0.9046516,0.0008009416,0.0008825056,0.0001048701,6.245937e-7,0.00003474153,0.0002838083],"genre_scores_gemma":[0.7462589,0.0000149739,0.2529214,0.0003407055,0.0004191911,7.848116e-7,0.000001382962,0.000004303206,0.00003827737],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8370228,"threshold_uncertainty_score":0.3047994,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138341340","doi":"10.1093/comjnl/bxt019","title":"ZIDS: A Privacy-Preserving Intrusion Detection System Using Secure Two-Party Computation Protocols","year":2013,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Intrusion detection system; Set (abstract data type); Protocol (science); Computer security; Automaton; Signature (topology); Data mining; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02449281019642419,"gpt":0.2751257480898439,"spread":0.2506329378934197,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001220698,0.0002446349,0.0003015162,0.0001880538,0.0008688382,0.001814874,0.001692388,0.00007590833,0.00002443683],"category_scores_gemma":[0.00002253005,0.0001599359,0.0002065788,0.000446091,0.00003715831,0.001144696,0.0008677464,0.0006370003,0.00007148115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002284865,"about_ca_system_score_gemma":0.0000671441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004064087,"about_ca_topic_score_gemma":0.000008939626,"domain_scores_codex":[0.9973778,0.0005751498,0.0006791239,0.0003520007,0.0005811642,0.0004347623],"domain_scores_gemma":[0.9983509,0.0001213795,0.0005635192,0.0003611425,0.0004570962,0.0001459988],"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.00002619881,0.0001401107,0.0001720326,0.0001384558,0.0002774769,0.00006792021,0.009352747,0.7491848,0.003677494,0.01403218,0.002813618,0.2201169],"study_design_scores_gemma":[0.0004543311,0.00009632051,0.0002230502,0.0003149274,0.00002008059,0.001096053,0.0001211763,0.9965353,0.0003784647,0.0003355379,0.0002275687,0.0001971921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1496031,0.00002832085,0.8472625,0.0003510939,0.0006909518,0.001842162,1.895218e-7,0.0001541711,0.00006750957],"genre_scores_gemma":[0.9253516,7.119712e-7,0.07310518,0.0001822903,0.001219059,0.0001104455,7.144056e-7,0.00001708262,0.00001294062],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7757485,"threshold_uncertainty_score":0.9992213,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169611088","doi":"10.1093/comjnl/bxm012","title":"User-Oriented Feature Selection for Machine Learning","year":2007,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Beijing; Computer science; Feature selection; Selection (genetic algorithm); Chinese academy of sciences; Library science; China; World Wide Web; Key (lock); Artificial intelligence; Automation; Data science; History; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01219801718629538,"gpt":0.2456373021620377,"spread":0.2334392849757423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001286325,0.0001159409,0.0001151465,0.00008528474,0.0007405522,0.0002929028,0.0006463914,0.0000524551,0.000004971476],"category_scores_gemma":[0.0000178911,0.00006922163,0.0001054539,0.0002968326,0.00001971563,0.0002503996,0.0001353969,0.0005675275,0.000008937533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004552064,"about_ca_system_score_gemma":0.00002786286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002773992,"about_ca_topic_score_gemma":0.00000693321,"domain_scores_codex":[0.9990145,0.00008112762,0.0001806102,0.0001672228,0.0002126203,0.0003438938],"domain_scores_gemma":[0.9993019,0.0001659507,0.0001443852,0.0001596302,0.0001343611,0.00009377578],"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.0001446432,0.0001575332,0.01383726,0.0000159726,0.0001502958,0.00005372396,0.002715775,0.01229825,0.0004329614,0.05110132,0.0494237,0.8696685],"study_design_scores_gemma":[0.0008535658,0.0005162935,0.01210586,0.00001854463,0.00001285928,0.001742769,0.00001610323,0.7051675,0.0002133541,0.004601796,0.2745497,0.0002016613],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007419937,0.000191827,0.9876589,0.00289053,0.00131407,0.0001141247,3.940971e-7,0.00009656022,0.0003137019],"genre_scores_gemma":[0.2610674,0.0000416296,0.7329378,0.002036451,0.003140717,0.000002874646,0.000003650762,0.00001986999,0.0007496114],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8694669,"threshold_uncertainty_score":0.5695804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150574820","doi":"10.1093/comjnl/bxt070","title":"Strongly Universal String Hashing is Fast","year":2013,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hash function; Computer science; Parallel computing; Byte; Dynamic perfect hashing; String (physics); Universal hashing; Theoretical computer science; Arithmetic; Double hashing; Hash table; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01313695057224418,"gpt":0.2130234500110486,"spread":0.1998864994388044,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002755958,0.0001305388,0.0001199793,0.00007368511,0.0005619188,0.001339702,0.001961781,0.00003347539,0.0001144179],"category_scores_gemma":[0.000002734349,0.00008122753,0.00007682139,0.0001562566,0.00003581757,0.001725022,0.000962384,0.000453412,0.0001593328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004516992,"about_ca_system_score_gemma":0.00005397454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002820163,"about_ca_topic_score_gemma":3.79808e-7,"domain_scores_codex":[0.9988492,0.00009195549,0.0002053551,0.0001983268,0.0003344225,0.0003207845],"domain_scores_gemma":[0.9990627,0.00007144281,0.0001361198,0.0004835944,0.00009652217,0.0001496129],"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.000003710466,0.00005646969,0.0003604353,0.000004172046,0.0000652422,0.00005986757,0.002879739,0.003416795,0.0002822665,0.01692829,0.101212,0.8747311],"study_design_scores_gemma":[0.000456456,0.00008785933,0.003889243,0.00005484929,0.000006092694,0.0005163513,0.0001060886,0.9770632,0.0001457352,0.006383007,0.01109432,0.0001967712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0265957,0.00008510456,0.9693763,0.002414063,0.001006803,0.00007328037,0.00000127746,0.00006775995,0.0003797025],"genre_scores_gemma":[0.6443118,0.00003931348,0.3513942,0.001581958,0.002204105,0.00000236135,0.000001731549,0.0000199796,0.00044455],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9736465,"threshold_uncertainty_score":0.999697,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152795079","doi":"10.1093/comjnl/bxp023","title":"Verifying a Synthesized Implementation of IEEE-754 Floating-Point Exponential Function using HOL","year":2009,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Library science; Computer science; Point (geometry); Art history; Management; History; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03781534554123004,"gpt":0.3276752101126267,"spread":0.2898598645713967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001054621,0.0001226508,0.0001992107,0.00009127095,0.000312351,0.000228615,0.0005389235,0.00002831237,0.00002082611],"category_scores_gemma":[0.0000103666,0.00008392019,0.0001348728,0.0002099125,0.00002604053,0.0004416941,0.00008289491,0.0002367426,0.00000298732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003953895,"about_ca_system_score_gemma":0.00006455865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002201713,"about_ca_topic_score_gemma":3.131127e-7,"domain_scores_codex":[0.9984616,0.0003645292,0.0004243331,0.0001704896,0.0003333551,0.0002456836],"domain_scores_gemma":[0.9990903,0.0001225992,0.0003637438,0.0002437306,0.0001020683,0.00007752056],"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.00001885405,0.00004073355,0.00002926591,0.000003561362,0.00003368287,0.000008764796,0.0007448277,0.001247418,0.03893371,0.001146457,0.0001084556,0.9576843],"study_design_scores_gemma":[0.001654133,0.0009525881,0.008242583,0.0001263179,0.00008810843,0.000753633,0.0001970523,0.9137278,0.03791034,0.03561331,0.0003725224,0.0003615869],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0768894,0.00005505878,0.9210114,0.0005201141,0.00138009,0.00009212555,4.212069e-7,0.00003323124,0.00001817806],"genre_scores_gemma":[0.468802,0.000007021511,0.5302688,0.0003358538,0.0005792676,4.577682e-7,1.619247e-7,0.000004705439,0.000001786796],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9573227,"threshold_uncertainty_score":0.3422166,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2295628431","doi":"10.1093/comjnl/bxv048","title":"Planar and Quasi-Planar Simultaneous Geometric Embedding","year":2015,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Classics; Library science; Art history; Humanities; History; Art; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02920011313105515,"gpt":0.267559525543737,"spread":0.2383594124126818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001000183,0.0001345126,0.0001469984,0.000304936,0.0003621376,0.0005911902,0.0006695827,0.00003966404,0.000003702713],"category_scores_gemma":[0.00008619996,0.00009342402,0.0000455152,0.0006571338,0.00003376059,0.0004036893,0.000128803,0.0002796348,0.00004158976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005344472,"about_ca_system_score_gemma":0.0001056005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004646352,"about_ca_topic_score_gemma":0.000001252781,"domain_scores_codex":[0.9986803,0.0001666765,0.0002554545,0.0002095162,0.0004392952,0.0002487418],"domain_scores_gemma":[0.9987229,0.0004642258,0.0001373937,0.000227872,0.0001982301,0.0002494149],"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.00003436131,0.0001339838,0.0003325019,0.0000102363,0.0001011674,0.0003884951,0.0031015,0.2062964,0.00009459806,0.02576604,0.0351079,0.7286329],"study_design_scores_gemma":[0.0005330038,0.0003012966,0.0005038886,0.00001344251,0.00001004724,0.00412822,0.00003607181,0.9602255,0.00004081001,0.02144566,0.0125886,0.0001734349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03257878,0.0008319069,0.9628263,0.002205044,0.001233949,0.0000706024,9.962803e-7,0.00005904744,0.0001933923],"genre_scores_gemma":[0.8404087,0.00004795493,0.1566471,0.001257571,0.001450793,0.000001413843,0.000002946896,0.000008963813,0.000174547],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8078299,"threshold_uncertainty_score":0.5700861,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011538429","doi":"10.1093/comjnl/bxu120","title":"FEIPS: A Secure Fair-Exchange Payment System for Internet Transactions","year":2014,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Athabasca University","funders":"","keywords":"Computer security; Payment; Confidentiality; Computer science; Authentication (law); Trusted third party; Internet privacy; Non-repudiation; The Internet; Cryptographic protocol; Data exchange; Protocol (science); Payment system; Cryptography; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01745875662844275,"gpt":0.257653481559123,"spread":0.2401947249306803,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009014068,0.0001561565,0.0001758219,0.00007356809,0.0003647733,0.000376983,0.001418911,0.00004403328,0.00002089373],"category_scores_gemma":[0.000007672273,0.0001038779,0.0001558512,0.0001498816,0.00004053639,0.0003973875,0.000104523,0.0002977629,0.0000522999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001171092,"about_ca_system_score_gemma":0.00003454944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001744897,"about_ca_topic_score_gemma":0.00000294029,"domain_scores_codex":[0.9986057,0.0002272733,0.0003433753,0.0002514033,0.0002702348,0.0003020457],"domain_scores_gemma":[0.9988102,0.0001761302,0.0002372863,0.0004792835,0.0001657462,0.0001313658],"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.00003078603,0.000171311,0.00001731335,0.00016972,0.0001122703,0.000005710504,0.009855193,0.001794398,0.00008440273,0.5403827,0.00295424,0.4444219],"study_design_scores_gemma":[0.001037527,0.0002772819,0.00009459008,0.0001313969,0.00002084017,0.0006096302,0.00005721506,0.8948586,0.0008859534,0.04987853,0.05193416,0.0002142492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001621806,0.0000372885,0.9936154,0.003021523,0.001183877,0.001706958,0.00000228048,0.0001535924,0.0001168588],"genre_scores_gemma":[0.8142998,0.00000403739,0.1830737,0.0007455507,0.0008232823,0.0007810513,0.00000128047,0.00001930309,0.0002519964],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8930642,"threshold_uncertainty_score":0.4236017,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2990561397","doi":"10.1093/comjnl/bxz128","title":"A Multivariate Blind Ring Signature Scheme","year":2019,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University of Edmonton","funders":"University of Wollongong; Concordia University of Edmonton","keywords":"Ring signature; Blind signature; Computer science; Anonymity; Digital signature; Cryptography; Ring (chemistry); Electronic voting; Scheme (mathematics); Signature (topology); Public-key cryptography; Computer security; Theoretical computer science; Encryption; Voting; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0146533005050288,"gpt":0.2441769203272032,"spread":0.2295236198221744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007051144,0.0001386816,0.0001445818,0.000108968,0.0002823987,0.0006230705,0.0018623,0.0000610038,0.00005423617],"category_scores_gemma":[0.000007071414,0.00008703025,0.0001409341,0.0003584896,0.00003044734,0.0007091353,0.0006276885,0.0007974734,0.0001607908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001643886,"about_ca_system_score_gemma":0.00004345897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004339794,"about_ca_topic_score_gemma":9.13065e-7,"domain_scores_codex":[0.998807,0.0001310406,0.0002110774,0.0002357316,0.000309731,0.0003053916],"domain_scores_gemma":[0.9989099,0.0001248624,0.0001359367,0.0006313571,0.00008392276,0.0001140386],"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.0001504788,0.0003876761,0.004252293,0.0000420142,0.0003873177,0.0002153403,0.00882574,0.002412627,0.007101443,0.8013014,0.01809457,0.1568291],"study_design_scores_gemma":[0.00404327,0.000281009,0.01983538,0.0001494244,0.0000191299,0.00172652,0.00004555503,0.8391901,0.0006582955,0.0858232,0.04757096,0.0006571601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.102731,0.0003045951,0.8930506,0.001329989,0.001821102,0.0001205092,0.000001936873,0.00007928726,0.0005609986],"genre_scores_gemma":[0.7055783,0.00002518263,0.2919613,0.001408501,0.0009900529,0.000001406997,0.000001626318,0.00001026755,0.00002344894],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8367774,"threshold_uncertainty_score":0.6008283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149936759","doi":"10.1093/comjnl/bxs009","title":"Image and Video Encryption based on Dual Space-Filling Curves","year":2012,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"Canada Research Chairs","keywords":"Computer science; Encryption; Dual (grammatical number); Computer vision; Computer graphics (images); Image (mathematics); Space (punctuation); Artificial intelligence; Computer security; Art; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01889341390014178,"gpt":0.2458025956961732,"spread":0.2269091817960314,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001823847,0.0002018306,0.0001753173,0.0001622741,0.0004085906,0.000467196,0.0005439459,0.00004384407,0.00003871287],"category_scores_gemma":[0.00004564646,0.0001394558,0.00009925551,0.0002448532,0.00008561454,0.001287814,0.0001929225,0.0005172958,0.00008865228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000821764,"about_ca_system_score_gemma":0.00005676089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004826633,"about_ca_topic_score_gemma":3.623209e-7,"domain_scores_codex":[0.9981679,0.0003637004,0.0002857327,0.0002242182,0.0005198186,0.0004386305],"domain_scores_gemma":[0.9986636,0.0003555112,0.0002082106,0.0004212449,0.0001197844,0.0002316569],"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.0004669083,0.00202197,0.005538189,0.0006928125,0.0003312713,0.0005067607,0.01269736,0.02820728,0.1057223,0.05498634,0.1978218,0.5910069],"study_design_scores_gemma":[0.0009316877,0.0003122399,0.01224557,0.000454727,0.00002857207,0.001043009,0.0000160224,0.9776024,0.00241223,0.002650209,0.001945374,0.0003579709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02261875,0.0007368176,0.9674962,0.007483547,0.001137939,0.0001371645,0.000001258669,0.0001008023,0.0002874727],"genre_scores_gemma":[0.7378102,0.0002320183,0.2535375,0.00581438,0.002540238,0.000004233039,0.000002704226,0.00002595861,0.00003278428],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9493951,"threshold_uncertainty_score":0.5686843,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4399015500","doi":"10.1093/comjnl/bxae038","title":"Failing to Hash Into Supersingular Isogeny Graphs","year":2024,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Deutsche Forschungsgemeinschaft; Engineering and Physical Sciences Research Council; Banff International Research Station for Mathematical Innovation and Discovery; Ministry of Business, Innovation and Employment; Royal Society Te Apārangi; Marsden Fund; Simons Foundation; California Department of Fish and Game; National Science Foundation","keywords":"Isogeny; Hash function; Collision resistance; Mathematics; Computer science; Cryptographic hash function; Double hashing; Computer security; Pure mathematics; Elliptic curve","retraction":null,"screen_n_in":null,"score":{"opus":0.03355264113695809,"gpt":0.3138387519385658,"spread":0.2802861108016077,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007650971,0.0001206131,0.0001705274,0.0003087579,0.0002736076,0.0002518243,0.0004019757,0.00004764066,0.0001630835],"category_scores_gemma":[0.00006722314,0.00007477693,0.0001515192,0.000519174,0.00005211074,0.00007539617,0.0001506612,0.0004102355,0.00017388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000409794,"about_ca_system_score_gemma":0.00004717532,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005311675,"about_ca_topic_score_gemma":0.000002838034,"domain_scores_codex":[0.9990254,0.00009352326,0.0002529466,0.0001481249,0.0002097441,0.0002702843],"domain_scores_gemma":[0.9992015,0.0003783049,0.00003203611,0.0002079568,0.00005410414,0.0001260556],"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.00002023541,0.0001015758,0.0003345689,0.0001247343,0.0005018464,0.0005260435,0.01977422,0.0002736745,0.0007395276,0.5474082,0.2108843,0.2193111],"study_design_scores_gemma":[0.0001522746,0.000131595,0.0001346503,0.00009983742,0.00005535336,0.001612438,0.0002898709,0.003270878,0.000162729,0.9691728,0.02476869,0.0001488928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5007311,0.001227584,0.4857688,0.00927021,0.002453225,0.00009417157,6.987577e-7,0.0001002185,0.0003540798],"genre_scores_gemma":[0.9279343,0.00003989325,0.06903002,0.001086691,0.001504247,0.000001734952,4.010693e-7,0.00002830313,0.000374363],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4272033,"threshold_uncertainty_score":0.3049315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067531935","doi":"10.1093/comjnl/bxu113","title":"Generalizing the DS-Methods for Testing Non-Deterministic FSMs","year":2014,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.05822499298085235,"gpt":0.3544657442308903,"spread":0.296240751250038,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004638011,0.0001801081,0.0001965416,0.0000716338,0.001191789,0.0008646408,0.00233775,0.00004426617,9.61778e-7],"category_scores_gemma":[0.0008496701,0.00009567254,0.0001277659,0.0002632076,0.00008419499,0.000163366,0.0004716044,0.0003931531,0.000006415404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003067828,"about_ca_system_score_gemma":0.00006605202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008082893,"about_ca_topic_score_gemma":2.281781e-7,"domain_scores_codex":[0.998337,0.0004673583,0.0003470237,0.0002498844,0.0001914873,0.0004072526],"domain_scores_gemma":[0.9934655,0.005198368,0.0002770156,0.0007531141,0.0002121356,0.00009386552],"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.000002152241,0.00001302441,0.0002264232,0.000007971212,0.00001460211,0.000003413731,0.0005431917,0.0006589123,0.0002054036,0.002476323,0.01729029,0.9785583],"study_design_scores_gemma":[0.0001554689,0.000185247,0.0008372962,0.00006598319,0.00001255403,0.001038226,0.000001291396,0.8244135,0.0001652648,0.1679507,0.005034358,0.0001400748],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001157537,0.00007553258,0.993701,0.002036701,0.001355346,0.0001607457,2.507408e-7,0.001299497,0.0002134197],"genre_scores_gemma":[0.06404012,0.000002249068,0.9315552,0.002589398,0.001740709,0.00001736501,2.184013e-7,0.00001866725,0.00003607463],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9784182,"threshold_uncertainty_score":0.91664,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2769184765","doi":"10.1093/comjnl/bxx112","title":"Efficient Ring Signature and Group Signature Schemes Based on q-ary Identification Protocols","year":2017,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Ring signature; Group signature; Merkle signature scheme; Signature (topology); Digital signature; Computer science; Schnorr signature; ElGamal signature scheme; Blind signature; Ring (chemistry); Security parameter; Public-key cryptography; Algorithm; Mathematics; Theoretical computer science; Computer security; Cryptography; Encryption; Hash function","retraction":null,"screen_n_in":null,"score":{"opus":0.0179525546339902,"gpt":0.2765717691886322,"spread":0.258619214554642,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001112641,0.0001688125,0.0001433021,0.000117499,0.001717115,0.002336554,0.0026889,0.00008815099,0.000006727526],"category_scores_gemma":[0.00005810113,0.0001098449,0.00008669215,0.0001150686,0.0001185338,0.0003939859,0.0006834011,0.0007964049,0.0000058829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001949437,"about_ca_system_score_gemma":0.00003843857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001597104,"about_ca_topic_score_gemma":9.405743e-7,"domain_scores_codex":[0.9986097,0.0001506486,0.0002329178,0.0003320108,0.0004274959,0.0002472555],"domain_scores_gemma":[0.9979511,0.0001167514,0.0003512946,0.001341678,0.00009189803,0.0001472026],"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.0003905072,0.001596073,0.003240184,0.000239393,0.0002138795,0.0003502217,0.003039522,0.01645799,0.01463609,0.37122,0.02717155,0.5614446],"study_design_scores_gemma":[0.0009734719,0.0002192952,0.04785288,0.0002570119,0.00001133391,0.0001236286,0.000006720087,0.9300013,0.0008628369,0.01509488,0.00433303,0.000263619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02012776,0.0001506206,0.9734396,0.003736922,0.0006366255,0.001704397,0.000005979035,0.00007334506,0.0001247222],"genre_scores_gemma":[0.9557559,0.000005547281,0.04256175,0.0009376762,0.0006074255,0.0001164025,0.000002724095,0.000009642476,0.000002875188],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9356282,"threshold_uncertainty_score":0.9995825,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141961918","doi":"10.1093/comjnl/bxu114","title":"QPRR: QoS-Aware Peering Routing Protocol for Reliability Sensitive Data in Body Area Network Communication","year":2014,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University; Dalhousie University","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Computer science; Computer network; Network packet; Quality of service; Reliability (semiconductor); Scalability; Routing protocol; Zone Routing Protocol; Link-state routing protocol; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.03180222743785945,"gpt":0.2767520743121598,"spread":0.2449498468743004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003103646,0.0001874137,0.0002519497,0.00003944104,0.0003209732,0.0001769702,0.001006414,0.00008157983,0.000004328045],"category_scores_gemma":[0.00005906018,0.0001487883,0.0000566617,0.0001533276,0.00004549316,0.0003072973,0.0004967161,0.0007798988,0.000003307123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001328028,"about_ca_system_score_gemma":0.00002136232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006643384,"about_ca_topic_score_gemma":0.00003291226,"domain_scores_codex":[0.9984259,0.0003105432,0.000476079,0.0001964948,0.0001731681,0.0004178158],"domain_scores_gemma":[0.9978468,0.0006990253,0.0001358406,0.001135341,0.000110678,0.00007232913],"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.00003626142,0.0000190129,0.001320268,0.00004377646,0.00002985091,0.000002603343,0.0004407318,0.9727033,0.00001721036,0.0001217863,0.01099293,0.01427224],"study_design_scores_gemma":[0.0006987494,0.00003002433,0.006875196,0.0003974293,0.000009899186,0.00007000504,0.00002736074,0.9857759,0.0000313046,0.0007654747,0.005148986,0.0001697022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009742856,0.00001281843,0.9701509,0.0004559004,0.0004933889,0.01862848,0.000006348349,0.0001821751,0.0003271583],"genre_scores_gemma":[0.9676694,0.000004850041,0.02485302,0.0001133542,0.002818069,0.004443524,0.0000339201,0.00005762356,0.000006195245],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9579266,"threshold_uncertainty_score":0.606741,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3039415289","doi":"10.1093/comjnl/bxaa062","title":"Model-Based Comparison of Cloud-Edge Computing Resource Allocation Policies","year":2020,"lang":"en","type":"article","venue":"The Computer Journal","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Fundamental Research Funds for the Central Universities","keywords":"Cloud computing; Computer science; Enhanced Data Rates for GSM Evolution; Resource allocation; Distributed computing; Edge computing; Edge device; Service (business); Focus (optics); Idle; Resource (disambiguation); The Internet; Process (computing); Queueing theory; Computer network; Operating system; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06479046040541213,"gpt":0.2935641611250369,"spread":0.2287737007196248,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008814885,0.0002335723,0.0003983885,0.0001192021,0.0006089538,0.0003678527,0.002301804,0.00006872507,0.000001197032],"category_scores_gemma":[0.00003762573,0.0001764943,0.0001962963,0.0005686347,0.0001130822,0.0002272242,0.0006756149,0.0006472818,0.00001815478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005332898,"about_ca_system_score_gemma":0.0001779099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005410605,"about_ca_topic_score_gemma":2.407185e-7,"domain_scores_codex":[0.997668,0.0002967894,0.0007510743,0.0002979762,0.00053012,0.0004560153],"domain_scores_gemma":[0.9981998,0.0003087076,0.0005730001,0.000465181,0.0002342679,0.0002190461],"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.0000350147,0.0001323017,0.001519577,0.00005380941,0.00006554244,0.000008515928,0.0234379,0.7721589,0.0008835127,0.004884434,0.07989101,0.1169294],"study_design_scores_gemma":[0.0004447565,0.0001712886,0.0005909051,0.00006674623,0.00001477948,0.00004354804,0.00004662163,0.9915278,0.001378976,0.0008270729,0.004691849,0.0001956894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07068345,0.0002155439,0.9139028,0.01209834,0.002432088,0.0001123986,1.966403e-7,0.0001434775,0.0004116662],"genre_scores_gemma":[0.8960673,0.000001821739,0.09445397,0.003577762,0.00587074,4.872948e-7,0.000001670135,0.0000180382,0.000008240175],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8253838,"threshold_uncertainty_score":0.7197227,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167884148","doi":"10.1093/comjnl/bxu043","title":"A Cloud Resource Evaluation Model Based on Entropy Optimization and Ant Colony Clustering","year":2014,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":8,"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":"","keywords":"Cloud computing; Computer science; Cluster analysis; Ant colony optimization algorithms; Scheduling (production processes); Adaptability; Entropy (arrow of time); CloudSim; Distributed computing; Data mining; Mathematical optimization; Artificial intelligence; Ecology; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01677051241162584,"gpt":0.2353502862431745,"spread":0.2185797738315487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002801101,0.0001521195,0.0001429857,0.0001272319,0.0005735566,0.000541212,0.0007207232,0.00004156646,0.000003263529],"category_scores_gemma":[0.00003209934,0.0001031619,0.00006258424,0.0001674193,0.00003827652,0.00003548137,0.0003965287,0.0002986847,0.000004240132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007312932,"about_ca_system_score_gemma":0.00003502049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001522116,"about_ca_topic_score_gemma":4.145427e-7,"domain_scores_codex":[0.9980464,0.0005718767,0.0002611332,0.0002780662,0.0005853017,0.0002572434],"domain_scores_gemma":[0.9989357,0.0002132095,0.000194977,0.0004546728,0.00009882992,0.0001025896],"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.00001556501,0.00002891946,0.00001067894,0.000004377392,0.00001016421,0.000002018136,0.0003983113,0.9291533,0.000005767551,0.00150875,0.001470578,0.06739157],"study_design_scores_gemma":[0.0008437858,0.000251789,0.000103494,0.00006697588,0.00001924002,0.00006431057,0.000007054475,0.9961464,0.000009496202,0.001080881,0.001275725,0.0001308677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02095428,0.0000377312,0.9719484,0.00579105,0.0004792843,0.0001795152,1.592211e-7,0.00007856179,0.0005309868],"genre_scores_gemma":[0.8391403,0.000003937973,0.1561957,0.003534422,0.001023808,0.000004907465,7.847123e-7,0.00001509055,0.00008102952],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.818186,"threshold_uncertainty_score":0.521892,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004438803","doi":"10.1093/comjnl/bxl067","title":"A Novel Framework for Self-Organizing Lists in Environments with Locality of Reference: Lists-on-Lists","year":2006,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Locality; Computer science; Library science; World Wide Web; Information retrieval; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02699347728343862,"gpt":0.2632257888245426,"spread":0.2362323115411039,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008379112,0.0001499558,0.000203969,0.0001065825,0.0001899781,0.0002256826,0.0009904717,0.00007249881,0.00000910062],"category_scores_gemma":[0.00001777593,0.00009818243,0.00004907735,0.0003223506,0.00006909879,0.000240624,0.0001944942,0.0004722502,0.000006156421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001099018,"about_ca_system_score_gemma":0.00009562115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002067814,"about_ca_topic_score_gemma":0.000008243497,"domain_scores_codex":[0.9984697,0.000128472,0.0003896597,0.0002464438,0.0004446369,0.0003211413],"domain_scores_gemma":[0.9989195,0.0002599534,0.0002456773,0.0004037628,0.00008648651,0.0000845702],"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.000283627,0.003403345,0.01060132,0.0001578643,0.0002040893,0.00007426785,0.007987537,0.4233975,0.001152918,0.5148564,0.003681709,0.03419945],"study_design_scores_gemma":[0.00408039,0.001074705,0.05355485,0.000577585,0.00002045499,0.000410173,0.00004219219,0.8725468,0.001162016,0.06043506,0.005486841,0.0006089683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01245295,0.00003178489,0.9855896,0.00129538,0.0001638039,0.0002277236,0.00000307004,0.00002994633,0.0002057402],"genre_scores_gemma":[0.4809143,0.00001633732,0.5183717,0.0004555514,0.000177115,0.00000538192,0.000001946372,0.00001170998,0.00004599999],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4684613,"threshold_uncertainty_score":0.4003763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2945730209","doi":"10.1093/comjnl/bxz039","title":"SGAC: A Multi-Layered Access Control Model with Conflict Resolution Strategy","year":2019,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Access Control and Trust","field":"Social Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"XACML; Computer science; Access control; Scope (computer science); Control (management); Set (abstract data type); Constraint (computer-aided design); Patient safety; Order (exchange); Computer security; Operations research; Health care; Artificial intelligence; Programming language; Business; Law; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0660270851781186,"gpt":0.3351993592668811,"spread":0.2691722740887625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008646258,0.0001265097,0.000204639,0.00005352911,0.0007763057,0.0007911192,0.0008605241,0.0000665976,0.0001064055],"category_scores_gemma":[0.000009937363,0.00007269344,0.00007869456,0.0001352707,0.0001494456,0.0007121768,0.00006084446,0.000396125,0.00007082373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006392678,"about_ca_system_score_gemma":0.0002931955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002980596,"about_ca_topic_score_gemma":0.0002368333,"domain_scores_codex":[0.9984989,0.0003111139,0.0002177628,0.0001587666,0.0004286478,0.0003848443],"domain_scores_gemma":[0.9991164,0.0001120098,0.0002152371,0.0001840852,0.0002255075,0.0001467215],"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.0008200886,0.0002286801,0.01733108,0.00001185052,0.0003917227,0.00005332199,0.007677536,0.8683131,0.0001418943,0.04513099,0.002522455,0.05737728],"study_design_scores_gemma":[0.003544359,0.0001130381,0.007308696,0.00002894268,0.00003615097,0.00004107558,0.0002962696,0.984316,0.000003400051,0.00173008,0.002413197,0.0001687842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1410186,0.0002518744,0.8438198,0.006657109,0.0005547653,0.0005527152,0.000004441437,0.00007606459,0.007064612],"genre_scores_gemma":[0.996267,0.0000458303,0.001159133,0.00094138,0.0008047748,0.000004890944,6.52855e-7,0.00001136459,0.0007649855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8552483,"threshold_uncertainty_score":0.7628781,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3139621838","doi":"10.1093/comjnl/bxab032","title":"Advanced Data Mining Tools and Methods for Social Computing","year":2021,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"","keywords":"Cornerstone; Data science; Computer science; Social computing; Big data; Knowledge management; Social media; World Wide Web; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.09376561811692588,"gpt":0.4239916224342266,"spread":0.3302260043173008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009592702,0.00009750607,0.000212415,0.00002276849,0.0005789717,0.0003447737,0.0004209897,0.00001445862,0.00004133556],"category_scores_gemma":[0.000008014033,0.00007458884,0.00008936242,0.0001066957,0.00002680993,0.0001538333,0.0006464645,0.0001918024,3.77731e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009211378,"about_ca_system_score_gemma":0.00004064233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001057477,"about_ca_topic_score_gemma":4.914004e-7,"domain_scores_codex":[0.9990895,0.0002319747,0.0002317467,0.0001837334,0.00007183607,0.0001912118],"domain_scores_gemma":[0.9988851,0.0005461634,0.0001570045,0.0002625275,0.0001093176,0.00003988982],"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.000004078816,0.00001101672,0.0003247375,0.000002176852,0.0001218434,9.793656e-7,0.0003128617,0.00008404073,0.0001942913,0.002650709,0.005456112,0.9908372],"study_design_scores_gemma":[0.001167795,0.00005985802,0.003647762,0.00008399861,0.0002821989,0.0001292997,0.0006973731,0.8494678,0.001001708,0.05124577,0.0918002,0.0004162008],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01172224,0.000237408,0.9868073,0.0006971821,0.000169217,0.00006561305,0.00001138394,0.00002041903,0.0002692145],"genre_scores_gemma":[0.1175488,0.000003909277,0.8797151,0.0001504922,0.002500406,0.000001498309,0.00004042005,0.0000114144,0.00002796672],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9904209,"threshold_uncertainty_score":0.4453041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157326316","doi":"10.1093/comjnl/bxu021","title":"Application of Simple Power Analysis to Stream Ciphers Constructed Using Feedback Shift Registers","year":2014,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Stream cipher; Simple (philosophy); Power (physics); Library science; Cryptography; Algorithm; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.01394307015037491,"gpt":0.2703800986521889,"spread":0.2564370285018139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009828727,0.0001540154,0.0002904921,0.0003236118,0.0002091925,0.0002042194,0.001564958,0.00004856079,0.000008265956],"category_scores_gemma":[0.00003440739,0.0001172557,0.0001836441,0.001276727,0.0000766322,0.0002189158,0.0003703557,0.000251206,0.000005580663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000809735,"about_ca_system_score_gemma":0.00004722492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008088363,"about_ca_topic_score_gemma":0.00001774793,"domain_scores_codex":[0.9984067,0.0002612712,0.0004360048,0.0002756029,0.0003581639,0.0002622508],"domain_scores_gemma":[0.9981062,0.000195715,0.0004601881,0.0008924057,0.0002137077,0.0001318297],"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.0001176118,0.0003256472,0.08336795,0.00004259741,0.002393256,0.00002149834,0.01889636,0.2186141,0.01324983,0.04837089,0.009413416,0.6051868],"study_design_scores_gemma":[0.0002627639,0.0001999448,0.02244394,0.00003163054,0.0001545426,0.0001689794,0.00007272179,0.965384,0.001693926,0.008589024,0.000718372,0.0002801573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2104267,0.000007508286,0.7883719,0.0005332349,0.0002167632,0.0001094145,7.138439e-7,0.000109168,0.0002246752],"genre_scores_gemma":[0.7577431,6.319228e-7,0.2417822,0.0003732447,0.00008776591,0.000001425284,5.640927e-7,0.00000820764,0.000002844065],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7467699,"threshold_uncertainty_score":0.478155,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2791622101","doi":"10.1093/comjnl/bxac182","title":"Two-Dimensional Block Trees","year":2022,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Block (permutation group theory); Adjacency list; Raster graphics; Exploit; Computer science; Tree (set theory); Adjacency matrix; Representation (politics); Data structure; Sequence (biology); Theoretical computer science; Space (punctuation); Tree structure; Algorithm; Pattern recognition (psychology); Combinatorics; Mathematics; Artificial intelligence; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01509451967920478,"gpt":0.2386248503115011,"spread":0.2235303306322963,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007208966,0.0001133591,0.000117381,0.00007977561,0.001547108,0.000306173,0.002143565,0.0000109275,0.0001342767],"category_scores_gemma":[0.000002720436,0.00007136985,0.00009530636,0.0002313012,0.00003184695,0.0003175957,0.002579624,0.0005733503,0.00003101743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004895432,"about_ca_system_score_gemma":0.00008719818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007678615,"about_ca_topic_score_gemma":6.141888e-7,"domain_scores_codex":[0.9984183,0.0002809694,0.0002206987,0.0002054065,0.0006160669,0.0002585855],"domain_scores_gemma":[0.9990913,0.0001164966,0.0001342769,0.0005041903,0.00004738738,0.0001063074],"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.00003270842,0.0002927122,0.0001771236,0.000001881938,0.0000893742,0.00047422,0.001279145,0.276206,0.0005759101,0.02622585,0.312267,0.3823781],"study_design_scores_gemma":[0.000654384,0.000184385,0.001201483,0.000007651088,0.000006090609,0.006212024,0.00001489944,0.9321089,0.00004645389,0.01167888,0.0477169,0.0001679609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03768292,0.0007428774,0.9472337,0.008091054,0.005389328,0.0001278372,0.000008896471,0.0001543359,0.0005690275],"genre_scores_gemma":[0.6942097,0.00001332593,0.2934585,0.008181618,0.003344309,0.00001580445,0.000007524689,0.00002724808,0.0007420111],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6565268,"threshold_uncertainty_score":0.9997528,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100142798","doi":"10.1093/comjnl/bxu039","title":"Functional Dependencies with null Markers","year":2014,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Null (SQL); Axiom; Extension (predicate logic); Computer science; Dependency theory (database theory); Functional dependency; Set (abstract data type); Theoretical computer science; Mathematics; Data mining; Programming language; Relational database","retraction":null,"screen_n_in":null,"score":{"opus":0.01024603518589418,"gpt":0.188723584415209,"spread":0.1784775492293148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006534319,0.000119182,0.0001197807,0.00004996433,0.0004679254,0.0001960746,0.000544548,0.00001918481,0.00002720491],"category_scores_gemma":[0.000009680473,0.00006187415,0.00005019018,0.0001369908,0.00007352386,0.0006489774,0.0002089767,0.0002544615,0.00005750926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002631892,"about_ca_system_score_gemma":0.00005670774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004848476,"about_ca_topic_score_gemma":0.0000069486,"domain_scores_codex":[0.9989168,0.0001477891,0.0001737218,0.0001686428,0.0003634824,0.0002295876],"domain_scores_gemma":[0.999114,0.0001404054,0.0001298856,0.000409009,0.0001117636,0.00009490396],"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.0001031893,0.0000604375,0.001421915,0.00002266852,0.0001535746,0.00008695642,0.0009986334,0.01304152,0.0001879399,0.6775536,0.05885512,0.2475145],"study_design_scores_gemma":[0.002323508,0.001079775,0.04969511,0.0002828339,0.00003264273,0.01972256,0.0001838981,0.2820038,0.0004652522,0.02013003,0.6231792,0.0009014573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002803858,0.00007224645,0.9935881,0.001439521,0.0009652486,0.0000484847,8.874432e-7,0.00006221206,0.001019381],"genre_scores_gemma":[0.2610894,0.00002181334,0.733041,0.002382388,0.0026287,0.000007422815,0.000002737905,0.00002060716,0.0008060072],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6574236,"threshold_uncertainty_score":0.3598951,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115805990","doi":"10.1093/comjnl/46.2.146","title":"On the Structuring of Reliable Multicast Protocols for Distributed Mobile Systems","year":2003,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Ministère de la Santé et des Services sociaux","keywords":"Computer science; Multicast; Computer network; Distributed computing; Scalability; Correctness; Latency (audio); Structuring; Telecommunications; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.0239274586766127,"gpt":0.2664893303932322,"spread":0.2425618717166195,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001451155,0.0001593794,0.0002268104,0.00003685357,0.0004315888,0.0004052348,0.001612482,0.00004804058,0.00001087874],"category_scores_gemma":[0.00004668406,0.00008103286,0.0001245433,0.0002237576,0.00006390717,0.0001638924,0.0001591379,0.0003782993,0.000005797151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005828771,"about_ca_system_score_gemma":0.00007378343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001985446,"about_ca_topic_score_gemma":2.581925e-7,"domain_scores_codex":[0.9983565,0.0002855775,0.0004453641,0.0002074364,0.0003400449,0.0003650858],"domain_scores_gemma":[0.9977822,0.0007680838,0.0003562002,0.0008063001,0.0002040716,0.0000831588],"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.00003715268,0.0001194752,0.0000741055,0.00005352501,0.00009536513,0.00001067219,0.0005156595,0.5744173,0.0001549582,0.3956901,0.02043845,0.00839325],"study_design_scores_gemma":[0.0009262215,0.0005372392,0.000131692,0.0002628921,0.00001124759,0.0004275254,0.00003475818,0.9593722,0.001554133,0.01559586,0.02096707,0.0001791224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007736771,0.00006314156,0.983395,0.0001967118,0.0008511481,0.007594491,0.000005876751,0.00003644926,0.0001204289],"genre_scores_gemma":[0.9583272,0.00000503355,0.03707976,0.0002351044,0.0005845502,0.003673105,0.000001164819,0.00002523755,0.00006890018],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9505904,"threshold_uncertainty_score":0.3907689,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4366998199","doi":"10.1093/comjnl/bxad048","title":"Chronos: An Efficient Asynchronous Byzantine Ordered Consensus","year":2023,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"National Key Research and Development Program of China","keywords":"Computer science; Asynchronous communication; Liveness; Correctness; Computer network; Protocol (science); Distributed computing; Theoretical computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01803022904546631,"gpt":0.2547564318641966,"spread":0.2367262028187303,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001233474,0.000195738,0.0002466443,0.0001197779,0.0006569856,0.0007182159,0.001725144,0.00005353936,0.0000190034],"category_scores_gemma":[0.00001533651,0.0001285268,0.0001121321,0.000737785,0.00008573134,0.0001402335,0.0003464862,0.0003764691,0.000382083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003727476,"about_ca_system_score_gemma":0.0001463245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001302652,"about_ca_topic_score_gemma":0.00000298617,"domain_scores_codex":[0.9979753,0.0002713758,0.0004386871,0.0003246615,0.0004416089,0.0005482934],"domain_scores_gemma":[0.9985105,0.0001248861,0.0002179472,0.0007441471,0.0001896618,0.0002129004],"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.00004679815,0.000501057,0.0005149014,0.00004639855,0.0002494304,0.001572513,0.005634864,0.3764137,0.0008759188,0.05833282,0.1407877,0.415024],"study_design_scores_gemma":[0.0007151435,0.00016702,0.005811316,0.00004590584,0.000006290901,0.001743504,0.00004406385,0.9697297,0.00005825543,0.0005204258,0.0209432,0.0002151891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1720939,0.0002113487,0.8200625,0.003686617,0.002897464,0.0001604568,0.000008769203,0.0003723598,0.0005066581],"genre_scores_gemma":[0.9863265,0.00001786524,0.01174992,0.0004917335,0.001256555,0.000004973364,0.000006506932,0.00001708683,0.0001288195],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8142327,"threshold_uncertainty_score":0.6925772,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3033848960","doi":"10.1093/comjnl/bxz150","title":"Balancing Power And Performance In HPC Clouds","year":2020,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Frequency scaling; Computer science; Cloud computing; Energy consumption; Virtual machine; Server; Virtualization; Efficient energy use; Energy (signal processing); Distributed computing; Operating system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0115244735320022,"gpt":0.2037386033087739,"spread":0.1922141297767717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006183329,0.0001107378,0.0001339192,0.00005040427,0.0002220623,0.0003114984,0.0009047057,0.00002468288,0.000004047747],"category_scores_gemma":[0.000007561002,0.0000718035,0.00004207703,0.0002637817,0.00003184718,0.00004838913,0.0007785948,0.0004533269,0.00001789149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001923147,"about_ca_system_score_gemma":0.0000184766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001474462,"about_ca_topic_score_gemma":2.369865e-7,"domain_scores_codex":[0.9989872,0.0001110761,0.0002243589,0.0001987093,0.0002200613,0.0002585853],"domain_scores_gemma":[0.999501,0.00006517291,0.00008357458,0.000207875,0.00002464824,0.0001177115],"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.00005325741,0.0001081931,0.03952403,0.00007139557,0.0001056594,0.0004267026,0.03576673,0.1155696,0.00008426998,0.01391649,0.01133131,0.7830424],"study_design_scores_gemma":[0.0003988073,0.0001780718,0.05621583,0.00004563987,0.000002734361,0.0003014697,0.0000378511,0.9358521,0.00001367436,0.0003113654,0.006519908,0.0001225316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7659574,0.0002588059,0.2145822,0.01785221,0.0004642616,0.00006109348,5.851213e-8,0.00005956584,0.0007644896],"genre_scores_gemma":[0.9870607,0.00001850432,0.008604786,0.003830297,0.0004459909,5.41559e-7,3.651013e-8,0.000005832915,0.00003326879],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8202826,"threshold_uncertainty_score":0.3003787,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4307812414","doi":"10.1093/comjnl/bxac132","title":"The Need for Being Explicit: Failed Attempts to Construct Implicit Certificates from Lattices","year":2022,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Certificate; Computer security; Construct (python library); Public-key cryptography; NIST; Cryptographic primitive; Cryptanalysis; Cryptography; Emulation; Encryption; Theoretical computer science; Computer network; Cryptographic protocol","retraction":null,"screen_n_in":null,"score":{"opus":0.02261532536164305,"gpt":0.2552168220427801,"spread":0.232601496681137,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001130806,0.0001705468,0.0001931572,0.00009609921,0.003296229,0.001310241,0.003368458,0.00002295113,0.00002647853],"category_scores_gemma":[0.00002179892,0.0001032554,0.0001931203,0.0004284859,0.00005888673,0.0003433021,0.001378937,0.0004505108,0.000009616725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004032416,"about_ca_system_score_gemma":0.00005360715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003668286,"about_ca_topic_score_gemma":0.00001292828,"domain_scores_codex":[0.9981703,0.0002810967,0.0003894409,0.000332182,0.0003897496,0.0004372583],"domain_scores_gemma":[0.9974684,0.001278459,0.0002169904,0.0007882901,0.00009364152,0.0001542611],"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.0002590335,0.0001508006,0.003506492,0.00001076081,0.0004595818,0.00003803635,0.01957165,0.001795906,0.00472085,0.3232743,0.09495129,0.5512612],"study_design_scores_gemma":[0.001470445,0.000479304,0.01540959,0.00003446546,0.00006114043,0.00044423,0.001066493,0.154488,0.001030719,0.6136895,0.2111943,0.0006318796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1647929,0.0003086387,0.815688,0.01689081,0.001820288,0.0003233961,0.0000539299,0.00007722184,0.00004489506],"genre_scores_gemma":[0.9296341,0.00001863145,0.06647787,0.002904507,0.0008682781,0.00006684309,0.000008652761,0.00001476659,0.000006346775],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7648412,"threshold_uncertainty_score":0.9997265,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4225694316","doi":"10.1093/comjnl/bxac040","title":"CWSOGG: Catching Web Shell Obfuscation Based on Genetic Algorithm and Generative Adversarial Network","year":2022,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Obfuscation; Computer science; Discriminator; Generator (circuit theory); Artificial intelligence; Web page; Shell (structure); Web application; Machine learning; Data mining; Set (abstract data type); Computer security; World Wide Web; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.007610875030960365,"gpt":0.2179950491614635,"spread":0.2103841741305031,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006968941,0.0001520826,0.0001352752,0.0001163527,0.001364275,0.0002494756,0.0007790498,0.00002671921,0.00001881789],"category_scores_gemma":[0.000006893269,0.0001222205,0.00006559245,0.000305825,0.00003927518,0.0002199831,0.0004807436,0.0006460891,0.000003333782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001597853,"about_ca_system_score_gemma":0.0001129167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003228723,"about_ca_topic_score_gemma":7.670561e-7,"domain_scores_codex":[0.9983291,0.0005077486,0.0002204978,0.0002829226,0.0004008031,0.000258912],"domain_scores_gemma":[0.9990954,0.0001812975,0.0002113745,0.0003559809,0.00007066058,0.00008521747],"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.00001812378,0.00003301991,0.00003292536,0.00000143475,0.00001651121,0.00003602116,0.0004700409,0.5653251,0.0001156616,0.001153545,0.004836269,0.4279613],"study_design_scores_gemma":[0.0004130268,0.0003987114,0.0004380638,0.000008795266,0.000006875614,0.0004720248,0.00001246202,0.9771595,0.0002490941,0.01298466,0.00770492,0.0001518814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001694238,0.000140298,0.9941332,0.001827014,0.001796596,0.0001793604,0.000002395396,0.0001619718,0.00006494456],"genre_scores_gemma":[0.1078716,0.00003042882,0.8869874,0.003207016,0.001810916,0.00002904997,0.000001749761,0.00001788433,0.00004398079],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4278095,"threshold_uncertainty_score":0.9999358,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037838531","doi":"10.1093/comjnl/bxaa049","title":"CutTheTail: An Accurate and Space-Efficient Heuristic Algorithm for Influence Maximization","year":2020,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computation; Heuristic; Algorithm; Maximization; Heuristics; Benchmark (surveying); Laptop; Mathematical optimization; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01831341504820606,"gpt":0.2635336879577786,"spread":0.2452202729095725,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001964968,0.0001063394,0.0001407946,0.00002755068,0.0002691543,0.0002410511,0.0002341014,0.00001224285,0.00003004972],"category_scores_gemma":[0.00000223815,0.00007453818,0.00006748282,0.0001188563,0.00003077129,0.00009618726,0.00009219311,0.0001614454,0.000002751388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008796448,"about_ca_system_score_gemma":0.00001974654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000486166,"about_ca_topic_score_gemma":1.803299e-7,"domain_scores_codex":[0.9993336,0.00007775707,0.0001880551,0.000141306,0.0001042409,0.0001550008],"domain_scores_gemma":[0.9994441,0.00006035994,0.0001460161,0.0001237925,0.0001121964,0.0001134901],"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.0000231992,0.00007050253,0.001587919,0.000006549838,0.0001519794,0.000003387068,0.001203984,0.1520344,0.000123883,0.007973379,0.003797778,0.833023],"study_design_scores_gemma":[0.000216912,0.00009611354,0.0009392692,0.000009580153,0.00004687153,0.00001078891,0.00002933198,0.9901437,0.00007590846,0.006612896,0.00172329,0.00009540046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0524218,0.0000378311,0.9463217,0.000961319,0.00004758743,0.0001402076,0.000005832313,0.00003249253,0.00003127826],"genre_scores_gemma":[0.8723552,0.000005486912,0.126136,0.0002876547,0.001179799,0.000006399903,0.000007466836,0.0000136911,0.000008317032],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8381092,"threshold_uncertainty_score":0.3039579,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963700980","doi":"10.1093/comjnl/bxs055","title":"A Generating Function Approach to the Edge Surface Area of the Arrangement Graphs","year":2012,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Surface (topology); Vertex (graph theory); Mathematics; Enhanced Data Rates for GSM Evolution; Point (geometry); Chordal graph; Graph; Discrete mathematics; Computer science; Geometry; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03462539860195411,"gpt":0.2181889478185945,"spread":0.1835635492166404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002049695,0.0001107498,0.0001255477,0.00003105773,0.000659913,0.0002587888,0.001177434,0.0000273891,0.000005331372],"category_scores_gemma":[0.00000580038,0.00004535751,0.0001519896,0.0003409943,0.00002739131,0.0002125469,0.0003226152,0.0002938461,0.000009657931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003318439,"about_ca_system_score_gemma":0.00002106649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008953702,"about_ca_topic_score_gemma":0.0000030634,"domain_scores_codex":[0.998515,0.000448667,0.0003044805,0.0001190344,0.0003383335,0.0002745113],"domain_scores_gemma":[0.9990036,0.0000757559,0.000211273,0.0005159368,0.0001223739,0.00007107569],"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.00002412136,0.0002415835,0.002969143,0.00001826247,0.0002790009,6.869176e-7,0.02312069,0.6487929,0.001251132,0.06722589,0.1964733,0.05960326],"study_design_scores_gemma":[0.0002404551,0.0001002833,0.004884911,0.00005645788,0.0000229059,0.0004789357,0.0002573623,0.9678991,0.0001803987,0.0006971873,0.02503402,0.0001479375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07130962,0.0003486579,0.9190658,0.001850676,0.006351338,0.0002022596,3.505592e-7,0.00001805587,0.0008532768],"genre_scores_gemma":[0.9875714,0.000004298495,0.008916412,0.00148376,0.001849616,0.000005405172,1.484089e-7,0.000006358927,0.0001626163],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9162618,"threshold_uncertainty_score":0.5075584,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143664221","doi":"10.1093/comjnl/bxr061","title":"Leveraging Service Discovery in MANETs with Mobile Directories","year":2011,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Library science; Service (business); Computer science; Columbia university; World Wide Web; Media studies; Sociology; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.01711651098211092,"gpt":0.1987088136089118,"spread":0.1815923026268009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000375499,0.000205225,0.000193868,0.0001472432,0.000263338,0.0004405689,0.001874346,0.00003389688,0.00001508897],"category_scores_gemma":[6.151506e-7,0.0001162332,0.00004945814,0.000653671,0.00003212977,0.001040979,0.0004676947,0.0004630222,0.00002080956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003231827,"about_ca_system_score_gemma":0.0000739452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002122257,"about_ca_topic_score_gemma":0.0003513327,"domain_scores_codex":[0.9985631,0.0001644935,0.000263093,0.0002823549,0.000326615,0.0004003313],"domain_scores_gemma":[0.9990193,0.0000995872,0.0001480637,0.0005379244,0.00009878451,0.0000963323],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"observational","study_design_scores_codex":[0.0006292745,0.001164572,0.08896815,0.0002768701,0.0006539694,0.002661142,0.5601287,0.03034484,0.0007369146,0.03475627,0.001140033,0.2785393],"study_design_scores_gemma":[0.008756367,0.002958856,0.5548782,0.002084066,0.0001720441,0.0186557,0.005971015,0.2680161,0.01068157,0.07566901,0.04816334,0.003993704],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6065221,0.0003444829,0.3893401,0.001223662,0.0009571499,0.0001577636,5.800149e-7,0.00009751163,0.001356544],"genre_scores_gemma":[0.9580759,0.0000255013,0.03728894,0.004114005,0.0004358453,0.00001058617,8.811801e-7,0.00001612909,0.0000322601],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5541577,"threshold_uncertainty_score":0.4739854,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170250042","doi":"10.1093/comjnl/bxt051","title":"Green Mobile Networking and Communications","year":2013,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":2,"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":"","keywords":"Chen; Library science; China; Computer science; Media studies; Telecommunications; History; Sociology; Archaeology","retraction":null,"screen_n_in":null,"score":{"opus":0.01197479244993674,"gpt":0.1989479957483777,"spread":0.1869732032984409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001713806,0.00007764795,0.00007905294,0.0000235627,0.0002388258,0.0001735055,0.0004402293,0.00003039602,0.0000158299],"category_scores_gemma":[0.000001026845,0.00005541779,0.00002333684,0.00007143585,0.00006360262,0.0001211742,0.0001639879,0.000403145,0.00001889684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001703828,"about_ca_system_score_gemma":0.00000374633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001358163,"about_ca_topic_score_gemma":0.00000483657,"domain_scores_codex":[0.9995205,0.00005908324,0.0001458159,0.00004506525,0.00006495143,0.0001645974],"domain_scores_gemma":[0.9993953,0.000164653,0.0000318242,0.000313388,0.00003093933,0.00006392524],"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":[3.821952e-7,0.000006900315,0.0008968075,0.000006587996,0.00005894782,0.000002448566,0.0005233728,0.5109135,0.00007069229,0.0004169169,0.01623277,0.4708707],"study_design_scores_gemma":[0.0000853794,0.00001272067,0.003579627,0.00004715728,0.000006870856,0.0002665035,0.00001162199,0.9765626,0.000004098345,0.001408,0.01793202,0.00008335958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5923439,0.01867814,0.3734672,0.002317512,0.003726119,0.0004185954,9.350834e-7,0.0008024595,0.008245155],"genre_scores_gemma":[0.9795067,0.0009347448,0.01763563,0.0001797754,0.00163472,0.00001487789,9.245704e-7,0.00002461168,0.00006803607],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4707873,"threshold_uncertainty_score":0.2259872,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068551941","doi":"10.1093/comjnl/bxt136","title":"Reusing Garbage Data for Efficient Workflow Computation","year":2013,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge; University of New Brunswick","funders":"","keywords":"Workflow; Reuse; Garbage; Computer science; Library science; Computation; World Wide Web; Database; Engineering; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.2676959303533572,"gpt":0.4105441273088815,"spread":0.1428481969555243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0114329,0.0001277268,0.0001870818,0.000210565,0.0009715415,0.003912362,0.003827867,0.00002536704,0.0001438909],"category_scores_gemma":[0.0006983699,0.00007051894,0.0000941041,0.0006231412,0.0000900666,0.0004207727,0.00181152,0.0002016724,0.000472937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003513478,"about_ca_system_score_gemma":0.00004521532,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008118894,"about_ca_topic_score_gemma":0.000001587624,"domain_scores_codex":[0.9968989,0.0002938426,0.000698367,0.0005695288,0.001190415,0.0003489041],"domain_scores_gemma":[0.995309,0.001823724,0.0003920356,0.001872689,0.0004722613,0.0001302689],"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.000004614133,0.00002749116,0.00004300516,0.000001149899,0.00001272754,0.000001842663,0.0001722991,0.05951837,0.00001007539,0.0001667641,0.4605267,0.479515],"study_design_scores_gemma":[0.0002983657,0.00002959784,0.003311492,0.00002329288,0.00001230678,0.00006466539,0.0001205959,0.9326094,0.000003173961,0.02360753,0.0398225,0.00009710981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04440373,0.00008479565,0.9445597,0.005423245,0.004707209,0.0003391111,0.00001324845,0.00003913516,0.0004298444],"genre_scores_gemma":[0.6866053,0.000004395632,0.3074253,0.001933782,0.002836461,0.000006981461,0.00005425358,0.00002288691,0.00111069],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.873091,"threshold_uncertainty_score":0.9971217,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977733667","doi":"10.1093/comjnl/bxt106","title":"A New and Effective Approach to GML Documents Compression","year":2013,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; XML; Compression ratio; Information retrieval; Data mining; Compression (physics); Encoding (memory); Tree (set theory); Data compression; Pattern matching; Database; Artificial intelligence; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.008118702872697147,"gpt":0.2224352901072514,"spread":0.2143165872345542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003360964,0.0001197151,0.0001198979,0.00008486612,0.0002563944,0.001434451,0.001249361,0.00001770231,0.00001392194],"category_scores_gemma":[0.0000034395,0.00006944831,0.00003470081,0.0001805256,0.00001683601,0.001055661,0.001263084,0.0001968431,0.0001408666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001828275,"about_ca_system_score_gemma":0.00001120746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002614964,"about_ca_topic_score_gemma":1.471847e-7,"domain_scores_codex":[0.9990271,0.0001150899,0.0001432705,0.0002176452,0.0002519844,0.0002449551],"domain_scores_gemma":[0.9992854,0.00005468804,0.00006827922,0.0003377617,0.00003967841,0.0002141769],"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.000002135051,0.00002676965,0.00008292088,0.000003406203,0.00002998469,0.000003366174,0.0006098746,0.0001514362,0.00003376102,0.003638287,0.1414662,0.8539518],"study_design_scores_gemma":[0.002384032,0.0005288522,0.0760899,0.0001490973,0.00003288341,0.0007084245,0.00005774297,0.7988216,0.000176198,0.05135133,0.06906,0.0006399977],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00461835,0.00007090749,0.9902228,0.002208014,0.000582769,0.0003731583,2.469271e-7,0.00004418313,0.00187963],"genre_scores_gemma":[0.08876356,0.00002942933,0.9053482,0.003278306,0.001238232,0.00002288857,0.000001744753,0.00001348628,0.001304131],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8533118,"threshold_uncertainty_score":0.9996021,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2481557120","doi":"10.1093/comjnl/bxp010","title":"KRZYSZTOF J. CIOS, WITOLD PEDRYCZ, ROMAN W. SWINIARSKI and LUKASZ A. KURGAN * Data Mining: A Knowledge Discovery Approach. Springer * ((2007)). ISBN: 978-0387333335.  55.99. 606 pp. Hardcover.","year":2009,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Library science; Volume (thermodynamics); Computer science; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03357647038207046,"gpt":0.2682279704166801,"spread":0.2346515000346097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001467877,0.0004834327,0.0004998195,0.000160352,0.0009793082,0.002766044,0.005528431,0.000128459,0.00001727188],"category_scores_gemma":[0.00003734621,0.0003541825,0.0001363587,0.0005490521,0.0001869522,0.002651388,0.002478581,0.0008731418,0.00008535379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006778699,"about_ca_system_score_gemma":0.0002537968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001656231,"about_ca_topic_score_gemma":0.000004030454,"domain_scores_codex":[0.9966873,0.0002110804,0.0007003369,0.001056177,0.0005807237,0.0007643714],"domain_scores_gemma":[0.9960629,0.0002310813,0.0004189098,0.002758599,0.0001323619,0.0003961172],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002251791,0.0008600003,0.0005012712,0.00002876167,0.0001980838,0.0001098787,0.002965852,0.000141823,0.0002009576,0.01652545,0.5215384,0.456907],"study_design_scores_gemma":[0.001803202,0.000383274,0.02528784,0.0002196497,0.0001677041,0.004337808,0.0001824663,0.6544768,0.00008569286,0.002503131,0.3093273,0.001225186],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01761212,0.004427992,0.9677124,0.004779201,0.001552728,0.0004152548,0.00008045589,0.0002408691,0.003178962],"genre_scores_gemma":[0.2152992,0.001572786,0.7694806,0.003494156,0.008157976,0.00003072065,0.0001501213,0.0001016492,0.001712771],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.654335,"threshold_uncertainty_score":0.999891,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4283836478","doi":"10.1093/comjnl/bxac073","title":"Scalable Misinformation Mitigation in Social Networks Using Reverse Sampling","year":2022,"lang":"en","type":"article","venue":"The Computer Journal","topic":"SARS-CoV-2 detection and testing","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; University of British Columbia","funders":"","keywords":"Misinformation; Scalability; Computer science; Omega; Limiting; Set (abstract data type); Social network (sociolinguistics); Sampling (signal processing); Algorithm; Theoretical computer science; Discrete mathematics; Combinatorics; Mathematics; Computer security; Social media; Physics; Telecommunications; World Wide Web; Engineering; Quantum mechanics; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.06865938500797139,"gpt":0.3130549192846503,"spread":0.2443955342766789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007813881,0.00005678996,0.00009739652,0.0001140821,0.0007841193,0.00005949309,0.00006603426,0.00002247319,0.00003719844],"category_scores_gemma":[0.00001806669,0.00004711525,0.00005362335,0.0002861012,0.00001616965,0.0001283107,0.00005958987,0.000566977,0.000002657511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002192526,"about_ca_system_score_gemma":0.00005246158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001279292,"about_ca_topic_score_gemma":0.0000011202,"domain_scores_codex":[0.9992496,0.0000997234,0.0002492317,0.00005583195,0.0001998411,0.0001457499],"domain_scores_gemma":[0.9996709,0.00005131304,0.0001501967,0.00005576855,0.00005142628,0.00002039966],"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.0005359417,0.0002385023,0.01850872,0.00006715287,0.0001565116,0.0001707813,0.01315396,0.6226162,0.04165659,0.0004104787,0.01082462,0.2916605],"study_design_scores_gemma":[0.001024389,0.00005543932,0.004133363,0.00005089979,0.00002289303,0.002794809,0.0003198509,0.9878622,0.0005060137,0.0003879118,0.002773835,0.00006842053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8623956,0.00004100149,0.1361372,0.0004968383,0.0006023572,0.00008622044,3.476986e-7,0.00002402918,0.0002164181],"genre_scores_gemma":[0.9883198,0.000001238103,0.007276427,0.002975851,0.001402634,0.000001569349,0.000002885063,0.000009052138,0.0000105587],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3652459,"threshold_uncertainty_score":0.6030891,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972625929","doi":"10.1093/comjnl/bxv003","title":"Ambient and Context-Aware Services for the Future Web","year":2015,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Acadia University","funders":"","keywords":"Computer science; World Wide Web; Mobile Web; Mobile device; Context (archaeology); Mobile technology; Mobile computing; Multimedia; Context awareness; Web service; Upload; Internet privacy; Phone; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03363289118858721,"gpt":0.2554537796233071,"spread":0.2218208884347199,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001382169,0.0001672757,0.0002007827,0.00005964947,0.000565053,0.001056276,0.001372057,0.00005245326,0.000004204315],"category_scores_gemma":[0.000006758906,0.00008657667,0.0001080737,0.00015831,0.00006174637,0.0005978967,0.0004307198,0.0003211363,0.00002594973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004634969,"about_ca_system_score_gemma":0.00012491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000143247,"about_ca_topic_score_gemma":0.00008625715,"domain_scores_codex":[0.9986215,0.0002408507,0.0002739732,0.0002287486,0.0003610402,0.0002738782],"domain_scores_gemma":[0.9982529,0.0004693505,0.0002333835,0.000449129,0.0004065699,0.0001887194],"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.00004456368,0.00005479842,0.0007766672,0.00002765526,0.000172937,0.00001885993,0.007515968,0.0001004694,0.00004048004,0.002812329,0.04532597,0.9431093],"study_design_scores_gemma":[0.002299445,0.0003176441,0.003034843,0.0001095647,0.00004421342,0.003948819,0.002276455,0.4785922,0.00008618167,0.005892251,0.5030716,0.0003267564],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02632969,0.003103713,0.9288467,0.03595315,0.005146812,0.0004636567,0.000008118314,0.00009630232,0.0000519074],"genre_scores_gemma":[0.9896778,0.00008070688,0.002692408,0.004133068,0.003280303,0.00002236697,8.904667e-7,0.00001298166,0.00009942229],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9633482,"threshold_uncertainty_score":0.9999807,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4283788994","doi":"10.1093/comjnl/bxac081","title":"Understanding Performance of a Vulnerable Heterogeneous Edge Data Center: A Modeling Approach","year":2022,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Beijing Municipal Natural Science Foundation","keywords":"Computer science; Correctness; Enhanced Data Rates for GSM Evolution; Computer security; Edge computing; Data center; Internet of Things; Profit (economics); Distributed computing; Computer network; Artificial intelligence; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.1487472692416747,"gpt":0.2529726603947472,"spread":0.1042253911530725,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002378154,0.0001397757,0.0001892602,0.0001803399,0.001593292,0.0002387588,0.004480842,0.00001674471,0.000006775642],"category_scores_gemma":[0.000003850086,0.0001011855,0.00008554434,0.0004340674,0.00003470989,0.00007305025,0.005771833,0.0007408932,0.000001694132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001248366,"about_ca_system_score_gemma":0.00005179195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004457028,"about_ca_topic_score_gemma":1.41151e-7,"domain_scores_codex":[0.9979417,0.0004258643,0.0003688391,0.0003295972,0.0005844723,0.0003495452],"domain_scores_gemma":[0.9984652,0.00006966048,0.0002157768,0.001143195,0.00003479067,0.00007140351],"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.00001096878,0.0001066665,0.00006960631,0.00001578941,0.00006212514,0.00001372377,0.001103159,0.9867368,0.000004852159,0.001801245,0.001453462,0.008621593],"study_design_scores_gemma":[0.000394808,0.0001444957,0.000005360385,0.00002034766,0.0000106421,0.001532774,0.0001257612,0.9957385,0.000004654626,0.0006645891,0.001236684,0.0001213544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1302373,0.0002341121,0.867401,0.0006025207,0.0007584605,0.00009969236,0.000002505079,0.00005435465,0.0006100621],"genre_scores_gemma":[0.9742854,0.00001393578,0.0250058,0.0002929543,0.0003062909,0.000002590377,0.000002859272,0.00001156353,0.00007858485],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8440481,"threshold_uncertainty_score":0.9997065,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015251277","doi":"10.1093/comjnl/bxs110","title":"Modeling and Evaluation of a Metadata-Based Adaptive P2P Video-Streaming System","year":2012,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Metadata; Adaptation (eye); Bitstream; Codec; Distributed computing; Real-time computing; Multimedia; World Wide Web; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.07016241582279016,"gpt":0.2829747661228328,"spread":0.2128123503000426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004088638,0.0001401573,0.0002166806,0.0001878685,0.0002075953,0.0002264272,0.001048335,0.00004722349,8.634503e-7],"category_scores_gemma":[0.00003838393,0.00009420254,0.00005819415,0.0003075079,0.00003919993,0.0008782344,0.0005013481,0.0002552199,0.000004291303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001235495,"about_ca_system_score_gemma":0.0000880507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001217506,"about_ca_topic_score_gemma":0.000001780225,"domain_scores_codex":[0.998117,0.000347962,0.0003303059,0.0001755125,0.0007072716,0.0003219756],"domain_scores_gemma":[0.9986901,0.0001552043,0.0001834735,0.0005113021,0.0003542597,0.0001056897],"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.00001481307,0.00004039459,0.0001991483,0.00001501367,0.0001059548,0.000003964858,0.001189765,0.7047073,0.000203765,0.01298633,0.0004242742,0.2801093],"study_design_scores_gemma":[0.0003004662,0.00006994759,0.0003947119,0.0001228878,0.00006105279,0.0001964324,0.0001008632,0.9971132,0.0004262483,0.001069818,0.00003981323,0.0001045573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.194687,0.0009216788,0.80308,0.0006082329,0.0004209403,0.0001491738,0.000001060825,0.00009169666,0.00004020375],"genre_scores_gemma":[0.7742931,0.000002815095,0.2253945,0.0000869102,0.0002081381,0.000005983624,3.164232e-7,0.000005941019,0.000002222643],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5796061,"threshold_uncertainty_score":0.3841468,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402575256","doi":"10.1093/comjnl/bxae082","title":"Efficient object detector via dynamic prior and dynamic feature fusion","year":2024,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"Natural Science Foundation of Fujian Province; National Natural Science Foundation of China","keywords":"Computer science; Feature (linguistics); Computation; Overhead (engineering); Detector; Artificial intelligence; Generator (circuit theory); Inference; Object detection; Pattern recognition (psychology); Object (grammar); Fusion; Process (computing); Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.005758767124131667,"gpt":0.2469275378236761,"spread":0.2411687706995445,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002941813,0.0001772857,0.0001363077,0.0001138148,0.0005482323,0.0005409448,0.0008706545,0.0000503876,0.000004626892],"category_scores_gemma":[0.000004168078,0.0001107828,0.00008576463,0.0004905403,0.00006754671,0.0001462436,0.0005133264,0.0006673794,0.00004305533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001054868,"about_ca_system_score_gemma":0.00004691666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.268728e-7,"about_ca_topic_score_gemma":0.000003486409,"domain_scores_codex":[0.9987864,0.0000986806,0.0001946409,0.000350553,0.000264035,0.0003056852],"domain_scores_gemma":[0.9990883,0.0002243792,0.00007832765,0.0004359527,0.00004977173,0.0001232629],"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.000006354638,0.00002308445,0.00000448878,0.00001569076,0.00002812919,0.00008019543,0.0006095171,0.0217708,0.004638363,0.001734934,0.0007255989,0.9703628],"study_design_scores_gemma":[0.000128306,0.00006442,0.001580109,0.00006514916,0.00001175286,0.002829511,0.000003867751,0.9868018,0.0000551916,0.00587528,0.002445579,0.0001390336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06978108,0.00330563,0.9193738,0.005939261,0.001161696,0.0001971815,0.000001331541,0.0002133446,0.00002665783],"genre_scores_gemma":[0.8942538,0.000200506,0.1046128,0.0004293911,0.0003187826,0.000008431113,8.261526e-7,0.00002106223,0.0001543684],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9702238,"threshold_uncertainty_score":0.5216343,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098048233","doi":"10.1093/comjnl/bxu041","title":"SLA-Based Time-Aware Provisioning Mechanisms in Shared Mesh Protected Optical Networks","year":2014,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":1,"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; Dalhousie University","funders":"","keywords":"Computer science; Provisioning; Optical mesh network; Computer network; Distributed computing; Operating system; Wireless mesh network","retraction":null,"screen_n_in":null,"score":{"opus":0.005933923430842207,"gpt":0.1931719418656664,"spread":0.1872380184348242,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004831173,0.0002135969,0.0002607444,0.0001091758,0.000146647,0.0001469326,0.0005809609,0.0001556482,0.00003858009],"category_scores_gemma":[0.0000578951,0.0001491285,0.00007138176,0.0003132871,0.00006202491,0.0001359625,0.0001424766,0.001200646,0.00003293348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009220251,"about_ca_system_score_gemma":0.00001439218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.652593e-7,"about_ca_topic_score_gemma":0.000001062131,"domain_scores_codex":[0.9986798,0.00008415158,0.000347654,0.0001697614,0.0002166156,0.0005020598],"domain_scores_gemma":[0.9992346,0.0002594178,0.00005543622,0.0003049371,0.00005471464,0.00009093969],"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.00001455425,0.0000136949,0.00001050005,0.0000079232,0.00001418523,0.00002080552,0.00001905106,0.9235469,0.0002734087,0.00143793,0.0005318547,0.07410923],"study_design_scores_gemma":[0.0004844449,0.0001185036,0.0002615541,0.0001631668,0.000007391173,0.00006702125,0.000004734865,0.9885175,0.0002533801,0.009731835,0.0001974932,0.0001929814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006919196,0.00006655247,0.9911017,0.0005116996,0.000315122,0.0002743838,5.150979e-7,0.0006611035,0.0001497016],"genre_scores_gemma":[0.5705232,0.000008489561,0.4287894,0.000173606,0.0004122485,0.00002364707,0.000003215561,0.00005478081,0.00001133436],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5636041,"threshold_uncertainty_score":0.6081282,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4287992578","doi":"10.1093/comjnl/bxab108","title":"Be Scalable and Rescue My Slices During Reconfiguration","year":2021,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Software-Defined Networks and 5G","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":"Concordia University","funders":"Erasmus Universiteit Rotterdam; Agence Nationale de la Recherche","keywords":"Control reconfiguration; Rescue therapy; Scalability; Computer science; Embedded system; Operating system; Medicine; Internal medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.01671383524661623,"gpt":0.2203276587570305,"spread":0.2036138235104143,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004032352,0.00009642716,0.000119597,0.00004070671,0.0005256032,0.0008693152,0.0004484876,0.00003729319,0.00002738581],"category_scores_gemma":[0.00001445666,0.0000665882,0.00004885689,0.0002101336,0.00002871074,0.0004648772,0.0002583959,0.0002857888,0.000009411261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001927048,"about_ca_system_score_gemma":0.00005581525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005827413,"about_ca_topic_score_gemma":0.00001039843,"domain_scores_codex":[0.9990415,0.0001422379,0.0002037121,0.000199949,0.0001887358,0.0002238754],"domain_scores_gemma":[0.999312,0.0001118235,0.00006662239,0.0003050076,0.0001116336,0.00009294073],"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.00006135922,0.0002056415,0.006369515,0.00008104953,0.0003266574,0.001073739,0.009446229,0.02810627,0.004267729,0.0377821,0.05413149,0.8581482],"study_design_scores_gemma":[0.002611634,0.0002609023,0.1334685,0.0003855765,0.00004992222,0.02005601,0.0001524244,0.7674136,0.008903903,0.02800598,0.0378202,0.000871393],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4179502,0.001734884,0.5672515,0.01119803,0.001320966,0.0000551071,5.39129e-7,0.00009230523,0.0003964915],"genre_scores_gemma":[0.8428292,0.001135042,0.1471548,0.004473307,0.003317554,0.000004813634,0.000002352305,0.00002409841,0.001058897],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8572768,"threshold_uncertainty_score":0.8382826,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113143036","doi":"10.1093/comjnl/bxs136","title":"Design Automation Framework for Reconfigurable Interconnection Networks","year":2012,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Interconnection Networks and Systems","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":"Wilfrid Laurier University","funders":"","keywords":"Interconnection; Automation; Library science; Computer science; Media studies; Telecommunications; Sociology; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04382466505328358,"gpt":0.2694400138377506,"spread":0.225615348784467,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002850532,0.0001486359,0.000176044,0.00008932308,0.0006515979,0.000665715,0.0007434273,0.0001118348,0.00002900457],"category_scores_gemma":[0.00003481083,0.00009880623,0.0001443568,0.000214653,0.00001934036,0.001009192,0.00005862525,0.0004226598,0.00003468403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009680828,"about_ca_system_score_gemma":0.00002630538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002419159,"about_ca_topic_score_gemma":4.648101e-7,"domain_scores_codex":[0.998389,0.0004201728,0.0004031161,0.0001590352,0.0001627366,0.0004659235],"domain_scores_gemma":[0.9983076,0.000749906,0.000293847,0.0003448196,0.0001764924,0.0001273787],"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.00005631664,0.0001086256,0.0001187089,0.00001434796,0.0001807869,0.000002434204,0.004828357,0.2585285,0.00005624455,0.3407332,0.0928802,0.3024923],"study_design_scores_gemma":[0.000195663,0.0001547028,0.0001564011,0.0000776536,0.000009469335,0.0008733241,0.00003337855,0.9656556,0.0001203703,0.02534397,0.007238866,0.0001406287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004842826,0.0003322579,0.9820363,0.001411097,0.01508604,0.0002933886,1.586758e-7,0.0001425535,0.0002139344],"genre_scores_gemma":[0.6247298,0.00002472759,0.3681276,0.00111899,0.005835884,0.00003143738,7.395769e-7,0.00001609032,0.0001147437],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7071271,"threshold_uncertainty_score":0.6419505,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4416109760","doi":"10.1093/comjnl/bxaf124","title":"CV content recognition using YOLOv8 and Tesseract-OCR deep learning","year":2025,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Text and Document Classification Technologies","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Preprocessor; Consistency (knowledge bases); Sorting; Variety (cybernetics); Deep learning; Hyperparameter; Analytics; Precision and recall; Component (thermodynamics)","retraction":null,"screen_n_in":null,"score":{"opus":0.06729306244984125,"gpt":0.276650143117134,"spread":0.2093570806672927,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004022295,0.00009309092,0.0001080092,0.0001475782,0.0005209768,0.0006248247,0.0005694479,0.00004270021,0.000007698448],"category_scores_gemma":[0.00004067122,0.00006330805,0.00004086788,0.0002381881,0.0000628835,0.0004523409,0.00032779,0.0003972688,0.00001117962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004225445,"about_ca_system_score_gemma":0.00003030395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000338956,"about_ca_topic_score_gemma":5.650838e-7,"domain_scores_codex":[0.9992183,0.0001129207,0.0002149415,0.0001589413,0.0001254244,0.0001694406],"domain_scores_gemma":[0.9993472,0.0001495346,0.0001545522,0.000199676,0.0001153394,0.00003377111],"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.00000519518,0.00002076209,0.001105798,0.000004868774,0.00003093556,0.000006187068,0.0003474786,0.0002106069,0.001291914,0.009431734,0.0004165993,0.9871279],"study_design_scores_gemma":[0.00104485,0.0001680421,0.0254674,0.0002332875,0.00004087526,0.00073135,0.0005808101,0.8363416,0.003230596,0.1233328,0.00849969,0.0003286637],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1191509,0.0006195778,0.8717293,0.007574519,0.0005190886,0.0000661232,1.032022e-7,0.000150513,0.000189973],"genre_scores_gemma":[0.9030192,0.0003091179,0.09552859,0.0008183647,0.000135297,0.000003084682,6.688492e-7,0.000005068252,0.0001806325],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9867992,"threshold_uncertainty_score":0.6025199,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2295232165","doi":"10.1093/comjnl/bxv018","title":"Mining Social Media for Knowledge Discovery","year":2015,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Recommender Systems and Techniques","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":"York University","funders":"","keywords":"Library science; Social media; Computer science; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.1109428658639377,"gpt":0.3085844912282509,"spread":0.1976416253643132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001381052,0.0001126536,0.0001732403,0.00006945008,0.0003244425,0.0007847594,0.001237435,0.00004295479,8.165994e-7],"category_scores_gemma":[0.00002473864,0.00006882849,0.0001255594,0.0001254987,0.00002998478,0.0006227935,0.0003356669,0.0001709767,0.000007330457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005856292,"about_ca_system_score_gemma":0.0001255942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001341814,"about_ca_topic_score_gemma":0.000003101361,"domain_scores_codex":[0.9989998,0.0001533754,0.000258404,0.0001468181,0.0001899146,0.000251707],"domain_scores_gemma":[0.9990436,0.0003253813,0.0001509597,0.0002175225,0.0001580615,0.0001044129],"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.000009629058,0.00005876294,0.00007712573,0.000008524144,0.00005155223,0.00001054333,0.02541201,0.00001186753,0.00002316707,0.06837844,0.5683162,0.3376421],"study_design_scores_gemma":[0.003760454,0.0007283431,0.002452415,0.0001982122,0.00005015341,0.003018229,0.001301145,0.1949562,0.0009609251,0.2706701,0.5208247,0.001079111],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004263919,0.0002901139,0.9873943,0.00320852,0.003583963,0.0001007183,9.084974e-7,0.00009625352,0.001061309],"genre_scores_gemma":[0.7578585,0.00001028495,0.2326032,0.0006380746,0.008580893,0.00002131796,0.00000131922,0.0000214459,0.0002649616],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7547911,"threshold_uncertainty_score":0.7567452,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}