{"meta":{"query_hash":"82ccd528164e","filters":{"venue":"The Computer Journal"},"cohort_total":58,"direct_labels_cover":0,"predictions_cover":58,"exported":58,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/82ccd528164e","api":"https://metacan.xera.ac/api/v1/cohort?venue=The+Computer+Journal"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Library science; Computer science; Media studies; Sociology","score_opus":0.09799493135422839,"score_gpt":0.30158093558384713,"score_spread":0.20358600422961876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1911143988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3171371,0.00044672313,0.6725615,0.007140261,0.00176656,0.00060133956,0.000008287363,0.0001779424,0.00016028996],"genre_scores_gemma":[0.94910306,0.00008677718,0.046889637,0.0021828245,0.0015825583,0.00006203954,0.0000028820577,0.00007630826,0.00001394575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99487853,0.0011187937,0.0007193545,0.00063207175,0.0013248533,0.0013263874],"domain_scores_gemma":[0.99513644,0.0011682464,0.00044238416,0.0019208075,0.00073366566,0.00059843797],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00600085,0.00045737508,0.00048444388,0.00031981873,0.0020957391,0.001147821,0.006902678,0.000113849965,0.0000020846567],"category_scores_gemma":[0.00025852278,0.0002930718,0.00048017086,0.0010042324,0.0008088706,0.0011225981,0.0024173183,0.0014797968,0.000050153776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007149627,0.00051679445,0.0006997654,0.00010395923,0.0007857403,0.00039209452,0.011909429,0.022113949,0.09587763,0.52773714,0.08786553,0.251283],"study_design_scores_gemma":[0.0022304133,0.00045439083,0.0009105555,0.00010172623,0.00003232409,0.0016277767,0.0001571959,0.08433868,0.042977598,0.8648075,0.0018666227,0.00049522077],"about_ca_topic_score_codex":0.0000029506887,"about_ca_topic_score_gemma":0.000018137516,"teacher_disagreement_score":0.63196594,"about_ca_system_score_codex":0.00020782242,"about_ca_system_score_gemma":0.00031996612,"threshold_uncertainty_score":0.99995214},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.034625398601954106,"score_gpt":0.21818894781859455,"score_spread":0.18356354921664045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963700980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07130962,0.0003486579,0.9190658,0.0018506757,0.0063513382,0.00020225959,3.505592e-7,0.00001805587,0.0008532768],"genre_scores_gemma":[0.98757136,0.0000042984952,0.0089164125,0.0014837604,0.0018496157,0.0000054051716,1.4840886e-7,0.0000063589273,0.00016261634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851495,0.00044866704,0.00030448052,0.000119034434,0.0003383335,0.0002745113],"domain_scores_gemma":[0.9990036,0.0000757559,0.00021127303,0.00051593676,0.0001223739,0.000071075694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002049695,0.00011074978,0.00012554773,0.000031057734,0.000659913,0.00025878876,0.0011774342,0.0000273891,0.000005331372],"category_scores_gemma":[0.00000580038,0.000045357512,0.00015198965,0.0003409943,0.000027391314,0.00021254686,0.00032261523,0.00029384607,0.000009657931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024121362,0.00024158353,0.0029691432,0.000018262466,0.0002790009,6.869176e-7,0.023120694,0.6487929,0.0012511323,0.06722589,0.19647329,0.059603255],"study_design_scores_gemma":[0.00024045509,0.00010028333,0.004884911,0.00005645788,0.000022905904,0.0004789357,0.00025736226,0.96789914,0.00018039867,0.00069718726,0.02503402,0.00014793749],"about_ca_topic_score_codex":0.0000089537025,"about_ca_topic_score_gemma":0.0000030634003,"teacher_disagreement_score":0.9162618,"about_ca_system_score_codex":0.00003318439,"about_ca_system_score_gemma":0.000021066491,"threshold_uncertainty_score":0.5075584},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Malware; Computer science; Library science; Control flow; Computer security","score_opus":0.00841837464510147,"score_gpt":0.22152548109760542,"score_spread":0.21310710645250394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971911274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012275467,0.00007629286,0.99484557,0.0014132715,0.0015443412,0.0003343453,0.0000024625417,0.00052612956,0.000030040066],"genre_scores_gemma":[0.6462036,0.000013467932,0.35148898,0.0013880496,0.00081420626,0.000042954558,6.539942e-7,0.000019718902,0.000028353918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984517,0.00029083036,0.0003533509,0.00028170488,0.00026588026,0.00035649934],"domain_scores_gemma":[0.99839634,0.00032263593,0.00027466318,0.000519686,0.0003696032,0.00011708193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011965435,0.00019381267,0.0002357261,0.00020823303,0.0006421117,0.0003461971,0.0011249303,0.00006724751,0.0000060017696],"category_scores_gemma":[0.00006298287,0.000134005,0.00021740484,0.00036248434,0.000055421482,0.00045977236,0.00011810647,0.00040290487,0.000013130907],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006239822,0.000032125008,0.000018164397,0.000011109013,0.00009455951,0.0000075846046,0.00019073518,0.013677462,0.0032477744,0.0040900134,0.0024109196,0.9761571],"study_design_scores_gemma":[0.0010800391,0.00056496356,0.00043887872,0.000018728522,0.000026522248,0.0009951929,0.0000034108612,0.8770071,0.011133719,0.09559315,0.012906797,0.00023146684],"about_ca_topic_score_codex":0.0000016943131,"about_ca_topic_score_gemma":0.0000027903593,"teacher_disagreement_score":0.9759257,"about_ca_system_score_codex":0.000049889484,"about_ca_system_score_gemma":0.00002480636,"threshold_uncertainty_score":0.54645646},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.033632891188587206,"score_gpt":0.2554537796233071,"score_spread":0.22182088843471992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972625929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026329689,0.0031037126,0.92884666,0.03595315,0.0051468117,0.00046365667,0.000008118314,0.00009630232,0.000051907402],"genre_scores_gemma":[0.98967785,0.00008070688,0.0026924077,0.0041330685,0.0032803025,0.00002236697,8.9046665e-7,0.0000129816635,0.000099422294],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986215,0.00024085066,0.00027397316,0.0002287486,0.0003610402,0.00027387825],"domain_scores_gemma":[0.99825287,0.00046935055,0.00023338353,0.00044912897,0.00040656995,0.00018871944],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013821693,0.00016727575,0.00020078268,0.000059649472,0.00056505296,0.0010562757,0.0013720568,0.00005245326,0.0000042043152],"category_scores_gemma":[0.000006758906,0.00008657667,0.00010807374,0.00015830997,0.000061746374,0.0005978967,0.00043071975,0.0003211363,0.00002594973],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044563676,0.000054798416,0.0007766672,0.000027655264,0.000172937,0.000018859933,0.007515968,0.00010046943,0.000040480038,0.0028123292,0.045325972,0.9431093],"study_design_scores_gemma":[0.0022994447,0.00031764412,0.0030348427,0.00010956469,0.000044213415,0.003948819,0.002276455,0.4785922,0.00008618167,0.005892251,0.5030716,0.00032675645],"about_ca_topic_score_codex":0.000014324699,"about_ca_topic_score_gemma":0.000086257154,"teacher_disagreement_score":0.96334815,"about_ca_system_score_codex":0.00004634969,"about_ca_system_score_gemma":0.00012490999,"threshold_uncertainty_score":0.99998075},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008118702872697147,"score_gpt":0.22243529010725135,"score_spread":0.2143165872345542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977733667","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046183504,0.00007090749,0.99022275,0.002208014,0.000582769,0.00037315825,2.4692707e-7,0.000044183125,0.0018796297],"genre_scores_gemma":[0.088763565,0.000029429326,0.90534824,0.0032783055,0.0012382322,0.000022888567,0.000001744753,0.000013486281,0.0013041305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990271,0.000115089875,0.00014327046,0.00021764518,0.0002519844,0.0002449551],"domain_scores_gemma":[0.9992854,0.000054688036,0.000068279216,0.00033776168,0.000039678413,0.00021417686],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003360964,0.000119715056,0.0001198979,0.00008486612,0.00025639436,0.0014344514,0.0012493612,0.000017702308,0.000013921941],"category_scores_gemma":[0.0000034394998,0.00006944831,0.000034700806,0.0001805256,0.000016836006,0.0010556614,0.0012630841,0.00019684312,0.0001408666],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021350513,0.000026769654,0.00008292088,0.000003406203,0.000029984689,0.000003366174,0.00060987455,0.00015143621,0.00003376102,0.0036382873,0.14146625,0.8539518],"study_design_scores_gemma":[0.0023840324,0.0005288522,0.076089896,0.0001490973,0.000032883407,0.00070842454,0.00005774297,0.79882157,0.00017619798,0.051351327,0.06906,0.00063999766],"about_ca_topic_score_codex":0.00002614964,"about_ca_topic_score_gemma":1.4718468e-7,"teacher_disagreement_score":0.85331184,"about_ca_system_score_codex":0.000018282753,"about_ca_system_score_gemma":0.0000112074595,"threshold_uncertainty_score":0.99960214},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Locality; Computer science; Library science; World Wide Web; Information retrieval; Linguistics","score_opus":0.026993477283438618,"score_gpt":0.26322578882454256,"score_spread":0.23623231154110394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004438803","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012452945,0.00003178489,0.9855896,0.0012953801,0.00016380394,0.00022772356,0.0000030700398,0.000029946328,0.00020574017],"genre_scores_gemma":[0.48091426,0.00001633732,0.5183717,0.0004555514,0.00017711504,0.00000538192,0.0000019463719,0.000011709981,0.000045999986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846965,0.00012847203,0.00038965975,0.00024644384,0.00044463688,0.00032114133],"domain_scores_gemma":[0.99891955,0.00025995343,0.0002456773,0.00040376282,0.00008648651,0.0000845702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083791115,0.00014995583,0.00020396902,0.00010658252,0.00018997812,0.0002256826,0.0009904717,0.00007249881,0.00000910062],"category_scores_gemma":[0.000017775928,0.000098182434,0.000049077353,0.00032235056,0.00006909879,0.000240624,0.00019449419,0.00047225025,0.0000061564206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028362699,0.0034033451,0.010601316,0.00015786433,0.00020408932,0.000074267846,0.007987537,0.42339748,0.0011529183,0.5148564,0.0036817088,0.034199446],"study_design_scores_gemma":[0.00408039,0.0010747054,0.053554848,0.000577585,0.000020454989,0.00041017303,0.000042192194,0.8725468,0.0011620158,0.06043506,0.005486841,0.0006089683],"about_ca_topic_score_codex":0.000020678142,"about_ca_topic_score_gemma":0.000008243497,"teacher_disagreement_score":0.4684613,"about_ca_system_score_codex":0.000109901805,"about_ca_system_score_gemma":0.00009562115,"threshold_uncertainty_score":0.40037635},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017458756628442748,"score_gpt":0.25765348155912304,"score_spread":0.24019472493068028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011538429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016218059,0.0000372885,0.99361545,0.003021523,0.0011838765,0.0017069576,0.0000022804795,0.00015359237,0.00011685878],"genre_scores_gemma":[0.81429976,0.0000040373898,0.18307373,0.0007455507,0.0008232823,0.00078105135,0.00000128047,0.00001930309,0.0002519964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860567,0.0002272733,0.00034337532,0.00025140325,0.0002702348,0.0003020457],"domain_scores_gemma":[0.9988102,0.00017613018,0.00023728632,0.00047928345,0.00016574624,0.00013136583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009014068,0.00015615647,0.00017582187,0.00007356809,0.0003647733,0.000376983,0.0014189109,0.000044033284,0.000020893727],"category_scores_gemma":[0.000007672273,0.00010387788,0.00015585124,0.00014988158,0.00004053639,0.00039738754,0.00010452302,0.00029776292,0.0000522999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030786032,0.000171311,0.000017313347,0.00016972002,0.00011227028,0.000005710504,0.009855193,0.0017943976,0.00008440273,0.5403827,0.00295424,0.44442195],"study_design_scores_gemma":[0.0010375265,0.0002772819,0.000094590076,0.00013139685,0.000020840165,0.0006096302,0.000057215057,0.8948586,0.00088595337,0.049878534,0.051934164,0.0002142492],"about_ca_topic_score_codex":0.0000017448966,"about_ca_topic_score_gemma":0.0000029402897,"teacher_disagreement_score":0.8930642,"about_ca_system_score_codex":0.000117109244,"about_ca_system_score_gemma":0.000034549437,"threshold_uncertainty_score":0.42360172},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07016241582279016,"score_gpt":0.2829747661228328,"score_spread":0.21281235030004264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015251277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.194687,0.00092167885,0.80308,0.0006082329,0.00042094028,0.00014917381,0.0000010608252,0.00009169666,0.000040203748],"genre_scores_gemma":[0.7742931,0.000002815095,0.22539453,0.0000869102,0.0002081381,0.0000059836243,3.164232e-7,0.0000059410195,0.000002222643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811697,0.000347962,0.00033030595,0.00017551248,0.0007072716,0.00032197562],"domain_scores_gemma":[0.99869007,0.00015520432,0.00018347353,0.0005113021,0.00035425974,0.000105689694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004088638,0.00014015725,0.00021668062,0.00018786849,0.00020759525,0.00022642719,0.001048335,0.000047223493,8.6345034e-7],"category_scores_gemma":[0.000038383932,0.00009420254,0.000058194146,0.00030750793,0.000039199927,0.0008782344,0.00050134805,0.00025521993,0.0000042913034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014813075,0.000040394592,0.00019914834,0.000015013666,0.00010595478,0.0000039648576,0.0011897654,0.70470726,0.00020376498,0.012986332,0.0004242742,0.28010935],"study_design_scores_gemma":[0.00030046617,0.00006994759,0.00039471185,0.00012288781,0.000061052786,0.00019643243,0.000100863224,0.9971132,0.00042624827,0.001069818,0.000039813232,0.00010455733],"about_ca_topic_score_codex":0.000012175062,"about_ca_topic_score_gemma":0.0000017802246,"teacher_disagreement_score":0.5796061,"about_ca_system_score_codex":0.0001235495,"about_ca_system_score_gemma":0.0000880507,"threshold_uncertainty_score":0.3841468},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Power consumption; Power (physics); Electrical engineering; Engineering; Physics; Thermodynamics","score_opus":0.013343481578244863,"score_gpt":0.2281239872367485,"score_spread":0.21478050565850365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017809384","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20618586,0.00003465927,0.76532364,0.0265993,0.0016668483,0.000051345403,1.9840708e-7,0.0001063422,0.000031826265],"genre_scores_gemma":[0.44458845,0.000014570213,0.54089826,0.0029347043,0.011384914,0.0000011822721,5.839678e-7,0.000013571274,0.00016372833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882376,0.00016340714,0.00018823071,0.00026003786,0.0002806375,0.0002839095],"domain_scores_gemma":[0.9990136,0.000046211906,0.00007874766,0.0005751382,0.00009726717,0.0001890117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000557856,0.0001217766,0.00012562766,0.000115437906,0.00084312994,0.00024897917,0.0014393912,0.00002745419,0.000009133843],"category_scores_gemma":[0.000008605422,0.00007808129,0.00007055851,0.0003800273,0.000041995896,0.00032916243,0.00025607707,0.0004001696,0.000053952648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002607621,0.00018340966,0.0004007454,0.0000053204103,0.00006162028,0.00024505996,0.014366802,0.29989204,0.0011762149,0.008240815,0.20621124,0.46919066],"study_design_scores_gemma":[0.00028955174,0.0005471465,0.009262388,0.00001419864,0.000005212141,0.0103613725,0.00001882188,0.9172837,0.0006473574,0.0062505757,0.055046707,0.00027294806],"about_ca_topic_score_codex":0.0000042406487,"about_ca_topic_score_gemma":5.9321496e-7,"teacher_disagreement_score":0.6173917,"about_ca_system_score_codex":0.00002929622,"about_ca_system_score_gemma":0.00005959871,"threshold_uncertainty_score":0.6484759},"labels":[],"label_agreement":null},{"id":"W2017942734","doi":"10.1093/comjnl/bxr029","title":"An Abstract Semantically Rich Compiler Collocative and Interpretative Model for OpenMP Programs","year":2011,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Ferroelectric and Negative Capacitance Devices","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of Windsor","funders":"","keywords":"Windsor; Compiler; Library science; Computer science; IBM; Programming language","score_opus":0.04908143074918726,"score_gpt":0.25196395716533765,"score_spread":0.2028825264161504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017942734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2880986,0.0001872364,0.71032983,0.00004418635,0.00015517669,0.00026566323,0.0000042578945,0.00005128224,0.00086371996],"genre_scores_gemma":[0.961335,0.000042141874,0.03828301,0.00015718477,0.000121648016,0.000019974252,0.0000018809319,0.000021198462,0.000017968237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993131,0.000036658625,0.00020578798,0.00011714645,0.00009564752,0.00023162019],"domain_scores_gemma":[0.99948245,0.00009319077,0.00006024321,0.00010615946,0.00015649537,0.000101445534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029276585,0.00014738839,0.00018071051,0.000042846932,0.00015438674,0.000109511944,0.00027634887,0.00003817149,0.000011030919],"category_scores_gemma":[0.0000052949094,0.000095930605,0.00004407365,0.000083909545,0.000100269404,0.0003095852,0.000020790803,0.00028538672,0.0000041100984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013712009,0.0009039849,0.0026414744,0.00037470416,0.002448388,0.0000723576,0.33367857,0.066292666,0.0035550056,0.021565571,0.013242122,0.5538539],"study_design_scores_gemma":[0.00033627698,0.00036706266,0.0029438257,0.00005505676,0.000028063354,0.00006783147,0.00030558166,0.98835146,0.0004756041,0.0068876855,0.000036233523,0.00014530715],"about_ca_topic_score_codex":8.5298893e-7,"about_ca_topic_score_gemma":0.0000055503497,"teacher_disagreement_score":0.9220588,"about_ca_system_score_codex":0.000029108238,"about_ca_system_score_gemma":0.000019192954,"threshold_uncertainty_score":0.39119366},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012032451917902767,"score_gpt":0.24116125434326105,"score_spread":0.22912880242535827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026184507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16552193,0.00013976787,0.8273381,0.005315108,0.0006989802,0.00025819495,0.0000032301361,0.0004344258,0.00029026018],"genre_scores_gemma":[0.9850399,0.0000015612992,0.014378653,0.0003532142,0.00020413875,0.000002002561,1.2030408e-7,0.000009312205,0.000011106355],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9982392,0.00043620713,0.0003750853,0.00014083115,0.00049553,0.0003131489],"domain_scores_gemma":[0.9789176,0.0194368,0.00045557058,0.0009778477,0.00016496418,0.00004721305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046008616,0.00016386966,0.00017110647,0.00004278666,0.00081601576,0.00016834914,0.0029947334,0.0000409809,0.000001260374],"category_scores_gemma":[0.0018338845,0.000052732543,0.0001602706,0.00058640324,0.00026923264,0.00004294717,0.0005453811,0.0007641062,0.0000018099657],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014259933,0.00021914944,0.09781213,0.000049863393,0.00022556218,0.000060264483,0.0040874635,0.005621076,0.0022442846,0.008141104,0.09775137,0.78364515],"study_design_scores_gemma":[0.0019032069,0.008811815,0.49101666,0.0028232078,0.00014314639,0.0064372793,0.000042716405,0.12947184,0.08041006,0.2734515,0.004504855,0.0009836811],"about_ca_topic_score_codex":0.000008413074,"about_ca_topic_score_gemma":0.0000011835708,"teacher_disagreement_score":0.81951797,"about_ca_system_score_codex":0.000028735292,"about_ca_system_score_gemma":0.00004744054,"threshold_uncertainty_score":0.6276216},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.060789546934819444,"score_gpt":0.2733559608578666,"score_spread":0.21256641392304718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030187589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093035944,0.00020493058,0.90465164,0.0008009416,0.00088250556,0.00010487007,6.2459367e-7,0.000034741533,0.00028380827],"genre_scores_gemma":[0.7462589,0.000014973895,0.25292143,0.00034070548,0.00041919108,7.8481156e-7,0.0000013829618,0.000004303206,0.000038277372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985207,0.00012949303,0.00047719205,0.0001587765,0.00045415136,0.00025971627],"domain_scores_gemma":[0.99868363,0.00032536878,0.00030868468,0.00030823034,0.00026935092,0.00010474583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002306503,0.000111026544,0.00017641472,0.00036776808,0.00025383022,0.00017216882,0.0010019909,0.000033566237,0.000017356833],"category_scores_gemma":[0.00003081437,0.00007474455,0.00011791963,0.0012637549,0.00010383118,0.00030164767,0.00023808391,0.00024637606,0.000015351447],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005083762,0.0003406148,0.0006378393,0.000032489574,0.00015375065,0.00003803589,0.0014947718,0.038833376,0.004610004,0.11182932,0.00434675,0.83763224],"study_design_scores_gemma":[0.0025866653,0.0009920497,0.11874471,0.00007999324,0.000037626727,0.003257528,0.000028171788,0.61543745,0.014094504,0.22979546,0.014336412,0.0006094343],"about_ca_topic_score_codex":0.000003983018,"about_ca_topic_score_gemma":0.0000016027915,"teacher_disagreement_score":0.8370228,"about_ca_system_score_codex":0.000033652508,"about_ca_system_score_gemma":0.00006300297,"threshold_uncertainty_score":0.30479944},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026847956045254667,"score_gpt":0.2612589342968718,"score_spread":0.23441097825161714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030553922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019053519,0.000069524605,0.97469914,0.0037150204,0.00050412427,0.000072486575,5.212725e-7,0.0016407132,0.00024496968],"genre_scores_gemma":[0.74296594,0.000016441554,0.25216118,0.003687617,0.0011351471,0.0000011113102,0.0000011795947,0.0000049147147,0.000026474356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898475,0.000101963284,0.0002242124,0.00017052554,0.00029877917,0.00021976879],"domain_scores_gemma":[0.99915165,0.0001709447,0.00013183255,0.00036796858,0.00009794876,0.00007963824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004881779,0.00012188009,0.000107956635,0.00007353425,0.00045378093,0.00062253076,0.0010389582,0.0000348161,0.0000058597716],"category_scores_gemma":[0.000055424294,0.00008185911,0.00006671166,0.00017490142,0.00002344749,0.0003617926,0.00015360484,0.00030477138,0.000027398219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031039515,0.0001508294,0.0020511032,0.0000014950607,0.000017763778,0.00009219054,0.0008225388,0.002306354,0.002445939,0.0027358108,0.35020715,0.63916576],"study_design_scores_gemma":[0.00039160755,0.0006007895,0.008791755,0.000042884196,0.000008554766,0.0024698274,0.0000010692095,0.9334044,0.0015844472,0.050794274,0.0016621778,0.0002482122],"about_ca_topic_score_codex":0.000004362009,"about_ca_topic_score_gemma":5.182861e-7,"teacher_disagreement_score":0.93109804,"about_ca_system_score_codex":0.000060867125,"about_ca_system_score_gemma":0.000047035952,"threshold_uncertainty_score":0.6003078},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Algorithm","score_opus":0.05822499298085235,"score_gpt":0.35446574423089033,"score_spread":0.296240751250038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067531935","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011575375,0.00007553258,0.993701,0.002036701,0.0013553458,0.0001607457,2.5074084e-7,0.0012994973,0.00021341968],"genre_scores_gemma":[0.064040124,0.0000022490676,0.9315552,0.002589398,0.0017407093,0.000017365006,2.1840134e-7,0.000018667253,0.00003607463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998337,0.0004673583,0.0003470237,0.00024988438,0.00019148728,0.00040725264],"domain_scores_gemma":[0.9934655,0.005198368,0.0002770156,0.0007531141,0.00021213558,0.00009386552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004638011,0.00018010805,0.00019654159,0.000071633796,0.0011917893,0.00086464075,0.0023377503,0.00004426617,9.61778e-7],"category_scores_gemma":[0.00084967015,0.00009567254,0.00012776595,0.00026320756,0.000084194995,0.000163366,0.00047160444,0.00039315305,0.0000064154037],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002152241,0.0000130244125,0.00022642319,0.000007971212,0.000014602111,0.000003413731,0.0005431917,0.0006589123,0.00020540359,0.0024763234,0.017290289,0.9785583],"study_design_scores_gemma":[0.00015546888,0.00018524697,0.0008372962,0.000065983186,0.000012554028,0.0010382258,0.0000012913957,0.82441354,0.00016526484,0.1679507,0.0050343582,0.0001400748],"about_ca_topic_score_codex":0.000008082893,"about_ca_topic_score_gemma":2.2817812e-7,"teacher_disagreement_score":0.97841823,"about_ca_system_score_codex":0.000030678282,"about_ca_system_score_gemma":0.00006605202,"threshold_uncertainty_score":0.91664004},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.2676959303533572,"score_gpt":0.41054412730888146,"score_spread":0.14284819695552425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068551941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04440373,0.000084795654,0.9445597,0.005423245,0.0047072093,0.0003391111,0.000013248452,0.000039135157,0.0004298444],"genre_scores_gemma":[0.6866053,0.000004395632,0.30742526,0.0019337815,0.002836461,0.0000069814614,0.000054253578,0.000022886908,0.0011106898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689895,0.00029384263,0.000698367,0.0005695288,0.0011904147,0.0003489041],"domain_scores_gemma":[0.995309,0.0018237245,0.0003920356,0.0018726892,0.00047226134,0.00013026895],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.011432901,0.00012772685,0.00018708184,0.00021056503,0.0009715415,0.003912362,0.0038278669,0.000025367044,0.00014389085],"category_scores_gemma":[0.0006983699,0.000070518945,0.0000941041,0.0006231412,0.0000900666,0.0004207727,0.0018115198,0.00020167237,0.00047293695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004614133,0.00002749116,0.000043005162,0.0000011498987,0.000012727536,0.000001842663,0.00017229911,0.059518375,0.000010075394,0.00016676413,0.46052667,0.479515],"study_design_scores_gemma":[0.0002983657,0.000029597843,0.0033114918,0.00002329288,0.000012306785,0.000064665386,0.00012059595,0.9326094,0.0000031739612,0.023607532,0.0398225,0.000097109805],"about_ca_topic_score_codex":0.000008118894,"about_ca_topic_score_gemma":0.0000015876241,"teacher_disagreement_score":0.873091,"about_ca_system_score_codex":0.00003513478,"about_ca_system_score_gemma":0.000045215318,"threshold_uncertainty_score":0.9971217},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005933923430842207,"score_gpt":0.19317194186566639,"score_spread":0.18723801843482418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098048233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069191963,0.00006655247,0.99110174,0.00051169965,0.00031512202,0.00027438378,5.150979e-7,0.0006611035,0.0001497016],"genre_scores_gemma":[0.5705232,0.000008489561,0.42878944,0.00017360602,0.0004122485,0.000023647073,0.000003215561,0.00005478081,0.000011334362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867976,0.00008415158,0.00034765404,0.00016976138,0.00021661565,0.0005020598],"domain_scores_gemma":[0.99923456,0.00025941778,0.00005543622,0.00030493707,0.000054714645,0.00009093969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004831173,0.0002135969,0.00026074445,0.00010917582,0.00014664704,0.00014693257,0.00058096094,0.00015564822,0.000038580092],"category_scores_gemma":[0.0000578951,0.00014912848,0.00007138176,0.00031328708,0.00006202491,0.00013596252,0.00014247661,0.0012006464,0.00003293348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014554252,0.000013694903,0.000010500048,0.0000079231995,0.000014185233,0.000020805517,0.000019051056,0.92354685,0.00027340866,0.0014379297,0.00053185475,0.07410923],"study_design_scores_gemma":[0.00048444487,0.00011850362,0.00026155406,0.0001631668,0.000007391173,0.000067021254,0.000004734865,0.9885175,0.00025338007,0.009731835,0.0001974932,0.00019298137],"about_ca_topic_score_codex":2.652593e-7,"about_ca_topic_score_gemma":0.0000010621314,"teacher_disagreement_score":0.56360406,"about_ca_system_score_codex":0.00009220251,"about_ca_system_score_gemma":0.000014392177,"threshold_uncertainty_score":0.60812825},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010246035185894176,"score_gpt":0.18872358441520898,"score_spread":0.1784775492293148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100142798","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002803858,0.00007224645,0.99358815,0.0014395211,0.00096524856,0.000048484697,8.874432e-7,0.000062212064,0.0010193806],"genre_scores_gemma":[0.26108935,0.000021813337,0.733041,0.0023823883,0.0026287,0.000007422815,0.0000027379047,0.00002060716,0.0008060072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989168,0.00014778912,0.00017372178,0.00016864276,0.00036348237,0.00022958765],"domain_scores_gemma":[0.99911404,0.00014040536,0.00012988556,0.000409009,0.0001117636,0.00009490396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006534319,0.000119181954,0.00011978073,0.000049964332,0.00046792542,0.00019607456,0.00054454803,0.000019184814,0.000027204907],"category_scores_gemma":[0.000009680473,0.000061874154,0.000050190178,0.00013699075,0.00007352386,0.00064897735,0.00020897666,0.00025446148,0.000057509264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010318932,0.000060437498,0.001421915,0.000022668515,0.00015357461,0.00008695642,0.0009986334,0.0130415205,0.00018793994,0.6775536,0.05885512,0.24751447],"study_design_scores_gemma":[0.0023235083,0.0010797747,0.04969511,0.0002828339,0.000032642733,0.019722562,0.00018389814,0.28200376,0.00046525223,0.020130033,0.6231792,0.0009014573],"about_ca_topic_score_codex":0.000004848476,"about_ca_topic_score_gemma":0.0000069485995,"teacher_disagreement_score":0.65742356,"about_ca_system_score_codex":0.000026318923,"about_ca_system_score_gemma":0.00005670774,"threshold_uncertainty_score":0.35989514},"labels":[],"label_agreement":null},{"id":"W2105170022","doi":"10.1093/comjnl/bxu109","title":"Dataflow-Based Scheduling for Scientific Workflows in HPC with Storage Constraints","year":2014,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of New Brunswick","funders":"","keywords":"Dataflow; IBM; Workflow; Computer science; Scheduling (production processes); Library science; Operating system; Database; Engineering","score_opus":0.0227176618995806,"score_gpt":0.2383109939341042,"score_spread":0.2155933320345236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105170022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053748578,0.00005468363,0.9427442,0.0010803095,0.0019247096,0.00023413694,0.000004838631,0.000074205505,0.0001343626],"genre_scores_gemma":[0.796751,3.1456736e-7,0.20234676,0.0003319686,0.0005197126,0.000005456995,0.00000770984,0.000010341483,0.000026728421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799263,0.00031433656,0.00039741205,0.00039867594,0.00039128662,0.0005056331],"domain_scores_gemma":[0.9982869,0.00044774378,0.00024176529,0.0006956478,0.00018310941,0.00014485093],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003419265,0.00018870212,0.0002564676,0.00018177263,0.00062341895,0.0016793067,0.002028921,0.000048006976,0.0000050520634],"category_scores_gemma":[0.0000347953,0.00012355893,0.00008963733,0.00051731674,0.00019348899,0.00031410143,0.00016887809,0.00039450874,0.000019187064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005149261,0.00015118733,0.0012956565,0.00004531182,0.00004809651,0.00004949761,0.0010191165,0.8658255,0.000089381465,0.018787015,0.0040313327,0.10860644],"study_design_scores_gemma":[0.0013787491,0.00014637916,0.00061731355,0.00025098422,0.000006062037,0.00023846113,0.000011820527,0.9864811,0.00002665298,0.0017050705,0.0089409,0.0001965215],"about_ca_topic_score_codex":0.0000023030914,"about_ca_topic_score_gemma":0.000007052234,"teacher_disagreement_score":0.7430024,"about_ca_system_score_codex":0.000055487166,"about_ca_system_score_gemma":0.0002375758,"threshold_uncertainty_score":0.99935704},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Interconnection; Automation; Library science; Computer science; Media studies; Telecommunications; Sociology; Engineering","score_opus":0.043824665053283585,"score_gpt":0.2694400138377506,"score_spread":0.22561534878446704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113143036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048428262,0.0003322579,0.9820363,0.0014110975,0.015086039,0.00029338858,1.5867579e-7,0.00014255352,0.00021393444],"genre_scores_gemma":[0.6247298,0.000024727595,0.36812755,0.0011189898,0.0058358843,0.00003143738,7.395769e-7,0.000016090322,0.00011474366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998389,0.00042017284,0.0004031161,0.00015903516,0.00016273661,0.0004659235],"domain_scores_gemma":[0.9983076,0.000749906,0.00029384697,0.0003448196,0.00017649235,0.00012737869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002850532,0.00014863588,0.00017604398,0.00008932308,0.0006515979,0.00066571496,0.00074342726,0.000111834815,0.00002900457],"category_scores_gemma":[0.00003481083,0.00009880623,0.00014435676,0.00021465303,0.000019340356,0.0010091922,0.00005862525,0.0004226598,0.000034684028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056316636,0.00010862561,0.000118708915,0.000014347963,0.00018078694,0.0000024342037,0.004828357,0.25852847,0.00005624455,0.3407332,0.0928802,0.3024923],"study_design_scores_gemma":[0.00019566303,0.0001547028,0.00015640112,0.000077653596,0.000009469335,0.00087332405,0.000033378547,0.96565557,0.000120370285,0.025343966,0.0072388663,0.00014062872],"about_ca_topic_score_codex":0.0000024191593,"about_ca_topic_score_gemma":4.6481006e-7,"teacher_disagreement_score":0.7071271,"about_ca_system_score_codex":0.00009680828,"about_ca_system_score_gemma":0.000026305383,"threshold_uncertainty_score":0.6419505},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.023927458676612702,"score_gpt":0.2664893303932322,"score_spread":0.2425618717166195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115805990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077367714,0.00006314156,0.983395,0.00019671182,0.0008511481,0.0075944914,0.000005876751,0.00003644926,0.000120428915],"genre_scores_gemma":[0.9583272,0.0000050335498,0.037079755,0.0002351044,0.0005845502,0.0036731048,0.0000011648187,0.000025237554,0.00006890018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835646,0.00028557747,0.00044536413,0.00020743643,0.0003400449,0.00036508584],"domain_scores_gemma":[0.9977822,0.0007680838,0.0003562002,0.00080630014,0.0002040716,0.000083158804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014511547,0.00015937944,0.00022681044,0.000036853566,0.0004315888,0.0004052348,0.001612482,0.000048040576,0.000010878738],"category_scores_gemma":[0.00004668406,0.00008103286,0.00012454332,0.0002237576,0.00006390717,0.00016389243,0.00015913787,0.00037829927,0.0000057971506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037152684,0.00011947515,0.000074105505,0.000053525015,0.000095365125,0.000010672188,0.0005156595,0.5744173,0.00015495816,0.39569005,0.020438448,0.00839325],"study_design_scores_gemma":[0.0009262215,0.00053723925,0.000131692,0.00026289208,0.000011247589,0.00042752537,0.00003475818,0.9593722,0.0015541335,0.015595864,0.020967068,0.00017912245],"about_ca_topic_score_codex":0.000001985446,"about_ca_topic_score_gemma":2.5819253e-7,"teacher_disagreement_score":0.9505904,"about_ca_system_score_codex":0.00005828771,"about_ca_system_score_gemma":0.000073783434,"threshold_uncertainty_score":0.39076886},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024492810196424193,"score_gpt":0.2751257480898439,"score_spread":0.2506329378934197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138341340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14960308,0.000028320848,0.8472625,0.00035109385,0.0006909518,0.0018421619,1.8952181e-7,0.00015417112,0.00006750957],"genre_scores_gemma":[0.92535156,7.119712e-7,0.07310518,0.00018229033,0.0012190592,0.00011044548,7.1440564e-7,0.000017082617,0.000012940616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973778,0.0005751498,0.0006791239,0.00035200067,0.0005811642,0.00043476227],"domain_scores_gemma":[0.99835086,0.00012137946,0.0005635192,0.00036114253,0.00045709623,0.00014599884],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012206977,0.0002446349,0.00030151618,0.00018805382,0.00086883816,0.0018148738,0.0016923876,0.00007590833,0.000024436826],"category_scores_gemma":[0.000022530046,0.00015993587,0.00020657877,0.000446091,0.000037158312,0.0011446958,0.0008677464,0.0006370003,0.000071481154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002619881,0.00014011074,0.00017203263,0.00013845575,0.00027747694,0.00006792021,0.009352747,0.74918485,0.0036774941,0.014032184,0.002813618,0.2201169],"study_design_scores_gemma":[0.00045433114,0.00009632051,0.00022305024,0.00031492743,0.000020080588,0.0010960534,0.00012117628,0.9965353,0.00037846467,0.00033553786,0.0002275687,0.0001971921],"about_ca_topic_score_codex":0.000040640873,"about_ca_topic_score_gemma":0.000008939626,"teacher_disagreement_score":0.7757485,"about_ca_system_score_codex":0.00022848647,"about_ca_system_score_gemma":0.0000671441,"threshold_uncertainty_score":0.9992213},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.031802227437859446,"score_gpt":0.2767520743121598,"score_spread":0.24494984687430038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141961918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009742856,0.000012818429,0.9701509,0.00045590036,0.00049338886,0.018628478,0.000006348349,0.00018217512,0.0003271583],"genre_scores_gemma":[0.9676694,0.0000048500415,0.024853025,0.0001133542,0.0028180694,0.004443524,0.000033920103,0.000057623558,0.000006195245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984259,0.00031054317,0.00047607903,0.00019649479,0.00017316813,0.00041781578],"domain_scores_gemma":[0.9978468,0.0006990253,0.0001358406,0.001135341,0.00011067798,0.00007232913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003103646,0.00018741372,0.00025194968,0.000039441038,0.0003209732,0.00017697016,0.0010064143,0.000081579834,0.0000043280447],"category_scores_gemma":[0.00005906018,0.00014878827,0.000056661702,0.00015332756,0.00004549316,0.00030729733,0.00049671606,0.0007798988,0.0000033071233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036261416,0.000019012898,0.0013202683,0.00004377646,0.00002985091,0.0000026033433,0.00044073182,0.97270334,0.000017210356,0.00012178635,0.010992935,0.014272243],"study_design_scores_gemma":[0.00069874944,0.000030024326,0.0068751965,0.00039742928,0.000009899186,0.00007000504,0.000027360738,0.9857759,0.0000313046,0.00076547475,0.005148986,0.00016970221],"about_ca_topic_score_codex":0.000006643384,"about_ca_topic_score_gemma":0.000032912256,"teacher_disagreement_score":0.9579266,"about_ca_system_score_codex":0.00013280277,"about_ca_system_score_gemma":0.000021362319,"threshold_uncertainty_score":0.60674095},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01711651098211092,"score_gpt":0.1987088136089118,"score_spread":0.18159230262680087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143664221","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60652214,0.00034448292,0.38934013,0.001223662,0.0009571499,0.00015776363,5.800149e-7,0.00009751163,0.0013565444],"genre_scores_gemma":[0.9580759,0.000025501304,0.03728894,0.0041140052,0.00043584526,0.000010586173,8.8118014e-7,0.000016129088,0.000032260097],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9985631,0.00016449347,0.00026309295,0.0002823549,0.00032661497,0.0004003313],"domain_scores_gemma":[0.9990193,0.000099587196,0.0001480637,0.0005379244,0.00009878451,0.0000963323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037549896,0.00020522503,0.000193868,0.00014724325,0.00026333804,0.00044056887,0.0018743458,0.000033896882,0.000015088969],"category_scores_gemma":[6.1515055e-7,0.00011623324,0.000049458144,0.00065367104,0.000032129767,0.0010409786,0.00046769468,0.00046302215,0.000020809564],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006292745,0.0011645724,0.08896815,0.0002768701,0.0006539694,0.0026611423,0.5601287,0.030344844,0.0007369146,0.034756273,0.0011400334,0.27853927],"study_design_scores_gemma":[0.008756367,0.002958856,0.5548782,0.0020840657,0.00017204408,0.018655697,0.0059710154,0.26801613,0.010681568,0.075669006,0.048163343,0.003993704],"about_ca_topic_score_codex":0.00021222568,"about_ca_topic_score_gemma":0.00035133268,"teacher_disagreement_score":0.5541577,"about_ca_system_score_codex":0.00003231827,"about_ca_system_score_gemma":0.0000739452,"threshold_uncertainty_score":0.4739854},"labels":[],"label_agreement":null},{"id":"W2147263224","doi":"10.1093/comjnl/bxu056","title":"A Resilient P2P Architecture for Mobile Resource Sharing","year":2014,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Distributed computing; Delegate; Computer network; Overhead (engineering); Context (archaeology); Protocol (science); Network topology","score_opus":0.01251236382127508,"score_gpt":0.24111155991064237,"score_spread":0.2285991960893673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147263224","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025844086,0.00013577471,0.96097404,0.01139813,0.000637889,0.0003143076,8.4674565e-7,0.00034741493,0.00034748667],"genre_scores_gemma":[0.26793364,0.0000070136675,0.724106,0.0050482946,0.0023107259,0.000077130426,0.0000010220953,0.00003562382,0.00048051422],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983199,0.00010357279,0.00029833024,0.00038459426,0.00034952787,0.00054404174],"domain_scores_gemma":[0.9981859,0.000338132,0.0001445428,0.0010880505,0.00009725308,0.0001461533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014083767,0.00018734731,0.00021106623,0.00018374373,0.00050423725,0.00058104825,0.0042989375,0.00006717602,0.0000025505137],"category_scores_gemma":[0.00006413951,0.00012195741,0.00013850255,0.00036277244,0.000058699734,0.00012968724,0.0015824207,0.0005513942,0.000026783775],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024460664,0.00003484435,0.00009449317,0.00000914798,0.00003755103,0.000010528584,0.0015989017,0.11890827,0.00018049532,0.016782282,0.1017752,0.7605438],"study_design_scores_gemma":[0.0004781731,0.0005929813,0.0006810391,0.00008460997,0.000009933958,0.0007180794,0.000019919637,0.38904104,0.00052350364,0.08430375,0.52326095,0.0002860343],"about_ca_topic_score_codex":0.0000015214899,"about_ca_topic_score_gemma":0.0000033171737,"teacher_disagreement_score":0.7602578,"about_ca_system_score_codex":0.000059488808,"about_ca_system_score_gemma":0.000026402115,"threshold_uncertainty_score":0.7988567},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.018893413900141782,"score_gpt":0.2458025956961732,"score_spread":0.2269091817960314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149936759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022618752,0.0007368176,0.9674962,0.007483547,0.0011379394,0.00013716453,0.0000012586695,0.0001008023,0.00028747268],"genre_scores_gemma":[0.7378102,0.00023201831,0.2535375,0.0058143805,0.002540238,0.000004233039,0.000002704226,0.000025958614,0.000032784275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981679,0.00036370044,0.0002857327,0.0002242182,0.0005198186,0.0004386305],"domain_scores_gemma":[0.9986636,0.0003555112,0.00020821058,0.00042124485,0.00011978445,0.00023165686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018238468,0.0002018306,0.00017531725,0.00016227407,0.0004085906,0.000467196,0.0005439459,0.00004384407,0.000038712868],"category_scores_gemma":[0.00004564646,0.00013945582,0.00009925551,0.00024485323,0.00008561454,0.001287814,0.00019292245,0.0005172958,0.00008865228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046690827,0.0020219695,0.0055381893,0.0006928125,0.00033127127,0.0005067607,0.012697356,0.028207283,0.10572233,0.05498634,0.19782184,0.59100693],"study_design_scores_gemma":[0.0009316877,0.00031223992,0.012245566,0.000454727,0.000028572065,0.0010430095,0.0000160224,0.97760236,0.0024122305,0.002650209,0.0019453736,0.00035797086],"about_ca_topic_score_codex":0.0000048266334,"about_ca_topic_score_gemma":3.623209e-7,"teacher_disagreement_score":0.9493951,"about_ca_system_score_codex":0.000082176404,"about_ca_system_score_gemma":0.00005676089,"threshold_uncertainty_score":0.56868434},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013136950572244179,"score_gpt":0.21302345001104855,"score_spread":0.19988649943880438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150574820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026595704,0.00008510456,0.9693763,0.0024140633,0.0010068029,0.00007328037,0.00000127746,0.00006775995,0.00037970248],"genre_scores_gemma":[0.6443118,0.000039313483,0.35139424,0.0015819584,0.0022041055,0.0000023613497,0.0000017315489,0.000019979605,0.00044455004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884915,0.00009195549,0.00020535509,0.00019832679,0.00033442248,0.00032078451],"domain_scores_gemma":[0.9990627,0.00007144281,0.00013611978,0.00048359443,0.00009652217,0.00014961293],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002755958,0.00013053884,0.00011997929,0.000073685114,0.0005619188,0.0013397023,0.0019617812,0.000033475393,0.00011441785],"category_scores_gemma":[0.0000027343488,0.00008122753,0.00007682139,0.00015625657,0.000035817568,0.0017250221,0.000962384,0.00045341204,0.00015933279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037104662,0.000056469686,0.00036043528,0.0000041720464,0.0000652422,0.000059867565,0.0028797388,0.003416795,0.0002822665,0.016928291,0.10121197,0.87473106],"study_design_scores_gemma":[0.00045645598,0.00008785933,0.003889243,0.000054849286,0.0000060926936,0.00051635125,0.000106088584,0.97706324,0.00014573523,0.0063830074,0.011094316,0.00019677125],"about_ca_topic_score_codex":0.00002820163,"about_ca_topic_score_gemma":3.7980803e-7,"teacher_disagreement_score":0.97364646,"about_ca_system_score_codex":0.000045169916,"about_ca_system_score_gemma":0.00005397454,"threshold_uncertainty_score":0.999697},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Library science; Computer science; Point (geometry); Art history; Management; History; Mathematics","score_opus":0.03781534554123004,"score_gpt":0.32767521011262674,"score_spread":0.2898598645713967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152795079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076889396,0.00005505878,0.9210114,0.0005201141,0.0013800905,0.00009212555,4.2120695e-7,0.000033231237,0.000018178063],"genre_scores_gemma":[0.46880198,0.0000070215106,0.5302688,0.00033585384,0.0005792676,4.5776815e-7,1.619247e-7,0.000004705439,0.0000017867964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984616,0.0003645292,0.00042433315,0.00017048963,0.0003333551,0.0002456836],"domain_scores_gemma":[0.9990903,0.00012259917,0.0003637438,0.00024373058,0.00010206826,0.000077520555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010546206,0.00012265082,0.00019921067,0.00009127095,0.00031235104,0.00022861503,0.00053892354,0.000028312372,0.00002082611],"category_scores_gemma":[0.000010366604,0.00008392019,0.00013487278,0.00020991251,0.000026040529,0.00044169414,0.00008289491,0.00023674258,0.0000029873197],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018854053,0.00004073355,0.000029265908,0.0000035613623,0.000033682867,0.000008764796,0.0007448277,0.0012474175,0.03893371,0.0011464567,0.00010845562,0.9576843],"study_design_scores_gemma":[0.0016541333,0.0009525881,0.008242583,0.00012631794,0.000088108434,0.000753633,0.00019705227,0.9137278,0.03791034,0.035613313,0.00037252242,0.0003615869],"about_ca_topic_score_codex":0.000022017131,"about_ca_topic_score_gemma":3.1311274e-7,"teacher_disagreement_score":0.95732266,"about_ca_system_score_codex":0.00003953895,"about_ca_system_score_gemma":0.00006455865,"threshold_uncertainty_score":0.3422166},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03357069603471791,"score_gpt":0.294971855487683,"score_spread":0.2614011594529651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155056246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033982027,0.00024091633,0.955578,0.0033162546,0.004116686,0.00021655389,0.000004867695,0.00008440032,0.0024602856],"genre_scores_gemma":[0.9860751,0.000026725329,0.0026937253,0.0007274063,0.010023671,0.000005364284,6.528538e-7,0.000009273996,0.00043809702],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99836355,0.0005795202,0.00021034256,0.000079579884,0.00032330406,0.00044371],"domain_scores_gemma":[0.99892014,0.00051344186,0.00016369493,0.000095223426,0.00013231653,0.00017515295],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.006118626,0.00008848985,0.00012665901,0.000041605275,0.0020702246,0.00015719015,0.0004102248,0.0004162097,0.000022196517],"category_scores_gemma":[0.00011024824,0.0000607667,0.000120123594,0.00009306213,0.00011432683,0.00023210497,0.000044931083,0.0017157001,0.000034686742],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028860217,0.00018798526,0.0068052514,0.00011990529,0.00040724684,0.0000068161016,0.22426648,0.0010820132,0.0006143552,0.16778512,0.13294676,0.46548948],"study_design_scores_gemma":[0.0005418913,0.000068578425,0.0011286206,0.000075320604,0.00008889884,0.0004494315,0.006299549,0.017294716,0.0006097971,0.005079003,0.9681095,0.0002547132],"about_ca_topic_score_codex":0.00015030714,"about_ca_topic_score_gemma":0.00006730249,"teacher_disagreement_score":0.95288426,"about_ca_system_score_codex":0.00018369823,"about_ca_system_score_gemma":0.00007123258,"threshold_uncertainty_score":0.99922895},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Stream cipher; Simple (philosophy); Power (physics); Library science; Cryptography; Algorithm; Philosophy","score_opus":0.013943070150374909,"score_gpt":0.27038009865218887,"score_spread":0.25643702850181394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157326316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21042669,0.0000075082858,0.78837186,0.0005332349,0.00021676318,0.000109414505,7.138439e-7,0.00010916796,0.00022467517],"genre_scores_gemma":[0.7577431,6.319228e-7,0.24178217,0.00037324466,0.00008776591,0.0000014252839,5.6409266e-7,0.00000820764,0.0000028440647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984067,0.00026127117,0.00043600483,0.00027560288,0.00035816387,0.00026225077],"domain_scores_gemma":[0.9981062,0.00019571504,0.00046018808,0.00089240575,0.00021370768,0.00013182971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009828727,0.00015401538,0.00029049205,0.00032361178,0.0002091925,0.00020421938,0.0015649582,0.00004856079,0.000008265956],"category_scores_gemma":[0.00003440739,0.000117255746,0.00018364414,0.0012767267,0.000076632205,0.00021891581,0.0003703557,0.000251206,0.000005580663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117611795,0.00032564715,0.08336795,0.000042597407,0.0023932564,0.00002149834,0.018896362,0.21861409,0.013249833,0.048370894,0.009413416,0.6051868],"study_design_scores_gemma":[0.0002627639,0.00019994477,0.02244394,0.000031630545,0.00015454256,0.00016897943,0.00007272179,0.965384,0.0016939262,0.008589024,0.000718372,0.00028015728],"about_ca_topic_score_codex":0.00008088363,"about_ca_topic_score_gemma":0.000017747925,"teacher_disagreement_score":0.7467699,"about_ca_system_score_codex":0.0000809735,"about_ca_system_score_gemma":0.000047224923,"threshold_uncertainty_score":0.47815505},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.2729334040908656,"score_gpt":0.35712839840297916,"score_spread":0.08419499431211358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158156456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054060537,0.00012522137,0.9420506,0.0025621774,0.00013441911,0.00018182881,0.0000010377787,0.000032412623,0.0008517797],"genre_scores_gemma":[0.95221287,0.000127987,0.045688435,0.0017402503,0.0001871452,0.0000097793645,0.0000017253486,0.0000037610241,0.000028033448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989353,0.000101276855,0.0002904409,0.00019317014,0.00020827519,0.00027152582],"domain_scores_gemma":[0.9991348,0.00030935058,0.00010002741,0.00015821098,0.00018597217,0.00011165315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018199157,0.00009860863,0.0001218564,0.00019393,0.000490446,0.00044064198,0.00052851293,0.000023147506,0.0000059880394],"category_scores_gemma":[0.000018836005,0.000073293486,0.00003856979,0.00026360803,0.00019455965,0.00058335165,0.0002911272,0.0002636993,0.0000057824973],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015276832,0.00007393772,0.00030621616,0.000004766047,0.000021023505,0.000038438433,0.002793092,0.00017886765,0.0000817063,0.07993651,0.000077126395,0.91647303],"study_design_scores_gemma":[0.00076289306,0.000071770075,0.0051858444,0.00006877015,0.000010137128,0.00072947494,0.0007693438,0.8249798,0.000034189034,0.16565284,0.0015098043,0.00022515387],"about_ca_topic_score_codex":0.000009326484,"about_ca_topic_score_gemma":0.00001747167,"teacher_disagreement_score":0.9162479,"about_ca_system_score_codex":0.000029112782,"about_ca_system_score_gemma":0.00008339861,"threshold_uncertainty_score":0.42491207},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016770512411625842,"score_gpt":0.2353502862431745,"score_spread":0.21857977383154867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167884148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020954277,0.0000377312,0.97194844,0.0057910504,0.0004792843,0.0001795152,1.5922109e-7,0.00007856179,0.00053098676],"genre_scores_gemma":[0.8391403,0.0000039379734,0.15619572,0.0035344223,0.0010238084,0.000004907465,7.847123e-7,0.000015090545,0.00008102952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980464,0.0005718767,0.00026113325,0.00027806623,0.00058530166,0.00025724343],"domain_scores_gemma":[0.9989357,0.00021320953,0.00019497698,0.00045467282,0.00009882992,0.00010258959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028011012,0.00015211954,0.00014298566,0.00012723195,0.0005735566,0.00054121204,0.00072072324,0.000041566458,0.0000032635287],"category_scores_gemma":[0.00003209934,0.00010316193,0.00006258424,0.00016741929,0.000038276525,0.00003548137,0.0003965287,0.00029868472,0.000004240132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015565012,0.000028919458,0.000010678939,0.000004377392,0.00001016421,0.0000020181365,0.00039831127,0.9291533,0.0000057675506,0.0015087499,0.0014705785,0.06739157],"study_design_scores_gemma":[0.00084378576,0.00025178902,0.000103494014,0.00006697588,0.000019240017,0.00006431057,0.0000070544747,0.9961464,0.0000094962015,0.0010808808,0.0012757253,0.00013086769],"about_ca_topic_score_codex":0.0000015221156,"about_ca_topic_score_gemma":4.1454265e-7,"teacher_disagreement_score":0.81818604,"about_ca_system_score_codex":0.00007312932,"about_ca_system_score_gemma":0.000035020486,"threshold_uncertainty_score":0.521892},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012198017186295377,"score_gpt":0.2456373021620377,"score_spread":0.23343928497574232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169611088","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074199373,0.00019182696,0.98765886,0.00289053,0.0013140701,0.00011412467,3.9409707e-7,0.000096560216,0.00031370192],"genre_scores_gemma":[0.26106742,0.000041629602,0.73293775,0.0020364507,0.0031407173,0.0000028746465,0.0000036507615,0.00001986999,0.00074961135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990145,0.00008112762,0.00018061021,0.0001672228,0.00021262026,0.00034389383],"domain_scores_gemma":[0.9993019,0.00016595067,0.00014438524,0.00015963025,0.00013436114,0.00009377578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012863247,0.000115940915,0.00011514652,0.00008528474,0.0007405522,0.00029290275,0.0006463914,0.000052455103,0.000004971476],"category_scores_gemma":[0.000017891103,0.00006922163,0.000105453924,0.0002968326,0.000019715628,0.00025039964,0.00013539693,0.0005675275,0.000008937533],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014464324,0.00015753323,0.0138372565,0.000015972595,0.0001502958,0.000053723958,0.002715775,0.012298252,0.00043296142,0.051101323,0.049423702,0.86966854],"study_design_scores_gemma":[0.00085356575,0.00051629345,0.01210586,0.000018544628,0.0000128592765,0.0017427694,0.000016103228,0.70516753,0.00021335411,0.004601796,0.27454966,0.00020166134],"about_ca_topic_score_codex":0.0000027739918,"about_ca_topic_score_gemma":0.0000069332095,"teacher_disagreement_score":0.8694669,"about_ca_system_score_codex":0.000045520635,"about_ca_system_score_gemma":0.00002786286,"threshold_uncertainty_score":0.5695804},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Chen; Library science; China; Computer science; Media studies; Telecommunications; History; Sociology; Archaeology","score_opus":0.011974792449936737,"score_gpt":0.19894799574837768,"score_spread":0.18697320329844094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170250042","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5923439,0.01867814,0.37346718,0.002317512,0.0037261194,0.00041859542,9.3508345e-7,0.0008024595,0.008245155],"genre_scores_gemma":[0.9795067,0.00093474484,0.017635627,0.00017977536,0.0016347202,0.000014877891,9.245704e-7,0.000024611676,0.00006803607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995205,0.000059083235,0.00014581591,0.00004506525,0.00006495143,0.00016459741],"domain_scores_gemma":[0.99939525,0.000164653,0.0000318242,0.00031338798,0.000030939333,0.00006392524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001713806,0.00007764795,0.000079052945,0.000023562698,0.00023882584,0.00017350547,0.0004402293,0.000030396017,0.0000158299],"category_scores_gemma":[0.0000010268449,0.00005541779,0.000023336843,0.00007143585,0.00006360262,0.00012117419,0.0001639879,0.00040314504,0.000018896837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.8219522e-7,0.0000069003154,0.0008968075,0.0000065879963,0.00005894782,0.0000024485664,0.00052337284,0.5109135,0.000070692295,0.0004169169,0.016232766,0.4708707],"study_design_scores_gemma":[0.0000853794,0.000012720675,0.0035796266,0.000047157282,0.000006870856,0.00026650348,0.000011621992,0.9765626,0.0000040983446,0.001408,0.017932018,0.000083359584],"about_ca_topic_score_codex":0.000013581625,"about_ca_topic_score_gemma":0.00000483657,"teacher_disagreement_score":0.47078735,"about_ca_system_score_codex":0.000017038277,"about_ca_system_score_gemma":0.0000037463303,"threshold_uncertainty_score":0.22598718},"labels":[],"label_agreement":null},{"id":"W2188424643","doi":"10.1093/comjnl/bxv084","title":"Labeling Dot-Cartesian and Dot-Lexicographic Product Graphs with a Condition at Distance Two","year":2015,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Lexicographical order; Cartesian product; Product (mathematics); Library science; Mathematics; Cartesian coordinate system; Computer science; Combinatorics; Physics; Geometry","score_opus":0.027513199516112835,"score_gpt":0.2883925827735022,"score_spread":0.26087938325738935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188424643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25185212,0.0016425947,0.74245715,0.0029530167,0.0004447269,0.00029040716,0.0000027167175,0.00012182731,0.00023541236],"genre_scores_gemma":[0.9369682,0.00007380624,0.06214357,0.00037696664,0.00032366696,0.000010934173,0.0000019110994,0.000021019428,0.00007994186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772316,0.00040853838,0.00026292962,0.00042873385,0.00066550216,0.00051112764],"domain_scores_gemma":[0.99830574,0.00014624055,0.0001959131,0.0006576858,0.00033273533,0.00036169868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001556108,0.00022031151,0.00021717465,0.00024351616,0.00069183356,0.00052406994,0.0011016459,0.000025403797,0.00000383729],"category_scores_gemma":[0.000020481382,0.00013491194,0.00006457336,0.00084463746,0.00041091707,0.0008334735,0.0004310981,0.0005582887,0.000012582221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009341374,0.0003994778,0.04471394,0.00009143268,0.0005931074,0.0011513545,0.013094545,0.011594913,0.0038956895,0.704155,0.008271776,0.21110462],"study_design_scores_gemma":[0.005687997,0.0013750144,0.008961033,0.00032296657,0.000054816024,0.013292513,0.00015662688,0.06103448,0.0014685383,0.9009703,0.005711074,0.0009646652],"about_ca_topic_score_codex":0.0000037116135,"about_ca_topic_score_gemma":0.000021110734,"teacher_disagreement_score":0.68511605,"about_ca_system_score_codex":0.00006576192,"about_ca_system_score_gemma":0.000087864624,"threshold_uncertainty_score":0.5501549},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Library science; Social media; Computer science; World Wide Web","score_opus":0.11094286586393774,"score_gpt":0.30858449122825093,"score_spread":0.19764162536431318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295232165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042639193,0.00029011388,0.9873943,0.00320852,0.0035839635,0.00010071828,9.084974e-7,0.00009625352,0.0010613092],"genre_scores_gemma":[0.75785846,0.000010284951,0.23260322,0.0006380746,0.008580893,0.00002131796,0.0000013192198,0.000021445896,0.00026496162],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989998,0.00015337538,0.000258404,0.00014681811,0.00018991457,0.00025170695],"domain_scores_gemma":[0.99904364,0.00032538126,0.00015095969,0.00021752251,0.00015806155,0.000104412895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013810523,0.00011265359,0.00017324026,0.00006945008,0.00032444246,0.00078475935,0.0012374348,0.000042954787,8.1659937e-7],"category_scores_gemma":[0.00002473864,0.000068828485,0.00012555944,0.00012549871,0.000029984778,0.00062279345,0.00033566693,0.00017097671,0.000007330457],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009629058,0.000058762944,0.000077125726,0.000008524144,0.00005155223,0.000010543329,0.025412008,0.00001186753,0.000023167066,0.06837844,0.5683162,0.33764213],"study_design_scores_gemma":[0.003760454,0.0007283431,0.002452415,0.00019821218,0.000050153412,0.0030182286,0.001301145,0.19495621,0.0009609251,0.27067006,0.52082473,0.0010791112],"about_ca_topic_score_codex":0.0000013418139,"about_ca_topic_score_gemma":0.000003101361,"teacher_disagreement_score":0.7547911,"about_ca_system_score_codex":0.000058562924,"about_ca_system_score_gemma":0.00012559416,"threshold_uncertainty_score":0.7567452},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Classics; Library science; Art history; Humanities; History; Art; Computer science","score_opus":0.029200113131055153,"score_gpt":0.26755952554373696,"score_spread":0.23835941241268183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295628431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03257878,0.00083190686,0.96282625,0.0022050438,0.0012339494,0.0000706024,9.962803e-7,0.000059047445,0.00019339233],"genre_scores_gemma":[0.8404087,0.000047954927,0.15664715,0.0012575706,0.0014507931,0.000001413843,0.000002946896,0.000008963813,0.00017454698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986803,0.00016667653,0.00025545454,0.00020951619,0.00043929523,0.00024874177],"domain_scores_gemma":[0.99872285,0.00046422583,0.00013739365,0.00022787196,0.00019823012,0.00024941494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010001833,0.00013451264,0.00014699844,0.00030493597,0.0003621376,0.0005911902,0.00066958275,0.000039664035,0.0000037027132],"category_scores_gemma":[0.00008619996,0.00009342402,0.000045515204,0.00065713376,0.00003376059,0.0004036893,0.000128803,0.00027963478,0.000041589756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034361306,0.00013398385,0.00033250195,0.000010236296,0.00010116745,0.00038849507,0.0031015004,0.20629637,0.00009459806,0.025766041,0.0351079,0.72863287],"study_design_scores_gemma":[0.0005330038,0.00030129662,0.0005038886,0.000013442512,0.000010047238,0.0041282196,0.000036071808,0.9602255,0.000040810013,0.021445658,0.012588598,0.0001734349],"about_ca_topic_score_codex":0.000004646352,"about_ca_topic_score_gemma":0.000001252781,"teacher_disagreement_score":0.80782986,"about_ca_system_score_codex":0.000053444717,"about_ca_system_score_gemma":0.00010560055,"threshold_uncertainty_score":0.57008606},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Library science; Volume (thermodynamics); Computer science; Physics","score_opus":0.033576470382070456,"score_gpt":0.2682279704166801,"score_spread":0.23465150003460966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2481557120","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017612124,0.0044279923,0.9677124,0.004779201,0.0015527278,0.00041525476,0.000080455895,0.0002408691,0.0031789623],"genre_scores_gemma":[0.21529922,0.0015727861,0.7694806,0.0034941563,0.008157976,0.00003072065,0.00015012131,0.000101649246,0.0017127708],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966873,0.00021108043,0.00070033694,0.0010561774,0.00058072375,0.00076437136],"domain_scores_gemma":[0.99606293,0.00023108134,0.0004189098,0.002758599,0.00013236186,0.0003961172],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014678772,0.0004834327,0.00049981946,0.00016035198,0.0009793082,0.0027660443,0.0055284314,0.000128459,0.000017271877],"category_scores_gemma":[0.000037346214,0.00035418247,0.0001363587,0.0005490521,0.00018695217,0.0026513878,0.0024785814,0.0008731418,0.000085353786],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002251791,0.00086000026,0.0005012712,0.00002876167,0.00019808381,0.000109878674,0.0029658524,0.00014182301,0.0002009576,0.016525455,0.5215384,0.45690703],"study_design_scores_gemma":[0.0018032021,0.00038327405,0.025287844,0.00021964968,0.00016770413,0.0043378077,0.0001824663,0.65447676,0.00008569286,0.002503131,0.30932727,0.0012251864],"about_ca_topic_score_codex":0.000016562308,"about_ca_topic_score_gemma":0.0000040304544,"teacher_disagreement_score":0.65433496,"about_ca_system_score_codex":0.00006778699,"about_ca_system_score_gemma":0.00025379684,"threshold_uncertainty_score":0.99989104},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017952554633990196,"score_gpt":0.27657176918863224,"score_spread":0.25861921455464204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769184765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020127764,0.00015062059,0.97343963,0.0037369218,0.00063662545,0.0017043967,0.0000059790354,0.00007334506,0.00012472221],"genre_scores_gemma":[0.95575595,0.0000055472806,0.042561747,0.00093767623,0.0006074255,0.00011640246,0.0000027240949,0.000009642476,0.000002875188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860966,0.00015064857,0.00023291784,0.00033201082,0.00042749592,0.00024725555],"domain_scores_gemma":[0.99795115,0.00011675138,0.0003512946,0.0013416777,0.00009189803,0.00014720256],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011126413,0.00016881253,0.00014330214,0.00011749899,0.0017171152,0.0023365542,0.0026888999,0.00008815099,0.0000067275264],"category_scores_gemma":[0.000058101134,0.00010984487,0.000086692155,0.00011506859,0.00011853382,0.0003939859,0.00068340113,0.0007964049,0.0000058829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039050722,0.0015960733,0.0032401844,0.00023939298,0.00021387948,0.00035022167,0.003039522,0.016457994,0.014636095,0.37122,0.027171548,0.5614446],"study_design_scores_gemma":[0.0009734719,0.00021929521,0.047852885,0.00025701188,0.000011333909,0.00012362856,0.000006720087,0.93000126,0.0008628369,0.015094882,0.00433303,0.00026361897],"about_ca_topic_score_codex":0.0000015971037,"about_ca_topic_score_gemma":9.405743e-7,"teacher_disagreement_score":0.9356282,"about_ca_system_score_codex":0.000019494366,"about_ca_system_score_gemma":0.00003843857,"threshold_uncertainty_score":0.9995825},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015094519679204782,"score_gpt":0.23862485031150107,"score_spread":0.2235303306322963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791622101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037682917,0.00074287737,0.94723374,0.008091054,0.005389328,0.00012783718,0.000008896471,0.00015433592,0.0005690275],"genre_scores_gemma":[0.6942097,0.000013325933,0.29345846,0.008181618,0.0033443086,0.000015804453,0.0000075246894,0.00002724808,0.00074201106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984183,0.00028096943,0.00022069873,0.00020540654,0.00061606686,0.0002585855],"domain_scores_gemma":[0.9990913,0.00011649655,0.00013427687,0.00050419034,0.000047387384,0.00010630744],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007208966,0.0001133591,0.000117381045,0.000079775615,0.0015471078,0.00030617297,0.0021435646,0.0000109275015,0.0001342767],"category_scores_gemma":[0.000002720436,0.00007136985,0.000095306365,0.00023130115,0.000031846954,0.00031759572,0.002579624,0.0005733503,0.00003101743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032708416,0.00029271218,0.00017712364,0.0000018819383,0.0000893742,0.00047422,0.0012791455,0.27620605,0.00057591015,0.026225854,0.31226698,0.38237807],"study_design_scores_gemma":[0.000654384,0.00018438502,0.001201483,0.000007651088,0.000006090609,0.006212024,0.000014899445,0.9321089,0.000046453893,0.011678877,0.0477169,0.00016796091],"about_ca_topic_score_codex":0.000007678615,"about_ca_topic_score_gemma":6.1418876e-7,"teacher_disagreement_score":0.6565268,"about_ca_system_score_codex":0.000048954324,"about_ca_system_score_gemma":0.00008719818,"threshold_uncertainty_score":0.99975276},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0660270851781186,"score_gpt":0.3351993592668811,"score_spread":0.2691722740887625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945730209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14101864,0.0002518744,0.8438198,0.006657109,0.00055476534,0.00055271515,0.000004441437,0.00007606459,0.007064612],"genre_scores_gemma":[0.99626696,0.000045830297,0.0011591333,0.00094138,0.0008047748,0.000004890944,6.52855e-7,0.000011364594,0.0007649855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849886,0.00031111392,0.00021776276,0.0001587666,0.00042864776,0.00038484426],"domain_scores_gemma":[0.9991164,0.000112009846,0.00021523715,0.00018408523,0.0002255075,0.00014672148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008646258,0.00012650965,0.00020463903,0.00005352911,0.00077630574,0.00079111924,0.00086052413,0.000066597604,0.00010640548],"category_scores_gemma":[0.000009937363,0.00007269344,0.00007869456,0.0001352707,0.0001494456,0.00071217684,0.000060844457,0.000396125,0.000070823735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008200886,0.00022868007,0.017331079,0.000011850521,0.00039172271,0.000053321994,0.0076775365,0.8683131,0.00014189427,0.04513099,0.002522455,0.057377283],"study_design_scores_gemma":[0.0035443595,0.000113038084,0.0073086964,0.000028942683,0.000036150974,0.00004107558,0.0002962696,0.984316,0.0000034000514,0.0017300805,0.002413197,0.00016878416],"about_ca_topic_score_codex":0.00029805963,"about_ca_topic_score_gemma":0.00023683326,"teacher_disagreement_score":0.85524833,"about_ca_system_score_codex":0.00006392678,"about_ca_system_score_gemma":0.0002931955,"threshold_uncertainty_score":0.7628781},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014653300505028798,"score_gpt":0.2441769203272032,"score_spread":0.2295236198221744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990561397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10273101,0.0003045951,0.89305055,0.0013299886,0.0018211019,0.000120509205,0.0000019368733,0.00007928726,0.00056099857],"genre_scores_gemma":[0.70557827,0.000025182626,0.29196125,0.0014085008,0.0009900529,0.0000014069966,0.0000016263176,0.000010267548,0.000023448943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998807,0.00013104058,0.00021107742,0.00023573163,0.00030973103,0.00030539164],"domain_scores_gemma":[0.9989099,0.00012486236,0.00013593673,0.00063135714,0.00008392276,0.000114038594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070511445,0.00013868161,0.00014458179,0.00010896798,0.00028239866,0.0006230705,0.0018622999,0.000061003797,0.000054236167],"category_scores_gemma":[0.000007071414,0.000087030254,0.00014093409,0.00035848957,0.000030447343,0.0007091353,0.00062768854,0.00079747336,0.00016079083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015047878,0.00038767606,0.004252293,0.000042014202,0.00038731773,0.00021534032,0.00882574,0.0024126272,0.007101443,0.80130136,0.018094568,0.15682912],"study_design_scores_gemma":[0.00404327,0.00028100904,0.019835385,0.00014942439,0.000019129904,0.0017265199,0.000045555033,0.83919007,0.00065829547,0.0858232,0.04757096,0.00065716007],"about_ca_topic_score_codex":0.000004339794,"about_ca_topic_score_gemma":9.1306504e-7,"teacher_disagreement_score":0.83677745,"about_ca_system_score_codex":0.000016438862,"about_ca_system_score_gemma":0.00004345897,"threshold_uncertainty_score":0.60082835},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011524473532002205,"score_gpt":0.20373860330877386,"score_spread":0.19221412977677166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033848960","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76595736,0.0002588059,0.21458218,0.017852213,0.00046426157,0.00006109348,5.851213e-8,0.000059565842,0.00076448964],"genre_scores_gemma":[0.9870607,0.000018504323,0.008604786,0.0038302974,0.00044599088,5.4155896e-7,3.6510134e-8,0.000005832915,0.000033268785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989872,0.000111076064,0.00022435885,0.00019870927,0.00022006125,0.00025858526],"domain_scores_gemma":[0.999501,0.000065172906,0.00008357458,0.00020787497,0.000024648241,0.00011771148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061833294,0.00011073782,0.00013391922,0.000050404265,0.00022206231,0.00031149844,0.0009047057,0.000024682877,0.000004047747],"category_scores_gemma":[0.0000075610023,0.0000718035,0.000042077034,0.00026378172,0.000031847183,0.000048389127,0.0007785948,0.00045332685,0.000017891485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053257412,0.00010819305,0.039524034,0.00007139557,0.00010565943,0.00042670264,0.035766732,0.115569554,0.00008426998,0.013916486,0.011331306,0.78304243],"study_design_scores_gemma":[0.00039880726,0.00017807183,0.05621583,0.000045639867,0.0000027343608,0.00030146967,0.000037851096,0.9358521,0.0000136743565,0.00031136544,0.006519908,0.00012253155],"about_ca_topic_score_codex":0.0000014744622,"about_ca_topic_score_gemma":2.3698647e-7,"teacher_disagreement_score":0.8202826,"about_ca_system_score_codex":0.000019231475,"about_ca_system_score_gemma":0.000018476601,"threshold_uncertainty_score":0.30037865},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018313415048206064,"score_gpt":0.2635336879577786,"score_spread":0.24522027290957255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037838531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052421797,0.0000378311,0.94632167,0.000961319,0.000047587426,0.00014020763,0.0000058323126,0.00003249253,0.000031278265],"genre_scores_gemma":[0.87235516,0.0000054869115,0.12613602,0.00028765472,0.0011797989,0.000006399903,0.0000074668355,0.0000136911,0.000008317032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993336,0.00007775707,0.0001880551,0.00014130597,0.00010424095,0.00015500077],"domain_scores_gemma":[0.9994441,0.00006035994,0.00014601613,0.0001237925,0.00011219637,0.00011349005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019649677,0.0001063394,0.00014079455,0.000027550685,0.0002691543,0.00024105108,0.00023410136,0.000012242855,0.000030049718],"category_scores_gemma":[0.0000022381503,0.000074538184,0.00006748282,0.00011885633,0.000030771294,0.00009618726,0.00009219311,0.00016144541,0.0000027513884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023199202,0.00007050253,0.0015879193,0.0000065498375,0.00015197939,0.0000033870683,0.0012039841,0.15203445,0.000123883,0.007973379,0.0037977784,0.833023],"study_design_scores_gemma":[0.00021691203,0.00009611354,0.0009392692,0.000009580153,0.00004687153,0.0000107889055,0.000029331979,0.99014366,0.00007590846,0.006612896,0.0017232901,0.000095400464],"about_ca_topic_score_codex":0.0000048616603,"about_ca_topic_score_gemma":1.8032986e-7,"teacher_disagreement_score":0.8381092,"about_ca_system_score_codex":0.000008796448,"about_ca_system_score_gemma":0.000019746538,"threshold_uncertainty_score":0.30395788},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06479046040541213,"score_gpt":0.2935641611250369,"score_spread":0.22877370071962477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039415289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07068345,0.00021554391,0.9139028,0.012098338,0.0024320884,0.00011239862,1.9664034e-7,0.0001434775,0.00041166623],"genre_scores_gemma":[0.89606726,0.0000018217394,0.09445397,0.0035777623,0.00587074,4.872948e-7,0.0000016701348,0.000018038196,0.000008240175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997668,0.0002967894,0.0007510743,0.00029797616,0.00053012,0.0004560153],"domain_scores_gemma":[0.9981998,0.00030870756,0.0005730001,0.00046518096,0.00023426794,0.00021904605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008814885,0.00023357225,0.00039838845,0.000119202145,0.0006089538,0.00036785268,0.0023018036,0.00006872507,0.0000011970325],"category_scores_gemma":[0.00003762573,0.00017649426,0.00019629633,0.0005686347,0.00011308223,0.00022722418,0.0006756149,0.00064728176,0.000018154777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000350147,0.00013230172,0.0015195769,0.000053809414,0.000065542445,0.000008515928,0.023437897,0.7721589,0.0008835127,0.0048844344,0.07989101,0.11692944],"study_design_scores_gemma":[0.00044475653,0.00017128863,0.00059090514,0.00006674623,0.0000147794835,0.000043548036,0.000046621633,0.9915278,0.0013789758,0.00082707294,0.0046918495,0.00019568935],"about_ca_topic_score_codex":0.0000054106054,"about_ca_topic_score_gemma":2.4071852e-7,"teacher_disagreement_score":0.82538384,"about_ca_system_score_codex":0.00005332898,"about_ca_system_score_gemma":0.00017790991,"threshold_uncertainty_score":0.7197227},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09376561811692588,"score_gpt":0.4239916224342266,"score_spread":0.33022600431730076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139621838","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011722236,0.000237408,0.98680735,0.0006971821,0.000169217,0.00006561305,0.000011383944,0.000020419035,0.00026921454],"genre_scores_gemma":[0.117548786,0.0000039092765,0.8797151,0.00015049221,0.0025004055,0.0000014983094,0.000040420047,0.000011414403,0.000027966718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990895,0.00023197467,0.00023174667,0.00018373344,0.00007183607,0.00019121177],"domain_scores_gemma":[0.9988851,0.00054616336,0.00015700448,0.0002625275,0.00010931763,0.00003988982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095927017,0.00009750607,0.00021241503,0.000022768489,0.0005789717,0.0003447737,0.00042098973,0.00001445862,0.000041335563],"category_scores_gemma":[0.0000080140335,0.00007458884,0.000089362424,0.00010669575,0.000026809927,0.0001538333,0.00064646447,0.00019180244,3.7773097e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004078816,0.000011016722,0.0003247375,0.0000021768517,0.000121843404,9.793656e-7,0.00031286172,0.00008404073,0.00019429131,0.0026507091,0.005456112,0.99083716],"study_design_scores_gemma":[0.001167795,0.000059858015,0.0036477621,0.00008399861,0.00028219892,0.00012929969,0.00069737306,0.8494678,0.0010017083,0.051245768,0.0918002,0.00041620075],"about_ca_topic_score_codex":0.0000010574769,"about_ca_topic_score_gemma":4.9140044e-7,"teacher_disagreement_score":0.99042094,"about_ca_system_score_codex":0.000009211378,"about_ca_system_score_gemma":0.00004064233,"threshold_uncertainty_score":0.44530407},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007610875030960365,"score_gpt":0.21799504916146345,"score_spread":0.2103841741305031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225694316","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016942383,0.00014029795,0.9941332,0.0018270143,0.0017965962,0.00017936036,0.000002395396,0.00016197181,0.00006494456],"genre_scores_gemma":[0.10787161,0.000030428824,0.8869874,0.0032070156,0.0018109162,0.000029049968,0.0000017497612,0.000017884335,0.000043980788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983291,0.0005077486,0.00022049776,0.0002829226,0.00040080305,0.00025891204],"domain_scores_gemma":[0.99909544,0.0001812975,0.0002113745,0.00035598088,0.00007066058,0.00008521747],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00069689413,0.00015208262,0.00013527516,0.00011635266,0.001364275,0.00024947562,0.00077904976,0.00002671921,0.000018817895],"category_scores_gemma":[0.0000068932686,0.00012222052,0.000065592445,0.000305825,0.00003927518,0.00021998309,0.00048074365,0.0006460891,0.0000033337817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018123783,0.000033019915,0.000032925356,0.00000143475,0.000016511214,0.000036021163,0.00047004086,0.5653251,0.000115661576,0.0011535455,0.004836269,0.42796135],"study_design_scores_gemma":[0.00041302684,0.00039871142,0.0004380638,0.000008795266,0.0000068756144,0.0004720248,0.00001246202,0.9771595,0.00024909407,0.012984664,0.0077049197,0.00015188141],"about_ca_topic_score_codex":0.0000032287232,"about_ca_topic_score_gemma":7.6705606e-7,"teacher_disagreement_score":0.42780948,"about_ca_system_score_codex":0.00015978525,"about_ca_system_score_gemma":0.000112916656,"threshold_uncertainty_score":0.9999358},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.14874726924167472,"score_gpt":0.2529726603947472,"score_spread":0.10422539115307247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283788994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1302373,0.00023411211,0.867401,0.0006025207,0.0007584605,0.00009969236,0.0000025050792,0.000054354652,0.0006100621],"genre_scores_gemma":[0.9742854,0.000013935779,0.025005804,0.00029295427,0.00030629092,0.0000025903769,0.0000028592717,0.0000115635285,0.00007858485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979417,0.00042586427,0.0003688391,0.00032959724,0.0005844723,0.00034954518],"domain_scores_gemma":[0.9984652,0.000069660484,0.00021577683,0.0011431953,0.00003479067,0.00007140351],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002378154,0.00013977572,0.00018926017,0.00018033988,0.0015932923,0.00023875877,0.004480842,0.000016744712,0.000006775642],"category_scores_gemma":[0.000003850086,0.00010118547,0.000085544336,0.0004340674,0.000034709894,0.00007305025,0.005771833,0.00074089324,0.0000016941322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010968783,0.00010666654,0.000069606314,0.00001578941,0.00006212514,0.0000137237685,0.0011031586,0.98673683,0.000004852159,0.001801245,0.0014534619,0.008621593],"study_design_scores_gemma":[0.000394808,0.00014449569,0.000005360385,0.000020347657,0.000010642098,0.0015327738,0.00012576116,0.9957385,0.000004654626,0.0006645891,0.001236684,0.00012135436],"about_ca_topic_score_codex":0.000004457028,"about_ca_topic_score_gemma":1.4115103e-7,"teacher_disagreement_score":0.84404814,"about_ca_system_score_codex":0.0001248366,"about_ca_system_score_gemma":0.00005179195,"threshold_uncertainty_score":0.9997065},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06865938500797139,"score_gpt":0.3130549192846503,"score_spread":0.2443955342766789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283836478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8623956,0.000041001487,0.13613723,0.0004968383,0.0006023572,0.00008622044,3.476986e-7,0.000024029185,0.00021641809],"genre_scores_gemma":[0.9883198,0.0000012381032,0.007276427,0.0029758506,0.0014026337,0.0000015693487,0.0000028850634,0.000009052138,0.000010558697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924964,0.0000997234,0.0002492317,0.000055831948,0.00019984115,0.00014574989],"domain_scores_gemma":[0.9996709,0.000051313044,0.00015019675,0.00005576855,0.000051426283,0.000020399657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078138814,0.000056789962,0.00009739652,0.00011408205,0.0007841193,0.000059493093,0.00006603426,0.000022473188,0.00003719844],"category_scores_gemma":[0.000018066688,0.000047115245,0.000053623346,0.0002861012,0.000016169648,0.00012831074,0.000059589867,0.000566977,0.0000026575115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053594174,0.00023850234,0.018508721,0.00006715287,0.00015651161,0.00017078129,0.01315396,0.62261623,0.04165659,0.00041047874,0.010824618,0.29166052],"study_design_scores_gemma":[0.0010243892,0.000055439323,0.004133363,0.00005089979,0.000022893026,0.0027948087,0.0003198509,0.98786217,0.00050601375,0.0003879118,0.0027738346,0.00006842053],"about_ca_topic_score_codex":0.000012792918,"about_ca_topic_score_gemma":0.0000011201996,"teacher_disagreement_score":0.36524594,"about_ca_system_score_codex":0.00021925257,"about_ca_system_score_gemma":0.00005246158,"threshold_uncertainty_score":0.6030891},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016713835246616227,"score_gpt":0.22032765875703053,"score_spread":0.2036138235104143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287992578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41795015,0.0017348841,0.5672515,0.011198032,0.0013209664,0.000055107095,5.3912896e-7,0.00009230523,0.00039649152],"genre_scores_gemma":[0.84282917,0.0011350422,0.1471548,0.004473307,0.0033175545,0.0000048136344,0.000002352305,0.000024098408,0.0010588974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990415,0.00014223794,0.00020371212,0.00019994903,0.00018873575,0.00022387537],"domain_scores_gemma":[0.999312,0.00011182351,0.00006662239,0.0003050076,0.00011163365,0.00009294073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040323517,0.00009642716,0.00011959704,0.00004070671,0.00052560325,0.0008693152,0.0004484876,0.000037293194,0.000027385806],"category_scores_gemma":[0.000014456664,0.000066588196,0.00004885689,0.00021013358,0.000028710738,0.0004648772,0.00025839588,0.0002857888,0.000009411261],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006135922,0.00020564153,0.0063695153,0.00008104953,0.00032665743,0.0010737387,0.009446229,0.028106274,0.0042677294,0.0377821,0.054131493,0.8581482],"study_design_scores_gemma":[0.002611634,0.00026090234,0.13346848,0.00038557645,0.000049922215,0.020056015,0.00015242437,0.76741356,0.008903903,0.028005978,0.037820198,0.000871393],"about_ca_topic_score_codex":0.0000058274127,"about_ca_topic_score_gemma":0.000010398428,"teacher_disagreement_score":0.8572768,"about_ca_system_score_codex":0.000019270476,"about_ca_system_score_gemma":0.00005581525,"threshold_uncertainty_score":0.83828264},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02261532536164305,"score_gpt":0.25521682204278007,"score_spread":0.23260149668113703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307812414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1647929,0.00030863873,0.81568795,0.016890805,0.0018202885,0.00032339615,0.0000539299,0.00007722184,0.00004489506],"genre_scores_gemma":[0.9296341,0.00001863145,0.06647787,0.0029045066,0.00086827815,0.00006684309,0.000008652761,0.000014766587,0.0000063467746],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817026,0.00028109673,0.00038944086,0.00033218195,0.00038974962,0.00043725834],"domain_scores_gemma":[0.99746835,0.0012784594,0.00021699036,0.0007882901,0.000093641516,0.00015426111],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011308059,0.00017054685,0.00019315723,0.00009609921,0.003296229,0.0013102414,0.0033684585,0.000022951133,0.000026478527],"category_scores_gemma":[0.000021798924,0.00010325537,0.00019312029,0.00042848586,0.00005888673,0.0003433021,0.0013789366,0.0004505108,0.000009616725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025903355,0.00015080061,0.0035064921,0.000010760814,0.00045958185,0.000038036353,0.019571654,0.0017959065,0.0047208504,0.32327434,0.09495129,0.55126125],"study_design_scores_gemma":[0.0014704447,0.00047930403,0.015409588,0.000034465458,0.00006114043,0.00044422995,0.0010664928,0.15448795,0.0010307191,0.6136895,0.21119429,0.0006318796],"about_ca_topic_score_codex":0.000036682857,"about_ca_topic_score_gemma":0.000012928277,"teacher_disagreement_score":0.7648412,"about_ca_system_score_codex":0.000040324165,"about_ca_system_score_gemma":0.000053607153,"threshold_uncertainty_score":0.9997265},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018030229045466306,"score_gpt":0.2547564318641966,"score_spread":0.2367262028187303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366998199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17209387,0.00021134874,0.82006246,0.0036866167,0.0028974644,0.00016045675,0.000008769203,0.0003723598,0.0005066581],"genre_scores_gemma":[0.9863265,0.000017865237,0.011749918,0.0004917335,0.0012565545,0.000004973364,0.0000065069316,0.000017086832,0.00012881946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797535,0.00027137576,0.00043868707,0.0003246615,0.00044160886,0.0005482934],"domain_scores_gemma":[0.9985105,0.00012488611,0.00021794718,0.0007441471,0.00018966178,0.0002129004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012334737,0.00019573803,0.00024664434,0.000119777935,0.0006569856,0.0007182159,0.0017251438,0.000053539356,0.000019003402],"category_scores_gemma":[0.000015336505,0.00012852684,0.00011213214,0.00073778495,0.000085731335,0.00014023352,0.0003464862,0.00037646914,0.00038208297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046798148,0.000501057,0.00051490136,0.000046398545,0.00024943045,0.0015725128,0.005634864,0.37641367,0.00087591883,0.05833282,0.14078766,0.41502398],"study_design_scores_gemma":[0.0007151435,0.00016702,0.0058113164,0.000045905836,0.000006290901,0.0017435038,0.000044063854,0.96972966,0.000058255428,0.00052042585,0.0209432,0.0002151891],"about_ca_topic_score_codex":0.00001302652,"about_ca_topic_score_gemma":0.0000029861699,"teacher_disagreement_score":0.8142327,"about_ca_system_score_codex":0.000037274756,"about_ca_system_score_gemma":0.00014632453,"threshold_uncertainty_score":0.69257724},"labels":[],"label_agreement":null},{"id":"W4387602365","doi":"10.1093/comjnl/bxad077","title":"Exact Short Products From Truncated Multipliers","year":2023,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiplier (economics); Mathematics; Irrational number; Integer (computer science); Arithmetic; Multiple; Discrete mathematics; Product (mathematics); Combinatorics; Algorithm; Computer science","score_opus":0.021860114818867023,"score_gpt":0.23777292412836773,"score_spread":0.21591280930950071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387602365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4190892,0.00035035083,0.56492555,0.010617921,0.004048334,0.00020629767,0.0000030804335,0.0005305763,0.00022869087],"genre_scores_gemma":[0.95015436,0.00014837038,0.04740069,0.0006362972,0.0015460704,0.000004722507,0.0000054394036,0.00001802676,0.00008601072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849683,0.00017663419,0.00025719206,0.0002994548,0.00038396957,0.00038589578],"domain_scores_gemma":[0.998875,0.00020180448,0.00007238393,0.0006165866,0.00010433638,0.00012985524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068201666,0.00015351323,0.00015976299,0.00020823344,0.00050819915,0.00046700175,0.0016397883,0.000045386758,0.000010927034],"category_scores_gemma":[0.000019706527,0.000093250346,0.00012758518,0.0012162223,0.00008269717,0.00030057912,0.00040395025,0.0004430874,0.00016919085],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039774404,0.00021849821,0.0046471963,0.000015975837,0.0005360391,0.0007965928,0.009784797,0.0084903,0.0057455623,0.0054493737,0.121061414,0.84321445],"study_design_scores_gemma":[0.0013781589,0.00024513746,0.31710842,0.00010750308,0.000058525784,0.00097304344,0.00012736153,0.6066496,0.0044127847,0.043921355,0.024269035,0.0007490603],"about_ca_topic_score_codex":0.0000129085065,"about_ca_topic_score_gemma":0.0000018274774,"teacher_disagreement_score":0.8424654,"about_ca_system_score_codex":0.000020384543,"about_ca_system_score_gemma":0.00006797652,"threshold_uncertainty_score":0.45033085},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03355264113695809,"score_gpt":0.3138387519385658,"score_spread":0.2802861108016077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399015500","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50073105,0.0012275841,0.48576877,0.00927021,0.0024532247,0.00009417157,6.9875773e-7,0.00010021847,0.0003540798],"genre_scores_gemma":[0.92793435,0.000039893246,0.069030024,0.0010866914,0.0015042472,0.000001734952,4.0106934e-7,0.000028303128,0.00037436298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990254,0.00009352326,0.00025294663,0.00014812492,0.00020974406,0.00027028433],"domain_scores_gemma":[0.99920154,0.00037830486,0.000032036114,0.0002079568,0.00005410414,0.00012605565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007650971,0.00012061307,0.00017052739,0.00030875788,0.0002736076,0.00025182433,0.0004019757,0.000047640657,0.00016308346],"category_scores_gemma":[0.00006722314,0.00007477693,0.00015151918,0.000519174,0.00005211074,0.00007539617,0.00015066123,0.00041023552,0.00017387999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020235411,0.000101575846,0.00033456887,0.00012473426,0.00050184637,0.00052604347,0.019774223,0.00027367446,0.0007395276,0.54740816,0.21088427,0.21931115],"study_design_scores_gemma":[0.00015227456,0.000131595,0.00013465025,0.000099837416,0.000055353365,0.0016124375,0.00028987095,0.0032708775,0.00016272903,0.9691728,0.024768688,0.00014889278],"about_ca_topic_score_codex":0.0000053116746,"about_ca_topic_score_gemma":0.0000028380339,"teacher_disagreement_score":0.4272033,"about_ca_system_score_codex":0.000040979397,"about_ca_system_score_gemma":0.00004717532,"threshold_uncertainty_score":0.30493146},"labels":[],"label_agreement":null},{"id":"W4401976660","doi":"10.1093/comjnl/bxae055","title":"Approximation algorithms for maximum weighted internal spanning trees in regular graphs and subdivisions of graphs","year":2024,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Spanning tree; Subdivision; Computer science; Algorithm; Combinatorics; Mathematics; Geography","score_opus":0.02779165139718254,"score_gpt":0.3050763644660477,"score_spread":0.27728471306886515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401976660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075689375,0.0014123559,0.9211341,0.0009691827,0.00049160654,0.00021703956,0.0000039558045,0.000053360283,0.000029007415],"genre_scores_gemma":[0.67976063,0.00019640636,0.3197763,0.000063199004,0.00012423542,0.000016433278,0.0000022923389,0.000020908348,0.000039573384],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983851,0.00025548515,0.00040337892,0.0002834039,0.0003493872,0.00032325956],"domain_scores_gemma":[0.99879164,0.0005679427,0.000111106936,0.0003065644,0.00012779469,0.00009498261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002051276,0.00014724335,0.00021005,0.0006894734,0.0001967808,0.00037675616,0.0009777059,0.00004540732,0.0000031828067],"category_scores_gemma":[0.000023435658,0.00009869026,0.00014088904,0.00078218774,0.0001644976,0.00065082556,0.0003426243,0.00045074083,0.0000011540244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043789918,0.00005531392,0.00041440089,0.000049985232,0.00008909587,0.00005824429,0.002560453,0.00067200285,0.0012743364,0.38678128,0.00044280852,0.6075583],"study_design_scores_gemma":[0.00027151976,0.00011148117,0.0012678476,0.00016721242,0.00000497706,0.0002441821,0.000029357714,0.47626403,0.00044255017,0.5209844,0.00014240122,0.00007002964],"about_ca_topic_score_codex":0.0000045893657,"about_ca_topic_score_gemma":0.000003224628,"teacher_disagreement_score":0.6074883,"about_ca_system_score_codex":0.000029081453,"about_ca_system_score_gemma":0.000046446366,"threshold_uncertainty_score":0.40244722},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005758767124131667,"score_gpt":0.24692753782367613,"score_spread":0.24116877069954445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402575256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06978108,0.0033056296,0.9193738,0.0059392606,0.0011616962,0.00019718154,0.0000013315411,0.0002133446,0.000026657828],"genre_scores_gemma":[0.89425385,0.000200506,0.10461276,0.0004293911,0.00031878264,0.000008431113,8.261526e-7,0.000021062235,0.00015436842],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987864,0.0000986806,0.00019464092,0.00035055305,0.00026403504,0.0003056852],"domain_scores_gemma":[0.9990883,0.0002243792,0.00007832765,0.00043595265,0.00004977173,0.00012326294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029418126,0.0001772857,0.00013630773,0.00011381479,0.0005482323,0.0005409448,0.0008706545,0.0000503876,0.0000046268924],"category_scores_gemma":[0.000004168078,0.00011078281,0.00008576463,0.0004905403,0.00006754671,0.00014624363,0.00051332643,0.0006673794,0.000043055334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063546377,0.000023084445,0.00000448878,0.000015690764,0.000028129192,0.00008019543,0.0006095171,0.021770803,0.004638363,0.0017349343,0.00072559895,0.97036284],"study_design_scores_gemma":[0.00012830604,0.00006442,0.001580109,0.000065149165,0.000011752861,0.0028295112,0.0000038677513,0.9868018,0.0000551916,0.00587528,0.0024455788,0.00013903358],"about_ca_topic_score_codex":5.2687284e-7,"about_ca_topic_score_gemma":0.0000034864095,"teacher_disagreement_score":0.9702238,"about_ca_system_score_codex":0.00010548675,"about_ca_system_score_gemma":0.000046916663,"threshold_uncertainty_score":0.52163434},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.06729306244984125,"score_gpt":0.276650143117134,"score_spread":0.20935708066729275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416109760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11915086,0.0006195778,0.87172925,0.007574519,0.00051908864,0.0000661232,1.03202225e-7,0.00015051296,0.00018997301],"genre_scores_gemma":[0.9030192,0.00030911787,0.09552859,0.00081836473,0.00013529696,0.0000030846816,6.688492e-7,0.000005068252,0.00018063255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921834,0.000112920665,0.00021494146,0.0001589413,0.00012542437,0.00016944062],"domain_scores_gemma":[0.99934715,0.00014953458,0.00015455218,0.00019967603,0.00011533937,0.00003377111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040222952,0.000093090915,0.0001080092,0.00014757819,0.00052097684,0.00062482466,0.00056944793,0.000042700212,0.000007698448],"category_scores_gemma":[0.000040671217,0.00006330805,0.000040867875,0.0002381881,0.0000628835,0.00045234087,0.00032778998,0.0003972688,0.000011179618],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000519518,0.000020762087,0.0011057982,0.000004868774,0.000030935564,0.000006187068,0.00034747864,0.00021060686,0.0012919143,0.009431734,0.00041659933,0.9871279],"study_design_scores_gemma":[0.0010448497,0.0001680421,0.025467396,0.0002332875,0.000040875264,0.00073135004,0.0005808101,0.8363416,0.0032305957,0.12333284,0.00849969,0.00032866368],"about_ca_topic_score_codex":0.00000338956,"about_ca_topic_score_gemma":5.650838e-7,"teacher_disagreement_score":0.98679924,"about_ca_system_score_codex":0.000042254447,"about_ca_system_score_gemma":0.000030303954,"threshold_uncertainty_score":0.60251987},"labels":[],"label_agreement":null},{"id":"W4417098682","doi":"10.1093/comjnl/bxaf138","title":"Time series forecasting with variable-centric spectral transformer","year":2025,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministry of Transportation of Ontario","funders":"National Natural Science Foundation of China","keywords":"Transformer; Time series; Quadratic equation; Computational complexity theory; Time domain; Interpolation (computer graphics); Frequency domain; Time complexity","score_opus":0.009193092665955123,"score_gpt":0.19013140909843998,"score_spread":0.18093831643248487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417098682","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065058437,0.00017159867,0.98281825,0.0029748091,0.00037784656,0.00010023512,7.7072866e-7,0.00007502928,0.006975598],"genre_scores_gemma":[0.2256219,0.000057084664,0.76298755,0.0021835659,0.0017723655,0.000009289163,0.000003341145,0.000039860945,0.007325077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858695,0.00009548036,0.0003463091,0.00023309574,0.00027475276,0.0004633919],"domain_scores_gemma":[0.9991826,0.00010759773,0.00015448066,0.00032649052,0.00014079786,0.00008803129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064223754,0.00018788748,0.0002470589,0.00016156408,0.0008008779,0.0007731703,0.0011096392,0.000036627633,0.00008822041],"category_scores_gemma":[0.000007993832,0.00010704901,0.00012392462,0.0010875989,0.000088350396,0.0007633783,0.00012933431,0.00039759025,0.00001971637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030462246,0.0002815002,0.0016125317,0.00008374049,0.0017165993,0.00042731158,0.005701627,0.08314016,0.0005509955,0.22429302,0.023069534,0.65881836],"study_design_scores_gemma":[0.0008042381,0.00033715833,0.0007635345,0.00017289394,0.00010551466,0.0029025523,0.000053595024,0.9686105,0.00026471558,0.010070171,0.015603638,0.00031149085],"about_ca_topic_score_codex":0.000004520074,"about_ca_topic_score_gemma":0.0000027846202,"teacher_disagreement_score":0.88547033,"about_ca_system_score_codex":0.00005572032,"about_ca_system_score_gemma":0.00015742914,"threshold_uncertainty_score":0.74556994},"labels":[],"label_agreement":null},{"id":"W7116675937","doi":"10.1093/comjnl/bxaf142","title":"A bio-inspired and AI-driven approach to DDoS detection","year":2025,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Denial-of-service attack; Feature selection; Protocol (science); The Internet; IPv6; Feature (linguistics); Reinforcement learning; Internet Protocol","score_opus":0.010519735737034564,"score_gpt":0.226999529614382,"score_spread":0.21647979387734742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116675937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03610666,0.0001217504,0.95763147,0.003821607,0.0014356442,0.00014094972,1.6190849e-7,0.00008234503,0.0006594322],"genre_scores_gemma":[0.96105194,0.00004279734,0.033450406,0.004739916,0.0006135891,0.000007314657,1.4487911e-7,0.000005046745,0.00008885224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905044,0.00016042512,0.00020073782,0.00021856015,0.00016808331,0.00020176334],"domain_scores_gemma":[0.9994257,0.000046975965,0.0000644755,0.00028270105,0.000084881736,0.00009523696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042492014,0.00010747913,0.00012026574,0.0001939541,0.0006030665,0.0005489008,0.00063080364,0.000051308307,0.0000021307499],"category_scores_gemma":[0.0000084414905,0.00007474807,0.00005725367,0.00057035795,0.000034327502,0.0002461201,0.0004199375,0.00037684134,0.000012821196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030362507,0.00005582045,0.00006633218,0.000010538835,0.0000508733,0.0000051934776,0.0014106159,0.0047663595,0.0008253041,0.017323567,0.0075184223,0.96793664],"study_design_scores_gemma":[0.0003517368,0.00016860475,0.002727687,0.00004054567,0.000010510965,0.00048624104,0.000011821164,0.9673356,0.0009545682,0.010447037,0.017339429,0.00012625204],"about_ca_topic_score_codex":0.0000065361523,"about_ca_topic_score_gemma":0.0000045128922,"teacher_disagreement_score":0.96781033,"about_ca_system_score_codex":0.000043972894,"about_ca_system_score_gemma":0.000033099324,"threshold_uncertainty_score":0.52930635},"labels":[],"label_agreement":null}]}