{"meta":{"query_hash":"d16bd10738f3","filters":{"venue":"Journal of Computer Science and Technology"},"cohort_total":49,"direct_labels_cover":0,"predictions_cover":49,"exported":49,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/d16bd10738f3","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Computer+Science+and+Technology"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013781065863221347,"score_gpt":0.268831526655241,"score_spread":0.25505046079201965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500816613","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038368157,0.00005517455,0.9933656,0.001808479,0.0007743704,0.00010250018,4.941355e-7,0.00003855776,0.00001801972],"genre_scores_gemma":[0.04447594,0.000020864178,0.9552131,0.00013092971,0.00013799322,0.0000017895268,4.791229e-7,0.0000027954668,0.000016056756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989724,0.000007384421,0.00025163795,0.00026341315,0.00029329656,0.00021183783],"domain_scores_gemma":[0.9987915,0.000020902871,0.00022739022,0.00034475396,0.000491439,0.00012401446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080961874,0.00008584068,0.0001550052,0.000537667,0.00022690611,0.00026479695,0.0015081336,0.000078912446,0.000001817731],"category_scores_gemma":[0.0000613536,0.000063250794,0.000026577325,0.00081070396,0.00018304052,0.0012116458,0.00057274516,0.00022307843,0.0000014427812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004042037,0.00005021353,0.00021641448,0.0000049524074,0.000006165648,0.0000042241372,0.00006280894,0.00003186037,0.00625274,0.111800976,0.001693774,0.87987185],"study_design_scores_gemma":[0.001032201,0.0003040736,0.0004945566,0.000015121482,0.0000071191716,0.000496357,0.000008535436,0.94224215,0.008825934,0.017017717,0.029398289,0.00015797821],"about_ca_topic_score_codex":0.0000024089506,"about_ca_topic_score_gemma":0.0000011194714,"teacher_disagreement_score":0.94221026,"about_ca_system_score_codex":0.00001513049,"about_ca_system_score_gemma":0.00027357443,"threshold_uncertainty_score":0.28025126},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015518475762255969,"score_gpt":0.26688788907247896,"score_spread":0.251369413310223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560117764","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007456586,0.0052722567,0.9861393,0.0007845656,0.000095909985,0.00008089829,7.864157e-8,0.00012635259,0.000044074663],"genre_scores_gemma":[0.39231175,0.00007504741,0.6075072,0.00006695706,0.00002848622,0.0000015323706,7.828733e-9,0.0000017143277,0.0000072640514],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99910134,0.000010336361,0.000216234,0.00022942026,0.00026689967,0.00017578127],"domain_scores_gemma":[0.99893737,0.00003369251,0.00023078558,0.00022487453,0.0004535434,0.00011976176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046796104,0.00008372147,0.00014730847,0.0012269806,0.00014432482,0.00010373292,0.001342912,0.00007697843,0.0000013601824],"category_scores_gemma":[0.00008102047,0.000060715603,0.000015004621,0.0021907664,0.00017096449,0.0010270074,0.0006805386,0.0002169053,0.0000011384332],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020657897,0.000022922595,0.00022016164,0.0000065909476,0.0000029137177,0.000016825576,0.00025232733,1.351941e-7,0.016494224,0.081709065,0.00014959539,0.90112317],"study_design_scores_gemma":[0.00065290387,0.0008789237,0.0010118104,0.00016510855,0.000015492546,0.0028435632,0.000032550575,0.015130517,0.6486937,0.32592803,0.0042852936,0.00036209906],"about_ca_topic_score_codex":0.0000021306314,"about_ca_topic_score_gemma":2.8454858e-7,"teacher_disagreement_score":0.90076107,"about_ca_system_score_codex":0.000019962512,"about_ca_system_score_gemma":0.00017257436,"threshold_uncertainty_score":0.24954869},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024238915323537544,"score_gpt":0.2958042842500415,"score_spread":0.27156536892650396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573250459","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009197163,0.00012571711,0.9746654,0.015565476,0.00023509141,0.00005281477,4.2695893e-7,0.00005405754,0.00010384598],"genre_scores_gemma":[0.088344164,0.00002150546,0.91099966,0.00049027643,0.00010968804,0.0000013779901,3.6603424e-8,0.0000026720782,0.000030625797],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886656,0.000014279782,0.00027397193,0.00027463326,0.00036031278,0.0002102598],"domain_scores_gemma":[0.998937,0.00005116467,0.00018630692,0.000401381,0.00025328074,0.00017088273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077730685,0.00008097257,0.00015899223,0.0008030077,0.00018080552,0.000280549,0.0015883216,0.000049053408,0.000004914336],"category_scores_gemma":[0.000053194082,0.000067248424,0.000022824397,0.0023741333,0.00008872697,0.0009576447,0.00042371653,0.00018332426,0.000011859687],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.3375076e-7,0.000019458614,0.00010049393,0.0000010000081,0.0000030992549,0.0000039733095,0.00021101342,0.000010470404,0.0045509436,0.050041575,0.0029542227,0.9421034],"study_design_scores_gemma":[0.00048292696,0.000597986,0.008305082,0.00005928701,0.000008890665,0.0010544475,0.000029050358,0.88249403,0.0033900698,0.02566945,0.07766232,0.00024647408],"about_ca_topic_score_codex":0.0000051870875,"about_ca_topic_score_gemma":4.93866e-7,"teacher_disagreement_score":0.9418569,"about_ca_system_score_codex":0.00004182549,"about_ca_system_score_gemma":0.00009935366,"threshold_uncertainty_score":0.29515234},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.009573061431451745,"score_gpt":0.24141486421708222,"score_spread":0.23184180278563046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980666253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43660334,0.000070439346,0.5624089,0.00070785126,0.00005634695,0.000020010144,4.7105303e-7,0.000019364361,0.000113273614],"genre_scores_gemma":[0.9882192,0.000017785533,0.01154493,0.00008190026,0.00012597213,5.738162e-7,1.6054268e-7,0.0000028141708,0.000006663156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992755,0.000008942791,0.00021859865,0.00012455197,0.00020411465,0.0001682938],"domain_scores_gemma":[0.9993523,0.000015972171,0.00017559793,0.00014256345,0.0002600979,0.000053493302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028466276,0.00007078657,0.00018090977,0.00031461945,0.0001816507,0.000032408,0.00041081035,0.000026572972,0.000013998484],"category_scores_gemma":[0.0000033917931,0.000058506026,0.00003531372,0.00060341286,0.00044043508,0.00020429137,0.00023568716,0.00019171415,9.049791e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027179262,0.00010115991,0.18218575,0.0000026857583,0.000041407588,0.000025153538,0.00011511401,0.0000378959,0.0041451403,0.00091299857,0.01154079,0.8008892],"study_design_scores_gemma":[0.0038661454,0.0033705104,0.04849117,0.00034212045,0.00020301598,0.0036647355,0.00035589142,0.60093546,0.11744795,0.10674823,0.112506375,0.002068374],"about_ca_topic_score_codex":0.000009084445,"about_ca_topic_score_gemma":7.424249e-7,"teacher_disagreement_score":0.7988208,"about_ca_system_score_codex":0.000016323065,"about_ca_system_score_gemma":0.00006542374,"threshold_uncertainty_score":0.23858066},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006028355547624473,"score_gpt":0.2314365825682686,"score_spread":0.22540822702064411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982014661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19415805,0.0002563274,0.8007086,0.0043286704,0.0003735801,0.00009482263,1.14609705e-7,0.000017102546,0.00006273992],"genre_scores_gemma":[0.889936,0.000020323714,0.109542385,0.0003733921,0.00011849651,0.000004600134,2.5757819e-8,0.0000019973597,0.0000027984913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988668,0.000019099472,0.00031469818,0.00019121112,0.0003529996,0.00025518885],"domain_scores_gemma":[0.9988948,0.00005222601,0.00024963482,0.00027971168,0.00047642292,0.000047188096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008190933,0.00008828161,0.00017864237,0.00055060646,0.00017895315,0.00018135106,0.0011762723,0.000044590855,0.0000010059169],"category_scores_gemma":[0.00007790647,0.00005129642,0.000017291224,0.0015788306,0.00052346144,0.0018637525,0.00035586,0.00026254216,0.0000050846684],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034446946,0.00008482354,0.002723996,0.000034516295,0.0000052532637,0.00017701907,0.0022986361,0.000121449724,0.004530937,0.18723886,0.001098763,0.8016823],"study_design_scores_gemma":[0.0031559195,0.0036721304,0.06779345,0.0015036792,0.000025642892,0.020798163,0.0041842884,0.61577463,0.0098705515,0.22493595,0.04689251,0.0013930746],"about_ca_topic_score_codex":0.000009096104,"about_ca_topic_score_gemma":0.000003854682,"teacher_disagreement_score":0.8002892,"about_ca_system_score_codex":0.000032280466,"about_ca_system_score_gemma":0.00027111426,"threshold_uncertainty_score":0.2185826},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.046261918017077505,"score_gpt":0.27861652706140666,"score_spread":0.23235460904432914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983413912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07167049,0.00007594105,0.91869223,0.009288355,0.000054613807,0.00005639077,5.571195e-7,0.00003360806,0.00012782795],"genre_scores_gemma":[0.55334395,0.0000141499195,0.4462139,0.00036656988,0.000044586293,8.851355e-7,6.914634e-8,0.0000018779691,0.000014003147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877906,0.000015500202,0.000225561,0.00029603083,0.00046055522,0.00022328155],"domain_scores_gemma":[0.99868804,0.000049953014,0.00009555107,0.00054906117,0.000522845,0.00009453068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011022647,0.000082132436,0.00012339711,0.00028078584,0.00027245635,0.00018971539,0.0026530614,0.00003929498,0.0000021039893],"category_scores_gemma":[0.00003783947,0.0000470004,0.000009511863,0.0012267223,0.00041049294,0.0008965486,0.00049820775,0.00024211436,0.0000045401334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007960586,0.000028162543,0.00016338965,0.000002132458,0.0000067315545,0.0000146221155,0.00020595943,0.028702231,0.00010257043,0.16717806,0.00040112765,0.8031871],"study_design_scores_gemma":[0.000111810565,0.00025276537,0.0003794432,0.000035704983,0.0000046460373,0.0005816994,0.0000041863427,0.96068656,0.000044751854,0.036147617,0.0016737893,0.00007699194],"about_ca_topic_score_codex":0.0000012381405,"about_ca_topic_score_gemma":0.0000016352002,"teacher_disagreement_score":0.93198436,"about_ca_system_score_codex":0.000026378431,"about_ca_system_score_gemma":0.00047609027,"threshold_uncertainty_score":0.4930092},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.004342605606649813,"score_gpt":0.22809720189492005,"score_spread":0.22375459628827024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985018844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21347532,0.000059266073,0.7850015,0.0009990903,0.00033364497,0.00009865259,3.650524e-7,0.00002208933,0.000010064154],"genre_scores_gemma":[0.71171325,0.00009159551,0.28787455,0.0002685376,0.00004210211,0.000004133467,2.4731887e-7,0.000003385121,0.0000021715846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985094,0.000035794077,0.00035052042,0.00033494006,0.00048909296,0.00028021834],"domain_scores_gemma":[0.9991726,0.000014812773,0.00026411028,0.0003309723,0.000122615,0.000094863695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009188858,0.00011368932,0.00018103846,0.00095727755,0.00012559195,0.00018206012,0.0012227093,0.000051701863,0.0000016937275],"category_scores_gemma":[0.000011310905,0.000101743666,0.000014884457,0.0021063846,0.0003234377,0.0017827776,0.00042488409,0.00018480881,0.0000036912538],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006178203,0.00016098263,0.0003868348,0.00000258666,0.000012351415,0.00033559452,0.0006175678,0.018938417,0.0046322467,0.046936702,0.00004039317,0.9279302],"study_design_scores_gemma":[0.008079154,0.008690739,0.013928523,0.000307722,0.000030707797,0.0008989232,0.0008856208,0.7942746,0.0943848,0.06524985,0.012159326,0.0011100221],"about_ca_topic_score_codex":0.000002502826,"about_ca_topic_score_gemma":0.0000032732912,"teacher_disagreement_score":0.9268201,"about_ca_system_score_codex":0.00023277852,"about_ca_system_score_gemma":0.00021131014,"threshold_uncertainty_score":0.41489863},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00813276642335179,"score_gpt":0.21772165859485051,"score_spread":0.20958889217149873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990984688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27085635,0.00047135373,0.7261497,0.0018378262,0.00027622367,0.000033091335,1.1009759e-7,0.000027405164,0.00034794712],"genre_scores_gemma":[0.6938549,0.000090458816,0.305886,0.00015302961,0.000013452473,2.8069098e-7,2.399959e-8,8.359349e-7,9.620791e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999203,0.000014886035,0.00025960346,0.00011804887,0.00021080326,0.00019360497],"domain_scores_gemma":[0.999175,0.00003232045,0.00021968764,0.00015437373,0.00035077095,0.00006781713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009062758,0.00006966298,0.00014755919,0.000780873,0.00020364147,0.00031849067,0.0005091938,0.000050664592,8.3302723e-7],"category_scores_gemma":[0.00011959866,0.00005158105,0.000012693115,0.00132812,0.00028465086,0.0019960753,0.00019488421,0.000114748116,7.684741e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014949155,0.000016987651,0.0061444137,0.00000790631,0.000009268854,0.00001790366,0.0004978709,0.00006837842,0.00033656886,0.13552783,0.00026057585,0.8571108],"study_design_scores_gemma":[0.004251612,0.004156058,0.024725245,0.00033053913,0.00005345499,0.01589955,0.0012810215,0.5809732,0.008232591,0.23268406,0.126079,0.0013336766],"about_ca_topic_score_codex":0.0000010672792,"about_ca_topic_score_gemma":5.084265e-7,"teacher_disagreement_score":0.85577714,"about_ca_system_score_codex":0.00001635734,"about_ca_system_score_gemma":0.00015497772,"threshold_uncertainty_score":0.30712128},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.005619743502437127,"score_gpt":0.2053705500553666,"score_spread":0.19975080655292948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996087956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19514562,0.00009693728,0.8022128,0.001397615,0.00072357006,0.00015310558,3.0049574e-7,0.00010616963,0.00016390119],"genre_scores_gemma":[0.9025987,0.000009540032,0.09690431,0.000041180272,0.00038704058,0.0000062108475,8.102259e-8,0.0000054240377,0.00004753728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852455,0.000021014925,0.00045286593,0.0002936239,0.00037263284,0.00033531582],"domain_scores_gemma":[0.9983155,0.00006384813,0.00038425662,0.00029607984,0.00089089497,0.000049424725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001047368,0.00013004827,0.0003289133,0.0006560467,0.00025964953,0.00025072607,0.0010753662,0.00009264827,4.2596986e-7],"category_scores_gemma":[0.000007962066,0.00008749694,0.000050356943,0.0010888244,0.00026927717,0.0005852782,0.00010898347,0.0001387773,0.0000029938258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109461886,0.0002215487,0.0005172918,0.000106431304,0.000084599305,0.0002836003,0.00040696055,0.027273364,0.0061447155,0.81279606,0.0140397195,0.13801624],"study_design_scores_gemma":[0.0011642728,0.0017731641,0.00023910274,0.00019851793,0.000011242375,0.005560486,0.00006552336,0.98499054,0.00061673706,0.0016675189,0.0034989,0.00021400221],"about_ca_topic_score_codex":0.000007989826,"about_ca_topic_score_gemma":0.000006103078,"teacher_disagreement_score":0.9577172,"about_ca_system_score_codex":0.00007251821,"about_ca_system_score_gemma":0.00020716163,"threshold_uncertainty_score":0.35680217},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0067813075484569755,"score_gpt":0.22922571477546658,"score_spread":0.2224444072270096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998214657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44275093,0.0015228887,0.5531526,0.0022089055,0.00024814345,0.00008300744,5.624832e-8,0.000028680668,0.000004789996],"genre_scores_gemma":[0.884295,0.00044477943,0.1149747,0.00021046767,0.00006724941,0.0000022208962,7.014546e-8,0.0000040090226,0.000001525591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844015,0.00002650673,0.00044386438,0.0003472767,0.00036839236,0.00037378859],"domain_scores_gemma":[0.998954,0.0000657791,0.0003294092,0.00027274352,0.00031006805,0.00006799685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015702891,0.00011963626,0.00023520403,0.00059701235,0.00019884507,0.00024130274,0.0010350565,0.000121821155,1.9297966e-7],"category_scores_gemma":[0.00009541468,0.00009989119,0.000018005958,0.0018973845,0.00037303552,0.0013691159,0.0006300841,0.0004650105,3.5491433e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010610363,0.0000712377,0.005642401,0.0000060191114,0.000006210393,0.00010586871,0.0007152447,0.009981776,0.0016808271,0.015642326,0.00015149104,0.965986],"study_design_scores_gemma":[0.001407815,0.00079770235,0.0048277117,0.00029843798,0.0000033829103,0.00071481726,0.000060619586,0.97932357,0.00083822524,0.010795781,0.0007351273,0.00019683296],"about_ca_topic_score_codex":0.000004628438,"about_ca_topic_score_gemma":0.000009801537,"teacher_disagreement_score":0.96934175,"about_ca_system_score_codex":0.000095248484,"about_ca_system_score_gemma":0.00019683944,"threshold_uncertainty_score":0.40734446},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009523472966358878,"score_gpt":0.22457562986387813,"score_spread":0.21505215689751925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002223291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2994474,0.00021850561,0.6954242,0.004601399,0.00012482324,0.000036964273,8.492843e-8,0.000050375813,0.000096245596],"genre_scores_gemma":[0.867566,0.000026716749,0.1320498,0.00023909086,0.0000913419,6.598772e-7,1.3658769e-7,0.0000050293893,0.00002126952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841946,0.00011581913,0.00036640387,0.00028418688,0.00047985124,0.00033428043],"domain_scores_gemma":[0.99868923,0.00029803877,0.00044140482,0.00021920018,0.00022528302,0.00012682614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023737582,0.00012637187,0.00025037443,0.00040480233,0.00077239034,0.0003861686,0.0011299651,0.000066040935,9.135247e-7],"category_scores_gemma":[0.00022034728,0.00008723903,0.000030440198,0.0007654011,0.0006783989,0.00067827106,0.0006456701,0.0005048742,0.000002071698],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055891956,0.000033567747,0.033976603,0.000011602274,0.00003467327,0.000011145516,0.0025168716,0.0005178888,0.008137282,0.03530176,0.0002916305,0.9191614],"study_design_scores_gemma":[0.001449666,0.0010782635,0.020970324,0.00015142412,0.000024544244,0.0008714851,0.00076049217,0.794104,0.0016253226,0.0127334995,0.16576973,0.00046128282],"about_ca_topic_score_codex":0.000003226651,"about_ca_topic_score_gemma":2.840357e-7,"teacher_disagreement_score":0.9187001,"about_ca_system_score_codex":0.0000231782,"about_ca_system_score_gemma":0.00007188941,"threshold_uncertainty_score":0.59406805},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009527116322786296,"score_gpt":0.22880218658457224,"score_spread":0.21927507026178594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004162621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35582888,0.00011026839,0.6415449,0.0019817336,0.00040247547,0.000036358542,4.2748226e-8,0.00003147816,0.000063857464],"genre_scores_gemma":[0.9618057,0.00001196671,0.037709177,0.0003697293,0.000093007526,4.8053516e-7,5.9538085e-8,0.0000030394208,0.0000068654163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853134,0.000086233864,0.00038507525,0.0002976755,0.00036133255,0.00033832112],"domain_scores_gemma":[0.99882364,0.00013924879,0.00025109953,0.00040542943,0.00030077362,0.00007978345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004458674,0.000103266546,0.00023329056,0.0009018073,0.00013190399,0.0002150969,0.0018835277,0.000054335593,3.652201e-7],"category_scores_gemma":[0.00018294035,0.00007971635,0.00002137999,0.0020654479,0.00028352134,0.000141361,0.0011736383,0.00027858667,0.0000012643701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000542072,0.00009575996,0.059960924,0.000009060717,0.000012523555,0.00003899272,0.0002160976,0.011499966,0.00007844513,0.016284436,0.000645032,0.9111533],"study_design_scores_gemma":[0.00041611318,0.0002762552,0.03892115,0.00007503777,0.0000018071408,0.00017789184,0.000010515352,0.9564044,0.00005950233,0.0014456075,0.0021040926,0.00010761066],"about_ca_topic_score_codex":0.000011361595,"about_ca_topic_score_gemma":0.000013834952,"teacher_disagreement_score":0.94490445,"about_ca_system_score_codex":0.00003911058,"about_ca_system_score_gemma":0.000075190655,"threshold_uncertainty_score":0.35000944},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007804314696087489,"score_gpt":0.2280808822904212,"score_spread":0.2202765675943337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010870819","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7323736,0.0002735567,0.2655742,0.0013802284,0.0002874203,0.000094002186,2.2779402e-7,0.0000028413888,0.000013955227],"genre_scores_gemma":[0.9755635,0.00003079683,0.024322942,0.000061027793,0.000017275479,9.3520424e-7,2.8237256e-8,0.0000013273722,0.0000021686258],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988713,0.00006574649,0.0004590987,0.00014231204,0.00033494795,0.00012654466],"domain_scores_gemma":[0.9984595,0.00013623334,0.00058455154,0.00019897327,0.0005931564,0.000027589367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005693951,0.000068797766,0.000218215,0.0007545873,0.00006798962,0.000029558902,0.00084462477,0.00006215825,0.0000020025466],"category_scores_gemma":[0.00019203659,0.00004093116,0.000030367652,0.0032626095,0.00071638316,0.00042937783,0.00050719985,0.0001421836,1.8386554e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053901686,0.00015500991,0.092412196,0.000039696493,0.000019224555,0.0000016125342,0.00039824063,0.0057968176,0.013984827,0.027974151,0.00013030367,0.8590825],"study_design_scores_gemma":[0.00066619966,0.00058707455,0.69409186,0.00010250663,0.000009611176,0.00022554139,0.00008925636,0.23014194,0.033730168,0.040216744,0.000043167634,0.00009592129],"about_ca_topic_score_codex":0.00004478614,"about_ca_topic_score_gemma":0.00001729171,"teacher_disagreement_score":0.8589866,"about_ca_system_score_codex":0.00001885334,"about_ca_system_score_gemma":0.00022386826,"threshold_uncertainty_score":0.26395437},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007823452779745608,"score_gpt":0.19796139236190113,"score_spread":0.19013793958215552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011357342","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90212995,0.0003893148,0.09581594,0.0010292969,0.00034216797,0.00007871441,1.2509604e-7,0.000031141917,0.00018337119],"genre_scores_gemma":[0.915906,0.0006568845,0.08321481,0.00017627729,0.000032325832,8.912411e-7,1.6590585e-8,0.000003632561,0.000009145476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986218,0.000015348614,0.00029104264,0.00025651976,0.00052815175,0.00028713007],"domain_scores_gemma":[0.99884456,0.000031545947,0.00029839666,0.00034322133,0.0003919278,0.00009036946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045036568,0.00012203515,0.00025653915,0.0008295292,0.00017649741,0.00004879486,0.0010926536,0.0000694594,0.0000010004372],"category_scores_gemma":[0.000004947111,0.00009120991,0.00001929049,0.001301074,0.001253851,0.00070924655,0.00043407278,0.0002174214,8.034557e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023669115,0.00069171074,0.114611246,0.00042062489,0.0003280225,0.0024450235,0.012118708,0.0033138527,0.002528734,0.04717348,0.005426638,0.81070524],"study_design_scores_gemma":[0.0055719675,0.012711318,0.096275166,0.0010554728,0.000070603244,0.037159532,0.00037335377,0.8151519,0.019401377,0.0024370432,0.008534159,0.0012581532],"about_ca_topic_score_codex":0.000001176112,"about_ca_topic_score_gemma":8.4961476e-7,"teacher_disagreement_score":0.811838,"about_ca_system_score_codex":0.000028066781,"about_ca_system_score_gemma":0.00008665041,"threshold_uncertainty_score":0.46198663},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.012371547765110808,"score_gpt":0.2225325987843088,"score_spread":0.210161051019198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011531072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4052705,0.00006298191,0.5931884,0.0011351577,0.00023421222,0.000045712688,1.2579017e-7,0.000045449848,0.000017496226],"genre_scores_gemma":[0.7412697,0.0000463852,0.25838462,0.00024051196,0.000046639612,0.0000013684595,1.3150493e-7,0.0000056131394,0.0000050076487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798495,0.000046208508,0.00050513214,0.00039310384,0.0005770924,0.00049352355],"domain_scores_gemma":[0.9982746,0.00011907788,0.0003171284,0.00041209892,0.0007369362,0.00014015219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009085794,0.00016057977,0.00031690937,0.0014078447,0.00024939555,0.000099623685,0.0012611025,0.00015022846,6.214043e-7],"category_scores_gemma":[0.000051625615,0.00013995911,0.000039670176,0.0030250545,0.0008633941,0.00072748144,0.00027204087,0.00043561976,0.0000013772617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007970765,0.00010874311,0.002688711,0.0000036071806,0.0000031833222,0.00021099206,0.0000962018,0.9544416,0.001218021,0.0052437475,0.00008685581,0.035890333],"study_design_scores_gemma":[0.0006499023,0.00019485883,0.0008420013,0.000060046626,0.0000024189424,0.0005086118,0.000008641254,0.9944855,0.0027919062,0.00027326963,0.000035398283,0.00014745683],"about_ca_topic_score_codex":0.000004397075,"about_ca_topic_score_gemma":0.0000051621814,"teacher_disagreement_score":0.33599925,"about_ca_system_score_codex":0.00010678109,"about_ca_system_score_gemma":0.00040016585,"threshold_uncertainty_score":0.5707367},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007132869994282196,"score_gpt":0.22649981576444358,"score_spread":0.2193669457701614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013794162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47322193,0.00014543264,0.526177,0.00010360057,0.00022878493,0.000055547825,9.3603084e-8,0.00005794174,0.000009657214],"genre_scores_gemma":[0.8240569,0.00045353099,0.17526604,0.000019032646,0.00018790673,0.000001972471,3.3460273e-7,0.000011399436,0.0000028836548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898815,0.0000054751367,0.000409782,0.00014393443,0.00011863689,0.0003340495],"domain_scores_gemma":[0.9994145,0.000062963976,0.00014059631,0.00010341333,0.0002216531,0.000056874353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004836946,0.00010091747,0.00023516663,0.0005332539,0.00011750903,0.00002251409,0.0002849377,0.00011938777,9.698277e-7],"category_scores_gemma":[0.00003165786,0.00009689043,0.000025598692,0.0010133005,0.00022379059,0.00040253773,0.00003735764,0.00026805725,9.668911e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046054497,0.000008576502,0.00020971705,0.0000057643642,0.0000041742373,0.000016812963,0.00004468944,0.916309,0.0007893508,0.000057063964,0.00008742028,0.082462855],"study_design_scores_gemma":[0.00036984953,0.00011625295,0.0001225748,0.000050625844,0.000003568425,0.00042879765,0.0000097477405,0.99784905,0.0006549456,0.00022127802,0.00007513059,0.00009820248],"about_ca_topic_score_codex":3.061056e-7,"about_ca_topic_score_gemma":0.0000017707378,"teacher_disagreement_score":0.35091096,"about_ca_system_score_codex":0.00009236931,"about_ca_system_score_gemma":0.000071583185,"threshold_uncertainty_score":0.39510772},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014342962399030353,"score_gpt":0.3042089371027224,"score_spread":0.289865974703692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016268596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7746108,0.08299981,0.051584814,0.08306505,0.0027854196,0.0012802162,0.000020775435,0.000044543453,0.0036085367],"genre_scores_gemma":[0.984557,0.009074776,0.0030012205,0.0030422013,0.00022455025,0.0000017898112,2.1899048e-7,0.0000024638607,0.000095790005],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903184,0.000043456846,0.0003812962,0.000070268936,0.0003536042,0.00011955313],"domain_scores_gemma":[0.998868,0.000071733004,0.0005074979,0.00010164182,0.00042114183,0.000030018684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016205704,0.000053529322,0.00018668418,0.00021716362,0.00029165414,0.000061087616,0.00033624843,0.000024654466,0.000021050491],"category_scores_gemma":[0.00004207125,0.000030100056,0.000026471285,0.0004234334,0.002032655,0.0007393583,0.0000974816,0.00006584537,7.1097065e-7],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020405663,0.00005300397,0.0012699666,0.00020274898,0.00003702919,0.0000015732231,0.041265916,0.000010713198,0.00035846364,0.11256938,0.032779966,0.8114308],"study_design_scores_gemma":[0.0005637913,0.0012496321,0.001655319,0.0014563578,0.000029059462,0.000114800765,0.0067111133,0.00067379157,0.005482996,0.0026398841,0.97926474,0.0001584945],"about_ca_topic_score_codex":0.0000055474816,"about_ca_topic_score_gemma":0.000011913173,"teacher_disagreement_score":0.9464848,"about_ca_system_score_codex":0.000021048068,"about_ca_system_score_gemma":0.00013586349,"threshold_uncertainty_score":0.7489402},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007466908350015211,"score_gpt":0.2520141899348308,"score_spread":0.24454728158481562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016818970","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28725833,0.00009273518,0.7102475,0.0018146922,0.00029163872,0.00010201966,1.996042e-7,0.00004397322,0.00014891995],"genre_scores_gemma":[0.45931515,0.000036500453,0.5404476,0.00014238062,0.000031391526,0.000003819474,4.6509214e-8,0.0000031574666,0.000019921265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829435,0.00005030914,0.0004871288,0.00027093984,0.00042964416,0.00046761543],"domain_scores_gemma":[0.9985511,0.00007796986,0.00038112572,0.00039697354,0.000482117,0.0001107478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022032566,0.00012429887,0.00024849546,0.0013011559,0.0001662999,0.0002877387,0.0018023755,0.00008559947,0.000004105442],"category_scores_gemma":[0.00030648345,0.0000992176,0.000031328414,0.0020761287,0.00054198777,0.0035335084,0.0006753877,0.00037562952,0.000015697096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058955106,0.000045144272,0.0018761625,0.000009494186,0.0000065652916,0.000052813597,0.0006197783,0.00029033274,0.0036288064,0.037802935,0.00013800059,0.9555241],"study_design_scores_gemma":[0.00035728823,0.0004771549,0.016408527,0.000098241064,0.0000021076696,0.00066270406,0.000025557458,0.9643818,0.0045494786,0.012387418,0.0004722355,0.00017749054],"about_ca_topic_score_codex":0.000006602358,"about_ca_topic_score_gemma":0.0000010079588,"teacher_disagreement_score":0.9640915,"about_ca_system_score_codex":0.00007365608,"about_ca_system_score_gemma":0.0001933269,"threshold_uncertainty_score":0.40459764},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.0144270102444696,"score_gpt":0.268303194913213,"score_spread":0.2538761846687434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018196039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017147249,0.00027889822,0.9733231,0.008627145,0.0003566127,0.00016880807,0.000002010654,0.00007717984,0.000018968998],"genre_scores_gemma":[0.7950646,0.000031569365,0.20463273,0.000098342876,0.00014731252,0.000009963508,4.0567141e-7,0.0000020532084,0.000012988514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877715,0.000011847731,0.00045019857,0.00025036224,0.00033804224,0.00017241309],"domain_scores_gemma":[0.9977566,0.00004425043,0.00039342846,0.00038964165,0.001334431,0.00008164115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012517009,0.000069815294,0.00014675503,0.0014569104,0.00023692266,0.00023101342,0.0014340398,0.00006741495,5.312396e-7],"category_scores_gemma":[0.000053815973,0.000059419846,0.00003594512,0.0027452281,0.00026850484,0.00063775014,0.0002118312,0.000119900025,0.0000051730726],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010707573,0.00012069171,0.00009394437,0.000017828854,0.000006631586,8.1176427e-7,0.000078605786,0.000014271842,0.0045218663,0.215392,0.00031847414,0.7794338],"study_design_scores_gemma":[0.001459946,0.0004670108,0.009005557,0.000076225515,0.00003411181,0.0015265035,0.000219034,0.5708498,0.047306437,0.020985257,0.34762272,0.0004474377],"about_ca_topic_score_codex":6.3297705e-7,"about_ca_topic_score_gemma":0.0000025132865,"teacher_disagreement_score":0.7789864,"about_ca_system_score_codex":0.00010126917,"about_ca_system_score_gemma":0.00020312775,"threshold_uncertainty_score":0.26648265},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01806091364229341,"score_gpt":0.29793431518903896,"score_spread":0.27987340154674556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044000055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48336488,0.0000893232,0.5159064,0.00036061922,0.00017239507,0.000047384085,1.1050541e-7,0.000035851474,0.00002305126],"genre_scores_gemma":[0.53599405,0.000024897843,0.4639109,0.000054630644,0.0000135991995,4.166252e-7,6.624045e-8,0.00000114335,2.6106582e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859196,0.000040270177,0.00037886194,0.00035675615,0.00041942237,0.00021272888],"domain_scores_gemma":[0.9986643,0.00004389702,0.00033108916,0.00042452905,0.00041579243,0.00012037168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029155537,0.000106268344,0.00019762675,0.00071869756,0.0002445101,0.00022278485,0.0010562955,0.00012518598,2.2603426e-7],"category_scores_gemma":[0.00014592402,0.00008541016,0.000019814352,0.0012453998,0.0005554593,0.0023134334,0.00013507692,0.00035345074,2.846567e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006321368,0.00011862973,0.0006081242,0.0000023873336,0.0000018804546,0.0000021726053,0.00021204822,0.00001977754,0.023819761,0.020846538,0.000038542057,0.9543238],"study_design_scores_gemma":[0.0014964428,0.005090396,0.17776415,0.000094022515,0.000013843121,0.0029351746,0.00021105724,0.5522808,0.04002288,0.2188387,0.0007325546,0.0005199829],"about_ca_topic_score_codex":0.0000022605702,"about_ca_topic_score_gemma":1.2253066e-7,"teacher_disagreement_score":0.95380384,"about_ca_system_score_codex":0.000039528204,"about_ca_system_score_gemma":0.00007478093,"threshold_uncertainty_score":0.34829253},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009547070416137317,"score_gpt":0.2833963986359273,"score_spread":0.27384932821978997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044762750","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5560525,0.000032952583,0.4419206,0.0016145738,0.0002487989,0.00008433715,0.0000012503069,0.00003464827,0.000010296107],"genre_scores_gemma":[0.922911,0.0000038141916,0.0769273,0.00008420334,0.00006813914,0.0000016932634,3.7548796e-7,0.0000020085217,0.0000014546146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985182,0.000022451775,0.0003204254,0.00035673077,0.00055753865,0.00022460625],"domain_scores_gemma":[0.9984855,0.000043620144,0.00030449659,0.0003275701,0.00072589924,0.00011290936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012600286,0.000123846,0.0002829742,0.0011551027,0.0002645841,0.0004897622,0.0008601383,0.000047991165,9.724073e-7],"category_scores_gemma":[0.00007620148,0.00009197285,0.000031519347,0.00348793,0.00039762317,0.0008808418,0.00075552997,0.00032478344,7.3195747e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071576037,0.00042568165,0.015627932,0.000007768105,0.00023457168,0.007948131,0.0007915754,0.000119042226,0.0002575032,0.0066362326,0.00017492313,0.9677695],"study_design_scores_gemma":[0.0022040466,0.003688786,0.04113243,0.000038570528,0.00027525963,0.015468302,0.00093745376,0.9292258,0.0006911423,0.005166167,0.00072594633,0.0004460644],"about_ca_topic_score_codex":0.000009432163,"about_ca_topic_score_gemma":0.000013426702,"teacher_disagreement_score":0.9673234,"about_ca_system_score_codex":0.000027439692,"about_ca_system_score_gemma":0.0001602934,"threshold_uncertainty_score":0.4722788},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021245236870565853,"score_gpt":0.27247164064755136,"score_spread":0.2512264037769855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048682232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046286426,0.00015774646,0.9443109,0.008661198,0.000350833,0.00011849263,2.6680038e-7,0.00008618687,0.000027950373],"genre_scores_gemma":[0.61953133,0.000001069066,0.37972942,0.0006599555,0.00007338933,0.0000019078018,3.0788204e-8,0.0000015940901,0.0000012960411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880517,0.000016654612,0.00032479237,0.0002542248,0.0003485582,0.0002506065],"domain_scores_gemma":[0.99676245,0.00034777666,0.0003929378,0.00028950567,0.002121273,0.00008603917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010502591,0.00009561612,0.00021728917,0.000785774,0.00024126336,0.000319305,0.0012202824,0.000089610156,4.4323212e-7],"category_scores_gemma":[0.00027890204,0.00008116328,0.000028353285,0.0026006817,0.00017479197,0.0010056122,0.0001014852,0.0001767123,0.0000022384093],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004571772,0.000073877294,0.0015135107,0.00002429044,0.0000059049075,0.000008712211,0.00010676531,0.00011721205,0.0019166642,0.02409108,0.00006107898,0.97207636],"study_design_scores_gemma":[0.00081125024,0.0019522385,0.004463417,0.0006396179,0.000011853722,0.00075820414,0.000051747975,0.7736432,0.012097671,0.20335332,0.0019385612,0.00027892683],"about_ca_topic_score_codex":0.000002139475,"about_ca_topic_score_gemma":0.0000010263433,"teacher_disagreement_score":0.9717974,"about_ca_system_score_codex":0.000046359295,"about_ca_system_score_gemma":0.00045711876,"threshold_uncertainty_score":0.33097425},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04570929441094207,"score_gpt":0.31330563583075194,"score_spread":0.26759634141980987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049769908","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031227954,0.00014149155,0.9664255,0.0013815624,0.0004007778,0.00007232195,3.212776e-7,0.00008548553,0.0002646036],"genre_scores_gemma":[0.4725325,0.000025653037,0.527236,0.00009289015,0.000088897,0.0000016325773,2.5610682e-8,0.000004520719,0.000017882658],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980512,0.000043079574,0.0003489206,0.00041951382,0.0006829623,0.0004543018],"domain_scores_gemma":[0.9981445,0.000058393307,0.00024589454,0.00052119634,0.0008327311,0.00019725476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095975795,0.00014231734,0.00025826934,0.0013332224,0.0002547764,0.0003389143,0.0026190283,0.000067223715,0.0000028571799],"category_scores_gemma":[0.000097566466,0.00011718884,0.00003125159,0.0019662923,0.0006663621,0.0028522203,0.0014403377,0.0005228734,0.000005411373],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044874746,0.0001232512,0.00008498118,0.0000072465855,0.000012130284,0.00009236856,0.0007865646,0.0011820447,0.002608196,0.002555326,0.00004415321,0.99249923],"study_design_scores_gemma":[0.0005168344,0.00069394533,0.00021849967,0.00002986213,0.0000021875753,0.0032045501,0.00008420119,0.9901481,0.001777017,0.0028447653,0.00033688132,0.00014311564],"about_ca_topic_score_codex":0.0000024225574,"about_ca_topic_score_gemma":0.0000010256257,"teacher_disagreement_score":0.9923561,"about_ca_system_score_codex":0.000118019765,"about_ca_system_score_gemma":0.00009660588,"threshold_uncertainty_score":0.48668498},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020164666802462042,"score_gpt":0.2512085389561881,"score_spread":0.23104387215372607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058906553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046039104,0.00043850363,0.95271516,0.00032209628,0.00025193443,0.000040629682,2.1949857e-7,0.000104194136,0.00008818804],"genre_scores_gemma":[0.6359483,0.00007332008,0.36390874,0.00003865086,0.000016498183,9.838792e-7,4.242469e-8,0.000002456367,0.000010990452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874246,0.000017409873,0.00042264946,0.00025635035,0.00034174524,0.00021938169],"domain_scores_gemma":[0.99807215,0.000014042403,0.0005370988,0.00027664803,0.0010256937,0.00007439894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070050446,0.0001051166,0.00022499957,0.0009202587,0.00013190467,0.00004381105,0.0013579444,0.00008961492,9.882102e-7],"category_scores_gemma":[0.000047689726,0.000084338724,0.000032279844,0.0019257119,0.0006227186,0.00058250024,0.00033149065,0.00014635602,3.5686736e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027254771,0.0010777633,0.0013026067,0.00004489489,0.00003993572,0.000037323298,0.002721705,0.00026285808,0.06113055,0.094181426,0.003561238,0.8356124],"study_design_scores_gemma":[0.00078890356,0.0020917647,0.00027413535,0.00012586825,0.000012037698,0.001500783,0.000053614967,0.5499245,0.424436,0.019303856,0.0011749394,0.00031361656],"about_ca_topic_score_codex":0.000007047089,"about_ca_topic_score_gemma":2.3428701e-7,"teacher_disagreement_score":0.83529884,"about_ca_system_score_codex":0.000025269615,"about_ca_system_score_gemma":0.00023413745,"threshold_uncertainty_score":0.34392336},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019459760509158333,"score_gpt":0.22352323356644951,"score_spread":0.20406347305729117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061130392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8249392,0.00035726183,0.17231144,0.0021831065,0.00007080431,0.000038332284,6.3277605e-7,0.000024414725,0.00007483597],"genre_scores_gemma":[0.8941013,0.000130375,0.10562137,0.00011150478,0.000013802594,3.795229e-7,9.671253e-8,0.0000014441038,0.000019718855],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853307,0.000019408457,0.00035592247,0.00026494567,0.00060758216,0.0002190821],"domain_scores_gemma":[0.99871504,0.00004648035,0.0002364424,0.00037677272,0.0005322819,0.00009296175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005705595,0.00010178075,0.00031551142,0.0011106019,0.00020616545,0.00006611114,0.0013520075,0.000058229572,0.000016614817],"category_scores_gemma":[0.000047225436,0.00005514194,0.000037250673,0.0047960267,0.001836739,0.0006313963,0.0005056717,0.00013657333,0.0000036260897],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046019377,0.000120304336,0.0029802853,0.0000041806124,0.000020828285,0.000044632885,0.00007019665,0.00016913257,0.0024939114,0.010020781,0.0002529914,0.98377675],"study_design_scores_gemma":[0.007535228,0.025708983,0.18338868,0.0008849809,0.00023611009,0.012734239,0.00019457201,0.2764528,0.15401329,0.31410185,0.022867471,0.0018817849],"about_ca_topic_score_codex":0.00000956858,"about_ca_topic_score_gemma":0.000011063788,"teacher_disagreement_score":0.98189497,"about_ca_system_score_codex":0.000026001857,"about_ca_system_score_gemma":0.00008520409,"threshold_uncertainty_score":0.6767542},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021558798790597647,"score_gpt":0.27681494181403127,"score_spread":0.25525614302343363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066687109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28677806,0.000100757956,0.7122882,0.00045790826,0.00025213003,0.000048996393,2.6647632e-8,0.00007194598,0.0000019678855],"genre_scores_gemma":[0.53543115,0.000013068647,0.46450204,0.000021703045,0.00002813198,6.865996e-7,1.3922237e-8,0.000002499272,6.9231993e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864477,0.000005976903,0.000344168,0.00019568116,0.0004607064,0.0003486929],"domain_scores_gemma":[0.99897754,0.00020614623,0.00010081802,0.00019201974,0.00047066048,0.000052829142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023185068,0.00008255056,0.00014745447,0.002576457,0.00005995925,0.00011711431,0.0010209563,0.000070972914,1.10934664e-7],"category_scores_gemma":[0.000675125,0.00007285435,0.000014411636,0.0033021728,0.00010720437,0.0012314259,0.00037262004,0.00029521086,6.0782617e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010943623,0.00007169675,0.03655053,0.00007159929,0.000019487985,0.00069904915,0.0014391929,0.010638773,0.006117255,0.17672521,0.00010034231,0.76755595],"study_design_scores_gemma":[0.0009291562,0.0005868486,0.0632506,0.0003555949,0.0000027949784,0.0030281001,0.000048627884,0.8870496,0.02615071,0.017225059,0.0009047558,0.0004681319],"about_ca_topic_score_codex":0.000002543541,"about_ca_topic_score_gemma":0.0000018684283,"teacher_disagreement_score":0.87641084,"about_ca_system_score_codex":0.00017677723,"about_ca_system_score_gemma":0.00047821674,"threshold_uncertainty_score":0.29709142},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007527063486905003,"score_gpt":0.20816447713740835,"score_spread":0.20063741365050336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068220037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95859134,0.00015147513,0.033377983,0.007507985,0.00011903121,0.00004369086,5.0578694e-7,0.0000042990255,0.00020367882],"genre_scores_gemma":[0.9859368,0.000030046169,0.013636375,0.00027635376,0.000105832674,8.1081345e-7,1.6972163e-7,0.0000020163625,0.0000115517205],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999566,0.000007404196,0.00012044439,0.0000888023,0.00010848104,0.00010887017],"domain_scores_gemma":[0.99954385,0.0000044309463,0.00009513623,0.000117097436,0.00021739163,0.000022102793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002896233,0.000044853427,0.00005455551,0.000105995205,0.00014204696,0.00003118833,0.00023187597,0.000050322866,9.440462e-7],"category_scores_gemma":[0.000030181483,0.000028056846,0.000016553984,0.00020762648,0.00027475017,0.000007257136,0.00009246612,0.000076227894,0.0000015512655],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005001184,0.00018085507,0.00045342554,0.000007533196,0.00003016889,0.000014316454,0.00034254705,0.002284201,0.8509119,0.10461749,0.00059191906,0.040515594],"study_design_scores_gemma":[0.0013953317,0.007699472,0.0035817213,0.000090686095,0.000025820818,0.0020327398,0.00022553498,0.0005508664,0.86240894,0.06908675,0.052598804,0.00030332556],"about_ca_topic_score_codex":0.0000015391323,"about_ca_topic_score_gemma":0.0000027607248,"teacher_disagreement_score":0.052006885,"about_ca_system_score_codex":0.000023251216,"about_ca_system_score_gemma":0.00016511428,"threshold_uncertainty_score":0.114412494},"labels":[],"label_agreement":null},{"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.035988189501161005,"score_gpt":0.27897509842622664,"score_spread":0.24298690892506564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071416419","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07902014,0.00018205096,0.9171684,0.0028936255,0.00036284394,0.00004623554,0.0000017981714,0.00017836891,0.00014653362],"genre_scores_gemma":[0.48185825,0.00011350733,0.51783335,0.00012568699,0.00006089588,3.9997556e-7,2.5026426e-7,0.0000029624612,0.0000047139984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984441,0.000016122822,0.00034947175,0.0003922626,0.0005034505,0.0002946364],"domain_scores_gemma":[0.99780464,0.00004904453,0.00028531085,0.0013325984,0.0004229986,0.00010543544],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0010064201,0.00011435769,0.00022889882,0.0009693207,0.00024466304,0.00015106198,0.0062683243,0.00007188895,0.0000011535251],"category_scores_gemma":[0.00013845845,0.00009210185,0.000016850181,0.0016113056,0.0009135813,0.0024215016,0.0043557147,0.0002591946,0.000003741926],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021889362,0.000051575546,0.0019537483,0.0000041839094,0.000010173704,0.00029413152,0.00015612032,0.000005431815,0.0013276296,0.0056053107,0.0055417437,0.98504776],"study_design_scores_gemma":[0.0013948821,0.0030439536,0.007718349,0.00030527377,0.00002460721,0.056367453,0.00007683987,0.8330725,0.02548843,0.021661889,0.04995553,0.0008902934],"about_ca_topic_score_codex":0.000004105707,"about_ca_topic_score_gemma":0.0000015965159,"teacher_disagreement_score":0.98415744,"about_ca_system_score_codex":0.000036992984,"about_ca_system_score_gemma":0.00038194496,"threshold_uncertainty_score":0.99910825},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01665396761359184,"score_gpt":0.2521595947787549,"score_spread":0.23550562716516305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074047803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49658725,0.00008237734,0.50240916,0.00029062372,0.00037182536,0.000049534257,2.1069017e-7,0.000043579887,0.00016547],"genre_scores_gemma":[0.66952366,0.000004544494,0.33036008,0.000022705806,0.00008258147,2.7047804e-7,3.8393228e-8,0.000002903124,0.0000032114847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984788,0.000028073791,0.00046146428,0.00026918954,0.0004081437,0.00035437138],"domain_scores_gemma":[0.9976897,0.00005995231,0.000584359,0.00038422638,0.0011662571,0.00011546998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014950349,0.00013472867,0.00035409193,0.0010009019,0.000272513,0.0001657278,0.0018844511,0.00011133004,0.0000042463735],"category_scores_gemma":[0.00015975663,0.00010042905,0.00006136505,0.0018099834,0.0015336063,0.0011298483,0.00078256143,0.00042117835,0.0000016471524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010485392,0.0001886394,0.0075311987,0.000024512705,0.00004497833,0.000070954025,0.0013339326,0.000039534425,0.30370992,0.30820566,0.000053920805,0.37878627],"study_design_scores_gemma":[0.00070908974,0.0007732797,0.0047558914,0.00009015767,0.000021004622,0.0026699677,0.000052829557,0.85809106,0.0627527,0.06950945,0.00027143664,0.00030312815],"about_ca_topic_score_codex":0.0000043874384,"about_ca_topic_score_gemma":0.0000031978702,"teacher_disagreement_score":0.85805154,"about_ca_system_score_codex":0.000033324366,"about_ca_system_score_gemma":0.0004534442,"threshold_uncertainty_score":0.56506366},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0811634130080792,"score_gpt":0.41144146351408606,"score_spread":0.3302780505060069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086582257","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00219037,0.00028260166,0.99313796,0.0038226545,0.00041156472,0.00008853243,7.640435e-7,0.00004824037,0.00001732031],"genre_scores_gemma":[0.11511713,0.00005582459,0.88469046,0.00006153928,0.00005544231,0.000001932162,2.8172684e-7,0.0000033778815,0.000013980861],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848086,0.00004910745,0.0003499289,0.00039198133,0.0004116127,0.00031648926],"domain_scores_gemma":[0.9978072,0.00015652021,0.0002618177,0.00078066654,0.00089779147,0.000096017066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027162281,0.0000921247,0.00026860702,0.0019524797,0.00024341326,0.0002757224,0.0034268913,0.00006392233,0.0000021289086],"category_scores_gemma":[0.0002754952,0.00007915496,0.000041544918,0.0039518783,0.00039309793,0.0016705458,0.002235003,0.00020469914,8.8123545e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018166078,0.00003460798,0.0000609741,0.00000647301,0.000057054272,0.000009322101,0.000083215135,0.00045491772,0.00173938,0.0028851936,0.00007375263,0.9945933],"study_design_scores_gemma":[0.0003546798,0.00030464868,0.00008978865,0.0000086716955,0.00002756807,0.00025152144,0.00000726029,0.98965645,0.0015773379,0.005577754,0.0020607621,0.00008354622],"about_ca_topic_score_codex":0.0000014859204,"about_ca_topic_score_gemma":0.0000012309982,"teacher_disagreement_score":0.99450976,"about_ca_system_score_codex":0.00006937212,"about_ca_system_score_gemma":0.00007849855,"threshold_uncertainty_score":0.6368073},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; 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","score_opus":0.006624346709116896,"score_gpt":0.24712193004527663,"score_spread":0.24049758333615973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088835748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97147226,0.00009445726,0.027618742,0.00047723207,0.00006778352,0.000043490247,7.470083e-7,0.000010876615,0.00021441795],"genre_scores_gemma":[0.99884593,0.00004856296,0.00090275955,0.000005250635,0.00018888137,8.3529847e-7,2.3437109e-7,0.0000022052463,0.0000053303843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924034,0.000011368503,0.00025729087,0.00009389611,0.00018792905,0.00020915523],"domain_scores_gemma":[0.9992174,0.000038898044,0.00029735532,0.00018308403,0.00022322635,0.000040055354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003949094,0.00007681195,0.00017631736,0.00014246887,0.00025556676,0.00004654411,0.00043811122,0.000025725805,0.000008742262],"category_scores_gemma":[0.0000038894195,0.00004400064,0.0000742889,0.0010209124,0.00045042235,0.00013048906,0.00007694459,0.00019580577,0.0000010646273],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007928717,0.00007436834,0.014938059,0.0000011340961,0.000045300683,0.0000011032207,0.000030583982,0.006986404,0.00014384312,0.0042840573,0.0054048738,0.96808237],"study_design_scores_gemma":[0.00037062805,0.0022381295,0.051430423,0.000104784245,0.000028389792,0.000048518767,0.00002264072,0.9372332,0.001332211,0.0048037157,0.0022311127,0.00015622156],"about_ca_topic_score_codex":0.0000021671294,"about_ca_topic_score_gemma":2.787505e-7,"teacher_disagreement_score":0.96792614,"about_ca_system_score_codex":0.00003200643,"about_ca_system_score_gemma":0.000051123723,"threshold_uncertainty_score":0.19656387},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007124124298582951,"score_gpt":0.23301760556609105,"score_spread":0.2258934812675081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102495876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1861904,0.00034159655,0.81047344,0.0021404736,0.00064764405,0.00011363814,4.1366945e-7,0.000048744118,0.0000436626],"genre_scores_gemma":[0.8180706,0.00007478493,0.18150125,0.0001765386,0.00016397836,0.0000023169246,1.435979e-7,0.0000051477696,0.00000523927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983151,0.000043090826,0.0005423005,0.00030714602,0.0004411595,0.00035119857],"domain_scores_gemma":[0.997397,0.00025802077,0.0006028944,0.00048856554,0.001152549,0.0001009685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015875705,0.00013674238,0.0003846533,0.0007457146,0.0001757327,0.00013494024,0.0016880363,0.0001545937,6.040407e-7],"category_scores_gemma":[0.00013234979,0.00011074609,0.000065553126,0.0013168087,0.0007000357,0.00053642376,0.00033378252,0.00023634193,8.986196e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037375292,0.0002889281,0.0013128195,0.00006634396,0.00008574045,0.000020081572,0.0009229274,0.0018197261,0.040371355,0.5344975,0.002102262,0.41847494],"study_design_scores_gemma":[0.000554635,0.00077589275,0.00139532,0.000090658876,0.000019582116,0.00025067248,0.00002293854,0.9635526,0.011437748,0.01832415,0.0034177962,0.0001580238],"about_ca_topic_score_codex":0.0000011843891,"about_ca_topic_score_gemma":5.683657e-7,"teacher_disagreement_score":0.96173286,"about_ca_system_score_codex":0.000032175078,"about_ca_system_score_gemma":0.00011842635,"threshold_uncertainty_score":0.45160946},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08446876235174079,"score_gpt":0.30633167810649614,"score_spread":0.22186291575475536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117172400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0096778,0.001118598,0.9863465,0.0014207286,0.0010395563,0.0002622572,0.000019238345,0.000040765008,0.00007457461],"genre_scores_gemma":[0.791843,0.000082527105,0.20751874,0.00012516188,0.00035694902,0.0000076245155,0.000008525182,0.000008212751,0.000049269056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822384,0.00003948315,0.00046299462,0.00047132696,0.0005349124,0.00026745105],"domain_scores_gemma":[0.99626714,0.00008671283,0.00043530305,0.0021815547,0.0009184929,0.00011077622],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.006221338,0.000095690026,0.00026239592,0.0006690928,0.00014364372,0.00015766673,0.00774498,0.000047972484,4.5943704e-8],"category_scores_gemma":[0.00007565404,0.00007521557,0.000014131675,0.0017842479,0.00027638275,0.00016762594,0.0068765897,0.00011038,0.0000010243681],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011514369,0.00035979215,0.0031810815,0.00012447819,0.00010663547,0.000016245349,0.00020994918,0.0019551383,0.000027433603,0.02491278,0.025506796,0.94358814],"study_design_scores_gemma":[0.0006567909,0.00025979552,0.0017503076,0.00005315544,0.000020179245,0.00009947529,0.00012081916,0.89894843,0.000026124284,0.0013224953,0.09662815,0.00011426538],"about_ca_topic_score_codex":0.000014266583,"about_ca_topic_score_gemma":0.000007861099,"teacher_disagreement_score":0.9434739,"about_ca_system_score_codex":0.000028858189,"about_ca_system_score_gemma":0.00020376955,"threshold_uncertainty_score":0.9976236},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0076057241386548345,"score_gpt":0.21490953061850027,"score_spread":0.20730380647984542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137042120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18316118,0.00036298868,0.81460875,0.0014375568,0.00023246683,0.00010780364,1.2985966e-7,0.000065971464,0.00002317019],"genre_scores_gemma":[0.89864284,0.00005514123,0.10121772,0.00003478732,0.000045462173,0.0000018054002,5.64264e-8,0.0000014676123,7.2404623e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987609,0.000024813662,0.00040189605,0.00020566488,0.0004144927,0.00019224708],"domain_scores_gemma":[0.99884194,0.000031006915,0.0002759423,0.00021835447,0.00054005295,0.00009273126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010302191,0.000094919444,0.00019449616,0.00078153,0.0001493444,0.000100990415,0.0007327016,0.000076725875,8.489349e-8],"category_scores_gemma":[0.00006609865,0.00008258653,0.000014414081,0.0016462251,0.00016420937,0.0023573658,0.00030074277,0.00020242382,0.0000014567969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066122366,0.000028147317,0.009243601,0.000041652223,0.0000039484794,0.000028285089,0.0007181729,0.0005294476,0.0010976042,0.1517832,0.000032898675,0.8364864],"study_design_scores_gemma":[0.00069673255,0.0003873292,0.049215205,0.00015272181,0.0000035311168,0.0033082846,0.000050251467,0.9344131,0.0017276461,0.008767443,0.0010620031,0.00021580834],"about_ca_topic_score_codex":0.0000099397885,"about_ca_topic_score_gemma":0.000004948796,"teacher_disagreement_score":0.9338836,"about_ca_system_score_codex":0.00014341646,"about_ca_system_score_gemma":0.00026235203,"threshold_uncertainty_score":0.3367781},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.021658267926861267,"score_gpt":0.26099372336252996,"score_spread":0.2393354554356687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460852158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040308896,0.00007819936,0.94670695,0.012172655,0.00055435696,0.000073774405,7.767736e-7,0.000056658617,0.000047757934],"genre_scores_gemma":[0.5908074,0.000037716913,0.40879837,0.00019348187,0.00013775036,0.0000025951176,6.5272594e-8,0.0000025025583,0.000020142967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999,0.000009034532,0.00025363197,0.00022725028,0.0002661842,0.00024387467],"domain_scores_gemma":[0.99882895,0.00011938685,0.00022126173,0.00028515098,0.0004822203,0.00006301372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011478867,0.00007281879,0.00013629707,0.0006646584,0.00024424068,0.00024515035,0.0014741174,0.000040286668,7.130938e-7],"category_scores_gemma":[0.00018611037,0.000046840338,0.000026293867,0.0008979536,0.00033910898,0.0022514625,0.00057496043,0.00006985162,0.0000010929497],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014219503,0.0000225359,0.0015387136,0.0000049328874,0.000009529389,0.0000067420774,0.00006565409,0.000003366468,0.0014381417,0.034600873,0.0009311671,0.9613769],"study_design_scores_gemma":[0.004185718,0.0038777187,0.010819114,0.0006138877,0.000068586254,0.0013215874,0.00032156755,0.72065324,0.02690845,0.14321887,0.08714131,0.0008699253],"about_ca_topic_score_codex":5.0983687e-7,"about_ca_topic_score_gemma":9.0977005e-7,"teacher_disagreement_score":0.960507,"about_ca_system_score_codex":0.000030753377,"about_ca_system_score_gemma":0.00016428473,"threshold_uncertainty_score":0.27393013},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009656570307727841,"score_gpt":0.2397008524398235,"score_spread":0.23004428213209566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550167848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52189493,0.00022586375,0.4740089,0.0030249157,0.0007174033,0.00010178433,1.0820155e-7,0.000023931783,0.0000021403089],"genre_scores_gemma":[0.97280836,0.00011471203,0.026940973,0.000015976366,0.000094225994,0.000006602278,5.1219904e-9,0.0000024658227,0.000016667756],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989611,0.00001537179,0.00029454703,0.00028805406,0.00021430527,0.00022660806],"domain_scores_gemma":[0.9989682,0.00007202001,0.00020778469,0.0002454701,0.00045141735,0.000055121553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013545378,0.000083406194,0.00020824154,0.00055010157,0.0001041453,0.00008410408,0.0005298946,0.000070386166,1.00539246e-7],"category_scores_gemma":[0.00016115354,0.000050160987,0.000017651955,0.00069933594,0.0004025762,0.0011764499,0.00017436675,0.00008557199,5.0595895e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042073483,0.000081323305,0.010532759,0.00017304982,0.000016850036,0.000013457114,0.001131631,0.00016929008,0.20543247,0.007057952,0.00023688232,0.7751123],"study_design_scores_gemma":[0.010274035,0.007620965,0.103204966,0.0052797874,0.000047485148,0.010554482,0.001141643,0.17970562,0.63302463,0.03188818,0.015219236,0.0020389429],"about_ca_topic_score_codex":0.0000015543233,"about_ca_topic_score_gemma":0.0000014559612,"teacher_disagreement_score":0.7730733,"about_ca_system_score_codex":0.00006339171,"about_ca_system_score_gemma":0.00013412815,"threshold_uncertainty_score":0.20455056},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017715693433242637,"score_gpt":0.2950580230940829,"score_spread":0.27734232966084027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593821117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23401278,0.00011655089,0.7557188,0.009066625,0.0008633204,0.000051478128,1.569131e-7,0.000034560708,0.00013572347],"genre_scores_gemma":[0.65762806,0.000055208126,0.34210002,0.0001088581,0.000095551346,3.0850788e-7,4.5351957e-8,0.0000017632972,0.000010160782],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882066,0.000010377775,0.00028677715,0.00022772682,0.0004068413,0.00024760215],"domain_scores_gemma":[0.9981206,0.000016278073,0.00043174467,0.0005989666,0.00070447224,0.0001279224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007944165,0.00009093881,0.00017145884,0.0007778496,0.0006966717,0.00071590504,0.0021629406,0.00006332845,0.000008782514],"category_scores_gemma":[0.00009323062,0.00007474477,0.00003523062,0.0008756436,0.0004598515,0.0016127964,0.0006828642,0.00020318768,0.000004118194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060573766,0.000044442324,0.018596182,0.000005465321,0.000016061013,0.000045641882,0.00050088327,0.0000025296836,0.0048305294,0.31494194,0.0022556134,0.65875465],"study_design_scores_gemma":[0.006054738,0.0060528987,0.2357912,0.00030025915,0.00005900504,0.0071403887,0.0003863676,0.096572146,0.020352725,0.52628964,0.09961604,0.0013845913],"about_ca_topic_score_codex":0.000009781218,"about_ca_topic_score_gemma":0.0000082281185,"teacher_disagreement_score":0.65737003,"about_ca_system_score_codex":0.000027809723,"about_ca_system_score_gemma":0.00043012304,"threshold_uncertainty_score":0.6903489},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005921843677497686,"score_gpt":0.23383058211120905,"score_spread":0.22790873843371137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912349718","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9510153,0.0014381099,0.04637929,0.00097005646,0.000063835,0.00011348162,2.7823157e-7,0.0000044759645,0.000015198833],"genre_scores_gemma":[0.9965735,0.00015725422,0.0029263454,0.00021676147,0.000113391856,0.0000027730357,2.2267345e-7,0.0000020391556,0.0000076746155],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993679,0.000015019296,0.00016690095,0.00021048594,0.00009403357,0.0001456419],"domain_scores_gemma":[0.99927664,0.000012012765,0.000093042945,0.00017183763,0.0003604116,0.00008607246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049812964,0.00006237493,0.0001553049,0.00015686452,0.000061574014,0.000022052582,0.00026183427,0.00009677305,0.0000017621811],"category_scores_gemma":[0.00003575058,0.00004651352,0.000023681798,0.00047529265,0.0002044756,0.0000058686323,0.00023648038,0.000074710406,0.0000016328488],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068949135,0.00009520128,0.10973082,0.000010531081,0.00010390596,0.00000413458,0.000025969826,0.0040424867,0.6372048,0.0036750005,0.00039452474,0.24464367],"study_design_scores_gemma":[0.0069543864,0.017408721,0.21117178,0.00012533151,0.0002498421,0.0036446052,0.0003519734,0.23098086,0.2190553,0.012113917,0.29582682,0.0021164739],"about_ca_topic_score_codex":1.409993e-7,"about_ca_topic_score_gemma":6.442914e-7,"teacher_disagreement_score":0.4181495,"about_ca_system_score_codex":0.000008289051,"about_ca_system_score_gemma":0.00005953099,"threshold_uncertainty_score":0.18967663},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Cache; Operating system; Parallel computing; Host (biology)","score_opus":0.008948873919923585,"score_gpt":0.24744274182685375,"score_spread":0.23849386790693017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914522519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63990414,0.00010753233,0.35769522,0.0016177022,0.0004250752,0.00018510116,0.0000012626039,0.000059747126,0.000004220919],"genre_scores_gemma":[0.8227348,0.00004604643,0.17704177,0.00013812313,0.00002421737,0.0000027706656,3.715756e-8,0.00000609278,0.000006152753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980315,0.000027473276,0.00051496114,0.00043120407,0.00052752474,0.00046731628],"domain_scores_gemma":[0.9975301,0.00011026118,0.0005903641,0.0008495099,0.0008385944,0.00008117625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097453175,0.00018292322,0.00039931815,0.0010698386,0.00022171794,0.00015346776,0.0033771077,0.00009458943,0.0000012396654],"category_scores_gemma":[0.00014431636,0.00012551754,0.000043736734,0.0024993946,0.0007333689,0.001571375,0.0023088597,0.00048422944,0.0000046629043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029264682,0.000066868975,0.007579821,0.000045936962,0.00003413814,0.00006196382,0.0013270605,0.0023574557,0.2892858,0.0044457586,0.00006959021,0.69469637],"study_design_scores_gemma":[0.0009791153,0.006156898,0.0024478757,0.00039251224,0.000024153256,0.0013865068,0.00068599597,0.7416484,0.23732542,0.007695121,0.00074291375,0.0005151411],"about_ca_topic_score_codex":0.0000051537177,"about_ca_topic_score_gemma":0.0000024365897,"teacher_disagreement_score":0.7392909,"about_ca_system_score_codex":0.0001265539,"about_ca_system_score_gemma":0.00034880775,"threshold_uncertainty_score":0.62755626},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011985350039328383,"score_gpt":0.2406716962186188,"score_spread":0.22868634617929043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989546622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37709677,0.00016323324,0.5960538,0.025747465,0.0006263655,0.000092274866,0.0000019023412,0.00020833698,0.0000098559285],"genre_scores_gemma":[0.7591777,0.00006278414,0.24052884,0.00018821571,0.000027333155,0.000005502738,2.7593023e-7,0.0000053409067,0.000004035397],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784064,0.000062412626,0.000421223,0.0004707772,0.00077653024,0.00042840105],"domain_scores_gemma":[0.99695694,0.000077193064,0.0004194372,0.0021237147,0.00031555194,0.00010714093],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0011273805,0.00016659302,0.00033203367,0.0014322351,0.00061066705,0.0002353367,0.01932741,0.00009211185,0.0000112918515],"category_scores_gemma":[0.0012149769,0.00014404416,0.000033671542,0.0023564794,0.0006943279,0.0010823803,0.08986958,0.00066262914,0.0000011323363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077030214,0.00040939785,0.0018407858,0.000038902876,0.00011557848,0.00062226574,0.0006334037,0.000016942658,0.12045109,0.14955081,0.017909415,0.7083344],"study_design_scores_gemma":[0.0014080367,0.0014140176,0.00066452805,0.000022068385,0.000016304402,0.0059767375,0.000047223148,0.3552908,0.024961242,0.6063212,0.003567366,0.0003104623],"about_ca_topic_score_codex":0.000004161359,"about_ca_topic_score_gemma":5.201057e-7,"teacher_disagreement_score":0.7080239,"about_ca_system_score_codex":0.000105791776,"about_ca_system_score_gemma":0.00025355024,"threshold_uncertainty_score":0.9859785},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"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","score_opus":0.0384129619373278,"score_gpt":0.28502092550176517,"score_spread":0.24660796356443737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034810086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15975548,0.000037767895,0.8336591,0.0059494814,0.00038198856,0.00010696778,0.0000013851991,0.00008032554,0.000027458402],"genre_scores_gemma":[0.92611176,0.0000063951743,0.07240305,0.0010950811,0.00036998297,0.000004831943,0.000002888345,0.0000040189166,0.0000020156997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884945,0.000022626742,0.00034130376,0.00026693536,0.00029681146,0.0002228598],"domain_scores_gemma":[0.9984322,0.00005425619,0.00036399948,0.00011596548,0.00090249564,0.00013103803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050060067,0.0001047433,0.000183182,0.0005063683,0.00035453905,0.000174084,0.0005318173,0.000083686056,0.0000055727983],"category_scores_gemma":[0.000047798327,0.000094638446,0.000058527676,0.00090937124,0.00029721303,0.0009110168,0.00009077504,0.00023395491,0.0000036585914],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045210953,0.00016389045,0.00121197,0.00003177696,0.00003220083,0.000025413785,0.00009601139,0.0007188796,0.011682527,0.014652535,0.002395122,0.9689445],"study_design_scores_gemma":[0.0025063022,0.0025374072,0.0012566235,0.0000794562,0.000024744206,0.0002435824,0.00003970845,0.9366352,0.020692008,0.031548254,0.004136355,0.0003003668],"about_ca_topic_score_codex":0.0000015988019,"about_ca_topic_score_gemma":0.0000017681393,"teacher_disagreement_score":0.9686441,"about_ca_system_score_codex":0.00004981855,"about_ca_system_score_gemma":0.00024647414,"threshold_uncertainty_score":0.38592437},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06046403470218005,"score_gpt":0.30552458677521993,"score_spread":0.2450605520730399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096943259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63323605,0.00009382869,0.36468834,0.0008217255,0.00090604054,0.00014634375,0.000049499326,0.0000564183,0.0000017603621],"genre_scores_gemma":[0.7616785,0.0000099563895,0.23794943,0.00015755033,0.000184147,0.000003111206,0.0000052065384,0.000011883202,1.8782252e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9954682,0.000012164592,0.00077457225,0.0012595713,0.0016837626,0.00080173614],"domain_scores_gemma":[0.99568707,0.0000636985,0.00055302307,0.0019735468,0.0013080117,0.00041466785],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.005259906,0.00025961985,0.000597638,0.002435967,0.00059671403,0.0010467921,0.010622633,0.00012373169,0.000006156606],"category_scores_gemma":[0.0011580787,0.00021983139,0.00005492556,0.009059013,0.0029118138,0.0038490978,0.0059325113,0.0002486628,0.0000054679067],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014499961,0.00006832451,0.0002227792,0.000020977088,0.00002971346,0.000016041027,0.00015553535,0.00023362087,0.9937849,0.0015248295,0.000033054683,0.0038957174],"study_design_scores_gemma":[0.0007904368,0.0009497914,0.00027829956,0.0000535187,0.00031364113,0.00030737516,0.00007360306,0.10879697,0.8854319,0.0005315163,0.0020334555,0.00043951688],"about_ca_topic_score_codex":0.0000071710097,"about_ca_topic_score_gemma":0.000007608587,"teacher_disagreement_score":0.12844248,"about_ca_system_score_codex":0.00015061609,"about_ca_system_score_gemma":0.0018978534,"threshold_uncertainty_score":0.9999902},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01323511758263632,"score_gpt":0.27447270302207677,"score_spread":0.2612375854394404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096975346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028079743,0.00020623728,0.96180296,0.009324301,0.00010741911,0.00013047639,0.0000013703277,0.0003456971,0.0000018198425],"genre_scores_gemma":[0.5796585,0.000027913871,0.42008424,0.00013507865,0.00008359348,0.0000051495454,2.129322e-7,0.0000036105896,0.0000016705183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998489,0.00002586436,0.00034135065,0.0003500731,0.0004906883,0.0003030271],"domain_scores_gemma":[0.9976658,0.00048965646,0.00019587322,0.00028378106,0.0011953729,0.0001694673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015108284,0.00010852989,0.0002901138,0.0011330554,0.00022414925,0.00019722526,0.0015821141,0.00008094852,0.0000017456254],"category_scores_gemma":[0.003917453,0.00009054134,0.000082854196,0.0047456142,0.0003368762,0.00079175236,0.00065059355,0.00042038504,5.529122e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024052495,0.000069973,0.19091937,0.00007356696,0.00019030416,0.00006306747,0.00053505786,0.0017965374,0.0015242324,0.0078527415,0.00031504763,0.79663604],"study_design_scores_gemma":[0.0006556772,0.003583353,0.021476975,0.00003938201,0.000092331364,0.00042899745,0.000038790004,0.9264,0.015210059,0.011062099,0.020681685,0.00033062106],"about_ca_topic_score_codex":0.0000015343386,"about_ca_topic_score_gemma":2.6703287e-7,"teacher_disagreement_score":0.9246035,"about_ca_system_score_codex":0.00008279541,"about_ca_system_score_gemma":0.00028233035,"threshold_uncertainty_score":0.468984},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02954144827780394,"score_gpt":0.28708517276760975,"score_spread":0.25754372448980584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150464090","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10661696,0.00007163666,0.8915335,0.0003331809,0.0012581128,0.00010500891,1.576658e-7,0.000047787864,0.000033653363],"genre_scores_gemma":[0.14043966,0.000027074966,0.8594023,0.00007673885,0.000047362737,0.0000017265398,1.7748231e-8,0.0000024619094,0.0000026283558],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988506,0.000016004517,0.000374569,0.000238655,0.0003044625,0.00021574958],"domain_scores_gemma":[0.99843585,0.000062202904,0.00034998948,0.00033629377,0.0007299822,0.00008564695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013788359,0.00008812106,0.00017237868,0.0009581266,0.00017048496,0.00009717765,0.0012954336,0.000092046146,0.0000015433675],"category_scores_gemma":[0.0002833619,0.00006984843,0.00004185804,0.0013698846,0.0004944863,0.0013546611,0.00023998557,0.00014946358,0.0000017553332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010632452,0.000016904878,0.0005019984,0.0000021781407,0.0000035890555,0.000002405826,0.00017076725,0.0000022778347,0.0012981738,0.26591408,0.000121966914,0.731955],"study_design_scores_gemma":[0.0013729996,0.0019285029,0.007576839,0.00008530004,0.00001465452,0.002751645,0.00005147641,0.11291434,0.06996154,0.79846334,0.004601686,0.0002776717],"about_ca_topic_score_codex":0.0000017329917,"about_ca_topic_score_gemma":3.575803e-7,"teacher_disagreement_score":0.73167735,"about_ca_system_score_codex":0.000034674173,"about_ca_system_score_gemma":0.00027717295,"threshold_uncertainty_score":0.2848336},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01567769270327406,"score_gpt":0.30549389716164754,"score_spread":0.28981620445837347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249892919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16782448,0.00003376729,0.8297143,0.0014494895,0.00075628463,0.00011203584,2.8700907e-7,0.000098947356,0.000010417312],"genre_scores_gemma":[0.76751685,0.0000072310722,0.23226278,0.00012139591,0.00008283069,0.0000038098153,2.2499638e-7,0.000003337426,0.0000015623074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988086,0.000019189545,0.0003303556,0.00026287165,0.00039021368,0.0001887301],"domain_scores_gemma":[0.9977158,0.00013027218,0.00038130442,0.00029493822,0.0014062726,0.000071461895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014926139,0.00009060816,0.00017881343,0.0027748258,0.0002552001,0.0002839458,0.001073665,0.000092450166,5.773572e-7],"category_scores_gemma":[0.0002866053,0.00007968489,0.00004634,0.0035621962,0.00028013723,0.00084140396,0.00019751582,0.00023508102,2.438376e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003988962,0.00008391788,0.004483264,0.000012538979,0.000009310898,0.000006530105,0.00015894053,0.000028541626,0.014519259,0.33835763,0.0003562427,0.6419798],"study_design_scores_gemma":[0.00048548108,0.0007525356,0.007309277,0.000025207766,0.0000075592875,0.00017192103,0.000006463293,0.8841909,0.07514275,0.028972838,0.00277312,0.00016194013],"about_ca_topic_score_codex":0.0000025148126,"about_ca_topic_score_gemma":0.0000027959231,"teacher_disagreement_score":0.88416237,"about_ca_system_score_codex":0.000026122232,"about_ca_system_score_gemma":0.00026595953,"threshold_uncertainty_score":0.32494554},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017123856664640776,"score_gpt":0.27166503616506266,"score_spread":0.2545411795004219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381515053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41391614,0.00016073433,0.5854854,0.0002515922,0.00006459036,0.00009334732,4.0627916e-7,0.00002703234,7.6217043e-7],"genre_scores_gemma":[0.96358746,0.00017718715,0.036191273,0.000012234167,0.000020400168,0.00000689805,1.5487605e-7,0.000003875429,5.327251e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993141,0.0000052380046,0.000245241,0.00008105556,0.00019214016,0.00016219009],"domain_scores_gemma":[0.99951506,0.00004337687,0.00011755207,0.000079643,0.00022025671,0.000024104878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001107229,0.00005972518,0.00014465798,0.0010216747,0.00011951251,0.000063137464,0.00024174132,0.000027615242,0.000001073769],"category_scores_gemma":[0.000007475501,0.00003925463,0.000018924127,0.0024881708,0.00016142351,0.00029917483,0.000053669883,0.00006477453,1.5206373e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008809976,0.000012022454,0.012959193,0.00009733294,0.0002970915,0.0000036422605,0.001106374,0.036252152,0.02487798,0.00064817845,0.00044339843,0.9232938],"study_design_scores_gemma":[0.00031123828,0.00021725391,0.008377361,0.000013948887,0.000107500324,0.0000164556,0.0003129831,0.9261914,0.063587725,0.0006295082,0.00017019751,0.00006441706],"about_ca_topic_score_codex":4.948577e-7,"about_ca_topic_score_gemma":5.889458e-7,"teacher_disagreement_score":0.9232294,"about_ca_system_score_codex":0.000022082299,"about_ca_system_score_gemma":0.0000582462,"threshold_uncertainty_score":0.16007574},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; 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","score_opus":0.030562681806097197,"score_gpt":0.27816001928175527,"score_spread":0.24759733747565807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388541891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16536826,0.000082566876,0.8254006,0.00818974,0.000588133,0.0001450915,0.0000023635027,0.000112436006,0.00011083139],"genre_scores_gemma":[0.88561445,0.000016564862,0.113889374,0.0002210667,0.00020491156,0.0000046714767,0.0000019288107,0.0000046594437,0.000042341875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843246,0.000025189262,0.00037024767,0.00038881873,0.00046307207,0.00032020354],"domain_scores_gemma":[0.99868405,0.000080905294,0.00018646421,0.00065325556,0.0003343138,0.000060993134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028347785,0.000089905785,0.00018873118,0.0009229981,0.00021001614,0.00016682032,0.0024808573,0.000050893395,2.7658692e-7],"category_scores_gemma":[0.00016857465,0.0000728798,0.000024792538,0.0028766245,0.00021284571,0.0002254937,0.0022564798,0.00018955952,0.00000151746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059381982,0.0008442631,0.024198072,0.00014324462,0.00010545352,0.00022825044,0.00323076,0.05428602,0.0010971304,0.13319154,0.04586797,0.7367479],"study_design_scores_gemma":[0.00058723544,0.0002548565,0.0010152133,0.000044412103,0.0000031394145,0.00014315992,0.000065343986,0.9875249,0.000055559674,0.0031025915,0.0071182856,0.00008528696],"about_ca_topic_score_codex":0.000003546845,"about_ca_topic_score_gemma":0.000004628219,"teacher_disagreement_score":0.93323886,"about_ca_system_score_codex":0.000067225825,"about_ca_system_score_gemma":0.00020113624,"threshold_uncertainty_score":0.46100914},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006352724953010962,"score_gpt":0.22183695703123665,"score_spread":0.2154842320782257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406480758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12269267,0.0025565173,0.85887635,0.011527797,0.0038103247,0.000063146734,4.6195308e-7,0.0001722345,0.00030048093],"genre_scores_gemma":[0.98484963,0.00008855972,0.014434282,0.00022248457,0.0002737343,0.0000014120042,6.990585e-8,0.000005201439,0.00012460935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984525,0.000025717185,0.00043504138,0.0003556091,0.00040513766,0.00032599916],"domain_scores_gemma":[0.9989652,0.000053311076,0.00017126865,0.00027479438,0.00043439455,0.00010100482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014140086,0.000120700985,0.00023346441,0.00091328495,0.00021343437,0.0006669146,0.0012500088,0.00007700244,0.0000035183602],"category_scores_gemma":[0.00003657335,0.00009129779,0.000053715663,0.0016608904,0.0003134765,0.0011303972,0.00035386774,0.00040070032,0.000009996079],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027789977,0.000049164322,0.00016743343,0.000041487914,0.00005032284,0.00038612218,0.00080023514,0.00014751674,0.013726539,0.08681196,0.059063375,0.83875304],"study_design_scores_gemma":[0.00029335113,0.00089515175,0.000076830605,0.000535663,0.000013128811,0.012546745,0.00006717357,0.8108593,0.0106861815,0.023377864,0.1403098,0.00033876224],"about_ca_topic_score_codex":0.000008514768,"about_ca_topic_score_gemma":4.7052808e-7,"teacher_disagreement_score":0.862157,"about_ca_system_score_codex":0.00008357796,"about_ca_system_score_gemma":0.0002522169,"threshold_uncertainty_score":0.64310735},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.00567773826158046,"score_gpt":0.255621987237542,"score_spread":0.2499442489759615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408362526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052472427,0.0004369284,0.91758585,0.02762164,0.0014467502,0.00006472954,9.3029286e-8,0.00010414605,0.00026741304],"genre_scores_gemma":[0.7652669,0.000022664788,0.2333113,0.0013046745,0.00007378831,9.778345e-7,1.3260626e-8,0.0000021341289,0.000017567334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983972,0.000028726945,0.00041574848,0.0003654458,0.00044490793,0.00034799325],"domain_scores_gemma":[0.9980077,0.00009336011,0.00019192108,0.00051925087,0.001097422,0.00009030234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014807351,0.00012428324,0.00028265343,0.0017643226,0.00024849112,0.00032126927,0.0025704564,0.000082133614,0.000001210398],"category_scores_gemma":[0.00014622882,0.00010050579,0.000044854783,0.0038277311,0.00077492016,0.0009420995,0.0015311894,0.00038283577,0.000002486741],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017009913,0.00006106658,0.003348401,0.00000967753,0.000012873255,0.000058220376,0.000117950265,0.0000844749,0.0010422689,0.1617335,0.0008230427,0.8327068],"study_design_scores_gemma":[0.0009605452,0.0007740995,0.011166231,0.00014473974,0.00001711306,0.0019162515,0.000044064258,0.509442,0.011425859,0.442695,0.021060325,0.000353804],"about_ca_topic_score_codex":0.00000286014,"about_ca_topic_score_gemma":0.0000012107649,"teacher_disagreement_score":0.832353,"about_ca_system_score_codex":0.00010035785,"about_ca_system_score_gemma":0.00069899124,"threshold_uncertainty_score":0.47765905},"labels":[],"label_agreement":null}]}