{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":49,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":49,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"d16bd10738f3","filters":{"venue":"Journal of Computer Science and Technology"}},"results":[{"id":"W2071416419","doi":"10.1007/s11390-008-9115-1","title":"Clustering Text Data Streams","year":2008,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Simon Fraser University; Chinese University of Hong Kong; University of Hong Kong; Sun Yat-sen University","keywords":"Computer science; Cluster analysis; Data mining; Data stream mining; Data stream clustering; Smoothing; Document clustering; Fuzzy clustering; Semantics (computer science); Context (archaeology); Information retrieval; CURE data clustering algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03598818950116101,"gpt":0.2789750984262266,"spread":0.2429869089250656,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00100642,0.0001143577,0.0002288988,0.0009693207,0.000244663,0.000151062,0.006268324,0.00007188895,0.000001153525],"category_scores_gemma":[0.0001384584,0.00009210185,0.00001685018,0.001611306,0.0009135813,0.002421502,0.004355715,0.0002591946,0.000003741926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003699298,"about_ca_system_score_gemma":0.000381945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004105707,"about_ca_topic_score_gemma":0.000001596516,"domain_scores_codex":[0.9984441,0.00001612282,0.0003494718,0.0003922626,0.0005034505,0.0002946364],"domain_scores_gemma":[0.9978046,0.00004904453,0.0002853108,0.001332598,0.0004229986,0.0001054354],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002188936,0.00005157555,0.001953748,0.000004183909,0.0000101737,0.0002941315,0.0001561203,0.000005431815,0.00132763,0.005605311,0.005541744,0.9850478],"study_design_scores_gemma":[0.001394882,0.003043954,0.007718349,0.0003052738,0.00002460721,0.05636745,0.00007683987,0.8330725,0.02548843,0.02166189,0.04995553,0.0008902934],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07902014,0.000182051,0.9171684,0.002893626,0.0003628439,0.00004623554,0.000001798171,0.0001783689,0.0001465336],"genre_scores_gemma":[0.4818583,0.0001135073,0.5178334,0.000125687,0.00006089588,3.999756e-7,2.502643e-7,0.000002962461,0.000004713998],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9841574,"threshold_uncertainty_score":0.9991083,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117172400","doi":"10.1007/s11390-015-1511-8","title":"Survey of Large-Scale Data Management Systems for Big Data Applications","year":2015,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Scalability; Data science; Data management; Big data; Workload; Consistency (knowledge bases); Scale (ratio); Database; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.08446876235174079,"gpt":0.3063316781064961,"spread":0.2218629157547554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.006221338,0.00009569003,0.0002623959,0.0006690928,0.0001436437,0.0001576667,0.00774498,0.00004797248,4.59437e-8],"category_scores_gemma":[0.00007565404,0.00007521557,0.00001413168,0.001784248,0.0002763828,0.0001676259,0.00687659,0.00011038,0.000001024368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002885819,"about_ca_system_score_gemma":0.0002037696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001426658,"about_ca_topic_score_gemma":0.000007861099,"domain_scores_codex":[0.9982238,0.00003948315,0.0004629946,0.000471327,0.0005349124,0.000267451],"domain_scores_gemma":[0.9962671,0.00008671283,0.0004353031,0.002181555,0.0009184929,0.0001107762],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001151437,0.0003597921,0.003181081,0.0001244782,0.0001066355,0.00001624535,0.0002099492,0.001955138,0.0000274336,0.02491278,0.0255068,0.9435881],"study_design_scores_gemma":[0.0006567909,0.0002597955,0.001750308,0.00005315544,0.00002017924,0.00009947529,0.0001208192,0.8989484,0.00002612428,0.001322495,0.09662815,0.0001142654],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0096778,0.001118598,0.9863465,0.001420729,0.001039556,0.0002622572,0.00001923834,0.00004076501,0.00007457461],"genre_scores_gemma":[0.791843,0.00008252711,0.2075187,0.0001251619,0.000356949,0.000007624516,0.000008525182,0.000008212751,0.00004926906],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9434739,"threshold_uncertainty_score":0.9976236,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2912349718","doi":"10.1007/s11390-019-1896-x","title":"Controllability and Its Applications to Biological Networks","year":2019,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Controllability; Biological network; Computer science; Complex network; Biological data; Network controllability; Systems biology; Complex system; Distributed computing; Artificial intelligence; Bioinformatics; Centrality; Mathematics; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.005921843677497686,"gpt":0.2338305821112091,"spread":0.2279087384337114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004981296,0.00006237493,0.0001553049,0.0001568645,0.00006157401,0.00002205258,0.0002618343,0.00009677305,0.000001762181],"category_scores_gemma":[0.00003575058,0.00004651352,0.0000236818,0.0004752926,0.0002044756,0.000005868632,0.0002364804,0.00007471041,0.000001632849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008289051,"about_ca_system_score_gemma":0.00005953099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.409993e-7,"about_ca_topic_score_gemma":6.442914e-7,"domain_scores_codex":[0.9993679,0.0000150193,0.000166901,0.0002104859,0.00009403357,0.0001456419],"domain_scores_gemma":[0.9992766,0.00001201277,0.00009304295,0.0001718376,0.0003604116,0.00008607246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006894914,0.00009520128,0.1097308,0.00001053108,0.000103906,0.00000413458,0.00002596983,0.004042487,0.6372048,0.003675001,0.0003945247,0.2446437],"study_design_scores_gemma":[0.006954386,0.01740872,0.2111718,0.0001253315,0.0002498421,0.003644605,0.0003519734,0.2309809,0.2190553,0.01211392,0.2958268,0.002116474],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9510153,0.00143811,0.04637929,0.0009700565,0.000063835,0.0001134816,2.782316e-7,0.000004475964,0.00001519883],"genre_scores_gemma":[0.9965735,0.0001572542,0.002926345,0.0002167615,0.0001133919,0.000002773036,2.226734e-7,0.000002039156,0.000007674616],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4181495,"threshold_uncertainty_score":0.1896766,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2989546622","doi":"10.1007/s11390-020-0193-z","title":"Differential Privacy via a Truncated and Normalized Laplace Mechanism","year":2022,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Differential privacy; Laplace distribution; Normalization (sociology); Laplace transform; Computer science; Range (aeronautics); Scaling; Noise (video); Mathematical optimization; Theoretical computer science; Data mining; Mathematics; Artificial intelligence; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01198535003932838,"gpt":0.2406716962186188,"spread":0.2286863461792904,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001127381,0.000166593,0.0003320337,0.001432235,0.000610667,0.0002353367,0.01932741,0.00009211185,0.00001129185],"category_scores_gemma":[0.001214977,0.0001440442,0.00003367154,0.002356479,0.0006943279,0.00108238,0.08986958,0.0006626291,0.000001132336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001057918,"about_ca_system_score_gemma":0.0002535502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004161359,"about_ca_topic_score_gemma":5.201057e-7,"domain_scores_codex":[0.9978406,0.00006241263,0.000421223,0.0004707772,0.0007765302,0.0004284011],"domain_scores_gemma":[0.9969569,0.00007719306,0.0004194372,0.002123715,0.0003155519,0.0001071409],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007703021,0.0004093978,0.001840786,0.00003890288,0.0001155785,0.0006222657,0.0006334037,0.00001694266,0.1204511,0.1495508,0.01790942,0.7083344],"study_design_scores_gemma":[0.001408037,0.001414018,0.0006645281,0.00002206839,0.0000163044,0.005976737,0.00004722315,0.3552908,0.02496124,0.6063212,0.003567366,0.0003104623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3770968,0.0001632332,0.5960538,0.02574746,0.0006263655,0.00009227487,0.000001902341,0.000208337,0.000009855929],"genre_scores_gemma":[0.7591777,0.00006278414,0.2405288,0.0001882157,0.00002733316,0.000005502738,2.759302e-7,0.000005340907,0.000004035397],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7080239,"threshold_uncertainty_score":0.9859785,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3034810086","doi":"10.1007/s11390-020-0405-6","title":"Two-Stream Temporal Convolutional Networks for Skeleton-Based Human Action Recognition","year":2020,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology); Skeleton (computer programming); Feature (linguistics); Leverage (statistics); Convolutional neural network; Feature vector; Feature learning; Representation (politics); RGB color model; Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.0384129619373278,"gpt":0.2850209255017652,"spread":0.2466079635644374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005006007,0.0001047433,0.000183182,0.0005063683,0.0003545391,0.000174084,0.0005318173,0.00008368606,0.000005572798],"category_scores_gemma":[0.00004779833,0.00009463845,0.00005852768,0.0009093712,0.000297213,0.0009110168,0.00009077504,0.0002339549,0.000003658591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004981855,"about_ca_system_score_gemma":0.0002464741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001598802,"about_ca_topic_score_gemma":0.000001768139,"domain_scores_codex":[0.9988495,0.00002262674,0.0003413038,0.0002669354,0.0002968115,0.0002228598],"domain_scores_gemma":[0.9984322,0.00005425619,0.0003639995,0.0001159655,0.0009024956,0.000131038],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004521095,0.0001638905,0.00121197,0.00003177696,0.00003220083,0.00002541378,0.00009601139,0.0007188796,0.01168253,0.01465254,0.002395122,0.9689445],"study_design_scores_gemma":[0.002506302,0.002537407,0.001256624,0.0000794562,0.00002474421,0.0002435824,0.00003970845,0.9366352,0.02069201,0.03154825,0.004136355,0.0003003668],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1597555,0.0000377679,0.8336591,0.005949481,0.0003819886,0.0001069678,0.000001385199,0.00008032554,0.0000274584],"genre_scores_gemma":[0.9261118,0.000006395174,0.07240305,0.001095081,0.000369983,0.000004831943,0.000002888345,0.000004018917,0.0000020157],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9686441,"threshold_uncertainty_score":0.3859244,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066687109","doi":"10.1007/s11390-007-9051-5","title":"Developing Project Duration Models in Software Engineering","year":2007,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Software Engineering Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; Bell (Canada); École de Technologie Supérieure","funders":"","keywords":"Duration (music); Computer science; Benchmarking; Software; Software engineering; Theory of computation; Variable (mathematics); Software project management; Function point; Range (aeronautics); Industrial engineering; Operations research; Systems engineering; Software development; Software construction; Operating system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02155879879059765,"gpt":0.2768149418140313,"spread":0.2552561430234336,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002318507,0.00008255056,0.0001474545,0.002576457,0.00005995925,0.0001171143,0.001020956,0.00007097291,1.109347e-7],"category_scores_gemma":[0.000675125,0.00007285435,0.00001441164,0.003302173,0.0001072044,0.001231426,0.00037262,0.0002952109,6.078262e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001767772,"about_ca_system_score_gemma":0.0004782167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002543541,"about_ca_topic_score_gemma":0.000001868428,"domain_scores_codex":[0.9986448,0.000005976903,0.000344168,0.0001956812,0.0004607064,0.0003486929],"domain_scores_gemma":[0.9989775,0.0002061462,0.000100818,0.0001920197,0.0004706605,0.00005282914],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001094362,0.00007169675,0.03655053,0.00007159929,0.00001948798,0.0006990492,0.001439193,0.01063877,0.006117255,0.1767252,0.0001003423,0.767556],"study_design_scores_gemma":[0.0009291562,0.0005868486,0.0632506,0.0003555949,0.000002794978,0.0030281,0.00004862788,0.8870496,0.02615071,0.01722506,0.0009047558,0.0004681319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2867781,0.000100758,0.7122882,0.0004579083,0.00025213,0.00004899639,2.664763e-8,0.00007194598,0.000001967886],"genre_scores_gemma":[0.5354311,0.00001306865,0.464502,0.00002170304,0.00002813198,6.865996e-7,1.392224e-8,0.000002499272,6.923199e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8764108,"threshold_uncertainty_score":0.2970914,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137042120","doi":"10.1007/s11390-008-9152-9","title":"New Information Distance Measure and Its Application in Question Answering System","year":2008,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Question answering; Measure (data warehouse); Construct (python library); Ranking (information retrieval); Theory of computation; Information retrieval; Theoretical computer science; Algorithm; Data mining; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.007605724138654834,"gpt":0.2149095306185003,"spread":0.2073038064798454,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001030219,0.00009491944,0.0001944962,0.00078153,0.0001493444,0.0001009904,0.0007327016,0.00007672588,8.489349e-8],"category_scores_gemma":[0.00006609865,0.00008258653,0.00001441408,0.001646225,0.0001642094,0.002357366,0.0003007428,0.0002024238,0.000001456797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001434165,"about_ca_system_score_gemma":0.000262352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009939788,"about_ca_topic_score_gemma":0.000004948796,"domain_scores_codex":[0.9987609,0.00002481366,0.000401896,0.0002056649,0.0004144927,0.0001922471],"domain_scores_gemma":[0.9988419,0.00003100692,0.0002759423,0.0002183545,0.0005400529,0.00009273126],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006612237,0.00002814732,0.009243601,0.00004165222,0.000003948479,0.00002828509,0.0007181729,0.0005294476,0.001097604,0.1517832,0.00003289868,0.8364864],"study_design_scores_gemma":[0.0006967325,0.0003873292,0.04921521,0.0001527218,0.000003531117,0.003308285,0.00005025147,0.9344131,0.001727646,0.008767443,0.001062003,0.0002158083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1831612,0.0003629887,0.8146088,0.001437557,0.0002324668,0.0001078036,1.298597e-7,0.00006597146,0.00002317019],"genre_scores_gemma":[0.8986428,0.00005514123,0.1012177,0.00003478732,0.00004546217,0.0000018054,5.64264e-8,0.000001467612,7.240462e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9338836,"threshold_uncertainty_score":0.3367781,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102495876","doi":"10.1007/s11390-013-1411-8","title":"TuLP: A Family of Lightweight Message Authentication Codes for Body Sensor Networks","year":2014,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China; European Commission","keywords":"Computer science; Wireless sensor network; Message authentication code; Computer network; Authentication (law); Block (permutation group theory); Block cipher; Computer security; Cryptography; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.007124124298582951,"gpt":0.2330176055660911,"spread":0.2258934812675081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001587571,0.0001367424,0.0003846533,0.0007457146,0.0001757327,0.0001349402,0.001688036,0.0001545937,6.040407e-7],"category_scores_gemma":[0.0001323498,0.0001107461,0.00006555313,0.001316809,0.0007000357,0.0005364238,0.0003337825,0.0002363419,8.986196e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003217508,"about_ca_system_score_gemma":0.0001184264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001184389,"about_ca_topic_score_gemma":5.683657e-7,"domain_scores_codex":[0.9983151,0.00004309083,0.0005423005,0.000307146,0.0004411595,0.0003511986],"domain_scores_gemma":[0.997397,0.0002580208,0.0006028944,0.0004885655,0.001152549,0.0001009685],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003737529,0.0002889281,0.00131282,0.00006634396,0.00008574045,0.00002008157,0.0009229274,0.001819726,0.04037135,0.5344975,0.002102262,0.4184749],"study_design_scores_gemma":[0.000554635,0.0007758928,0.00139532,0.00009065888,0.00001958212,0.0002506725,0.00002293854,0.9635526,0.01143775,0.01832415,0.003417796,0.0001580238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1861904,0.0003415965,0.8104734,0.002140474,0.000647644,0.0001136381,4.136695e-7,0.00004874412,0.0000436626],"genre_scores_gemma":[0.8180706,0.00007478493,0.1815013,0.0001765386,0.0001639784,0.000002316925,1.435979e-7,0.00000514777,0.00000523927],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9617329,"threshold_uncertainty_score":0.4516095,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980666253","doi":"10.1007/s11390-008-9148-5","title":"Clustering by Pattern Similarity","year":2008,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Similarity (geometry); Cluster analysis; Computer science; Closeness; Set (abstract data type); Data mining; Euclidean distance; Artificial intelligence; Task (project management); Range (aeronautics); Pattern recognition (psychology); Mathematics; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.009573061431451745,"gpt":0.2414148642170822,"spread":0.2318418027856305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002846628,0.00007078657,0.0001809098,0.0003146195,0.0001816507,0.000032408,0.0004108103,0.00002657297,0.00001399848],"category_scores_gemma":[0.000003391793,0.00005850603,0.00003531372,0.0006034129,0.0004404351,0.0002042914,0.0002356872,0.0001917141,9.049791e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001632307,"about_ca_system_score_gemma":0.00006542374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009084445,"about_ca_topic_score_gemma":7.424249e-7,"domain_scores_codex":[0.9992755,0.000008942791,0.0002185987,0.000124552,0.0002041147,0.0001682938],"domain_scores_gemma":[0.9993523,0.00001597217,0.0001755979,0.0001425635,0.0002600979,0.0000534933],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002717926,0.0001011599,0.1821858,0.000002685758,0.00004140759,0.00002515354,0.000115114,0.0000378959,0.00414514,0.0009129986,0.01154079,0.8008892],"study_design_scores_gemma":[0.003866145,0.00337051,0.04849117,0.0003421204,0.000203016,0.003664735,0.0003558914,0.6009355,0.1174479,0.1067482,0.1125064,0.002068374],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4366033,0.00007043935,0.5624089,0.0007078513,0.00005634695,0.00002001014,4.71053e-7,0.00001936436,0.0001132736],"genre_scores_gemma":[0.9882192,0.00001778553,0.01154493,0.00008190026,0.0001259721,5.738162e-7,1.605427e-7,0.000002814171,0.000006663156],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7988208,"threshold_uncertainty_score":0.2385807,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3096975346","doi":"10.1007/s11390-020-9668-1","title":"Machine Learning Techniques for Software Maintainability Prediction: Accuracy Analysis","year":2020,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Software Engineering Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Maintainability; Machine learning; Computer science; Artificial intelligence; Support vector machine; Software; Artificial neural network; Data mining; Reliability engineering; Software engineering; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01323511758263632,"gpt":0.2744727030220768,"spread":0.2612375854394404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001510828,0.0001085299,0.0002901138,0.001133055,0.0002241492,0.0001972253,0.001582114,0.00008094852,0.000001745625],"category_scores_gemma":[0.003917453,0.00009054134,0.0000828542,0.004745614,0.0003368762,0.0007917524,0.0006505935,0.000420385,5.529122e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008279541,"about_ca_system_score_gemma":0.0002823304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001534339,"about_ca_topic_score_gemma":2.670329e-7,"domain_scores_codex":[0.998489,0.00002586436,0.0003413506,0.0003500731,0.0004906883,0.0003030271],"domain_scores_gemma":[0.9976658,0.0004896565,0.0001958732,0.0002837811,0.001195373,0.0001694673],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000240525,0.000069973,0.1909194,0.00007356696,0.0001903042,0.00006306747,0.0005350579,0.001796537,0.001524232,0.007852742,0.0003150476,0.796636],"study_design_scores_gemma":[0.0006556772,0.003583353,0.02147697,0.00003938201,0.00009233136,0.0004289974,0.00003879,0.9264,0.01521006,0.0110621,0.02068168,0.0003306211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02807974,0.0002062373,0.961803,0.009324301,0.0001074191,0.0001304764,0.000001370328,0.0003456971,0.000001819843],"genre_scores_gemma":[0.5796585,0.00002791387,0.4200842,0.0001350786,0.00008359348,0.000005149545,2.129322e-7,0.00000361059,0.000001670518],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9246035,"threshold_uncertainty_score":0.468984,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004162621","doi":"10.1007/s11390-014-1478-x","title":"Allocating Bandwidth in Datacenter Networks: A Survey","year":2014,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cloud computing; Bandwidth (computing); Predictability; Distributed computing; Virtual machine; Bandwidth allocation; Computer network; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.009527116322786296,"gpt":0.2288021865845722,"spread":0.2192750702617859,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004458674,0.0001032665,0.0002332906,0.0009018073,0.000131904,0.0002150969,0.001883528,0.00005433559,3.652201e-7],"category_scores_gemma":[0.0001829403,0.00007971635,0.00002137999,0.002065448,0.0002835213,0.000141361,0.001173638,0.0002785867,0.00000126437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003911058,"about_ca_system_score_gemma":0.00007519066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000113616,"about_ca_topic_score_gemma":0.00001383495,"domain_scores_codex":[0.9985313,0.00008623386,0.0003850753,0.0002976755,0.0003613326,0.0003383211],"domain_scores_gemma":[0.9988236,0.0001392488,0.0002510995,0.0004054294,0.0003007736,0.00007978345],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000542072,0.00009575996,0.05996092,0.000009060717,0.00001252355,0.00003899272,0.0002160976,0.01149997,0.00007844513,0.01628444,0.000645032,0.9111533],"study_design_scores_gemma":[0.0004161132,0.0002762552,0.03892115,0.00007503777,0.000001807141,0.0001778918,0.00001051535,0.9564044,0.00005950233,0.001445608,0.002104093,0.0001076107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3558289,0.0001102684,0.6415449,0.001981734,0.0004024755,0.00003635854,4.274823e-8,0.00003147816,0.00006385746],"genre_scores_gemma":[0.9618057,0.00001196671,0.03770918,0.0003697293,0.00009300753,4.805352e-7,5.953808e-8,0.000003039421,0.000006865416],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9449044,"threshold_uncertainty_score":0.3500094,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016818970","doi":"10.1007/s11390-013-1324-6","title":"Formal Reasoning About Finite-State Discrete-Time Markov Chains in HOL","year":2013,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Markov chain; Theoretical computer science; Markov model; Markov property; Markov process; Variable-order Markov model; Formal verification; HOL; Probabilistic logic; Algorithm; Formal methods; Continuous-time Markov chain; Mathematics; Artificial intelligence; Machine learning; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.007466908350015211,"gpt":0.2520141899348308,"spread":0.2445472815848156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002203257,0.0001242989,0.0002484955,0.001301156,0.0001662999,0.0002877387,0.001802376,0.00008559947,0.000004105442],"category_scores_gemma":[0.0003064834,0.0000992176,0.00003132841,0.002076129,0.0005419878,0.003533508,0.0006753877,0.0003756295,0.0000156971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007365608,"about_ca_system_score_gemma":0.0001933269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006602358,"about_ca_topic_score_gemma":0.000001007959,"domain_scores_codex":[0.9982944,0.00005030914,0.0004871288,0.0002709398,0.0004296442,0.0004676154],"domain_scores_gemma":[0.9985511,0.00007796986,0.0003811257,0.0003969735,0.000482117,0.0001107478],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005895511,0.00004514427,0.001876162,0.000009494186,0.000006565292,0.0000528136,0.0006197783,0.0002903327,0.003628806,0.03780293,0.0001380006,0.9555241],"study_design_scores_gemma":[0.0003572882,0.0004771549,0.01640853,0.00009824106,0.00000210767,0.0006627041,0.00002555746,0.9643818,0.004549479,0.01238742,0.0004722355,0.0001774905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2872583,0.00009273518,0.7102475,0.001814692,0.0002916387,0.0001020197,1.996042e-7,0.00004397322,0.0001489199],"genre_scores_gemma":[0.4593152,0.00003650045,0.5404476,0.0001423806,0.00003139153,0.000003819474,4.650921e-8,0.000003157467,0.00001992126],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9640915,"threshold_uncertainty_score":0.4045976,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086582257","doi":"10.1007/bf02962204","title":"Sequential combination methods for data clustering analysis","year":2002,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Cluster analysis; Computer science; CURE data clustering algorithm; Correlation clustering; Canopy clustering algorithm; Data stream clustering; Constrained clustering; Fuzzy clustering; Data mining; Clustering high-dimensional data; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0811634130080792,"gpt":0.4114414635140861,"spread":0.3302780505060069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002716228,0.0000921247,0.000268607,0.00195248,0.0002434133,0.0002757224,0.003426891,0.00006392233,0.000002128909],"category_scores_gemma":[0.0002754952,0.00007915496,0.00004154492,0.003951878,0.0003930979,0.001670546,0.002235003,0.0002046991,8.812355e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006937212,"about_ca_system_score_gemma":0.00007849855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000148592,"about_ca_topic_score_gemma":0.000001230998,"domain_scores_codex":[0.9984809,0.00004910745,0.0003499289,0.0003919813,0.0004116127,0.0003164893],"domain_scores_gemma":[0.9978072,0.0001565202,0.0002618177,0.0007806665,0.0008977915,0.00009601707],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001816608,0.00003460798,0.0000609741,0.00000647301,0.00005705427,0.000009322101,0.00008321513,0.0004549177,0.00173938,0.002885194,0.00007375263,0.9945933],"study_design_scores_gemma":[0.0003546798,0.0003046487,0.00008978865,0.000008671695,0.00002756807,0.0002515214,0.00000726029,0.9896564,0.001577338,0.005577754,0.002060762,0.00008354622],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00219037,0.0002826017,0.993138,0.003822654,0.0004115647,0.00008853243,7.640435e-7,0.00004824037,0.00001732031],"genre_scores_gemma":[0.1151171,0.00005582459,0.8846905,0.00006153928,0.00005544231,0.000001932162,2.817268e-7,0.000003377882,0.00001398086],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9945098,"threshold_uncertainty_score":0.6368073,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985018844","doi":"10.1007/bf02944912","title":"An orientation update message filtering algorithm in collaborative virtual environments","year":2004,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Killam Trusts","keywords":"Computer science; Orientation (vector space); Thresholding; Dead reckoning; Focus (optics); Rotation (mathematics); Theory of computation; Algorithm; Variable (mathematics); Collaborative filtering; Computer vision; Artificial intelligence; Telecommunications; Global Positioning System; Image (mathematics); Mathematics; Information retrieval","retraction":null,"screen_n_in":null,"score":{"opus":0.004342605606649813,"gpt":0.2280972018949201,"spread":0.2237545962882702,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009188858,0.0001136893,0.0001810385,0.0009572775,0.0001255919,0.0001820601,0.001222709,0.00005170186,0.000001693728],"category_scores_gemma":[0.00001131091,0.0001017437,0.00001488446,0.002106385,0.0003234377,0.001782778,0.0004248841,0.0001848088,0.000003691254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002327785,"about_ca_system_score_gemma":0.0002113101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002502826,"about_ca_topic_score_gemma":0.000003273291,"domain_scores_codex":[0.9985094,0.00003579408,0.0003505204,0.0003349401,0.000489093,0.0002802183],"domain_scores_gemma":[0.9991726,0.00001481277,0.0002641103,0.0003309723,0.000122615,0.0000948637],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006178203,0.0001609826,0.0003868348,0.00000258666,0.00001235141,0.0003355945,0.0006175678,0.01893842,0.004632247,0.0469367,0.00004039317,0.9279302],"study_design_scores_gemma":[0.008079154,0.008690739,0.01392852,0.000307722,0.0000307078,0.0008989232,0.0008856208,0.7942746,0.0943848,0.06524985,0.01215933,0.001110022],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2134753,0.00005926607,0.7850015,0.0009990903,0.000333645,0.00009865259,3.650524e-7,0.00002208933,0.00001006415],"genre_scores_gemma":[0.7117133,0.00009159551,0.2878745,0.0002685376,0.00004210211,0.000004133467,2.473189e-7,0.000003385121,0.000002171585],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9268201,"threshold_uncertainty_score":0.4148986,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2460852158","doi":"10.1007/s11390-016-1654-2","title":"Mining Object Similarity for Predicting Next Locations","year":2016,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Computer science; Similarity (geometry); Markov chain; Trajectory; Object (grammar); Locality; Data mining; Markov model; Sequence (biology); Hidden Markov model; Artificial intelligence; Theory of computation; Machine learning; Algorithm; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.02165826792686127,"gpt":0.26099372336253,"spread":0.2393354554356687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001147887,0.00007281879,0.0001362971,0.0006646584,0.0002442407,0.0002451504,0.001474117,0.00004028667,7.130938e-7],"category_scores_gemma":[0.0001861104,0.00004684034,0.00002629387,0.0008979536,0.000339109,0.002251463,0.0005749604,0.00006985162,0.00000109295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003075338,"about_ca_system_score_gemma":0.0001642847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.098369e-7,"about_ca_topic_score_gemma":9.097701e-7,"domain_scores_codex":[0.999,0.000009034532,0.000253632,0.0002272503,0.0002661842,0.0002438747],"domain_scores_gemma":[0.9988289,0.0001193869,0.0002212617,0.000285151,0.0004822203,0.00006301372],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000142195,0.0000225359,0.001538714,0.000004932887,0.000009529389,0.000006742077,0.00006565409,0.000003366468,0.001438142,0.03460087,0.0009311671,0.9613769],"study_design_scores_gemma":[0.004185718,0.003877719,0.01081911,0.0006138877,0.00006858625,0.001321587,0.0003215676,0.7206532,0.02690845,0.1432189,0.08714131,0.0008699253],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0403089,0.00007819936,0.946707,0.01217266,0.000554357,0.0000737744,7.767736e-7,0.00005665862,0.00004775793],"genre_scores_gemma":[0.5908074,0.00003771691,0.4087984,0.0001934819,0.0001377504,0.000002595118,6.527259e-8,0.000002502558,0.00002014297],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.960507,"threshold_uncertainty_score":0.2739301,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1500816613","doi":"10.1007/s11390-010-9361-x","title":"A New Approach for Multi-Document Update Summarization","year":2010,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Automatic summarization; Computer science; NIST; Multi-document summarization; Information retrieval; Set (abstract data type); The Internet; Data mining; World Wide Web; Natural language processing","retraction":null,"screen_n_in":null,"score":{"opus":0.01378106586322135,"gpt":0.268831526655241,"spread":0.2550504607920197,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008096187,0.00008584068,0.0001550052,0.000537667,0.0002269061,0.000264797,0.001508134,0.00007891245,0.000001817731],"category_scores_gemma":[0.0000613536,0.00006325079,0.00002657733,0.000810704,0.0001830405,0.001211646,0.0005727452,0.0002230784,0.000001442781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001513049,"about_ca_system_score_gemma":0.0002735744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002408951,"about_ca_topic_score_gemma":0.000001119471,"domain_scores_codex":[0.9989724,0.000007384421,0.0002516379,0.0002634132,0.0002932966,0.0002118378],"domain_scores_gemma":[0.9987915,0.00002090287,0.0002273902,0.000344754,0.000491439,0.0001240145],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004042037,0.00005021353,0.0002164145,0.000004952407,0.000006165648,0.000004224137,0.00006280894,0.00003186037,0.00625274,0.111801,0.001693774,0.8798718],"study_design_scores_gemma":[0.001032201,0.0003040736,0.0004945566,0.00001512148,0.000007119172,0.000496357,0.000008535436,0.9422421,0.008825934,0.01701772,0.02939829,0.0001579782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003836816,0.00005517455,0.9933656,0.001808479,0.0007743704,0.0001025002,4.941355e-7,0.00003855776,0.00001801972],"genre_scores_gemma":[0.04447594,0.00002086418,0.9552131,0.0001309297,0.0001379932,0.000001789527,4.791229e-7,0.000002795467,0.00001605676],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9422103,"threshold_uncertainty_score":0.2802513,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2914522519","doi":"10.1007/s11390-019-1899-7","title":"ROCO: Using a Solid State Drive Cache to Improve the Performance of a Host-Aware Shingled Magnetic Recording Drive","year":2019,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Cache; Operating system; Parallel computing; Host (biology)","retraction":null,"screen_n_in":null,"score":{"opus":0.008948873919923585,"gpt":0.2474427418268537,"spread":0.2384938679069302,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009745318,0.0001829232,0.0003993181,0.001069839,0.0002217179,0.0001534678,0.003377108,0.00009458943,0.000001239665],"category_scores_gemma":[0.0001443164,0.0001255175,0.00004373673,0.002499395,0.0007333689,0.001571375,0.00230886,0.0004842294,0.000004662904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001265539,"about_ca_system_score_gemma":0.0003488077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005153718,"about_ca_topic_score_gemma":0.00000243659,"domain_scores_codex":[0.9980315,0.00002747328,0.0005149611,0.0004312041,0.0005275247,0.0004673163],"domain_scores_gemma":[0.9975301,0.0001102612,0.0005903641,0.0008495099,0.0008385944,0.00008117625],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002926468,0.00006686898,0.007579821,0.00004593696,0.00003413814,0.00006196382,0.001327061,0.002357456,0.2892858,0.004445759,0.00006959021,0.6946964],"study_design_scores_gemma":[0.0009791153,0.006156898,0.002447876,0.0003925122,0.00002415326,0.001386507,0.000685996,0.7416484,0.2373254,0.007695121,0.0007429137,0.0005151411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6399041,0.0001075323,0.3576952,0.001617702,0.0004250752,0.0001851012,0.000001262604,0.00005974713,0.000004220919],"genre_scores_gemma":[0.8227348,0.00004604643,0.1770418,0.0001381231,0.00002421737,0.000002770666,3.715756e-8,0.00000609278,0.000006152753],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7392909,"threshold_uncertainty_score":0.6275563,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2593821117","doi":"10.1007/s11390-017-1727-x","title":"A New Feistel-Type White-Box Encryption Scheme","year":2017,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Statistics Canada","funders":"","keywords":"White box; Computer science; Block cipher; S-box; Encryption; Cryptanalysis; Linear cryptanalysis; Cryptography; Key schedule; Context (archaeology); Theoretical computer science; Symmetric-key algorithm; Block size; Algorithm; Differential cryptanalysis; Key (lock); Computer network; Computer security; Public-key cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.01771569343324264,"gpt":0.2950580230940829,"spread":0.2773423296608403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007944165,0.00009093881,0.0001714588,0.0007778496,0.0006966717,0.000715905,0.002162941,0.00006332845,0.000008782514],"category_scores_gemma":[0.00009323062,0.00007474477,0.00003523062,0.0008756436,0.0004598515,0.001612796,0.0006828642,0.0002031877,0.000004118194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002780972,"about_ca_system_score_gemma":0.000430123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009781218,"about_ca_topic_score_gemma":0.000008228119,"domain_scores_codex":[0.9988207,0.00001037777,0.0002867772,0.0002277268,0.0004068413,0.0002476021],"domain_scores_gemma":[0.9981206,0.00001627807,0.0004317447,0.0005989666,0.0007044722,0.0001279224],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006057377,0.00004444232,0.01859618,0.000005465321,0.00001606101,0.00004564188,0.0005008833,0.000002529684,0.004830529,0.3149419,0.002255613,0.6587546],"study_design_scores_gemma":[0.006054738,0.006052899,0.2357912,0.0003002592,0.00005900504,0.007140389,0.0003863676,0.09657215,0.02035272,0.5262896,0.09961604,0.001384591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2340128,0.0001165509,0.7557188,0.009066625,0.0008633204,0.00005147813,1.569131e-7,0.00003456071,0.0001357235],"genre_scores_gemma":[0.6576281,0.00005520813,0.3421,0.0001088581,0.00009555135,3.085079e-7,4.535196e-8,0.000001763297,0.00001016078],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.65737,"threshold_uncertainty_score":0.6903489,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998214657","doi":"10.1007/bf02944790","title":"Provisioning QoS guarantee by multipath routing and reservation in Ad hoc networks","year":2004,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Computer science; Quality of service; Multipath routing; Wireless ad hoc network; Bandwidth (computing); Mobile ad hoc network; Optimized Link State Routing Protocol; Network packet; Distributed computing; Routing protocol; Dynamic Source Routing; Wireless; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.006781307548456975,"gpt":0.2292257147754666,"spread":0.2224444072270096,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001570289,0.0001196363,0.000235204,0.0005970123,0.0001988451,0.0002413027,0.001035057,0.0001218212,1.929797e-7],"category_scores_gemma":[0.00009541468,0.00009989119,0.00001800596,0.001897385,0.0003730355,0.001369116,0.0006300841,0.0004650105,3.549143e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009524848,"about_ca_system_score_gemma":0.0001968394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004628438,"about_ca_topic_score_gemma":0.000009801537,"domain_scores_codex":[0.9984401,0.00002650673,0.0004438644,0.0003472767,0.0003683924,0.0003737886],"domain_scores_gemma":[0.998954,0.0000657791,0.0003294092,0.0002727435,0.000310068,0.00006799685],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001061036,0.0000712377,0.005642401,0.000006019111,0.000006210393,0.0001058687,0.0007152447,0.009981776,0.001680827,0.01564233,0.000151491,0.965986],"study_design_scores_gemma":[0.001407815,0.0007977023,0.004827712,0.000298438,0.00000338291,0.0007148173,0.00006061959,0.9793236,0.0008382252,0.01079578,0.0007351273,0.000196833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4427509,0.001522889,0.5531526,0.002208906,0.0002481434,0.00008300744,5.624832e-8,0.00002868067,0.000004789996],"genre_scores_gemma":[0.884295,0.0004447794,0.1149747,0.0002104677,0.00006724941,0.000002220896,7.014546e-8,0.000004009023,0.000001525591],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9693418,"threshold_uncertainty_score":0.4073445,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018196039","doi":"10.1007/s11390-005-0008-2","title":"Online Palmprint Identification System for Civil Applications","year":2005,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Preprocessor; Biometrics; Artificial intelligence; Identification (biology); Process (computing); Computer vision; Feature extraction; Feature (linguistics); Pattern recognition (psychology); Matching (statistics); False positive rate; Interface (matter); Identity (music)","retraction":null,"screen_n_in":null,"score":{"opus":0.0144270102444696,"gpt":0.268303194913213,"spread":0.2538761846687434,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001251701,0.00006981529,0.000146755,0.00145691,0.0002369227,0.0002310134,0.00143404,0.00006741495,5.312396e-7],"category_scores_gemma":[0.00005381597,0.00005941985,0.00003594512,0.002745228,0.0002685048,0.0006377501,0.0002118312,0.0001199,0.000005173073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001012692,"about_ca_system_score_gemma":0.0002031278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.32977e-7,"about_ca_topic_score_gemma":0.000002513287,"domain_scores_codex":[0.9987772,0.00001184773,0.0004501986,0.0002503622,0.0003380422,0.0001724131],"domain_scores_gemma":[0.9977566,0.00004425043,0.0003934285,0.0003896416,0.001334431,0.00008164115],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001070757,0.0001206917,0.00009394437,0.00001782885,0.000006631586,8.117643e-7,0.00007860579,0.00001427184,0.004521866,0.215392,0.0003184741,0.7794338],"study_design_scores_gemma":[0.001459946,0.0004670108,0.009005557,0.00007622551,0.00003411181,0.001526503,0.000219034,0.5708498,0.04730644,0.02098526,0.3476227,0.0004474377],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01714725,0.0002788982,0.9733231,0.008627145,0.0003566127,0.0001688081,0.000002010654,0.00007717984,0.000018969],"genre_scores_gemma":[0.7950646,0.00003156937,0.2046327,0.00009834288,0.0001473125,0.000009963508,4.056714e-7,0.000002053208,0.00001298851],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7789864,"threshold_uncertainty_score":0.2664827,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044762750","doi":"10.1007/s11390-010-9335-z","title":"Towards Progressive and Load Balancing Distributed Computation: A Case Study on Skyline Analysis","year":2010,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Skyline; Computer science; Load balancing (electrical power); Scalability; Distributed computing; Computation; Theory of computation; Distributed database; Load management; Data mining; Database; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.009547070416137317,"gpt":0.2833963986359273,"spread":0.27384932821979,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001260029,0.000123846,0.0002829742,0.001155103,0.0002645841,0.0004897622,0.0008601383,0.00004799117,9.724073e-7],"category_scores_gemma":[0.00007620148,0.00009197285,0.00003151935,0.00348793,0.0003976232,0.0008808418,0.00075553,0.0003247834,7.319575e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002743969,"about_ca_system_score_gemma":0.0001602934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009432163,"about_ca_topic_score_gemma":0.0000134267,"domain_scores_codex":[0.9985182,0.00002245178,0.0003204254,0.0003567308,0.0005575386,0.0002246063],"domain_scores_gemma":[0.9984855,0.00004362014,0.0003044966,0.0003275701,0.0007258992,0.0001129094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007157604,0.0004256816,0.01562793,0.000007768105,0.0002345717,0.007948131,0.0007915754,0.0001190422,0.0002575032,0.006636233,0.0001749231,0.9677695],"study_design_scores_gemma":[0.002204047,0.003688786,0.04113243,0.00003857053,0.0002752596,0.0154683,0.0009374538,0.9292258,0.0006911423,0.005166167,0.0007259463,0.0004460644],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5560525,0.00003295258,0.4419206,0.001614574,0.0002487989,0.00008433715,0.000001250307,0.00003464827,0.00001029611],"genre_scores_gemma":[0.922911,0.000003814192,0.0769273,0.00008420334,0.00006813914,0.000001693263,3.75488e-7,0.000002008522,0.000001454615],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9673234,"threshold_uncertainty_score":0.4722788,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2550167848","doi":"10.1007/s11390-016-1690-y","title":"Enhanced Userspace and In-Kernel Trace Filtering for Production Systems","year":2016,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Tracing; TRACE (psycholinguistics); Filter (signal processing); Real-time computing; Context (archaeology); Kernel (algebra); Rendering (computer graphics); Overhead (engineering); Software; Latency (audio); Distributed computing; Operating system; Computer graphics (images); Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.009656570307727841,"gpt":0.2397008524398235,"spread":0.2300442821320957,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001354538,0.00008340619,0.0002082415,0.0005501016,0.0001041453,0.00008410408,0.0005298946,0.00007038617,1.005392e-7],"category_scores_gemma":[0.0001611535,0.00005016099,0.00001765196,0.0006993359,0.0004025762,0.00117645,0.0001743668,0.00008557199,5.05959e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006339171,"about_ca_system_score_gemma":0.0001341281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001554323,"about_ca_topic_score_gemma":0.000001455961,"domain_scores_codex":[0.9989611,0.00001537179,0.000294547,0.0002880541,0.0002143053,0.0002266081],"domain_scores_gemma":[0.9989682,0.00007202001,0.0002077847,0.0002454701,0.0004514173,0.00005512155],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004207348,0.00008132331,0.01053276,0.0001730498,0.00001685004,0.00001345711,0.001131631,0.0001692901,0.2054325,0.007057952,0.0002368823,0.7751123],"study_design_scores_gemma":[0.01027403,0.007620965,0.103205,0.005279787,0.00004748515,0.01055448,0.001141643,0.1797056,0.6330246,0.03188818,0.01521924,0.002038943],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5218949,0.0002258638,0.4740089,0.003024916,0.0007174033,0.0001017843,1.082015e-7,0.00002393178,0.000002140309],"genre_scores_gemma":[0.9728084,0.000114712,0.02694097,0.00001597637,0.00009422599,0.000006602278,5.12199e-9,0.000002465823,0.00001666776],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7730733,"threshold_uncertainty_score":0.2045506,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048682232","doi":"10.1007/s11390-009-9232-5","title":"A Scalable Testing Framework for Location-Based Services","year":2009,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; University of Alberta","funders":"","keywords":"Computer science; Scalability; Integration testing; Automation; Architecture; Model-based testing; Service (business); System testing; Unit testing; Test strategy; Software engineering; Distributed computing; Test case; Embedded system; Operating system; Software; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.02124523687056585,"gpt":0.2724716406475514,"spread":0.2512264037769855,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001050259,0.00009561612,0.0002172892,0.000785774,0.0002412634,0.000319305,0.001220282,0.00008961016,4.432321e-7],"category_scores_gemma":[0.000278902,0.00008116328,0.00002835328,0.002600682,0.000174792,0.001005612,0.0001014852,0.0001767123,0.000002238409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000463593,"about_ca_system_score_gemma":0.0004571188,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002139475,"about_ca_topic_score_gemma":0.000001026343,"domain_scores_codex":[0.9988052,0.00001665461,0.0003247924,0.0002542248,0.0003485582,0.0002506065],"domain_scores_gemma":[0.9967625,0.0003477767,0.0003929378,0.0002895057,0.002121273,0.00008603917],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004571772,0.00007387729,0.001513511,0.00002429044,0.000005904908,0.000008712211,0.0001067653,0.000117212,0.001916664,0.02409108,0.00006107898,0.9720764],"study_design_scores_gemma":[0.0008112502,0.001952238,0.004463417,0.0006396179,0.00001185372,0.0007582041,0.00005174797,0.7736432,0.01209767,0.2033533,0.001938561,0.0002789268],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04628643,0.0001577465,0.9443109,0.008661198,0.000350833,0.0001184926,2.668004e-7,0.00008618687,0.00002795037],"genre_scores_gemma":[0.6195313,0.000001069066,0.3797294,0.0006599555,0.00007338933,0.000001907802,3.07882e-8,0.00000159409,0.000001296041],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9717974,"threshold_uncertainty_score":0.3309743,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1560117764","doi":"10.1007/s11390-011-9410-0","title":"A New Multiword Expression Metric and Its Applications","year":2011,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Metric (unit); Artificial intelligence; Natural language processing; Theory of computation; Question answering; Semantics (computer science); Expression (computer science); Natural language; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01551847576225597,"gpt":0.266887889072479,"spread":0.251369413310223,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000467961,0.00008372147,0.0001473085,0.001226981,0.0001443248,0.0001037329,0.001342912,0.00007697843,0.000001360182],"category_scores_gemma":[0.00008102047,0.0000607156,0.00001500462,0.002190766,0.0001709645,0.001027007,0.0006805386,0.0002169053,0.000001138433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001996251,"about_ca_system_score_gemma":0.0001725744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002130631,"about_ca_topic_score_gemma":2.845486e-7,"domain_scores_codex":[0.9991013,0.00001033636,0.000216234,0.0002294203,0.0002668997,0.0001757813],"domain_scores_gemma":[0.9989374,0.00003369251,0.0002307856,0.0002248745,0.0004535434,0.0001197618],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00000206579,0.0000229226,0.0002201616,0.000006590948,0.000002913718,0.00001682558,0.0002523273,1.351941e-7,0.01649422,0.08170906,0.0001495954,0.9011232],"study_design_scores_gemma":[0.0006529039,0.0008789237,0.00101181,0.0001651085,0.00001549255,0.002843563,0.00003255058,0.01513052,0.6486937,0.325928,0.004285294,0.0003620991],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007456586,0.005272257,0.9861393,0.0007845656,0.00009590999,0.00008089829,7.864157e-8,0.0001263526,0.00004407466],"genre_scores_gemma":[0.3923118,0.00007504741,0.6075072,0.00006695706,0.00002848622,0.000001532371,7.828733e-9,0.000001714328,0.000007264051],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9007611,"threshold_uncertainty_score":0.2495487,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4381515053","doi":"10.1007/s11390-023-2548-8","title":"Approximate Processing Element Design and Analysis for the Implementation of CNN Accelerators","year":2023,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Adder; Multiplication (music); Overhead (engineering); Convolutional neural network; Rounding; Lookup table; Computation; Floating point; Algorithm; Dot product; Computer engineering; Computer hardware; Parallel computing; Artificial intelligence; Latency (audio); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01712385666464078,"gpt":0.2716650361650627,"spread":0.2545411795004219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001107229,0.00005972518,0.000144658,0.001021675,0.0001195125,0.00006313746,0.0002417413,0.00002761524,0.000001073769],"category_scores_gemma":[0.000007475501,0.00003925463,0.00001892413,0.002488171,0.0001614235,0.0002991748,0.00005366988,0.00006477453,1.520637e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000220823,"about_ca_system_score_gemma":0.0000582462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.948577e-7,"about_ca_topic_score_gemma":5.889458e-7,"domain_scores_codex":[0.9993141,0.000005238005,0.000245241,0.00008105556,0.0001921402,0.0001621901],"domain_scores_gemma":[0.9995151,0.00004337687,0.0001175521,0.000079643,0.0002202567,0.00002410488],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008809976,0.00001202245,0.01295919,0.00009733294,0.0002970915,0.00000364226,0.001106374,0.03625215,0.02487798,0.0006481785,0.0004433984,0.9232938],"study_design_scores_gemma":[0.0003112383,0.0002172539,0.008377361,0.00001394889,0.0001075003,0.0000164556,0.0003129831,0.9261914,0.06358773,0.0006295082,0.0001701975,0.00006441706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4139161,0.0001607343,0.5854854,0.0002515922,0.00006459036,0.00009334732,4.062792e-7,0.00002703234,7.621704e-7],"genre_scores_gemma":[0.9635875,0.0001771871,0.03619127,0.00001223417,0.00002040017,0.00000689805,1.54876e-7,0.000003875429,5.327251e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9232294,"threshold_uncertainty_score":0.1600757,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011357342","doi":"10.1007/s11390-008-9140-0","title":"Performance of IEEE 802.15.4 Clusters with Power Management and Key Exchange","year":2008,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Computer network; Network packet; Key (lock); Reliability (semiconductor); Key management; Key exchange; Node (physics); Distributed coordination function; Personal area network; Power management; IEEE 802.15; IEEE 802.11; Wireless; Distributed computing; Wireless network; Wireless sensor network; Power (physics); Computer security; Public-key cryptography; Telecommunications; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.007823452779745608,"gpt":0.1979613923619011,"spread":0.1901379395821555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004503657,0.0001220351,0.0002565391,0.0008295292,0.0001764974,0.00004879486,0.001092654,0.0000694594,0.000001000437],"category_scores_gemma":[0.000004947111,0.00009120991,0.00001929049,0.001301074,0.001253851,0.0007092466,0.0004340728,0.0002174214,8.034557e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002806678,"about_ca_system_score_gemma":0.00008665041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001176112,"about_ca_topic_score_gemma":8.496148e-7,"domain_scores_codex":[0.9986218,0.00001534861,0.0002910426,0.0002565198,0.0005281518,0.0002871301],"domain_scores_gemma":[0.9988446,0.00003154595,0.0002983967,0.0003432213,0.0003919278,0.00009036946],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002366912,0.0006917107,0.1146112,0.0004206249,0.0003280225,0.002445024,0.01211871,0.003313853,0.002528734,0.04717348,0.005426638,0.8107052],"study_design_scores_gemma":[0.005571967,0.01271132,0.09627517,0.001055473,0.00007060324,0.03715953,0.0003733538,0.8151519,0.01940138,0.002437043,0.008534159,0.001258153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9021299,0.0003893148,0.09581594,0.001029297,0.000342168,0.00007871441,1.25096e-7,0.00003114192,0.0001833712],"genre_scores_gemma":[0.915906,0.0006568845,0.08321481,0.0001762773,0.00003232583,8.912411e-7,1.659058e-8,0.000003632561,0.000009145476],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.811838,"threshold_uncertainty_score":0.4619866,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010870819","doi":"10.1007/s11390-013-1327-3","title":"Exact Computation of the Topology and Geometric Invariants of the Voronoi Diagram of Spheres in 3D","year":2013,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Voronoi diagram; Bowyer–Watson algorithm; Delaunay triangulation; Mathematics; Weighted Voronoi diagram; Computation; Power diagram; Polynomial; Discrete mathematics; Combinatorics; Algorithm; Geometry; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.007804314696087489,"gpt":0.2280808822904212,"spread":0.2202765675943337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005693951,0.00006879777,0.000218215,0.0007545873,0.00006798962,0.0000295589,0.0008446248,0.00006215825,0.000002002547],"category_scores_gemma":[0.0001920366,0.00004093116,0.00003036765,0.003262609,0.0007163832,0.0004293778,0.0005071998,0.0001421836,1.838655e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001885334,"about_ca_system_score_gemma":0.0002238683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004478614,"about_ca_topic_score_gemma":0.00001729171,"domain_scores_codex":[0.9988713,0.00006574649,0.0004590987,0.000142312,0.000334948,0.0001265447],"domain_scores_gemma":[0.9984595,0.0001362333,0.0005845515,0.0001989733,0.0005931564,0.00002758937],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.000005390169,0.0001550099,0.0924122,0.00003969649,0.00001922456,0.000001612534,0.0003982406,0.005796818,0.01398483,0.02797415,0.0001303037,0.8590825],"study_design_scores_gemma":[0.0006661997,0.0005870746,0.6940919,0.0001025066,0.000009611176,0.0002255414,0.00008925636,0.2301419,0.03373017,0.04021674,0.00004316763,0.00009592129],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7323736,0.0002735567,0.2655742,0.001380228,0.0002874203,0.00009400219,2.27794e-7,0.000002841389,0.00001395523],"genre_scores_gemma":[0.9755635,0.00003079683,0.02432294,0.00006102779,0.00001727548,9.352042e-7,2.823726e-8,0.000001327372,0.000002168626],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8589866,"threshold_uncertainty_score":0.2639544,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044000055","doi":"10.1007/s11390-009-9205-8","title":"An Abstract Reachability Approach by Combining HOL Induction and Multiway Decision Graphs","year":2009,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Reachability; Correctness; Computer science; Binary decision diagram; Automated theorem proving; Benchmark (surveying); Embedding; Theoretical computer science; Set (abstract data type); Binary number; Algorithm; Mathematics; Programming language; Artificial intelligence; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.01806091364229341,"gpt":0.297934315189039,"spread":0.2798734015467456,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002915554,0.0001062683,0.0001976268,0.0007186976,0.0002445101,0.0002227848,0.001056295,0.000125186,2.260343e-7],"category_scores_gemma":[0.000145924,0.00008541016,0.00001981435,0.0012454,0.0005554593,0.002313433,0.0001350769,0.0003534507,2.846567e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000395282,"about_ca_system_score_gemma":0.00007478093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000226057,"about_ca_topic_score_gemma":1.225307e-7,"domain_scores_codex":[0.998592,0.00004027018,0.0003788619,0.0003567562,0.0004194224,0.0002127289],"domain_scores_gemma":[0.9986643,0.00004389702,0.0003310892,0.000424529,0.0004157924,0.0001203717],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006321368,0.0001186297,0.0006081242,0.000002387334,0.000001880455,0.000002172605,0.0002120482,0.00001977754,0.02381976,0.02084654,0.00003854206,0.9543238],"study_design_scores_gemma":[0.001496443,0.005090396,0.1777641,0.00009402251,0.00001384312,0.002935175,0.0002110572,0.5522808,0.04002288,0.2188387,0.0007325546,0.0005199829],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4833649,0.0000893232,0.5159064,0.0003606192,0.0001723951,0.00004738408,1.105054e-7,0.00003585147,0.00002305126],"genre_scores_gemma":[0.5359941,0.00002489784,0.4639109,0.00005463064,0.0000135992,4.166252e-7,6.624045e-8,0.00000114335,2.610658e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9538038,"threshold_uncertainty_score":0.3482925,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068220037","doi":"10.1007/bf02944804","title":"A note on the single genotype resolution problem","year":2004,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Genomic variations and chromosomal abnormalities","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Resolution (logic); Reduction (mathematics); Theory of computation; Computer science; NP-complete; Computational complexity theory; Algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.007527063486905003,"gpt":0.2081644771374083,"spread":0.2006374136505034,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002896233,0.00004485343,0.00005455551,0.0001059952,0.000142047,0.00003118833,0.000231876,0.00005032287,9.440462e-7],"category_scores_gemma":[0.00003018148,0.00002805685,0.00001655398,0.0002076265,0.0002747502,0.000007257136,0.00009246612,0.00007622789,0.000001551266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002325122,"about_ca_system_score_gemma":0.0001651143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001539132,"about_ca_topic_score_gemma":0.000002760725,"domain_scores_codex":[0.999566,0.000007404196,0.0001204444,0.0000888023,0.000108481,0.0001088702],"domain_scores_gemma":[0.9995438,0.000004430946,0.00009513623,0.0001170974,0.0002173916,0.00002210279],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005001184,0.0001808551,0.0004534255,0.000007533196,0.00003016889,0.00001431645,0.000342547,0.002284201,0.8509119,0.1046175,0.0005919191,0.04051559],"study_design_scores_gemma":[0.001395332,0.007699472,0.003581721,0.0000906861,0.00002582082,0.00203274,0.000225535,0.0005508664,0.8624089,0.06908675,0.0525988,0.0003033256],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9585913,0.0001514751,0.03337798,0.007507985,0.0001190312,0.00004369086,5.057869e-7,0.000004299025,0.0002036788],"genre_scores_gemma":[0.9859368,0.00003004617,0.01363637,0.0002763538,0.0001058327,8.108134e-7,1.697216e-7,0.000002016362,0.00001155172],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05200689,"threshold_uncertainty_score":0.1144125,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074047803","doi":"10.1007/s11390-010-9407-0","title":"Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving","year":2010,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Probabilistic analysis of algorithms; Mathematical proof; Theory of computation; Computational complexity theory; Algorithm; Automated theorem proving; Probabilistic logic; Time complexity; Descriptive complexity theory; Theoretical computer science; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01665396761359184,"gpt":0.2521595947787549,"spread":0.235505627165163,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001495035,0.0001347287,0.0003540919,0.001000902,0.000272513,0.0001657278,0.001884451,0.00011133,0.000004246373],"category_scores_gemma":[0.0001597566,0.0001004291,0.00006136505,0.001809983,0.001533606,0.001129848,0.0007825614,0.0004211784,0.000001647152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003332437,"about_ca_system_score_gemma":0.0004534442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004387438,"about_ca_topic_score_gemma":0.00000319787,"domain_scores_codex":[0.9984788,0.00002807379,0.0004614643,0.0002691895,0.0004081437,0.0003543714],"domain_scores_gemma":[0.9976897,0.00005995231,0.000584359,0.0003842264,0.001166257,0.00011547],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001048539,0.0001886394,0.007531199,0.0000245127,0.00004497833,0.00007095403,0.001333933,0.00003953443,0.3037099,0.3082057,0.0000539208,0.3787863],"study_design_scores_gemma":[0.0007090897,0.0007732797,0.004755891,0.00009015767,0.00002100462,0.002669968,0.00005282956,0.8580911,0.0627527,0.06950945,0.0002714366,0.0003031282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4965872,0.00008237734,0.5024092,0.0002906237,0.0003718254,0.00004953426,2.106902e-7,0.00004357989,0.00016547],"genre_scores_gemma":[0.6695237,0.000004544494,0.3303601,0.00002270581,0.00008258147,2.70478e-7,3.839323e-8,0.000002903124,0.000003211485],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8580515,"threshold_uncertainty_score":0.5650637,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982014661","doi":"10.1007/s11390-013-1389-2","title":"Non-Intrusive Elastic Query Processing in the Cloud","year":2013,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Cloud computing; Flexibility (engineering); Distributed computing; Elasticity (physics); Service level; Database; Theory of computation; Service-level agreement; Operating system; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.006028355547624473,"gpt":0.2314365825682686,"spread":0.2254082270206441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008190933,0.00008828161,0.0001786424,0.0005506065,0.0001789532,0.0001813511,0.001176272,0.00004459086,0.000001005917],"category_scores_gemma":[0.00007790647,0.00005129642,0.00001729122,0.001578831,0.0005234614,0.001863752,0.00035586,0.0002625422,0.000005084668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003228047,"about_ca_system_score_gemma":0.0002711143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009096104,"about_ca_topic_score_gemma":0.000003854682,"domain_scores_codex":[0.9988668,0.00001909947,0.0003146982,0.0001912111,0.0003529996,0.0002551888],"domain_scores_gemma":[0.9988948,0.00005222601,0.0002496348,0.0002797117,0.0004764229,0.0000471881],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003444695,0.00008482354,0.002723996,0.0000345163,0.000005253264,0.0001770191,0.002298636,0.0001214497,0.004530937,0.1872389,0.001098763,0.8016823],"study_design_scores_gemma":[0.003155919,0.00367213,0.06779345,0.001503679,0.00002564289,0.02079816,0.004184288,0.6157746,0.009870552,0.2249359,0.04689251,0.001393075],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.194158,0.0002563274,0.8007086,0.00432867,0.0003735801,0.00009482263,1.146097e-7,0.00001710255,0.00006273992],"genre_scores_gemma":[0.889936,0.00002032371,0.1095424,0.0003733921,0.0001184965,0.000004600134,2.575782e-8,0.00000199736,0.000002798491],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8002892,"threshold_uncertainty_score":0.2185826,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011531072","doi":"10.1007/s11390-008-9177-0","title":"Scalable Base-Station Model-Based Multicast in Wireless Sensor Networks","year":2008,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Hong Kong University of Science and Technology; University of Waterloo","keywords":"Multicast; Computer science; Source-specific multicast; Computer network; Protocol Independent Multicast; Xcast; Pragmatic General Multicast; Distributed computing; Wireless sensor network; Scalability; Base station; Distance Vector Multicast Routing Protocol; Reliable multicast; IP multicast; Network topology","retraction":null,"screen_n_in":null,"score":{"opus":0.01237154776511081,"gpt":0.2225325987843088,"spread":0.210161051019198,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009085794,0.0001605798,0.0003169094,0.001407845,0.0002493956,0.00009962368,0.001261103,0.0001502285,6.214043e-7],"category_scores_gemma":[0.00005162562,0.0001399591,0.00003967018,0.003025054,0.0008633941,0.0007274814,0.0002720409,0.0004356198,0.000001377262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001067811,"about_ca_system_score_gemma":0.0004001659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004397075,"about_ca_topic_score_gemma":0.000005162181,"domain_scores_codex":[0.9979849,0.00004620851,0.0005051321,0.0003931038,0.0005770924,0.0004935235],"domain_scores_gemma":[0.9982746,0.0001190779,0.0003171284,0.0004120989,0.0007369362,0.0001401522],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007970765,0.0001087431,0.002688711,0.000003607181,0.000003183322,0.0002109921,0.0000962018,0.9544416,0.001218021,0.005243747,0.00008685581,0.03589033],"study_design_scores_gemma":[0.0006499023,0.0001948588,0.0008420013,0.00006004663,0.000002418942,0.0005086118,0.000008641254,0.9944855,0.002791906,0.0002732696,0.00003539828,0.0001474568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4052705,0.00006298191,0.5931884,0.001135158,0.0002342122,0.00004571269,1.257902e-7,0.00004544985,0.00001749623],"genre_scores_gemma":[0.7412697,0.0000463852,0.2583846,0.000240512,0.00004663961,0.000001368459,1.315049e-7,0.000005613139,0.000005007649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3359993,"threshold_uncertainty_score":0.5707367,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2002223291","doi":"10.1007/s11390-014-1415-z","title":"Minimizing the Discrepancy Between Source and Target Domains by Learning Adapting Components","year":2014,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of British Columbia","funders":"","keywords":"Computer science; Independence (probability theory); Embedding; Dimensionality reduction; Range (aeronautics); Feature (linguistics); Reproducing kernel Hilbert space; Domain (mathematical analysis); Theory of computation; Kernel (algebra); Domain adaptation; Feature vector; Curse of dimensionality; Artificial intelligence; Kernel method; Feature selection; Machine learning; Algorithm; Hilbert space; Support vector machine; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.009523472966358878,"gpt":0.2245756298638781,"spread":0.2150521568975192,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002373758,0.0001263719,0.0002503744,0.0004048023,0.0007723903,0.0003861686,0.001129965,0.00006604094,9.135247e-7],"category_scores_gemma":[0.0002203473,0.00008723903,0.0000304402,0.0007654011,0.0006783989,0.0006782711,0.0006456701,0.0005048742,0.000002071698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000231782,"about_ca_system_score_gemma":0.00007188941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003226651,"about_ca_topic_score_gemma":2.840357e-7,"domain_scores_codex":[0.9984195,0.0001158191,0.0003664039,0.0002841869,0.0004798512,0.0003342804],"domain_scores_gemma":[0.9986892,0.0002980388,0.0004414048,0.0002192002,0.000225283,0.0001268261],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005589196,0.00003356775,0.0339766,0.00001160227,0.00003467327,0.00001114552,0.002516872,0.0005178888,0.008137282,0.03530176,0.0002916305,0.9191614],"study_design_scores_gemma":[0.001449666,0.001078264,0.02097032,0.0001514241,0.00002454424,0.0008714851,0.0007604922,0.794104,0.001625323,0.0127335,0.1657697,0.0004612828],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2994474,0.0002185056,0.6954242,0.004601399,0.0001248232,0.00003696427,8.492843e-8,0.00005037581,0.0000962456],"genre_scores_gemma":[0.867566,0.00002671675,0.1320498,0.0002390909,0.0000913419,6.598772e-7,1.365877e-7,0.000005029389,0.00002126952],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9187001,"threshold_uncertainty_score":0.5940681,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013794162","doi":"10.1007/s11390-008-9169-0","title":"Uplink Scheduling for Supporting Real Time Voice Traffic in IEEE 802.16 Backhaul Networks","year":2008,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Computer network; Network packet; Scheduling (production processes); Real-time computing; Telecommunications link; Latency (audio); Real-time communication; Voice over IP; Telecommunications; Operating system; The Internet","retraction":null,"screen_n_in":null,"score":{"opus":0.007132869994282196,"gpt":0.2264998157644436,"spread":0.2193669457701614,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004836946,0.0001009175,0.0002351666,0.0005332539,0.000117509,0.00002251409,0.0002849377,0.0001193878,9.698277e-7],"category_scores_gemma":[0.00003165786,0.00009689043,0.00002559869,0.0010133,0.0002237906,0.0004025377,0.00003735764,0.0002680573,9.668911e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009236931,"about_ca_system_score_gemma":0.00007158318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.061056e-7,"about_ca_topic_score_gemma":0.000001770738,"domain_scores_codex":[0.9989882,0.000005475137,0.000409782,0.0001439344,0.0001186369,0.0003340495],"domain_scores_gemma":[0.9994145,0.00006296398,0.0001405963,0.0001034133,0.0002216531,0.00005687435],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000460545,0.000008576502,0.0002097171,0.000005764364,0.000004174237,0.00001681296,0.00004468944,0.916309,0.0007893508,0.00005706396,0.00008742028,0.08246285],"study_design_scores_gemma":[0.0003698495,0.000116253,0.0001225748,0.00005062584,0.000003568425,0.0004287976,0.00000974774,0.997849,0.0006549456,0.000221278,0.00007513059,0.00009820248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4732219,0.0001454326,0.526177,0.0001036006,0.0002287849,0.00005554783,9.360308e-8,0.00005794174,0.000009657214],"genre_scores_gemma":[0.8240569,0.000453531,0.175266,0.00001903265,0.0001879067,0.000001972471,3.346027e-7,0.00001139944,0.000002883655],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.350911,"threshold_uncertainty_score":0.3951077,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3150464090","doi":"10.1007/s11390-011-9421-x","title":"NuMDG: A New Tool for Multiway Decision Graphs Construction","year":2011,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Correctness; Binary decision diagram; Operator (biology); Representation (politics); Theoretical computer science; Pruning; Set (abstract data type); Tree traversal; Data structure; Programming language; Theory of computation; Tuple; Algorithm; Mathematics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02954144827780394,"gpt":0.2870851727676098,"spread":0.2575437244898058,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001378836,0.00008812106,0.0001723787,0.0009581266,0.000170485,0.00009717765,0.001295434,0.00009204615,0.000001543367],"category_scores_gemma":[0.0002833619,0.00006984843,0.00004185804,0.001369885,0.0004944863,0.001354661,0.0002399856,0.0001494636,0.000001755333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003467417,"about_ca_system_score_gemma":0.0002771729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001732992,"about_ca_topic_score_gemma":3.575803e-7,"domain_scores_codex":[0.9988506,0.00001600452,0.000374569,0.000238655,0.0003044625,0.0002157496],"domain_scores_gemma":[0.9984359,0.0000622029,0.0003499895,0.0003362938,0.0007299822,0.00008564695],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001063245,0.00001690488,0.0005019984,0.000002178141,0.000003589055,0.000002405826,0.0001707672,0.000002277835,0.001298174,0.2659141,0.0001219669,0.731955],"study_design_scores_gemma":[0.001373,0.001928503,0.007576839,0.00008530004,0.00001465452,0.002751645,0.00005147641,0.1129143,0.06996154,0.7984633,0.004601686,0.0002776717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.106617,0.00007163666,0.8915335,0.0003331809,0.001258113,0.0001050089,1.576658e-7,0.00004778786,0.00003365336],"genre_scores_gemma":[0.1404397,0.00002707497,0.8594023,0.00007673885,0.00004736274,0.00000172654,1.774823e-8,0.000002461909,0.000002628356],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7316774,"threshold_uncertainty_score":0.2848336,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061130392","doi":"10.1007/bf02950404","title":"Decision tree complexity of graph properties with dimension at most 5","year":2000,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Monotone polygon; Conjecture; Vertex (graph theory); Graph; Discrete mathematics; Theory of computation; Mathematics; Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01945976050915833,"gpt":0.2235232335664495,"spread":0.2040634730572912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005705595,0.0001017808,0.0003155114,0.001110602,0.0002061655,0.00006611114,0.001352008,0.00005822957,0.00001661482],"category_scores_gemma":[0.00004722544,0.00005514194,0.00003725067,0.004796027,0.001836739,0.0006313963,0.0005056717,0.0001365733,0.00000362609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002600186,"about_ca_system_score_gemma":0.00008520409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000956858,"about_ca_topic_score_gemma":0.00001106379,"domain_scores_codex":[0.9985331,0.00001940846,0.0003559225,0.0002649457,0.0006075822,0.0002190821],"domain_scores_gemma":[0.998715,0.00004648035,0.0002364424,0.0003767727,0.0005322819,0.00009296175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004601938,0.0001203043,0.002980285,0.000004180612,0.00002082829,0.00004463288,0.00007019665,0.0001691326,0.002493911,0.01002078,0.0002529914,0.9837767],"study_design_scores_gemma":[0.007535228,0.02570898,0.1833887,0.0008849809,0.0002361101,0.01273424,0.000194572,0.2764528,0.1540133,0.3141018,0.02286747,0.001881785],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8249392,0.0003572618,0.1723114,0.002183106,0.00007080431,0.00003833228,6.327761e-7,0.00002441472,0.00007483597],"genre_scores_gemma":[0.8941013,0.000130375,0.1056214,0.0001115048,0.00001380259,3.795229e-7,9.671253e-8,0.000001444104,0.00001971885],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.981895,"threshold_uncertainty_score":0.6767542,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990984688","doi":"10.1007/bf02945466","title":"Analyzing and mining ordered information tables","year":2003,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Ranking (information retrieval); Table (database); Dependency (UML); Association rule learning; Data mining; Value (mathematics); Order (exchange); Information extraction; Theory of computation; Theoretical computer science; Information retrieval; Artificial intelligence; Machine learning; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.00813276642335179,"gpt":0.2177216585948505,"spread":0.2095888921714987,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009062758,0.00006966298,0.0001475592,0.000780873,0.0002036415,0.0003184907,0.0005091938,0.00005066459,8.330272e-7],"category_scores_gemma":[0.0001195987,0.00005158105,0.00001269312,0.00132812,0.0002846509,0.001996075,0.0001948842,0.0001147481,7.684741e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001635734,"about_ca_system_score_gemma":0.0001549777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001067279,"about_ca_topic_score_gemma":5.084265e-7,"domain_scores_codex":[0.999203,0.00001488604,0.0002596035,0.0001180489,0.0002108033,0.000193605],"domain_scores_gemma":[0.999175,0.00003232045,0.0002196876,0.0001543737,0.0003507709,0.00006781713],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001494916,0.00001698765,0.006144414,0.00000790631,0.000009268854,0.00001790366,0.0004978709,0.00006837842,0.0003365689,0.1355278,0.0002605758,0.8571108],"study_design_scores_gemma":[0.004251612,0.004156058,0.02472525,0.0003305391,0.00005345499,0.01589955,0.001281022,0.5809732,0.008232591,0.2326841,0.126079,0.001333677],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2708564,0.0004713537,0.7261497,0.001837826,0.0002762237,0.00003309134,1.100976e-7,0.00002740516,0.0003479471],"genre_scores_gemma":[0.6938549,0.00009045882,0.305886,0.0001530296,0.00001345247,2.80691e-7,2.399959e-8,8.359349e-7,9.620791e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8557771,"threshold_uncertainty_score":0.3071213,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3096943259","doi":"10.24215/16666038.20.e08","title":"Data Science & Engineering into Food Science: A novel Big Data Platform for Low Molecular Weight Gelators’ Behavioral Analysis","year":2020,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Supramolecular Self-Assembly in Materials","field":"Materials Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Big data; Data science; Scalability; Science and engineering; Limiting; Homogenization (climate); Data mining; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.06046403470218005,"gpt":0.3055245867752199,"spread":0.2450605520730399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.005259906,0.0002596198,0.000597638,0.002435967,0.000596714,0.001046792,0.01062263,0.0001237317,0.000006156606],"category_scores_gemma":[0.001158079,0.0002198314,0.00005492556,0.009059013,0.002911814,0.003849098,0.005932511,0.0002486628,0.000005467907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001506161,"about_ca_system_score_gemma":0.001897853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000717101,"about_ca_topic_score_gemma":0.000007608587,"domain_scores_codex":[0.9954682,0.00001216459,0.0007745723,0.001259571,0.001683763,0.0008017361],"domain_scores_gemma":[0.9956871,0.0000636985,0.0005530231,0.001973547,0.001308012,0.0004146679],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001449996,0.00006832451,0.0002227792,0.00002097709,0.00002971346,0.00001604103,0.0001555354,0.0002336209,0.9937849,0.00152483,0.00003305468,0.003895717],"study_design_scores_gemma":[0.0007904368,0.0009497914,0.0002782996,0.0000535187,0.0003136411,0.0003073752,0.00007360306,0.108797,0.8854319,0.0005315163,0.002033456,0.0004395169],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6332361,0.00009382869,0.3646883,0.0008217255,0.0009060405,0.0001463438,0.00004949933,0.0000564183,0.000001760362],"genre_scores_gemma":[0.7616785,0.000009956389,0.2379494,0.0001575503,0.000184147,0.000003111206,0.000005206538,0.0000118832,1.878225e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1284425,"threshold_uncertainty_score":0.9999902,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4408362526","doi":"10.1007/s11390-024-5036-x","title":"Caging AI","year":2025,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.00567773826158046,"gpt":0.255621987237542,"spread":0.2499442489759615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001480735,0.0001242832,0.0002826534,0.001764323,0.0002484911,0.0003212693,0.002570456,0.00008213361,0.000001210398],"category_scores_gemma":[0.0001462288,0.0001005058,0.00004485478,0.003827731,0.0007749202,0.0009420995,0.001531189,0.0003828358,0.000002486741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001003579,"about_ca_system_score_gemma":0.0006989912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000286014,"about_ca_topic_score_gemma":0.000001210765,"domain_scores_codex":[0.9983972,0.00002872694,0.0004157485,0.0003654458,0.0004449079,0.0003479932],"domain_scores_gemma":[0.9980077,0.00009336011,0.0001919211,0.0005192509,0.001097422,0.00009030234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001700991,0.00006106658,0.003348401,0.00000967753,0.00001287326,0.00005822038,0.0001179503,0.0000844749,0.001042269,0.1617335,0.0008230427,0.8327068],"study_design_scores_gemma":[0.0009605452,0.0007740995,0.01116623,0.0001447397,0.00001711306,0.001916251,0.00004406426,0.509442,0.01142586,0.442695,0.02106033,0.000353804],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05247243,0.0004369284,0.9175858,0.02762164,0.00144675,0.00006472954,9.302929e-8,0.000104146,0.000267413],"genre_scores_gemma":[0.7652669,0.00002266479,0.2333113,0.001304675,0.00007378831,9.778345e-7,1.326063e-8,0.000002134129,0.00001756733],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.832353,"threshold_uncertainty_score":0.477659,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996087956","doi":"10.1007/s11390-006-1012-x","title":"Parallel Switch System with QoS Guarantee for Real-Time Traffic","year":2006,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Sierra Wireless (Canada)","funders":"","keywords":"Computer science; Quality of service; Computer network; Multicast; Network packet; Unicast; Scalability; Bandwidth (computing); Distributed computing; Differentiated services; Load balancing (electrical power)","retraction":null,"screen_n_in":null,"score":{"opus":0.005619743502437127,"gpt":0.2053705500553666,"spread":0.1997508065529295,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001047368,0.0001300483,0.0003289133,0.0006560467,0.0002596495,0.0002507261,0.001075366,0.00009264827,4.259699e-7],"category_scores_gemma":[0.000007962066,0.00008749694,0.00005035694,0.001088824,0.0002692772,0.0005852782,0.0001089835,0.0001387773,0.000002993826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007251821,"about_ca_system_score_gemma":0.0002071616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007989826,"about_ca_topic_score_gemma":0.000006103078,"domain_scores_codex":[0.9985245,0.00002101492,0.0004528659,0.0002936239,0.0003726328,0.0003353158],"domain_scores_gemma":[0.9983155,0.00006384813,0.0003842566,0.0002960798,0.000890895,0.00004942473],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001094619,0.0002215487,0.0005172918,0.0001064313,0.00008459931,0.0002836003,0.0004069605,0.02727336,0.006144715,0.8127961,0.01403972,0.1380162],"study_design_scores_gemma":[0.001164273,0.001773164,0.0002391027,0.0001985179,0.00001124237,0.005560486,0.00006552336,0.9849905,0.0006167371,0.001667519,0.0034989,0.0002140022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1951456,0.00009693728,0.8022128,0.001397615,0.0007235701,0.0001531056,3.004957e-7,0.0001061696,0.0001639012],"genre_scores_gemma":[0.9025987,0.000009540032,0.09690431,0.00004118027,0.0003870406,0.000006210847,8.102259e-8,0.000005424038,0.00004753728],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9577172,"threshold_uncertainty_score":0.3568022,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058906553","doi":"10.1007/s11390-011-1149-0","title":"Energy Efficiency of a Multi-Core Processor by Tag Reduction","year":2011,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Hangzhou Dianzi University","keywords":"Computer science; Reduction (mathematics); Multi-core processor; Parallel computing; Core (optical fiber); Heuristics; Memory hierarchy; Single-core; Processor design; Efficient energy use; Energy (signal processing); Set (abstract data type); Many core; Embedded system; Operating system; Cache; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02016466680246204,"gpt":0.2512085389561881,"spread":0.2310438721537261,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007005045,0.0001051166,0.0002249996,0.0009202587,0.0001319047,0.00004381105,0.001357944,0.00008961492,9.882102e-7],"category_scores_gemma":[0.00004768973,0.00008433872,0.00003227984,0.001925712,0.0006227186,0.0005825002,0.0003314906,0.000146356,3.568674e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002526962,"about_ca_system_score_gemma":0.0002341374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007047089,"about_ca_topic_score_gemma":2.34287e-7,"domain_scores_codex":[0.9987425,0.00001740987,0.0004226495,0.0002563504,0.0003417452,0.0002193817],"domain_scores_gemma":[0.9980721,0.0000140424,0.0005370988,0.000276648,0.001025694,0.00007439894],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002725477,0.001077763,0.001302607,0.00004489489,0.00003993572,0.0000373233,0.002721705,0.0002628581,0.06113055,0.09418143,0.003561238,0.8356124],"study_design_scores_gemma":[0.0007889036,0.002091765,0.0002741354,0.0001258682,0.0000120377,0.001500783,0.00005361497,0.5499245,0.424436,0.01930386,0.001174939,0.0003136166],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0460391,0.0004385036,0.9527152,0.0003220963,0.0002519344,0.00004062968,2.194986e-7,0.0001041941,0.00008818804],"genre_scores_gemma":[0.6359483,0.00007332008,0.3639087,0.00003865086,0.00001649818,9.838792e-7,4.242469e-8,0.000002456367,0.00001099045],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8352988,"threshold_uncertainty_score":0.3439234,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049769908","doi":"10.1007/bf02960771","title":"Clustering DTDs: An interactive two-level approach","year":2002,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Cluster analysis; Document type definition; Document Structure Description; XML; Information retrieval; Data mining; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04570929441094207,"gpt":0.3133056358307519,"spread":0.2675963414198099,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009597579,0.0001423173,0.0002582693,0.001333222,0.0002547764,0.0003389143,0.002619028,0.00006722371,0.00000285718],"category_scores_gemma":[0.00009756647,0.0001171888,0.00003125159,0.001966292,0.0006663621,0.00285222,0.001440338,0.0005228734,0.000005411373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001180198,"about_ca_system_score_gemma":0.00009660588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002422557,"about_ca_topic_score_gemma":0.000001025626,"domain_scores_codex":[0.9980512,0.00004307957,0.0003489206,0.0004195138,0.0006829623,0.0004543018],"domain_scores_gemma":[0.9981445,0.00005839331,0.0002458945,0.0005211963,0.0008327311,0.0001972548],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004487475,0.0001232512,0.00008498118,0.000007246585,0.00001213028,0.00009236856,0.0007865646,0.001182045,0.002608196,0.002555326,0.00004415321,0.9924992],"study_design_scores_gemma":[0.0005168344,0.0006939453,0.0002184997,0.00002986213,0.000002187575,0.00320455,0.00008420119,0.9901481,0.001777017,0.002844765,0.0003368813,0.0001431156],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03122795,0.0001414915,0.9664255,0.001381562,0.0004007778,0.00007232195,3.212776e-7,0.00008548553,0.0002646036],"genre_scores_gemma":[0.4725325,0.00002565304,0.527236,0.00009289015,0.000088897,0.000001632577,2.561068e-8,0.000004520719,0.00001788266],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9923561,"threshold_uncertainty_score":0.486685,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088835748","doi":"10.1007/bf02949831","title":"The impact of non-Gaussian distribution traffic on network performance","year":2002,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Gaussian; Range (aeronautics); Gaussian process; Traffic generation model; Marginal distribution; Gaussian network model; Probability density function; Algorithm; Simulation; Real-time computing; Statistics; Mathematics; Random variable; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.006624346709116896,"gpt":0.2471219300452766,"spread":0.2404975833361597,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003949094,0.00007681195,0.0001763174,0.0001424689,0.0002555668,0.00004654411,0.0004381112,0.00002572581,0.000008742262],"category_scores_gemma":[0.00000388942,0.00004400064,0.0000742889,0.001020912,0.0004504223,0.0001304891,0.00007694459,0.0001958058,0.000001064627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003200643,"about_ca_system_score_gemma":0.00005112372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002167129,"about_ca_topic_score_gemma":2.787505e-7,"domain_scores_codex":[0.9992403,0.0000113685,0.0002572909,0.00009389611,0.0001879291,0.0002091552],"domain_scores_gemma":[0.9992174,0.00003889804,0.0002973553,0.000183084,0.0002232264,0.00004005535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007928717,0.00007436834,0.01493806,0.000001134096,0.00004530068,0.000001103221,0.00003058398,0.006986404,0.0001438431,0.004284057,0.005404874,0.9680824],"study_design_scores_gemma":[0.0003706281,0.002238129,0.05143042,0.0001047842,0.00002838979,0.00004851877,0.00002264072,0.9372332,0.001332211,0.004803716,0.002231113,0.0001562216],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9714723,0.00009445726,0.02761874,0.0004772321,0.00006778352,0.00004349025,7.470083e-7,0.00001087662,0.0002144179],"genre_scores_gemma":[0.9988459,0.00004856296,0.0009027596,0.000005250635,0.0001888814,8.352985e-7,2.343711e-7,0.000002205246,0.000005330384],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9679261,"threshold_uncertainty_score":0.1965639,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388541891","doi":"10.1007/s11390-022-1214-x","title":"Prepartition: Load Balancing Approach for Virtual Machine Reservations in a Cloud Data Center","year":2023,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Load balancing (electrical power); Virtual machine; Cloud computing; Distributed computing; Virtualization; Data center; Scheduling (production processes); Live migration; Load management; Job shop scheduling; Network Load Balancing Services; Round-robin DNS; Server; Computer network; Operating system; The Internet; Schedule; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.0305626818060972,"gpt":0.2781600192817553,"spread":0.2475973374756581,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002834779,0.00008990578,0.0001887312,0.0009229981,0.0002100161,0.0001668203,0.002480857,0.0000508934,2.765869e-7],"category_scores_gemma":[0.0001685747,0.0000728798,0.00002479254,0.002876624,0.0002128457,0.0002254937,0.00225648,0.0001895595,0.00000151746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006722582,"about_ca_system_score_gemma":0.0002011362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003546845,"about_ca_topic_score_gemma":0.000004628219,"domain_scores_codex":[0.9984325,0.00002518926,0.0003702477,0.0003888187,0.0004630721,0.0003202035],"domain_scores_gemma":[0.998684,0.00008090529,0.0001864642,0.0006532556,0.0003343138,0.00006099313],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005938198,0.0008442631,0.02419807,0.0001432446,0.0001054535,0.0002282504,0.00323076,0.05428602,0.00109713,0.1331915,0.04586797,0.7367479],"study_design_scores_gemma":[0.0005872354,0.0002548565,0.001015213,0.0000444121,0.000003139415,0.0001431599,0.00006534399,0.9875249,0.00005555967,0.003102591,0.007118286,0.00008528696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1653683,0.00008256688,0.8254006,0.00818974,0.000588133,0.0001450915,0.000002363503,0.000112436,0.0001108314],"genre_scores_gemma":[0.8856145,0.00001656486,0.1138894,0.0002210667,0.0002049116,0.000004671477,0.000001928811,0.000004659444,0.00004234188],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9332389,"threshold_uncertainty_score":0.4610091,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983413912","doi":"10.1007/bf02948810","title":"Extending the relational model to deal with probabilistic data","year":2000,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Soundness; Computer science; Relational database; Relational model; Probabilistic logic; Probabilistic database; Relational calculus; Relational algebra; Completeness (order theory); Theoretical computer science; Theory of computation; Semantics (computer science); Database model; Probabilistic relevance model; Data mining; Programming language; Artificial intelligence; Probabilistic analysis of algorithms; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04626191801707751,"gpt":0.2786165270614067,"spread":0.2323546090443291,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001102265,0.00008213244,0.0001233971,0.0002807858,0.0002724564,0.0001897154,0.002653061,0.00003929498,0.000002103989],"category_scores_gemma":[0.00003783947,0.0000470004,0.000009511863,0.001226722,0.0004104929,0.0008965486,0.0004982078,0.0002421144,0.000004540133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002637843,"about_ca_system_score_gemma":0.0004760903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000123814,"about_ca_topic_score_gemma":0.0000016352,"domain_scores_codex":[0.9987791,0.0000155002,0.000225561,0.0002960308,0.0004605552,0.0002232815],"domain_scores_gemma":[0.998688,0.00004995301,0.00009555107,0.0005490612,0.000522845,0.00009453068],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007960586,0.00002816254,0.0001633896,0.000002132458,0.000006731555,0.00001462212,0.0002059594,0.02870223,0.0001025704,0.1671781,0.0004011276,0.8031871],"study_design_scores_gemma":[0.0001118106,0.0002527654,0.0003794432,0.00003570498,0.000004646037,0.0005816994,0.000004186343,0.9606866,0.00004475185,0.03614762,0.001673789,0.00007699194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07167049,0.00007594105,0.9186922,0.009288355,0.00005461381,0.00005639077,5.571195e-7,0.00003360806,0.000127828],"genre_scores_gemma":[0.553344,0.00001414992,0.4462139,0.0003665699,0.00004458629,8.851355e-7,6.914634e-8,0.000001877969,0.00001400315],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9319844,"threshold_uncertainty_score":0.4930092,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4406480758","doi":"10.1007/s11390-023-2561-y","title":"P3DC: Reducing DRAM Cache Hit Latency by Hybrid Mappings","year":2024,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Innovation Cluster (Canada)","funders":"","keywords":"Computer science; Cache; Parallel computing; Dram; Latency (audio); CAS latency; Theory of computation; Cache algorithms; CPU cache; Operating system; Embedded system; Computer hardware; Algorithm; Memory controller; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.006352724953010962,"gpt":0.2218369570312367,"spread":0.2154842320782257,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001414009,0.000120701,0.0002334644,0.000913285,0.0002134344,0.0006669146,0.001250009,0.00007700244,0.00000351836],"category_scores_gemma":[0.00003657335,0.00009129779,0.00005371566,0.00166089,0.0003134765,0.001130397,0.0003538677,0.0004007003,0.000009996079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008357796,"about_ca_system_score_gemma":0.0002522169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008514768,"about_ca_topic_score_gemma":4.705281e-7,"domain_scores_codex":[0.9984525,0.00002571719,0.0004350414,0.0003556091,0.0004051377,0.0003259992],"domain_scores_gemma":[0.9989652,0.00005331108,0.0001712686,0.0002747944,0.0004343945,0.0001010048],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002778998,0.00004916432,0.0001674334,0.00004148791,0.00005032284,0.0003861222,0.0008002351,0.0001475167,0.01372654,0.08681196,0.05906337,0.838753],"study_design_scores_gemma":[0.0002933511,0.0008951518,0.00007683061,0.000535663,0.00001312881,0.01254675,0.00006717357,0.8108593,0.01068618,0.02337786,0.1403098,0.0003387622],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1226927,0.002556517,0.8588763,0.0115278,0.003810325,0.00006314673,4.619531e-7,0.0001722345,0.0003004809],"genre_scores_gemma":[0.9848496,0.00008855972,0.01443428,0.0002224846,0.0002737343,0.000001412004,6.990585e-8,0.000005201439,0.0001246093],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.862157,"threshold_uncertainty_score":0.6431074,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1573250459","doi":"10.1007/bf02949821","title":"A new classification method to overcome over-branching","year":2002,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Branching (polymer chemistry); Decision tree; Data mining; Theory of computation; Decision tree learning; Node (physics); Incremental decision tree; Binary decision diagram; Artificial intelligence; Machine learning; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02423891532353754,"gpt":0.2958042842500415,"spread":0.271565368926504,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007773069,0.00008097257,0.0001589922,0.0008030077,0.0001808055,0.000280549,0.001588322,0.00004905341,0.000004914336],"category_scores_gemma":[0.00005319408,0.00006724842,0.0000228244,0.002374133,0.00008872697,0.0009576447,0.0004237165,0.0001833243,0.00001185969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004182549,"about_ca_system_score_gemma":0.00009935366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005187087,"about_ca_topic_score_gemma":4.93866e-7,"domain_scores_codex":[0.9988666,0.00001427978,0.0002739719,0.0002746333,0.0003603128,0.0002102598],"domain_scores_gemma":[0.998937,0.00005116467,0.0001863069,0.000401381,0.0002532807,0.0001708827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[3.337508e-7,0.00001945861,0.0001004939,0.000001000008,0.000003099255,0.00000397331,0.0002110134,0.0000104704,0.004550944,0.05004157,0.002954223,0.9421034],"study_design_scores_gemma":[0.000482927,0.000597986,0.008305082,0.00005928701,0.000008890665,0.001054447,0.00002905036,0.882494,0.00339007,0.02566945,0.07766232,0.0002464741],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009197163,0.0001257171,0.9746654,0.01556548,0.0002350914,0.00005281477,4.269589e-7,0.00005405754,0.000103846],"genre_scores_gemma":[0.08834416,0.00002150546,0.9109997,0.0004902764,0.000109688,0.00000137799,3.660342e-8,0.000002672078,0.0000306258],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9418569,"threshold_uncertainty_score":0.2951523,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016268596","doi":"10.1007/s11390-005-0017-1","title":"Book Review on ?Out of Their Minds: The Lives and Discoveries of 15 Great Computer Scientists?","year":2005,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Information Systems Theories and Implementation","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Reading (process); Theory of computation; Philosophy of science; Cognitive science; Engineering ethics; Mathematics education; Library science; Epistemology; Psychology; Philosophy; Programming language; Engineering; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01434296239903035,"gpt":0.3042089371027224,"spread":0.289865974703692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00162057,0.00005352932,0.0001866842,0.0002171636,0.0002916541,0.00006108762,0.0003362484,0.00002465447,0.00002105049],"category_scores_gemma":[0.00004207125,0.00003010006,0.00002647129,0.0004234334,0.002032655,0.0007393583,0.0000974816,0.00006584537,7.109707e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002104807,"about_ca_system_score_gemma":0.0001358635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005547482,"about_ca_topic_score_gemma":0.00001191317,"domain_scores_codex":[0.9990318,0.00004345685,0.0003812962,0.00007026894,0.0003536042,0.0001195531],"domain_scores_gemma":[0.998868,0.000071733,0.0005074979,0.0001016418,0.0004211418,0.00003001868],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002040566,0.00005300397,0.001269967,0.000202749,0.00003702919,0.000001573223,0.04126592,0.0000107132,0.0003584636,0.1125694,0.03277997,0.8114308],"study_design_scores_gemma":[0.0005637913,0.001249632,0.001655319,0.001456358,0.00002905946,0.0001148008,0.006711113,0.0006737916,0.005482996,0.002639884,0.9792647,0.0001584945],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7746108,0.08299981,0.05158481,0.08306505,0.00278542,0.001280216,0.00002077543,0.00004454345,0.003608537],"genre_scores_gemma":[0.984557,0.009074776,0.003001221,0.003042201,0.0002245503,0.000001789811,2.189905e-7,0.000002463861,0.00009579],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9464848,"threshold_uncertainty_score":0.7489402,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4249892919","doi":"10.1007/s11390-010-9377-2","title":"Volumetric Vector-Based Representation for Indirect Illumination Caching","year":2010,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Rendering (computer graphics); Global illumination; Voxel; Ray tracing (physics); Robustness (evolution); Grid; Preprocessor; Computer vision; Representation (politics); Artificial intelligence; Data structure; 3D rendering; Computer graphics (images); Mathematics; Optics","retraction":null,"screen_n_in":null,"score":{"opus":0.01567769270327406,"gpt":0.3054938971616475,"spread":0.2898162044583735,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001492614,0.00009060816,0.0001788134,0.002774826,0.0002552001,0.0002839458,0.001073665,0.00009245017,5.773572e-7],"category_scores_gemma":[0.0002866053,0.00007968489,0.00004634,0.003562196,0.0002801372,0.000841404,0.0001975158,0.000235081,2.438376e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002612223,"about_ca_system_score_gemma":0.0002659595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002514813,"about_ca_topic_score_gemma":0.000002795923,"domain_scores_codex":[0.9988086,0.00001918955,0.0003303556,0.0002628716,0.0003902137,0.0001887301],"domain_scores_gemma":[0.9977158,0.0001302722,0.0003813044,0.0002949382,0.001406273,0.00007146189],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003988962,0.00008391788,0.004483264,0.00001253898,0.000009310898,0.000006530105,0.0001589405,0.00002854163,0.01451926,0.3383576,0.0003562427,0.6419798],"study_design_scores_gemma":[0.0004854811,0.0007525356,0.007309277,0.00002520777,0.000007559287,0.000171921,0.000006463293,0.8841909,0.07514275,0.02897284,0.00277312,0.0001619401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1678245,0.00003376729,0.8297143,0.00144949,0.0007562846,0.0001120358,2.870091e-7,0.00009894736,0.00001041731],"genre_scores_gemma":[0.7675169,0.000007231072,0.2322628,0.0001213959,0.00008283069,0.000003809815,2.249964e-7,0.000003337426,0.000001562307],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8841624,"threshold_uncertainty_score":0.3249455,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}