{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Dragan Gašević","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.005108945,0.001036508,0.001207807,0.009843413,0.001228029,0.001669763,0.001529963,0.00176047,0.00640064],"category_scores_gemma":[0.02350937,0.0006553412,0.0007502857,0.003639013,0.0005802275,0.003279973,0.002210915,0.001460611,0.005520111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007553934,"about_ca_system_score_gemma":0.001960662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001870944,"about_ca_topic_score_gemma":0.001491275,"domain_scores_codex":[0.9948626,0.0007821222,0.0009842059,0.001118965,0.002089581,0.0001625079],"domain_scores_gemma":[0.9809137,0.004467306,0.002479027,0.003502612,0.007959499,0.0006779253],"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.0007662558,0.0006921408,0.01787493,0.001009419,0.0001821269,0.0006403974,0.001175553,0.002919947,0.08184329,0.004546536,0.03031723,0.8580322],"study_design_scores_gemma":[0.0006713851,0.002359948,0.1062169,0.0004080355,0.0004427875,0.006117919,0.0008597667,0.4040574,0.3362769,0.01063942,0.131169,0.0007805231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04420534,0.0003884406,0.7694525,0.0003423735,0.0001423209,0.002178854,0.002676177,0.176255,0.004358974],"genre_scores_gemma":[0.1919053,0.0002676209,0.7892629,0.0001984278,0.0001163937,0.001286733,0.007908975,0.002571124,0.006482523],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9982395,"threshold_uncertainty_score":0.02701896,"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","authors":[{"name":"Iris van Rooij","is_ca":false},{"name":"Todd Wareham","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00349657,0.001257259,0.001447327,0.002187316,0.001061874,0.004547901,0.002026389,0.001907323,0.002866352],"category_scores_gemma":[0.01629807,0.0007222102,0.00204256,0.002518943,0.007391505,0.01137916,0.003209304,0.004073173,0.0003984741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002799771,"about_ca_system_score_gemma":0.001490832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003319251,"about_ca_topic_score_gemma":0.001905144,"domain_scores_codex":[0.9977939,0.001080193,0.0001368661,0.0003612164,0.0004883066,0.0001395187],"domain_scores_gemma":[0.985865,0.0105472,0.0007934999,0.001689692,0.000760118,0.0003444332],"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.00001103185,0.00001181414,0.000324988,0.00009825271,0.0000262462,0.00004118316,0.0001731333,0.02830268,0.0001699905,0.9594258,0.0005194477,0.01089554],"study_design_scores_gemma":[0.000002185241,0.000003732353,0.00006858883,0.00001331895,0.00000458917,0.00001570224,0.00002601489,0.03318869,0.00005294244,0.9652498,0.001365713,0.0000087437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01339171,0.004879914,0.965408,0.00511201,0.0001104258,0.00004043014,0.000119747,0.0001653961,0.01077229],"genre_scores_gemma":[0.704376,0.01072205,0.2776458,0.0007537378,0.001136667,0.0003582838,0.0003751428,0.0002743722,0.004357882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004547901,"threshold_uncertainty_score":0.0203138,"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","authors":[{"name":"Jacqueline E. Rice","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006601769,0.0008773797,0.0007836049,0.001389947,0.001125442,0.001614553,0.001193095,0.002085023,0.01654539],"category_scores_gemma":[0.001948983,0.0007884221,0.001012662,0.001912211,0.003022463,0.003803338,0.001347064,0.004100827,0.00327306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001056923,"about_ca_system_score_gemma":0.0006657518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004886881,"about_ca_topic_score_gemma":0.0006887735,"domain_scores_codex":[0.999305,0.000140441,0.00005123701,0.000138372,0.0002859977,0.00007896411],"domain_scores_gemma":[0.9991461,0.0005582206,0.00003631971,0.0001003578,0.0001340289,0.00002502397],"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.00003280085,0.00002062782,0.00005906626,0.000504899,0.00001377044,0.0001075258,0.0001171055,0.002767038,0.00282387,0.9330311,0.009303459,0.05121863],"study_design_scores_gemma":[0.00001703874,0.0001124288,0.0001009421,0.0003163724,0.00002064515,0.000485372,0.00003555631,0.006037716,0.004377908,0.6123552,0.3760848,0.00005612179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00611356,0.1267977,0.5916951,0.007424345,0.008642332,0.0002919613,0.000782655,0.001117378,0.257135],"genre_scores_gemma":[0.2327401,0.2117365,0.3494948,0.01220555,0.01138655,0.001184055,0.0007927394,0.0009101045,0.1795497],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01654539,"threshold_uncertainty_score":0.05534983,"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","authors":[{"name":"Shahid Alam","is_ca":true},{"name":"Issa Traoré","is_ca":true},{"name":"İbrahim Soğukpınar","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004075236,0.0007562732,0.0003448826,0.00354347,0.0004932203,0.0004961991,0.0006287106,0.0005321849,0.001822463],"category_scores_gemma":[0.00284714,0.000215347,0.0006168522,0.00177941,0.0004943242,0.001255093,0.0004563509,0.0005327234,0.000432352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009220264,"about_ca_system_score_gemma":0.001485101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008799989,"about_ca_topic_score_gemma":0.01043052,"domain_scores_codex":[0.9994888,0.00008013719,0.00003595281,0.0001388876,0.0002063572,0.00004979657],"domain_scores_gemma":[0.9980703,0.0007761852,0.0002739461,0.000379511,0.0004462592,0.00005390581],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0007004026,0.0003499571,0.02502534,0.0008648253,0.0001092283,0.0006231019,0.0003414589,0.1172594,0.06432373,0.02764311,0.018177,0.7445825],"study_design_scores_gemma":[0.00003954867,0.0002418614,0.008604784,0.0001233198,0.0001029461,0.0005203368,0.0001072091,0.8574967,0.05639366,0.04993116,0.02638013,0.00005829811],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1083165,0.0008267813,0.857265,0.000339728,0.00009004,0.0004698452,0.005595693,0.02321675,0.003879659],"genre_scores_gemma":[0.5338277,0.0004233111,0.4496921,0.0002269695,0.00005820004,0.0004504499,0.01174529,0.0007039308,0.002871887],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008799989,"threshold_uncertainty_score":0.01749754,"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","authors":[{"name":"Robert M. Hierons","is_ca":false},{"name":"Hasan Ural","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007625769,0.001317756,0.001060923,0.0009678589,0.001215309,0.002620189,0.002536442,0.002239783,0.005864616],"category_scores_gemma":[0.03255501,0.0009148127,0.001425349,0.001025116,0.007982695,0.0114022,0.004471234,0.007036853,0.0009151223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002208828,"about_ca_system_score_gemma":0.002076452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002877888,"about_ca_topic_score_gemma":0.002168197,"domain_scores_codex":[0.9874991,0.005357737,0.0005450567,0.002655086,0.003374699,0.0005684669],"domain_scores_gemma":[0.8898235,0.08440849,0.002465082,0.01808707,0.004241142,0.000974735],"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.001176775,0.0003291224,0.006327148,0.0006186896,0.0001407894,0.0007159643,0.0008511469,0.2108372,0.02435666,0.5750541,0.00266356,0.1769288],"study_design_scores_gemma":[0.0003674367,0.0006899696,0.002215872,0.0001581094,0.0001508351,0.000704055,0.000257602,0.4557096,0.02646813,0.5006284,0.01257027,0.00007969049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.140746,0.001352203,0.8083158,0.00659925,0.0002085581,0.000191206,0.0001460735,0.001874748,0.04056612],"genre_scores_gemma":[0.8309551,0.0005456351,0.1627312,0.0006053902,0.0002284694,0.0002048517,0.0001204928,0.0002997375,0.004309133],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007625769,"threshold_uncertainty_score":0.04032946,"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","authors":[{"name":"Adenilso Simão","is_ca":true},{"name":"Alexandre Petrenko","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001517004,0.0007737144,0.0007393876,0.001092476,0.000299435,0.0004812633,0.001708216,0.000805294,0.001785807],"category_scores_gemma":[0.01239697,0.0003147856,0.0008445474,0.0006565127,0.0007639279,0.00116276,0.001256554,0.0007233281,0.0003253499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005268463,"about_ca_system_score_gemma":0.0009042434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009810092,"about_ca_topic_score_gemma":0.001465401,"domain_scores_codex":[0.9981159,0.0007553839,0.0000929072,0.0002193949,0.0006462151,0.0001702218],"domain_scores_gemma":[0.9901519,0.007356594,0.0003745306,0.001125137,0.0008762275,0.0001156461],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004427719,0.0002809675,0.00393035,0.0004197001,0.0001019865,0.0008269128,0.0002739082,0.4443805,0.03105246,0.02948575,0.00320916,0.4855955],"study_design_scores_gemma":[0.0000597106,0.0001661758,0.0005266112,0.00002119455,0.00003837259,0.0002783417,0.0000221221,0.9648488,0.01764488,0.0145734,0.001805077,0.00001529221],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03763247,0.0001040596,0.95919,0.0001038357,0.00001390645,0.0001439715,0.00007512257,0.001797283,0.0009394312],"genre_scores_gemma":[0.4836313,0.0001070678,0.5137641,0.0001538143,0.0000255311,0.0003380112,0.0007469504,0.0003047542,0.0009284341],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001785807,"threshold_uncertainty_score":0.008022726,"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","authors":[{"name":"Shenwei Huang","is_ca":true},{"name":"Matthew Johnson","is_ca":false},{"name":"Daniël Paulusma","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005094051,0.002578138,0.003391042,0.001978796,0.003382545,0.007986091,0.00553412,0.003676964,0.01524059],"category_scores_gemma":[0.01977514,0.001444959,0.005615197,0.002503831,0.004844065,0.0181619,0.008777495,0.009422977,0.003024542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008475292,"about_ca_system_score_gemma":0.008529507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01346593,"about_ca_topic_score_gemma":0.01672186,"domain_scores_codex":[0.9914136,0.001891428,0.000401279,0.002426544,0.001991628,0.00187556],"domain_scores_gemma":[0.965297,0.0258971,0.001044412,0.005109107,0.001429446,0.001222888],"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.00334319,0.001436264,0.005294503,0.002897772,0.0003560547,0.0006999359,0.0022998,0.3007739,0.01510434,0.3341795,0.0729192,0.2606955],"study_design_scores_gemma":[0.0003256963,0.0001724465,0.000865593,0.0002288426,0.0001739464,0.0002438613,0.0004070605,0.3792864,0.004408699,0.6022221,0.01157974,0.00008543284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2211447,0.004846296,0.6761814,0.02326168,0.001172266,0.001041426,0.004263837,0.008385731,0.05970262],"genre_scores_gemma":[0.5729876,0.002853251,0.3896256,0.005110063,0.0008906751,0.0008053542,0.006606899,0.003320723,0.01779988],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01524059,"threshold_uncertainty_score":0.0614928,"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","authors":[{"name":"Panos Giannopoulos","is_ca":false},{"name":"Christian Knauer","is_ca":false},{"name":"Sue Whitesides","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003338533,0.002200375,0.00276608,0.002171628,0.002023846,0.009519055,0.005294964,0.003147067,0.02312519],"category_scores_gemma":[0.03324318,0.001493572,0.003877973,0.006292051,0.003517211,0.01931891,0.004464383,0.008258156,0.002229699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005755316,"about_ca_system_score_gemma":0.002216213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002276235,"about_ca_topic_score_gemma":0.00204442,"domain_scores_codex":[0.9908491,0.00242506,0.0006605537,0.0021619,0.002911804,0.0009915007],"domain_scores_gemma":[0.9652979,0.02591083,0.001597578,0.005336847,0.001229052,0.0006277207],"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.000174258,0.0001877387,0.001750886,0.001037983,0.000194065,0.0001859309,0.0004152179,0.1550118,0.001436332,0.7637931,0.01313591,0.06267682],"study_design_scores_gemma":[0.0000393145,0.00002847457,0.0004946727,0.00007241416,0.00004543021,0.0002074138,0.0001091334,0.1022026,0.0006777915,0.8850458,0.01105212,0.00002482696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06062192,0.006090878,0.8695698,0.007767146,0.0003619074,0.0004539694,0.00338079,0.00123905,0.05051446],"genre_scores_gemma":[0.658579,0.01125784,0.2932401,0.001309493,0.001639381,0.001872082,0.009684093,0.001608292,0.02080971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02312519,"threshold_uncertainty_score":0.07736152,"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","authors":[{"name":"Salman Niksefat","is_ca":false},{"name":"Babak Sadeghiyan","is_ca":false},{"name":"Payman Mohassel","is_ca":true},{"name":"Saeed Sadeghian","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002979402,0.0007581803,0.001236964,0.001057166,0.001025335,0.002729236,0.003283498,0.001333134,0.00272812],"category_scores_gemma":[0.006923927,0.0007492987,0.001108374,0.001073181,0.002312437,0.005009162,0.005182493,0.003172212,0.0009872214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001502431,"about_ca_system_score_gemma":0.002738345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001573644,"about_ca_topic_score_gemma":0.001219062,"domain_scores_codex":[0.9952528,0.001112698,0.0004799323,0.0007239257,0.001933782,0.0004968055],"domain_scores_gemma":[0.9957922,0.001056078,0.0003804842,0.00209459,0.0004665014,0.0002102404],"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.002652665,0.0007241915,0.005933841,0.0005852092,0.0004350075,0.0007696747,0.001009099,0.1675968,0.07860164,0.3767746,0.01542391,0.3494933],"study_design_scores_gemma":[0.0002753242,0.0002332258,0.0005130936,0.000029429,0.00008963436,0.0002710552,0.00007081107,0.8431348,0.05027945,0.09078396,0.01423836,0.00008092509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01974645,0.00008127216,0.968708,0.0003372167,0.00006444614,0.0003434387,0.0001934647,0.008899639,0.001626167],"genre_scores_gemma":[0.603636,0.0001597173,0.3897482,0.0003220513,0.00005900143,0.0006141703,0.000662176,0.0004175523,0.004381162],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003283498,"threshold_uncertainty_score":0.01575673,"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","authors":[{"name":"Hongli Liang","is_ca":false},{"name":"Jue Wang","is_ca":false},{"name":"Yiyu Yao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004992149,0.0007543112,0.001143071,0.001629943,0.0004632553,0.001229992,0.0009843924,0.0009836068,0.002243311],"category_scores_gemma":[0.01245274,0.0002346661,0.0008948023,0.00194637,0.0007281132,0.0013921,0.0007217485,0.0008321516,0.0006919582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005348351,"about_ca_system_score_gemma":0.0005956849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004982667,"about_ca_topic_score_gemma":0.0005770582,"domain_scores_codex":[0.9951971,0.003000994,0.0002189885,0.000337209,0.001150264,0.00009538413],"domain_scores_gemma":[0.9934307,0.00469476,0.0003067054,0.0007129408,0.0007877324,0.00006711471],"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.0004341239,0.0002331,0.002701259,0.0005328047,0.0002195173,0.0002981611,0.0002234361,0.07125762,0.009441113,0.05716111,0.008500844,0.8489969],"study_design_scores_gemma":[0.0001039221,0.0003727086,0.001951544,0.00009868526,0.00009662223,0.0004871617,0.00009927096,0.8368421,0.0105718,0.1332984,0.01598595,0.00009187002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00677014,0.0006574808,0.9906656,0.0002331113,0.00002986187,0.0001067536,0.0000605592,0.0005005348,0.0009759346],"genre_scores_gemma":[0.262269,0.0007186486,0.7344736,0.0002062675,0.0001756228,0.0005471587,0.000503273,0.00008929531,0.001017141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004992149,"threshold_uncertainty_score":0.02640128,"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","authors":[{"name":"Daniel Lemire","is_ca":true},{"name":"Owen Kaser","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003129991,0.0007675854,0.001143807,0.001335466,0.001481905,0.001946773,0.001291709,0.001235187,0.005397362],"category_scores_gemma":[0.01568529,0.0009167677,0.001041351,0.001657899,0.003151839,0.008359399,0.005348,0.002048469,0.002212832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009177064,"about_ca_system_score_gemma":0.00142388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004123879,"about_ca_topic_score_gemma":0.0003470936,"domain_scores_codex":[0.9965251,0.0006539154,0.0002238329,0.0006121811,0.001475572,0.0005094032],"domain_scores_gemma":[0.9859471,0.005671556,0.0009324611,0.004992083,0.002130494,0.0003261539],"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.001105362,0.0002053768,0.00437996,0.0007962561,0.0001238093,0.0003755199,0.0008112245,0.03070395,0.03865829,0.5924414,0.01633555,0.3140632],"study_design_scores_gemma":[0.0001555557,0.000692635,0.001721253,0.0002023793,0.0001707803,0.001441933,0.000263512,0.1954061,0.09258739,0.6660937,0.04107594,0.0001887349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1475542,0.002541016,0.8121847,0.001567573,0.0004000244,0.0002223143,0.0004340022,0.006501038,0.02859512],"genre_scores_gemma":[0.8498017,0.001089434,0.1367737,0.001079312,0.0005077657,0.0003167949,0.0005537298,0.001039667,0.008837841],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005397362,"threshold_uncertainty_score":0.01805592,"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","authors":[{"name":"Behzad Akbarpour","is_ca":false},{"name":"Amr T. Abdel-Hamid","is_ca":false},{"name":"Sofiène Tahar","is_ca":true},{"name":"J. Hartwell Harrison","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004165146,0.0002350766,0.0001838128,0.0002432512,0.0002282064,0.0004572152,0.0006085255,0.0003169565,0.002790478],"category_scores_gemma":[0.001184697,0.0001050909,0.0002684765,0.0001435071,0.0003634988,0.000440701,0.0001827816,0.0003304191,0.0003453582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005454663,"about_ca_system_score_gemma":0.0009722076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001676089,"about_ca_topic_score_gemma":0.001748119,"domain_scores_codex":[0.9997635,0.00004181157,0.00002339004,0.00003644621,0.00009210655,0.00004273299],"domain_scores_gemma":[0.9993652,0.0003180679,0.00005633831,0.0001125255,0.0001352081,0.00001268078],"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.0008890009,0.0003426255,0.006373287,0.001081663,0.0001321587,0.001703031,0.0006506973,0.4176005,0.2857308,0.1310324,0.004006657,0.1504572],"study_design_scores_gemma":[0.0001855268,0.0007202758,0.001715091,0.00005487243,0.00008721944,0.0003205521,0.0001079488,0.5607014,0.4087154,0.01160535,0.0157457,0.00004061306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3405315,0.0001326722,0.6433953,0.0002183493,0.0001380608,0.0001391426,0.000486095,0.004963511,0.009995429],"genre_scores_gemma":[0.9023285,0.0000529219,0.0947872,0.00004780808,0.000006122849,0.00004574862,0.0002050061,0.0001076805,0.002418945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002790478,"threshold_uncertainty_score":0.009335101,"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","authors":[{"name":"Emilio Di Giacomo","is_ca":false},{"name":"Walter Didimo","is_ca":false},{"name":"Giuseppe Liotta","is_ca":false},{"name":"Henk Meijer","is_ca":false},{"name":"Stephen Wismath","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005423902,0.0007772963,0.0004551438,0.0008383244,0.0006609761,0.001622626,0.001206195,0.001211377,0.007927794],"category_scores_gemma":[0.003551822,0.0007159519,0.0007761476,0.001003852,0.002004897,0.004951664,0.003183235,0.001969601,0.0009250278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000609729,"about_ca_system_score_gemma":0.0004373768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005953024,"about_ca_topic_score_gemma":0.0008814408,"domain_scores_codex":[0.99878,0.0002115036,0.00006293785,0.0004139452,0.0003495082,0.0001822114],"domain_scores_gemma":[0.9975786,0.0007186956,0.000441374,0.0006182706,0.000402354,0.0002407216],"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.0002288884,0.00008876606,0.001672032,0.0002957873,0.00004537191,0.0007151915,0.0005399249,0.03879884,0.01953894,0.8789573,0.003133203,0.05598569],"study_design_scores_gemma":[0.000074687,0.0003630557,0.003538768,0.00008573334,0.00008927253,0.002522412,0.001276606,0.1568373,0.01451458,0.7765977,0.04401856,0.00008134884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2747386,0.0005557368,0.6745172,0.0009705124,0.000154789,0.0001387727,0.0007652093,0.0004531451,0.04770597],"genre_scores_gemma":[0.8328232,0.000553224,0.1505231,0.0002203814,0.0001015475,0.0001552315,0.001094755,0.00013077,0.01439785],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007927794,"threshold_uncertainty_score":0.02652115,"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","authors":[{"name":"Zoran Djuric","is_ca":false},{"name":"Dragan Gašević","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004268182,0.0007929598,0.0008442332,0.001108584,0.001898584,0.002832283,0.002396579,0.001891521,0.01054073],"category_scores_gemma":[0.007090645,0.0005200105,0.0008098253,0.0008711705,0.001903453,0.005209825,0.003485221,0.002266741,0.003158795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001347856,"about_ca_system_score_gemma":0.003136022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002378316,"about_ca_topic_score_gemma":0.001428441,"domain_scores_codex":[0.9968951,0.0009197136,0.0003861419,0.0003664145,0.001072841,0.0003598038],"domain_scores_gemma":[0.9979235,0.0006147572,0.0002321974,0.0006168127,0.0004426974,0.0001700281],"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.001553423,0.0006543403,0.002238465,0.00062516,0.0001394724,0.001709189,0.001193255,0.06096841,0.02287788,0.6491619,0.04326191,0.2156164],"study_design_scores_gemma":[0.0006442246,0.0005023621,0.001131076,0.0002215399,0.0001272592,0.001415409,0.0001670215,0.5908303,0.0276676,0.2116808,0.1653604,0.0002519602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0154637,0.0001932853,0.9592894,0.0005694717,0.0002208158,0.001050398,0.0004882282,0.01260467,0.01012006],"genre_scores_gemma":[0.4206927,0.0004629292,0.551873,0.000557814,0.0002102477,0.001394003,0.001608828,0.0008458674,0.02235467],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01054073,"threshold_uncertainty_score":0.03526223,"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","authors":[{"name":"Dung Hoang Duong","is_ca":false},{"name":"Willy Susilo","is_ca":false},{"name":"Ha Thanh Nguyen Tran","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00123044,0.0003830934,0.0007893389,0.0008173609,0.0008859112,0.001697989,0.000878088,0.001099092,0.008181875],"category_scores_gemma":[0.001712512,0.0001907411,0.0005788457,0.0011687,0.001133726,0.002931823,0.002019686,0.001145159,0.002210317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008291095,"about_ca_system_score_gemma":0.001325898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002724485,"about_ca_topic_score_gemma":0.0001695108,"domain_scores_codex":[0.9982754,0.0004452417,0.0001665012,0.0003089607,0.0005583879,0.0002455699],"domain_scores_gemma":[0.9985655,0.0002073565,0.0003047258,0.0004597384,0.0002577797,0.0002048929],"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.0008909325,0.0002481587,0.000727024,0.0003360079,0.00005398676,0.0002820901,0.0003050734,0.01838525,0.09715436,0.7577702,0.008902675,0.1149442],"study_design_scores_gemma":[0.000552466,0.001283365,0.001600501,0.00008488735,0.0001222161,0.001959298,0.0001373473,0.2911484,0.1608134,0.3339097,0.2079349,0.0004535664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1062942,0.0006373489,0.8556506,0.001657043,0.0005111503,0.0004709696,0.001165976,0.002669355,0.03094332],"genre_scores_gemma":[0.7934979,0.0004794343,0.1813009,0.0003805213,0.0002877227,0.0002169123,0.0006087949,0.00009156571,0.02313635],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008181875,"threshold_uncertainty_score":0.02737111,"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","authors":[{"name":"Gaurav Bhatnagar","is_ca":true},{"name":"Q. M. Jonathan Wu","is_ca":true},{"name":"Baranidharan Raman","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003043686,0.0003756616,0.0004705601,0.000719145,0.0003313785,0.0006386476,0.0003856792,0.000506263,0.001230167],"category_scores_gemma":[0.0008149329,0.0001328741,0.0004083575,0.0005187255,0.0005732496,0.001783183,0.0005728553,0.0006178695,0.0004277949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002988395,"about_ca_system_score_gemma":0.0002642943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002064928,"about_ca_topic_score_gemma":0.0001361392,"domain_scores_codex":[0.9996536,0.00005914295,0.00002579401,0.00004262085,0.0001740478,0.00004478647],"domain_scores_gemma":[0.9996444,0.00008649549,0.00005492229,0.0001043957,0.00008199356,0.00002780988],"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.0009295492,0.0001263035,0.0009391363,0.000368914,0.00006050512,0.0008484969,0.0003911352,0.0400733,0.3225426,0.1898974,0.002387714,0.4414349],"study_design_scores_gemma":[0.0001313546,0.0008231648,0.001490893,0.00006715957,0.00004981,0.00374004,0.0001349468,0.5493537,0.3433495,0.0523782,0.04834604,0.00013525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1294353,0.001344614,0.8599417,0.0003029775,0.0001931292,0.0001060455,0.00008474002,0.0003931634,0.008198258],"genre_scores_gemma":[0.7569705,0.0008962388,0.2353634,0.00007443155,0.00009957288,0.00008027878,0.0001022687,0.00004912245,0.006364328],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001230167,"threshold_uncertainty_score":0.004115343,"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","authors":[{"name":"Jeremy Booher","is_ca":false},{"name":"Ross Bowden","is_ca":false},{"name":"Javad Doliskani","is_ca":true},{"name":"Tako Boris Fouotsa","is_ca":false},{"name":"Steven D. Galbraith⋆","is_ca":false},{"name":"Sabrina Kunzweiler","is_ca":false},{"name":"Simon-Philipp Merz","is_ca":false},{"name":"Christophe Petit","is_ca":false},{"name":"Benjamin Smith","is_ca":false},{"name":"Katherine E. Stange","is_ca":false},{"name":"Yan Bo Ti","is_ca":false},{"name":"Christelle Vincent","is_ca":false},{"name":"José Felipe Voloch","is_ca":false},{"name":"Charlotte Weitkämper","is_ca":false},{"name":"Lukas Zobernig","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003290173,0.0004289197,0.0009750034,0.001097912,0.00175156,0.002616901,0.001376007,0.001535454,0.006601832],"category_scores_gemma":[0.02154142,0.0006240886,0.000740173,0.001036347,0.004435121,0.007498942,0.004024016,0.002700494,0.00210291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001210979,"about_ca_system_score_gemma":0.001168094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007611184,"about_ca_topic_score_gemma":0.0006153935,"domain_scores_codex":[0.9970524,0.0008742333,0.0001726209,0.0005630426,0.0009330763,0.0004047191],"domain_scores_gemma":[0.9761478,0.007985683,0.001500603,0.01150206,0.002137498,0.0007262804],"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.0009068936,0.0001896384,0.01037474,0.0002520464,0.00008438103,0.0006369859,0.002405166,0.03154213,0.02003709,0.8411447,0.009902498,0.08252362],"study_design_scores_gemma":[0.00009556032,0.0003362402,0.001282175,0.00007898201,0.00006462593,0.0006750612,0.000850023,0.1294261,0.04425172,0.8040957,0.01876198,0.00008174876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6513187,0.0004860417,0.3132867,0.005242453,0.0002886084,0.0003016794,0.0004533073,0.00379118,0.02483135],"genre_scores_gemma":[0.9595414,0.0001906451,0.03340277,0.0005175515,0.00007318891,0.00006980897,0.0003181374,0.0004167819,0.005469554],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006601832,"threshold_uncertainty_score":0.02208537,"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","authors":[{"name":"Alexandre Petrenko","is_ca":true},{"name":"Adenilso Simão","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002092582,0.001256431,0.0007481859,0.001603778,0.0003116615,0.0008592465,0.001468563,0.0008001999,0.002084899],"category_scores_gemma":[0.01124888,0.0004106447,0.001432898,0.0007771701,0.002418188,0.002066363,0.001946286,0.001858109,0.0006062606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009510213,"about_ca_system_score_gemma":0.001432746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001557794,"about_ca_topic_score_gemma":0.001239501,"domain_scores_codex":[0.9967001,0.0009692345,0.0003143188,0.0007890841,0.001068443,0.0001589056],"domain_scores_gemma":[0.9884899,0.007059504,0.0007223009,0.002235816,0.001284866,0.0002075486],"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.0004563265,0.0001395457,0.005204333,0.001126171,0.0001934698,0.0003013918,0.0008018307,0.1531145,0.04985647,0.3557271,0.00144038,0.4316384],"study_design_scores_gemma":[0.0001043889,0.0004730972,0.001169139,0.0001803955,0.0001096614,0.0005825722,0.0001158565,0.6051335,0.06479246,0.2983648,0.02889226,0.00008179892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004336767,0.0001230203,0.994166,0.00004698401,0.0000232959,0.00006065072,0.00003345917,0.0004625781,0.0007472574],"genre_scores_gemma":[0.28045,0.0004724045,0.7135263,0.0002849072,0.0001153686,0.0005430997,0.0004209558,0.0003934329,0.003793537],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002092582,"threshold_uncertainty_score":0.01106679,"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","authors":[{"name":"Siyuan Chen","is_ca":false},{"name":"Kim‐Kwang Raymond Choo","is_ca":false},{"name":"Xiaolei Dong","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001764209,0.0004695663,0.0007729716,0.0008763353,0.000804943,0.001510056,0.001487548,0.001164954,0.003103638],"category_scores_gemma":[0.003037387,0.0003105382,0.0008211265,0.001312295,0.001551289,0.004405131,0.002799233,0.001369661,0.001104617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001233488,"about_ca_system_score_gemma":0.001589341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004452108,"about_ca_topic_score_gemma":0.0003727319,"domain_scores_codex":[0.9967293,0.0008060496,0.0002405756,0.000509135,0.001353526,0.0003615073],"domain_scores_gemma":[0.9984332,0.0003963017,0.0003135861,0.0005218648,0.0002402806,0.00009472149],"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.0003565215,0.00009655496,0.0002406851,0.0002331783,0.00005064474,0.0001737068,0.0003735946,0.03037698,0.04553754,0.8464778,0.001963902,0.07411885],"study_design_scores_gemma":[0.0004987816,0.0005146834,0.000587813,0.0001004361,0.0001282188,0.0009243258,0.0001496022,0.4544818,0.09353683,0.3982404,0.05059962,0.0002376144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05574517,0.001007635,0.9282515,0.0006045724,0.0001510901,0.0003782809,0.0001840335,0.0005908684,0.01308678],"genre_scores_gemma":[0.6483924,0.00113814,0.3357247,0.0003816235,0.0001494439,0.0005512716,0.000337047,0.00007985453,0.01324567],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003103638,"threshold_uncertainty_score":0.01038271,"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","authors":[{"name":"Zahoor Ali Khan","is_ca":true},{"name":"Shyamala Sivakumar","is_ca":true},{"name":"William Phillips","is_ca":true},{"name":"Bill Robertson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001386935,0.0004687193,0.0005980446,0.0006517681,0.0007333299,0.0006105569,0.001152825,0.0005713007,0.0009387553],"category_scores_gemma":[0.002219668,0.0001818637,0.0002922581,0.0004559291,0.0004243258,0.0009192826,0.0008898905,0.000598662,0.000393452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003403192,"about_ca_system_score_gemma":0.0008024635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001335116,"about_ca_topic_score_gemma":0.001553987,"domain_scores_codex":[0.999262,0.0002515121,0.00006523078,0.0001008843,0.0002538392,0.00006638527],"domain_scores_gemma":[0.9992631,0.0002330275,0.0001206152,0.00009307876,0.0002432273,0.00004689297],"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.0009875676,0.0003419452,0.003570059,0.001654724,0.0002527729,0.001665544,0.00153684,0.1510368,0.1836182,0.04631207,0.02553634,0.5834872],"study_design_scores_gemma":[0.0002469728,0.001580081,0.003660029,0.0001477569,0.0002802994,0.002840365,0.0004658872,0.8429515,0.05476754,0.02436175,0.06844603,0.0002517584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06281925,0.003495416,0.9219134,0.0008180814,0.0004434463,0.0006116125,0.0002398961,0.004286344,0.005372559],"genre_scores_gemma":[0.7236437,0.001920442,0.2682011,0.0003266771,0.0002240562,0.0004815334,0.0006125604,0.0002116746,0.004378353],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001386935,"threshold_uncertainty_score":0.007334948,"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","authors":[{"name":"Lili Jiang","is_ca":false},{"name":"Xiaolin Chang","is_ca":false},{"name":"Runkai Yang","is_ca":false},{"name":"Jelena Mišić","is_ca":true},{"name":"Vojislav B. Mišić","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002974318,0.0007653091,0.0009584944,0.001116529,0.0005050005,0.001174734,0.001136648,0.001054249,0.001733469],"category_scores_gemma":[0.007315077,0.0003318381,0.0005879371,0.0008923499,0.0005488116,0.0009985252,0.0006350054,0.0007811148,0.0001642552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003518209,"about_ca_system_score_gemma":0.001815517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0177433,"about_ca_topic_score_gemma":0.008071828,"domain_scores_codex":[0.99893,0.0005234033,0.00003838856,0.0001153415,0.000160856,0.0002319799],"domain_scores_gemma":[0.9935136,0.00485123,0.0005016424,0.0002428046,0.0007261746,0.0001645661],"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.00006799451,0.0000422488,0.0003805606,0.00001642106,0.000008463994,0.00001051617,0.000008409035,0.9969198,0.0002302437,0.00113785,0.0001437175,0.0010339],"study_design_scores_gemma":[0.00000488949,0.00002905049,0.0001693531,0.000002564228,0.000004217312,0.000003164056,0.00001020256,0.9993105,0.0001490568,0.0002681988,0.00004600478,0.000002850902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8776553,0.0008850555,0.1037478,0.0009095788,0.0001348032,0.00024593,0.0005650807,0.0003716575,0.01548486],"genre_scores_gemma":[0.996156,0.00007690578,0.003183455,0.0000300315,0.000005689449,0.00003928487,0.00006679658,0.000009633382,0.0004322664],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0177433,"threshold_uncertainty_score":0.03528005,"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","authors":[{"name":"Liyun Zuo","is_ca":false},{"name":"Shoubin Dong","is_ca":false},{"name":"Chunsheng Zhu","is_ca":true},{"name":"Guangjie Han","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004354647,0.0007356408,0.0005732483,0.0005815089,0.0005830362,0.001161409,0.001143029,0.0006128855,0.001199509],"category_scores_gemma":[0.0009829589,0.0003113381,0.0006636193,0.0008375324,0.0004160758,0.001135171,0.000660024,0.0006288133,0.0001620083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001642081,"about_ca_system_score_gemma":0.001431779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01876291,"about_ca_topic_score_gemma":0.01106368,"domain_scores_codex":[0.9995793,0.00009700705,0.0000204789,0.000083283,0.0001589548,0.00006102291],"domain_scores_gemma":[0.9997044,0.0001079016,0.00004325486,0.00001949888,0.00009897926,0.00002585749],"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.00001942792,0.00001251509,0.0002919887,0.00001821695,0.000008706629,0.00003653873,0.00001643006,0.9889121,0.0007726907,0.004518553,0.0003439962,0.00504899],"study_design_scores_gemma":[0.000001706944,0.000004471432,0.00005427537,9.115968e-7,0.000002192314,0.000005378071,0.000002228288,0.9990447,0.0001260709,0.0006380809,0.0001177269,0.000002287614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05391583,0.0004112349,0.9319566,0.000389959,0.00006687264,0.0001847061,0.0001685289,0.000391714,0.01251454],"genre_scores_gemma":[0.9311029,0.0003558582,0.06262445,0.00005841526,0.0000308737,0.0002391022,0.0001609025,0.00006977189,0.005357697],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01876291,"threshold_uncertainty_score":0.03730738,"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","authors":[{"name":"Abdelrahman Amer","is_ca":true},{"name":"B. John Oommen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001724295,0.0007572987,0.001262463,0.001436045,0.001575187,0.002971904,0.00429262,0.002578785,0.004236233],"category_scores_gemma":[0.007031717,0.0007629734,0.001194473,0.001720419,0.002418112,0.005572414,0.00315018,0.001902736,0.0009521935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001980607,"about_ca_system_score_gemma":0.001610984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003742694,"about_ca_topic_score_gemma":0.003600683,"domain_scores_codex":[0.9985122,0.0005217429,0.0000797051,0.0003385894,0.0003392065,0.0002084506],"domain_scores_gemma":[0.9959055,0.00213205,0.0005589376,0.0006160699,0.0004816837,0.0003057024],"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.0001175571,0.0001221909,0.001253708,0.0002514825,0.00005896728,0.0001932836,0.0004062332,0.7031073,0.003975146,0.2347441,0.002841362,0.05292865],"study_design_scores_gemma":[0.00001839994,0.00008838189,0.0001343991,0.00001885228,0.00001579692,0.00007559696,0.00007027198,0.901274,0.001022019,0.09309327,0.004163233,0.00002571932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01097621,0.0004746421,0.9859358,0.0003552396,0.00005257134,0.00007208548,0.0000693394,0.0003493342,0.001714841],"genre_scores_gemma":[0.3729083,0.0009922893,0.6164919,0.0003834115,0.0002983951,0.0005247346,0.0003806272,0.0002655533,0.00775479],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00429262,"threshold_uncertainty_score":0.01437032,"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","authors":[{"name":"Nghi Quang Huynh","is_ca":true},{"name":"Marc Frappier","is_ca":true},{"name":"Herman Pooda","is_ca":true},{"name":"Amel Mammar","is_ca":false},{"name":"Régine Laleau","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005164121,0.0009211102,0.0006722651,0.001470081,0.001100817,0.003909574,0.002849067,0.001650629,0.004403404],"category_scores_gemma":[0.008453501,0.0006734479,0.002107168,0.0008979551,0.002696653,0.003246454,0.002779387,0.001826658,0.0006543885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001935248,"about_ca_system_score_gemma":0.005209761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02520724,"about_ca_topic_score_gemma":0.01477532,"domain_scores_codex":[0.9939395,0.002147825,0.0005996737,0.0007874515,0.002010698,0.0005148156],"domain_scores_gemma":[0.9935862,0.003176213,0.0005447617,0.001251656,0.001180951,0.0002602536],"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.0006593801,0.0003577801,0.003875443,0.0004342102,0.0002152549,0.001200177,0.001269014,0.5581129,0.01146627,0.3366604,0.006186784,0.07956234],"study_design_scores_gemma":[0.00008943705,0.00007297334,0.0001711088,0.00004614444,0.00006350958,0.0001398963,0.00007538676,0.9451916,0.007073981,0.03737193,0.009666219,0.00003787833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02120812,0.00014919,0.9690332,0.0005568944,0.00005981403,0.0003300349,0.0003877759,0.00478363,0.003491257],"genre_scores_gemma":[0.4218622,0.0002013275,0.5709614,0.0003354711,0.0000404379,0.0004220986,0.0008632221,0.0003156884,0.004998112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02520724,"threshold_uncertainty_score":0.05012107,"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","authors":[{"name":"Sabah Mohammed","is_ca":true},{"name":"Wai Chi Fang","is_ca":false},{"name":"Aboul Ella Hassanien","is_ca":false},{"name":"Tai-hoon Kim","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01623428,0.001744965,0.002075025,0.01023065,0.001368907,0.006052092,0.002472757,0.001665352,0.004504654],"category_scores_gemma":[0.06954549,0.0009385036,0.002813535,0.00895738,0.001801822,0.005218616,0.004002325,0.005538005,0.002852203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001368008,"about_ca_system_score_gemma":0.002712932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001517868,"about_ca_topic_score_gemma":0.001507318,"domain_scores_codex":[0.9856286,0.007345257,0.001797865,0.00154945,0.003442523,0.000236387],"domain_scores_gemma":[0.9372598,0.04698488,0.002584883,0.005771338,0.006566913,0.0008322533],"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.0001575664,0.000249179,0.005521231,0.002320315,0.001117069,0.0005137681,0.0008391246,0.03045588,0.001978221,0.3395012,0.06329744,0.554049],"study_design_scores_gemma":[0.00005201151,0.00004990949,0.001209135,0.0005183286,0.0001100881,0.0003365742,0.0002208353,0.2762531,0.001209897,0.6435147,0.07645718,0.00006832444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00110767,0.002708782,0.9885821,0.003119071,0.0005752273,0.0002918501,0.00115663,0.001151871,0.001306703],"genre_scores_gemma":[0.03577333,0.004095534,0.952363,0.0008950102,0.001502708,0.001498008,0.001981455,0.0002606394,0.001630378],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01623428,"threshold_uncertainty_score":0.08585608,"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","authors":[{"name":"Abdulah Abdulah Zadeh","is_ca":true},{"name":"Howard M. Heys","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005289662,0.0007565792,0.0004974647,0.0008663607,0.0002237782,0.0004397656,0.0003983729,0.0004399018,0.001589586],"category_scores_gemma":[0.004560367,0.0002664329,0.0004368505,0.000407376,0.001018006,0.001113979,0.0006607932,0.0005024928,0.0002515974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004145427,"about_ca_system_score_gemma":0.0002538544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001796812,"about_ca_topic_score_gemma":0.0002107649,"domain_scores_codex":[0.9992112,0.0002509878,0.00004710163,0.0001088291,0.0003373614,0.00004454231],"domain_scores_gemma":[0.9968898,0.001999779,0.0003653202,0.0005441008,0.0001730763,0.00002799089],"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.001128598,0.000204284,0.005908472,0.0006026659,0.0002444434,0.0007859526,0.0003724368,0.2022373,0.3592543,0.03519504,0.0008959004,0.3931705],"study_design_scores_gemma":[0.00007548236,0.0006608129,0.002562624,0.00003715781,0.00005726197,0.0007755886,0.00004693233,0.7025606,0.2648101,0.02575422,0.002618381,0.00004089784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2551584,0.0004923119,0.73985,0.0001668738,0.0000382777,0.0001729711,0.0000522816,0.00106704,0.003001772],"genre_scores_gemma":[0.8877799,0.0002331096,0.1105069,0.00003978735,0.00002528281,0.00004886951,0.00002891728,0.00005979993,0.0012775],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001589586,"threshold_uncertainty_score":0.005317748,"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","authors":[{"name":"Nieves R. Brisaboa","is_ca":false},{"name":"Travis Gagie","is_ca":true},{"name":"Adrián Gómez‐Brandón","is_ca":false},{"name":"Gonzalo Navarro","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003393222,0.0002956844,0.000461553,0.001399379,0.0004687155,0.001069394,0.0007215975,0.0004453145,0.005830625],"category_scores_gemma":[0.003228204,0.0002299864,0.0003740095,0.002998859,0.0003792488,0.002020819,0.00107133,0.000473946,0.002058584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005460063,"about_ca_system_score_gemma":0.0006942409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003182275,"about_ca_topic_score_gemma":0.00384451,"domain_scores_codex":[0.9994141,0.0001085193,0.00006027475,0.00007168269,0.0002726052,0.00007283195],"domain_scores_gemma":[0.9983881,0.0005248894,0.000140295,0.0004046167,0.0004691654,0.00007294177],"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.0006851521,0.0001791395,0.003561961,0.0005712729,0.00009123819,0.0005282202,0.0006245812,0.1478591,0.05133515,0.1909516,0.04496805,0.5586447],"study_design_scores_gemma":[0.00009796102,0.0001954464,0.001601893,0.00006414334,0.00002735759,0.0006981953,0.0001618632,0.8257018,0.02244083,0.07844488,0.07051763,0.00004805502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09007676,0.001243527,0.889474,0.0006185623,0.000213891,0.0002362624,0.003390163,0.002905451,0.01184129],"genre_scores_gemma":[0.4244241,0.001078111,0.5524321,0.0002843313,0.0001316184,0.0004614503,0.007858211,0.0003579375,0.0129722],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005830625,"threshold_uncertainty_score":0.01950538,"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","authors":[{"name":"Antoni Badia","is_ca":false},{"name":"Daniel Lemire","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01865207,0.001343842,0.001192902,0.002108788,0.002217688,0.005376677,0.003994888,0.002640647,0.005899897],"category_scores_gemma":[0.05279629,0.001683095,0.001754006,0.002535627,0.006077419,0.02468644,0.006357561,0.003742127,0.001468044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002055644,"about_ca_system_score_gemma":0.003690498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002847356,"about_ca_topic_score_gemma":0.0028374,"domain_scores_codex":[0.9819697,0.006039541,0.00331039,0.003529022,0.0042739,0.00087755],"domain_scores_gemma":[0.9396643,0.02725228,0.003805928,0.02108433,0.007295917,0.0008973142],"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.0001555682,0.00005961897,0.003683931,0.0004143643,0.00005918718,0.0003570819,0.001612829,0.003353939,0.002498294,0.9190306,0.00519917,0.0635755],"study_design_scores_gemma":[0.0000560388,0.0001281987,0.0008709513,0.0004471384,0.0001954647,0.0008797047,0.00044939,0.01687071,0.00955751,0.8191275,0.1512873,0.0001299958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02266988,0.001116736,0.9590444,0.002538383,0.0003447958,0.0001797649,0.0009409194,0.00157248,0.01159263],"genre_scores_gemma":[0.3880609,0.001449835,0.5910495,0.002342427,0.0005297998,0.0008057228,0.002175133,0.001061598,0.01252509],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01865207,"threshold_uncertainty_score":0.09864271,"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","authors":[{"name":"Giuseppe Anastasi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00665866,0.001493976,0.001868356,0.00177837,0.002992113,0.0052109,0.003265014,0.003984376,0.00258995],"category_scores_gemma":[0.01748552,0.001472883,0.001397906,0.00255406,0.006007412,0.01099025,0.004479554,0.004338337,0.001432621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001845858,"about_ca_system_score_gemma":0.001764161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006923715,"about_ca_topic_score_gemma":0.0004268943,"domain_scores_codex":[0.9942883,0.002857409,0.0005026168,0.0005385538,0.001535895,0.0002772904],"domain_scores_gemma":[0.9906164,0.005381656,0.0009045148,0.001703721,0.001106084,0.0002876743],"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.00006744756,0.00004032505,0.0001535929,0.0002762485,0.00001944338,0.0001926033,0.0008943932,0.01715793,0.001341512,0.9388455,0.002395294,0.03861567],"study_design_scores_gemma":[0.00005389765,0.0001322822,0.0001042323,0.0002877121,0.00003905984,0.0002259999,0.0001567419,0.07866749,0.001574898,0.8532465,0.06547271,0.00003840487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007745375,0.0114287,0.9602746,0.003231518,0.0005614561,0.0003664645,0.00006388357,0.0004450697,0.01588299],"genre_scores_gemma":[0.2215804,0.01618695,0.7467642,0.001286294,0.002805629,0.002029439,0.000417679,0.0004363609,0.008492983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00665866,"threshold_uncertainty_score":0.03521478,"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","authors":[{"name":"Zongyang Zhang","is_ca":false},{"name":"Lingyue Zhang","is_ca":false},{"name":"Zhuo Wang","is_ca":false},{"name":"Yichen Li","is_ca":false},{"name":"Rongxing Lu","is_ca":true},{"name":"Yong Yu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009082738,0.0004549942,0.0005706498,0.0005319212,0.0007087803,0.0007599356,0.001258134,0.0004974749,0.002619716],"category_scores_gemma":[0.001803855,0.0002401434,0.0003130767,0.0006508215,0.0006662151,0.001053466,0.001172061,0.0006189791,0.0003956434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005306018,"about_ca_system_score_gemma":0.001168177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003415117,"about_ca_topic_score_gemma":0.002766504,"domain_scores_codex":[0.9992379,0.0002042169,0.00005801495,0.0001526591,0.0002559683,0.00009122107],"domain_scores_gemma":[0.9990594,0.0002316082,0.0001176192,0.0002900002,0.0002027623,0.00009869746],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003351627,0.0004378965,0.003614816,0.0007373,0.0001498359,0.0008070569,0.0008571226,0.400109,0.1513189,0.09591229,0.02686631,0.3158379],"study_design_scores_gemma":[0.0004866332,0.0004637275,0.0004437774,0.00002240802,0.00003413479,0.0001517514,0.0001122394,0.9259725,0.03753052,0.01417009,0.02057264,0.00003959789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1140497,0.0002678566,0.8649699,0.0002433078,0.0001865872,0.0004035903,0.0004191689,0.01363366,0.005826229],"genre_scores_gemma":[0.746738,0.0001429322,0.2474988,0.0001008354,0.00003591132,0.0002864248,0.000659361,0.0003513863,0.004186332],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003415117,"threshold_uncertainty_score":0.00876379,"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","authors":[{"name":"Lixia Chen","is_ca":false},{"name":"Jian Li","is_ca":false},{"name":"Ruhui Ma","is_ca":false},{"name":"Haibing Guan","is_ca":false},{"name":"Hans‐Arno Jacobsen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006111076,0.0004437807,0.0004827041,0.0006717549,0.0008277897,0.001205259,0.0006789351,0.0004130046,0.001772447],"category_scores_gemma":[0.001630136,0.0002097687,0.0001610859,0.001148891,0.0005926365,0.0009568689,0.0007576282,0.0004020236,0.0003822423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001067679,"about_ca_system_score_gemma":0.0007704352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003181286,"about_ca_topic_score_gemma":0.003608668,"domain_scores_codex":[0.999567,0.0001098871,0.00001717942,0.00005979408,0.0001332619,0.0001129475],"domain_scores_gemma":[0.9994161,0.0002829131,0.00007265845,0.00006658967,0.0000988794,0.00006288047],"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.0003349398,0.0001205701,0.003538418,0.00009062415,0.00003072649,0.0002041616,0.00006573616,0.8719165,0.02781496,0.007596233,0.002148097,0.08613905],"study_design_scores_gemma":[0.000012701,0.00004931672,0.0008333945,0.00000500356,0.000007022163,0.00002409364,0.00005542185,0.9859985,0.006996651,0.004978626,0.001031901,0.000007467836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5875463,0.001567088,0.3799932,0.001221002,0.000203025,0.0001120755,0.000163323,0.001827677,0.02736634],"genre_scores_gemma":[0.9872882,0.0001056708,0.0115835,0.00003924869,0.00003140153,0.000009784951,0.00002532076,0.00004348591,0.0008733039],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003181286,"threshold_uncertainty_score":0.007746637,"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","authors":[{"name":"Nina Bindel","is_ca":false},{"name":"Sarah McCarthy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01413633,0.0005290028,0.001184035,0.0009888229,0.003153366,0.006162958,0.002537828,0.002856429,0.003515363],"category_scores_gemma":[0.05444675,0.0009554529,0.001056384,0.001342554,0.01286928,0.01799817,0.01107053,0.009405452,0.001548602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002300609,"about_ca_system_score_gemma":0.002646342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000617016,"about_ca_topic_score_gemma":0.0004523292,"domain_scores_codex":[0.985701,0.007222646,0.0008268486,0.001207656,0.004071347,0.0009705673],"domain_scores_gemma":[0.9326032,0.02628903,0.002155083,0.03197476,0.005419367,0.00155858],"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.00009696234,0.00003903923,0.0002810897,0.000103505,0.000009840585,0.00006453278,0.0009730975,0.00434788,0.001589064,0.9701408,0.001704596,0.02064963],"study_design_scores_gemma":[0.00009542004,0.0001804075,0.0001478736,0.0002285084,0.00001880698,0.0003099056,0.0005663993,0.03628973,0.01427137,0.9034595,0.0443083,0.0001238202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09694265,0.001066981,0.8620927,0.01100818,0.0004969353,0.0002306014,0.0001256527,0.001164504,0.02687177],"genre_scores_gemma":[0.734782,0.000766915,0.2555775,0.0008143752,0.0001899987,0.0002344361,0.0001390146,0.0003698708,0.007125881],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01413633,"threshold_uncertainty_score":0.07476097,"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","authors":[{"name":"Bo Pang","is_ca":false},{"name":"Gang Liang","is_ca":false},{"name":"Jin Yang","is_ca":false},{"name":"Yijing Chen","is_ca":false},{"name":"Xinyi Wang","is_ca":false},{"name":"Wenbo He","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001327681,0.001181446,0.0008320081,0.0008174871,0.0003218607,0.0006547631,0.001268514,0.001162026,0.0009886228],"category_scores_gemma":[0.002998052,0.0003537976,0.0009881048,0.000351715,0.001111862,0.001065733,0.00119743,0.001732677,0.0002585987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009039333,"about_ca_system_score_gemma":0.0007296205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005964669,"about_ca_topic_score_gemma":0.003474283,"domain_scores_codex":[0.9992797,0.0002071527,0.00002832791,0.0001748668,0.0001947079,0.0001152038],"domain_scores_gemma":[0.998401,0.0008688212,0.0001779633,0.0002831073,0.0001943457,0.00007478517],"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.0001724131,0.0001256538,0.00308333,0.00005142881,0.00006514767,0.0001713318,0.00004428928,0.9225769,0.00514547,0.00295915,0.001921114,0.06368374],"study_design_scores_gemma":[0.000003117732,0.00001927638,0.0001370107,0.000002465666,0.000003528853,0.00001548361,0.000002862037,0.9978939,0.001276706,0.0005539678,0.00008864336,0.000003136568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2433762,0.0008784615,0.744014,0.0007399211,0.0001806846,0.000218243,0.000204061,0.006238627,0.004149735],"genre_scores_gemma":[0.921772,0.0001681142,0.07457932,0.0003491743,0.00002521085,0.00009093662,0.000408346,0.0001393729,0.002467566],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005964669,"threshold_uncertainty_score":0.01185989,"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","authors":[{"name":"Diana Popova","is_ca":true},{"name":"Ken‐ichi Kawarabayashi","is_ca":false},{"name":"Alex Thomo","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001207684,0.001230115,0.001337164,0.001101611,0.0007953471,0.001374617,0.002061434,0.001473228,0.003230538],"category_scores_gemma":[0.007056221,0.0005859154,0.00122092,0.00124884,0.001097135,0.001563355,0.001622518,0.001309121,0.000951931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001667482,"about_ca_system_score_gemma":0.002880913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006363782,"about_ca_topic_score_gemma":0.008314831,"domain_scores_codex":[0.999041,0.00026735,0.00004296838,0.0002284114,0.0002789503,0.0001413189],"domain_scores_gemma":[0.9968904,0.001934477,0.0001933947,0.0004687248,0.0003535614,0.0001595939],"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.0002380829,0.0001956488,0.001824273,0.0002183589,0.0001045666,0.0001717585,0.000190016,0.72781,0.007788258,0.03758642,0.01335468,0.210518],"study_design_scores_gemma":[0.00004162744,0.00002067541,0.00007586566,0.000006885412,0.000007574359,0.00002838932,0.00001013942,0.9891673,0.001121637,0.008303878,0.001210089,0.000005822013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02047396,0.0002773863,0.9732404,0.0002665146,0.00008643737,0.0001275407,0.0001217044,0.002379389,0.00302671],"genre_scores_gemma":[0.2239084,0.0001714943,0.7715995,0.0002351319,0.00008121315,0.0003609114,0.0005288521,0.0006525384,0.002461903],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006363782,"threshold_uncertainty_score":0.01265347,"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","authors":[{"name":"Eddie Cheng","is_ca":false},{"name":"Keqiang Qiu","is_ca":true},{"name":"Zhizhang Shen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005368098,0.0006493095,0.0005451257,0.00253617,0.0006600576,0.001056202,0.001012734,0.0009799242,0.005914884],"category_scores_gemma":[0.002758416,0.0002630481,0.0006870562,0.001195164,0.001252803,0.002578387,0.0007160716,0.001327938,0.0009437968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006273279,"about_ca_system_score_gemma":0.0002380008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003465317,"about_ca_topic_score_gemma":0.0002784923,"domain_scores_codex":[0.9997771,0.00007534538,0.000009545884,0.00004311575,0.00005661338,0.00003831467],"domain_scores_gemma":[0.9990482,0.0005189652,0.00009670674,0.0001029395,0.0001635461,0.00006967896],"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.00000592942,0.00001053294,0.0001928363,0.00002839249,0.000004382166,0.00005778353,0.00007235841,0.00836105,0.00131115,0.9788842,0.0008887068,0.01018274],"study_design_scores_gemma":[0.000005620401,0.00002644061,0.0003378134,0.00001548047,0.000007454425,0.000223246,0.0000341287,0.1038619,0.0008370261,0.8902925,0.0043433,0.00001523677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1084022,0.001795408,0.8445601,0.0007734553,0.0002484644,0.0000474733,0.0002336325,0.0003010892,0.04363815],"genre_scores_gemma":[0.8673421,0.002367892,0.1086509,0.000297281,0.001246062,0.0002189409,0.0004108072,0.0003309042,0.01913525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005914884,"threshold_uncertainty_score":0.01978731,"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","authors":[{"name":"S. Gonzalez","is_ca":true},{"name":"Son T. Vuong","is_ca":true},{"name":"Victor C. M. Leung","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002136666,0.0003880034,0.0007531497,0.0009512858,0.0009342694,0.0008674634,0.00117879,0.0007848189,0.0005788507],"category_scores_gemma":[0.006432654,0.0003417901,0.0003174416,0.000877029,0.001113217,0.002147119,0.001719175,0.0007369112,0.0002421534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006175854,"about_ca_system_score_gemma":0.001044407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002285389,"about_ca_topic_score_gemma":0.002605373,"domain_scores_codex":[0.9990815,0.0003685093,0.00004417873,0.0001374146,0.0002696156,0.00009871309],"domain_scores_gemma":[0.9961841,0.002408675,0.0004850771,0.0004597149,0.0002574688,0.0002049326],"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.0004304141,0.0004341398,0.006720243,0.0002793169,0.0001274585,0.0008298954,0.0006698287,0.5580493,0.02969501,0.07064787,0.002023402,0.3300931],"study_design_scores_gemma":[0.00003287275,0.0001422269,0.0004661636,0.00001073824,0.00002468937,0.0003027503,0.00007847329,0.9747589,0.004294603,0.01656195,0.003304753,0.00002196584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1323869,0.000855119,0.8614425,0.0006257878,0.00006206281,0.0001572129,0.00003160842,0.001035891,0.003402851],"genre_scores_gemma":[0.9154563,0.0003994131,0.08233047,0.00008960919,0.00005673516,0.00006610897,0.00004731178,0.00002733979,0.001526788],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002285389,"threshold_uncertainty_score":0.01129991,"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","authors":[{"name":"Min Chen","is_ca":false},{"name":"Victor C. M. Leung","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009641788,0.001383125,0.001090228,0.002006268,0.001223317,0.0037795,0.00087564,0.002404326,0.1185005],"category_scores_gemma":[0.003098947,0.000359019,0.0007416147,0.001698544,0.0004336859,0.003633412,0.001414258,0.004135087,0.06083115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007992519,"about_ca_system_score_gemma":0.0008768577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000326414,"about_ca_topic_score_gemma":0.001238647,"domain_scores_codex":[0.9991665,0.00009741329,0.00004489573,0.0001426476,0.0004333245,0.0001152618],"domain_scores_gemma":[0.9967846,0.0005923387,0.0002051348,0.00017442,0.001336406,0.0009070975],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000242193,0.00003055467,0.0001235864,0.0001516601,0.000007738932,0.00004727749,0.00001645321,0.00005790885,0.0005399137,0.001629513,0.9278846,0.06948667],"study_design_scores_gemma":[0.000004476504,0.00005032457,0.0002791061,0.00009303425,0.000007670995,0.0001368209,0.00004792411,0.0001423236,0.0001535041,0.001462868,0.9976134,0.000008547091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"editorial","genre_gemma":"empirical","genre_scores_codex":[0.001594699,0.07655212,0.006623344,0.05356281,0.7251139,0.0001876688,0.0004448062,0.0006228666,0.1352978],"genre_scores_gemma":[0.006062863,0.06411351,0.003216999,0.0147605,0.317676,0.0001096169,0.0008281674,0.0005439475,0.5926884],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1185005,"threshold_uncertainty_score":0.3964237,"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","authors":[{"name":"Yan Wang","is_ca":true},{"name":"H. Li","is_ca":true},{"name":"Menglan Hu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001919982,0.0007299031,0.001067747,0.001581488,0.001446129,0.001981628,0.002104873,0.0005316772,0.001017331],"category_scores_gemma":[0.004458942,0.0005755616,0.001082508,0.002411319,0.001233484,0.004262345,0.002186873,0.000870912,0.0004112165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001162394,"about_ca_system_score_gemma":0.003430613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005900045,"about_ca_topic_score_gemma":0.007311113,"domain_scores_codex":[0.9989225,0.000251991,0.0001122737,0.0001851542,0.0003408226,0.0001872701],"domain_scores_gemma":[0.9973457,0.0008100806,0.0003155394,0.0009634172,0.000351476,0.0002138016],"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.001198337,0.0004756175,0.01321922,0.0004970342,0.0002447828,0.001015643,0.0016782,0.6272973,0.04902894,0.0543386,0.008754819,0.2422515],"study_design_scores_gemma":[0.00007786839,0.0001229945,0.0009272016,0.00003050458,0.00007804294,0.0001282882,0.0001623878,0.9301195,0.03731624,0.02406344,0.006922691,0.00005088649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1244795,0.0009345743,0.8669327,0.0003883426,0.0001297729,0.0001359456,0.0001518105,0.005119727,0.001727542],"genre_scores_gemma":[0.6747064,0.0005488968,0.3222354,0.0001175848,0.00005712435,0.0002006438,0.0004358602,0.0005297181,0.001168244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005900045,"threshold_uncertainty_score":0.01173145,"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","authors":[{"name":"Qi Wei","is_ca":false},{"name":"Jihong Guan","is_ca":false},{"name":"Shuigeng Zhou","is_ca":false},{"name":"Xiangyu Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002958691,0.0006652685,0.0004706373,0.00201911,0.0005138299,0.0009962427,0.0009880945,0.0005861678,0.002012931],"category_scores_gemma":[0.001854595,0.0002277819,0.0004304625,0.002691009,0.000546383,0.002036496,0.001108369,0.0007826146,0.001195612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004095729,"about_ca_system_score_gemma":0.0006549359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009623619,"about_ca_topic_score_gemma":0.000942422,"domain_scores_codex":[0.9991395,0.00006951039,0.0000886579,0.0001178504,0.0005369884,0.0000475521],"domain_scores_gemma":[0.9992292,0.0001175596,0.00007181503,0.0002279358,0.0003299367,0.00002347727],"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.0002052962,0.00008102994,0.0008068774,0.0003073191,0.00003399346,0.0003898314,0.0002695142,0.009431145,0.09970193,0.01782436,0.006971594,0.863977],"study_design_scores_gemma":[0.000116691,0.0003940654,0.002269431,0.0001177323,0.0001007218,0.003488808,0.0003221897,0.4683184,0.3900036,0.02469157,0.1100792,0.00009766179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01710503,0.000959467,0.9751061,0.000401015,0.0002320859,0.0001930268,0.0002662627,0.002666356,0.003070538],"genre_scores_gemma":[0.1393954,0.001662449,0.8490546,0.0003594775,0.0002204414,0.0003093282,0.001246076,0.0003100495,0.007442326],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00201911,"threshold_uncertainty_score":0.006733954,"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","authors":[{"name":"B. Gazi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011125,0.001292872,0.001515581,0.004271109,0.0005708454,0.003761225,0.0009888813,0.0008875858,0.08297981],"category_scores_gemma":[0.004868658,0.0005264977,0.0005804565,0.005753988,0.001137294,0.005570527,0.001659122,0.002066087,0.08649442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008007429,"about_ca_system_score_gemma":0.0009491867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00114471,"about_ca_topic_score_gemma":0.001804972,"domain_scores_codex":[0.9988847,0.00008631098,0.00007503464,0.0001798354,0.0007146747,0.00005943534],"domain_scores_gemma":[0.9977834,0.000945822,0.0002653353,0.00009574043,0.0005572691,0.0003524427],"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.00009975458,0.00003951894,0.0003418862,0.001579469,0.00002324016,0.0002128597,0.0001731308,0.000228238,0.001228337,0.004752657,0.729384,0.2619369],"study_design_scores_gemma":[0.00001241159,0.00002899014,0.001167147,0.0005396301,0.00002506493,0.001501612,0.0001284656,0.0002936815,0.0008737961,0.006742338,0.9886562,0.00003070803],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.005561362,0.6738257,0.05446919,0.05809603,0.01850651,0.0004387674,0.005348496,0.001954237,0.1817998],"genre_scores_gemma":[0.01373905,0.6144363,0.02545997,0.005342944,0.008356977,0.0001896246,0.004626521,0.0009822149,0.3268664],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.08297981,"threshold_uncertainty_score":0.2775951,"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","authors":[{"name":"Michael Simpson","is_ca":true},{"name":"Venkatesh Srinivasan","is_ca":true},{"name":"Alex Thomo","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004418378,0.001739156,0.002132083,0.00183684,0.001003053,0.00137198,0.003024,0.001730676,0.001582845],"category_scores_gemma":[0.0173517,0.0008593628,0.001278487,0.001233617,0.001369785,0.002740922,0.002320007,0.001831925,0.0005931084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001240387,"about_ca_system_score_gemma":0.002289911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005975558,"about_ca_topic_score_gemma":0.006523661,"domain_scores_codex":[0.9965923,0.001612899,0.0001457181,0.0007203898,0.0006474582,0.0002811185],"domain_scores_gemma":[0.9834279,0.01143351,0.00152593,0.0020819,0.0009750248,0.0005557169],"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.0009716648,0.0005564736,0.01936662,0.0004237352,0.0004310104,0.0003586351,0.0004320986,0.7293258,0.006035495,0.01461099,0.008060941,0.2194265],"study_design_scores_gemma":[0.00003665902,0.00006347305,0.0004948305,0.00001406864,0.00002848214,0.00007777355,0.00005957932,0.986949,0.001476564,0.01018057,0.0006097755,0.000009164397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1241822,0.001479237,0.8642302,0.002109119,0.0001735648,0.0005403612,0.0006774656,0.003440651,0.003167235],"genre_scores_gemma":[0.7678887,0.0003418079,0.2273792,0.000560264,0.0002360855,0.0002843775,0.001199902,0.0001506678,0.001959008],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005975558,"threshold_uncertainty_score":0.02336687,"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","authors":[{"name":"Quan Z. Sheng","is_ca":false},{"name":"Elhadi Shakshuki","is_ca":true},{"name":"Jian Yu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007955414,0.0004193442,0.000363011,0.000749238,0.0008682134,0.003796455,0.000832582,0.001798593,0.00947255],"category_scores_gemma":[0.001958922,0.0002756092,0.0003881298,0.001108979,0.0006082162,0.007014847,0.002772966,0.002016678,0.004790233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005490675,"about_ca_system_score_gemma":0.0008732657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002320874,"about_ca_topic_score_gemma":0.003260248,"domain_scores_codex":[0.9993615,0.0001385529,0.00005412095,0.00006353805,0.0003023196,0.00008002105],"domain_scores_gemma":[0.9994102,0.0001019509,0.00003546936,0.0001433745,0.00014655,0.0001624579],"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.0001302366,0.0001278301,0.0009049683,0.0005941885,0.00004378238,0.0009636701,0.0009994843,0.002060497,0.01444337,0.301645,0.1956302,0.4824568],"study_design_scores_gemma":[0.000011699,0.0000270316,0.000753746,0.0002068558,0.00002266248,0.0006329744,0.0003267453,0.009708533,0.001936052,0.09057417,0.8957664,0.00003313416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02114511,0.04940771,0.5060796,0.03142079,0.00586209,0.0003657529,0.001592809,0.02579258,0.3583335],"genre_scores_gemma":[0.3821079,0.05911859,0.3167938,0.01343893,0.006307273,0.000463012,0.005155078,0.003132557,0.2134828],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00947255,"threshold_uncertainty_score":0.03168881,"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","authors":[{"name":"Runkai Yang","is_ca":false},{"name":"Jelena Mišić","is_ca":true},{"name":"Vojislav B. Mišić","is_ca":true},{"name":"Xiao Liang","is_ca":false},{"name":"Shenshen Zhou","is_ca":false},{"name":"Xiaolin Chang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009303604,0.001166545,0.0006422948,0.001000477,0.00100739,0.001788408,0.001993987,0.002042046,0.002249292],"category_scores_gemma":[0.002621429,0.0005306226,0.0007815466,0.0009099516,0.001059667,0.002130629,0.001240053,0.001323344,0.0004364135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003247207,"about_ca_system_score_gemma":0.001491556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01640885,"about_ca_topic_score_gemma":0.006796663,"domain_scores_codex":[0.9994864,0.0001621081,0.00001933118,0.00009795087,0.0000923371,0.000141853],"domain_scores_gemma":[0.9988946,0.0005063855,0.000207328,0.00008831958,0.0002090539,0.00009422439],"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.00002525738,0.00006067112,0.00140813,0.00001667034,0.00001209251,0.00007614779,0.00006119825,0.9837075,0.001140957,0.01166083,0.0004786926,0.00135189],"study_design_scores_gemma":[0.000001637495,0.000007665873,0.00009679697,0.000002136047,0.0000026121,0.000007178677,0.00001411855,0.9982823,0.0000832216,0.001382815,0.0001168578,0.000002627152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4246272,0.001188193,0.5303397,0.003973845,0.0001447691,0.0002877562,0.0007856377,0.0006761198,0.03797675],"genre_scores_gemma":[0.9863123,0.0003466062,0.01002279,0.0001206044,0.00004601253,0.00009165268,0.00009099219,0.00004905057,0.002920008],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01640885,"threshold_uncertainty_score":0.03262669,"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","authors":[{"name":"Razib Iqbal","is_ca":true},{"name":"Shervin Shirmohammadi","is_ca":true},{"name":"Behnoosh Hariri","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009891504,0.0005774738,0.000779463,0.0005212098,0.0005791801,0.001449792,0.001429029,0.001098943,0.001543154],"category_scores_gemma":[0.003050756,0.0002826338,0.0003921395,0.0004685837,0.0007017544,0.001867936,0.0008286451,0.0006213203,0.0002447433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002215157,"about_ca_system_score_gemma":0.001553668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01151416,"about_ca_topic_score_gemma":0.00383785,"domain_scores_codex":[0.9990615,0.0003081037,0.00004526424,0.0001367525,0.0003553474,0.00009295781],"domain_scores_gemma":[0.9990119,0.0004614647,0.0001111093,0.00006062676,0.0002974964,0.0000573775],"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.0000517194,0.00003609446,0.0004823379,0.00003449121,0.00001009514,0.00007872102,0.00003436556,0.9811072,0.003276874,0.01072506,0.0001964488,0.003966555],"study_design_scores_gemma":[0.000003285273,0.00001255211,0.00005197288,0.000001095883,0.000002427797,0.000005059968,0.000005821199,0.9989416,0.0003079404,0.0005810847,0.00008495857,0.000002158537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2389801,0.0005703783,0.7403653,0.0009638739,0.00006469736,0.0003844361,0.0002490813,0.0007104785,0.01771172],"genre_scores_gemma":[0.9708189,0.0002027886,0.02652305,0.0000300377,0.0000211611,0.0001421571,0.00008193213,0.00003531255,0.002144723],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01151416,"threshold_uncertainty_score":0.02289426,"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","authors":[{"name":"Zihang Zhang","is_ca":false},{"name":"Yuling Liu","is_ca":false},{"name":"Zhili Zhou","is_ca":false},{"name":"Gaobo Yang","is_ca":false},{"name":"Q. M. Jonathan Wu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001137114,0.001282013,0.001583038,0.001126199,0.0004286111,0.001075732,0.002551115,0.001219799,0.002541742],"category_scores_gemma":[0.00230874,0.0006612574,0.0009163395,0.0009626701,0.0006760725,0.002547626,0.00252169,0.001523412,0.001461056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001040991,"about_ca_system_score_gemma":0.001572971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005224406,"about_ca_topic_score_gemma":0.005969107,"domain_scores_codex":[0.9988356,0.0001180977,0.00004421949,0.0003850966,0.0004571966,0.0001597322],"domain_scores_gemma":[0.9992005,0.0002044267,0.00007223195,0.0002052932,0.0002501962,0.00006742628],"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.0005682635,0.0002490327,0.002300396,0.0001137549,0.0001484184,0.0002556958,0.00007345941,0.1947332,0.06385748,0.01129358,0.011065,0.7153418],"study_design_scores_gemma":[0.00001398466,0.00003348109,0.0002916459,0.00000330811,0.00001421564,0.00006538067,0.000006151844,0.9852532,0.0105884,0.00245637,0.001261584,0.00001229447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02396626,0.0002751771,0.9691331,0.000203556,0.00006501898,0.00006360774,0.0001840198,0.004369162,0.00174007],"genre_scores_gemma":[0.5437255,0.0002419705,0.4475496,0.0004901614,0.0000943386,0.0001302978,0.001394627,0.0003278175,0.006045722],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005224406,"threshold_uncertainty_score":0.01038802,"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","authors":[{"name":"Alireza Nafarieh","is_ca":true},{"name":"Shyamala Sivakumar","is_ca":true},{"name":"William Robertson","is_ca":true},{"name":"William Phillips","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002418905,0.0004582065,0.0007253292,0.0007482711,0.001128145,0.001871176,0.002025548,0.0007347378,0.001746316],"category_scores_gemma":[0.005545187,0.0003972889,0.0003536725,0.0007693677,0.000689153,0.002781343,0.002224745,0.001328859,0.000311461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008701982,"about_ca_system_score_gemma":0.001367667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001581877,"about_ca_topic_score_gemma":0.002184846,"domain_scores_codex":[0.9984333,0.0003305746,0.000127965,0.0002046789,0.0005290457,0.0003744463],"domain_scores_gemma":[0.9963279,0.00101386,0.0005918635,0.0008332942,0.0009594203,0.0002736826],"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.002574095,0.0008729659,0.003769841,0.000408601,0.0002008516,0.0005456685,0.001046565,0.3854045,0.1069419,0.09536802,0.01071337,0.3921537],"study_design_scores_gemma":[0.00003434978,0.0001584549,0.0006806906,0.00001749398,0.00003579526,0.000111611,0.0001492455,0.9739779,0.008568397,0.01387994,0.002349184,0.00003691912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1875706,0.0009704035,0.8014696,0.0006648608,0.0005964164,0.0001238616,0.0001346644,0.002116021,0.006353661],"genre_scores_gemma":[0.9710336,0.0001029019,0.02776058,0.00005907605,0.00007527905,0.00002033208,0.00004840167,0.00003910674,0.0008607775],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002418905,"threshold_uncertainty_score":0.01279253,"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","authors":[{"name":"Adrien Gausseran","is_ca":false},{"name":"Frédéric Giroire","is_ca":false},{"name":"Brigitte Jaumard","is_ca":true},{"name":"Joanna Mouliérac","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008621061,0.0007971043,0.0005269297,0.0002097909,0.0007237607,0.001446014,0.0007037625,0.0007196492,0.005490225],"category_scores_gemma":[0.002620317,0.0002997932,0.0004558392,0.0003462886,0.0008961257,0.001819365,0.001034257,0.00109237,0.0005785387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005796216,"about_ca_system_score_gemma":0.0008860678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003888035,"about_ca_topic_score_gemma":0.004600609,"domain_scores_codex":[0.9994849,0.0001580107,0.00001548737,0.0001028802,0.00007369893,0.000164978],"domain_scores_gemma":[0.9988237,0.0005781464,0.0001483142,0.0002258207,0.00008158537,0.0001423788],"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.000441961,0.0001292714,0.001378003,0.0001471546,0.00005752321,0.0002576235,0.0001474355,0.8813775,0.008701388,0.04580839,0.01671027,0.04484345],"study_design_scores_gemma":[0.00003970333,0.00009221058,0.000297336,0.00001948184,0.00001171463,0.0001023079,0.0002439278,0.9566337,0.002399699,0.03582344,0.004323992,0.00001257394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2656605,0.0008702403,0.7044953,0.005553837,0.0007587664,0.0003941635,0.0007958085,0.001347727,0.02012374],"genre_scores_gemma":[0.8748375,0.0002800662,0.1199274,0.0003586275,0.0001116197,0.00008607388,0.0003877259,0.0001569587,0.003854139],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005490225,"threshold_uncertainty_score":0.01836658,"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","authors":[{"name":"Heliang Fan","is_ca":true},{"name":"Yu‐Liang Wu","is_ca":false},{"name":"Ray C. C. Cheung","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001119888,0.0009731983,0.0005016212,0.0007475723,0.0004561882,0.001268649,0.001374123,0.0006051995,0.004481812],"category_scores_gemma":[0.0009686522,0.0004702651,0.001229753,0.0005634798,0.0006574165,0.0007764195,0.0006621813,0.001268078,0.001382977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001026265,"about_ca_system_score_gemma":0.001240522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002131714,"about_ca_topic_score_gemma":0.003177695,"domain_scores_codex":[0.9991825,0.0002062735,0.00005962989,0.0001051976,0.0003533212,0.00009300258],"domain_scores_gemma":[0.9996927,0.0001100522,0.00003561156,0.00007237292,0.00007635068,0.00001287524],"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.00004514509,0.0000523212,0.0002375453,0.0004176658,0.00005245319,0.0004117923,0.0002149095,0.2987822,0.01686608,0.526337,0.005723719,0.1508591],"study_design_scores_gemma":[0.00008620513,0.0001419586,0.0001994492,0.0001745325,0.00005929828,0.0003731853,0.00006135672,0.6294249,0.01507194,0.1673627,0.1870045,0.00003993239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001444696,0.000203261,0.9908626,0.00007500465,0.00002605465,0.00008646709,0.00008612802,0.001024734,0.006191113],"genre_scores_gemma":[0.06454118,0.0007154936,0.9272189,0.0001050652,0.00003847261,0.0005798127,0.0004894825,0.0002537029,0.006057844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004481812,"threshold_uncertainty_score":0.01499319,"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)","authors":[{"name":"Amany Sarhan","is_ca":false},{"name":"Hesham Ali","is_ca":true},{"name":"Mariam Wagdi","is_ca":true},{"name":"Bassant Ali","is_ca":true},{"name":"Aliaa Adel","is_ca":true},{"name":"Rahf Osama","is_ca":true},{"name":"Dina M. Ibrahim","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006645885,0.001269201,0.0008675903,0.004115173,0.000399823,0.001390938,0.001639508,0.001075311,0.006908273],"category_scores_gemma":[0.002143545,0.0002829897,0.0009534995,0.001827023,0.0003140404,0.00123109,0.001042723,0.001036751,0.00721228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008867832,"about_ca_system_score_gemma":0.0008747627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01184011,"about_ca_topic_score_gemma":0.01222917,"domain_scores_codex":[0.9992926,0.0000549402,0.00005203822,0.0002680531,0.0002226193,0.00010961],"domain_scores_gemma":[0.9991772,0.0001494066,0.00008575952,0.0001567481,0.0003757243,0.00005524013],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002986169,0.0001886371,0.00221372,0.0002132143,0.00005592623,0.0001069027,0.00005169647,0.00934876,0.02899612,0.0004756273,0.01442819,0.9436225],"study_design_scores_gemma":[0.00005459574,0.0002519018,0.008821333,0.0001067512,0.00009441048,0.0002057514,0.0001738925,0.8986917,0.07440101,0.001081031,0.0160458,0.0000719707],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3078713,0.004077146,0.5633147,0.0006838195,0.00132962,0.00110777,0.0113156,0.08923151,0.02106866],"genre_scores_gemma":[0.5163596,0.001165289,0.4352836,0.0003695506,0.0002216533,0.0005203247,0.02066848,0.0009845734,0.0244269],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01184011,"threshold_uncertainty_score":0.0235424,"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","authors":[{"name":"Neil Y. Yen","is_ca":false},{"name":"Uyen Trang Nguyen","is_ca":true},{"name":"Jong Hyuk Park","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006270125,0.002061305,0.002465859,0.02723657,0.002631969,0.006426264,0.002890969,0.00286122,0.003698735],"category_scores_gemma":[0.04121267,0.001024457,0.003194575,0.01899155,0.001572753,0.008589351,0.004212823,0.002679235,0.003909474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001503455,"about_ca_system_score_gemma":0.002723629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004170721,"about_ca_topic_score_gemma":0.007989866,"domain_scores_codex":[0.9871427,0.005005592,0.001318488,0.00252002,0.003544698,0.0004686412],"domain_scores_gemma":[0.9707457,0.01960892,0.002107139,0.004520371,0.002518495,0.0004993074],"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.000358677,0.001090516,0.02973256,0.00438688,0.002623847,0.001202366,0.001938237,0.01895744,0.005842736,0.0486473,0.06369697,0.8215225],"study_design_scores_gemma":[0.000134115,0.0003539873,0.01484649,0.002013281,0.001153092,0.00146682,0.00335801,0.4441659,0.01202652,0.3633102,0.1568986,0.0002729986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07034438,0.03150894,0.829841,0.01332687,0.001923961,0.002801265,0.0282322,0.004767726,0.01725359],"genre_scores_gemma":[0.2938226,0.01287109,0.6471447,0.001207507,0.001687783,0.001896299,0.03623554,0.0002959177,0.00483864],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02723657,"threshold_uncertainty_score":0.03315997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}