{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Yubao Liu","is_ca":false},{"name":"Jiarong Cai","is_ca":false},{"name":"Jian Yin","is_ca":false},{"name":"Ada Wai-Chee Fu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001522176,0.001063996,0.001283575,0.009087631,0.001132074,0.002856066,0.001189881,0.001142245,0.002501728],"category_scores_gemma":[0.007556651,0.000525563,0.001432164,0.006772095,0.0004699196,0.002391671,0.001080394,0.001242978,0.002017163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000855826,"about_ca_system_score_gemma":0.001280292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002108877,"about_ca_topic_score_gemma":0.002417153,"domain_scores_codex":[0.9980692,0.00022182,0.0002617652,0.0004511868,0.0008579333,0.0001381077],"domain_scores_gemma":[0.9967043,0.0009564135,0.0002618553,0.0004531812,0.001468165,0.0001560493],"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.001097413,0.0006613533,0.01789875,0.0003734989,0.0003211978,0.0003657052,0.0003424887,0.03236965,0.02966657,0.008125515,0.01740556,0.8913723],"study_design_scores_gemma":[0.00009901564,0.0003092639,0.008876882,0.00007474307,0.000243672,0.0005521827,0.0004026192,0.9134007,0.0361388,0.02293777,0.0169031,0.00006127149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1405475,0.001880565,0.8430446,0.001184435,0.0009966471,0.001082576,0.003294742,0.004141348,0.003827539],"genre_scores_gemma":[0.4376804,0.002010755,0.5300859,0.0002645063,0.0009687713,0.0008120037,0.01408909,0.0003969062,0.0136916],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009087631,"threshold_uncertainty_score":0.008369088,"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","authors":[{"name":"Lengdong Wu","is_ca":true},{"name":"Li-Yan Yuan","is_ca":true},{"name":"Jia-Huai You","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002783392,0.0004435796,0.0005700782,0.004042186,0.0007079131,0.002261662,0.001311933,0.0005604391,0.003447457],"category_scores_gemma":[0.006004865,0.00040042,0.0004825828,0.00926667,0.0003999866,0.00377539,0.0010274,0.0005733428,0.0009461908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0010319,"about_ca_system_score_gemma":0.002388217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001945976,"about_ca_topic_score_gemma":0.002449668,"domain_scores_codex":[0.9979358,0.0003640576,0.0002363106,0.0003425652,0.0009143439,0.0002069945],"domain_scores_gemma":[0.9919144,0.003420414,0.001040822,0.0006169414,0.002383566,0.0006238983],"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.0003038874,0.0003288682,0.03433503,0.004460974,0.0001322494,0.00009472836,0.0002830384,0.003372708,0.006486431,0.01289432,0.05136896,0.8859389],"study_design_scores_gemma":[0.00004354305,0.0007262966,0.1002553,0.001831792,0.0002680138,0.0008581212,0.001226149,0.02466235,0.01083415,0.00717263,0.8520221,0.0000996315],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.2526021,0.6077002,0.06078669,0.01440835,0.001266804,0.000564411,0.004005158,0.002403224,0.05626296],"genre_scores_gemma":[0.5703962,0.3531114,0.04956647,0.003284954,0.001614054,0.0002410948,0.009721586,0.0003126703,0.01175148],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.004042186,"threshold_uncertainty_score":0.01472014,"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","authors":[{"name":"Lin Wu","is_ca":true},{"name":"Min Li","is_ca":false},{"name":"Jianxin Wang","is_ca":false},{"name":"Fang‐Xiang Wu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001290279,0.0008511198,0.0007397922,0.002667487,0.0006076864,0.001271398,0.0008876045,0.0008684703,0.002787427],"category_scores_gemma":[0.00827551,0.0003708065,0.001186566,0.001971818,0.002416246,0.002056217,0.001565762,0.001447953,0.0001916748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007567641,"about_ca_system_score_gemma":0.0005089675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002987033,"about_ca_topic_score_gemma":0.001655514,"domain_scores_codex":[0.9994123,0.0002054268,0.00003585172,0.0001264268,0.0001773969,0.00004263593],"domain_scores_gemma":[0.9928423,0.005961273,0.0004131908,0.0002329725,0.0003315438,0.000218809],"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.00005703744,0.00006051533,0.0008979708,0.0001130767,0.00005328585,0.0001874821,0.0001691245,0.1178009,0.004189015,0.836241,0.0006906413,0.03953992],"study_design_scores_gemma":[0.0000132474,0.00002586996,0.0002194863,0.0000111054,0.00001506818,0.00006061052,0.00002380529,0.4852103,0.0006712996,0.5123039,0.001429051,0.00001615655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02473149,0.001458498,0.9630104,0.0006457417,0.0001310942,0.00003158873,0.00008046558,0.0002008895,0.00970978],"genre_scores_gemma":[0.8868604,0.003846894,0.09813226,0.000292731,0.001053143,0.0002573141,0.000186178,0.0001440162,0.009227122],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002987033,"threshold_uncertainty_score":0.009324908,"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","authors":[{"name":"William Lee Croft","is_ca":true},{"name":"Jörg-Rüdiger Sack","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006453423,0.000769216,0.001815749,0.001373374,0.001404495,0.004011297,0.003330117,0.002841332,0.004437509],"category_scores_gemma":[0.02436276,0.0007126188,0.001708383,0.001666793,0.004669163,0.00834584,0.007260886,0.00428636,0.001168674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002160145,"about_ca_system_score_gemma":0.00267814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004057341,"about_ca_topic_score_gemma":0.000248334,"domain_scores_codex":[0.9924621,0.002576,0.0003967049,0.001132499,0.002553573,0.0008791091],"domain_scores_gemma":[0.987848,0.006012195,0.0007998768,0.003593361,0.001255013,0.0004915572],"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.0004469448,0.0001527951,0.0004539023,0.00009437702,0.00006001166,0.0002866159,0.0002420429,0.04422808,0.006962361,0.9083772,0.002662496,0.0360332],"study_design_scores_gemma":[0.00009510787,0.0001468452,0.0001382333,0.00002469722,0.00004137419,0.0005575191,0.00004488222,0.3944397,0.004379821,0.5973906,0.002684488,0.00005681708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02348126,0.0002580423,0.9680244,0.001274813,0.0001400063,0.00009333764,0.0001160723,0.0005183408,0.006093723],"genre_scores_gemma":[0.8905484,0.0004327253,0.09392247,0.0007172215,0.0004270703,0.0002215386,0.0001333741,0.0001128123,0.0134844],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006453423,"threshold_uncertainty_score":0.03412938,"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","authors":[{"name":"Jin-Gong Jia","is_ca":false},{"name":"Yuanfeng Zhou","is_ca":false},{"name":"Xingwei Hao","is_ca":false},{"name":"Feng Li","is_ca":false},{"name":"Christian Desrosiers","is_ca":true},{"name":"Caiming Zhang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004576445,0.000834397,0.0006893559,0.000764997,0.0002811999,0.0005335776,0.001179694,0.0007904638,0.004873184],"category_scores_gemma":[0.0007312609,0.0003313219,0.0006409422,0.000919565,0.0002864398,0.0007516659,0.0007649164,0.0009194258,0.001625039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007224019,"about_ca_system_score_gemma":0.001172976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01924661,"about_ca_topic_score_gemma":0.02909495,"domain_scores_codex":[0.9997696,0.0000177151,0.00001108477,0.00008198523,0.00005817178,0.00006142805],"domain_scores_gemma":[0.9997413,0.0000652256,0.00003065216,0.00004646205,0.00008157508,0.00003492693],"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.0005912065,0.0002835141,0.002104538,0.0001097837,0.0001192244,0.0001511138,0.00003825631,0.07318875,0.04813056,0.004189393,0.01106916,0.8600246],"study_design_scores_gemma":[0.000007706917,0.00004981745,0.00123112,0.000009181931,0.00002407595,0.00005387378,0.000008417429,0.9863999,0.00878062,0.002027004,0.001400059,0.000008266847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08570197,0.00193442,0.8991839,0.0004193088,0.0003197889,0.00008718538,0.001673471,0.005823145,0.00485681],"genre_scores_gemma":[0.7492533,0.00148751,0.22557,0.0002800947,0.0001773946,0.000129223,0.003641164,0.0002454248,0.01921585],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01924661,"threshold_uncertainty_score":0.03826916,"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","authors":[{"name":"Pierre Bourque","is_ca":true},{"name":"S. Oligny","is_ca":true},{"name":"Alain Abran","is_ca":true},{"name":"Bertrand Fournier","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008868127,0.001207516,0.001073054,0.002129035,0.0008356794,0.002566293,0.002772488,0.001868683,0.003395772],"category_scores_gemma":[0.03203012,0.001723133,0.001685789,0.002274327,0.0009096838,0.004683143,0.001689298,0.002673353,0.0008801772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003188781,"about_ca_system_score_gemma":0.003320204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01247648,"about_ca_topic_score_gemma":0.01099981,"domain_scores_codex":[0.9972808,0.001474955,0.0002128829,0.00029754,0.0004583325,0.0002754137],"domain_scores_gemma":[0.9716912,0.02361758,0.001483419,0.001021373,0.001649247,0.0005372514],"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.00004707326,0.00009672209,0.001606945,0.000104081,0.00005366858,0.00006719919,0.0002469617,0.8449022,0.0003620397,0.1110005,0.001441819,0.04007085],"study_design_scores_gemma":[0.00001003369,0.00002015604,0.000219173,0.00003067277,0.00002197262,0.00001297362,0.00004445764,0.9365751,0.0001584534,0.0615319,0.001364921,0.00001015806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0170926,0.0004381834,0.9783226,0.0003236033,0.00004221031,0.00006569843,0.0001309869,0.0002125609,0.003371635],"genre_scores_gemma":[0.5668373,0.001787079,0.4231686,0.0001741319,0.0001368085,0.0007002953,0.0008109233,0.0003835201,0.006001397],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01247648,"threshold_uncertainty_score":0.04689968,"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","authors":[{"name":"Xian Zhang","is_ca":false},{"name":"Yu Hao","is_ca":false},{"name":"Xiaoyan Zhu","is_ca":false},{"name":"Ming Li","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002464168,0.0004422682,0.001175372,0.003955917,0.0009064375,0.002303125,0.001423577,0.001316873,0.001770593],"category_scores_gemma":[0.010442,0.0002440592,0.0008105715,0.00340751,0.0008604312,0.00541521,0.001410633,0.001133093,0.0003526309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001507508,"about_ca_system_score_gemma":0.001144595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001883664,"about_ca_topic_score_gemma":0.0009460891,"domain_scores_codex":[0.9966888,0.0008499724,0.000352272,0.0006553017,0.001331342,0.0001223395],"domain_scores_gemma":[0.9950422,0.002711821,0.0002129494,0.0004321744,0.001405816,0.0001950481],"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.0007743758,0.0004734341,0.01044122,0.0007368404,0.0003010186,0.000326115,0.0006044324,0.05072978,0.01587851,0.2563598,0.01205867,0.6513158],"study_design_scores_gemma":[0.00004523612,0.0002596047,0.004204428,0.00004162858,0.0001261058,0.0004853917,0.0001506586,0.8665485,0.009996169,0.1061984,0.01185528,0.0000885161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03537794,0.004430869,0.9548151,0.0007767126,0.0002710139,0.0001055665,0.0003841968,0.0006119639,0.003226555],"genre_scores_gemma":[0.5598829,0.002312975,0.4325354,0.0002309559,0.0006029864,0.0002600866,0.0009236168,0.00008727793,0.003163815],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003955917,"threshold_uncertainty_score":0.01303196,"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","authors":[{"name":"Zheng Gong","is_ca":false},{"name":"Pieter Hartel","is_ca":false},{"name":"Svetla Nikova⋆","is_ca":false},{"name":"Shaohua Tang","is_ca":false},{"name":"Bo Zhu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002302705,0.001175776,0.001080082,0.002083695,0.001717849,0.001393699,0.001531059,0.001484189,0.00431309],"category_scores_gemma":[0.01020152,0.0005547384,0.0007740182,0.001360869,0.001151866,0.002766097,0.004708488,0.003089901,0.003207827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009459326,"about_ca_system_score_gemma":0.002045044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009264431,"about_ca_topic_score_gemma":0.001000918,"domain_scores_codex":[0.9978619,0.0005559573,0.0001877476,0.0001938953,0.0008835782,0.000316949],"domain_scores_gemma":[0.994142,0.002020319,0.0007725667,0.001373909,0.001348199,0.000343019],"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.00220381,0.0002587456,0.001697124,0.001113691,0.000164114,0.0006462706,0.0004686498,0.03201475,0.0741739,0.09909843,0.0315369,0.7566237],"study_design_scores_gemma":[0.0004394916,0.001398739,0.001621652,0.0005318638,0.0002414357,0.00242228,0.0002388738,0.6597508,0.1031794,0.1282744,0.1014993,0.0004018564],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00965875,0.001033955,0.9790101,0.000370293,0.0003024203,0.0002763623,0.0002914422,0.006732739,0.002323992],"genre_scores_gemma":[0.3939731,0.001656189,0.5831574,0.001347278,0.0004342556,0.002097505,0.001564806,0.001162332,0.01460725],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00431309,"threshold_uncertainty_score":0.01442868,"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)","authors":[{"name":"Haixun Wang","is_ca":false},{"name":"Jian Pei","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001313791,0.0007030067,0.00173371,0.007503256,0.001737513,0.002223104,0.002118075,0.001650937,0.004484063],"category_scores_gemma":[0.007841931,0.0008008349,0.00185085,0.006033236,0.001254741,0.002681459,0.001894912,0.001158965,0.002396897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001007953,"about_ca_system_score_gemma":0.0009246934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003408153,"about_ca_topic_score_gemma":0.00373029,"domain_scores_codex":[0.9977156,0.0005613737,0.0001585595,0.0007680634,0.0006776614,0.0001187873],"domain_scores_gemma":[0.9962835,0.001190142,0.0002949607,0.001176811,0.0009157684,0.0001388086],"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.0004936116,0.0003056926,0.007434618,0.0004346246,0.0007026057,0.0002192752,0.0004086849,0.1146974,0.01648911,0.06087385,0.01658835,0.7813521],"study_design_scores_gemma":[0.00005578199,0.0001118451,0.003226678,0.00003084155,0.0001268663,0.0004286797,0.0001550211,0.8884218,0.006975341,0.09215859,0.008257646,0.00005083321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02949607,0.0005040379,0.9644519,0.0002965475,0.0001395587,0.0002962284,0.0004522345,0.001233849,0.003129572],"genre_scores_gemma":[0.3159715,0.000498555,0.6710779,0.0001652994,0.0002187902,0.0004684509,0.002403581,0.0004330055,0.008762899],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007503256,"threshold_uncertainty_score":0.01500064,"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","authors":[{"name":"Sara Elmidaoui","is_ca":false},{"name":"Laila Cheikhi","is_ca":false},{"name":"Ali Idri","is_ca":false},{"name":"Alain Abran","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00583509,0.0009006947,0.001126838,0.003283351,0.0004646693,0.001277253,0.001290398,0.001264075,0.0009520157],"category_scores_gemma":[0.03047606,0.0002799909,0.0008625113,0.002144604,0.0003289225,0.001717994,0.0007219893,0.001790001,0.0005720058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007098483,"about_ca_system_score_gemma":0.000717418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005471905,"about_ca_topic_score_gemma":0.004715855,"domain_scores_codex":[0.9968141,0.001000675,0.0003605534,0.0003775501,0.001273049,0.0001741983],"domain_scores_gemma":[0.9690552,0.02289803,0.001540335,0.002193343,0.004128047,0.0001850622],"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.0003959026,0.0004044361,0.06254731,0.0002221128,0.0003738617,0.00007539256,0.0001024808,0.274528,0.003667108,0.001784066,0.00300647,0.6528929],"study_design_scores_gemma":[0.000008985484,0.00009644408,0.005497693,0.00002506532,0.00005696151,0.00004799752,0.00001573656,0.990274,0.002215105,0.001447244,0.0003049124,0.000009854648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3528957,0.005774235,0.6339315,0.001107931,0.0001999282,0.00008733555,0.0008615651,0.00201291,0.003128879],"genre_scores_gemma":[0.9186466,0.001091317,0.07744608,0.0001005242,0.0001605364,0.0000502823,0.0009587919,0.00008289755,0.001463003],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00583509,"threshold_uncertainty_score":0.03085923,"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","authors":[{"name":"Li Chen","is_ca":true},{"name":"Baochun Li","is_ca":true},{"name":"Bo Li","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002527912,0.001199553,0.00166965,0.003230428,0.0006747858,0.003430933,0.002784633,0.001367499,0.002003629],"category_scores_gemma":[0.006757652,0.0009561108,0.0005937163,0.007437513,0.0006578141,0.00544095,0.001266901,0.001179311,0.0007296782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001072921,"about_ca_system_score_gemma":0.001795748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002143644,"about_ca_topic_score_gemma":0.002304999,"domain_scores_codex":[0.9980577,0.0003413255,0.0002311116,0.000447859,0.0006918549,0.0002302569],"domain_scores_gemma":[0.9949268,0.003221174,0.0003818786,0.000342611,0.0009083855,0.0002191104],"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.0001634129,0.0002626784,0.007039534,0.003503386,0.00009850365,0.00006612617,0.0002017612,0.02203137,0.002615691,0.01752706,0.007867916,0.9386226],"study_design_scores_gemma":[0.0001340102,0.001339415,0.01429019,0.005745246,0.0006526496,0.002695641,0.00239471,0.2447571,0.01883785,0.07187981,0.6370456,0.000227833],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.03425979,0.8343088,0.1124693,0.002163731,0.0004759084,0.0001067336,0.0002175456,0.0004040369,0.01559411],"genre_scores_gemma":[0.184865,0.7451418,0.06366473,0.0008451678,0.001498286,0.0001041719,0.000572808,0.0001458386,0.003162232],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.003430933,"threshold_uncertainty_score":0.01336902,"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","authors":[{"name":"Liya Liu","is_ca":true},{"name":"Osman Hasan","is_ca":true},{"name":"Sofiène Tahar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005655689,0.0008726777,0.0008751316,0.001701022,0.001542896,0.004870666,0.002859274,0.001423383,0.006143828],"category_scores_gemma":[0.0184726,0.001080312,0.003681493,0.00111571,0.004231674,0.008505559,0.003341989,0.003680084,0.000558449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00272475,"about_ca_system_score_gemma":0.002380497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005907326,"about_ca_topic_score_gemma":0.007296607,"domain_scores_codex":[0.9962948,0.001202577,0.0003819257,0.0004856696,0.001052776,0.0005822777],"domain_scores_gemma":[0.9727065,0.02285989,0.001146271,0.001717379,0.00113319,0.0004368363],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002377933,0.000171313,0.001745471,0.0002887711,0.0001414452,0.0006997177,0.001041855,0.1513055,0.002444852,0.8222842,0.001109811,0.01852929],"study_design_scores_gemma":[0.0000882086,0.00002408085,0.000167345,0.0000496358,0.00008392806,0.00006869562,0.0001596924,0.3610446,0.003648413,0.6328689,0.001769969,0.0000263132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02331622,0.00009769945,0.9711053,0.0005200646,0.00005214753,0.0001001514,0.0002453832,0.001098482,0.003464559],"genre_scores_gemma":[0.7719461,0.0002314397,0.2229096,0.0002938781,0.0001179551,0.0002011424,0.0008020827,0.0002996905,0.003198195],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006143828,"threshold_uncertainty_score":0.0299105,"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","authors":[{"name":"Yuntao Qian","is_ca":false},{"name":"Ching Y. Suen","is_ca":true},{"name":"Yuanyan Tang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007570403,0.002098446,0.003790447,0.004085946,0.001699149,0.001800075,0.002970127,0.001389736,0.004255399],"category_scores_gemma":[0.01536579,0.001913576,0.003444755,0.008516218,0.001120421,0.002724541,0.002200796,0.003111911,0.002173537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001045923,"about_ca_system_score_gemma":0.0019869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003964857,"about_ca_topic_score_gemma":0.005541536,"domain_scores_codex":[0.9918153,0.003697622,0.0006174701,0.001318145,0.002312546,0.0002389619],"domain_scores_gemma":[0.9866599,0.007976015,0.0007139035,0.002264766,0.002103712,0.0002815948],"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.0007070606,0.0002272577,0.002047473,0.0008253524,0.0009595724,0.0001242264,0.000256841,0.1141478,0.008629548,0.02017779,0.007669399,0.8442277],"study_design_scores_gemma":[0.00009521714,0.0002187722,0.001315508,0.00004649058,0.000284786,0.0002518559,0.00006157209,0.9206611,0.00456325,0.0636488,0.008785234,0.00006754018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00166235,0.0004306716,0.996863,0.00004597038,0.0000679143,0.00007186655,0.00008836374,0.0005310143,0.0002388175],"genre_scores_gemma":[0.03424082,0.0005296062,0.9620907,0.00006990105,0.0001639819,0.000451553,0.0006437394,0.0002844326,0.001525355],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007570403,"threshold_uncertainty_score":0.04003656,"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","authors":[{"name":"Maojun Zhang","is_ca":false},{"name":"Nicolas D. Georganas","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001921342,0.0007105234,0.001501292,0.001861111,0.001435699,0.001790384,0.001912664,0.001452965,0.002135625],"category_scores_gemma":[0.005486529,0.000484226,0.0005105593,0.001474735,0.0005607268,0.002189867,0.001361239,0.0008971419,0.0009995741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000863914,"about_ca_system_score_gemma":0.001374888,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009592794,"about_ca_topic_score_gemma":0.00775924,"domain_scores_codex":[0.9984812,0.0003364607,0.0001178459,0.0002534075,0.0006144495,0.0001966839],"domain_scores_gemma":[0.996941,0.001111821,0.0002212141,0.0005798392,0.0009638206,0.0001822647],"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.001080081,0.0004669693,0.003238213,0.00009150038,0.0001069252,0.00009544751,0.000315367,0.09175755,0.01891008,0.01443284,0.005843099,0.863662],"study_design_scores_gemma":[0.0000857537,0.0001499526,0.0009568546,0.00001054353,0.00005583719,0.00008928956,0.00008680195,0.9774534,0.01255569,0.004826831,0.003694449,0.00003451814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02495407,0.0002560232,0.9717768,0.0001171873,0.0001485499,0.00007215462,0.000039726,0.001373902,0.001261598],"genre_scores_gemma":[0.3487473,0.0002298847,0.6448706,0.0001189116,0.0001442147,0.0001228415,0.0002567515,0.0001498961,0.005359685],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009592794,"threshold_uncertainty_score":0.0190739,"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)","authors":[{"name":"Meng Chen","is_ca":false},{"name":"Xiaohui Yu","is_ca":true},{"name":"Yang Liu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000363293,0.0006014858,0.0009526673,0.007897587,0.0009999702,0.001054757,0.001473757,0.001097529,0.001961603],"category_scores_gemma":[0.003330294,0.0003007373,0.0009122707,0.005552428,0.0003566155,0.00232856,0.001133895,0.0006357154,0.001065764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004791762,"about_ca_system_score_gemma":0.001021396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007202259,"about_ca_topic_score_gemma":0.01268929,"domain_scores_codex":[0.9991732,0.00006057367,0.0001090725,0.0002325527,0.000328181,0.00009635914],"domain_scores_gemma":[0.9982452,0.0004712789,0.0003093574,0.0002608506,0.0005246273,0.000188576],"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.00134085,0.001495585,0.3652973,0.0004686066,0.0005067783,0.001528637,0.0005071975,0.02903496,0.02062644,0.007306009,0.01233201,0.5595556],"study_design_scores_gemma":[0.00007659003,0.0007930592,0.08507912,0.0001052608,0.0004608691,0.002252366,0.001441777,0.8629402,0.01863238,0.01806322,0.01006766,0.00008756254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8101864,0.00202947,0.1775637,0.0003548556,0.0002419074,0.0002815863,0.003092404,0.001481121,0.004768532],"genre_scores_gemma":[0.9154114,0.0004869445,0.07778232,0.00006439457,0.0001168796,0.00008817346,0.003987944,0.00005692125,0.002004966],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007897587,"threshold_uncertainty_score":0.01432067,"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","authors":[{"name":"Chong Long","is_ca":false},{"name":"Minlie Huang","is_ca":false},{"name":"Xiaoyan Zhu","is_ca":false},{"name":"Ming Li","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001277056,0.001461516,0.00176578,0.004232118,0.001301723,0.002591013,0.001737449,0.001387102,0.006069488],"category_scores_gemma":[0.003799732,0.000552116,0.0012478,0.003744302,0.0005497162,0.00289179,0.001703596,0.001599316,0.004200967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005561239,"about_ca_system_score_gemma":0.001314919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002544437,"about_ca_topic_score_gemma":0.005218999,"domain_scores_codex":[0.9975706,0.00032387,0.0003093137,0.0005386808,0.001133331,0.0001241993],"domain_scores_gemma":[0.9973772,0.0006298596,0.0001338198,0.0005452137,0.00122322,0.00009068014],"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.0002060013,0.0001216157,0.0003033599,0.0002341679,0.0001355849,0.0001343863,0.0001535514,0.005677796,0.03124106,0.006845803,0.0118649,0.9430818],"study_design_scores_gemma":[0.0001591535,0.0005530834,0.001500376,0.00008538424,0.0005608184,0.001339548,0.0002822015,0.788712,0.08160505,0.02693804,0.09809916,0.0001653204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00286287,0.000933682,0.9910595,0.0002100707,0.0004308325,0.0001790607,0.0002958412,0.0028554,0.001172668],"genre_scores_gemma":[0.03279831,0.0007759003,0.9544558,0.0001985409,0.0007263093,0.0002470867,0.00130701,0.0003358734,0.009155205],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006069488,"threshold_uncertainty_score":0.02030444,"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)","authors":[{"name":"Wenguo Liu","is_ca":false},{"name":"Dan Feng","is_ca":false},{"name":"Kenneth B. Kent","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002205386,0.0004429701,0.000478471,0.0005129796,0.000420141,0.000891655,0.001689515,0.0002837465,0.004605256],"category_scores_gemma":[0.0006487868,0.0001908301,0.000180854,0.0005570615,0.0002775127,0.001156174,0.0008241373,0.0003937856,0.0009262061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004827473,"about_ca_system_score_gemma":0.0008251935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001534246,"about_ca_topic_score_gemma":0.005634498,"domain_scores_codex":[0.9997597,0.00003069339,0.00001833118,0.00005050913,0.00008153055,0.00005924103],"domain_scores_gemma":[0.9991711,0.0001203441,0.00007497425,0.000273258,0.0002685018,0.00009190846],"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.005432141,0.0008972624,0.01612724,0.0008524379,0.0002680114,0.001392738,0.0005564039,0.01951391,0.4747225,0.008183782,0.05596525,0.4160884],"study_design_scores_gemma":[0.0005726633,0.004661106,0.00611944,0.000102861,0.0003510613,0.001380555,0.000472935,0.4310904,0.4945224,0.002344996,0.05820119,0.0001805675],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8956345,0.002964096,0.06048831,0.0005105537,0.0005267641,0.0001254969,0.0007214232,0.02207774,0.01695106],"genre_scores_gemma":[0.9675568,0.000260484,0.02154957,0.0002314862,0.00007787106,0.00003475502,0.0007191323,0.0003096854,0.009260249],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004605256,"threshold_uncertainty_score":0.01540613,"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","authors":[{"name":"Tingting Lin","is_ca":true},{"name":"Xuejia Lai","is_ca":false},{"name":"Weijia Xue","is_ca":false},{"name":"Yin Jia","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007878701,0.0005033936,0.000802326,0.0005767959,0.0007860647,0.001490603,0.0008845878,0.001245071,0.005840534],"category_scores_gemma":[0.0009519649,0.0002595987,0.0006052958,0.0006920142,0.0007173127,0.003499683,0.001736063,0.001476048,0.003144007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006180825,"about_ca_system_score_gemma":0.000928925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001410576,"about_ca_topic_score_gemma":0.0001963988,"domain_scores_codex":[0.9991919,0.0001549407,0.00005665308,0.0001607209,0.000295834,0.0001398625],"domain_scores_gemma":[0.9995589,0.00008334916,0.0000391822,0.0001893644,0.0000832478,0.00004589031],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009431544,0.0002843608,0.0003997204,0.0003831892,0.00008634392,0.0005504501,0.0003187811,0.007607249,0.0655117,0.7632146,0.01807764,0.1426229],"study_design_scores_gemma":[0.0006763586,0.0006688953,0.0009753256,0.0002023692,0.0001816268,0.003500368,0.0001292411,0.1480331,0.1077869,0.5297258,0.2078276,0.000292483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06988047,0.001796309,0.864583,0.002502113,0.001056126,0.0003097392,0.0007669659,0.002146433,0.05695891],"genre_scores_gemma":[0.6304682,0.001349535,0.291548,0.001431477,0.0003969498,0.0003603559,0.0009525965,0.0003078447,0.07318503],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005840534,"threshold_uncertainty_score":0.01953858,"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","authors":[{"name":"Yantai Shu","is_ca":false},{"name":"Guanghong Wang","is_ca":false},{"name":"Lei Wang","is_ca":false},{"name":"Oliver Yang","is_ca":true},{"name":"Yongjie Fan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00192479,0.0005734086,0.0008401986,0.0008983954,0.001256813,0.001613936,0.001427745,0.0008912397,0.001103525],"category_scores_gemma":[0.005616451,0.0005893341,0.0002744152,0.001129344,0.0008098473,0.002400054,0.001106932,0.0009459647,0.0002704794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008960066,"about_ca_system_score_gemma":0.001065578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001893418,"about_ca_topic_score_gemma":0.002557843,"domain_scores_codex":[0.9991397,0.0002131886,0.00006529934,0.0001135185,0.0003170689,0.0001512467],"domain_scores_gemma":[0.9964437,0.001953549,0.0003120038,0.0005922531,0.0005228372,0.0001756237],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001716456,0.0002359114,0.006195942,0.0003036966,0.0002008951,0.0006239886,0.0005419678,0.4682567,0.06478722,0.07840371,0.006155011,0.3725785],"study_design_scores_gemma":[0.00004731331,0.0001390367,0.0005011262,0.00001558875,0.00006633651,0.0002587698,0.00009878156,0.9592426,0.008565879,0.02678034,0.00424682,0.00003736631],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.197496,0.00306286,0.7924315,0.0008794395,0.0004219076,0.00006286476,0.00008390178,0.001636392,0.003925204],"genre_scores_gemma":[0.9259952,0.0006987684,0.07108977,0.00007225604,0.000194187,0.00002543688,0.00006332105,0.00006966883,0.001791527],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00192479,"threshold_uncertainty_score":0.01017934,"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)","authors":[{"name":"David Zhang","is_ca":false},{"name":"Guang-Ming Lu","is_ca":false},{"name":"Adams Wai‐Kin Kong","is_ca":true},{"name":"M. C. Wong","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002783421,0.000399987,0.0005265002,0.0008505568,0.0005343113,0.0004715473,0.000561868,0.0007316254,0.02383488],"category_scores_gemma":[0.0005523473,0.0001995683,0.0002118829,0.0004499197,0.0001194665,0.0009642871,0.0004314174,0.0003624102,0.007152734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002193644,"about_ca_system_score_gemma":0.0002967621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004978169,"about_ca_topic_score_gemma":0.0009891362,"domain_scores_codex":[0.9996934,0.00004242541,0.00001596534,0.00006019519,0.0001466803,0.00004138548],"domain_scores_gemma":[0.9995536,0.00008286881,0.00003464903,0.000106842,0.0001893456,0.00003268861],"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.001083932,0.0004290693,0.003117558,0.000152734,0.00002551754,0.0003858223,0.00008543358,0.0008494418,0.4236738,0.0007308061,0.01046604,0.5589999],"study_design_scores_gemma":[0.0002095872,0.001249138,0.04324656,0.00008424198,0.0002818957,0.003853129,0.0002147427,0.09041218,0.8114116,0.001236339,0.04765867,0.0001418921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4627171,0.001280568,0.4740413,0.0005252292,0.0006516398,0.0005701325,0.001375705,0.02498449,0.03385393],"genre_scores_gemma":[0.8340467,0.0006172693,0.1138146,0.0004717874,0.0001342547,0.0003001435,0.000897772,0.0003608492,0.04935665],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02383488,"threshold_uncertainty_score":0.07973564,"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","authors":[{"name":"Jin Huang","is_ca":false},{"name":"Feng Zhao","is_ca":false},{"name":"Jian Chen","is_ca":false},{"name":"Jian Pei","is_ca":true},{"name":"Jian Yin","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003135497,0.0006043332,0.0005927472,0.001161191,0.002489073,0.00280502,0.002011732,0.001716665,0.002563614],"category_scores_gemma":[0.01209246,0.0003516804,0.000592956,0.004005019,0.002043645,0.003430507,0.001677175,0.001504281,0.000491016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001538156,"about_ca_system_score_gemma":0.001868225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01082507,"about_ca_topic_score_gemma":0.01435418,"domain_scores_codex":[0.9979996,0.0007212,0.00009203905,0.0002625056,0.0007222868,0.0002022598],"domain_scores_gemma":[0.9925431,0.004073742,0.0003148912,0.001430864,0.001202372,0.0004350347],"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.0009243846,0.0007513072,0.01866991,0.0008437034,0.0001622177,0.002523653,0.008725371,0.3501928,0.02423296,0.2305165,0.01961584,0.3428412],"study_design_scores_gemma":[0.0001479988,0.0001547775,0.003769388,0.00006942745,0.00007420006,0.00104373,0.002893988,0.8301032,0.01336387,0.1099629,0.03837349,0.00004308079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4176528,0.0008907462,0.5558274,0.002938377,0.00008277965,0.000269986,0.0002916443,0.00214351,0.01990277],"genre_scores_gemma":[0.6816078,0.0004756313,0.3117653,0.0001281583,0.00006964339,0.00005371205,0.000301263,0.000430776,0.005167638],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01082507,"threshold_uncertainty_score":0.02152413,"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","authors":[{"name":"Suchakrapani Datt Sharma","is_ca":true},{"name":"Michel Dagenais","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001525751,0.0009506955,0.0009452723,0.001526436,0.0008636951,0.001999429,0.001609563,0.000852256,0.003481677],"category_scores_gemma":[0.009111368,0.0004418346,0.0005242364,0.001062531,0.000368453,0.002696942,0.001535646,0.001104922,0.0009849834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000735438,"about_ca_system_score_gemma":0.002034845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007737299,"about_ca_topic_score_gemma":0.01177045,"domain_scores_codex":[0.9979995,0.0003738834,0.0001333465,0.0003264531,0.0009008441,0.0002659426],"domain_scores_gemma":[0.9922159,0.002149998,0.0005078582,0.003243259,0.001532446,0.0003504591],"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.002497761,0.001137974,0.0170175,0.0002423216,0.0001663133,0.0003190319,0.0007202551,0.06424899,0.06660993,0.007885008,0.005473271,0.8336816],"study_design_scores_gemma":[0.00005372656,0.0002829473,0.005378344,0.00002143187,0.00006192464,0.0002360169,0.0001782471,0.9292765,0.05352534,0.006529608,0.004402193,0.00005364664],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1640785,0.0004175574,0.8125838,0.0002046641,0.0001506111,0.00009173018,0.0003904553,0.01966435,0.002418278],"genre_scores_gemma":[0.8760146,0.0001038054,0.119464,0.00006027981,0.00005127535,0.00003157483,0.0003802763,0.0006372943,0.003256981],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007737299,"threshold_uncertainty_score":0.01538455,"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","authors":[{"name":"Yu Jiang","is_ca":true},{"name":"Andrew F. Tappenden","is_ca":true},{"name":"James Miller","is_ca":true},{"name":"Michael R. Smith","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00265065,0.001651881,0.002200485,0.002047873,0.0009553368,0.00254003,0.006242247,0.001759771,0.00671985],"category_scores_gemma":[0.009786482,0.0008647314,0.001627398,0.001635504,0.001167553,0.005657043,0.003905321,0.001622292,0.001603078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00152597,"about_ca_system_score_gemma":0.002879445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01764152,"about_ca_topic_score_gemma":0.01549234,"domain_scores_codex":[0.9956629,0.0008148833,0.00034137,0.0007204389,0.001952182,0.0005083401],"domain_scores_gemma":[0.9936622,0.002812858,0.0003820439,0.001680501,0.001112322,0.000350073],"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.002059878,0.0009472236,0.009109309,0.0005245878,0.0004168643,0.0009437206,0.000336058,0.2623506,0.0338747,0.04163847,0.02796965,0.6198289],"study_design_scores_gemma":[0.00006371899,0.00007241429,0.0002946965,0.00001480163,0.00004418001,0.0001100322,0.00003801428,0.9762706,0.007121561,0.01389442,0.00204934,0.00002620184],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01711874,0.0003100919,0.9456998,0.0002248217,0.00007017529,0.0001927761,0.0004913525,0.03459929,0.001292925],"genre_scores_gemma":[0.4828313,0.0001663076,0.5117902,0.0002030372,0.00007909784,0.0003168701,0.001456822,0.001109496,0.002046824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01764152,"threshold_uncertainty_score":0.03507763,"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","authors":[{"name":"Fan Bu","is_ca":false},{"name":"Xiaoyan Zhu","is_ca":false},{"name":"Ming Li","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003454671,0.001048013,0.001481955,0.005481591,0.001151379,0.002775297,0.001736783,0.00153834,0.004754843],"category_scores_gemma":[0.01506962,0.0003586694,0.001021454,0.00645317,0.001009598,0.005948819,0.002372211,0.001501324,0.002424496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000993265,"about_ca_system_score_gemma":0.001057516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001277059,"about_ca_topic_score_gemma":0.001051621,"domain_scores_codex":[0.9951244,0.001424139,0.0007075851,0.0009166264,0.001685348,0.0001418919],"domain_scores_gemma":[0.9924469,0.00282379,0.000518426,0.0008641094,0.002874366,0.0004724234],"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.0004885916,0.0002246875,0.005559725,0.0005886232,0.0001456569,0.0003020557,0.0004646644,0.01002039,0.02335981,0.1011229,0.01123189,0.846491],"study_design_scores_gemma":[0.00009742097,0.001007786,0.01000823,0.0001939997,0.0002700729,0.002448668,0.0006664782,0.6336409,0.02486143,0.2569485,0.06959409,0.000262459],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03449352,0.003624003,0.951588,0.0008229697,0.0005944475,0.0001408292,0.001179819,0.001438287,0.006118061],"genre_scores_gemma":[0.2349017,0.00191569,0.750461,0.0003225732,0.0008217136,0.0004960664,0.002568844,0.0007854205,0.007727074],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005481591,"threshold_uncertainty_score":0.01827025,"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","authors":[{"name":"Tong Li","is_ca":false},{"name":"Honglan Jiang","is_ca":false},{"name":"Hai Mo","is_ca":false},{"name":"Jie Han","is_ca":true},{"name":"Leibo Liu","is_ca":false},{"name":"Zhigang Mao","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003104823,0.0003704902,0.0003602121,0.0002872492,0.000223674,0.0006090225,0.0009182019,0.000465648,0.004466571],"category_scores_gemma":[0.001104227,0.0002578121,0.0003378203,0.0003158079,0.0002102977,0.0006331933,0.0002945182,0.0004956994,0.0005088167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008144257,"about_ca_system_score_gemma":0.001070985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003205549,"about_ca_topic_score_gemma":0.008840684,"domain_scores_codex":[0.999774,0.00003850379,0.000009780807,0.00002115511,0.0001265078,0.00003008227],"domain_scores_gemma":[0.9996718,0.0001278813,0.00003117209,0.00004269371,0.0001168104,0.000009660394],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003298836,0.00008700066,0.001707275,0.0003212275,0.0001475081,0.0001553271,0.0001231596,0.7024764,0.06155002,0.06445655,0.004500541,0.1641451],"study_design_scores_gemma":[0.000006210698,0.00003911873,0.0001230879,0.000006921176,0.00001082237,0.00002719565,0.000008748219,0.9907973,0.005389864,0.002378841,0.001208241,0.000003745743],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03526292,0.0005448016,0.9575232,0.0001859987,0.00005878888,0.00004420038,0.00007485198,0.0006009117,0.005704279],"genre_scores_gemma":[0.7142653,0.0004317212,0.2775425,0.0001750229,0.00004744004,0.0001187492,0.0001967995,0.0001126441,0.007109904],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004466571,"threshold_uncertainty_score":0.01494217,"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","authors":[{"name":"Fereshteh Amini","is_ca":true},{"name":"Moazzam Khan","is_ca":true},{"name":"Jelena Mišić","is_ca":true},{"name":"Hossein Pourreza","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003573552,0.001087244,0.001043708,0.0009759612,0.001055373,0.001326512,0.001620404,0.00115453,0.003190418],"category_scores_gemma":[0.01097174,0.0003751885,0.000266262,0.0009624569,0.001104313,0.001608888,0.001339047,0.0008654518,0.0004103962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002081958,"about_ca_system_score_gemma":0.001702352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009546068,"about_ca_topic_score_gemma":0.005600633,"domain_scores_codex":[0.9972609,0.0006385567,0.0001509694,0.0003980138,0.0006551473,0.0008963354],"domain_scores_gemma":[0.9890956,0.006005533,0.0006209931,0.0007886084,0.002757414,0.0007318218],"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.01912375,0.0009005184,0.01217867,0.0005319652,0.0003908271,0.0003577619,0.0006422178,0.8196391,0.02796452,0.006300959,0.01525891,0.09671079],"study_design_scores_gemma":[0.0004281666,0.002908748,0.009960905,0.00004282106,0.0001936979,0.0002858686,0.000500722,0.9638232,0.0177337,0.002297232,0.001721309,0.0001037103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9765196,0.001592797,0.01094309,0.0009516999,0.0003987846,0.00008178569,0.0002442713,0.001467004,0.007800928],"genre_scores_gemma":[0.9977755,0.0001089879,0.00101937,0.00004940227,0.00002236047,0.00001456424,0.0001137888,0.00002776086,0.0008682954],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009546068,"threshold_uncertainty_score":0.01898104,"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","authors":[{"name":"François Anton","is_ca":false},{"name":"Darka Mioc","is_ca":false},{"name":"Marcelo Santos","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004427478,0.0004470341,0.001182281,0.001748848,0.0006342542,0.001826037,0.001591779,0.0009199744,0.004560465],"category_scores_gemma":[0.003749793,0.0004582161,0.0005111134,0.001434662,0.001082351,0.002896982,0.00173778,0.0007833585,0.0008394284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001097364,"about_ca_system_score_gemma":0.001079433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004955721,"about_ca_topic_score_gemma":0.008559536,"domain_scores_codex":[0.9995958,0.00004963879,0.00002228834,0.0000496797,0.0002320652,0.00005059611],"domain_scores_gemma":[0.9986699,0.0005495906,0.0001167984,0.0002977564,0.0002579195,0.00010815],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004469909,0.0001449025,0.006488423,0.000377767,0.00008668247,0.0004074675,0.000711604,0.6100003,0.01062166,0.2048544,0.004294696,0.1615651],"study_design_scores_gemma":[0.00002327785,0.00001896858,0.0005223291,0.000007502851,0.000005096319,0.00005062211,0.00006276958,0.9553965,0.001425818,0.04162772,0.0008471607,0.00001216932],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2755212,0.0004282958,0.7138003,0.0001925895,0.00008244468,0.00005383962,0.000602561,0.001628606,0.007690232],"genre_scores_gemma":[0.9108436,0.0001010701,0.08725754,0.00001859273,0.00002238735,0.00002698162,0.00042113,0.0001736789,0.001135131],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004955721,"threshold_uncertainty_score":0.01525629,"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","authors":[{"name":"Sa’ed Abed","is_ca":true},{"name":"Otmane Aı̈t Mohamed","is_ca":true},{"name":"Ghiath Al-Sammane","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001677574,0.0008820322,0.0009346714,0.001659558,0.0009569862,0.001903462,0.002498333,0.000683659,0.006874699],"category_scores_gemma":[0.002782399,0.000758666,0.002713833,0.0009737646,0.001815395,0.004257776,0.003016066,0.002790138,0.001497152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008654341,"about_ca_system_score_gemma":0.001667893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001867194,"about_ca_topic_score_gemma":0.004238195,"domain_scores_codex":[0.9977429,0.0005951247,0.0001365504,0.0004818489,0.0007273205,0.0003162469],"domain_scores_gemma":[0.9970605,0.001439362,0.0001423057,0.0009790262,0.0002915695,0.00008725225],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003311062,0.0006983643,0.001552299,0.0006225183,0.0001984634,0.0004235969,0.00046705,0.1518388,0.02941889,0.5196762,0.003404335,0.2913682],"study_design_scores_gemma":[0.00005818643,0.0001242085,0.0003251714,0.00007791205,0.0001916686,0.0001019331,0.00007283035,0.532752,0.02997574,0.428078,0.008187757,0.00005464102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002338923,0.00002290502,0.9950676,0.00004581719,0.00001554746,0.00004985532,0.00004713275,0.000844204,0.001568094],"genre_scores_gemma":[0.1647828,0.0001361766,0.8296795,0.0001441404,0.00003902613,0.0001822319,0.0004797214,0.0006335058,0.003922752],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006874699,"threshold_uncertainty_score":0.02299821,"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","authors":[{"name":"Hao Lin","is_ca":false},{"name":"Ze-Feng Zhang","is_ca":false},{"name":"Qiangfeng Cliff Zhang","is_ca":false},{"name":"Dongbo Bu","is_ca":false},{"name":"Ming Li","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01476798,0.001648313,0.004373194,0.002940842,0.005191941,0.005952023,0.008432603,0.01240337,0.01648277],"category_scores_gemma":[0.1038902,0.001414575,0.003304927,0.004676681,0.00951825,0.02062901,0.007480864,0.02791438,0.004177153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001737277,"about_ca_system_score_gemma":0.002286937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003529825,"about_ca_topic_score_gemma":0.002234476,"domain_scores_codex":[0.9866177,0.005718772,0.0006856169,0.00238753,0.004007873,0.000582555],"domain_scores_gemma":[0.7598292,0.2161708,0.001721419,0.01437628,0.006543587,0.001358661],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003334473,0.0001406921,0.001061981,0.0006976299,0.0002126531,0.002554785,0.0005304053,0.02099656,0.001357454,0.5754345,0.1991702,0.1975097],"study_design_scores_gemma":[0.0000798608,0.00002465827,0.0001868834,0.0001186552,0.00004516299,0.001113631,0.0001217387,0.01806759,0.0004190623,0.9447148,0.03502934,0.00007862763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005851898,0.01365745,0.7352771,0.1937228,0.01636245,0.0001298105,0.0005316813,0.001201013,0.03326575],"genre_scores_gemma":[0.1420239,0.02501571,0.675869,0.05652635,0.06448442,0.0005682131,0.001066177,0.001814471,0.03263179],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01648277,"threshold_uncertainty_score":0.07810146,"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","authors":[{"name":"Osman Hasan","is_ca":true},{"name":"Sofiène Tahar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01604955,0.002066412,0.002108012,0.003335387,0.00150975,0.008651337,0.006293261,0.002554512,0.006473931],"category_scores_gemma":[0.1116745,0.001880905,0.00357656,0.003376046,0.005165645,0.0170164,0.003706661,0.005157523,0.0004244227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005875482,"about_ca_system_score_gemma":0.007278106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006749988,"about_ca_topic_score_gemma":0.005423663,"domain_scores_codex":[0.9804645,0.006855676,0.001293446,0.00226998,0.005608548,0.003507903],"domain_scores_gemma":[0.6875464,0.2913204,0.006777693,0.008248334,0.00426553,0.001841682],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009226628,0.0008302806,0.009942908,0.0004557092,0.0003998052,0.0002295617,0.0004262391,0.708617,0.004433843,0.2257523,0.001788204,0.04620139],"study_design_scores_gemma":[0.0001080789,0.000102951,0.0008456679,0.00002358395,0.0001026165,0.00007032613,0.00005947976,0.8531631,0.002730955,0.1423853,0.0003770639,0.00003086311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2367052,0.0007273894,0.7509658,0.001571686,0.0000940102,0.0002574542,0.0005225123,0.001609671,0.007546358],"genre_scores_gemma":[0.8299691,0.0003204107,0.166609,0.0001875136,0.0001871541,0.0001680015,0.0007475308,0.0004092745,0.001401985],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01604955,"threshold_uncertainty_score":0.08487916,"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","authors":[{"name":"Ticiana L. Coelho da Silva","is_ca":false},{"name":"Mário A. Nascimento","is_ca":true},{"name":"José Antônio Fernandes de Macêdo","is_ca":false},{"name":"Flávio R. C. Sousa","is_ca":false},{"name":"Javam C. Machado","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003479056,0.001364884,0.001736652,0.001113654,0.002908108,0.003331685,0.004468234,0.001110993,0.003714311],"category_scores_gemma":[0.008873506,0.0009152492,0.0005595509,0.003359646,0.00140486,0.006034818,0.003803426,0.001598644,0.001108372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001289172,"about_ca_system_score_gemma":0.002898413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00671999,"about_ca_topic_score_gemma":0.007298779,"domain_scores_codex":[0.9937103,0.0009094952,0.0004446819,0.001008408,0.002543439,0.001383654],"domain_scores_gemma":[0.9879517,0.003463316,0.0008193824,0.005609741,0.001455662,0.0007001868],"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.01922056,0.003164824,0.03689419,0.0007527066,0.000644195,0.002734354,0.001332061,0.2135605,0.1353944,0.0352154,0.04447022,0.5066166],"study_design_scores_gemma":[0.0002238361,0.0004165965,0.004065528,0.00001665729,0.0001018339,0.0007413068,0.0006076171,0.9588463,0.01955421,0.01183945,0.003536895,0.00004979877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.693338,0.004573585,0.274755,0.00243436,0.0007698048,0.0004664816,0.001003675,0.009676737,0.01298227],"genre_scores_gemma":[0.9677225,0.000314786,0.02911124,0.0001483246,0.000165134,0.00003632082,0.0003114428,0.0001417618,0.002048465],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00671999,"threshold_uncertainty_score":0.01839918,"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","authors":[{"name":"Shaoliang Peng","is_ca":false},{"name":"Shanshan Li","is_ca":false},{"name":"Lei Chen","is_ca":false},{"name":"Yuxing Peng","is_ca":false},{"name":"Nong Xiao","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002443004,0.0006759781,0.001605861,0.0006482963,0.0008129117,0.001035844,0.002152645,0.001175803,0.0008208143],"category_scores_gemma":[0.005680997,0.0006081095,0.0005777199,0.001028379,0.0007217904,0.002583749,0.001337407,0.00111967,0.0001802846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001135175,"about_ca_system_score_gemma":0.0009509732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001770009,"about_ca_topic_score_gemma":0.002249142,"domain_scores_codex":[0.9986899,0.0005579431,0.00005934198,0.0001433206,0.0004318845,0.0001176353],"domain_scores_gemma":[0.9980602,0.001128825,0.0001694797,0.000320334,0.0002471315,0.00007407967],"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.0001735422,0.00008415889,0.0004446943,0.0000899235,0.00006147234,0.00007999136,0.00007218717,0.9507432,0.00593374,0.01820144,0.001585652,0.02252991],"study_design_scores_gemma":[0.000005983346,0.0000180981,0.00003215897,0.000001895029,0.00000714674,0.00001043293,0.000005383916,0.9953843,0.0003571564,0.004053676,0.0001211131,0.000002576672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06807116,0.0009794452,0.9268813,0.0006142671,0.00019944,0.00008599433,0.0001179575,0.0006463022,0.002404185],"genre_scores_gemma":[0.9144324,0.0006458988,0.08316284,0.0001073991,0.0001331288,0.0001247413,0.0001353294,0.0001039582,0.001154451],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002443004,"threshold_uncertainty_score":0.01291996,"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","authors":[{"name":"Fatemeh Dorri","is_ca":true},{"name":"Ali Ghodsi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00158054,0.001462571,0.00160206,0.001040463,0.0004562126,0.001055002,0.002042588,0.002179782,0.001226916],"category_scores_gemma":[0.007025308,0.000576623,0.0009092193,0.0009186984,0.0008106082,0.002370195,0.00213792,0.00226419,0.0007762149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005874075,"about_ca_system_score_gemma":0.001181611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003208378,"about_ca_topic_score_gemma":0.00355574,"domain_scores_codex":[0.9991247,0.0002540905,0.0000572506,0.0003340667,0.0001582275,0.0000716355],"domain_scores_gemma":[0.9969841,0.00196122,0.0001267307,0.0004187651,0.0004042967,0.0001048673],"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.0007999003,0.0005034817,0.004864098,0.0004045874,0.0003531099,0.0001943054,0.0002391251,0.3487635,0.03526628,0.007231813,0.006699949,0.5946799],"study_design_scores_gemma":[0.00002462968,0.0000852772,0.0005500506,0.00001804581,0.00006024196,0.00009340998,0.00004991701,0.984762,0.005585084,0.008101689,0.000653144,0.00001646782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05301847,0.0007045948,0.9437262,0.0002296775,0.00006988006,0.00007009025,0.000086235,0.001173847,0.0009209003],"genre_scores_gemma":[0.6109488,0.0007209192,0.3818289,0.0005115847,0.0001377071,0.0001896661,0.001016115,0.0004279147,0.004218387],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003208378,"threshold_uncertainty_score":0.008358777,"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","authors":[{"name":"Lizhong Dai","is_ca":false},{"name":"Dongmei Zhao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002092895,0.0003813917,0.0005853745,0.0004005034,0.0007203402,0.0008304287,0.0006545802,0.0003007668,0.001312261],"category_scores_gemma":[0.005675699,0.0002380212,0.00011426,0.0003763224,0.0004472191,0.0006369481,0.0005169843,0.0004261764,0.00016335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009522376,"about_ca_system_score_gemma":0.001492434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00308467,"about_ca_topic_score_gemma":0.004323557,"domain_scores_codex":[0.9992617,0.000263696,0.0000555808,0.00005535957,0.0001729651,0.0001906834],"domain_scores_gemma":[0.9976714,0.001202037,0.0002362453,0.0002188115,0.0005291466,0.0001423714],"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.00217231,0.0003356299,0.003724081,0.000234992,0.00006466039,0.0003284652,0.000480111,0.7029606,0.03559464,0.02041429,0.004453789,0.2292365],"study_design_scores_gemma":[0.00005457462,0.0002080081,0.0003751655,0.000009379042,0.00001806694,0.00006674071,0.00008098981,0.9913357,0.003503232,0.00370654,0.0006301168,0.00001144174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6518962,0.002426226,0.3377502,0.0006322761,0.0004632214,0.0001220432,0.000118841,0.0006316143,0.005959352],"genre_scores_gemma":[0.9881195,0.0001393678,0.01103071,0.00003198545,0.00007571017,0.00002224816,0.00001940811,0.00001393721,0.0005470054],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00308467,"threshold_uncertainty_score":0.01106846,"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","authors":[{"name":"Sa’ed Abed","is_ca":false},{"name":"Yassine Mokhtari","is_ca":true},{"name":"Otmane Aı̈t Mohamed","is_ca":true},{"name":"Sofiène Tahar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002791499,0.001447857,0.001065917,0.002185664,0.00100063,0.002620021,0.002562577,0.001100493,0.02907743],"category_scores_gemma":[0.01073885,0.001721384,0.0024902,0.001297533,0.001144664,0.005051007,0.004078014,0.002846427,0.006273909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009913652,"about_ca_system_score_gemma":0.00185204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001617297,"about_ca_topic_score_gemma":0.003477593,"domain_scores_codex":[0.9975999,0.0008356377,0.0002725186,0.0004351844,0.0007040051,0.0001527406],"domain_scores_gemma":[0.9944268,0.00347089,0.000241421,0.001305494,0.0003982956,0.0001569514],"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.0003747743,0.0003188778,0.002511509,0.001649876,0.0001960784,0.0006253558,0.0006944625,0.046426,0.01449343,0.2304423,0.04133737,0.66093],"study_design_scores_gemma":[0.0001558046,0.00011337,0.0004322819,0.0003687576,0.0001467067,0.0006276365,0.0001432833,0.4169456,0.03193643,0.3276345,0.2213725,0.0001230171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009223959,0.00004307614,0.983459,0.00005762168,0.00005168505,0.00007584268,0.0004120352,0.01358749,0.001390863],"genre_scores_gemma":[0.03791539,0.0001508731,0.9505229,0.0001427824,0.00003850603,0.0003739598,0.001808156,0.004475675,0.004571826],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02907743,"threshold_uncertainty_score":0.09727371,"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","authors":[{"name":"Suixiang Gao","is_ca":false},{"name":"Guohui Lin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00223458,0.0006368509,0.001966724,0.001999794,0.001203783,0.00519612,0.002211451,0.001966597,0.008021026],"category_scores_gemma":[0.02337809,0.0007583198,0.0015196,0.002635327,0.001904438,0.01002441,0.002115264,0.003382533,0.0004587519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002783193,"about_ca_system_score_gemma":0.00189848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002274257,"about_ca_topic_score_gemma":0.002713765,"domain_scores_codex":[0.9972125,0.0006530234,0.0001717477,0.0005044626,0.0009272477,0.000531002],"domain_scores_gemma":[0.95617,0.03632225,0.002247631,0.002213839,0.00131533,0.001730927],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001708926,0.0007107006,0.02202812,0.0007300896,0.0003239263,0.0005960332,0.000903891,0.2011312,0.007093917,0.6494648,0.02162479,0.09368362],"study_design_scores_gemma":[0.00009995323,0.00009056921,0.002524153,0.00003283827,0.00008545181,0.0003718717,0.0001523144,0.4258934,0.00153423,0.5675629,0.001626347,0.00002600095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7638748,0.001303003,0.2117766,0.005497378,0.0000881292,0.0001908772,0.003920381,0.0008053407,0.01254346],"genre_scores_gemma":[0.9598476,0.0005346343,0.03405684,0.0002951017,0.000162546,0.0001316452,0.002328325,0.0001252238,0.002518136],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008021026,"threshold_uncertainty_score":0.026833,"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","authors":[{"name":"Ying Sai","is_ca":false},{"name":"Yiyu Yao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001626033,0.0004743738,0.0009629696,0.008555718,0.0008864112,0.003144255,0.0009032299,0.0006648423,0.001337676],"category_scores_gemma":[0.01150485,0.0006270207,0.001039051,0.00705435,0.0004929692,0.00523194,0.00080415,0.0006992172,0.0003624289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007689239,"about_ca_system_score_gemma":0.001572107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002359156,"about_ca_topic_score_gemma":0.003374756,"domain_scores_codex":[0.9982632,0.0002728034,0.0002736727,0.0001702266,0.0008849009,0.0001351857],"domain_scores_gemma":[0.9918532,0.005686986,0.0008178091,0.0004666464,0.0009337816,0.000241666],"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.0008251749,0.0007495525,0.09026209,0.002316884,0.0006864775,0.003748392,0.00181712,0.08456179,0.01719191,0.07690015,0.01302128,0.7079192],"study_design_scores_gemma":[0.0001061114,0.0005173724,0.02127729,0.0004975882,0.0008050792,0.001917354,0.002887095,0.6807537,0.03336187,0.2286583,0.02909003,0.0001282345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5590472,0.004982879,0.4214038,0.001169806,0.0001717948,0.0004503782,0.006289442,0.001399498,0.005085092],"genre_scores_gemma":[0.6670609,0.002140509,0.3222037,0.000101822,0.00008615917,0.0001377828,0.006537639,0.00004962027,0.001681918],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.008555718,"threshold_uncertainty_score":0.008599341,"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","authors":[{"name":"Verónica Cuello","is_ca":false},{"name":"Gonzalo Zarza","is_ca":false},{"name":"Maria Sofia Corradini","is_ca":true},{"name":"Michael A. Rogers","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007501399,0.002662405,0.002301913,0.005555873,0.001646695,0.008586115,0.005224218,0.002424794,0.005493267],"category_scores_gemma":[0.01781787,0.001386755,0.001734765,0.005793242,0.001813159,0.01069998,0.01025146,0.00411524,0.00496603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001275949,"about_ca_system_score_gemma":0.003015128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001601903,"about_ca_topic_score_gemma":0.001729329,"domain_scores_codex":[0.993769,0.001106822,0.0008154217,0.001507559,0.002505518,0.0002956407],"domain_scores_gemma":[0.9830574,0.004001883,0.001339939,0.007416688,0.002826233,0.001357809],"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.002312263,0.001071438,0.0165188,0.002799675,0.0007294419,0.001707525,0.002503877,0.01556513,0.0572646,0.103373,0.09791587,0.6982384],"study_design_scores_gemma":[0.0002438529,0.0004670549,0.007135021,0.000566863,0.0002112132,0.0008642597,0.001173213,0.343603,0.0885504,0.2618201,0.2948974,0.0004675362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006100562,0.001542393,0.9159689,0.003625246,0.0005915318,0.0008060456,0.0121263,0.05389289,0.005346101],"genre_scores_gemma":[0.08418623,0.002108526,0.8703907,0.002293194,0.000527952,0.002056665,0.02973745,0.003402427,0.005296839],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008586115,"threshold_uncertainty_score":0.03967166,"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","authors":[{"name":"Ming Li","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002288745,0.0003607723,0.0003247843,0.0007799043,0.001102246,0.001270137,0.000527501,0.000580654,0.03837135],"category_scores_gemma":[0.001426534,0.0001985428,0.0004198503,0.0005174966,0.001721492,0.002203551,0.001558447,0.001560333,0.00380736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007191882,"about_ca_system_score_gemma":0.0006019836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002153017,"about_ca_topic_score_gemma":0.001898968,"domain_scores_codex":[0.9998283,0.00003609071,0.000008436191,0.00005729846,0.00004671011,0.00002307542],"domain_scores_gemma":[0.9995982,0.0001038889,0.00002394902,0.0001365479,0.00007711863,0.0000603804],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001273361,0.00001031161,0.0002020774,0.0000281602,0.000006107857,0.00002660361,0.0001543026,0.002847447,0.0008140925,0.9615064,0.006899595,0.02749214],"study_design_scores_gemma":[0.000007019504,0.00001908357,0.0001740429,0.000016621,0.000005236759,0.00004796466,0.00009265167,0.01013816,0.0003301055,0.9384115,0.05075176,0.000005738656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04597881,0.001258183,0.1883379,0.00477811,0.0009187607,0.00009766418,0.0004809974,0.001995978,0.7561536],"genre_scores_gemma":[0.7185217,0.001533643,0.06917458,0.00126824,0.000435612,0.0002027577,0.001141286,0.0006295489,0.2070926],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03837135,"threshold_uncertainty_score":0,"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)","authors":[{"name":"Wenjie Li","is_ca":false},{"name":"Bin Liu","is_ca":false},{"name":"Yang Xu","is_ca":false},{"name":"Heng Liao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007685422,0.0007895029,0.001386605,0.0006538031,0.001229636,0.001316736,0.001745676,0.0006400193,0.00529054],"category_scores_gemma":[0.00103713,0.000301401,0.0003611973,0.0006639583,0.0004662768,0.001003746,0.0007779781,0.0008475101,0.0006053939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000829864,"about_ca_system_score_gemma":0.00123141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002172206,"about_ca_topic_score_gemma":0.002810037,"domain_scores_codex":[0.9995721,0.00007303964,0.0000284841,0.0001269427,0.00009197701,0.0001074126],"domain_scores_gemma":[0.999047,0.00025934,0.00008971759,0.0002033586,0.0002847138,0.0001158273],"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.01121661,0.002334109,0.007614222,0.0008018217,0.0007457357,0.002564847,0.0005704407,0.3998801,0.1819998,0.04120502,0.03556728,0.3155001],"study_design_scores_gemma":[0.000516028,0.0007204318,0.001064507,0.000007940977,0.0002234206,0.0004191783,0.00004216603,0.9716198,0.01357355,0.009277576,0.002499653,0.00003568497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5948768,0.0007511274,0.3857723,0.0007979221,0.0006955062,0.0002276007,0.0004280754,0.007766214,0.008684394],"genre_scores_gemma":[0.9795843,0.0001157283,0.01682181,0.0001071276,0.0001719689,0.00005741875,0.0001606122,0.00005914506,0.002921702],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00529054,"threshold_uncertainty_score":0.01769859,"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","authors":[{"name":"Long Zheng","is_ca":false},{"name":"Mianxiong Dong","is_ca":true},{"name":"Kaoru Ota","is_ca":false},{"name":"Hai Jin","is_ca":false},{"name":"Song Guo","is_ca":false},{"name":"Jun Ma","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001214507,0.0003438983,0.0004898037,0.0003214234,0.000307189,0.0003668434,0.0006626886,0.0003332203,0.003091741],"category_scores_gemma":[0.0002277639,0.0001348235,0.0003390934,0.000534584,0.0001350909,0.0005068982,0.0002465187,0.0002279231,0.0006603965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002170466,"about_ca_system_score_gemma":0.0003689294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000497455,"about_ca_topic_score_gemma":0.00101518,"domain_scores_codex":[0.9998674,0.00002774133,0.000006792862,0.00002032284,0.00004528019,0.00003240736],"domain_scores_gemma":[0.9999017,0.00002578871,0.000009004229,0.00002400867,0.00003330582,0.000006276769],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002943698,0.0004097298,0.003035235,0.0002911791,0.0001765294,0.0002720162,0.00008653262,0.2251814,0.4962645,0.008361171,0.004753523,0.2582245],"study_design_scores_gemma":[0.00008129115,0.0006791013,0.003029187,0.00001149347,0.0001484496,0.0002217193,0.00004316616,0.834994,0.1531252,0.003202594,0.004439661,0.00002414742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7037824,0.001606004,0.2710412,0.0005277285,0.0001625646,0.00005613091,0.000176835,0.002226193,0.02042095],"genre_scores_gemma":[0.9573449,0.0001329613,0.03559316,0.0001036123,0.0000191355,0.00002460393,0.0001276909,0.0001032912,0.00655067],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003091741,"threshold_uncertainty_score":0.01034296,"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","authors":[{"name":"Aoying Zhou","is_ca":false},{"name":"Weining Qian","is_ca":false},{"name":"Hailei Qian","is_ca":false},{"name":"Long Zhang","is_ca":false},{"name":"Yuqi Liang","is_ca":false},{"name":"Wen Jin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002858201,0.001721276,0.002491799,0.00416361,0.002556429,0.006072129,0.005838408,0.003626963,0.01971868],"category_scores_gemma":[0.008563782,0.001832969,0.00324324,0.003059686,0.001208394,0.004565442,0.006371656,0.002846384,0.004065751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001915368,"about_ca_system_score_gemma":0.002187827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00611634,"about_ca_topic_score_gemma":0.01269425,"domain_scores_codex":[0.996343,0.0008026959,0.0002730218,0.0005442979,0.001702962,0.0003340242],"domain_scores_gemma":[0.9954294,0.002005874,0.0001790883,0.001090624,0.0009670733,0.0003279243],"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.0007813863,0.0005059561,0.001920597,0.001190372,0.0003564467,0.0005514278,0.001531593,0.1412772,0.04019524,0.07563295,0.02348508,0.7125717],"study_design_scores_gemma":[0.00009352887,0.00008321916,0.0003981956,0.00005887293,0.00008515065,0.0002734909,0.0002652836,0.9227586,0.01574844,0.04111328,0.01903238,0.00008949244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00167157,0.0000411771,0.9941903,0.0000952473,0.00002167806,0.0001114585,0.0001039165,0.002819587,0.0009449942],"genre_scores_gemma":[0.02918215,0.00006700669,0.9673196,0.00007782599,0.00002234559,0.0001518771,0.0004287563,0.0007450266,0.00200548],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01971868,"threshold_uncertainty_score":0.06596553,"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","authors":[{"name":"Zhigang Jin","is_ca":false},{"name":"Yantai Shu","is_ca":false},{"name":"Oliver Yang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003711974,0.000567861,0.0006878522,0.0008489103,0.0008372236,0.001485969,0.0008930141,0.00155027,0.001867072],"category_scores_gemma":[0.04076438,0.0004940772,0.0003001501,0.001067195,0.001226522,0.002761436,0.000763445,0.001135438,0.0003388655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001961945,"about_ca_system_score_gemma":0.001167035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003019145,"about_ca_topic_score_gemma":0.003596453,"domain_scores_codex":[0.997946,0.000738513,0.00006088731,0.0001792406,0.0005038172,0.0005715323],"domain_scores_gemma":[0.9181983,0.07232457,0.002254988,0.002020364,0.004101708,0.00110017],"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.002036663,0.0006528747,0.02701192,0.0001479145,0.0001173049,0.0006347535,0.0001795539,0.889764,0.02663643,0.01628424,0.002218965,0.03431531],"study_design_scores_gemma":[0.00002752499,0.0002270435,0.009354459,0.00001009022,0.00006253971,0.0002512112,0.0001110134,0.9779738,0.005656162,0.006094132,0.0002041556,0.0000279605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9669276,0.0006152472,0.02595707,0.00118578,0.00009795669,0.00001928304,0.0001800669,0.0002973334,0.004719647],"genre_scores_gemma":[0.9989422,0.0001069765,0.0005084362,0.00003994093,0.00002605493,0.00000307489,0.00003644336,0.00002409398,0.0003126963],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003711974,"threshold_uncertainty_score":0.01963103,"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","authors":[{"name":"Wenhong Tian","is_ca":false},{"name":"Minxian Xu","is_ca":false},{"name":"Guangyao Zhou","is_ca":false},{"name":"Kui Wu","is_ca":true},{"name":"Chengzhong Xu","is_ca":false},{"name":"Rajkumar Buyya","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004439337,0.0004363128,0.0005529723,0.0004787559,0.001388139,0.001002663,0.001566086,0.0004950171,0.004801278],"category_scores_gemma":[0.0007418512,0.0002009743,0.0003137289,0.0004123918,0.0003146899,0.0008145851,0.0009381406,0.0006183152,0.000431672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004375312,"about_ca_system_score_gemma":0.001188222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004247527,"about_ca_topic_score_gemma":0.00790129,"domain_scores_codex":[0.9997162,0.00005626536,0.00001645924,0.00007239133,0.0000652781,0.00007336531],"domain_scores_gemma":[0.9997384,0.00005914368,0.00001967736,0.00004855186,0.00007463346,0.00005967273],"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.002138534,0.00087224,0.005062978,0.0003640305,0.0001551718,0.0007521739,0.0008355141,0.2143557,0.105484,0.02397932,0.01827899,0.6277213],"study_design_scores_gemma":[0.00007695788,0.0002713383,0.0009071928,0.00001132784,0.0000385504,0.0001764894,0.0001626114,0.9829078,0.007010209,0.004513745,0.00389957,0.00002424279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1637602,0.0006701017,0.8193712,0.0008294768,0.0004669675,0.0003087381,0.0001270326,0.003530567,0.01093567],"genre_scores_gemma":[0.8988872,0.0001038597,0.09555954,0.00013233,0.0000971999,0.00006188332,0.00009734851,0.00008743608,0.00497315],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004801278,"threshold_uncertainty_score":0.01606184,"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","authors":[{"name":"Zongmin Ma","is_ca":false},{"name":"Wenjun Zhang","is_ca":true},{"name":"Weiyin Ma","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01107667,0.001133301,0.001875091,0.002709313,0.001598303,0.006294356,0.004723881,0.003479399,0.007349715],"category_scores_gemma":[0.04890282,0.001788234,0.004172286,0.003988386,0.002520147,0.0181116,0.005149488,0.005029743,0.002672321],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001220391,"about_ca_system_score_gemma":0.0024486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006271629,"about_ca_topic_score_gemma":0.005361356,"domain_scores_codex":[0.9915906,0.00394514,0.0006394559,0.001631826,0.001843307,0.0003495575],"domain_scores_gemma":[0.970374,0.01904093,0.001530213,0.006489219,0.001993827,0.0005718508],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008289728,0.0001295838,0.00232349,0.0002189784,0.0002509132,0.0006482629,0.0008121959,0.08812059,0.001060275,0.826652,0.003858786,0.07584213],"study_design_scores_gemma":[0.00002690312,0.00003399073,0.0001796494,0.00005001044,0.0001131293,0.0003941034,0.00005794925,0.353629,0.0004668423,0.6364105,0.008594135,0.00004384283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001407647,0.0001546798,0.9964287,0.0006359084,0.00004617562,0.0000190155,0.0001098927,0.0001650819,0.001032961],"genre_scores_gemma":[0.1675891,0.001851144,0.821701,0.0009885946,0.0006864527,0.0002662631,0.0009078605,0.0003606406,0.005649038],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01107667,"threshold_uncertainty_score":0.05857974,"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","authors":[{"name":"Ye Chi","is_ca":true},{"name":"Rentong Guo","is_ca":true},{"name":"Xiaofei Liao","is_ca":true},{"name":"Haikun Liu","is_ca":true},{"name":"Jianhui Yue","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002589051,0.000812691,0.000434715,0.0007041281,0.0008040277,0.0009410582,0.001892084,0.0004770524,0.005603943],"category_scores_gemma":[0.001199358,0.0002470036,0.0002572141,0.001497036,0.0003297042,0.001197877,0.001065054,0.0005706958,0.0009828802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005056859,"about_ca_system_score_gemma":0.001491735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005690699,"about_ca_topic_score_gemma":0.01151562,"domain_scores_codex":[0.9996574,0.00005552491,0.00001581052,0.00006400845,0.0001162389,0.00009104369],"domain_scores_gemma":[0.9992086,0.0001641767,0.00003772155,0.0003107861,0.0002044802,0.00007411895],"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.003721029,0.0008219284,0.007919001,0.0005551285,0.0002339952,0.0005837958,0.0002917873,0.08330725,0.1326234,0.009765246,0.06565964,0.6945179],"study_design_scores_gemma":[0.0005750426,0.001380106,0.00457689,0.00004505921,0.0002142491,0.000779747,0.000362129,0.8102642,0.1466758,0.008497258,0.02655505,0.00007447891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6773586,0.004765681,0.2557172,0.0005665469,0.0007065767,0.0002744307,0.00166244,0.02999946,0.02894904],"genre_scores_gemma":[0.9124799,0.0003081479,0.07969564,0.0001897011,0.00006151877,0.00009720968,0.000892719,0.0003911134,0.005884034],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005690699,"threshold_uncertainty_score":0.01874703,"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","authors":[{"name":"Aoying Zhou","is_ca":false},{"name":"Weining Qian","is_ca":false},{"name":"Hailei Qian","is_ca":false},{"name":"Wen Jin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002861408,0.0009613814,0.001675209,0.003573216,0.001875745,0.002686712,0.003852929,0.002590847,0.005458359],"category_scores_gemma":[0.007424422,0.000487389,0.001212514,0.003460204,0.0008321084,0.003471976,0.002136635,0.002966017,0.002673104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008319166,"about_ca_system_score_gemma":0.002076237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002297604,"about_ca_topic_score_gemma":0.003444267,"domain_scores_codex":[0.997157,0.0003784648,0.0002466726,0.0006978841,0.001291231,0.0002287496],"domain_scores_gemma":[0.9937454,0.001913766,0.00037933,0.0009016777,0.002721037,0.0003387886],"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.0002219118,0.0002804396,0.002816045,0.0001492059,0.00007837379,0.0001004904,0.0001387243,0.006372154,0.008853942,0.0156772,0.01841005,0.9469015],"study_design_scores_gemma":[0.0001702922,0.0002241447,0.002142454,0.00009749246,0.0002141238,0.0008772739,0.0001269934,0.8867584,0.01593772,0.04972143,0.04361594,0.0001136776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01217919,0.0006836547,0.9797533,0.0007272364,0.000719651,0.0002058442,0.0002778882,0.002472704,0.002980557],"genre_scores_gemma":[0.1046444,0.0004155682,0.8817555,0.0007193174,0.0006152994,0.0003544635,0.0009565459,0.0004086294,0.01013038],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005458359,"threshold_uncertainty_score":0.01826,"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","authors":[{"name":"Jian Pei","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007069269,0.000629659,0.0008626304,0.00169957,0.0007397108,0.003275451,0.0007460063,0.002157765,0.04502898],"category_scores_gemma":[0.003665396,0.0003125267,0.0003400654,0.002684211,0.0006230916,0.002282653,0.0007946509,0.002089091,0.02686145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0017617,"about_ca_system_score_gemma":0.002570383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00399389,"about_ca_topic_score_gemma":0.01484563,"domain_scores_codex":[0.9994142,0.0001165446,0.00002490587,0.00006786322,0.0003300868,0.0000464058],"domain_scores_gemma":[0.9974135,0.0009266327,0.0001732769,0.00006163419,0.001063828,0.0003612028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000006060937,0.000005303238,0.00004734814,0.0001443181,0.000002961401,0.00001287646,0.00002766258,0.00001740409,0.00005266996,0.0008587253,0.9734769,0.02534776],"study_design_scores_gemma":[0.000002986968,0.000006704929,0.0001768822,0.000185904,0.000003111944,0.00005444816,0.00003078713,0.00001163803,0.00002060497,0.0005575098,0.9989465,0.000002946788],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"review","genre_gemma":"other","genre_scores_codex":[0.0007137605,0.6883905,0.0008145267,0.1303588,0.07771601,0.00006496549,0.0005840051,0.0001695543,0.1011879],"genre_scores_gemma":[0.004576739,0.3476205,0.0008310844,0.04616435,0.05545317,0.0001038256,0.0006149013,0.000151015,0.5444844],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.04502898,"threshold_uncertainty_score":0.150637,"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","authors":[{"name":"Romain Pacanowski","is_ca":false},{"name":"Xavier Granier","is_ca":false},{"name":"Christophe Schlick","is_ca":false},{"name":"Pierre Poulin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003010176,0.0009530979,0.0009394532,0.001274993,0.0003736855,0.002443504,0.001810823,0.0006234798,0.008672619],"category_scores_gemma":[0.001636343,0.0005035858,0.0006665669,0.002196391,0.0003164408,0.00197638,0.001649826,0.001067006,0.001627971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008285543,"about_ca_system_score_gemma":0.001044858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004271876,"about_ca_topic_score_gemma":0.00648289,"domain_scores_codex":[0.9996752,0.00004606539,0.00002123885,0.00003080665,0.0001718634,0.00005493639],"domain_scores_gemma":[0.999365,0.0001059363,0.00003958519,0.0002434854,0.0002115054,0.00003450098],"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.0009902328,0.0002567649,0.00108596,0.000318257,0.0001101901,0.0003002575,0.0002444798,0.1576427,0.08934231,0.05897995,0.03123088,0.659498],"study_design_scores_gemma":[0.00004042802,0.00005026164,0.0002344759,0.00002343193,0.00002749539,0.0001440417,0.00004525173,0.9374983,0.03868228,0.01124255,0.01196783,0.0000436817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01191668,0.0002812739,0.9796742,0.0001138935,0.00009596192,0.0000504673,0.0004794108,0.004728137,0.002660018],"genre_scores_gemma":[0.3452578,0.0008698419,0.6426846,0.0001381543,0.00009503243,0.0002045375,0.002290783,0.001588606,0.006870735],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008672619,"threshold_uncertainty_score":0.0290128,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}