{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22114474,0.004846296,0.67618144,0.023261683,0.0011722657,0.0010414263,0.0042638374,0.008385731,0.059702624],"genre_scores_gemma":[0.57298756,0.0028532508,0.38962564,0.005110063,0.00089067506,0.00080535415,0.006606899,0.0033207226,0.017799878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914136,0.0018914276,0.00040127896,0.0024265437,0.001991628,0.0018755597],"domain_scores_gemma":[0.96529704,0.0258971,0.0010444124,0.005109107,0.0014294457,0.0012228878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050940514,0.0025781377,0.003391042,0.0019787955,0.0033825452,0.007986091,0.00553412,0.0036769644,0.01524059],"category_scores_gemma":[0.019775141,0.0014449587,0.0056151967,0.0025038312,0.004844065,0.0181619,0.0087774955,0.009422977,0.003024542],"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.0033431903,0.0014362643,0.0052945027,0.002897772,0.00035605475,0.0006999359,0.0022997998,0.30077392,0.015104342,0.3341795,0.0729192,0.2606955],"study_design_scores_gemma":[0.00032569634,0.00017244647,0.000865593,0.0002288426,0.0001739464,0.00024386132,0.00040706046,0.37928644,0.0044086995,0.60222214,0.011579743,0.00008543284],"about_ca_topic_score_codex":0.013465933,"about_ca_topic_score_gemma":0.016721856,"teacher_disagreement_score":0.01524059,"about_ca_system_score_codex":0.008475292,"about_ca_system_score_gemma":0.008529507,"threshold_uncertainty_score":0.0614928},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10840224,0.001795408,0.8445601,0.0007734553,0.0002484644,0.000047473295,0.00023363254,0.00030108917,0.043638155],"genre_scores_gemma":[0.86734205,0.0023678918,0.1086509,0.000297281,0.0012460616,0.00021894091,0.0004108072,0.00033090418,0.019135248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977714,0.00007534538,0.0000095458845,0.00004311575,0.00005661338,0.000038314673],"domain_scores_gemma":[0.9990482,0.00051896524,0.00009670674,0.00010293947,0.00016354606,0.000069678965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005368098,0.0006493095,0.0005451257,0.0025361704,0.00066005765,0.0010562022,0.0010127337,0.0009799242,0.0059148837],"category_scores_gemma":[0.0027584159,0.00026304813,0.00068705616,0.0011951643,0.0012528027,0.0025783866,0.00071607163,0.0013279383,0.0009437968],"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.00000592942,0.00001053294,0.00019283635,0.000028392491,0.0000043821656,0.000057783527,0.00007235841,0.00836105,0.0013111501,0.9788842,0.0008887068,0.010182745],"study_design_scores_gemma":[0.0000056204008,0.00002644061,0.00033781343,0.000015480466,0.0000074544246,0.00022324601,0.000034128698,0.1038619,0.0008370261,0.89029247,0.0043433,0.000015236771],"about_ca_topic_score_codex":0.00034653165,"about_ca_topic_score_gemma":0.0002784923,"teacher_disagreement_score":0.0059148837,"about_ca_system_score_codex":0.00062732794,"about_ca_system_score_gemma":0.00023800081,"threshold_uncertainty_score":0.019787312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1083165,0.00082678127,0.857265,0.00033972802,0.000090040005,0.00046984522,0.0055956934,0.023216752,0.003879659],"genre_scores_gemma":[0.5338277,0.00042331114,0.44969213,0.00022696947,0.000058200036,0.00045044994,0.011745289,0.0007039308,0.0028718868],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99948883,0.000080137186,0.00003595281,0.00013888758,0.00020635717,0.000049796574],"domain_scores_gemma":[0.9980703,0.0007761852,0.00027394615,0.00037951098,0.00044625922,0.000053905806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004075236,0.00075627316,0.00034488263,0.0035434698,0.0004932203,0.0004961991,0.0006287106,0.0005321849,0.0018224629],"category_scores_gemma":[0.0028471397,0.00021534697,0.0006168522,0.0017794103,0.0004943242,0.0012550929,0.0004563509,0.0005327234,0.00043235195],"study_design_candidate":"bench_or_experimental","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.0007004026,0.0003499571,0.025025336,0.0008648253,0.00010922827,0.0006231019,0.00034145886,0.11725941,0.06432373,0.02764311,0.018177,0.74458253],"study_design_scores_gemma":[0.000039548668,0.00024186143,0.0086047845,0.0001233198,0.000102946105,0.0005203368,0.00010720914,0.8574967,0.05639366,0.049931165,0.026380127,0.00005829811],"about_ca_topic_score_codex":0.008799989,"about_ca_topic_score_gemma":0.010430522,"teacher_disagreement_score":0.008799989,"about_ca_system_score_codex":0.0009220264,"about_ca_system_score_gemma":0.0014851006,"threshold_uncertainty_score":0.01749754},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021145105,0.049407713,0.50607955,0.031420793,0.00586209,0.00036575293,0.001592809,0.025792582,0.35833353],"genre_scores_gemma":[0.38210794,0.059118595,0.3167938,0.013438927,0.0063072727,0.000463012,0.005155078,0.003132557,0.21348283],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936146,0.00013855293,0.000054120952,0.00006353805,0.00030231965,0.000080021055],"domain_scores_gemma":[0.99941015,0.000101950944,0.000035469362,0.00014337446,0.00014655,0.00016245789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079554145,0.00041934417,0.000363011,0.00074923795,0.0008682134,0.0037964555,0.00083258195,0.0017985933,0.00947255],"category_scores_gemma":[0.0019589216,0.00027560923,0.00038812976,0.001108979,0.0006082162,0.0070148474,0.0027729664,0.0020166775,0.0047902334],"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.00013023659,0.00012783008,0.0009049683,0.00059418846,0.000043782384,0.0009636701,0.0009994843,0.0020604967,0.014443369,0.30164498,0.19563024,0.48245677],"study_design_scores_gemma":[0.000011698999,0.000027031603,0.00075374596,0.00020685578,0.000022662476,0.00063297444,0.00032674527,0.009708533,0.0019360521,0.09057417,0.89576644,0.000033134158],"about_ca_topic_score_codex":0.0023208738,"about_ca_topic_score_gemma":0.0032602483,"teacher_disagreement_score":0.00947255,"about_ca_system_score_codex":0.00054906745,"about_ca_system_score_gemma":0.00087326573,"threshold_uncertainty_score":0.03168881},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017105028,0.000959467,0.9751061,0.00040101496,0.00023208588,0.00019302679,0.00026626268,0.002666356,0.0030705377],"genre_scores_gemma":[0.13939537,0.0016624494,0.8490546,0.00035947748,0.00022044142,0.00030932823,0.0012460763,0.00031004948,0.0074423263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913955,0.00006951039,0.0000886579,0.00011785039,0.0005369884,0.0000475521],"domain_scores_gemma":[0.9992292,0.00011755955,0.00007181503,0.00022793577,0.00032993668,0.000023477269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002958691,0.0006652685,0.0004706373,0.00201911,0.0005138299,0.0009962427,0.0009880945,0.0005861678,0.0020129306],"category_scores_gemma":[0.0018545948,0.00022778187,0.0004304625,0.002691009,0.000546383,0.0020364956,0.0011083691,0.00078261463,0.0011956117],"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.00020529616,0.00008102994,0.00080687745,0.00030731907,0.00003399346,0.00038983137,0.00026951416,0.009431145,0.099701926,0.01782436,0.006971594,0.863977],"study_design_scores_gemma":[0.000116691044,0.00039406543,0.0022694306,0.000117732285,0.00010072184,0.0034888082,0.0003221897,0.4683184,0.39000356,0.024691572,0.1100792,0.00009766179],"about_ca_topic_score_codex":0.0009623619,"about_ca_topic_score_gemma":0.00094242196,"teacher_disagreement_score":0.00201911,"about_ca_system_score_codex":0.00040957294,"about_ca_system_score_gemma":0.0006549359,"threshold_uncertainty_score":0.006733954},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010976206,0.00047464212,0.9859358,0.00035523958,0.000052571344,0.00007208548,0.000069339396,0.00034933424,0.0017148408],"genre_scores_gemma":[0.37290832,0.0009922893,0.61649185,0.00038341153,0.00029839508,0.0005247346,0.0003806272,0.0002655533,0.00775479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985122,0.00052174286,0.000079705096,0.00033858937,0.00033920654,0.0002084506],"domain_scores_gemma":[0.9959055,0.00213205,0.0005589376,0.0006160699,0.00048168367,0.00030570236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017242949,0.0007572987,0.0012624634,0.0014360449,0.0015751873,0.0029719044,0.0042926203,0.0025787852,0.0042362334],"category_scores_gemma":[0.0070317173,0.0007629734,0.0011944734,0.0017204186,0.0024181125,0.0055724136,0.0031501795,0.0019027357,0.0009521935],"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.0001175571,0.00012219086,0.0012537079,0.00025148253,0.00005896728,0.00019328359,0.00040623316,0.7031073,0.003975146,0.23474409,0.0028413625,0.052928653],"study_design_scores_gemma":[0.000018399936,0.00008838189,0.00013439907,0.000018852275,0.000015796917,0.00007559696,0.000070271984,0.901274,0.0010220194,0.09309327,0.004163233,0.00002571932],"about_ca_topic_score_codex":0.003742694,"about_ca_topic_score_gemma":0.0036006833,"teacher_disagreement_score":0.0042926203,"about_ca_system_score_codex":0.0019806072,"about_ca_system_score_gemma":0.0016109837,"threshold_uncertainty_score":0.014370322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015463699,0.00019328526,0.95928943,0.00056947174,0.00022081575,0.0010503983,0.00048822816,0.012604666,0.0101200575],"genre_scores_gemma":[0.42069268,0.00046292922,0.55187297,0.00055781397,0.00021024774,0.0013940032,0.0016088284,0.0008458674,0.022354674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968951,0.0009197136,0.00038614185,0.00036641446,0.0010728408,0.00035980385],"domain_scores_gemma":[0.9979235,0.00061475724,0.00023219742,0.0006168127,0.00044269743,0.00017002807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042681815,0.0007929598,0.0008442332,0.0011085845,0.0018985838,0.002832283,0.0023965791,0.0018915208,0.010540727],"category_scores_gemma":[0.0070906454,0.0005200105,0.0008098253,0.00087117054,0.0019034531,0.005209825,0.0034852207,0.0022667407,0.0031587954],"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.0015534232,0.0006543403,0.0022384648,0.00062516,0.00013947237,0.0017091893,0.0011932553,0.060968414,0.022877878,0.64916193,0.04326191,0.21561645],"study_design_scores_gemma":[0.00064422464,0.0005023621,0.0011310765,0.0002215399,0.00012725922,0.0014154093,0.00016702147,0.5908303,0.027667603,0.21168083,0.16536039,0.00025196015],"about_ca_topic_score_codex":0.0023783161,"about_ca_topic_score_gemma":0.0014284409,"teacher_disagreement_score":0.010540727,"about_ca_system_score_codex":0.0013478564,"about_ca_system_score_gemma":0.003136022,"threshold_uncertainty_score":0.035262227},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23898005,0.0005703783,0.7403653,0.00096387387,0.00006469736,0.0003844361,0.00024908132,0.00071047846,0.017711716],"genre_scores_gemma":[0.9708189,0.00020278861,0.026523052,0.000030037696,0.000021161104,0.00014215709,0.00008193213,0.000035312547,0.0021447227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990615,0.00030810374,0.00004526424,0.00013675253,0.00035534735,0.00009295781],"domain_scores_gemma":[0.9990119,0.00046146475,0.00011110927,0.00006062676,0.00029749642,0.000057377496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009891504,0.00057747384,0.000779463,0.00052120985,0.00057918014,0.0014497918,0.0014290287,0.0010989431,0.001543154],"category_scores_gemma":[0.0030507557,0.0002826338,0.0003921395,0.00046858372,0.00070175435,0.0018679356,0.0008286451,0.0006213203,0.0002447433],"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.0000517194,0.00003609446,0.00048233787,0.000034491208,0.000010095142,0.00007872102,0.000034365556,0.98110723,0.003276874,0.010725056,0.0001964488,0.003966555],"study_design_scores_gemma":[0.0000032852727,0.0000125521055,0.00005197288,0.0000010958832,0.0000024277967,0.000005059968,0.0000058211995,0.9989416,0.0003079404,0.0005810847,0.00008495857,0.0000021585365],"about_ca_topic_score_codex":0.011514161,"about_ca_topic_score_gemma":0.0038378504,"teacher_disagreement_score":0.011514161,"about_ca_system_score_codex":0.0022151573,"about_ca_system_score_gemma":0.0015536678,"threshold_uncertainty_score":0.022894263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00611356,0.12679774,0.5916951,0.0074243452,0.008642332,0.0002919613,0.00078265497,0.0011173785,0.25713497],"genre_scores_gemma":[0.23274007,0.21173647,0.34949484,0.012205552,0.011386551,0.0011840549,0.00079273945,0.00091010454,0.17954966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999305,0.00014044103,0.00005123701,0.000138372,0.00028599767,0.00007896411],"domain_scores_gemma":[0.9991461,0.0005582206,0.000036319707,0.00010035779,0.00013402886,0.000025023974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066017685,0.0008773797,0.0007836049,0.0013899469,0.0011254422,0.0016145526,0.0011930946,0.0020850226,0.016545385],"category_scores_gemma":[0.0019489827,0.0007884221,0.0010126618,0.0019122114,0.0030224633,0.003803338,0.0013470639,0.004100827,0.0032730603],"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.000032800854,0.000020627824,0.000059066264,0.00050489896,0.000013770438,0.00010752576,0.000117105454,0.002767038,0.0028238702,0.93303114,0.009303459,0.05121863],"study_design_scores_gemma":[0.000017038736,0.00011242876,0.00010094208,0.0003163724,0.000020645146,0.00048537203,0.000035556306,0.0060377163,0.0043779076,0.6123552,0.37608477,0.000056121786],"about_ca_topic_score_codex":0.0004886881,"about_ca_topic_score_gemma":0.00068877346,"teacher_disagreement_score":0.016545385,"about_ca_system_score_codex":0.0010569234,"about_ca_system_score_gemma":0.0006657518,"threshold_uncertainty_score":0.055349827},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049893647,0.000053768734,0.990892,0.00012566992,0.00001863815,0.000077527315,0.00021831255,0.001763393,0.0018613539],"genre_scores_gemma":[0.23194635,0.00025622672,0.75884944,0.00031392355,0.000073225456,0.00076255604,0.0010198022,0.001122658,0.005655789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998403,0.00038677148,0.0001477243,0.00030528233,0.00062596094,0.00013127262],"domain_scores_gemma":[0.99803144,0.00052543747,0.0001994798,0.0007862861,0.00041204045,0.000045338475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012796652,0.00086591253,0.0006116148,0.0013372296,0.00063116587,0.0029509908,0.002155737,0.0014004257,0.003198104],"category_scores_gemma":[0.003555417,0.0006132593,0.0016139185,0.0007440325,0.0021053206,0.003994431,0.0014178752,0.0019027756,0.0010037204],"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.000137826,0.00010895607,0.0011081393,0.00027321166,0.00004422248,0.0003662809,0.0008659527,0.22248681,0.01432398,0.7245219,0.003348548,0.032414135],"study_design_scores_gemma":[0.00002379843,0.000070927264,0.00021882457,0.00005364353,0.0000398288,0.00014447112,0.00007135632,0.7739041,0.009815243,0.19883415,0.016788667,0.00003502532],"about_ca_topic_score_codex":0.0022541154,"about_ca_topic_score_gemma":0.0025428315,"teacher_disagreement_score":0.003198104,"about_ca_system_score_codex":0.0013500474,"about_ca_system_score_gemma":0.0016461172,"threshold_uncertainty_score":0.010698795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14074601,0.0013522032,0.8083158,0.00659925,0.00020855812,0.00019120601,0.00014607352,0.0018747477,0.040566124],"genre_scores_gemma":[0.8309551,0.00054563506,0.16273119,0.00060539023,0.00022846936,0.00020485175,0.000120492754,0.00029973747,0.004309133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98749906,0.005357737,0.0005450567,0.0026550863,0.0033746993,0.0005684669],"domain_scores_gemma":[0.8898235,0.08440849,0.0024650823,0.018087067,0.004241142,0.000974735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076257694,0.0013177564,0.0010609233,0.0009678589,0.0012153086,0.0026201895,0.0025364417,0.002239783,0.0058646156],"category_scores_gemma":[0.032555014,0.0009148127,0.0014253489,0.0010251162,0.0079826955,0.011402203,0.0044712336,0.007036853,0.0009151223],"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.0011767753,0.00032912235,0.006327148,0.0006186896,0.00014078945,0.0007159643,0.00085114694,0.21083722,0.02435666,0.5750541,0.0026635595,0.17692883],"study_design_scores_gemma":[0.00036743673,0.00068996963,0.002215872,0.00015810937,0.00015083507,0.00070405495,0.00025760196,0.45570964,0.026468126,0.5006284,0.012570273,0.000079690486],"about_ca_topic_score_codex":0.002877888,"about_ca_topic_score_gemma":0.0021681974,"teacher_disagreement_score":0.0076257694,"about_ca_system_score_codex":0.002208828,"about_ca_system_score_gemma":0.0020764521,"threshold_uncertainty_score":0.040329456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06062192,0.0060908776,0.86956984,0.007767146,0.00036190735,0.00045396943,0.0033807901,0.0012390498,0.05051446],"genre_scores_gemma":[0.658579,0.011257838,0.29324007,0.0013094925,0.0016393809,0.0018720819,0.009684093,0.001608292,0.020809708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99084914,0.0024250601,0.0006605537,0.0021618996,0.0029118045,0.0009915007],"domain_scores_gemma":[0.96529794,0.025910834,0.0015975782,0.005336847,0.0012290515,0.0006277207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033385328,0.0022003748,0.0027660802,0.0021716282,0.0020238457,0.009519055,0.0052949637,0.0031470666,0.023125187],"category_scores_gemma":[0.03324318,0.0014935725,0.0038779727,0.0062920507,0.0035172112,0.01931891,0.0044643832,0.0082581565,0.0022296994],"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.00017425798,0.00018773874,0.0017508864,0.0010379829,0.00019406504,0.00018593093,0.00041521786,0.15501177,0.001436332,0.76379305,0.013135908,0.06267682],"study_design_scores_gemma":[0.000039314502,0.000028474566,0.00049467274,0.00007241416,0.000045430206,0.00020741377,0.00010913336,0.1022026,0.0006777915,0.88504577,0.011052124,0.00002482696],"about_ca_topic_score_codex":0.0022762355,"about_ca_topic_score_gemma":0.00204442,"teacher_disagreement_score":0.023125187,"about_ca_system_score_codex":0.0057553165,"about_ca_system_score_gemma":0.0022162127,"threshold_uncertainty_score":0.077361524},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037632465,0.0001040596,0.95918995,0.00010383566,0.000013906445,0.00014397151,0.00007512257,0.0017972833,0.0009394312],"genre_scores_gemma":[0.48363125,0.00010706782,0.51376414,0.00015381433,0.000025531099,0.00033801125,0.0007469504,0.00030475415,0.00092843414],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981159,0.00075538387,0.0000929072,0.00021939487,0.0006462151,0.0001702218],"domain_scores_gemma":[0.99015194,0.007356594,0.00037453065,0.0011251365,0.0008762275,0.000115646144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015170036,0.0007737144,0.00073938764,0.0010924756,0.00029943502,0.00048126327,0.0017082164,0.00080529397,0.0017858071],"category_scores_gemma":[0.012396972,0.0003147856,0.0008445474,0.0006565127,0.0007639279,0.0011627598,0.0012565539,0.0007233281,0.0003253499],"study_design_candidate":"bench_or_experimental","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.00044277194,0.0002809675,0.00393035,0.00041970008,0.000101986545,0.00082691276,0.00027390823,0.44438046,0.031052465,0.029485755,0.0032091597,0.4855955],"study_design_scores_gemma":[0.000059710605,0.0001661758,0.00052661117,0.000021194548,0.000038372586,0.00027834173,0.000022122103,0.9648488,0.017644877,0.014573401,0.0018050766,0.000015292206],"about_ca_topic_score_codex":0.0009810092,"about_ca_topic_score_gemma":0.0014654009,"teacher_disagreement_score":0.0017858071,"about_ca_system_score_codex":0.00052684627,"about_ca_system_score_gemma":0.0009042434,"threshold_uncertainty_score":0.008022726},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043367674,0.00012302035,0.994166,0.000046984005,0.000023295905,0.00006065072,0.000033459168,0.00046257814,0.00074725744],"genre_scores_gemma":[0.28045,0.0004724045,0.7135263,0.00028490723,0.00011536861,0.00054309965,0.00042095577,0.00039343286,0.0037935372],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967001,0.0009692345,0.00031431884,0.0007890841,0.0010684431,0.00015890563],"domain_scores_gemma":[0.9884899,0.0070595043,0.0007223009,0.0022358156,0.0012848658,0.00020754864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020925824,0.0012564306,0.0007481859,0.0016037776,0.00031166148,0.0008592465,0.001468563,0.00080019986,0.0020848985],"category_scores_gemma":[0.011248877,0.00041064472,0.0014328975,0.0007771701,0.0024181884,0.0020663626,0.0019462856,0.0018581094,0.0006062606],"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.00045632652,0.00013954574,0.0052043335,0.001126171,0.00019346975,0.00030139176,0.0008018307,0.15311454,0.04985647,0.35572714,0.0014403795,0.43163842],"study_design_scores_gemma":[0.00010438889,0.00047309717,0.0011691387,0.00018039554,0.00010966143,0.00058257225,0.00011585649,0.60513353,0.06479246,0.29836482,0.028892258,0.00008179892],"about_ca_topic_score_codex":0.0015577942,"about_ca_topic_score_gemma":0.0012395013,"teacher_disagreement_score":0.0020925824,"about_ca_system_score_codex":0.00095102127,"about_ca_system_score_gemma":0.0014327461,"threshold_uncertainty_score":0.011066794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12447945,0.00093457435,0.86693275,0.00038834257,0.0001297729,0.0001359456,0.0001518105,0.005119727,0.0017275419],"genre_scores_gemma":[0.6747064,0.0005488968,0.32223544,0.00011758482,0.000057124347,0.00020064383,0.0004358602,0.0005297181,0.0011682436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892247,0.000251991,0.00011227372,0.00018515416,0.00034082256,0.00018727007],"domain_scores_gemma":[0.99734575,0.0008100806,0.00031553942,0.00096341723,0.000351476,0.00021380156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001919982,0.0007299031,0.0010677467,0.001581488,0.0014461288,0.0019816284,0.0021048728,0.00053167716,0.0010173309],"category_scores_gemma":[0.0044589425,0.0005755616,0.0010825085,0.0024113194,0.0012334835,0.0042623454,0.0021868735,0.00087091204,0.0004112165],"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.0011983371,0.00047561753,0.013219224,0.0004970342,0.0002447828,0.0010156435,0.0016782004,0.6272973,0.04902894,0.0543386,0.008754819,0.24225153],"study_design_scores_gemma":[0.00007786839,0.00012299453,0.0009272016,0.000030504578,0.00007804294,0.00012828816,0.00016238779,0.93011945,0.037316244,0.024063442,0.0069226907,0.000050886487],"about_ca_topic_score_codex":0.005900045,"about_ca_topic_score_gemma":0.007311113,"teacher_disagreement_score":0.005900045,"about_ca_system_score_codex":0.0011623938,"about_ca_system_score_gemma":0.0034306129,"threshold_uncertainty_score":0.011731446},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18757063,0.0009704035,0.8014696,0.0006648608,0.00059641636,0.00012386155,0.00013466437,0.0021160208,0.0063536614],"genre_scores_gemma":[0.97103363,0.000102901926,0.02776058,0.00005907605,0.00007527905,0.000020332083,0.000048401675,0.000039106737,0.0008607775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984333,0.00033057464,0.00012796499,0.00020467886,0.0005290457,0.0003744463],"domain_scores_gemma":[0.99632794,0.0010138602,0.0005918635,0.0008332942,0.00095942034,0.00027368264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002418905,0.0004582065,0.0007253292,0.00074827106,0.001128145,0.0018711756,0.0020255481,0.0007347378,0.0017463156],"category_scores_gemma":[0.0055451873,0.00039728885,0.0003536725,0.00076936773,0.000689153,0.002781343,0.0022247445,0.0013288587,0.00031146096],"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.0025740953,0.0008729659,0.0037698408,0.00040860104,0.00020085165,0.0005456685,0.0010465655,0.38540453,0.106941886,0.09536802,0.010713366,0.39215365],"study_design_scores_gemma":[0.00003434978,0.0001584549,0.0006806906,0.000017493978,0.000035795256,0.000111610985,0.0001492455,0.9739779,0.008568397,0.013879936,0.0023491841,0.000036919122],"about_ca_topic_score_codex":0.0015818774,"about_ca_topic_score_gemma":0.0021848464,"teacher_disagreement_score":0.002418905,"about_ca_system_score_codex":0.00087019824,"about_ca_system_score_gemma":0.0013676669,"threshold_uncertainty_score":0.012792528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022669878,0.0011167355,0.9590444,0.002538383,0.00034479576,0.0001797649,0.0009409194,0.00157248,0.011592628],"genre_scores_gemma":[0.38806093,0.001449835,0.5910495,0.002342427,0.00052979984,0.0008057228,0.0021751332,0.0010615978,0.012525088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9819697,0.006039541,0.00331039,0.003529022,0.0042739,0.00087755005],"domain_scores_gemma":[0.9396643,0.027252277,0.0038059284,0.021084333,0.007295917,0.0008973142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018652072,0.0013438424,0.001192902,0.0021087884,0.0022176881,0.005376677,0.003994888,0.0026406466,0.005899897],"category_scores_gemma":[0.05279629,0.0016830948,0.0017540058,0.0025356275,0.0060774186,0.024686435,0.0063575613,0.0037421267,0.0014680437],"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.0001555682,0.000059618975,0.0036839307,0.0004143643,0.00005918718,0.00035708194,0.0016128287,0.0033539387,0.0024982945,0.9190306,0.0051991697,0.0635755],"study_design_scores_gemma":[0.000056038803,0.00012819875,0.00087095133,0.00044713836,0.00019546467,0.0008797047,0.00044938998,0.01687071,0.00955751,0.8191275,0.15128729,0.00012999575],"about_ca_topic_score_codex":0.0028473565,"about_ca_topic_score_gemma":0.0028374,"teacher_disagreement_score":0.018652072,"about_ca_system_score_codex":0.0020556443,"about_ca_system_score_gemma":0.0036904977,"threshold_uncertainty_score":0.09864271},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07467211,0.0004249261,0.9215098,0.00026772983,0.00013603167,0.00013131261,0.0001480832,0.0008871961,0.0018227352],"genre_scores_gemma":[0.7354832,0.00037804677,0.26221633,0.000099362536,0.00006078065,0.00016400027,0.00030816504,0.00014451292,0.001145476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909794,0.0002288236,0.00008671376,0.00018244,0.00023433579,0.00016968875],"domain_scores_gemma":[0.9982838,0.0007306939,0.00018334754,0.00026437922,0.00030735755,0.000230373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028138396,0.00047864162,0.0007021654,0.0006557079,0.0011437932,0.0012352295,0.0016008171,0.0005033715,0.00094739196],"category_scores_gemma":[0.0036365034,0.00037889718,0.0007860036,0.00077352935,0.0010457763,0.0015731541,0.0013943918,0.0010205577,0.00014821986],"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.0002669568,0.000120034616,0.0021609578,0.00011642855,0.00005084398,0.0001215682,0.00018567599,0.915287,0.01129166,0.033156812,0.0010618246,0.036180276],"study_design_scores_gemma":[0.000017958655,0.000025570369,0.00017995592,0.0000048283096,0.000008595031,0.000014084595,0.000014292418,0.9855885,0.002980572,0.010086636,0.0010696246,0.000009291682],"about_ca_topic_score_codex":0.006849977,"about_ca_topic_score_gemma":0.005785581,"teacher_disagreement_score":0.006849977,"about_ca_system_score_codex":0.002024993,"about_ca_system_score_gemma":0.004265544,"threshold_uncertainty_score":0.014881194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014446961,0.00020326098,0.9908626,0.000075004646,0.000026054648,0.00008646709,0.00008612802,0.0010247345,0.006191113],"genre_scores_gemma":[0.064541176,0.00071549363,0.9272189,0.00010506524,0.00003847261,0.00057981274,0.00048948254,0.00025370286,0.006057844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991825,0.00020627349,0.000059629885,0.000105197556,0.00035332117,0.00009300258],"domain_scores_gemma":[0.9996927,0.000110052206,0.000035611563,0.00007237292,0.00007635068,0.000012875237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001119888,0.00097319833,0.00050162117,0.0007475723,0.00045618822,0.001268649,0.0013741226,0.0006051995,0.0044818125],"category_scores_gemma":[0.0009686522,0.00047026508,0.0012297531,0.0005634798,0.0006574165,0.00077641953,0.0006621813,0.0012680775,0.0013829772],"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.00004514509,0.000052321197,0.00023754526,0.0004176658,0.00005245319,0.0004117923,0.00021490954,0.29878223,0.016866082,0.52633697,0.0057237195,0.15085913],"study_design_scores_gemma":[0.00008620513,0.00014195863,0.0001994492,0.0001745325,0.00005929828,0.00037318526,0.00006135672,0.62942487,0.01507194,0.16736266,0.18700454,0.000039932394],"about_ca_topic_score_codex":0.0021317138,"about_ca_topic_score_gemma":0.003177695,"teacher_disagreement_score":0.0044818125,"about_ca_system_score_codex":0.0010262649,"about_ca_system_score_gemma":0.0012405219,"threshold_uncertainty_score":0.014993191},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007745375,0.011428696,0.9602746,0.0032315175,0.0005614561,0.0003664645,0.00006388357,0.00044506972,0.015882986],"genre_scores_gemma":[0.22158045,0.016186954,0.7467642,0.001286294,0.0028056286,0.002029439,0.000417679,0.0004363609,0.008492983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942883,0.0028574092,0.0005026168,0.0005385538,0.0015358952,0.00027729038],"domain_scores_gemma":[0.9906164,0.0053816563,0.0009045148,0.0017037214,0.0011060839,0.00028767428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066586602,0.0014939765,0.0018683564,0.0017783697,0.0029921134,0.0052109,0.0032650137,0.003984376,0.0025899496],"category_scores_gemma":[0.017485522,0.001472883,0.001397906,0.0025540604,0.0060074124,0.010990249,0.0044795536,0.004338337,0.0014326206],"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.00006744756,0.00004032505,0.00015359289,0.0002762485,0.000019443376,0.00019260327,0.0008943932,0.017157927,0.0013415117,0.9388455,0.0023952944,0.038615674],"study_design_scores_gemma":[0.00005389765,0.00013228224,0.00010423231,0.00028771206,0.000039059843,0.00022599992,0.00015674187,0.07866749,0.0015748978,0.85324645,0.06547271,0.000038404873],"about_ca_topic_score_codex":0.00069237145,"about_ca_topic_score_gemma":0.00042689426,"teacher_disagreement_score":0.0066586602,"about_ca_system_score_codex":0.0018458581,"about_ca_system_score_gemma":0.0017641607,"threshold_uncertainty_score":0.03521478},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019746454,0.00008127216,0.968708,0.00033721668,0.00006444614,0.00034343867,0.00019346469,0.008899639,0.0016261666],"genre_scores_gemma":[0.60363597,0.00015971734,0.38974816,0.00032205135,0.000059001428,0.0006141703,0.000662176,0.00041755234,0.004381162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99525285,0.0011126976,0.00047993232,0.0007239257,0.0019337825,0.00049680553],"domain_scores_gemma":[0.99579215,0.0010560778,0.00038048415,0.0020945896,0.00046650137,0.00021024037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002979402,0.00075818034,0.0012369638,0.0010571656,0.0010253349,0.0027292364,0.003283498,0.0013331344,0.0027281204],"category_scores_gemma":[0.0069239275,0.00074929866,0.0011083743,0.0010731806,0.0023124372,0.0050091622,0.0051824925,0.0031722123,0.0009872214],"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.0026526647,0.00072419154,0.005933841,0.00058520917,0.00043500747,0.0007696747,0.0010090988,0.1675968,0.078601636,0.37677458,0.0154239135,0.3494933],"study_design_scores_gemma":[0.0002753242,0.00023322579,0.0005130936,0.000029429002,0.00008963436,0.00027105518,0.00007081107,0.84313476,0.05027945,0.09078396,0.014238356,0.00008092509],"about_ca_topic_score_codex":0.0015736439,"about_ca_topic_score_gemma":0.0012190621,"teacher_disagreement_score":0.003283498,"about_ca_system_score_codex":0.0015024308,"about_ca_system_score_gemma":0.0027383454,"threshold_uncertainty_score":0.015756726},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06281925,0.003495416,0.9219134,0.00081808143,0.00044344628,0.00061161246,0.00023989606,0.004286344,0.005372559],"genre_scores_gemma":[0.72364366,0.0019204419,0.2682011,0.0003266771,0.00022405622,0.00048153338,0.0006125604,0.00021167463,0.004378353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926203,0.00025151213,0.00006523078,0.00010088429,0.0002538392,0.00006638527],"domain_scores_gemma":[0.9992631,0.00023302747,0.00012061518,0.000093078765,0.00024322729,0.00004689297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013869355,0.00046871928,0.0005980446,0.00065176806,0.0007333299,0.00061055686,0.0011528246,0.00057130074,0.0009387553],"category_scores_gemma":[0.0022196684,0.00018186372,0.0002922581,0.00045592914,0.00042432582,0.00091928255,0.0008898905,0.00059866195,0.00039345198],"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.0009875676,0.00034194515,0.0035700586,0.0016547245,0.00025277294,0.0016655441,0.0015368401,0.15103677,0.18361825,0.046312068,0.025536343,0.58348715],"study_design_scores_gemma":[0.0002469728,0.0015800811,0.0036600288,0.00014775687,0.00028029943,0.0028403648,0.00046588725,0.84295154,0.05476754,0.02436175,0.068446025,0.0002517584],"about_ca_topic_score_codex":0.001335116,"about_ca_topic_score_gemma":0.0015539874,"teacher_disagreement_score":0.0013869355,"about_ca_system_score_codex":0.00034031918,"about_ca_system_score_gemma":0.0008024635,"threshold_uncertainty_score":0.0073349476},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13238694,0.00085511897,0.8614425,0.0006257878,0.00006206281,0.00015721288,0.000031608415,0.0010358905,0.003402851],"genre_scores_gemma":[0.9154563,0.00039941308,0.08233047,0.00008960919,0.000056735164,0.00006610897,0.000047311776,0.00002733979,0.0015267878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990815,0.0003685093,0.00004417873,0.00013741458,0.00026961564,0.00009871309],"domain_scores_gemma":[0.99618405,0.002408675,0.00048507706,0.00045971485,0.00025746875,0.00020493261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021366663,0.00038800342,0.0007531497,0.0009512858,0.0009342694,0.0008674634,0.0011787899,0.0007848189,0.0005788507],"category_scores_gemma":[0.006432654,0.00034179015,0.0003174416,0.00087702903,0.0011132174,0.0021471188,0.0017191751,0.0007369112,0.0002421534],"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.0004304141,0.00043413983,0.006720243,0.0002793169,0.00012745848,0.0008298954,0.0006698287,0.5580493,0.029695006,0.07064787,0.002023402,0.33009315],"study_design_scores_gemma":[0.000032872747,0.00014222693,0.00046616362,0.000010738242,0.000024689372,0.00030275033,0.00007847329,0.97475886,0.004294603,0.016561953,0.0033047535,0.000021965843],"about_ca_topic_score_codex":0.0022853895,"about_ca_topic_score_gemma":0.0026053726,"teacher_disagreement_score":0.0022853895,"about_ca_system_score_codex":0.00061758544,"about_ca_system_score_gemma":0.0010444069,"threshold_uncertainty_score":0.011299908},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04072976,0.001162896,0.94043046,0.00085281284,0.0002648926,0.00040854735,0.00017051824,0.007415407,0.008564774],"genre_scores_gemma":[0.6086992,0.00076090696,0.38317478,0.00026830222,0.000105721934,0.0004343504,0.00034807433,0.00021595963,0.0059926864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994326,0.00013244382,0.00003557294,0.00012154366,0.00021201331,0.00006565573],"domain_scores_gemma":[0.99951005,0.000096419935,0.000042792166,0.00014983329,0.00012668266,0.000074252195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077715784,0.0006685421,0.00054711854,0.0005516593,0.0014843047,0.0011995668,0.0022704753,0.0008584363,0.00218019],"category_scores_gemma":[0.0015971275,0.00033759445,0.00040217492,0.00079594983,0.00068703777,0.0017207355,0.00187376,0.001215128,0.00069577864],"study_design_candidate":"bench_or_experimental","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.00068998453,0.00034159154,0.0018170264,0.0004966529,0.00021621444,0.001468295,0.00074852875,0.4698706,0.06308805,0.13871731,0.028151745,0.2943941],"study_design_scores_gemma":[0.00006985394,0.00026953666,0.00041316202,0.000024929763,0.000047163823,0.0004082144,0.000101027574,0.92464525,0.009887668,0.032447297,0.03161478,0.0000710849],"about_ca_topic_score_codex":0.0038294152,"about_ca_topic_score_gemma":0.0030135394,"teacher_disagreement_score":0.0038294152,"about_ca_system_score_codex":0.00075010344,"about_ca_system_score_gemma":0.0012270082,"threshold_uncertainty_score":0.007614255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12943532,0.0013446143,0.85994166,0.0003029775,0.00019312919,0.0001060455,0.000084740015,0.0003931634,0.0081982585],"genre_scores_gemma":[0.75697047,0.0008962388,0.23536336,0.00007443155,0.00009957288,0.000080278776,0.00010226874,0.000049122453,0.0063643283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996536,0.00005914295,0.000025794014,0.00004262085,0.00017404776,0.00004478647],"domain_scores_gemma":[0.9996444,0.00008649549,0.00005492229,0.00010439569,0.00008199356,0.000027809883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003043686,0.00037566165,0.00047056013,0.000719145,0.00033137845,0.0006386476,0.0003856792,0.000506263,0.0012301672],"category_scores_gemma":[0.0008149329,0.00013287408,0.00040835753,0.00051872554,0.0005732496,0.0017831832,0.0005728553,0.00061786955,0.00042779493],"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.00092954916,0.00012630354,0.0009391363,0.000368914,0.00006050512,0.0008484969,0.00039113523,0.040073298,0.3225426,0.18989745,0.0023877136,0.44143486],"study_design_scores_gemma":[0.00013135457,0.00082316477,0.001490893,0.00006715957,0.000049809998,0.0037400404,0.00013494681,0.54935366,0.34334946,0.052378196,0.048346043,0.00013524998],"about_ca_topic_score_codex":0.00020649277,"about_ca_topic_score_gemma":0.00013613925,"teacher_disagreement_score":0.0012301672,"about_ca_system_score_codex":0.00029883953,"about_ca_system_score_gemma":0.00026429427,"threshold_uncertainty_score":0.004115343},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14755422,0.0025410156,0.8121847,0.0015675727,0.00040002444,0.00022231425,0.00043400223,0.0065010376,0.028595122],"genre_scores_gemma":[0.8498017,0.001089434,0.13677368,0.001079312,0.0005077657,0.00031679493,0.00055372977,0.001039667,0.0088378405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965251,0.0006539154,0.0002238329,0.0006121811,0.0014755717,0.00050940324],"domain_scores_gemma":[0.98594713,0.0056715556,0.0009324611,0.0049920827,0.0021304935,0.0003261539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031299905,0.00076758536,0.0011438074,0.0013354657,0.0014819045,0.0019467727,0.0012917091,0.0012351872,0.0053973617],"category_scores_gemma":[0.015685292,0.00091676775,0.0010413512,0.0016578994,0.0031518391,0.008359399,0.0053479997,0.0020484691,0.0022128324],"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.0011053624,0.00020537675,0.0043799602,0.0007962561,0.00012380931,0.00037551994,0.00081122445,0.030703953,0.038658287,0.59244144,0.016335545,0.31406322],"study_design_scores_gemma":[0.0001555557,0.000692635,0.0017212529,0.00020237928,0.00017078035,0.0014419325,0.00026351196,0.19540614,0.09258739,0.6660937,0.04107594,0.00018873488],"about_ca_topic_score_codex":0.00041238792,"about_ca_topic_score_gemma":0.0003470936,"teacher_disagreement_score":0.0053973617,"about_ca_system_score_codex":0.0009177064,"about_ca_system_score_gemma":0.0014238803,"threshold_uncertainty_score":0.018055916},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34053147,0.00013267217,0.6433953,0.00021834926,0.00013806082,0.00013914258,0.00048609503,0.0049635107,0.009995429],"genre_scores_gemma":[0.9023285,0.000052921903,0.0947872,0.000047808084,0.0000061228493,0.000045748624,0.00020500607,0.00010768048,0.0024189448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976355,0.00004181157,0.000023390037,0.000036446207,0.00009210655,0.000042732994],"domain_scores_gemma":[0.99936515,0.00031806793,0.000056338307,0.00011252548,0.00013520813,0.000012680781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041651455,0.00023507664,0.0001838128,0.00024325117,0.00022820642,0.0004572152,0.00060852553,0.00031695652,0.0027904783],"category_scores_gemma":[0.0011846974,0.00010509092,0.00026847646,0.00014350706,0.00036349875,0.00044070103,0.00018278163,0.0003304191,0.00034535822],"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.0008890009,0.0003426255,0.0063732867,0.0010816633,0.00013215866,0.0017030315,0.0006506973,0.41760048,0.28573084,0.13103236,0.004006657,0.15045717],"study_design_scores_gemma":[0.0001855268,0.0007202758,0.0017150908,0.00005487243,0.000087219436,0.0003205521,0.00010794883,0.56070143,0.40871537,0.0116053475,0.015745701,0.000040613057],"about_ca_topic_score_codex":0.0016760885,"about_ca_topic_score_gemma":0.0017481185,"teacher_disagreement_score":0.0027904783,"about_ca_system_score_codex":0.0005454663,"about_ca_system_score_gemma":0.0009722076,"threshold_uncertainty_score":0.009335101},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04420534,0.0003884406,0.7694525,0.0003423735,0.00014232087,0.0021788543,0.0026761773,0.176255,0.0043589743],"genre_scores_gemma":[0.1919053,0.00026762093,0.7892629,0.00019842784,0.000116393676,0.0012867328,0.007908975,0.0025711244,0.006482523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948626,0.0007821222,0.0009842059,0.0011189652,0.0020895815,0.00016250792],"domain_scores_gemma":[0.9809137,0.004467306,0.0024790266,0.0035026118,0.007959499,0.0006779253],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.005108945,0.0010365084,0.0012078069,0.009843413,0.0012280295,0.0016697628,0.0015299625,0.0017604697,0.0064006397],"category_scores_gemma":[0.023509372,0.0006553412,0.00075028575,0.0036390128,0.00058022747,0.003279973,0.002210915,0.0014606105,0.005520111],"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.00076625583,0.00069214083,0.017874926,0.0010094191,0.00018212691,0.00064039737,0.0011755527,0.0029199475,0.081843294,0.004546536,0.03031723,0.85803217],"study_design_scores_gemma":[0.0006713851,0.0023599481,0.10621692,0.0004080355,0.00044278748,0.0061179185,0.00085976673,0.40405735,0.3362769,0.010639415,0.13116904,0.00078052306],"about_ca_topic_score_codex":0.0018709439,"about_ca_topic_score_gemma":0.0014912752,"teacher_disagreement_score":0.9982395,"about_ca_system_score_codex":0.00075539335,"about_ca_system_score_gemma":0.001960662,"threshold_uncertainty_score":0.027018964},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25515842,0.0004923119,0.73985,0.00016687375,0.0000382777,0.00017297108,0.000052281604,0.0010670396,0.0030017719],"genre_scores_gemma":[0.8877799,0.0002331096,0.1105069,0.000039787352,0.000025282809,0.000048869508,0.000028917277,0.00005979993,0.0012774997],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992112,0.00025098777,0.00004710163,0.00010882908,0.00033736142,0.000044542307],"domain_scores_gemma":[0.99688977,0.0019997787,0.00036532021,0.0005441008,0.0001730763,0.000027990885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005289662,0.00075657916,0.00049746473,0.0008663607,0.00022377816,0.0004397656,0.00039837294,0.00043990184,0.0015895859],"category_scores_gemma":[0.004560367,0.0002664329,0.00043685047,0.00040737598,0.0010180061,0.0011139791,0.00066079316,0.0005024928,0.00025159738],"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.0011285985,0.00020428396,0.0059084725,0.0006026659,0.00024444342,0.00078595255,0.00037243677,0.20223732,0.35925433,0.035195038,0.00089590036,0.3931705],"study_design_scores_gemma":[0.000075482356,0.00066081295,0.0025626237,0.000037157806,0.00005726197,0.0007755886,0.00004693233,0.7025606,0.2648101,0.025754215,0.0026183806,0.000040897845],"about_ca_topic_score_codex":0.00017968124,"about_ca_topic_score_gemma":0.00021076486,"teacher_disagreement_score":0.0015895859,"about_ca_system_score_codex":0.00041454268,"about_ca_system_score_gemma":0.0002538544,"threshold_uncertainty_score":0.0053177476},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013391708,0.0048799138,0.965408,0.0051120096,0.00011042582,0.00004043014,0.000119747034,0.00016539611,0.010772292],"genre_scores_gemma":[0.70437604,0.010722054,0.2776458,0.0007537378,0.0011366674,0.0003582838,0.0003751428,0.00027437217,0.004357882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977939,0.0010801926,0.00013686615,0.0003612164,0.0004883066,0.00013951874],"domain_scores_gemma":[0.985865,0.010547202,0.00079349993,0.0016896925,0.00076011795,0.0003444332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034965698,0.0012572586,0.0014473274,0.0021873158,0.0010618737,0.004547901,0.002026389,0.0019073226,0.002866352],"category_scores_gemma":[0.016298074,0.00072221016,0.0020425597,0.0025189428,0.0073915054,0.011379162,0.0032093036,0.0040731733,0.00039847413],"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.000011031852,0.000011814136,0.00032498795,0.00009825271,0.000026246202,0.000041183157,0.00017313327,0.02830268,0.0001699905,0.9594258,0.00051944767,0.010895538],"study_design_scores_gemma":[0.000002185241,0.000003732353,0.00006858883,0.0000133189515,0.0000045891697,0.000015702242,0.000026014892,0.033188686,0.000052942436,0.96524984,0.0013657134,0.0000087437],"about_ca_topic_score_codex":0.003319251,"about_ca_topic_score_gemma":0.0019051442,"teacher_disagreement_score":0.004547901,"about_ca_system_score_codex":0.0027997713,"about_ca_system_score_gemma":0.0014908322,"threshold_uncertainty_score":0.0203138},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05391583,0.00041123494,0.93195665,0.00038995902,0.000066872635,0.00018470609,0.00016852889,0.00039171404,0.012514544],"genre_scores_gemma":[0.93110293,0.0003558582,0.06262445,0.00005841526,0.0000308737,0.00023910223,0.00016090252,0.00006977189,0.005357697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957925,0.000097007054,0.000020478905,0.000083283005,0.00015895483,0.000061022907],"domain_scores_gemma":[0.9997044,0.00010790161,0.000043254862,0.000019498875,0.00009897926,0.000025857493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004354647,0.0007356408,0.00057324825,0.00058150885,0.00058303616,0.0011614088,0.0011430292,0.00061288546,0.0011995089],"category_scores_gemma":[0.0009829589,0.00031133805,0.00066361926,0.0008375324,0.00041607584,0.001135171,0.000660024,0.00062881334,0.00016200828],"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.000019427922,0.000012515087,0.00029198872,0.000018216952,0.000008706629,0.000036538728,0.000016430058,0.9889121,0.0007726907,0.004518553,0.00034399625,0.00504899],"study_design_scores_gemma":[0.0000017069442,0.0000044714325,0.00005427537,9.115968e-7,0.0000021923136,0.000005378071,0.0000022282884,0.9990447,0.00012607085,0.00063808094,0.00011772687,0.0000022876143],"about_ca_topic_score_codex":0.018762905,"about_ca_topic_score_gemma":0.01106368,"teacher_disagreement_score":0.018762905,"about_ca_system_score_codex":0.0016420808,"about_ca_system_score_gemma":0.001431779,"threshold_uncertainty_score":0.03730738},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067701405,0.0006574808,0.99066556,0.00023311129,0.000029861872,0.00010675362,0.000060559196,0.00050053484,0.00097593456],"genre_scores_gemma":[0.26226896,0.0007186486,0.73447365,0.0002062675,0.00017562283,0.0005471587,0.000503273,0.00008929531,0.0010171413],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951971,0.0030009944,0.00021898854,0.000337209,0.0011502643,0.00009538413],"domain_scores_gemma":[0.9934307,0.00469476,0.00030670545,0.0007129408,0.00078773237,0.00006711471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004992149,0.00075431116,0.0011430706,0.0016299434,0.00046325533,0.001229992,0.0009843924,0.0009836068,0.002243311],"category_scores_gemma":[0.012452737,0.00023466615,0.0008948023,0.0019463698,0.00072811317,0.0013921002,0.0007217485,0.0008321516,0.0006919582],"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.0004341239,0.0002331,0.0027012585,0.0005328047,0.00021951726,0.00029816106,0.00022343609,0.07125762,0.009441113,0.057161108,0.008500844,0.8489969],"study_design_scores_gemma":[0.00010392213,0.0003727086,0.0019515444,0.00009868526,0.00009662223,0.0004871617,0.00009927096,0.83684206,0.010571805,0.13329841,0.015985945,0.00009187002],"about_ca_topic_score_codex":0.0004982667,"about_ca_topic_score_gemma":0.0005770582,"teacher_disagreement_score":0.004992149,"about_ca_system_score_codex":0.0005348351,"about_ca_system_score_gemma":0.0005956849,"threshold_uncertainty_score":0.026401281},"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":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001594699,0.07655212,0.0066233436,0.053562813,0.72511387,0.00018766882,0.00044480618,0.00062286656,0.13529778],"genre_scores_gemma":[0.0060628634,0.064113505,0.003216999,0.014760502,0.31767604,0.00010961692,0.00082816737,0.0005439475,0.59268844],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991665,0.000097413285,0.000044895725,0.00014264758,0.0004333245,0.0001152618],"domain_scores_gemma":[0.99678457,0.00059233874,0.00020513477,0.00017442,0.0013364061,0.0009070975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096417876,0.0013831247,0.001090228,0.002006268,0.0012233165,0.0037794996,0.00087563996,0.0024043256,0.11850049],"category_scores_gemma":[0.0030989468,0.00035901903,0.0007416147,0.0016985438,0.00043368587,0.003633412,0.0014142583,0.004135087,0.060831152],"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.000024219304,0.000030554667,0.00012358636,0.00015166008,0.000007738932,0.000047277492,0.000016453214,0.000057908852,0.0005399137,0.0016295132,0.9278846,0.06948667],"study_design_scores_gemma":[0.0000044765043,0.000050324572,0.0002791061,0.00009303425,0.000007670995,0.0001368209,0.000047924106,0.00014232361,0.00015350405,0.0014628682,0.99761343,0.000008547091],"about_ca_topic_score_codex":0.000326414,"about_ca_topic_score_gemma":0.0012386469,"teacher_disagreement_score":0.11850049,"about_ca_system_score_codex":0.0007992519,"about_ca_system_score_gemma":0.00087685767,"threshold_uncertainty_score":0.3964237},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4792184,0.00041402053,0.46259496,0.0013740419,0.0003010622,0.00021188289,0.0012720408,0.003477941,0.05113561],"genre_scores_gemma":[0.68915206,0.00027618968,0.29245043,0.0005818817,0.00008786104,0.00030830863,0.0022368229,0.00073061744,0.014175771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984779,0.00035833736,0.0001141185,0.00048928725,0.0002788537,0.0002814726],"domain_scores_gemma":[0.99408406,0.0025899466,0.0004842863,0.001589541,0.00084787555,0.00040430695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011573634,0.0007956852,0.0006952182,0.00066245813,0.001168979,0.0015424268,0.0009049053,0.0009219899,0.0135802915],"category_scores_gemma":[0.006341541,0.0005312311,0.0006653532,0.0012737735,0.0019690092,0.0045939507,0.0022694245,0.001452024,0.0028831435],"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.0032828485,0.00058763893,0.007574763,0.0008645166,0.000084828505,0.0009518847,0.001840512,0.045552876,0.08434529,0.62534076,0.02256498,0.20700906],"study_design_scores_gemma":[0.00026203942,0.0011011753,0.003173374,0.00015409027,0.00013877975,0.0011693808,0.0010792569,0.19245708,0.10559462,0.63235945,0.062344197,0.00016642027],"about_ca_topic_score_codex":0.0015605103,"about_ca_topic_score_gemma":0.0025057946,"teacher_disagreement_score":0.0135802915,"about_ca_system_score_codex":0.0010614278,"about_ca_system_score_gemma":0.0010182797,"threshold_uncertainty_score":0.0454306},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07034438,0.03150894,0.829841,0.013326867,0.0019239611,0.0028012646,0.028232198,0.0047677257,0.017253594],"genre_scores_gemma":[0.29382256,0.01287109,0.6471447,0.001207507,0.0016877832,0.0018962994,0.036235545,0.00029591768,0.0048386403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9871427,0.0050055915,0.0013184877,0.0025200201,0.0035446975,0.00046864117],"domain_scores_gemma":[0.97074574,0.019608922,0.002107139,0.0045203706,0.002518495,0.00049930735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006270125,0.002061305,0.002465859,0.02723657,0.0026319693,0.0064262636,0.002890969,0.0028612197,0.0036987346],"category_scores_gemma":[0.04121267,0.0010244567,0.0031945747,0.018991554,0.0015727534,0.008589351,0.0042128228,0.0026792346,0.003909474],"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.00035867703,0.0010905163,0.029732563,0.0043868795,0.0026238468,0.001202366,0.0019382372,0.018957438,0.0058427355,0.0486473,0.06369697,0.8215225],"study_design_scores_gemma":[0.00013411505,0.00035398733,0.014846487,0.0020132815,0.0011530924,0.0014668197,0.0033580095,0.44416586,0.01202652,0.3633102,0.15689865,0.00027299864],"about_ca_topic_score_codex":0.0041707214,"about_ca_topic_score_gemma":0.007989866,"teacher_disagreement_score":0.02723657,"about_ca_system_score_codex":0.0015034555,"about_ca_system_score_gemma":0.002723629,"threshold_uncertainty_score":0.03315997},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27473864,0.0005557368,0.6745172,0.0009705124,0.00015478904,0.00013877265,0.0007652093,0.00045314507,0.04770597],"genre_scores_gemma":[0.83282316,0.000553224,0.15052311,0.00022038138,0.00010154752,0.00015523151,0.0010947549,0.00013077003,0.014397847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877995,0.00021150359,0.00006293785,0.0004139452,0.0003495082,0.00018221138],"domain_scores_gemma":[0.99757856,0.00071869564,0.00044137397,0.0006182706,0.00040235397,0.00024072164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005423902,0.0007772963,0.00045514383,0.0008383244,0.0006609761,0.0016226263,0.001206195,0.0012113773,0.007927794],"category_scores_gemma":[0.0035518222,0.0007159519,0.00077614764,0.0010038523,0.0020048965,0.004951664,0.0031832354,0.0019696006,0.0009250278],"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.00022888843,0.000088766064,0.0016720319,0.0002957873,0.000045371915,0.0007151915,0.0005399249,0.038798835,0.019538935,0.87895733,0.0031332027,0.055985685],"study_design_scores_gemma":[0.000074687,0.0003630557,0.0035387676,0.000085733336,0.00008927253,0.002522412,0.0012766063,0.1568373,0.014514576,0.7765977,0.04401856,0.000081348844],"about_ca_topic_score_codex":0.0005953024,"about_ca_topic_score_gemma":0.00088144076,"teacher_disagreement_score":0.007927794,"about_ca_system_score_codex":0.00060972903,"about_ca_system_score_gemma":0.00043737676,"threshold_uncertainty_score":0.026521146},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055613625,0.6738257,0.054469194,0.05809603,0.018506512,0.0004387674,0.005348496,0.0019542365,0.1817998],"genre_scores_gemma":[0.013739054,0.61443627,0.025459968,0.005342944,0.008356977,0.00018962461,0.0046265214,0.0009822149,0.32686645],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888474,0.00008631098,0.000075034644,0.00017983539,0.0007146747,0.000059435344],"domain_scores_gemma":[0.99778336,0.00094582204,0.00026533531,0.000095740426,0.00055726914,0.0003524427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011125003,0.0012928717,0.0015155807,0.004271109,0.00057084544,0.0037612251,0.0009888813,0.0008875858,0.08297981],"category_scores_gemma":[0.004868658,0.00052649766,0.00058045646,0.005753988,0.0011372935,0.005570527,0.0016591216,0.0020660874,0.086494416],"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.00009975458,0.00003951894,0.00034188616,0.0015794692,0.000023240164,0.00021285971,0.00017313079,0.00022823797,0.0012283371,0.0047526574,0.729384,0.26193693],"study_design_scores_gemma":[0.000012411591,0.000028990136,0.0011671466,0.00053963007,0.000025064932,0.0015016117,0.00012846562,0.0002936815,0.0008737961,0.0067423377,0.98865616,0.000030708026],"about_ca_topic_score_codex":0.0011447105,"about_ca_topic_score_gemma":0.0018049722,"teacher_disagreement_score":0.08297981,"about_ca_system_score_codex":0.00080074294,"about_ca_system_score_gemma":0.00094918674,"threshold_uncertainty_score":0.2775951},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05574517,0.0010076351,0.9282515,0.0006045724,0.00015109008,0.0003782809,0.00018403353,0.00059086835,0.013086779],"genre_scores_gemma":[0.6483924,0.0011381402,0.33572468,0.0003816235,0.00014944393,0.0005512716,0.000337047,0.00007985453,0.013245668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672925,0.0008060496,0.00024057564,0.00050913496,0.0013535265,0.00036150726],"domain_scores_gemma":[0.9984332,0.0003963017,0.0003135861,0.0005218648,0.00024028055,0.000094721494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017642095,0.0004695663,0.0007729716,0.0008763353,0.00080494303,0.0015100561,0.0014875478,0.0011649538,0.003103638],"category_scores_gemma":[0.0030373873,0.00031053825,0.00082112645,0.0013122951,0.0015512893,0.004405131,0.0027992334,0.0013696607,0.0011046171],"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.0003565215,0.00009655496,0.00024068505,0.0002331783,0.000050644743,0.0001737068,0.00037359458,0.03037698,0.04553754,0.8464778,0.0019639018,0.074118845],"study_design_scores_gemma":[0.0004987816,0.0005146834,0.000587813,0.00010043615,0.00012821879,0.0009243258,0.00014960219,0.45448175,0.09353683,0.39824036,0.05059962,0.00023761437],"about_ca_topic_score_codex":0.00044521075,"about_ca_topic_score_gemma":0.00037273185,"teacher_disagreement_score":0.003103638,"about_ca_system_score_codex":0.0012334877,"about_ca_system_score_gemma":0.0015893414,"threshold_uncertainty_score":0.010382712},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09007676,0.001243527,0.88947403,0.00061856234,0.00021389098,0.0002362624,0.003390163,0.0029054512,0.0118412925],"genre_scores_gemma":[0.4244241,0.0010781114,0.55243206,0.00028433127,0.00013161845,0.00046145028,0.007858211,0.00035793748,0.012972203],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994141,0.00010851929,0.000060274753,0.00007168269,0.00027260525,0.00007283195],"domain_scores_gemma":[0.99838805,0.0005248894,0.00014029503,0.00040461673,0.00046916536,0.00007294177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033932217,0.00029568438,0.00046155305,0.0013993791,0.00046871553,0.0010693937,0.0007215975,0.00044531454,0.0058306246],"category_scores_gemma":[0.0032282039,0.00022998644,0.00037400948,0.0029988592,0.00037924876,0.002020819,0.0010713296,0.00047394604,0.002058584],"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.0006851521,0.0001791395,0.0035619605,0.0005712729,0.000091238195,0.0005282202,0.00062458124,0.14785905,0.05133515,0.19095156,0.044968054,0.5586447],"study_design_scores_gemma":[0.00009796102,0.00019544644,0.001601893,0.000064143336,0.00002735759,0.0006981953,0.00016186322,0.8257018,0.022440827,0.07844488,0.07051763,0.000048055022],"about_ca_topic_score_codex":0.0031822748,"about_ca_topic_score_gemma":0.0038445098,"teacher_disagreement_score":0.0058306246,"about_ca_system_score_codex":0.0005460063,"about_ca_system_score_gemma":0.0006942409,"threshold_uncertainty_score":0.019505382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02120812,0.00014919,0.96903324,0.0005568944,0.000059814025,0.00033003493,0.00038777592,0.0047836304,0.0034912566],"genre_scores_gemma":[0.42186224,0.0002013275,0.57096136,0.00033547112,0.0000404379,0.00042209856,0.00086322206,0.00031568843,0.0049981116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939395,0.0021478254,0.00059967366,0.0007874515,0.0020106982,0.00051481556],"domain_scores_gemma":[0.99358624,0.0031762128,0.0005447617,0.0012516561,0.0011809513,0.00026025364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051641213,0.00092111016,0.0006722651,0.0014700812,0.001100817,0.0039095744,0.002849067,0.0016506292,0.004403404],"category_scores_gemma":[0.008453501,0.00067344785,0.0021071676,0.00089795515,0.0026966534,0.003246454,0.0027793874,0.0018266584,0.00065438845],"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.0006593801,0.0003577801,0.0038754435,0.00043421023,0.00021525487,0.0012001775,0.0012690142,0.5581129,0.011466272,0.33666036,0.0061867842,0.07956234],"study_design_scores_gemma":[0.000089437046,0.000072973344,0.0001711088,0.000046144443,0.00006350958,0.00013989634,0.000075386764,0.94519156,0.0070739808,0.03737193,0.009666219,0.000037878333],"about_ca_topic_score_codex":0.025207244,"about_ca_topic_score_gemma":0.014775319,"teacher_disagreement_score":0.025207244,"about_ca_system_score_codex":0.0019352481,"about_ca_system_score_gemma":0.0052097607,"threshold_uncertainty_score":0.05012107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10629419,0.0006373489,0.8556506,0.0016570434,0.00051115034,0.00047096962,0.0011659757,0.0026693547,0.03094332],"genre_scores_gemma":[0.79349786,0.00047943433,0.18130088,0.00038052126,0.00028772274,0.00021691233,0.00060879486,0.00009156571,0.023136353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982754,0.00044524172,0.00016650118,0.0003089607,0.0005583879,0.00024556994],"domain_scores_gemma":[0.9985655,0.00020735654,0.00030472578,0.00045973837,0.0002577797,0.00020489287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012304398,0.00038309343,0.0007893389,0.00081736094,0.0008859112,0.0016979891,0.000878088,0.0010990917,0.008181875],"category_scores_gemma":[0.0017125119,0.00019074114,0.0005788457,0.0011687,0.0011337256,0.0029318235,0.0020196857,0.0011451592,0.0022103167],"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.00089093245,0.00024815873,0.00072702405,0.00033600794,0.00005398676,0.00028209013,0.0003050734,0.018385246,0.097154364,0.75777024,0.0089026755,0.11494423],"study_design_scores_gemma":[0.000552466,0.001283365,0.0016005007,0.00008488735,0.00012221611,0.0019592976,0.00013734734,0.29114836,0.1608134,0.33390975,0.20793489,0.0004535664],"about_ca_topic_score_codex":0.0002724485,"about_ca_topic_score_gemma":0.00016951078,"teacher_disagreement_score":0.008181875,"about_ca_system_score_codex":0.0008291095,"about_ca_system_score_gemma":0.0013258979,"threshold_uncertainty_score":0.027371109},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58754635,0.0015670881,0.37999317,0.0012210023,0.00020302499,0.00011207545,0.00016332297,0.0018276774,0.027366342],"genre_scores_gemma":[0.98728824,0.00010567083,0.0115835,0.000039248687,0.000031401527,0.000009784951,0.00002532076,0.000043485914,0.00087330386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999567,0.00010988714,0.000017179424,0.00005979408,0.00013326191,0.00011294755],"domain_scores_gemma":[0.9994161,0.00028291313,0.000072658455,0.00006658967,0.0000988794,0.00006288047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061110756,0.00044378074,0.00048270408,0.00067175494,0.00082778966,0.0012052595,0.00067893515,0.00041300457,0.0017724474],"category_scores_gemma":[0.0016301358,0.00020976867,0.00016108589,0.0011488912,0.0005926365,0.0009568689,0.00075762824,0.00040202355,0.00038224235],"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.00033493977,0.00012057014,0.0035384179,0.00009062415,0.000030726493,0.00020416157,0.00006573616,0.8719165,0.027814956,0.007596233,0.0021480971,0.086139046],"study_design_scores_gemma":[0.000012700999,0.00004931672,0.0008333945,0.00000500356,0.0000070221627,0.000024093642,0.000055421853,0.9859985,0.006996651,0.004978626,0.0010319012,0.0000074678355],"about_ca_topic_score_codex":0.0031812857,"about_ca_topic_score_gemma":0.0036086675,"teacher_disagreement_score":0.0031812857,"about_ca_system_score_codex":0.001067679,"about_ca_system_score_gemma":0.0007704352,"threshold_uncertainty_score":0.007746637},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020473955,0.00027738628,0.9732404,0.00026651463,0.00008643737,0.00012754068,0.000121704354,0.002379389,0.0030267101],"genre_scores_gemma":[0.22390836,0.00017149432,0.7715995,0.00023513191,0.000081213155,0.00036091142,0.0005288521,0.00065253844,0.0024619028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999041,0.00026735003,0.000042968375,0.00022841136,0.0002789503,0.00014131889],"domain_scores_gemma":[0.99689037,0.0019344775,0.0001933947,0.00046872476,0.0003535614,0.00015959394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012076838,0.0012301151,0.0013371641,0.0011016106,0.0007953471,0.0013746165,0.0020614336,0.001473228,0.0032305385],"category_scores_gemma":[0.007056221,0.0005859154,0.0012209202,0.0012488401,0.0010971355,0.0015633553,0.0016225182,0.0013091206,0.000951931],"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.00023808294,0.00019564884,0.0018242733,0.00021835888,0.00010456661,0.00017175854,0.00019001604,0.72780997,0.007788258,0.03758642,0.01335468,0.21051799],"study_design_scores_gemma":[0.00004162744,0.000020675407,0.00007586566,0.0000068854124,0.0000075743587,0.000028389317,0.000010139421,0.98916733,0.0011216368,0.008303878,0.0012100888,0.000005822013],"about_ca_topic_score_codex":0.0063637816,"about_ca_topic_score_gemma":0.008314831,"teacher_disagreement_score":0.0063637816,"about_ca_system_score_codex":0.0016674822,"about_ca_system_score_gemma":0.0028809125,"threshold_uncertainty_score":0.01265347},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87765527,0.00088505546,0.10374779,0.0009095788,0.00013480324,0.00024593,0.00056508067,0.0003716575,0.015484858],"genre_scores_gemma":[0.99615604,0.00007690578,0.0031834545,0.000030031497,0.000005689449,0.000039284874,0.00006679658,0.0000096333815,0.00043226636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893004,0.00052340335,0.000038388564,0.0001153415,0.00016085597,0.00023197988],"domain_scores_gemma":[0.9935136,0.0048512304,0.0005016424,0.00024280463,0.0007261746,0.00016456614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029743183,0.0007653091,0.00095849443,0.0011165289,0.0005050005,0.0011747339,0.0011366485,0.001054249,0.0017334686],"category_scores_gemma":[0.007315077,0.00033183812,0.0005879371,0.00089234987,0.0005488116,0.0009985252,0.0006350054,0.0007811148,0.00016425515],"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.00006799451,0.0000422488,0.0003805606,0.000016421061,0.000008463994,0.000010516165,0.000008409035,0.99691975,0.00023024369,0.0011378502,0.0001437175,0.0010339],"study_design_scores_gemma":[0.00000488949,0.000029050487,0.00016935314,0.0000025642282,0.000004217312,0.0000031640564,0.000010202562,0.9993105,0.00014905677,0.00026819884,0.00004600478,0.0000028509023],"about_ca_topic_score_codex":0.017743303,"about_ca_topic_score_gemma":0.008071828,"teacher_disagreement_score":0.017743303,"about_ca_system_score_codex":0.0035182089,"about_ca_system_score_gemma":0.0018155167,"threshold_uncertainty_score":0.03528005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011076699,0.0027087817,0.98858213,0.0031190705,0.0005752273,0.0002918501,0.00115663,0.0011518713,0.0013067028],"genre_scores_gemma":[0.03577333,0.004095534,0.95236295,0.00089501025,0.0015027081,0.0014980084,0.0019814551,0.00026063935,0.0016303777],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9856286,0.007345257,0.0017978649,0.00154945,0.0034425228,0.00023638697],"domain_scores_gemma":[0.9372598,0.046984885,0.0025848832,0.0057713385,0.0065669133,0.00083225325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016234279,0.0017449652,0.0020750249,0.010230648,0.0013689068,0.006052092,0.0024727574,0.0016653523,0.0045046536],"category_scores_gemma":[0.069545485,0.0009385036,0.0028135346,0.00895738,0.001801822,0.0052186158,0.004002325,0.0055380054,0.0028522033],"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.00015756642,0.00024917902,0.0055212313,0.0023203148,0.0011170694,0.00051376806,0.00083912455,0.030455876,0.001978221,0.33950123,0.06329744,0.55404896],"study_design_scores_gemma":[0.00005201151,0.000049909486,0.001209135,0.00051832857,0.00011008811,0.00033657416,0.00022083528,0.27625307,0.0012098975,0.6435147,0.07645718,0.000068324436],"about_ca_topic_score_codex":0.0015178684,"about_ca_topic_score_gemma":0.0015073179,"teacher_disagreement_score":0.016234279,"about_ca_system_score_codex":0.0013680076,"about_ca_system_score_gemma":0.002712932,"threshold_uncertainty_score":0.08585608},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2433762,0.0008784615,0.744014,0.00073992106,0.00018068461,0.00021824302,0.00020406104,0.0062386272,0.004149735],"genre_scores_gemma":[0.921772,0.00016811423,0.07457932,0.0003491743,0.00002521085,0.00009093662,0.00040834604,0.00013937293,0.0024675657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992797,0.0002071527,0.000028327906,0.00017486679,0.00019470794,0.00011520375],"domain_scores_gemma":[0.998401,0.00086882117,0.0001779633,0.00028310734,0.00019434572,0.00007478517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013276809,0.0011814462,0.0008320081,0.00081748713,0.00032186066,0.0006547631,0.0012685136,0.0011620263,0.0009886228],"category_scores_gemma":[0.0029980522,0.00035379763,0.0009881048,0.00035171496,0.001111862,0.001065733,0.0011974296,0.0017326765,0.0002585987],"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.00017241311,0.00012565375,0.00308333,0.000051428815,0.000065147666,0.0001713318,0.000044289278,0.9225769,0.0051454697,0.0029591501,0.001921114,0.06368374],"study_design_scores_gemma":[0.0000031177324,0.000019276378,0.0001370107,0.000002465666,0.0000035288533,0.000015483613,0.000002862037,0.99789387,0.0012767065,0.00055396784,0.000088643355,0.0000031365682],"about_ca_topic_score_codex":0.0059646694,"about_ca_topic_score_gemma":0.0034742828,"teacher_disagreement_score":0.0059646694,"about_ca_system_score_codex":0.00090393325,"about_ca_system_score_gemma":0.00072962046,"threshold_uncertainty_score":0.011859894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42462724,0.0011881933,0.5303397,0.003973845,0.00014476909,0.0002877562,0.0007856377,0.00067611976,0.037976753],"genre_scores_gemma":[0.9863123,0.00034660622,0.010022792,0.000120604396,0.000046012527,0.000091652684,0.00009099219,0.00004905057,0.0029200078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948645,0.00016210813,0.000019331184,0.00009795087,0.0000923371,0.00014185296],"domain_scores_gemma":[0.99889463,0.00050638546,0.00020732798,0.000088319575,0.00020905393,0.00009422439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009303604,0.0011665446,0.0006422948,0.0010004772,0.00100739,0.0017884083,0.0019939875,0.0020420456,0.0022492923],"category_scores_gemma":[0.0026214286,0.00053062255,0.00078154664,0.0009099516,0.0010596673,0.0021306288,0.0012400533,0.0013233438,0.00043641345],"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.000025257381,0.000060671122,0.0014081298,0.00001667034,0.000012092509,0.000076147786,0.000061198254,0.9837075,0.0011409572,0.011660832,0.00047869261,0.0013518903],"study_design_scores_gemma":[0.0000016374954,0.000007665873,0.00009679697,0.0000021360472,0.0000026121002,0.000007178677,0.000014118551,0.9982823,0.000083221596,0.0013828148,0.00011685779,0.000002627152],"about_ca_topic_score_codex":0.01640885,"about_ca_topic_score_gemma":0.006796663,"teacher_disagreement_score":0.01640885,"about_ca_system_score_codex":0.0032472073,"about_ca_system_score_gemma":0.0014915563,"threshold_uncertainty_score":0.03262669},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12418216,0.001479237,0.8642302,0.002109119,0.0001735648,0.0005403612,0.00067746564,0.0034406513,0.0031672348],"genre_scores_gemma":[0.76788867,0.00034180787,0.2273792,0.000560264,0.0002360855,0.00028437751,0.0011999019,0.00015066778,0.0019590077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659234,0.0016128989,0.00014571806,0.0007203898,0.00064745825,0.00028111847],"domain_scores_gemma":[0.98342794,0.011433507,0.0015259302,0.0020818997,0.0009750248,0.0005557169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004418378,0.0017391557,0.002132083,0.0018368397,0.0010030532,0.0013719801,0.003024,0.001730676,0.0015828453],"category_scores_gemma":[0.017351704,0.0008593628,0.001278487,0.001233617,0.0013697853,0.0027409224,0.002320007,0.0018319251,0.00059310836],"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.0009716648,0.0005564736,0.019366618,0.0004237352,0.00043101038,0.0003586351,0.00043209863,0.72932583,0.0060354946,0.014610989,0.008060941,0.2194265],"study_design_scores_gemma":[0.000036659017,0.000063473046,0.0004948305,0.000014068641,0.00002848214,0.000077773555,0.00005957932,0.986949,0.0014765641,0.01018057,0.00060977554,0.000009164397],"about_ca_topic_score_codex":0.0059755584,"about_ca_topic_score_gemma":0.006523661,"teacher_disagreement_score":0.0059755584,"about_ca_system_score_codex":0.0012403872,"about_ca_system_score_gemma":0.0022899115,"threshold_uncertainty_score":0.023366868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26566052,0.00087024027,0.70449525,0.0055538374,0.0007587664,0.0003941635,0.0007958085,0.0013477273,0.020123735],"genre_scores_gemma":[0.87483746,0.0002800662,0.119927436,0.00035862747,0.00011161968,0.00008607388,0.0003877259,0.00015695869,0.0038541388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994849,0.00015801066,0.00001548737,0.000102880214,0.00007369893,0.00016497805],"domain_scores_gemma":[0.9988237,0.00057814637,0.0001483142,0.00022582067,0.00008158537,0.00014237876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008621061,0.0007971043,0.0005269297,0.00020979086,0.0007237607,0.0014460138,0.00070376246,0.0007196492,0.005490225],"category_scores_gemma":[0.0026203166,0.0002997932,0.00045583918,0.0003462886,0.0008961257,0.0018193653,0.0010342574,0.0010923701,0.00057853875],"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.00044196096,0.00012927144,0.0013780027,0.00014715455,0.00005752321,0.00025762347,0.0001474355,0.88137746,0.008701388,0.04580839,0.016710272,0.044843446],"study_design_scores_gemma":[0.00003970333,0.00009221058,0.000297336,0.00001948184,0.000011714632,0.000102307946,0.0002439278,0.9566337,0.0023996988,0.035823442,0.004323992,0.000012573936],"about_ca_topic_score_codex":0.0038880352,"about_ca_topic_score_gemma":0.0046006087,"teacher_disagreement_score":0.005490225,"about_ca_system_score_codex":0.00057962164,"about_ca_system_score_gemma":0.0008860678,"threshold_uncertainty_score":0.018366575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09694265,0.0010669805,0.8620927,0.011008176,0.0004969353,0.00023060144,0.00012565269,0.0011645037,0.026871772],"genre_scores_gemma":[0.73478204,0.00076691504,0.2555775,0.00081437523,0.00018999865,0.00023443607,0.0001390146,0.00036987083,0.007125881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98570096,0.0072226464,0.0008268486,0.0012076559,0.0040713474,0.00097056734],"domain_scores_gemma":[0.9326032,0.026289033,0.0021550832,0.031974755,0.005419367,0.00155858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014136335,0.0005290028,0.0011840346,0.0009888229,0.0031533663,0.0061629578,0.0025378282,0.0028564294,0.003515363],"category_scores_gemma":[0.05444675,0.00095545285,0.0010563844,0.0013425542,0.012869283,0.017998166,0.011070526,0.009405452,0.0015486025],"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.00009696234,0.00003903923,0.00028108968,0.00010350499,0.000009840585,0.00006453278,0.00097309746,0.0043478804,0.0015890644,0.97014076,0.0017045961,0.02064963],"study_design_scores_gemma":[0.000095420044,0.0001804075,0.00014787362,0.00022850839,0.000018806979,0.0003099056,0.0005663993,0.03628973,0.014271367,0.9034595,0.044308297,0.00012382021],"about_ca_topic_score_codex":0.000617016,"about_ca_topic_score_gemma":0.00045232923,"teacher_disagreement_score":0.014136335,"about_ca_system_score_codex":0.0023006091,"about_ca_system_score_gemma":0.0026463417,"threshold_uncertainty_score":0.07476097},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114049666,0.00026785664,0.8649699,0.00024330779,0.0001865872,0.0004035903,0.0004191689,0.013633657,0.0058262288],"genre_scores_gemma":[0.746738,0.00014293221,0.24749878,0.00010083544,0.00003591132,0.00028642482,0.000659361,0.0003513863,0.0041863318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992379,0.0002042169,0.000058014946,0.00015265906,0.0002559683,0.00009122107],"domain_scores_gemma":[0.9990594,0.00023160824,0.00011761918,0.00029000023,0.00020276233,0.000098697456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009082738,0.00045499418,0.0005706498,0.00053192116,0.00070878025,0.0007599356,0.0012581343,0.0004974749,0.002619716],"category_scores_gemma":[0.0018038548,0.00024014345,0.00031307666,0.0006508215,0.00066621514,0.0010534663,0.0011720608,0.0006189791,0.00039564344],"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.0033516274,0.00043789652,0.0036148157,0.0007373,0.00014983588,0.0008070569,0.0008571226,0.40010902,0.15131886,0.095912285,0.02686631,0.3158379],"study_design_scores_gemma":[0.00048663316,0.00046372748,0.0004437774,0.000022408018,0.000034134795,0.00015175137,0.00011223944,0.9259725,0.037530523,0.014170086,0.020572636,0.000039597886],"about_ca_topic_score_codex":0.003415117,"about_ca_topic_score_gemma":0.0027665037,"teacher_disagreement_score":0.003415117,"about_ca_system_score_codex":0.0005306018,"about_ca_system_score_gemma":0.001168177,"threshold_uncertainty_score":0.00876379},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2371977,0.0030223923,0.65336126,0.00093556324,0.0008608947,0.00013922827,0.0011094811,0.0020621906,0.10131125],"genre_scores_gemma":[0.768729,0.0017721378,0.19761916,0.0004155106,0.00059704477,0.0001254612,0.0013574986,0.00073654775,0.028647609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990402,0.00015795784,0.0000886359,0.00015676103,0.0004487394,0.00010767783],"domain_scores_gemma":[0.99853265,0.000680989,0.00017404354,0.00030001646,0.00023260723,0.000079714024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009361044,0.00082656596,0.00060804695,0.0013218222,0.00049192837,0.0020594834,0.0005908095,0.00050692575,0.016852418],"category_scores_gemma":[0.0052037737,0.000354128,0.00045941235,0.0010435684,0.0012632657,0.004452455,0.0023962099,0.0015512414,0.0046956167],"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.0008049705,0.00006689965,0.000768084,0.0004435833,0.000029514036,0.0006504033,0.0003978724,0.030017344,0.02006397,0.7464557,0.011254715,0.18904686],"study_design_scores_gemma":[0.000037979753,0.0001663515,0.00027954497,0.00010142143,0.000012703754,0.0005389054,0.00006272089,0.03298037,0.01652845,0.9290372,0.02022241,0.000031834392],"about_ca_topic_score_codex":0.00019061896,"about_ca_topic_score_gemma":0.00027000482,"teacher_disagreement_score":0.016852418,"about_ca_system_score_codex":0.0005768973,"about_ca_system_score_gemma":0.00041544682,"threshold_uncertainty_score":0.056376934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6513187,0.00048604165,0.31328672,0.0052424534,0.00028860843,0.00030167936,0.0004533073,0.0037911797,0.024831347],"genre_scores_gemma":[0.95954144,0.0001906451,0.033402774,0.0005175515,0.00007318891,0.00006980897,0.0003181374,0.00041678187,0.005469554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705243,0.0008742333,0.00017262087,0.00056304265,0.0009330763,0.00040471912],"domain_scores_gemma":[0.9761478,0.007985683,0.0015006028,0.01150206,0.0021374985,0.0007262804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003290173,0.0004289197,0.0009750034,0.0010979119,0.0017515596,0.0026169007,0.0013760069,0.0015354538,0.006601832],"category_scores_gemma":[0.021541419,0.0006240886,0.000740173,0.0010363474,0.004435121,0.0074989423,0.004024016,0.0027004944,0.0021029096],"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.00090689363,0.00018963838,0.010374741,0.00025204645,0.000084381034,0.0006369859,0.0024051657,0.031542126,0.02003709,0.84114474,0.009902498,0.08252362],"study_design_scores_gemma":[0.00009556032,0.0003362402,0.0012821753,0.00007898201,0.00006462593,0.0006750612,0.000850023,0.12942614,0.044251718,0.80409575,0.018761976,0.00008174876],"about_ca_topic_score_codex":0.00076111837,"about_ca_topic_score_gemma":0.0006153935,"teacher_disagreement_score":0.006601832,"about_ca_system_score_codex":0.0012109794,"about_ca_system_score_gemma":0.0011680935,"threshold_uncertainty_score":0.022085369},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26071626,0.00070122257,0.7264157,0.0007635684,0.00007939503,0.00020365951,0.0005426711,0.0016423702,0.008935137],"genre_scores_gemma":[0.60622716,0.0003331528,0.38730162,0.0001514989,0.000040155923,0.00018549945,0.0019366926,0.00022579113,0.0035983217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992931,0.00015163235,0.000041940464,0.00019195581,0.00016056567,0.00016082007],"domain_scores_gemma":[0.998825,0.0004374269,0.00016838725,0.00031555514,0.00013715687,0.000116509254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007309616,0.0007518833,0.0008472944,0.001274736,0.00059060345,0.0011865682,0.0015357842,0.00086135074,0.003136283],"category_scores_gemma":[0.0042847726,0.00046797196,0.0010224199,0.0018346276,0.0005949453,0.002466895,0.0017042885,0.0009470816,0.00062874355],"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.0006176179,0.00044162376,0.0050411336,0.00036437038,0.00018996111,0.0003192177,0.0007087564,0.58699644,0.013367568,0.12719557,0.0151000265,0.24965772],"study_design_scores_gemma":[0.00004844024,0.00005699524,0.00038130063,0.000025244346,0.000022895498,0.00010259308,0.00011968763,0.91898376,0.0019784484,0.076026544,0.0022453924,0.000008770554],"about_ca_topic_score_codex":0.0027942676,"about_ca_topic_score_gemma":0.0038338092,"teacher_disagreement_score":0.003136283,"about_ca_system_score_codex":0.0012403753,"about_ca_system_score_gemma":0.00068961515,"threshold_uncertainty_score":0.010491908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023966264,0.0002751771,0.96913314,0.00020355602,0.000065018976,0.00006360774,0.00018401981,0.004369162,0.0017400704],"genre_scores_gemma":[0.5437255,0.00024197051,0.4475496,0.00049016136,0.0000943386,0.00013029779,0.001394627,0.00032781754,0.006045722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988356,0.00011809768,0.00004421949,0.00038509656,0.0004571966,0.00015973221],"domain_scores_gemma":[0.9992005,0.00020442672,0.00007223195,0.00020529318,0.00025019623,0.00006742628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011371137,0.0012820135,0.0015830375,0.0011261989,0.00042861112,0.0010757318,0.0025511151,0.0012197986,0.002541742],"category_scores_gemma":[0.0023087403,0.0006612574,0.0009163395,0.0009626701,0.0006760725,0.0025476264,0.0025216904,0.001523412,0.0014610564],"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.0005682635,0.00024903266,0.0023003956,0.000113754904,0.00014841842,0.0002556958,0.000073459414,0.19473319,0.06385748,0.011293578,0.011065004,0.7153418],"study_design_scores_gemma":[0.000013984657,0.000033481094,0.0002916459,0.0000033081103,0.000014215643,0.00006538067,0.000006151844,0.98525316,0.010588403,0.0024563696,0.001261584,0.000012294474],"about_ca_topic_score_codex":0.0052244063,"about_ca_topic_score_gemma":0.0059691067,"teacher_disagreement_score":0.0052244063,"about_ca_system_score_codex":0.0010409907,"about_ca_system_score_gemma":0.0015729705,"threshold_uncertainty_score":0.010388017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30787128,0.0040771463,0.5633147,0.0006838195,0.0013296196,0.0011077701,0.011315598,0.089231506,0.021068657],"genre_scores_gemma":[0.51635957,0.0011652892,0.43528363,0.0003695506,0.00022165329,0.0005203247,0.020668479,0.0009845734,0.024426896],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992926,0.0000549402,0.000052038216,0.00026805315,0.00022261926,0.00010961001],"domain_scores_gemma":[0.99917716,0.00014940661,0.00008575952,0.00015674814,0.00037572425,0.00005524013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066458853,0.0012692007,0.0008675903,0.004115173,0.00039982304,0.001390938,0.0016395078,0.0010753112,0.006908273],"category_scores_gemma":[0.002143545,0.0002829897,0.00095349946,0.0018270228,0.00031404043,0.0012310898,0.0010427227,0.0010367507,0.0072122803],"study_design_candidate":"bench_or_experimental","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.00029861685,0.0001886371,0.0022137198,0.00021321431,0.000055926226,0.00010690266,0.000051696472,0.00934876,0.028996125,0.00047562728,0.014428193,0.9436225],"study_design_scores_gemma":[0.00005459574,0.00025190177,0.008821333,0.00010675116,0.000094410476,0.00020575138,0.00017389253,0.89869165,0.07440101,0.0010810308,0.016045801,0.0000719707],"about_ca_topic_score_codex":0.011840108,"about_ca_topic_score_gemma":0.0122291725,"teacher_disagreement_score":0.011840108,"about_ca_system_score_codex":0.00088678324,"about_ca_system_score_gemma":0.00087476266,"threshold_uncertainty_score":0.023542404},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016714558,0.0000852327,0.9818124,0.00009643422,0.000025218005,0.000018237548,0.000058731053,0.00044089393,0.0007482498],"genre_scores_gemma":[0.82294285,0.00023023302,0.17425384,0.00009244241,0.00004496201,0.00005300533,0.00019515841,0.00009513166,0.0020924367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969876,0.00010067085,0.000023869181,0.0000756878,0.00007159419,0.000029465595],"domain_scores_gemma":[0.9988877,0.0007172342,0.00010149797,0.00011190947,0.00014272507,0.000038906415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011617396,0.00042674103,0.000558935,0.00063051924,0.00021849711,0.0006915228,0.00097463926,0.00049261627,0.0016057771],"category_scores_gemma":[0.003662372,0.00029579943,0.0006859809,0.0010297651,0.00055119605,0.0014209226,0.0006876542,0.0010573545,0.00034543872],"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.00013788053,0.000049001515,0.0011401862,0.00004552853,0.00003699601,0.00007602826,0.00006296409,0.86426663,0.0032179712,0.036487766,0.0008967669,0.09358231],"study_design_scores_gemma":[9.857966e-7,0.0000032517005,0.000021008727,9.631545e-7,0.0000014069979,0.0000034551872,0.0000014053256,0.99748564,0.00021806062,0.0021649566,0.00009733719,0.0000014748671],"about_ca_topic_score_codex":0.008646581,"about_ca_topic_score_gemma":0.0059329304,"teacher_disagreement_score":0.008646581,"about_ca_system_score_codex":0.00069285,"about_ca_system_score_gemma":0.0008260428,"threshold_uncertainty_score":0.017192483},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03529721,0.00046227087,0.959244,0.00046210823,0.000064233194,0.000095079005,0.000054995086,0.00029785148,0.0040222835],"genre_scores_gemma":[0.72933733,0.00038853695,0.26638323,0.0003049461,0.000056512847,0.0002057719,0.00011346314,0.000029283772,0.003180951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997416,0.00007757355,0.000017685366,0.00005441308,0.000086613196,0.000022140066],"domain_scores_gemma":[0.9994618,0.00029765826,0.000054862165,0.000027970284,0.00013544514,0.00002231896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006771642,0.00042185167,0.0003890909,0.0008515826,0.00024714522,0.00067821797,0.00095537864,0.00053678825,0.00081085623],"category_scores_gemma":[0.001347565,0.0001854707,0.00046020123,0.00050426094,0.0005184737,0.00045040314,0.00040128166,0.00057290524,0.0001425986],"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.000049692844,0.00015389376,0.0030369125,0.0001284948,0.00011841538,0.00012638449,0.00011071284,0.83117396,0.0102466345,0.01803135,0.00090370013,0.1359198],"study_design_scores_gemma":[0.000002500895,0.000023576815,0.00021554786,0.0000042128713,0.000005703941,0.00002066186,0.0000063252824,0.9960359,0.0007313777,0.0024979431,0.00045300607,0.0000033221836],"about_ca_topic_score_codex":0.0025556097,"about_ca_topic_score_gemma":0.002099632,"teacher_disagreement_score":0.0025556097,"about_ca_system_score_codex":0.00070100866,"about_ca_system_score_gemma":0.000722511,"threshold_uncertainty_score":0.0050861835},"labels":[],"label_agreement":null}]}