{"meta":{"query_hash":"cadf0284ab08","filters":{"venue":"Concurrency and Computation Practice and Experience"},"cohort_total":162,"direct_labels_cover":0,"predictions_cover":162,"exported":162,"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/cadf0284ab08","api":"https://metacan.xera.ac/api/v1/cohort?venue=Concurrency+and+Computation+Practice+and+Experience"},"results":[{"id":"W1480044444","doi":"10.1002/cpe.3153","title":"A lightweight key management scheme based on an Adelson‐Velskii and Landis tree and elliptic curve cryptography for wireless sensor networks","year":2013,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Elliptic curve cryptography; Encryption; Wireless sensor network; Key management; Computer network; Distributed computing; Key (lock); Scalability; Cryptography; Key distribution in wireless sensor networks; Public-key cryptography; Wireless; Wireless network; Algorithm; Computer security; Telecommunications; Database","score_opus":0.015197273118442937,"score_gpt":0.27788860801431553,"score_spread":0.2626913348958726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480044444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056020778,0.001453631,0.93493116,0.0005236873,0.00021959703,0.00029228814,0.00007115327,0.00057662715,0.005911096],"genre_scores_gemma":[0.78639144,0.00077789434,0.206909,0.00019620718,0.00013448905,0.00030531274,0.0001889746,0.00004321769,0.0050534406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870884,0.00037713954,0.00014675742,0.00018971149,0.0004566388,0.00012082935],"domain_scores_gemma":[0.9988669,0.0002460984,0.00030115392,0.00027237416,0.00023707082,0.000076476295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009849843,0.0003920986,0.000570676,0.0012048739,0.0008475189,0.0011607021,0.0011896357,0.0007463934,0.0013029644],"category_scores_gemma":[0.0017261287,0.00019326863,0.0004954592,0.0010883455,0.00078292005,0.003079182,0.0015891432,0.00085081777,0.0004700047],"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.001011167,0.00033680035,0.0015949999,0.0005219536,0.00013203322,0.0006639216,0.0009434393,0.059229948,0.20743085,0.3865107,0.005801648,0.33582255],"study_design_scores_gemma":[0.00033453817,0.0009904659,0.001154705,0.00014458099,0.00014082118,0.0019735298,0.0002574358,0.7397735,0.108649336,0.086296,0.060076844,0.00020828661],"about_ca_topic_score_codex":0.0004478368,"about_ca_topic_score_gemma":0.00027214398,"teacher_disagreement_score":0.0013029644,"about_ca_system_score_codex":0.0011756496,"about_ca_system_score_gemma":0.0012453556,"threshold_uncertainty_score":0.008530021},"labels":[],"label_agreement":null},{"id":"W150141253","doi":"10.1002/cpe.1188","title":"Gossip‐based search selection in hybrid peer‐to‐peer networks","year":2007,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Gossip; Peer-to-peer; Distributed hash table; Flooding (psychology); Popularity; Bandwidth (computing); Distributed computing; Computer network","score_opus":0.027226153535240907,"score_gpt":0.3487067222338325,"score_spread":0.3214805686985916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W150141253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33942726,0.0017178626,0.65082264,0.00037546406,0.000071656046,0.00026373324,0.00017540714,0.0030011933,0.004144758],"genre_scores_gemma":[0.8947409,0.00017877048,0.10290918,0.00006771212,0.000028839822,0.00013754368,0.00015590721,0.000080323756,0.0017008943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908257,0.000341803,0.000057145968,0.00013460235,0.0002784051,0.00010543822],"domain_scores_gemma":[0.9969862,0.0018843428,0.00023422549,0.00029479043,0.00038909592,0.0002113548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021682181,0.00061765226,0.001247382,0.001407504,0.00091149233,0.0012336829,0.002139394,0.00088170316,0.00096638646],"category_scores_gemma":[0.005065953,0.000427336,0.0003291712,0.0011132616,0.0010085227,0.001927285,0.0015843825,0.0003992371,0.00038336468],"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.0011859966,0.00016235374,0.0046374383,0.00028202398,0.00021414286,0.0004335831,0.0007475643,0.7915638,0.019727334,0.026960809,0.0038964192,0.15018845],"study_design_scores_gemma":[0.00008014802,0.00010201769,0.00038165937,0.000008412102,0.000024399375,0.00008400674,0.00008637668,0.9852005,0.0032523707,0.009389651,0.0013737266,0.000016719638],"about_ca_topic_score_codex":0.0042846305,"about_ca_topic_score_gemma":0.0039786403,"teacher_disagreement_score":0.0042846305,"about_ca_system_score_codex":0.0008914784,"about_ca_system_score_gemma":0.0008465818,"threshold_uncertainty_score":0.011466801},"labels":[],"label_agreement":null},{"id":"W1536395336","doi":"10.1002/cpe.1892","title":"A performance evaluation framework for packet scheduling algorithms in wireless system","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Maximum throughput scheduling; Network packet; Scheduling (production processes); Round-robin scheduling; Algorithm; Wireless; Fair-share scheduling; Distributed computing; Computer network; Mathematical optimization; Quality of service; Mathematics; Telecommunications","score_opus":0.04465426547914656,"score_gpt":0.31715499168889066,"score_spread":0.2725007262097441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536395336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004968691,0.00046731095,0.9915804,0.00021678187,0.000050255294,0.000086868735,0.000039261107,0.00016650357,0.002423841],"genre_scores_gemma":[0.47945052,0.0013474773,0.5153703,0.0001799942,0.00028736,0.0006961905,0.00022861356,0.00019452473,0.0022450374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99077034,0.0052039362,0.00056486286,0.00048301043,0.002620707,0.00035701893],"domain_scores_gemma":[0.993501,0.0034316368,0.0005295597,0.00063518743,0.0017399215,0.00016269041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013511891,0.0016588295,0.001278906,0.0018631722,0.0005788849,0.0028380072,0.0015185146,0.00095200806,0.0013261739],"category_scores_gemma":[0.019718995,0.00032483385,0.0007865566,0.0013896405,0.0013519711,0.002622844,0.0016250242,0.0018155487,0.00037431752],"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.0000963425,0.00010324888,0.00046853654,0.00013782879,0.0000898787,0.000056569355,0.00006347708,0.6936909,0.004600475,0.24167849,0.0024323217,0.056581806],"study_design_scores_gemma":[0.000007570931,0.0000750505,0.00010306314,0.000019118566,0.000012011446,0.000020762529,0.00001448622,0.9659099,0.0010760878,0.031680938,0.0010708661,0.000009988216],"about_ca_topic_score_codex":0.0022237487,"about_ca_topic_score_gemma":0.00061111106,"teacher_disagreement_score":0.013511891,"about_ca_system_score_codex":0.0024054388,"about_ca_system_score_gemma":0.0017950097,"threshold_uncertainty_score":0.07145858},"labels":[],"label_agreement":null},{"id":"W1644445135","doi":"10.1002/cpe.3330","title":"Capturing the sensitivity of optical network quality metrics to its network interface parameters","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Regional Development Fund; FP7 Information and Communication Technologies; Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; SystemC; Scalability; Serialization; Network on a chip; Distributed computing; Network interface; Computer network; Interface (matter); Network architecture; Computer architecture; Architecture; Embedded system; Parallel computing","score_opus":0.04617414862232739,"score_gpt":0.3412086375550242,"score_spread":0.2950344889326968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1644445135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89122075,0.00043338275,0.10177785,0.00013963834,0.000047474135,0.00003646646,0.00029351257,0.0007393712,0.005311598],"genre_scores_gemma":[0.99514174,0.000072728595,0.0041764597,0.00001833748,0.000005784629,0.000010517583,0.00013022822,0.000037986465,0.00040620708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996506,0.00006995663,0.000013552002,0.00007932675,0.00013758005,0.00004889217],"domain_scores_gemma":[0.9982614,0.0008400084,0.00034170513,0.00022241179,0.00028798752,0.000046512887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068391644,0.00041261537,0.00019647523,0.00085844076,0.00014667374,0.0006511553,0.00026559873,0.0003382255,0.0014233509],"category_scores_gemma":[0.003573277,0.00015144862,0.00017269303,0.0005566929,0.00033692888,0.0006260101,0.0003583644,0.0004248423,0.000172217],"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.00031588608,0.00013461843,0.035408042,0.00017727655,0.000091511334,0.0001677619,0.00017504305,0.76419336,0.104367554,0.0063860537,0.0011820156,0.087400876],"study_design_scores_gemma":[0.0000051395127,0.00010129263,0.0135571025,0.000016307875,0.000016014354,0.000080735495,0.00004626391,0.9577381,0.025055688,0.0025694617,0.00079204177,0.000021842816],"about_ca_topic_score_codex":0.0029357586,"about_ca_topic_score_gemma":0.0017278953,"teacher_disagreement_score":0.0029357586,"about_ca_system_score_codex":0.00046999555,"about_ca_system_score_gemma":0.00026903683,"threshold_uncertainty_score":0.005837381},"labels":[],"label_agreement":null},{"id":"W1695361088","doi":"10.1002/cpe.2976","title":"Special issue on parallel architectures and bioinspired algorithm: guest editors message","year":2012,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Dependability; Heuristics; Architecture; Fault tolerance; Set (abstract data type); Distributed computing; Parallel computing; Software engineering; Programming language","score_opus":0.017421624073587008,"score_gpt":0.3081765115453007,"score_spread":0.2907548874717137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1695361088","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004018926,0.015798343,0.0063885706,0.026252223,0.92739064,0.00011651446,0.0004655638,0.0007825615,0.022403782],"genre_scores_gemma":[0.0035832883,0.018641783,0.0051514637,0.0097693205,0.84143764,0.00020942546,0.0014329853,0.0014461732,0.11832793],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973477,0.00035025371,0.0002752712,0.00060930185,0.0011464593,0.00027098876],"domain_scores_gemma":[0.99092335,0.0019982103,0.00045873382,0.00059424725,0.0044232802,0.0016022008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029492963,0.0021304088,0.0020277991,0.0029444725,0.0016289473,0.0066888267,0.0023259204,0.0036463453,0.09612638],"category_scores_gemma":[0.010009024,0.00073672755,0.0015478529,0.00256658,0.0009022885,0.005081131,0.0025622463,0.005243513,0.06001823],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003199885,0.00002350439,0.000057713176,0.00019257732,0.000010372695,0.000035959813,0.00001206639,0.00016349641,0.00017891817,0.0012657716,0.96676105,0.0312665],"study_design_scores_gemma":[0.000019380199,0.00003854117,0.00018946761,0.00015707972,0.000012598819,0.00011393601,0.00001855564,0.0006079216,0.00017616185,0.001636845,0.9970181,0.000011441766],"about_ca_topic_score_codex":0.0006120574,"about_ca_topic_score_gemma":0.000813793,"teacher_disagreement_score":0.09612638,"about_ca_system_score_codex":0.0015065359,"about_ca_system_score_gemma":0.0019306275,"threshold_uncertainty_score":0.32157475},"labels":[],"label_agreement":null},{"id":"W1734166017","doi":"10.1002/cpe.3160","title":"Supporting multidimensional range queries in Hierarchically Distributed Tree","year":2013,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Overlay; Distributed computing; Overlay network; Range query (database); Routing (electronic design automation); Tree (set theory); Load balancing (electrical power); Network topology; Range (aeronautics); Set (abstract data type); Process (computing); Computer network; Information retrieval; Mathematics; Grid","score_opus":0.016875113048608354,"score_gpt":0.3178772061085061,"score_spread":0.3010020930598978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1734166017","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6339182,0.00055594475,0.3519737,0.00038029393,0.00007939052,0.00022239391,0.0004565795,0.0051683187,0.007245122],"genre_scores_gemma":[0.9142209,0.00012765705,0.083981745,0.00007040197,0.000020035055,0.00006735296,0.0005248466,0.000059771315,0.0009272428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987054,0.00030629148,0.00011772686,0.00014085718,0.00056563236,0.00016403281],"domain_scores_gemma":[0.99561405,0.0017035154,0.00034607534,0.001096752,0.0009935148,0.00024604014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012496754,0.00026672572,0.0005262232,0.0007876968,0.0008278303,0.00094324665,0.0010923372,0.0006220212,0.00088748825],"category_scores_gemma":[0.0045210156,0.00015943736,0.00024998598,0.0011896861,0.0003774592,0.0017868774,0.0012086527,0.00040595152,0.00034248162],"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.0012326527,0.0008241673,0.014611335,0.00049699144,0.00013779044,0.0012814859,0.001421387,0.47278333,0.19216913,0.024221407,0.01145856,0.27936178],"study_design_scores_gemma":[0.000065519765,0.00025189284,0.001676551,0.000011063411,0.000023460205,0.00021264226,0.0002617623,0.967426,0.019352637,0.006050767,0.0046357196,0.00003199451],"about_ca_topic_score_codex":0.0041905213,"about_ca_topic_score_gemma":0.0037494418,"teacher_disagreement_score":0.0041905213,"about_ca_system_score_codex":0.0006170086,"about_ca_system_score_gemma":0.00076330535,"threshold_uncertainty_score":0.008332312},"labels":[],"label_agreement":null},{"id":"W1734673682","doi":"10.1002/cpe.3360","title":"Nature‐inspired soft computing for financial option pricing using high‐performance analytics","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Computer science; Particle swarm optimization; Speedup; Valuation of options; Volatility (finance); Soft computing; Supercomputer; Financial engineering; Finance; Mathematical optimization; Algorithm; Parallel computing; Economics; Artificial neural network; Artificial intelligence; Mathematics","score_opus":0.10091215526542896,"score_gpt":0.4402179227642692,"score_spread":0.3393057674988402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1734673682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121771306,0.00087638234,0.86649084,0.0011630715,0.00014584685,0.00006497183,0.000036615802,0.00035781844,0.009093202],"genre_scores_gemma":[0.8728005,0.00036093863,0.124645375,0.000115480914,0.00004188373,0.00006557628,0.00004072329,0.000033379754,0.0018960111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998018,0.000064618565,0.000010768795,0.000023412713,0.00008187285,0.000017625413],"domain_scores_gemma":[0.9993998,0.00035994875,0.00006002986,0.000047539816,0.00009437631,0.000038288745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005838149,0.00029311396,0.00046848436,0.000388919,0.00037725884,0.0009788461,0.00049484824,0.0005764392,0.0012457898],"category_scores_gemma":[0.0011924556,0.00024592082,0.0005462484,0.00045748858,0.0005714042,0.0006791251,0.0005576334,0.00078950886,0.00015849665],"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.00003909686,0.00005064168,0.0008960954,0.000046661844,0.00003768912,0.000059603084,0.00003172656,0.9441797,0.003600992,0.01758209,0.00072000676,0.0327557],"study_design_scores_gemma":[0.0000017528585,0.0000037898121,0.000044837136,0.0000011158584,0.0000010759071,0.0000026453722,0.0000019003761,0.997463,0.00020926716,0.0021527903,0.00011655673,0.0000012955682],"about_ca_topic_score_codex":0.002544662,"about_ca_topic_score_gemma":0.0018955636,"teacher_disagreement_score":0.002544662,"about_ca_system_score_codex":0.0005824083,"about_ca_system_score_gemma":0.00060522056,"threshold_uncertainty_score":0.0050596595},"labels":[],"label_agreement":null},{"id":"W1736267949","doi":"10.1002/cpe.3303","title":"Controlling fairness and task granularity in distributed, online, non‐clairvoyant workflow executions","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Montreal Neurological Institute and Hospital","funders":"CHIST-ERA; Agence Nationale de la Recherche; LabEx PRIMES; European Commission","keywords":"Granularity; Computer science; Workflow; Task (project management); Distributed computing; Control (management); Middleware (distributed applications); Grid; Database; Operating system; Artificial intelligence","score_opus":0.014670849042167351,"score_gpt":0.2913119196751143,"score_spread":0.2766410706329469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1736267949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7525087,0.00039216073,0.24167624,0.0002465381,0.000075941294,0.000116411604,0.000050250695,0.002924693,0.0020090858],"genre_scores_gemma":[0.9793386,0.000025901078,0.020232715,0.000029871922,0.00000982496,0.00002727363,0.000025447238,0.00007406575,0.00023630174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952638,0.0015742868,0.00035569142,0.00094889273,0.0012702838,0.000586922],"domain_scores_gemma":[0.97507226,0.012955903,0.002933751,0.0055034575,0.0018119604,0.0017227057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075282347,0.00072581216,0.0006593921,0.0008791881,0.0011158967,0.0019132647,0.001564473,0.0006504268,0.00054924615],"category_scores_gemma":[0.023721557,0.0003607303,0.0003010902,0.00054148,0.0018719692,0.0015445049,0.0016425867,0.0012462693,0.0001925757],"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.0026123496,0.00085257814,0.03052357,0.00017112342,0.00013398955,0.00034720276,0.0013406862,0.6862197,0.09924216,0.013012505,0.0015928689,0.16395134],"study_design_scores_gemma":[0.00010305773,0.00023623693,0.004533946,0.000016058948,0.000032883643,0.00007349115,0.00010886965,0.9391886,0.04430511,0.010295498,0.0010585422,0.000047759895],"about_ca_topic_score_codex":0.005449182,"about_ca_topic_score_gemma":0.0026709563,"teacher_disagreement_score":0.0075282347,"about_ca_system_score_codex":0.0015918078,"about_ca_system_score_gemma":0.0022293695,"threshold_uncertainty_score":0.039813578},"labels":[],"label_agreement":null},{"id":"W1841239429","doi":"10.1002/cpe.1807","title":"Distributed re‐arrangement scheme for balancing computational load and minimizing communication delays in HLA‐based simulations","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Distributed computing; Computer science; High-level architecture; Single point of failure; Load balancing (electrical power); Scheme (mathematics); Synchronization (alternating current); Computer network; Grid","score_opus":0.20206284961077667,"score_gpt":0.45062351224795655,"score_spread":0.24856066263717988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1841239429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105606146,0.00010875571,0.89071834,0.00015627402,0.000075510034,0.00013375471,0.00002255011,0.0007400673,0.002438674],"genre_scores_gemma":[0.82106,0.000047178917,0.17711438,0.000028397213,0.00002226951,0.000109201595,0.000045703873,0.000031058764,0.0015418065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925786,0.0002803054,0.000054889795,0.00012120365,0.00020371971,0.000082012215],"domain_scores_gemma":[0.99867934,0.00032414158,0.00014420587,0.00036265783,0.00036840694,0.00012125935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012048939,0.0003154793,0.0006275059,0.0005151154,0.00077220704,0.00060188613,0.0012947601,0.00059990113,0.0015843516],"category_scores_gemma":[0.0023952196,0.00018102309,0.00026268876,0.00043225943,0.00047019825,0.0008246275,0.0010289449,0.0005619515,0.00034426668],"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.00063663395,0.00025295574,0.001847804,0.0000761947,0.000053279084,0.00016570963,0.00039454194,0.7552956,0.05166392,0.027589845,0.0024904637,0.15953305],"study_design_scores_gemma":[0.00005187861,0.00008068165,0.00022648626,0.0000039038528,0.000010803005,0.000038100232,0.00003120419,0.98899263,0.0065277773,0.0026346345,0.0013885946,0.000013332401],"about_ca_topic_score_codex":0.0016058144,"about_ca_topic_score_gemma":0.0016402269,"teacher_disagreement_score":0.0016058144,"about_ca_system_score_codex":0.0007143653,"about_ca_system_score_gemma":0.00079467776,"threshold_uncertainty_score":0.0063721538},"labels":[],"label_agreement":null},{"id":"W1848498137","doi":"10.1002/cpe.1826","title":"Tsunami: massively parallel homomorphic hashing on many‐core GPUs","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Alberta","funders":"Hong Kong Baptist University; Nvidia","keywords":"Computer science; Homomorphic encryption; Massively parallel; Parallel computing; Multi-core processor; Hash function; Core (optical fiber); Computer security; Encryption; Telecommunications","score_opus":0.07882458477301257,"score_gpt":0.3203773420037976,"score_spread":0.241552757230785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1848498137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29354128,0.00075564143,0.6728119,0.0007424138,0.00037018172,0.00017753331,0.0002034692,0.009894387,0.021503193],"genre_scores_gemma":[0.7524513,0.00016257641,0.24188729,0.00011076138,0.00005188787,0.000081677485,0.0002440538,0.00023309905,0.004777316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970466,0.000065974295,0.000016297128,0.000036398764,0.00012613379,0.000050542683],"domain_scores_gemma":[0.9995561,0.00008928589,0.000036762493,0.00018205862,0.0000909229,0.000044740398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036992872,0.00033882758,0.0003316474,0.00030315024,0.00040180495,0.0006071982,0.0009030729,0.00032665214,0.0030666967],"category_scores_gemma":[0.0009622542,0.00019690227,0.0003076888,0.00044605057,0.0005678155,0.0007201284,0.0012375908,0.0005158097,0.0006215163],"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.0012303246,0.0002014796,0.0049531516,0.00029631093,0.00017734026,0.00080464967,0.0004671162,0.4346371,0.09476749,0.096294895,0.036210507,0.3299597],"study_design_scores_gemma":[0.00010921364,0.0001266788,0.0006546756,0.000011246536,0.000012207429,0.00014102246,0.000047827347,0.94203925,0.028223028,0.017176107,0.011437275,0.000021495744],"about_ca_topic_score_codex":0.002234137,"about_ca_topic_score_gemma":0.002744385,"teacher_disagreement_score":0.0030666967,"about_ca_system_score_codex":0.00045895032,"about_ca_system_score_gemma":0.0006844074,"threshold_uncertainty_score":0.010259092},"labels":[],"label_agreement":null},{"id":"W1848954124","doi":"10.1002/cpe.3239","title":"Characterizing the scalability of a Web application on a multi‒core server","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Workload; Scalability; Server; Web server; Server farm; Application server; Operating system; Computer network; Web application; The Internet; Client–server model","score_opus":0.0280257403961546,"score_gpt":0.30849375334404155,"score_spread":0.280468012947887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1848954124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9944733,0.00012683129,0.0041941116,0.000027982054,0.0000064302285,0.000017987079,0.000036699657,0.00015830284,0.00095831783],"genre_scores_gemma":[0.9977518,0.000051841365,0.0019513567,0.000009308279,0.0000045196084,0.00001002193,0.000073110554,0.000014923722,0.00013310582],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999453,0.00008783927,0.000043691434,0.00008050459,0.00022960827,0.00010527391],"domain_scores_gemma":[0.99846363,0.0006157908,0.00013613241,0.0001691251,0.00045069194,0.00016462145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006762994,0.00043096096,0.0003641017,0.000764673,0.00030828253,0.00050899154,0.00041240777,0.00026477047,0.00059325225],"category_scores_gemma":[0.0017369674,0.00020694076,0.00019577192,0.0007321969,0.00030447394,0.00089352997,0.0004117309,0.00047387328,0.00017055553],"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.0014146825,0.00087130425,0.1143503,0.000470345,0.0001932449,0.0011270881,0.0008766452,0.19796984,0.5615538,0.0023191953,0.0024189975,0.11643453],"study_design_scores_gemma":[0.000019746896,0.0007844786,0.067080006,0.000021823036,0.00004130288,0.0004331873,0.0003050047,0.8697266,0.05983524,0.0009898031,0.00073510443,0.000027686474],"about_ca_topic_score_codex":0.001575416,"about_ca_topic_score_gemma":0.0010155342,"teacher_disagreement_score":0.001575416,"about_ca_system_score_codex":0.00035455616,"about_ca_system_score_gemma":0.00030278022,"threshold_uncertainty_score":0.003576696},"labels":[],"label_agreement":null},{"id":"W1857811639","doi":"10.1002/cpe.3106","title":"A performance evaluation of mobility management and multihop supplying partner strategies for 3D streaming systems over thin mobile devices","year":2013,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Natural Sciences and Engineering Research Council of Canada","funders":"Canada Research Chairs","keywords":"Computer science; Computer network; Scalability; Network packet; Mobile device; Wireless network; Protocol (science); Packet loss; Bandwidth (computing); Wireless; Telecommunications; World Wide Web","score_opus":0.04198130908628272,"score_gpt":0.349121365128016,"score_spread":0.3071400560417333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857811639","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95783085,0.0007441719,0.03785306,0.00018131937,0.00004849501,0.0001636766,0.00006661632,0.0004211006,0.0026905779],"genre_scores_gemma":[0.9944846,0.00009195583,0.0051467195,0.000009001934,0.000005797062,0.000019705567,0.000030732743,0.000006983562,0.00020450771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914885,0.00030365252,0.000082076105,0.000086376305,0.00026045376,0.000118565644],"domain_scores_gemma":[0.9931252,0.0045920587,0.0005532649,0.0004208827,0.00086781604,0.00044082475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001448141,0.00075488206,0.0007184552,0.0009845452,0.0005823619,0.0006741719,0.00077083585,0.00060627214,0.0012244857],"category_scores_gemma":[0.0060687605,0.00018408535,0.00030285385,0.00062570587,0.00043584386,0.0007764254,0.0008412395,0.0004681096,0.00013125413],"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.0021204997,0.0006512758,0.0093316175,0.00036743292,0.0002236908,0.0006116038,0.0003291603,0.78253233,0.069856174,0.0028722966,0.0014629284,0.12964104],"study_design_scores_gemma":[0.000030095396,0.0010561104,0.0014995232,0.00000719073,0.000032204738,0.00013466743,0.00010549311,0.9862183,0.010349627,0.00034804878,0.00020017642,0.000018568451],"about_ca_topic_score_codex":0.0025389497,"about_ca_topic_score_gemma":0.0011914042,"teacher_disagreement_score":0.0025389497,"about_ca_system_score_codex":0.00077849434,"about_ca_system_score_gemma":0.00036125412,"threshold_uncertainty_score":0.007658601},"labels":[],"label_agreement":null},{"id":"W1864524337","doi":"10.1002/cpe.3215","title":"Exudates and optic disk detection in retinal images of diabetic patients","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Retinal Imaging and Analysis","field":"Medicine","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Fundus (uterus); Retinal; Diabetic retinopathy; Computer science; Optic disc; Artificial intelligence; Optic disk; Ophthalmology; Computer vision; Blindness; Optometry; Medicine; Diabetes mellitus","score_opus":0.00914793945874287,"score_gpt":0.3079026110818377,"score_spread":0.2987546716230948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1864524337","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9947238,0.00051837787,0.003512543,0.00006108685,0.000018677652,0.000031444186,0.0002630684,0.00011262175,0.0007582799],"genre_scores_gemma":[0.9897495,0.00031892204,0.009241742,0.000028217162,0.000015894677,0.000009544481,0.00028278708,0.00000803916,0.00034532254],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998074,0.00003758083,0.00002789342,0.000038615395,0.00006162683,0.00002684132],"domain_scores_gemma":[0.99963856,0.000099235105,0.0000869642,0.000026261456,0.00009434971,0.000054510932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031750364,0.00029141395,0.00030117747,0.0017379359,0.00015073878,0.00043427042,0.00016463584,0.00035051093,0.00077281427],"category_scores_gemma":[0.0012950863,0.000099509925,0.00022552662,0.00043956062,0.00011391971,0.0002105889,0.0002572869,0.00014732158,0.00023155876],"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.005870321,0.00057056686,0.52076435,0.00066032377,0.00035353287,0.0040067076,0.00048633124,0.006591514,0.12288201,0.00037538065,0.002830172,0.3346088],"study_design_scores_gemma":[0.00009120364,0.0009555722,0.82061887,0.00006514849,0.0002212864,0.007962256,0.00058318273,0.10094157,0.06590773,0.0004150173,0.0021808092,0.00005734975],"about_ca_topic_score_codex":0.001745011,"about_ca_topic_score_gemma":0.001532445,"teacher_disagreement_score":0.001745011,"about_ca_system_score_codex":0.0002022343,"about_ca_system_score_gemma":0.00012903787,"threshold_uncertainty_score":0.003469646},"labels":[],"label_agreement":null},{"id":"W1866240378","doi":"10.1002/cpe.3272","title":"Cube data model for multilevel statistics computation of live execution traces","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"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; TRACE (psycholinguistics); Tracing; Process (computing); Data stream mining; Data mining; Range (aeronautics); Architecture; Data cube; Programming language","score_opus":0.08330911937275667,"score_gpt":0.3600327261437425,"score_spread":0.27672360677098584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1866240378","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064271623,0.00018081514,0.9849952,0.00022078575,0.00005907544,0.0001301367,0.002287341,0.0042707594,0.0014287418],"genre_scores_gemma":[0.19960983,0.00079509313,0.7839159,0.0002539061,0.00014366738,0.0009674405,0.009891632,0.0007234264,0.0036991313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973374,0.00038056722,0.00036059122,0.00044173378,0.0012737946,0.00020584486],"domain_scores_gemma":[0.99587893,0.0012919038,0.00034380105,0.0011326711,0.0011918017,0.00016089776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020648874,0.0013830918,0.0016081027,0.0029361339,0.0008427279,0.0040721814,0.00302811,0.00090333103,0.005046906],"category_scores_gemma":[0.009443468,0.00067609444,0.002294222,0.0053051496,0.00073453475,0.0048570693,0.002332601,0.002174337,0.002140737],"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.00091129175,0.00024601707,0.008208852,0.0004513183,0.00025773727,0.00042991806,0.0005490705,0.536231,0.0077477046,0.20253497,0.020961622,0.22147052],"study_design_scores_gemma":[0.00001851329,0.000040910083,0.00028145517,0.000018486371,0.000022570255,0.00004724596,0.00004955449,0.9623326,0.002423423,0.02951449,0.0052310782,0.000019666293],"about_ca_topic_score_codex":0.013718429,"about_ca_topic_score_gemma":0.01297617,"teacher_disagreement_score":0.013718429,"about_ca_system_score_codex":0.0021028887,"about_ca_system_score_gemma":0.0028086663,"threshold_uncertainty_score":0.027277172},"labels":[],"label_agreement":null},{"id":"W1877880043","doi":"10.1002/cpe.3121","title":"On the distributed orchestration of stochastic discrete event simulations","year":2013,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Discrete event simulation; Event (particle physics); Computer science; Orchestration; Discrete event dynamic system; Stochastic simulation; Distributed computing; Stochastic process; Probability distribution; Mathematical optimization; Theoretical computer science; Algorithm; Simulation; Mathematics; Discrete system; Statistics","score_opus":0.09420576302729669,"score_gpt":0.44233888036605745,"score_spread":0.34813311733876073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1877880043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016992623,0.00023328788,0.9762531,0.00049313135,0.00009146189,0.00008936636,0.00004649948,0.0012568212,0.0045436947],"genre_scores_gemma":[0.6875864,0.00046281226,0.30669424,0.00029472023,0.00018488996,0.0003354932,0.00025307108,0.00044964204,0.003738647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99300945,0.0033140723,0.00040215495,0.0009152537,0.0017633096,0.0005958442],"domain_scores_gemma":[0.9848844,0.008720283,0.0007465255,0.0036791414,0.0011004622,0.00086921075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007767802,0.00096353266,0.0015080629,0.0006825858,0.0011205935,0.0025822488,0.002245157,0.00094148907,0.0046004704],"category_scores_gemma":[0.020623395,0.00061808334,0.0009848591,0.0010050102,0.0024119457,0.0026553795,0.005726952,0.0023517357,0.0008333681],"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.00035885637,0.00009982629,0.0013187262,0.0000867229,0.00005646709,0.000192425,0.00025825176,0.80073905,0.0033212642,0.14756967,0.0018054225,0.044193245],"study_design_scores_gemma":[0.000022677536,0.000017162773,0.000050916886,0.00000799695,0.000007641529,0.000017923318,0.000017707223,0.9487505,0.00076628785,0.04841493,0.0019206532,0.0000055606615],"about_ca_topic_score_codex":0.0033038163,"about_ca_topic_score_gemma":0.0025777896,"teacher_disagreement_score":0.007767802,"about_ca_system_score_codex":0.0012946812,"about_ca_system_score_gemma":0.0021201114,"threshold_uncertainty_score":0.041080534},"labels":[],"label_agreement":null},{"id":"W1885757723","doi":"10.1002/cpe.2824","title":"Graphics processing unit pricing of exotic cross‐currency interest rate derivatives with a foreign exchange volatility skew model","year":2012,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Discretization; Computer science; Skew; Graphics processing unit; Parallel computing; Interest rate derivative; Swap (finance); Graphics; Local volatility; Volatility (finance); Computational science; Stochastic volatility; Econometrics; Interest rate; Mathematics; Economics; Computer graphics (images); Finance","score_opus":0.12135542150946166,"score_gpt":0.33009971055984977,"score_spread":0.2087442890503881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1885757723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41542917,0.00032774307,0.5598745,0.0007086055,0.0001861628,0.000054578253,0.000118643584,0.0006051674,0.022695422],"genre_scores_gemma":[0.92876065,0.00010540295,0.06774426,0.00006895363,0.000026254316,0.000029154646,0.00007659676,0.000071704664,0.0031170028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982625,0.00006126111,0.0000073726524,0.000016754884,0.000063043146,0.000025302788],"domain_scores_gemma":[0.99971634,0.00009949681,0.000032279557,0.000054153283,0.00006259692,0.000035096215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034944862,0.00032683718,0.00055592746,0.00021107154,0.00028575215,0.0007762793,0.0005936456,0.0005082989,0.0020822762],"category_scores_gemma":[0.0011422286,0.00018298687,0.00048078457,0.0004216326,0.00047638488,0.00049910595,0.0006117346,0.0008105951,0.00020563591],"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.000117972086,0.00003422611,0.0013956997,0.000020410465,0.000021351872,0.00024569628,0.000036888854,0.94498456,0.0059005874,0.033609297,0.0013710167,0.012262273],"study_design_scores_gemma":[0.000005172944,0.000004605978,0.00006901259,5.674163e-7,8.588731e-7,0.0000075015014,0.0000020650898,0.99783283,0.0003938541,0.0014518199,0.00023039304,0.0000013496065],"about_ca_topic_score_codex":0.0059967646,"about_ca_topic_score_gemma":0.0034408758,"teacher_disagreement_score":0.0059967646,"about_ca_system_score_codex":0.00056008634,"about_ca_system_score_gemma":0.000704955,"threshold_uncertainty_score":0.01192373},"labels":[],"label_agreement":null},{"id":"W1894778686","doi":"10.1002/cpe.1814","title":"Energy management control for supplying partner selection protocol in mobile peer‐to‐peer three‐dimensional streaming","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Bottleneck; Computer network; Protocol (science); Peer-to-peer; Energy (signal processing); Efficient energy use; Distributed computing; Mobile device; Latency (audio); Energy management; Control (management); Selection (genetic algorithm); Telecommunications; Engineering; Operating system; Embedded system","score_opus":0.03509517992922094,"score_gpt":0.3335421077200209,"score_spread":0.29844692779079995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1894778686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18559387,0.0005968157,0.8060484,0.0005421568,0.00017030664,0.00038693452,0.0000916454,0.0025342952,0.0040354473],"genre_scores_gemma":[0.9568109,0.00011809673,0.04188378,0.00010145885,0.00002474021,0.00013245454,0.00007092818,0.000032486914,0.0008251383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993137,0.00018255599,0.00007194841,0.00010271859,0.00026839777,0.00006068974],"domain_scores_gemma":[0.9977458,0.0010163193,0.00024289804,0.00022845378,0.00064792513,0.000118605174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012701373,0.00044337905,0.00046859155,0.0005721879,0.00067795365,0.00069108827,0.00124409,0.00061550504,0.00075562415],"category_scores_gemma":[0.0034789976,0.00018154546,0.0002416672,0.0003497632,0.000512139,0.00086243934,0.00094569253,0.000709711,0.00012277406],"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.0008460948,0.0005320297,0.005834695,0.0003240193,0.00021213682,0.00090879784,0.00095298566,0.563771,0.12406268,0.028500058,0.0055624447,0.268493],"study_design_scores_gemma":[0.00002609229,0.00009400246,0.00043072834,0.0000067694805,0.000017373308,0.00009339696,0.000052849162,0.984774,0.010943654,0.0021457653,0.0013910647,0.000024346193],"about_ca_topic_score_codex":0.0018861269,"about_ca_topic_score_gemma":0.0016641096,"teacher_disagreement_score":0.0018861269,"about_ca_system_score_codex":0.0005744726,"about_ca_system_score_gemma":0.00059130276,"threshold_uncertainty_score":0.0067171454},"labels":[],"label_agreement":null},{"id":"W1901179229","doi":"10.1002/cpe.3234","title":"Batchsubmit: a high‐volume batch submission system for earthquake engineering simulation","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Lawrence Livermore National Laboratory; U.S. Department of Energy; National Science Foundation","keywords":"Cyberinfrastructure; Science and engineering; Gateway (web page); Computer science; Server; Volume (thermodynamics); Grid; World Wide Web; Operating system; Engineering; Geology","score_opus":0.015361885062783449,"score_gpt":0.2819736982768888,"score_spread":0.2666118132141053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1901179229","genre_codex":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071769254,0.00029965435,0.24978437,0.00037302473,0.00082669075,0.001266183,0.010038135,0.7223689,0.00786603],"genre_scores_gemma":[0.2651649,0.0012311679,0.3906179,0.001239743,0.0014162819,0.0051796893,0.093187205,0.19756022,0.044402886],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99568236,0.0011313782,0.00059192645,0.00082127017,0.0014221219,0.00035103422],"domain_scores_gemma":[0.98364097,0.005731319,0.000757013,0.0045374325,0.0030479096,0.0022854046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009540523,0.0027675577,0.0023326532,0.0018794405,0.0013452338,0.0039471425,0.0074371253,0.0012773429,0.07908427],"category_scores_gemma":[0.02467813,0.0018620373,0.001710857,0.0017031659,0.0011075942,0.004014104,0.005397994,0.002328714,0.044003285],"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.0063055498,0.00066956924,0.0056267753,0.0012520096,0.00056525756,0.0008763898,0.0006894165,0.028021531,0.017404374,0.0097062895,0.7741771,0.15470576],"study_design_scores_gemma":[0.0038877828,0.0006891428,0.004936044,0.000120153265,0.00015980782,0.000512422,0.00022071954,0.6420569,0.042751424,0.022085464,0.28208214,0.00049800915],"about_ca_topic_score_codex":0.003134897,"about_ca_topic_score_gemma":0.0023478288,"teacher_disagreement_score":0.07908427,"about_ca_system_score_codex":0.0011677786,"about_ca_system_score_gemma":0.0035697832,"threshold_uncertainty_score":0.26456326},"labels":[],"label_agreement":null},{"id":"W1902521824","doi":"10.1002/cpe.1872","title":"Experiences in building and scaling an enterprise application on multicore systems","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); IBI Group (Canada)","funders":"","keywords":"Computer science; Scalability; Multi-core processor; Java; Benchmark (surveying); Operating system; Software; Rendering (computer graphics); Parallel computing; Distributed computing","score_opus":0.03543385766454156,"score_gpt":0.32385591362574234,"score_spread":0.2884220559612008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1902521824","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91852874,0.0005898088,0.045675438,0.0013911553,0.00020082186,0.00034286804,0.00017724192,0.0047967266,0.028297145],"genre_scores_gemma":[0.8787445,0.00053930277,0.11131088,0.00027196368,0.00007378811,0.00014194981,0.0008193309,0.0012359293,0.0068624737],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971746,0.00090144743,0.00016170435,0.0002651312,0.0010469835,0.00045013241],"domain_scores_gemma":[0.99486095,0.0015080614,0.00012055117,0.001202129,0.0014407772,0.00086749176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005023411,0.0007330753,0.00041005266,0.00050979777,0.0014581395,0.0015311132,0.0017997143,0.00068112597,0.0022124008],"category_scores_gemma":[0.0081596365,0.0005245181,0.00053722004,0.00090507173,0.00097586866,0.002609152,0.0021987737,0.0017871879,0.0007434361],"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.0010306305,0.0040301825,0.028492708,0.0009118337,0.00024971904,0.004055537,0.022101397,0.10541237,0.12577252,0.017315418,0.047203626,0.6434241],"study_design_scores_gemma":[0.0004888965,0.005997676,0.04779869,0.00035002455,0.0002398647,0.0029581455,0.012096711,0.4102853,0.21148698,0.019299349,0.28860903,0.00038927182],"about_ca_topic_score_codex":0.0043421285,"about_ca_topic_score_gemma":0.005109561,"teacher_disagreement_score":0.005023411,"about_ca_system_score_codex":0.0010498066,"about_ca_system_score_gemma":0.0010219276,"threshold_uncertainty_score":0.026566625},"labels":[],"label_agreement":null},{"id":"W1918106294","doi":"10.1002/cpe.3503","title":"Hyper‐star graphs: Some topological properties and an optimal neighbourhood broadcasting algorithm","year":2015,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Neighbourhood (mathematics); Combinatorics; Star (game theory); Mathematics; Graph; A* search algorithm; Discrete mathematics; Hypercube; Algorithm; Computer science","score_opus":0.08408094310322434,"score_gpt":0.32253054664030634,"score_spread":0.238449603537082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1918106294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44463667,0.0004028223,0.528901,0.0010257221,0.000056421446,0.00018289451,0.00017016755,0.00035019443,0.024274075],"genre_scores_gemma":[0.7534442,0.00022370077,0.24023281,0.000095413074,0.000025876334,0.000109114684,0.00023975135,0.00006531592,0.005563833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976176,0.0000664748,0.000011159844,0.00005185913,0.000063535255,0.000045230525],"domain_scores_gemma":[0.99934,0.00026133275,0.00008157323,0.000102596365,0.00010049287,0.00011394308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003844328,0.00018537487,0.00038891958,0.00043272055,0.0006423934,0.0008396091,0.00093799445,0.0007258785,0.0027541823],"category_scores_gemma":[0.0015414188,0.00024267875,0.00034956355,0.0006495326,0.0006516693,0.0012147647,0.00091760023,0.00048246558,0.00032487072],"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.00043447036,0.00017618012,0.0024403417,0.00023977524,0.000046519956,0.00017066998,0.0009474115,0.29142976,0.03328195,0.44237778,0.008392638,0.22006252],"study_design_scores_gemma":[0.00008280278,0.00013625751,0.00072096795,0.000017364018,0.000020302068,0.00016890992,0.00025492357,0.86861366,0.006226422,0.11883579,0.004904936,0.000017656852],"about_ca_topic_score_codex":0.0029151207,"about_ca_topic_score_gemma":0.0027729033,"teacher_disagreement_score":0.0029151207,"about_ca_system_score_codex":0.00092038553,"about_ca_system_score_gemma":0.0008596993,"threshold_uncertainty_score":0.009213626},"labels":[],"label_agreement":null},{"id":"W1934208600","doi":"10.1002/cpe.3695","title":"Computing probable maximum loss in catastrophe reinsurance portfolios on multi‐core and many‐core architectures","year":2015,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Reinsurance; Portfolio; Computer science; Multi-core processor; Petascale computing; Natural disaster; Natural hazard; Storm; Supercomputer; Actuarial science; Meteorology; Parallel computing; Finance; Economics","score_opus":0.13009492035308984,"score_gpt":0.4146381363978724,"score_spread":0.28454321604478255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1934208600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7632876,0.0003575981,0.2319068,0.00041952755,0.000030039051,0.00007328097,0.000111746114,0.00046972762,0.00334371],"genre_scores_gemma":[0.9588789,0.00007088524,0.039978176,0.000037870625,0.000011759316,0.00003426789,0.000106698404,0.00003352372,0.00084788655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992551,0.00025805784,0.000054687745,0.000096203774,0.00020974556,0.00012612602],"domain_scores_gemma":[0.9960134,0.002633647,0.00038052676,0.000259034,0.0004563285,0.00025707306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002661053,0.0006399701,0.0006260865,0.0008862397,0.0004532788,0.0011881341,0.0007671253,0.00058596616,0.0014878305],"category_scores_gemma":[0.007519828,0.00044653623,0.00059849164,0.00056384434,0.0005623858,0.0011634069,0.0010696831,0.00075316866,0.00014267954],"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.00008502902,0.000019543342,0.0033468392,0.000010955005,0.000024220815,0.000060769587,0.000023329412,0.98570526,0.0004432643,0.0017602316,0.00016664075,0.008353891],"study_design_scores_gemma":[0.0000019177617,0.000010837147,0.00032022296,9.841317e-7,0.0000016084832,0.0000061088554,0.0000065181293,0.9982017,0.00015755728,0.0012598579,0.000031293257,0.0000012226079],"about_ca_topic_score_codex":0.0062767724,"about_ca_topic_score_gemma":0.0051784157,"teacher_disagreement_score":0.0062767724,"about_ca_system_score_codex":0.0013611589,"about_ca_system_score_gemma":0.00104048,"threshold_uncertainty_score":0.0140731335},"labels":[],"label_agreement":null},{"id":"W1943450596","doi":"10.1002/cpe.1785","title":"Real‐time helpfulness prediction based on voter opinions","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Helpfulness; Computer science; Machine learning; Data mining; Convergence (economics); Artificial intelligence; Algorithm","score_opus":0.040745024782646744,"score_gpt":0.31074389322423623,"score_spread":0.2699988684415895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943450596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5256775,0.00027332033,0.46883592,0.0005690602,0.00007106956,0.00009264809,0.00035705208,0.0013835029,0.002739968],"genre_scores_gemma":[0.96137244,0.000039353174,0.03779487,0.000026484346,0.000036672624,0.000024311958,0.0002003366,0.000021430462,0.00048414647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911696,0.0003611399,0.000050973224,0.00018507667,0.00021524151,0.000070651644],"domain_scores_gemma":[0.99236065,0.004326509,0.00094742776,0.0005747777,0.0015692725,0.00022137456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018711151,0.00043166077,0.0006633556,0.00093388354,0.0002205647,0.0007812894,0.0006572257,0.0004905524,0.000987392],"category_scores_gemma":[0.010077682,0.00020750644,0.0002747251,0.0005513432,0.00023766112,0.0012147231,0.00036315844,0.0007799006,0.0007625482],"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.0012306615,0.00033104618,0.08670157,0.00021423251,0.00017391509,0.00018340921,0.00034403958,0.48884326,0.022375666,0.004851574,0.0068754824,0.38787517],"study_design_scores_gemma":[0.000005695407,0.000026904623,0.0029895126,0.0000033899641,0.0000052868513,0.000016017264,0.000017913268,0.99324715,0.0023962343,0.0010951138,0.00018997306,0.0000067454653],"about_ca_topic_score_codex":0.0016040739,"about_ca_topic_score_gemma":0.0018709537,"teacher_disagreement_score":0.0018711151,"about_ca_system_score_codex":0.00039878386,"about_ca_system_score_gemma":0.00025947668,"threshold_uncertainty_score":0.0098955035},"labels":[],"label_agreement":null},{"id":"W1944708231","doi":"10.1002/cpe.1784","title":"An efficient graphics processing unit‐based parallel algorithm for pricing multi‐asset American options","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Graphics processing unit; Graphics; Complementarity (molecular biology); Parallel computing; Mathematical optimization; Linear complementarity problem; Valuation of options; Algorithm; Mathematics; Computer graphics (images)","score_opus":0.08426280087602969,"score_gpt":0.3369720426031249,"score_spread":0.2527092417270952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1944708231","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016375622,0.00008799176,0.97836214,0.00019726358,0.00006214163,0.00004835586,0.000031961732,0.000510203,0.004324325],"genre_scores_gemma":[0.2117207,0.00010259653,0.784117,0.00008521009,0.000031057836,0.00016269185,0.00009897024,0.00021832122,0.0034634706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997217,0.00007099357,0.000012602502,0.000023111343,0.00013852808,0.000033095082],"domain_scores_gemma":[0.99959904,0.00012731297,0.000025869787,0.00006208166,0.000150739,0.00003493389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004922377,0.000418156,0.0005099861,0.00042653768,0.0005033058,0.00060509075,0.0010571419,0.0006817845,0.0034385954],"category_scores_gemma":[0.0016124179,0.00028712332,0.00048138737,0.00071429205,0.000550736,0.0005972978,0.00085542287,0.0009524041,0.0009545211],"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.00015601591,0.0000697777,0.00095464214,0.000073489806,0.0000361562,0.00022254627,0.00014656872,0.75111854,0.01221339,0.075283065,0.006161297,0.15356451],"study_design_scores_gemma":[0.000017541184,0.0000064463056,0.000040918843,0.0000018091692,0.00000156498,0.000013696662,0.0000039030724,0.9920195,0.0006650642,0.0058029206,0.0014238501,0.0000028108427],"about_ca_topic_score_codex":0.004050206,"about_ca_topic_score_gemma":0.003712824,"teacher_disagreement_score":0.004050206,"about_ca_system_score_codex":0.00050713186,"about_ca_system_score_gemma":0.00094188616,"threshold_uncertainty_score":0.01150322},"labels":[],"label_agreement":null},{"id":"W1946135105","doi":"10.1002/cpe.3420","title":"P2Pedia: a peer‐to‐peer wiki for decentralized collaboration","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Wikis in Education and Collaboration","field":"Social Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Synchronizing; World Wide Web; Peer-to-peer; Selection (genetic algorithm); Process (computing); Collaborative editing; Social network (sociolinguistics); File sharing; Information retrieval; Social media; The Internet","score_opus":0.027472966193683414,"score_gpt":0.42676001253430085,"score_spread":0.39928704634061746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1946135105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022733998,0.00037934692,0.89927,0.0009345565,0.00046851355,0.00089533644,0.0008971211,0.056842458,0.017578604],"genre_scores_gemma":[0.24994051,0.00037504395,0.7254685,0.0003008001,0.00025256965,0.001200611,0.0029686843,0.0026755386,0.016817683],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975313,0.000825708,0.0002596703,0.00047706557,0.00074052316,0.00016573002],"domain_scores_gemma":[0.9943316,0.0013665273,0.00036456523,0.002123498,0.0007757332,0.0010380812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029175999,0.00060977,0.0006654622,0.0014778572,0.0018996295,0.0023110865,0.002402781,0.0012335705,0.0059506656],"category_scores_gemma":[0.008592989,0.00051205506,0.0005772009,0.0011491528,0.0010375279,0.0052539892,0.0066315723,0.0017387294,0.0030937777],"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.0009913957,0.00076404057,0.004612327,0.0013356633,0.0002376464,0.0015369914,0.0025831463,0.026138918,0.037461452,0.12613374,0.13286683,0.66533786],"study_design_scores_gemma":[0.00039026482,0.00038950497,0.0026927732,0.00018825219,0.0001029914,0.0013997201,0.00051037,0.3419685,0.031909797,0.11314117,0.5070051,0.0003016078],"about_ca_topic_score_codex":0.0023013416,"about_ca_topic_score_gemma":0.002636754,"teacher_disagreement_score":0.0059506656,"about_ca_system_score_codex":0.0005640454,"about_ca_system_score_gemma":0.0025640896,"threshold_uncertainty_score":0.019906938},"labels":[],"label_agreement":null},{"id":"W1947115020","doi":"10.1002/cpe.2907","title":"Parallel computing strategies in the analysis of the inhibiting effect of price limits on futures prices","year":2012,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Complex Systems and Time Series Analysis","field":"Economics, Econometrics and Finance","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; McMaster University","funders":"","keywords":"Futures contract; Limit (mathematics); Currency; Cluster (spacecraft); Computer science; Series (stratigraphy); Economics; Econometrics; Financial economics; Mathematics; Monetary economics","score_opus":0.03227067445693936,"score_gpt":0.3031117327399566,"score_spread":0.27084105828301724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1947115020","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8297289,0.00063159317,0.1630692,0.001210908,0.00007996541,0.00012737008,0.00017787231,0.0004982419,0.00447591],"genre_scores_gemma":[0.94105613,0.00015302563,0.057878885,0.000060647057,0.000027120843,0.00009491226,0.00017574332,0.000060849477,0.00049270975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998679,0.0006617772,0.00008105832,0.00017427951,0.0002523273,0.00015161867],"domain_scores_gemma":[0.9882328,0.008447785,0.00078030466,0.0011485864,0.0010627208,0.0003277757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003892439,0.0006865305,0.0007967573,0.0010148373,0.0008699234,0.0014463464,0.0013243033,0.0005986465,0.0012569616],"category_scores_gemma":[0.022818653,0.0004324804,0.0006468111,0.001485537,0.0017488444,0.0015752271,0.00090685335,0.0011362145,0.00014416485],"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.00076245266,0.00023526834,0.010696708,0.000093110044,0.00010713691,0.00019410648,0.00018017295,0.92280686,0.003924435,0.030939477,0.0010005286,0.029059678],"study_design_scores_gemma":[0.000023342574,0.000016721993,0.0006046315,0.000002654229,0.00000937779,0.000008541378,0.00002279317,0.99080265,0.0010581176,0.0072989715,0.00014892001,0.0000033118972],"about_ca_topic_score_codex":0.010616279,"about_ca_topic_score_gemma":0.0049658488,"teacher_disagreement_score":0.010616279,"about_ca_system_score_codex":0.0011984622,"about_ca_system_score_gemma":0.0021106969,"threshold_uncertainty_score":0.021108985},"labels":[],"label_agreement":null},{"id":"W1952234003","doi":"10.1002/cpe.3065","title":"RSEL: revocable secure efficient lightweight RFID authentication scheme","year":2013,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"RFID technology advancements","field":"Engineering","cited_by":16,"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 Waterloo","funders":"Fundamental Research Funds for the Central Universities; Ministry of Education of the People's Republic of China; National Natural Science Foundation of China; National Science and Technology Major Project; Strong","keywords":"Computer science; Authentication (law); Hash function; Correctness; Radio-frequency identification; Computer security; Key (lock); Scheme (mathematics); Database; Computer network","score_opus":0.00849781266219176,"score_gpt":0.264465261212887,"score_spread":0.25596744855069525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1952234003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16197522,0.002057493,0.8060753,0.0011457681,0.000523427,0.00060536055,0.00044243026,0.010097511,0.017077537],"genre_scores_gemma":[0.9200009,0.0003769525,0.06537319,0.00027782383,0.00008717671,0.00015524901,0.00042604044,0.00009939121,0.013203234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984471,0.00036739447,0.00016824812,0.00021997918,0.0004987628,0.00029851074],"domain_scores_gemma":[0.99832267,0.00024760424,0.00032669958,0.0006501852,0.00036312157,0.00008971994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010270939,0.00050208106,0.0006427719,0.00096567627,0.0005707159,0.0010870964,0.0012155123,0.0009808793,0.004355462],"category_scores_gemma":[0.0019532784,0.00020694471,0.0006239304,0.00059961673,0.0008248821,0.0023714278,0.0024258106,0.00090533565,0.0024322742],"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.0040448233,0.00033023086,0.0031259847,0.0009219479,0.00021918741,0.0027475683,0.00093833124,0.06298594,0.31614044,0.16830851,0.020502971,0.41973403],"study_design_scores_gemma":[0.00073718734,0.0016947428,0.001907445,0.00017107223,0.00021825139,0.0048587546,0.00032421784,0.5499788,0.2545563,0.061100252,0.12402635,0.00042661792],"about_ca_topic_score_codex":0.00044273815,"about_ca_topic_score_gemma":0.00028613053,"teacher_disagreement_score":0.004355462,"about_ca_system_score_codex":0.00070561876,"about_ca_system_score_gemma":0.00088822376,"threshold_uncertainty_score":0.014570475},"labels":[],"label_agreement":null},{"id":"W1955581029","doi":"10.1002/cpe.1827","title":"Dual cryptography authentication protocol and its security analysis for radio frequency identification systems","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"RFID technology advancements","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Authentication protocol; Radio-frequency identification; Computer network; Replay attack; Authentication (law); Hash function; Encryption; Cryptography; Hash-based message authentication code; Correctness; Cryptographic protocol; Session key; Computer security; Otway–Rees protocol; Challenge-Handshake Authentication Protocol; Message authentication code","score_opus":0.03220921316326355,"score_gpt":0.3195195573886396,"score_spread":0.28731034422537605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1955581029","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06948625,0.0015357631,0.9147573,0.00064189755,0.00013360991,0.0001543786,0.000082793034,0.00031418714,0.012893846],"genre_scores_gemma":[0.93171114,0.0010324747,0.06167605,0.00009441332,0.000099083496,0.0001975297,0.00009817067,0.000039723625,0.005051442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976186,0.0005950406,0.00015005677,0.00030254482,0.0010833575,0.00025024026],"domain_scores_gemma":[0.99618226,0.0016955141,0.00053821976,0.00057615375,0.00090666785,0.00010115937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016457613,0.0006952229,0.00062905165,0.0017499054,0.0007314371,0.0019859294,0.0007187815,0.0011278115,0.0028728202],"category_scores_gemma":[0.004744164,0.00038951993,0.0010420255,0.0011081173,0.0019449652,0.0029887143,0.0014017118,0.0019015317,0.00089148595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000569926,0.00013376743,0.0028326835,0.00028093057,0.000100712525,0.0009974669,0.00047848577,0.13866985,0.043670405,0.7531571,0.0023943828,0.056714293],"study_design_scores_gemma":[0.000028967477,0.00010236538,0.00034834776,0.00003321866,0.000035097542,0.0006697373,0.000052462132,0.85188735,0.012288861,0.13058412,0.003926887,0.000042690717],"about_ca_topic_score_codex":0.0008245281,"about_ca_topic_score_gemma":0.00023963864,"teacher_disagreement_score":0.0028728202,"about_ca_system_score_codex":0.0016089336,"about_ca_system_score_gemma":0.0013336601,"threshold_uncertainty_score":0.011673689},"labels":[],"label_agreement":null},{"id":"W1981341755","doi":"10.1002/cpe.1679","title":"Secure SCADA framework for the protection of energy control systems","year":2010,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"British Columbia Institute of Technology","keywords":"SCADA; Computer security; The Internet; Computer science; Control (management); Task (project management); Emerging technologies; Wireless sensor network; Risk analysis (engineering); Engineering; Systems engineering; Computer network; Business; World Wide Web; Electrical engineering","score_opus":0.011038655803051132,"score_gpt":0.2665108632302977,"score_spread":0.2554722074272466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981341755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005592944,0.0004946132,0.98632044,0.00035552646,0.00008062427,0.0001273355,0.000100249286,0.002554992,0.004373269],"genre_scores_gemma":[0.52408594,0.0010007096,0.4640281,0.00020827966,0.0001877305,0.000567708,0.0006222166,0.00036402297,0.00893522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985758,0.0004489506,0.00013763807,0.00014431405,0.0005374363,0.0001558805],"domain_scores_gemma":[0.99850583,0.0004943251,0.00015019394,0.0003802198,0.00035915655,0.00011027876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029812101,0.00070718094,0.0007577098,0.0009846048,0.0008737631,0.002912224,0.001926875,0.00117543,0.0047965166],"category_scores_gemma":[0.002957419,0.00045994445,0.000788831,0.0006549472,0.0014687896,0.002511706,0.002027042,0.002095507,0.0012656081],"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.00013950898,0.00007681923,0.0008431115,0.00025156967,0.00007777992,0.0005508917,0.00047703309,0.17362183,0.0037749617,0.7463321,0.007998807,0.06585565],"study_design_scores_gemma":[0.00007104385,0.000053047752,0.00012653864,0.00007954682,0.000030489737,0.00013275295,0.000066715336,0.85097975,0.0021847275,0.1084558,0.03779781,0.000021794996],"about_ca_topic_score_codex":0.0033867722,"about_ca_topic_score_gemma":0.004280651,"teacher_disagreement_score":0.0047965166,"about_ca_system_score_codex":0.0010872326,"about_ca_system_score_gemma":0.0017340282,"threshold_uncertainty_score":0.016045928},"labels":[],"label_agreement":null},{"id":"W1995571756","doi":"10.1002/cpe.3484","title":"SDIVIP<sup>2</sup>: shared data integrity verification with identity privacy preserving in mobile clouds","year":2015,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Correctness; Cloud computing; Data integrity; Mobile device; Mobile computing; Computer security; Mobile cloud computing; Cloud storage; Computer network; Operating system","score_opus":0.10292230525331082,"score_gpt":0.3762520229677956,"score_spread":0.2733297177144848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995571756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068892926,0.0008575011,0.9202818,0.0014926858,0.00031401002,0.00034020026,0.0001898405,0.001365442,0.006265675],"genre_scores_gemma":[0.910194,0.00034782354,0.08598677,0.00023179328,0.00011145165,0.00013216153,0.0002422736,0.0000777045,0.0026760378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99474937,0.0014284282,0.0005219106,0.00050525286,0.0020073063,0.0007877482],"domain_scores_gemma":[0.992879,0.0015380061,0.00092234527,0.002824777,0.0014679248,0.00036796773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046647796,0.0004004696,0.00080221205,0.0007008463,0.0015521758,0.0029958526,0.0021750366,0.0011507488,0.0016945654],"category_scores_gemma":[0.0055322647,0.00043632564,0.0007146386,0.0012005046,0.0022777878,0.0037564803,0.004787175,0.0020681766,0.00062637386],"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.0024419487,0.0003341849,0.007349976,0.00072222913,0.0002856473,0.0024684328,0.0016229737,0.10890452,0.07203853,0.40216115,0.02148808,0.3801823],"study_design_scores_gemma":[0.00014746793,0.00037449854,0.0010245679,0.0001161534,0.000100160956,0.0012516556,0.0005648747,0.7569616,0.11898983,0.08126053,0.039091475,0.00011721298],"about_ca_topic_score_codex":0.0024429823,"about_ca_topic_score_gemma":0.0011463795,"teacher_disagreement_score":0.0046647796,"about_ca_system_score_codex":0.0016664665,"about_ca_system_score_gemma":0.0032784191,"threshold_uncertainty_score":0.024670005},"labels":[],"label_agreement":null},{"id":"W2016265567","doi":"10.1002/cpe.1154","title":"Towards building a conflict‐free mobile distributed file system","year":2007,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Operating system; Cache; Self-certifying File System; File system fragmentation; Computer network; File system; Mobile database; Virtual file system; File server; Mobile computing; Distributed File System; Network File System; Distributed computing; Device file; Computer file; Mobile station; SSH File Transfer Protocol; Base station","score_opus":0.022824646860885416,"score_gpt":0.3300688373834963,"score_spread":0.30724419052261087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016265567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058605082,0.0002180642,0.9378809,0.00017481776,0.00002717376,0.00011347718,0.000038293638,0.0020168624,0.0009252949],"genre_scores_gemma":[0.36139402,0.000086242464,0.637074,0.000066160224,0.000019118032,0.00012802995,0.00011655903,0.00008667848,0.0010291868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906605,0.000259985,0.000085192776,0.00013560847,0.00035470835,0.000098568955],"domain_scores_gemma":[0.99779886,0.000689564,0.00019737036,0.0006206481,0.00055003475,0.00014352195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014877333,0.0003696959,0.00059655367,0.00065175066,0.0008071601,0.0013915118,0.0021872895,0.0011082892,0.0013843628],"category_scores_gemma":[0.0044656233,0.00041181353,0.00038586912,0.00062527636,0.00083055417,0.002201926,0.0021185533,0.0008386057,0.0005908605],"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.0008390843,0.0005382871,0.009941005,0.00044895202,0.0001644167,0.0010828982,0.0011524946,0.45018986,0.06636657,0.09057102,0.007676303,0.37102926],"study_design_scores_gemma":[0.000096529184,0.00010399289,0.00022537846,0.000015881533,0.000024421555,0.00025397295,0.00007839321,0.96361524,0.01727025,0.011220896,0.007076168,0.000018892511],"about_ca_topic_score_codex":0.001543151,"about_ca_topic_score_gemma":0.0011127993,"teacher_disagreement_score":0.0021872895,"about_ca_system_score_codex":0.00060957676,"about_ca_system_score_gemma":0.0007969695,"threshold_uncertainty_score":0.007867992},"labels":[],"label_agreement":null},{"id":"W2022585781","doi":"10.1002/cpe.3225","title":"A special issue from the international conference on performance engineering 2013","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Presentation (obstetrics); Computer science; Track (disk drive); Scalability; Engineering management; Work (physics); Cloud computing; Operations research; Engineering","score_opus":0.01944731550503047,"score_gpt":0.2803042293035841,"score_spread":0.26085691379855364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022585781","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024006676,0.056559507,0.02639714,0.046949748,0.7192515,0.0007599304,0.0031477208,0.003355144,0.14117864],"genre_scores_gemma":[0.010801889,0.046466112,0.01069255,0.009405103,0.31944916,0.0005190928,0.009857934,0.0036675022,0.58914065],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9939738,0.0006860563,0.00040075745,0.0009832417,0.0033518805,0.00060428947],"domain_scores_gemma":[0.98721087,0.0016440791,0.0005216023,0.0008958211,0.006648311,0.003079343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050783767,0.0025123607,0.002941902,0.0034442537,0.0025523214,0.011865683,0.0030048229,0.0029161286,0.18346007],"category_scores_gemma":[0.010253382,0.0008740549,0.0017001308,0.0028051108,0.0010821569,0.006823884,0.0037107063,0.0067904205,0.10198186],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057112902,0.00005222932,0.000103106715,0.0002644069,0.000016259597,0.00005707457,0.000037229805,0.00015870294,0.00055591593,0.0020034916,0.9488253,0.047869135],"study_design_scores_gemma":[0.000012622665,0.00005457151,0.00034548753,0.00022756243,0.000013927688,0.00014108088,0.000048931906,0.00039830917,0.00031302997,0.0020838466,0.9963403,0.000020391142],"about_ca_topic_score_codex":0.001379992,"about_ca_topic_score_gemma":0.002204387,"teacher_disagreement_score":0.18346007,"about_ca_system_score_codex":0.003100873,"about_ca_system_score_gemma":0.0039074617,"threshold_uncertainty_score":0.6137351},"labels":[],"label_agreement":null},{"id":"W2025491049","doi":"10.1002/cpe.1730","title":"Towards automated HPC scheduler configuration tuning","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Workload; Exploit; Scheduling (production processes); Distributed computing; System administrator; Job scheduler; Supercomputer; Operating system; Cloud computing; Computer security","score_opus":0.05162810296010164,"score_gpt":0.3232079087232329,"score_spread":0.2715798057631313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025491049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057923026,0.00058342784,0.8680198,0.0005927449,0.00020842615,0.00059100025,0.00032516703,0.06400162,0.0077548833],"genre_scores_gemma":[0.58266604,0.0002997986,0.410097,0.00037658346,0.00010160672,0.0003381101,0.00097463554,0.0022695516,0.002876726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995673,0.0016590322,0.00030855378,0.0007730152,0.001185325,0.00040099488],"domain_scores_gemma":[0.99239105,0.0028181097,0.0010421454,0.0019480211,0.0014361684,0.00036453657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044330033,0.001681278,0.0012260758,0.0017580539,0.0010268776,0.0025599746,0.0032014423,0.0013431285,0.0033817848],"category_scores_gemma":[0.01629692,0.0010272117,0.0005097135,0.0011145466,0.0008412564,0.0015505576,0.0019269382,0.0021185966,0.0022016293],"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.0005633431,0.00082748407,0.011643481,0.00044861788,0.00013199258,0.00056903344,0.00063486927,0.38060188,0.05123551,0.0083323475,0.02260626,0.52240515],"study_design_scores_gemma":[0.00010813006,0.00006312134,0.0011967303,0.00005444634,0.000024977751,0.00010772452,0.00008233094,0.9543538,0.02825333,0.0048556523,0.010847586,0.0000521036],"about_ca_topic_score_codex":0.003178204,"about_ca_topic_score_gemma":0.0027047396,"teacher_disagreement_score":0.0044330033,"about_ca_system_score_codex":0.0011947608,"about_ca_system_score_gemma":0.0034137422,"threshold_uncertainty_score":0.023444235},"labels":[],"label_agreement":null},{"id":"W2035038509","doi":"10.1002/cpe.858","title":"Experience in integrating Java with C# and .NET","year":2005,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Research Foundation","keywords":"Java applet; Computer science; Java; Java API for XML-based RPC; Real time Java; Java annotation; Java Card; Interfacing; Generics in Java; World Wide Web; strictfp; Operating system","score_opus":0.026930992396828255,"score_gpt":0.3260201638268849,"score_spread":0.29908917143005664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035038509","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76459044,0.005503738,0.10270444,0.009581614,0.00064935157,0.00038001346,0.00012470713,0.0021415905,0.11432408],"genre_scores_gemma":[0.8260455,0.0046588317,0.1321758,0.003552787,0.00026453802,0.00016894915,0.0004060282,0.001402021,0.031325538],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9902176,0.0050567593,0.00047576556,0.00060902926,0.0028769467,0.000763849],"domain_scores_gemma":[0.97879833,0.012927038,0.0008113961,0.0016011465,0.003485876,0.0023761794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017338473,0.000611294,0.00047223733,0.0008587067,0.0021256488,0.005957665,0.0022008931,0.0015801116,0.0052727936],"category_scores_gemma":[0.02406457,0.0008217452,0.0005737065,0.0014301288,0.0026200064,0.0068911845,0.00397606,0.0033916556,0.0017904575],"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.0010641174,0.0034796232,0.02437016,0.0009906909,0.000089323934,0.0057160174,0.1872981,0.0040109158,0.027902853,0.026788931,0.030478502,0.6878107],"study_design_scores_gemma":[0.00028890907,0.00554716,0.020844746,0.001993866,0.00020464676,0.008971529,0.061698064,0.02622569,0.023408175,0.014774332,0.8355443,0.0004985555],"about_ca_topic_score_codex":0.0045638583,"about_ca_topic_score_gemma":0.004233368,"teacher_disagreement_score":0.017338473,"about_ca_system_score_codex":0.0013663872,"about_ca_system_score_gemma":0.0013415955,"threshold_uncertainty_score":0.09169567},"labels":[],"label_agreement":null},{"id":"W2051427249","doi":"10.1002/cpe.729","title":"Implementation of the EARTH programming model on SMP clusters: a multi‐threaded language and runtime system","year":2003,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"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 Alberta; Université du Québec à Montréal","funders":"Defense Advanced Research Projects Agency","keywords":"Computer science; POSIX Threads; Software portability; Runtime system; Parallel computing; Programming paradigm; Scheduling (production processes); Synchronization (alternating current); Distributed computing; Operating system; Programming language; Thread (computing); Computer network","score_opus":0.027611399581877184,"score_gpt":0.34294523777026137,"score_spread":0.3153338381883842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051427249","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022314237,0.00007396457,0.950342,0.00015130675,0.0000573873,0.00014228684,0.000125572,0.022951018,0.0038421971],"genre_scores_gemma":[0.19391505,0.00019205888,0.79069275,0.00021661991,0.0000495991,0.00034806837,0.0009204502,0.0046038907,0.009061489],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984478,0.00033796087,0.000177851,0.00020578533,0.00063035917,0.00020027281],"domain_scores_gemma":[0.9988432,0.0003735058,0.00010605366,0.00031305262,0.0002226896,0.00014149654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024896776,0.0005536914,0.00057136116,0.00046697466,0.0005642895,0.0020076947,0.0026706909,0.00078484917,0.002892092],"category_scores_gemma":[0.0027207795,0.000582476,0.0010088917,0.0003726965,0.0009351042,0.002107288,0.0019423336,0.001885874,0.001161697],"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.0015716044,0.00049382274,0.005928131,0.00074537704,0.0002463161,0.0015395968,0.0026990233,0.23808467,0.13353844,0.28023148,0.029005539,0.30591604],"study_design_scores_gemma":[0.00034642324,0.00026409718,0.00094665535,0.00009305405,0.00006822688,0.00026123525,0.00014481421,0.82047045,0.059921335,0.021461315,0.0959125,0.00010993669],"about_ca_topic_score_codex":0.0021122934,"about_ca_topic_score_gemma":0.0020013675,"teacher_disagreement_score":0.002892092,"about_ca_system_score_codex":0.0009259723,"about_ca_system_score_gemma":0.0017278593,"threshold_uncertainty_score":0.013166785},"labels":[],"label_agreement":null},{"id":"W2064889600","doi":"10.1002/cpe.1604","title":"Evolvable hardware design based on a novel simulated annealing in an embedded system","year":2010,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Fundamental Research Funds for the Central Universities","keywords":"Computer science; Evolvable hardware; Field-programmable gate array; Scalability; Simulated annealing; Digital electronics; Computer architecture; Electronic circuit; Embedded system; Circuit design; Gate array; Computer engineering; Algorithm; Electrical engineering","score_opus":0.03562519764943902,"score_gpt":0.3304635492285391,"score_spread":0.2948383515791001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064889600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14696427,0.00018791799,0.84348065,0.00018956786,0.000046343426,0.00008580291,0.000025303087,0.0007372887,0.008282819],"genre_scores_gemma":[0.8369179,0.00006680512,0.16015561,0.00004099855,0.000006753232,0.00011170929,0.000027560058,0.000036163845,0.0026364375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998574,0.000038603554,0.0000075313596,0.000031318028,0.000048056918,0.000017130224],"domain_scores_gemma":[0.99986684,0.000043094005,0.00001896602,0.00002629392,0.000033129036,0.000011689585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023436431,0.00027929933,0.00029995618,0.00024562367,0.00032074627,0.00040271683,0.00056149485,0.00042297074,0.0015178632],"category_scores_gemma":[0.0004237591,0.00016993737,0.00041006145,0.00016055377,0.00041784858,0.00025430208,0.00039404788,0.00034695645,0.00016289446],"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.000051571707,0.00003854021,0.0006484292,0.00004558446,0.00003335991,0.00014074733,0.00009409258,0.91805375,0.03326105,0.017003497,0.00036231772,0.03026702],"study_design_scores_gemma":[0.000007365658,0.000039148923,0.00011563536,0.0000024185,0.0000069724074,0.000021466125,0.000004139671,0.99519604,0.0025215282,0.001273723,0.00080803595,0.0000034781026],"about_ca_topic_score_codex":0.0014105908,"about_ca_topic_score_gemma":0.0010986228,"teacher_disagreement_score":0.0015178632,"about_ca_system_score_codex":0.00042193837,"about_ca_system_score_gemma":0.00044412754,"threshold_uncertainty_score":0.0050777793},"labels":[],"label_agreement":null},{"id":"W2064935713","doi":"10.1002/cpe.1490","title":"Finding order in chaos: a behavior model of the whole grid","year":2009,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Grid computing; Grid; Distributed computing; Abstraction; Semantic grid; Set (abstract data type); Resource (disambiguation); DRMAA; Scale (ratio); Resource management (computing); Task (project management); Resource allocation; Key (lock); Data science; Artificial intelligence; Systems engineering; Computer security","score_opus":0.03670460165765702,"score_gpt":0.32736384905893895,"score_spread":0.2906592474012819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064935713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27329972,0.00040547806,0.6782413,0.0020216946,0.00007786165,0.00011215929,0.00023947515,0.0006105577,0.044991754],"genre_scores_gemma":[0.9707729,0.00021652514,0.024372289,0.00007836802,0.000025098881,0.00007565463,0.00007969747,0.000062378145,0.0043169884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997652,0.00008557162,0.00000982926,0.000044362354,0.000063624546,0.00003137882],"domain_scores_gemma":[0.9995672,0.00017287678,0.00007383232,0.00006305555,0.00006905506,0.000053897198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003734674,0.00030470625,0.00039180042,0.00058779644,0.0005896085,0.0012967774,0.000663371,0.00072746404,0.0024766817],"category_scores_gemma":[0.0012718587,0.00015085826,0.0006536031,0.00040050055,0.0016042839,0.0014136941,0.0011855186,0.0006688005,0.00031334418],"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.00004742853,0.000037573554,0.0039057895,0.00005288513,0.00004369392,0.00038298883,0.0008337828,0.6021901,0.0037475238,0.37931922,0.0014394703,0.007999587],"study_design_scores_gemma":[0.000007867504,0.000020471936,0.00027954654,0.0000070811084,0.00000777962,0.00003829822,0.00011844604,0.9047498,0.0002661856,0.0930756,0.0014210909,0.0000077910545],"about_ca_topic_score_codex":0.00523791,"about_ca_topic_score_gemma":0.0016981976,"teacher_disagreement_score":0.00523791,"about_ca_system_score_codex":0.00076633255,"about_ca_system_score_gemma":0.00076000224,"threshold_uncertainty_score":0.010414839},"labels":[],"label_agreement":null},{"id":"W2065784804","doi":"10.1002/cpe.1155","title":"Mobility management in hybrid<i>ad‐hoc</i>networks and the Internet environment","year":2007,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer network; Handover; Mobility management; Computer science; Mobile IP; Mobile ad hoc network; Mobility model; Wireless ad hoc network; Packet loss; Network packet; Vehicular ad hoc network; The Internet; Distributed computing; Wireless; Telecommunications","score_opus":0.012117737677220743,"score_gpt":0.274452473220774,"score_spread":0.26233473554355324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065784804","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5032444,0.0039261635,0.47865888,0.0009322908,0.00019514993,0.00006767528,0.00006319066,0.00085788255,0.012054443],"genre_scores_gemma":[0.9848889,0.00041282634,0.013789531,0.000045415945,0.000024939247,0.000017158613,0.000027303688,0.000017352515,0.0007766586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972385,0.0001477052,0.000012153983,0.000031973876,0.000049183796,0.000035037687],"domain_scores_gemma":[0.999521,0.00025427446,0.0000825022,0.000049614206,0.000054987988,0.00003770014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070524256,0.00024292669,0.00019807386,0.0004118371,0.00032931182,0.0009841007,0.00048990216,0.00034063047,0.00046385694],"category_scores_gemma":[0.0011320927,0.00018087299,0.00016769383,0.0003259152,0.000677476,0.0011945713,0.0005566794,0.00024947478,0.0000884004],"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.0004857914,0.00013515243,0.013266123,0.0002109585,0.00018205056,0.0010302286,0.00070061017,0.6686086,0.041653927,0.12646216,0.0044348175,0.1428296],"study_design_scores_gemma":[0.00004827846,0.00022631987,0.002176614,0.0000287768,0.00006899339,0.00040277795,0.00026952894,0.9380176,0.0071230466,0.043614835,0.0079918485,0.00003132319],"about_ca_topic_score_codex":0.0013682696,"about_ca_topic_score_gemma":0.0009205898,"teacher_disagreement_score":0.0013682696,"about_ca_system_score_codex":0.0005064404,"about_ca_system_score_gemma":0.00022826737,"threshold_uncertainty_score":0.003729701},"labels":[],"label_agreement":null},{"id":"W2071906280","doi":"10.1002/cpe.663","title":"Providing soft real‐time quality of service guarantees for Java threads","year":2003,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Java; Operating system; Thread (computing); Quality of service; Scheduling (production processes); Virtual machine; Java concurrency; Overhead (engineering); Java applet; Distributed computing; Computer network","score_opus":0.051123579222311144,"score_gpt":0.35901710646179386,"score_spread":0.3078935272394827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071906280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32411796,0.0006314237,0.6549715,0.0003092802,0.00025974677,0.00013436,0.00008285467,0.013848835,0.005644045],"genre_scores_gemma":[0.9141123,0.00015296151,0.08151098,0.00012769582,0.00011061517,0.000101112484,0.00013528462,0.0009526457,0.0027963284],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974082,0.00064588507,0.00031771528,0.00030266627,0.0008818774,0.00044361278],"domain_scores_gemma":[0.9908387,0.0032082233,0.00121427,0.0022452646,0.0016518701,0.0008416812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043912916,0.00056815386,0.00068413164,0.00068871834,0.0006393608,0.0031046234,0.0020428046,0.00077170087,0.0018094822],"category_scores_gemma":[0.014069117,0.00065217353,0.00036352873,0.00036413834,0.0008064743,0.0023798463,0.0022436013,0.0012547259,0.00055480975],"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.0075720707,0.0009560995,0.03181898,0.000744046,0.0003367273,0.0010125232,0.0021102212,0.112761386,0.3044927,0.100203015,0.020190272,0.41780198],"study_design_scores_gemma":[0.00049509306,0.00033683202,0.0019132235,0.00004146387,0.00008847608,0.00018615881,0.000065776185,0.9159246,0.04652869,0.020502565,0.013853326,0.000063776424],"about_ca_topic_score_codex":0.0017746018,"about_ca_topic_score_gemma":0.0014791857,"teacher_disagreement_score":0.0043912916,"about_ca_system_score_codex":0.00069690443,"about_ca_system_score_gemma":0.0011230551,"threshold_uncertainty_score":0.023223698},"labels":[],"label_agreement":null},{"id":"W2083801760","doi":"10.1002/cpe.1708","title":"Dataflow detection and applications to workflow scheduling","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":15,"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 Alberta","funders":"","keywords":"Computer science; Dataflow; Workflow; Distributed computing; Correctness; Workflow technology; Workflow management system; Concurrency; Scheduling (production processes); Parallel computing; Database; Algorithm","score_opus":0.0492769611559476,"score_gpt":0.31917012780069354,"score_spread":0.26989316664474594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083801760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060996383,0.0005137158,0.9321271,0.0006857091,0.0001673774,0.00014340789,0.00027713916,0.0030048392,0.0020842983],"genre_scores_gemma":[0.6587689,0.00039153395,0.33876088,0.00009561766,0.00010411517,0.000100717094,0.00041175348,0.00013390217,0.0012325675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989562,0.00031577965,0.00008073129,0.00026268885,0.0002975763,0.00008695575],"domain_scores_gemma":[0.9902649,0.0061277077,0.0009811299,0.0007730009,0.0014999991,0.00035326977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022279986,0.00077272305,0.0005992825,0.002510833,0.0009727956,0.0016561167,0.001252555,0.00082077127,0.0016708068],"category_scores_gemma":[0.010210129,0.00045815366,0.0006980032,0.0019249024,0.001025828,0.0014084377,0.0011922477,0.0011319537,0.00024263131],"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.00042162408,0.00025272885,0.013469893,0.00021020585,0.0000703168,0.00046241388,0.0002943385,0.6547538,0.02184624,0.043749038,0.0036047345,0.2608647],"study_design_scores_gemma":[0.0000052622145,0.000014002788,0.0004424279,0.000008504395,0.0000045273146,0.000033090102,0.000016413094,0.9824127,0.0046396437,0.011220498,0.0011943065,0.000008614264],"about_ca_topic_score_codex":0.0058541885,"about_ca_topic_score_gemma":0.002877159,"teacher_disagreement_score":0.0058541885,"about_ca_system_score_codex":0.0018575718,"about_ca_system_score_gemma":0.0014351262,"threshold_uncertainty_score":0.013477743},"labels":[],"label_agreement":null},{"id":"W2096253463","doi":"10.1002/cpe.2805","title":"Automatic configuration generation for service high availability with load balancing","year":2012,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; High availability; Redundancy (engineering); Workload; Distributed computing; Task (project management); Service (business); Load balancing (electrical power); IT service continuity; Computer network; Operating system; Systems engineering; Engineering","score_opus":0.021792679424277307,"score_gpt":0.2919101270302058,"score_spread":0.2701174476059285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096253463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087645344,0.00019959298,0.8419332,0.00028307916,0.000114629736,0.0005312155,0.0004638552,0.06065187,0.0081772],"genre_scores_gemma":[0.5516343,0.00010934833,0.4403131,0.000115224655,0.000044592336,0.00034048018,0.0015551585,0.0033823578,0.002505419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976265,0.0008306265,0.00017409783,0.00040344935,0.000767584,0.00019774],"domain_scores_gemma":[0.99487394,0.0022827715,0.00043995716,0.0014066617,0.0008034022,0.00019326285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019873192,0.0012959167,0.0007688078,0.0019786253,0.0010620225,0.0014646817,0.0014986484,0.00073697895,0.0059017097],"category_scores_gemma":[0.009421895,0.0006225345,0.000648145,0.0012315224,0.0007392467,0.0012075152,0.0013505509,0.0008745077,0.0018191419],"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.0010486033,0.0003821977,0.006736518,0.0005389404,0.00011586712,0.0015081321,0.0011322653,0.21832642,0.06033179,0.01624826,0.026718767,0.6669122],"study_design_scores_gemma":[0.000101145364,0.00009698896,0.0010447899,0.000047574627,0.00003880759,0.00033977607,0.00018068912,0.93234074,0.039585043,0.0133485915,0.012813353,0.00006241258],"about_ca_topic_score_codex":0.0017875395,"about_ca_topic_score_gemma":0.0023638625,"teacher_disagreement_score":0.0059017097,"about_ca_system_score_codex":0.00080150715,"about_ca_system_score_gemma":0.0009974921,"threshold_uncertainty_score":0.019743264},"labels":[],"label_agreement":null},{"id":"W2102472666","doi":"10.1002/cpe.697","title":"Efficient communication using message prediction for clusters of multiprocessors","year":2002,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Uniprocessor system; Computer science; Message passing; Overhead (engineering); Cache; User space; Multiprocessing; Message broker; Computer network; Locality; Copying; Parallel computing; Distributed computing; Operating system","score_opus":0.046672020603157484,"score_gpt":0.33415638955241295,"score_spread":0.28748436894925544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102472666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5845626,0.0010904918,0.40398017,0.00047207696,0.00015820093,0.0001512704,0.0001364481,0.0072173406,0.0022314002],"genre_scores_gemma":[0.9349601,0.00012693876,0.063200116,0.000036701622,0.000035439763,0.000053879918,0.00014996089,0.00005934834,0.0013774736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995427,0.00013951864,0.000028490434,0.00007949419,0.00013822565,0.00007159579],"domain_scores_gemma":[0.9974833,0.0010971075,0.00035929587,0.00041750635,0.00050446397,0.0001383928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000659785,0.0005643457,0.0004887424,0.00066620717,0.00058548077,0.00047648678,0.00087451603,0.00042229707,0.00083216827],"category_scores_gemma":[0.0023798316,0.00025417143,0.00017696267,0.000781997,0.00036123773,0.000767476,0.00060205994,0.0006848821,0.00027337897],"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.0013477448,0.00033950727,0.012835319,0.00020925334,0.000054917313,0.00026195086,0.0002414443,0.71796733,0.056623604,0.0046815225,0.0041622496,0.20127518],"study_design_scores_gemma":[0.000013232945,0.00013566024,0.00063058344,0.000004679129,0.000008195681,0.00001520222,0.000017963674,0.98449033,0.01307372,0.0009111374,0.0006911636,0.000008096198],"about_ca_topic_score_codex":0.0036038854,"about_ca_topic_score_gemma":0.0036794578,"teacher_disagreement_score":0.0036038854,"about_ca_system_score_codex":0.00068997935,"about_ca_system_score_gemma":0.00097539823,"threshold_uncertainty_score":0.0071657896},"labels":[],"label_agreement":null},{"id":"W2105487310","doi":"10.1002/cpe.700","title":"Parallel computation on interval graphs: algorithms and experiments","year":2002,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Myrinet; Clique; Parallel computing; Interval (graph theory); Algorithm; Parallel algorithm; Interval graph; Interconnection; Computation; Graph; Implementation; Theoretical computer science; Mathematics; Chordal graph; Message passing; Combinatorics","score_opus":0.06738285749543127,"score_gpt":0.34179044454621843,"score_spread":0.27440758705078716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105487310","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9031242,0.0010975176,0.06720021,0.0006563131,0.00017842575,0.0004320344,0.0014426316,0.004963721,0.020905044],"genre_scores_gemma":[0.90829563,0.00044925438,0.087780185,0.00008335298,0.00003572247,0.00024870274,0.0012903949,0.00027707036,0.0015396152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740463,0.0010257708,0.00018381745,0.00041216137,0.00066400034,0.00030957832],"domain_scores_gemma":[0.9883553,0.0074556875,0.00042398056,0.002315757,0.0010575312,0.0003916888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002618508,0.000938979,0.00095822517,0.0009708678,0.0009704303,0.0008696848,0.0019656182,0.0009423366,0.004581391],"category_scores_gemma":[0.009860748,0.00039876084,0.0005419561,0.003482087,0.0010207731,0.0018610131,0.0012613408,0.0012844574,0.0006151722],"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.0033466872,0.00251566,0.0035411073,0.00066729344,0.00018824298,0.0002710802,0.00043382906,0.819559,0.009603524,0.018808194,0.013234158,0.12783132],"study_design_scores_gemma":[0.00062189315,0.0004790687,0.0010470485,0.00001837914,0.000035048928,0.000066884815,0.00015040762,0.97401345,0.008956531,0.011705885,0.00288402,0.000021295424],"about_ca_topic_score_codex":0.0057564084,"about_ca_topic_score_gemma":0.0024091525,"teacher_disagreement_score":0.0057564084,"about_ca_system_score_codex":0.0011779212,"about_ca_system_score_gemma":0.0010416717,"threshold_uncertainty_score":0.0153262615},"labels":[],"label_agreement":null},{"id":"W2110536119","doi":"10.1002/cpe.555","title":"Algorithmic support for model transformation in object‐oriented software development","year":2001,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"National Research Council Canada; Bell Canada Enterprises; Austrian Science Fund","keywords":"Computer science; Unified Modeling Language; Notation; Scope (computer science); Software development; Model transformation; Software engineering; Programming language; Class diagram; Development (topology); Software development process; Process (computing); Software; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.05038449588205751,"score_gpt":0.3549345415986086,"score_spread":0.3045500457165511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110536119","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003118457,0.000027068132,0.99496907,0.000094518975,0.00000816541,0.00006858979,0.000007949315,0.00072835595,0.0009778762],"genre_scores_gemma":[0.055589806,0.00006505238,0.9431592,0.000041162406,0.000012307184,0.00020122586,0.00011316753,0.000137839,0.00068017637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936845,0.0034277418,0.0005972742,0.00043193324,0.0016069793,0.00025162625],"domain_scores_gemma":[0.9759591,0.0177518,0.0010423422,0.002848775,0.0021624726,0.00023545802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053811623,0.00077953906,0.0006203339,0.0015772524,0.00109589,0.003088303,0.0019656077,0.0015438396,0.0036753295],"category_scores_gemma":[0.032543916,0.00077104813,0.00106249,0.0016313158,0.0017378167,0.0028410167,0.0043870346,0.0016210042,0.0010908435],"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.00021892649,0.00031668125,0.0028155001,0.00039770498,0.000077418765,0.00034246666,0.0007715251,0.23533835,0.0065815896,0.30645508,0.0031365473,0.4435483],"study_design_scores_gemma":[0.00010007833,0.00006104279,0.00016150122,0.0000977589,0.000030488824,0.00018582755,0.00011061297,0.8459135,0.0057717706,0.13694592,0.010602868,0.000018685141],"about_ca_topic_score_codex":0.0011638497,"about_ca_topic_score_gemma":0.0013696887,"teacher_disagreement_score":0.0053811623,"about_ca_system_score_codex":0.0009641947,"about_ca_system_score_gemma":0.0017464112,"threshold_uncertainty_score":0.028458655},"labels":[],"label_agreement":null},{"id":"W2113863982","doi":"10.1002/cpe.3659","title":"Dekker's mutual exclusion algorithm made RW‐safe","year":2015,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Thread (computing); Mutual exclusion; Correctness; Algorithm; Computer science; Tournament; Parallel computing; Mathematics; Theoretical computer science; Operating system; Combinatorics","score_opus":0.03383703133070081,"score_gpt":0.32511015342923744,"score_spread":0.2912731220985366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113863982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1462864,0.000115673836,0.8354575,0.0004290527,0.00021835578,0.00021395969,0.00009678535,0.002416252,0.014765971],"genre_scores_gemma":[0.6233167,0.00006442648,0.3629745,0.00015715163,0.00003373056,0.00016724573,0.00024161625,0.00032069863,0.012723944],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866784,0.00023432114,0.00013958369,0.00025815968,0.00040208327,0.0002981056],"domain_scores_gemma":[0.9976037,0.00083515653,0.00020299183,0.000673824,0.0005567588,0.00012749812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014137009,0.0004944088,0.0006992755,0.0004688547,0.001206746,0.001278945,0.0015408171,0.0008907226,0.0042440873],"category_scores_gemma":[0.005474781,0.00026875763,0.00061168266,0.00036248172,0.00081377244,0.0012783982,0.0016741123,0.0010904528,0.0010271275],"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.001608043,0.00032950987,0.0042997445,0.00023478238,0.00011574509,0.00039925068,0.0008719946,0.23113917,0.053746644,0.19664456,0.009722483,0.500888],"study_design_scores_gemma":[0.00021681689,0.00026091875,0.0007794149,0.000032225904,0.000048033908,0.00027643266,0.000116578616,0.87775815,0.046563305,0.057436645,0.016453752,0.000057749632],"about_ca_topic_score_codex":0.0026562524,"about_ca_topic_score_gemma":0.002535192,"teacher_disagreement_score":0.0042440873,"about_ca_system_score_codex":0.0007789347,"about_ca_system_score_gemma":0.0022005308,"threshold_uncertainty_score":0.014197886},"labels":[],"label_agreement":null},{"id":"W2115933156","doi":"10.1002/cpe.3344","title":"Exploration/exploitation of a hybrid‐enhanced MPSO‐GA algorithm on a fused CPU‐GPU architecture","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crossover; Computer science; Metaheuristic; Algorithm; Central processing unit; Particle swarm optimization; Genetic algorithm; Parallel computing; Population; Local search (optimization); Artificial intelligence; Machine learning","score_opus":0.0282447798811836,"score_gpt":0.3269880132541699,"score_spread":0.29874323337298625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115933156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59668005,0.00042995586,0.380044,0.00041432178,0.000114209695,0.00007832872,0.000058660742,0.0011579585,0.021022502],"genre_scores_gemma":[0.8794255,0.00006105135,0.117293864,0.000052727268,0.000011140916,0.000048692997,0.000048790145,0.000041013936,0.0030171324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990034,0.000023062516,0.0000042212464,0.000017676017,0.00003269836,0.000022066846],"domain_scores_gemma":[0.9998611,0.000046895577,0.000012782678,0.000020917569,0.00003683952,0.000021483407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002854096,0.00038825203,0.0004398733,0.00027652094,0.00026620514,0.00046724983,0.00067123974,0.00059142534,0.0011928674],"category_scores_gemma":[0.00044380315,0.00020078177,0.00040355965,0.00023029758,0.0004537239,0.00024443268,0.0005657681,0.00037345706,0.00017651844],"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.00009982661,0.00003845936,0.00059938536,0.000025360809,0.00003142196,0.00013159079,0.000041857747,0.96135724,0.009986151,0.003193137,0.00053256424,0.023963014],"study_design_scores_gemma":[0.00000836959,0.000017312303,0.000075436525,0.0000015302338,0.000003727346,0.000009248527,0.0000045406055,0.99866295,0.0005821422,0.00041494027,0.00021785585,0.0000018845762],"about_ca_topic_score_codex":0.004925099,"about_ca_topic_score_gemma":0.003737621,"teacher_disagreement_score":0.004925099,"about_ca_system_score_codex":0.00045328552,"about_ca_system_score_gemma":0.00072575023,"threshold_uncertainty_score":0.009792864},"labels":[],"label_agreement":null},{"id":"W2123122082","doi":"10.1002/cpe.753","title":"A performance study of job management systems","year":2004,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Connaught Fund; University of Toronto","keywords":"Schedule; Job scheduler; Computer science; Grid; Grid computing; Strengths and weaknesses; Distributed computing; Supercomputer; Software; Domain (mathematical analysis); Component (thermodynamics); Empirical research; Operating system; Cloud computing","score_opus":0.024575815141549013,"score_gpt":0.30426573919789773,"score_spread":0.27968992405634874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123122082","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9842002,0.0012590842,0.0062580085,0.00031813842,0.00008756971,0.00012974426,0.00046740958,0.00039088688,0.0068888958],"genre_scores_gemma":[0.9954358,0.00013180489,0.0034193194,0.000017843635,0.00003071576,0.000039092643,0.00040849185,0.00003464338,0.00048239774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992469,0.0029745598,0.00052564545,0.00073923584,0.0024981555,0.000793388],"domain_scores_gemma":[0.9575327,0.026575815,0.0031621396,0.0023522994,0.008500437,0.0018767146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007436083,0.0006155889,0.0005959319,0.0022994615,0.0011546,0.0017186931,0.0010005516,0.00048084874,0.001583611],"category_scores_gemma":[0.02622165,0.00026411418,0.00033466026,0.0028600309,0.00072833046,0.0012292068,0.0007207206,0.0006730507,0.00032854604],"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.009024491,0.0026213534,0.24984337,0.0022387083,0.00054194755,0.0011319241,0.0031068854,0.35358083,0.044308506,0.0250465,0.02148411,0.28707135],"study_design_scores_gemma":[0.00029115792,0.004280712,0.13504764,0.000117657844,0.00015919651,0.00072826876,0.0019699556,0.8061244,0.032705694,0.0058686286,0.012586897,0.000119814926],"about_ca_topic_score_codex":0.0053525493,"about_ca_topic_score_gemma":0.0021674898,"teacher_disagreement_score":0.007436083,"about_ca_system_score_codex":0.0021155241,"about_ca_system_score_gemma":0.0014069363,"threshold_uncertainty_score":0.03932625},"labels":[],"label_agreement":null},{"id":"W2125132187","doi":"10.1002/cpe.1543","title":"In search of simplicity: a self‐organizing group communication overlay","year":2009,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"PlanetLab; Computer science; Testbed; Distributed computing; Overlay network; Node (physics); Overlay; Communication in small groups; Overhead (engineering); Simplicity; Computer network; Simple (philosophy); The Internet; World Wide Web","score_opus":0.02199167398356057,"score_gpt":0.33153495658569965,"score_spread":0.3095432826021391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125132187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32725912,0.0004853951,0.65396565,0.001357338,0.00013699061,0.00023625245,0.00006478042,0.0019493377,0.014545221],"genre_scores_gemma":[0.8662895,0.00014998559,0.12969862,0.00010917982,0.00005410553,0.000062301464,0.00007840989,0.00006370401,0.003494127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993511,0.0002350255,0.000031751537,0.00008309312,0.00024383307,0.000055096632],"domain_scores_gemma":[0.9982015,0.00042517376,0.00021629008,0.00063686783,0.00028097234,0.00023911512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010649201,0.00020032647,0.00037784284,0.00063231826,0.0008786421,0.0013028925,0.0008013761,0.000614025,0.0009918668],"category_scores_gemma":[0.0032441171,0.00022083007,0.00018877603,0.0004986155,0.0008451331,0.0016811338,0.0024661382,0.0005452101,0.0003061021],"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.00087454636,0.00038406896,0.0094346395,0.00046545573,0.00014991309,0.0011499285,0.0044058193,0.20563324,0.17832726,0.20662865,0.013346251,0.37920028],"study_design_scores_gemma":[0.0001710782,0.0005920003,0.0039048886,0.000056256846,0.00012387316,0.0007671801,0.00067332684,0.8227578,0.02741956,0.075539,0.06790844,0.00008660219],"about_ca_topic_score_codex":0.00093223085,"about_ca_topic_score_gemma":0.0009881661,"teacher_disagreement_score":0.0013028925,"about_ca_system_score_codex":0.0004507388,"about_ca_system_score_gemma":0.0005675777,"threshold_uncertainty_score":0.0056319237},"labels":[],"label_agreement":null},{"id":"W2127110276","doi":"10.1002/cpe.3026","title":"Accelerating R‐based analytics on the cloud","year":2013,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cloud computing; Programmer; Scalability; Analytics; Workstation; Set (abstract data type); Software","score_opus":0.0458330124625139,"score_gpt":0.3056046564191353,"score_spread":0.2597716439566214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127110276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11850126,0.0006785572,0.8184843,0.0024875214,0.00030744704,0.00044001633,0.0005763472,0.026720138,0.031804387],"genre_scores_gemma":[0.5255467,0.00050797046,0.46695027,0.00040093187,0.00015638073,0.00015936534,0.00081995176,0.0010845589,0.0043738536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997894,0.0004960972,0.00009708273,0.00042989827,0.0007424262,0.00034060836],"domain_scores_gemma":[0.9943843,0.0015145444,0.00041066293,0.0020619421,0.001281766,0.00034677092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002153082,0.0008749723,0.0007570703,0.00083844346,0.0006475103,0.002172424,0.0017436608,0.0004896412,0.0053866263],"category_scores_gemma":[0.0055569797,0.00043092275,0.0007171449,0.0010445745,0.0008982196,0.0020872273,0.002411792,0.0012000313,0.0029715227],"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.0016617143,0.0006468294,0.012410862,0.0004836985,0.00024139276,0.0015058322,0.0006321099,0.3951285,0.08599556,0.085329436,0.0595651,0.35639894],"study_design_scores_gemma":[0.00012959396,0.0001330964,0.0016161378,0.000033010125,0.00003827171,0.00013903296,0.00012900344,0.93497086,0.019736288,0.021026067,0.022000706,0.00004785703],"about_ca_topic_score_codex":0.0086327195,"about_ca_topic_score_gemma":0.0040450585,"teacher_disagreement_score":0.0086327195,"about_ca_system_score_codex":0.00092642143,"about_ca_system_score_gemma":0.0029102904,"threshold_uncertainty_score":0.018020034},"labels":[],"label_agreement":null},{"id":"W2128276860","doi":"10.1002/cpe.3492","title":"Sparse support vector machine for pattern recognition","year":2015,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Support vector machine; Pattern recognition (psychology); Outlier; Artificial intelligence; Computer science; Sparse approximation; Norm (philosophy); Ranking SVM; Structured support vector machine; Representation (politics); Machine learning","score_opus":0.07136342235487081,"score_gpt":0.32623165268705695,"score_spread":0.25486823033218614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128276860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031261859,0.008980952,0.9794796,0.0014439313,0.0003778292,0.000075706565,0.00049303315,0.001747007,0.004275729],"genre_scores_gemma":[0.26098204,0.015849171,0.7023733,0.00084139104,0.0018843281,0.00045022715,0.0032571298,0.00029294117,0.014069452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985441,0.0004351377,0.00012604927,0.00032084616,0.00050593296,0.00006802714],"domain_scores_gemma":[0.99794716,0.0009785577,0.00023280982,0.00030052217,0.00048694827,0.000054064873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011250001,0.00087344804,0.0011621164,0.0016260791,0.00027154112,0.0015483585,0.0010672377,0.0012139353,0.0076017464],"category_scores_gemma":[0.0062679597,0.00026688696,0.00073773885,0.0027562748,0.00073927204,0.0013051964,0.000985844,0.0018650416,0.004774749],"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.000096226504,0.00005718968,0.0009339513,0.0006907086,0.00011960208,0.00018138377,0.00007957709,0.073567174,0.0065455404,0.059563972,0.030942941,0.8272217],"study_design_scores_gemma":[0.000015514785,0.00007576016,0.0007806008,0.00014879604,0.000030818894,0.00020902678,0.00004905931,0.837152,0.003066973,0.11003375,0.048398342,0.00003945633],"about_ca_topic_score_codex":0.0014177117,"about_ca_topic_score_gemma":0.00087601086,"teacher_disagreement_score":0.0076017464,"about_ca_system_score_codex":0.00053649035,"about_ca_system_score_gemma":0.0006898939,"threshold_uncertainty_score":0.025430322},"labels":[],"label_agreement":null},{"id":"W2128754884","doi":"10.1002/cpe.1065","title":"A methodology for early validation of cache coherence protocols based on relational databases","year":2006,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Correctness; Cache coherence; Protocol (science); Relational database; Table (database); Database; Cache; Relational algebra; Multiprocessing; Programming language; Theoretical computer science; Cache algorithms; CPU cache; Parallel computing","score_opus":0.22308943891776134,"score_gpt":0.45130836044949973,"score_spread":0.2282189215317384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128754884","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032998705,0.00007534398,0.9948264,0.00007924225,0.000015726062,0.00015035,0.0000343199,0.0011019164,0.0004168983],"genre_scores_gemma":[0.14467388,0.00016925625,0.8528836,0.00012071526,0.000028408589,0.0003603449,0.00021627426,0.00034300293,0.0012045612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9789969,0.00896518,0.0018675003,0.0020456454,0.007346843,0.0007779822],"domain_scores_gemma":[0.9667351,0.016063506,0.0022172628,0.009066759,0.005553764,0.00036363487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016700272,0.0007802366,0.0009399112,0.0019555963,0.0010019743,0.004989014,0.0045376453,0.0016102922,0.0025736147],"category_scores_gemma":[0.03379002,0.0013494156,0.0018756015,0.00085677614,0.0033708261,0.005534204,0.0034295109,0.0028301978,0.00081864867],"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.00031775335,0.0002596761,0.0027985866,0.00067657535,0.00024925813,0.0011002946,0.001956821,0.098673105,0.04003146,0.6685079,0.002149668,0.18327892],"study_design_scores_gemma":[0.00018915244,0.00032854205,0.0005103659,0.00030027423,0.00021992177,0.0008065061,0.00029614771,0.67609835,0.10941981,0.17327902,0.038398277,0.00015365289],"about_ca_topic_score_codex":0.0023708774,"about_ca_topic_score_gemma":0.0014198661,"teacher_disagreement_score":0.016700272,"about_ca_system_score_codex":0.0017267993,"about_ca_system_score_gemma":0.0036178967,"threshold_uncertainty_score":0.08832049},"labels":[],"label_agreement":null},{"id":"W2129533806","doi":"10.1002/cpe.3167","title":"Fine‐grained filtering to provide access control for data providing services within collaborative environments","year":2013,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Access Control and Trust","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Lawson Health Research Institute; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Ontology; Access control; Markup language; World Wide Web; Data access; Service (business); Domain (mathematical analysis); Database; XML; Computer security","score_opus":0.04904822203669841,"score_gpt":0.3922229103901211,"score_spread":0.3431746883534227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129533806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029094433,0.000121510544,0.96284986,0.0008623454,0.000044433807,0.000295197,0.00006632637,0.0019450488,0.004720858],"genre_scores_gemma":[0.51078665,0.00018654596,0.48295882,0.0003893046,0.00005310732,0.00025412263,0.0002602862,0.0002524971,0.0048586605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9885428,0.0037407605,0.0019118794,0.0014644132,0.0031497432,0.001190421],"domain_scores_gemma":[0.9800961,0.006166359,0.0014430347,0.008741099,0.0027430947,0.00081035856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018312143,0.0005347836,0.00076088595,0.0023759368,0.0024375082,0.006175708,0.0019385768,0.0016999778,0.0022180553],"category_scores_gemma":[0.01661064,0.00059008016,0.0015550508,0.0014976085,0.0038854158,0.008720292,0.0053200293,0.002360817,0.00071086205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031220564,0.00045488405,0.009442167,0.00039739744,0.00016907988,0.0007900223,0.010635875,0.02722694,0.040674143,0.7034312,0.0057662036,0.20069994],"study_design_scores_gemma":[0.000118495744,0.00024747138,0.0043639652,0.00037424016,0.00020890754,0.001030196,0.002716862,0.3260059,0.06572617,0.42091468,0.17798956,0.0003036206],"about_ca_topic_score_codex":0.014143707,"about_ca_topic_score_gemma":0.008866694,"teacher_disagreement_score":0.018312143,"about_ca_system_score_codex":0.002957526,"about_ca_system_score_gemma":0.004210185,"threshold_uncertainty_score":0.09684503},"labels":[],"label_agreement":null},{"id":"W2134014163","doi":"10.1002/cpe.3336","title":"Optical crossbars on chip, a comparative study based on worst‐case losses","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Photonic and Optical Devices","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Polytechnique Montréal","funders":"","keywords":"Crossbar switch; Computer science; Scalability; Implementation; Bandwidth (computing); Multiplexing; Interconnection; Computer network; Key (lock); Computer architecture; Chip; Optical interconnect; Routing (electronic design automation); Parallel computing; Telecommunications; Operating system","score_opus":0.03157281593020538,"score_gpt":0.34099855574960986,"score_spread":0.30942573981940447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134014163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92946434,0.0047779446,0.04703608,0.0002993953,0.00018044976,0.000077473145,0.00041618684,0.00077846757,0.016969552],"genre_scores_gemma":[0.9917241,0.00050128065,0.0056553683,0.000032251075,0.000047952788,0.000030255793,0.0002211216,0.00007256299,0.0017150198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9968766,0.00077371317,0.00013315454,0.00041722556,0.0011518704,0.00064745394],"domain_scores_gemma":[0.9885866,0.0064867036,0.0012089943,0.0010630739,0.002434915,0.00021969297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031235549,0.0009554592,0.0006533219,0.0020233074,0.0006134123,0.0016453493,0.0014062345,0.0006529245,0.0029736778],"category_scores_gemma":[0.0058014127,0.0002915115,0.0005128234,0.0018891889,0.0005768874,0.0025300954,0.00058540405,0.00044495135,0.00042066223],"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.0020882518,0.0003623624,0.011969084,0.0005885156,0.00041470473,0.0004863041,0.00018349627,0.8282572,0.027165603,0.010166834,0.005711228,0.11260645],"study_design_scores_gemma":[0.00007110574,0.002883726,0.009685456,0.00009129922,0.00032498478,0.0012921559,0.0003834879,0.92371655,0.0476015,0.006070968,0.0077897627,0.00008904549],"about_ca_topic_score_codex":0.0008849925,"about_ca_topic_score_gemma":0.0010157577,"teacher_disagreement_score":0.0031235549,"about_ca_system_score_codex":0.0015339917,"about_ca_system_score_gemma":0.00040960728,"threshold_uncertainty_score":0.01651913},"labels":[],"label_agreement":null},{"id":"W2134167127","doi":"10.1002/cpe.756","title":"RF‐MVTC: an efficient risk‐free multiversion concurrency control algorithm","year":2004,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Optimistic concurrency control; Concurrency control; Database transaction; Concurrency; Focus (optics); Distributed computing; Workstation; Serializability; Transaction processing; Transaction data; Algorithm; Distributed transaction; Distributed concurrency control; Database; Operating system","score_opus":0.011562038446103748,"score_gpt":0.2916600820033734,"score_spread":0.28009804355726964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134167127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010815535,0.00007864264,0.98630863,0.000112325004,0.00003539756,0.000070267604,0.000028640785,0.001472785,0.0010777419],"genre_scores_gemma":[0.29703516,0.000047201494,0.7002592,0.00010988281,0.00003617263,0.00019308203,0.00014344149,0.00020537779,0.0019704849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819714,0.0004033571,0.0001367993,0.0003403475,0.0007176956,0.00020465076],"domain_scores_gemma":[0.99673766,0.0013330376,0.00029604175,0.0008140563,0.000659446,0.00015966373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025778606,0.00070915325,0.0009663113,0.0009964112,0.00067499257,0.0012637561,0.003086684,0.0012950912,0.0035867128],"category_scores_gemma":[0.007648019,0.0004365258,0.00066012406,0.000819125,0.0010855859,0.001761297,0.0024226164,0.0014500252,0.00073680055],"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.0005482157,0.0001398436,0.0010930848,0.00009281992,0.000059839207,0.0001323673,0.00017763994,0.59339076,0.007813005,0.0439714,0.0034178225,0.34916326],"study_design_scores_gemma":[0.0000551689,0.00002947776,0.000034333836,0.0000043132573,0.000005489025,0.000025408848,0.0000073464307,0.9897049,0.0015914947,0.007751261,0.00078310573,0.000007693649],"about_ca_topic_score_codex":0.006101005,"about_ca_topic_score_gemma":0.0035768833,"teacher_disagreement_score":0.006101005,"about_ca_system_score_codex":0.0010720509,"about_ca_system_score_gemma":0.0024952546,"threshold_uncertainty_score":0.013633192},"labels":[],"label_agreement":null},{"id":"W2136664366","doi":"10.1002/cpe.3439","title":"Distributed wikis: a survey","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Viewpoints; Computer science; World Wide Web; Context (archaeology); Data science; Peer-to-peer; Collaborative editing; Scheme (mathematics); Knowledge management","score_opus":0.026882371793692638,"score_gpt":0.3181151629785834,"score_spread":0.29123279118489076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136664366","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035426944,0.71256715,0.12567616,0.0051298933,0.0019182148,0.00046447836,0.0017475069,0.0038765916,0.113193065],"genre_scores_gemma":[0.15789764,0.7266636,0.07854932,0.0012330615,0.0019196067,0.0004731667,0.006594531,0.0011042577,0.025564872],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971886,0.000587058,0.00035451158,0.00048409821,0.0011434812,0.00024229125],"domain_scores_gemma":[0.990122,0.0055421833,0.0006766629,0.00091157376,0.0020742745,0.0006731926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002667873,0.00081403926,0.0011538981,0.011431215,0.0010498025,0.0040049357,0.0018716039,0.0010012033,0.003909353],"category_scores_gemma":[0.0086258175,0.0007146999,0.000548583,0.017652458,0.0008883182,0.0103823645,0.0024872795,0.0015635563,0.00243044],"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.00006974866,0.00015746446,0.0033400923,0.0052577984,0.000058505557,0.00014511854,0.00087691116,0.001981671,0.0009817096,0.0340502,0.048568342,0.9045124],"study_design_scores_gemma":[0.000017045164,0.00008924412,0.004834578,0.0017255186,0.000049911203,0.0012971007,0.0011802118,0.0051841047,0.0018897259,0.017137805,0.9665424,0.000052358795],"about_ca_topic_score_codex":0.002028027,"about_ca_topic_score_gemma":0.0015071493,"teacher_disagreement_score":0.011431215,"about_ca_system_score_codex":0.0014171725,"about_ca_system_score_gemma":0.0019942315,"threshold_uncertainty_score":0.014109254},"labels":[],"label_agreement":null},{"id":"W2138797883","doi":"10.1002/cpe.1803","title":"Evaluating frame structure design in WiMAX relay networks","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"WiMAX; Frame (networking); Computer science; Frame Relay; Quality of service; Exploit; Throughput; Computer network; Relay; Telecommunications; Computer security; Wireless","score_opus":0.15174550562033925,"score_gpt":0.3940731619490897,"score_spread":0.24232765632875045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138797883","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9471409,0.001714966,0.045744814,0.0001481147,0.000077669974,0.00017811502,0.00012458077,0.00021989488,0.0046509057],"genre_scores_gemma":[0.9857275,0.00027252958,0.013436052,0.000016679502,0.00001739469,0.000036423146,0.000069533584,0.000018475153,0.00040554116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971866,0.0017926903,0.00010908285,0.000149908,0.0005307143,0.00023094162],"domain_scores_gemma":[0.9844701,0.012011809,0.0009209188,0.00065082184,0.0017104815,0.00023586472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046963925,0.0006831084,0.00053376437,0.0009594872,0.00047304423,0.0010025669,0.00071015244,0.00056822645,0.0011179721],"category_scores_gemma":[0.016831283,0.00022225059,0.00025531076,0.0005860396,0.00052477315,0.0011204361,0.0004954616,0.00040314533,0.00015683065],"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.003614173,0.00038916655,0.00849097,0.00038572654,0.00012291862,0.00017839242,0.00018646469,0.8529393,0.03752186,0.0085172895,0.0007328014,0.08692096],"study_design_scores_gemma":[0.0002697052,0.0043119118,0.004902293,0.00006841832,0.0002419384,0.00016764528,0.00020734505,0.9218185,0.062816,0.002763898,0.0023686076,0.000063755186],"about_ca_topic_score_codex":0.0029507957,"about_ca_topic_score_gemma":0.0027660604,"teacher_disagreement_score":0.0046963925,"about_ca_system_score_codex":0.0019845418,"about_ca_system_score_gemma":0.0006155807,"threshold_uncertainty_score":0.024837255},"labels":[],"label_agreement":null},{"id":"W2139846963","doi":"10.1002/cpe.1660","title":"Special issue on Computational Science and Its Applications","year":2010,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Grid computing; Context (archaeology); Data science; Grid; Cloud computing; Semantic grid; Scalability; Distributed computing; Visualization; Middleware (distributed applications); Graphics; World Wide Web; Database; Artificial intelligence","score_opus":0.019275132998766518,"score_gpt":0.328533067666696,"score_spread":0.30925793466792945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139846963","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000540516,0.04252336,0.0054112775,0.028949162,0.7604434,0.0006232159,0.0017844975,0.0011752612,0.15854934],"genre_scores_gemma":[0.0033425174,0.04182012,0.0028268183,0.012163322,0.7369877,0.00046340187,0.00387598,0.0016333944,0.19688667],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99258786,0.00100553,0.00072785915,0.0013265245,0.0037658736,0.00058640324],"domain_scores_gemma":[0.9854697,0.0045959083,0.0008290263,0.0015938121,0.005084471,0.0024269845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004450534,0.003161947,0.004444557,0.006605723,0.0026342347,0.010866664,0.0037162157,0.005788986,0.21687016],"category_scores_gemma":[0.013828263,0.00088948774,0.0030854018,0.0055145514,0.001484593,0.006682924,0.00388501,0.0074929283,0.11985777],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022850414,0.000027727981,0.00008162378,0.0003253142,0.000017251901,0.000039772895,0.000013513565,0.0000783518,0.00017528301,0.00250107,0.96374565,0.03297152],"study_design_scores_gemma":[0.000008387896,0.000023837261,0.00025164767,0.00019063981,0.0000073088277,0.00008752148,0.000013238364,0.00020578489,0.000060003957,0.0015694994,0.99757475,0.0000073621272],"about_ca_topic_score_codex":0.0010510365,"about_ca_topic_score_gemma":0.0014461068,"teacher_disagreement_score":0.21687016,"about_ca_system_score_codex":0.002942586,"about_ca_system_score_gemma":0.0033774727,"threshold_uncertainty_score":0.72550297},"labels":[],"label_agreement":null},{"id":"W2141587158","doi":"10.1002/cpe.1101","title":"Job completion prediction using case‐based reasoning for Grid computing environments","year":2006,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; University of Ottawa","funders":"Universidade Federal de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Grid computing; Grid; Relevance (law); Task (project management); Resource (disambiguation); Similarity (geometry); Distributed computing; Case-based reasoning; Machine learning; Data mining; Artificial intelligence; Image (mathematics)","score_opus":0.03333774499421042,"score_gpt":0.3171633814593046,"score_spread":0.2838256364650942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141587158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13907748,0.0003482597,0.84821653,0.0009586098,0.000060944185,0.0005729937,0.000684612,0.0052329483,0.004847497],"genre_scores_gemma":[0.6605091,0.00020166596,0.337076,0.0000679919,0.000021838641,0.00019004173,0.0009960276,0.000064824024,0.00087248575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782455,0.00086909323,0.00021236813,0.0003139439,0.00066851184,0.00011166069],"domain_scores_gemma":[0.9906442,0.006745791,0.000758853,0.0009322575,0.0006904689,0.00022828866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031187418,0.0007876539,0.0007844032,0.002766651,0.0008888973,0.002479335,0.0020642253,0.0013078892,0.002978398],"category_scores_gemma":[0.019313391,0.00052565424,0.0007906081,0.0014985622,0.0008125052,0.002336845,0.0011441818,0.0009366803,0.0007983403],"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.00079339906,0.0007291458,0.012832405,0.0002905833,0.00015690435,0.0013985933,0.00054947764,0.68119735,0.0043715276,0.017555183,0.00588964,0.27423584],"study_design_scores_gemma":[0.000019814952,0.000012572732,0.0003205128,0.000009606993,0.000010892899,0.00004906498,0.000039003018,0.9938613,0.0010305742,0.004077328,0.00056058314,0.0000086064065],"about_ca_topic_score_codex":0.014069367,"about_ca_topic_score_gemma":0.00932304,"teacher_disagreement_score":0.014069367,"about_ca_system_score_codex":0.0014283184,"about_ca_system_score_gemma":0.0013799046,"threshold_uncertainty_score":0.027974963},"labels":[],"label_agreement":null},{"id":"W2143849473","doi":"10.1002/cpe.759","title":"On the scalability of many‐to‐many reliable multicast sessions","year":2004,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"SAIT Polytechnic","funders":"Fonds National de la Recherche Luxembourg","keywords":"Multicast; Computer science; Reliable multicast; Protocol Independent Multicast; Computer network; Scalability; Session (web analytics); Pragmatic General Multicast; Protocol (science); IP multicast; Distance Vector Multicast Routing Protocol; Tree (set theory); Network packet; Source-specific multicast; Distributed computing; Throughput; Xcast; Wireless; Medicine; World Wide Web; Telecommunications","score_opus":0.0203997158021895,"score_gpt":0.30834407848617246,"score_spread":0.28794436268398294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143849473","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5254178,0.0017227742,0.4655071,0.0012158684,0.000091718146,0.00009577948,0.00006288966,0.00046973594,0.005416402],"genre_scores_gemma":[0.991113,0.00029701402,0.00806564,0.000042068055,0.000060004746,0.00003800199,0.000020118729,0.000033327033,0.0003307956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716836,0.0012425882,0.00007094974,0.00017835284,0.0010571708,0.0002825753],"domain_scores_gemma":[0.98270744,0.012473138,0.0015384066,0.0011996008,0.0017444071,0.00033696857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045489613,0.00054779166,0.0006531566,0.0008582592,0.00067720644,0.0009761122,0.0011343381,0.00087901426,0.0007827474],"category_scores_gemma":[0.017179783,0.000356226,0.0004286469,0.0005772037,0.0013337249,0.0037755338,0.0012939478,0.001344112,0.000121795274],"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.00046444937,0.00017254816,0.004636579,0.00016654245,0.00013141854,0.0004245266,0.00050286786,0.8546449,0.023208413,0.07683724,0.0012407898,0.037569683],"study_design_scores_gemma":[0.000010481419,0.000069272704,0.00034368972,0.000008462878,0.000018547877,0.000073014875,0.00006076709,0.9880554,0.0017053594,0.009440028,0.00020555539,0.000009401955],"about_ca_topic_score_codex":0.0010023931,"about_ca_topic_score_gemma":0.0005146384,"teacher_disagreement_score":0.0045489613,"about_ca_system_score_codex":0.00096966047,"about_ca_system_score_gemma":0.00068672263,"threshold_uncertainty_score":0.024057508},"labels":[],"label_agreement":null},{"id":"W2146234960","doi":"10.1002/cpe.1791","title":"A MapReduce‐supported network structure for data centers","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Data structure; Tree (set theory); Network structure; Tree structure; Big data; Data center; Distributed computing; Data mining; Computer network; Operating system","score_opus":0.06795627963350627,"score_gpt":0.3241512469748351,"score_spread":0.25619496734132885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146234960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095738664,0.00031333696,0.889988,0.00076418155,0.00013608097,0.0001724385,0.00037115908,0.0011127399,0.01140341],"genre_scores_gemma":[0.7394552,0.00021931656,0.25618267,0.00013222854,0.00006200313,0.00016614812,0.0004090363,0.000072165014,0.0033012484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965787,0.00009444497,0.000024876848,0.00007358785,0.000099496865,0.000049694212],"domain_scores_gemma":[0.9992719,0.00011919909,0.00007374621,0.00020005733,0.00023955946,0.00009548932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062970485,0.0001949458,0.00026503034,0.000488864,0.0008824907,0.001053506,0.0010386504,0.0004260791,0.0021015012],"category_scores_gemma":[0.0011565892,0.00017361333,0.00025638603,0.00058063294,0.0006019036,0.0016481471,0.0013313954,0.0005107348,0.00050120987],"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.000543459,0.00024040749,0.0042322213,0.00036501026,0.00006569423,0.00038033127,0.00045511665,0.28235468,0.03205268,0.48166272,0.021092517,0.1765552],"study_design_scores_gemma":[0.00005270033,0.00019592168,0.0011859181,0.00004014877,0.000026487236,0.00036498482,0.00021862812,0.8006407,0.014448287,0.13750727,0.045265872,0.00005307837],"about_ca_topic_score_codex":0.0015410747,"about_ca_topic_score_gemma":0.0022538172,"teacher_disagreement_score":0.0021015012,"about_ca_system_score_codex":0.0009896754,"about_ca_system_score_gemma":0.0009541529,"threshold_uncertainty_score":0.007180631},"labels":[],"label_agreement":null},{"id":"W2149573515","doi":"10.1002/cpe.872","title":"Performance evaluation of Data Distribution Management strategies","year":2004,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Benchmark (surveying); Scalability; High-level architecture; Distribution management system; Distributed computing; Grid; Variety (cybernetics); Scheme (mathematics); Service (business); Scale (ratio); Data management; Distribution (mathematics); Service level; Data mining; Database; Interoperability; Artificial intelligence; Engineering","score_opus":0.27351746608546035,"score_gpt":0.5206736811834997,"score_spread":0.2471562150980393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149573515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95697737,0.0018948592,0.028450178,0.00074670144,0.00010846857,0.00031070085,0.00037001824,0.0026936645,0.008447994],"genre_scores_gemma":[0.984565,0.0001957199,0.014082919,0.000054553846,0.000014347352,0.000072478135,0.0002631964,0.00007496927,0.00067678967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99493426,0.0019981563,0.00045122346,0.00065207813,0.0012704671,0.00069384405],"domain_scores_gemma":[0.9673439,0.020252364,0.0018831975,0.0036084275,0.0049352134,0.0019768348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006558347,0.001388077,0.0008753634,0.0019180285,0.001165414,0.0018147427,0.0025469009,0.0012329515,0.0018334717],"category_scores_gemma":[0.022461157,0.0003584522,0.00030909033,0.0020825595,0.00097572734,0.0025469046,0.0016114133,0.0008876583,0.00038443424],"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.0066153896,0.0027808356,0.027829768,0.00060545176,0.000347661,0.00023264297,0.0005437148,0.6711342,0.028333634,0.01078641,0.007354104,0.24343626],"study_design_scores_gemma":[0.00036860365,0.0016305408,0.0034764344,0.00002565438,0.00009433234,0.00012552523,0.00037378896,0.96383256,0.026457472,0.0017359128,0.0018296055,0.00004962884],"about_ca_topic_score_codex":0.0065910397,"about_ca_topic_score_gemma":0.0036574183,"teacher_disagreement_score":0.0065910397,"about_ca_system_score_codex":0.0026009157,"about_ca_system_score_gemma":0.0018777087,"threshold_uncertainty_score":0.03468424},"labels":[],"label_agreement":null},{"id":"W2152555261","doi":"10.1002/cpe.876","title":"HLA real‐time extension","year":2004,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Common Object Request Broker Architecture; Computer science; High-level architecture; Quality of service; Jitter; Distributed computing; Embedded system; Operating system; Computer network; Interoperability; Telecommunications","score_opus":0.020370849220070392,"score_gpt":0.3145459142218544,"score_spread":0.29417506500178403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152555261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025897713,0.0010203992,0.8423133,0.0016329811,0.0012917654,0.0003670052,0.0007728066,0.015785895,0.110918224],"genre_scores_gemma":[0.40989476,0.0014652262,0.4438687,0.0017943734,0.00089812453,0.00078916596,0.005085028,0.0027564175,0.13344826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983967,0.00048583563,0.00021118624,0.00019415891,0.00048339312,0.00022876005],"domain_scores_gemma":[0.9961957,0.0005161463,0.00023570356,0.0016165847,0.0010831389,0.00035271948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003160312,0.00042158537,0.0003060916,0.0004576177,0.00050351646,0.0019119013,0.0011206068,0.000766023,0.020925509],"category_scores_gemma":[0.003926382,0.00029826825,0.00037957195,0.0005386334,0.00060722895,0.0022679684,0.0020158275,0.001941063,0.0080712475],"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.0011002881,0.0002911045,0.0022743817,0.00038155896,0.00004083001,0.0009023842,0.0015261879,0.0210522,0.057896953,0.48926684,0.084648915,0.3406184],"study_design_scores_gemma":[0.00009886159,0.00017922737,0.00066009915,0.00008007247,0.00001571174,0.0007140525,0.0000928345,0.030248933,0.017335983,0.02650143,0.92402065,0.000052057807],"about_ca_topic_score_codex":0.0008132588,"about_ca_topic_score_gemma":0.00041500235,"teacher_disagreement_score":0.020925509,"about_ca_system_score_codex":0.0008411498,"about_ca_system_score_gemma":0.0010186004,"threshold_uncertainty_score":0.070002854},"labels":[],"label_agreement":null},{"id":"W2156088178","doi":"10.1002/cpe.885","title":"Concurrent urban legends","year":2005,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":13,"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 Waterloo","funders":"","keywords":"Concurrency; Mutual exclusion; Computer science; Spurious relationship; Construct (python library); Inheritance (genetic algorithm); Concurrent object-oriented programming; Field (mathematics); Programming language; Mathematics; Programming paradigm","score_opus":0.021903332450199632,"score_gpt":0.32136893135190914,"score_spread":0.2994655989017095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156088178","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01950744,0.003398141,0.074548125,0.026406156,0.006539905,0.00007664068,0.00029526645,0.001303751,0.86792463],"genre_scores_gemma":[0.6301583,0.00440599,0.024365136,0.007201538,0.0027534456,0.0002276305,0.0004722868,0.0013255671,0.32909015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986802,0.0003914346,0.000048180667,0.00026101578,0.00037311343,0.00024599984],"domain_scores_gemma":[0.99790907,0.00076447526,0.0002122452,0.00041626752,0.000498428,0.00019955295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001327086,0.00063738984,0.0003486498,0.0009872463,0.0055638296,0.006940639,0.0016092461,0.0014024276,0.033016473],"category_scores_gemma":[0.0062403954,0.0003730939,0.00048420613,0.0014602551,0.007177775,0.0072400947,0.0043475204,0.0034285367,0.0036884327],"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.000018053746,0.0000042506167,0.000084843385,0.000024625577,0.0000015520961,0.00007811169,0.0013239933,0.00032807217,0.00011909145,0.97358364,0.018461965,0.0059717274],"study_design_scores_gemma":[0.000010268331,0.000015559997,0.00014330982,0.000059854814,0.00000592998,0.0003595612,0.0018875693,0.001350871,0.0005117748,0.13841219,0.85722226,0.000020873807],"about_ca_topic_score_codex":0.008197542,"about_ca_topic_score_gemma":0.010711959,"teacher_disagreement_score":0.033016473,"about_ca_system_score_codex":0.003791688,"about_ca_system_score_gemma":0.0016101818,"threshold_uncertainty_score":0.1104511},"labels":[],"label_agreement":null},{"id":"W2156498190","doi":"10.1002/cpe.3573","title":"Provable multiple replication data possession with full dynamics for secure cloud storage","year":2015,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":56,"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 Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Merkle tree; Data integrity; Cloud storage; Hash function; Replication (statistics); Server; Reliability (semiconductor); Cloud computing; Overhead (engineering); Computer network; Computer security; Distributed computing; Hash chain; Encryption; Operating system","score_opus":0.07417905640899732,"score_gpt":0.3620698924480471,"score_spread":0.2878908360390498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156498190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060593974,0.0009940345,0.9279494,0.002006213,0.00019447452,0.0003154236,0.0001510036,0.0011943141,0.0066011827],"genre_scores_gemma":[0.8933087,0.0003601683,0.10346709,0.0002514758,0.00013841798,0.0002415736,0.0001412396,0.000079183745,0.00201215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99282277,0.0021955362,0.0005640787,0.00069394545,0.0032023455,0.0005213292],"domain_scores_gemma":[0.98617214,0.005632774,0.0012484543,0.005085578,0.0014278289,0.00043322885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047437274,0.00039765256,0.00089487305,0.0006938554,0.0013718774,0.0020814836,0.001900066,0.0012759696,0.002357373],"category_scores_gemma":[0.012961099,0.0004703218,0.0009261611,0.00073017523,0.0029378906,0.006223014,0.0056661186,0.0029393798,0.0006688429],"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.0010157973,0.0002335166,0.0023747475,0.0008004217,0.00012695171,0.0014898884,0.0013582838,0.103401765,0.0692508,0.6732448,0.0061583132,0.14054467],"study_design_scores_gemma":[0.00017892415,0.00046228195,0.0004121475,0.00010744119,0.00006179061,0.001629245,0.00035038983,0.6151194,0.052562248,0.31004882,0.018940555,0.00012686617],"about_ca_topic_score_codex":0.000488632,"about_ca_topic_score_gemma":0.0003253412,"teacher_disagreement_score":0.0047437274,"about_ca_system_score_codex":0.0015491343,"about_ca_system_score_gemma":0.0021602006,"threshold_uncertainty_score":0.025087535},"labels":[],"label_agreement":null},{"id":"W2165637133","doi":"10.1002/cpe.3409","title":"Improving the user experience of the rCUDA remote GPU virtualization framework","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Science; Generalitat Valenciana; Queen's University; Queen's University Belfast; U.S. Department of Energy","keywords":"CUDA; Computer science; Overhead (engineering); Node (physics); Virtualization; GPU cluster; Usability; General-purpose computing on graphics processing units; Parallel computing; Operating system; Graphics; Embedded system; Cloud computing","score_opus":0.01676471276957835,"score_gpt":0.30663671325132347,"score_spread":0.2898720004817451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165637133","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8205249,0.0009488829,0.13321811,0.0020542347,0.00025338787,0.000183505,0.00034989507,0.016624853,0.025842212],"genre_scores_gemma":[0.9267321,0.00031491416,0.058329716,0.0005984193,0.000074158845,0.00011994872,0.0004223341,0.0031977072,0.010210699],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99833846,0.00081854244,0.000049146514,0.00019024704,0.0003999436,0.00020356933],"domain_scores_gemma":[0.99581236,0.0023212966,0.00015498638,0.0005807111,0.0005490009,0.0005815752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036527852,0.00077710085,0.00045868504,0.0005155445,0.0006270784,0.0023083286,0.0011510958,0.0009076003,0.008546617],"category_scores_gemma":[0.008705161,0.00031961533,0.00078548404,0.00020999339,0.0007496393,0.0020129152,0.0026527643,0.0012915819,0.0016917821],"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.0038486216,0.002616817,0.030762685,0.0011992274,0.00030345112,0.0068952357,0.13289467,0.014543411,0.15873864,0.020353157,0.1254255,0.5024186],"study_design_scores_gemma":[0.0006873207,0.0043960596,0.070045,0.0008728055,0.0004547534,0.012693385,0.030715173,0.16533925,0.08352542,0.016784584,0.6128385,0.0016477916],"about_ca_topic_score_codex":0.001341296,"about_ca_topic_score_gemma":0.0013593846,"teacher_disagreement_score":0.008546617,"about_ca_system_score_codex":0.0004948994,"about_ca_system_score_gemma":0.0003724262,"threshold_uncertainty_score":0.028591275},"labels":[],"label_agreement":null},{"id":"W2165821496","doi":"10.1002/cpe.3263","title":"High‐performance<i>N</i>‐thread software solutions for mutual exclusion","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Research Council Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mutual exclusion; Correctness; Thread (computing); Intuition; Algorithm; Software; Implementation; Critical section; Parallel computing; Programming language","score_opus":0.025177903421765332,"score_gpt":0.2955406178304535,"score_spread":0.27036271440868814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165821496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017962743,0.0005960909,0.9697651,0.00047006327,0.00012690696,0.000082407896,0.000028353255,0.003335256,0.0076330504],"genre_scores_gemma":[0.30630532,0.0006217868,0.6812845,0.00023491214,0.00012031859,0.00022087552,0.00020291384,0.00082495774,0.010184425],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998694,0.0003180939,0.000105239524,0.00015299239,0.00055747817,0.00017212704],"domain_scores_gemma":[0.9976534,0.00071141147,0.00028803703,0.0005909042,0.0005978503,0.00015840308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017341479,0.0005352285,0.0005303798,0.0006616436,0.00070252887,0.0019812512,0.001862947,0.0007910132,0.005785853],"category_scores_gemma":[0.0042336034,0.00030585617,0.0006109713,0.0006414934,0.0009414038,0.0022545722,0.0016984855,0.0012201442,0.0016769065],"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.00034902524,0.00026172563,0.0029134646,0.0006469055,0.00006412786,0.00015471147,0.00058332784,0.08247323,0.033328656,0.30453032,0.020508874,0.55418557],"study_design_scores_gemma":[0.00013295254,0.00032111417,0.00078881264,0.00017290641,0.00004711094,0.0003535884,0.0001571247,0.73556405,0.05567936,0.13454391,0.0721612,0.000077813085],"about_ca_topic_score_codex":0.0012847412,"about_ca_topic_score_gemma":0.00096405187,"teacher_disagreement_score":0.005785853,"about_ca_system_score_codex":0.0012556656,"about_ca_system_score_gemma":0.001402276,"threshold_uncertainty_score":0.019355595},"labels":[],"label_agreement":null},{"id":"W2170048895","doi":"10.1002/cpe.3553","title":"A novel technique for detecting suspicious lesions in breast ultrasound images","year":2015,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"AI in cancer detection","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Utah State University","keywords":"Computer science; Artificial intelligence; Thread (computing); Breast ultrasound; Pattern recognition (psychology); Segmentation; Computer vision; Feature selection; Support vector machine; Mammography; Breast cancer","score_opus":0.04326917197220428,"score_gpt":0.3473463849342993,"score_spread":0.30407721296209506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170048895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060166076,0.002192161,0.93063396,0.00028636056,0.00020558007,0.00017811742,0.00014952032,0.0037828286,0.0024054085],"genre_scores_gemma":[0.17710531,0.0008797901,0.8181717,0.00019680783,0.00012735986,0.00010897925,0.00017350086,0.00010587239,0.0031307298],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993624,0.000066564506,0.000043892727,0.00014322168,0.00034317255,0.000040730134],"domain_scores_gemma":[0.99941516,0.00015389425,0.00009134085,0.00007859849,0.00021217485,0.0000488328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043711247,0.00056973624,0.00053145847,0.0018839685,0.00034789543,0.000594646,0.0008390009,0.0008391532,0.002292341],"category_scores_gemma":[0.0010182792,0.00046587604,0.00048937084,0.0007319974,0.00034316827,0.0008142677,0.0006156998,0.0005226299,0.0012085502],"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.0002106951,0.000077737364,0.0024903892,0.0003318764,0.000050935967,0.0004173912,0.000111999354,0.0014612131,0.47727665,0.0010197147,0.0025353108,0.5140161],"study_design_scores_gemma":[0.00011606852,0.00083991006,0.01746144,0.00012632374,0.00033964586,0.01565338,0.00013859045,0.31247595,0.60403067,0.0024162822,0.046212193,0.0001895579],"about_ca_topic_score_codex":0.0006236346,"about_ca_topic_score_gemma":0.0011525099,"teacher_disagreement_score":0.002292341,"about_ca_system_score_codex":0.00022935707,"about_ca_system_score_gemma":0.00045115687,"threshold_uncertainty_score":0.0076686144},"labels":[],"label_agreement":null},{"id":"W2171692358","doi":"10.1002/cpe.3236","title":"A genome‐wide association study platform built on iPlant cyber‐infrastructure","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Ontario Institute for Cancer Research","funders":"National Science Foundation","keywords":"Workflow; Computer science; World Wide Web; Big data; Data sharing; Data science; Database; Operating system","score_opus":0.01550803087783823,"score_gpt":0.310285277526103,"score_spread":0.29477724664826477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171692358","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033346657,0.0009669297,0.7423511,0.0033370259,0.00043648866,0.0010992659,0.039631795,0.15077484,0.028055824],"genre_scores_gemma":[0.27603748,0.0009901113,0.62486386,0.0022189089,0.00037435556,0.0033130404,0.069976434,0.012353899,0.009871918],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99679774,0.0008896196,0.00020042715,0.000873042,0.0009536355,0.00028553433],"domain_scores_gemma":[0.99358493,0.0024559197,0.0005248024,0.0019824165,0.00063511543,0.0008167851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006274093,0.0007527999,0.0011471437,0.0019679423,0.00060886843,0.0023815914,0.0028824771,0.0005843889,0.014039421],"category_scores_gemma":[0.009581158,0.00088408054,0.00096821075,0.0022939893,0.00082633196,0.002043884,0.0053891814,0.0014996536,0.0073177437],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00721093,0.0005144057,0.030670047,0.0016439853,0.0012589849,0.0037047144,0.0016149498,0.044951428,0.05670765,0.0677698,0.4146299,0.36932307],"study_design_scores_gemma":[0.0029850935,0.0008087829,0.0335653,0.0003797555,0.0008227394,0.0031102272,0.00032809342,0.21644339,0.05529062,0.11375472,0.5719043,0.00060700724],"about_ca_topic_score_codex":0.0033646054,"about_ca_topic_score_gemma":0.002280746,"teacher_disagreement_score":0.014039421,"about_ca_system_score_codex":0.0008930895,"about_ca_system_score_gemma":0.0029520541,"threshold_uncertainty_score":0.046966553},"labels":[],"label_agreement":null},{"id":"W2173057405","doi":"10.1002/cpe.848","title":"Run‐time evaluation of opportunities for object inlining in Java","year":2005,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Java; Just-in-time compilation; Compiler; Programming language; Object (grammar); Pointer (user interface); Object code; Speedup; Benchmark (surveying); Parallel computing; Operating system; Key (lock)","score_opus":0.1108328471571171,"score_gpt":0.3907268302496824,"score_spread":0.2798939830925653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173057405","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940613,0.00032200516,0.0027727322,0.00006995374,0.000028166352,0.000027189883,0.00022181062,0.001606427,0.00089038594],"genre_scores_gemma":[0.99084705,0.00011748701,0.007617103,0.00003660303,0.000017372391,0.000051340372,0.0005925118,0.00036495202,0.00035567445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964148,0.0011405917,0.00027262667,0.00061110855,0.0010500631,0.00051086064],"domain_scores_gemma":[0.96934783,0.021292504,0.003035429,0.0029360796,0.0022591949,0.0011289723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029709777,0.001487161,0.0005688943,0.0012676162,0.00049952883,0.00083091954,0.0014139506,0.0005734969,0.0007924621],"category_scores_gemma":[0.013169,0.00055918115,0.0005359606,0.0014992581,0.0009970374,0.0012457513,0.0008218403,0.0013018207,0.00021845776],"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.011262851,0.00579984,0.12178923,0.0021753097,0.000852754,0.0011430818,0.0025024952,0.30302152,0.29673943,0.0053030644,0.009186231,0.2402242],"study_design_scores_gemma":[0.00036735594,0.007864415,0.05676745,0.00010315508,0.00030675053,0.00033440356,0.00039835362,0.73596376,0.1921432,0.0016081877,0.0040286444,0.00011429785],"about_ca_topic_score_codex":0.0031534832,"about_ca_topic_score_gemma":0.0029633036,"teacher_disagreement_score":0.0031534832,"about_ca_system_score_codex":0.0010498516,"about_ca_system_score_gemma":0.000836164,"threshold_uncertainty_score":0.015712202},"labels":[],"label_agreement":null},{"id":"W2189138427","doi":"10.1002/cpe.3724","title":"VMBackup: an efficient framework for online virtual machine image backup and recovery","year":2015,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Crandall University; University of New Brunswick","funders":"","keywords":"Backup; Data deduplication; Computer science; Throughput; Volume (thermodynamics); Partition (number theory); Operating system; Locality; Backup software; File system; Parallel computing","score_opus":0.04548490342768,"score_gpt":0.36892786904675084,"score_spread":0.3234429656190708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189138427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019029273,0.00045272475,0.8958982,0.00014048787,0.000092272334,0.0002775957,0.00025202782,0.08171387,0.002143485],"genre_scores_gemma":[0.45772702,0.00032089773,0.53053194,0.00017043806,0.00007703691,0.00033436267,0.0014432317,0.004211555,0.005183499],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99925333,0.00012559921,0.000055046603,0.00012647799,0.00028404486,0.00015543148],"domain_scores_gemma":[0.99907625,0.00012567604,0.00006520497,0.00047597228,0.0001478125,0.000109184235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009679267,0.00084697723,0.0008132569,0.0011968234,0.0007733046,0.001211719,0.0036658726,0.00065198337,0.0048440257],"category_scores_gemma":[0.001954783,0.00062488584,0.00054768444,0.0005396468,0.00068624143,0.0021852292,0.0032460915,0.0010940718,0.0015294593],"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.0024239093,0.0006041288,0.004167696,0.00044421497,0.00016811535,0.0007864697,0.00064074073,0.078744054,0.06678523,0.030600129,0.07403562,0.7405996],"study_design_scores_gemma":[0.00020897089,0.0001952679,0.0011595044,0.00004035565,0.000039669114,0.00046092455,0.0001063099,0.89324677,0.053362973,0.0126908,0.03837262,0.00011584212],"about_ca_topic_score_codex":0.0032860206,"about_ca_topic_score_gemma":0.002386829,"teacher_disagreement_score":0.0048440257,"about_ca_system_score_codex":0.0007540844,"about_ca_system_score_gemma":0.0010111791,"threshold_uncertainty_score":0.016204953},"labels":[],"label_agreement":null},{"id":"W2244262005","doi":"","title":"Concurrent urban legends: Research Articles","year":2005,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Urban Design and Spatial Analysis","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Concurrency; Mutual exclusion; Computer science; Spurious relationship; Construct (python library); Field (mathematics); Concurrent object-oriented programming; Inheritance (genetic algorithm); Synchronization (alternating current); Programming language; Mathematics","score_opus":0.06348001023194325,"score_gpt":0.3522484638941308,"score_spread":0.2887684536621875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244262005","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0151003925,0.10938538,0.03599254,0.10808116,0.029807307,0.000100668956,0.00033090782,0.0007041756,0.70049757],"genre_scores_gemma":[0.4667026,0.13142726,0.018646065,0.01816108,0.02810092,0.00019496781,0.0007119262,0.0014844121,0.33457077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978879,0.00069911213,0.000104447165,0.00039290116,0.00071782025,0.00019782895],"domain_scores_gemma":[0.9923344,0.0038834715,0.00050580624,0.0009440445,0.0017086525,0.00062355207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026651805,0.000552396,0.00040984066,0.0022810898,0.0047965986,0.01141299,0.0016552347,0.0022210693,0.03140613],"category_scores_gemma":[0.012102403,0.00046822784,0.0003991745,0.005627562,0.0072586155,0.008734143,0.0034645856,0.0028487486,0.0029132764],"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.000019367726,0.00002976002,0.00019284614,0.00028720454,0.0000046265,0.000092807146,0.003995846,0.00047018784,0.00016219431,0.84549606,0.10112239,0.048126772],"study_design_scores_gemma":[0.0000047464605,0.000009750592,0.00019551015,0.00027967527,0.0000047618487,0.00014089039,0.002675362,0.00031611405,0.00019106733,0.049273532,0.9468972,0.000011399292],"about_ca_topic_score_codex":0.009405718,"about_ca_topic_score_gemma":0.009521384,"teacher_disagreement_score":0.03140613,"about_ca_system_score_codex":0.005654769,"about_ca_system_score_gemma":0.0038404907,"threshold_uncertainty_score":0.105063975},"labels":[],"label_agreement":null},{"id":"W2276717191","doi":"10.1002/cpe.3773","title":"Parallel social network mining for interesting ‘following’ patterns","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Interdependence; Computer science; Friendship; Social network (sociolinguistics); Social network analysis; Data science; Data mining; World Wide Web; Social media; Sociology","score_opus":0.0467482113840547,"score_gpt":0.3547713504565648,"score_spread":0.3080231390725101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276717191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39544043,0.0006159044,0.5883375,0.0012697221,0.000118026044,0.00048801614,0.0050558248,0.0029335667,0.005740975],"genre_scores_gemma":[0.7031862,0.00013620038,0.28836244,0.00007962187,0.000058507758,0.00021689359,0.0059389756,0.000090818714,0.0019303726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979826,0.00030431044,0.00022834024,0.0005948474,0.0007071624,0.00018269572],"domain_scores_gemma":[0.99547845,0.001627872,0.0007527393,0.0011159944,0.00083310757,0.00019192701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001179324,0.0006236875,0.0010145033,0.004357516,0.0012054892,0.0013887011,0.0017782341,0.0008053427,0.0020384504],"category_scores_gemma":[0.008978977,0.00044973282,0.0011915552,0.004186015,0.0006059856,0.0021943152,0.0015671827,0.0008240564,0.000881683],"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.001028198,0.00091937603,0.11251042,0.00054062513,0.0006061203,0.0014231714,0.0010987243,0.19572821,0.018363886,0.034499496,0.017626703,0.61565506],"study_design_scores_gemma":[0.000030893127,0.000064783715,0.0056235706,0.000018998395,0.000050846604,0.0003863754,0.00021881402,0.9535578,0.005016325,0.029930975,0.0050826976,0.000017903714],"about_ca_topic_score_codex":0.0037743412,"about_ca_topic_score_gemma":0.0062532364,"teacher_disagreement_score":0.004357516,"about_ca_system_score_codex":0.00067822216,"about_ca_system_score_gemma":0.0012984724,"threshold_uncertainty_score":0.007504761},"labels":[],"label_agreement":null},{"id":"W2278576996","doi":"10.1002/cpe.3751","title":"A novel parallel deblocking filtering strategy for HEVC/H.265 based on GPU","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Deblocking filter; Computer science; Graphics processing unit; Parallel computing; Coding (social sciences); Graphics; Massively parallel; Normalization (sociology); Computation; Algorithm; Computer graphics (images)","score_opus":0.07503884798216896,"score_gpt":0.3491729264287559,"score_spread":0.27413407844658694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278576996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073448546,0.0004499116,0.9180373,0.00014854957,0.00009797201,0.00008601818,0.0000698547,0.0014092553,0.006252549],"genre_scores_gemma":[0.5402843,0.00032960204,0.4502879,0.0001297541,0.000058995647,0.0000682657,0.000291068,0.00012942747,0.008420705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998247,0.000012030243,0.000008941721,0.000027955686,0.00010192536,0.00002448358],"domain_scores_gemma":[0.99988604,0.000013924728,0.0000108621225,0.000021417865,0.000054651453,0.000013022358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014216089,0.0005327503,0.0003226533,0.00059699954,0.00033082225,0.00039683993,0.00056061347,0.00021725174,0.001637249],"category_scores_gemma":[0.00027443373,0.00017453368,0.00031374206,0.00042318503,0.0002091294,0.0003607541,0.00031426683,0.0004028113,0.00039293323],"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.00047509203,0.0001445023,0.0014675637,0.00009841276,0.000058917863,0.00025068191,0.00011042223,0.075355016,0.34567574,0.010257838,0.0072629587,0.5588429],"study_design_scores_gemma":[0.000039043673,0.00009871763,0.0009308894,0.000008594368,0.000026521491,0.00016190115,0.000022256048,0.895882,0.094584085,0.0014324884,0.006784926,0.00002864216],"about_ca_topic_score_codex":0.008406103,"about_ca_topic_score_gemma":0.009613514,"teacher_disagreement_score":0.008406103,"about_ca_system_score_codex":0.0003998364,"about_ca_system_score_gemma":0.0007272332,"threshold_uncertainty_score":0.016714334},"labels":[],"label_agreement":null},{"id":"W2301455101","doi":"","title":"RF-MVTC: an efficient risk-free multiversion concurrency control algorithm: Research Articles","year":2004,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Optimistic concurrency control; Concurrency control; Concurrency; Database transaction; Workstation; Distributed computing; Focus (optics); Serializability; Transaction data; Transactional leadership; Distributed transaction; Transaction processing; Algorithm; Distributed concurrency control; Database; Operating system","score_opus":0.03735774805963148,"score_gpt":0.3623460408416172,"score_spread":0.3249882927819857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301455101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064515998,0.00018102804,0.99118793,0.00012509084,0.00003847148,0.00006451701,0.000023835875,0.0011492542,0.0007782508],"genre_scores_gemma":[0.16755833,0.00011521054,0.8299311,0.00011675541,0.000048161284,0.00014447745,0.00013004775,0.00021315111,0.0017429113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981047,0.00042065533,0.0001564399,0.00037774554,0.0007870378,0.00015337355],"domain_scores_gemma":[0.9963942,0.0015335,0.00035254826,0.00087678956,0.00067736604,0.00016556037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029178287,0.000756026,0.000998608,0.0011398043,0.000671235,0.0012809078,0.0029657122,0.0013471652,0.0038620979],"category_scores_gemma":[0.008710092,0.0004248113,0.0006169213,0.0010905333,0.0011171029,0.0020712526,0.001983251,0.0016465427,0.00082744734],"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.0005672899,0.00017070588,0.0017733821,0.00017462978,0.00008311286,0.000109179906,0.00021669905,0.3837042,0.009945182,0.043002743,0.003621087,0.55663174],"study_design_scores_gemma":[0.000065750144,0.000047610058,0.000070567665,0.000011854699,0.000011141547,0.00006301597,0.0000103823595,0.9824936,0.003401832,0.011746881,0.0020637317,0.000013685621],"about_ca_topic_score_codex":0.0056904703,"about_ca_topic_score_gemma":0.0036952435,"teacher_disagreement_score":0.0056904703,"about_ca_system_score_codex":0.001069754,"about_ca_system_score_gemma":0.0023577386,"threshold_uncertainty_score":0.015431106},"labels":[],"label_agreement":null},{"id":"W2395261749","doi":"10.1002/cpe.3869","title":"Towards traffic minimization for data placement in online social networks","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Novelis (Canada)","funders":"National Natural Science Foundation of China","keywords":"Computer science; Server; Locality; Network topology; Data center; Social graph; Hash function; Distributed computing; Partition (number theory); Graph partition; Pairwise comparison; Graph; Theoretical computer science; Computer network; Computer security; Social media; World Wide Web; Artificial intelligence; Mathematics","score_opus":0.07111025820182253,"score_gpt":0.3561732568124616,"score_spread":0.28506299861063905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395261749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06888826,0.00030876513,0.92571527,0.0008345253,0.00006085624,0.00016229058,0.00014366883,0.0004325199,0.003453864],"genre_scores_gemma":[0.63785857,0.0002851586,0.3567844,0.0001713852,0.00011137282,0.0002489687,0.0003481435,0.00027532605,0.0039166817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974632,0.0011329689,0.000105657055,0.000438248,0.0005083315,0.0003515159],"domain_scores_gemma":[0.99502254,0.0024187244,0.00047704077,0.000849831,0.00085389137,0.0003779282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024188994,0.0012182913,0.0015356146,0.001493591,0.0017842496,0.0023869516,0.00255743,0.0015477269,0.002360744],"category_scores_gemma":[0.008173019,0.0007111012,0.000827663,0.0018746646,0.0013408292,0.0036533163,0.0029452187,0.0012097913,0.0006861139],"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.0002993825,0.000305349,0.0020702477,0.00026960115,0.00008005212,0.000103195496,0.00032996602,0.7833679,0.010032319,0.07675628,0.006507217,0.11987856],"study_design_scores_gemma":[0.00001018899,0.000041652132,0.00018430261,0.0000075900043,0.0000085777565,0.000031058684,0.00009768599,0.97033465,0.0016315263,0.026635157,0.0010113243,0.0000063365355],"about_ca_topic_score_codex":0.0027755362,"about_ca_topic_score_gemma":0.002717066,"teacher_disagreement_score":0.0027755362,"about_ca_system_score_codex":0.0026585257,"about_ca_system_score_gemma":0.0018598125,"threshold_uncertainty_score":0.019289076},"labels":[],"label_agreement":null},{"id":"W2408335752","doi":"10.1002/cpe.3801","title":"A modular distributed simulation‐based architecture for intelligent transportation systems","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Visualization; Modular design; Merge (version control); Distributed computing; Network simulation; Simulation; Artificial intelligence","score_opus":0.017651207777337502,"score_gpt":0.2822819340177304,"score_spread":0.26463072624039286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408335752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007152258,0.00013255457,0.978693,0.0002575848,0.00007606789,0.00016353859,0.00011206823,0.0063327374,0.0070800837],"genre_scores_gemma":[0.35602045,0.00058221084,0.62861097,0.0001834333,0.00006730671,0.00072821206,0.0009985757,0.00074398716,0.012064871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995098,0.00019555492,0.0000420803,0.0000800218,0.00013188382,0.000040661853],"domain_scores_gemma":[0.9995498,0.000118882184,0.00003153506,0.00014103117,0.00010365865,0.00005497887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011949746,0.0006955708,0.00049954554,0.00071407703,0.0005928828,0.0015724801,0.0015005063,0.0009859378,0.00779147],"category_scores_gemma":[0.001523734,0.000458046,0.00093055714,0.0004195809,0.0007738306,0.0012517953,0.0015184784,0.000983255,0.001994371],"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.00014848373,0.00012325792,0.0013515743,0.00013526226,0.000089337605,0.00016798908,0.00025336535,0.8083353,0.014648286,0.103066385,0.0051549897,0.06652567],"study_design_scores_gemma":[0.000026245596,0.000044862765,0.00013361016,0.000022842552,0.000020949572,0.00003884171,0.000013047644,0.95508206,0.0030252766,0.018194962,0.023380388,0.000016926857],"about_ca_topic_score_codex":0.0029252672,"about_ca_topic_score_gemma":0.0023314187,"teacher_disagreement_score":0.00779147,"about_ca_system_score_codex":0.0010230064,"about_ca_system_score_gemma":0.001368873,"threshold_uncertainty_score":0.026065052},"labels":[],"label_agreement":null},{"id":"W2408990623","doi":"10.1002/cpe.3807","title":"Power‐aware server consolidation for federated clouds","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cloud computing; Computer science; Data center; Provisioning; Cloudlet; Service-level agreement; Energy consumption; Computer network; Carbon footprint; Server farm; Server; Distributed computing; Computer security; Operating system; Greenhouse gas; Client–server model; Engineering","score_opus":0.02282015756792564,"score_gpt":0.3103958121775638,"score_spread":0.28757565460963813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408990623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5351665,0.0009141249,0.45350635,0.00048826233,0.00018789404,0.00019653575,0.00008024335,0.0017479779,0.0077121384],"genre_scores_gemma":[0.9873826,0.0000439213,0.01205632,0.000027492088,0.000007738911,0.000013589832,0.000024030718,0.000011979689,0.00043235786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990415,0.00033313764,0.00005729816,0.00012521466,0.00021525647,0.00022766944],"domain_scores_gemma":[0.998845,0.00022815255,0.00015599286,0.00022559687,0.00036344928,0.0001818356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011244506,0.00044222837,0.0007214091,0.00043640012,0.0007041865,0.001490524,0.0010961916,0.00074996374,0.000980741],"category_scores_gemma":[0.0016741036,0.00023109405,0.00047420745,0.0005319912,0.0004958341,0.0009872811,0.000947703,0.00057134614,0.00020254326],"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.0003889386,0.00024091596,0.0036224797,0.000060624192,0.000075829696,0.00028261635,0.00009944771,0.9047585,0.019065551,0.0062470757,0.0013498955,0.06380806],"study_design_scores_gemma":[0.0000076046563,0.00003512784,0.0003543553,0.000002869599,0.0000059028325,0.000020721258,0.000015252547,0.9960853,0.0020027626,0.0011164927,0.00034963325,0.0000040451278],"about_ca_topic_score_codex":0.0039256345,"about_ca_topic_score_gemma":0.002596786,"teacher_disagreement_score":0.0039256345,"about_ca_system_score_codex":0.0010167437,"about_ca_system_score_gemma":0.0009746045,"threshold_uncertainty_score":0.0078055263},"labels":[],"label_agreement":null},{"id":"W2440504827","doi":"","title":"Loosely coordinated coscheduling in the context of other approaches for dynamic job scheduling: a survey: Research Articles","year":2005,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Preemption; Distributed computing; Scheduling (production processes); Job scheduler; Scalability; Gang scheduling; Shared resource; Response time; Resource allocation; Workstation; Dynamic priority scheduling; Operating system; Computer network; Schedule; Rate-monotonic scheduling; Cloud computing","score_opus":0.16703243736376103,"score_gpt":0.4008863283049055,"score_spread":0.23385389094114448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2440504827","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014294659,0.35981277,0.5785564,0.0021292993,0.0030892848,0.00022565559,0.00011157954,0.0010522091,0.04072815],"genre_scores_gemma":[0.25162646,0.33510792,0.3736023,0.0017346187,0.007203535,0.00040258942,0.0007767222,0.00089364976,0.028652292],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987752,0.0002887464,0.00010228923,0.00028906437,0.00040793116,0.00013676067],"domain_scores_gemma":[0.99856263,0.00068537577,0.000112878624,0.00020479754,0.00031258794,0.00012178277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011925396,0.0008578295,0.0013435277,0.0015462221,0.0010490458,0.0026069628,0.0019158791,0.0012194535,0.0033651618],"category_scores_gemma":[0.0022511831,0.00057691743,0.00068257964,0.005732774,0.0008309005,0.0026879357,0.0008825744,0.0014667866,0.0013014885],"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.0002461056,0.0002939422,0.0012703814,0.0030505194,0.0001131184,0.00019183183,0.0006406178,0.044847153,0.004461845,0.10479519,0.017279666,0.82280976],"study_design_scores_gemma":[0.00010058637,0.00043747076,0.0032618234,0.0009777952,0.00018734159,0.0012359965,0.000860034,0.17880225,0.005559017,0.12308993,0.6853335,0.00015428047],"about_ca_topic_score_codex":0.003422984,"about_ca_topic_score_gemma":0.0018245383,"teacher_disagreement_score":0.003422984,"about_ca_system_score_codex":0.0011820147,"about_ca_system_score_gemma":0.0017303044,"threshold_uncertainty_score":0.011257589},"labels":[],"label_agreement":null},{"id":"W2518178976","doi":"10.1002/cpe.3896","title":"BRGP: a balanced RDF graph partitioning algorithm for cloud storage","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"RDF; Computer science; Graph partition; Partition (number theory); Algorithm; Graph; Cluster analysis; Theoretical computer science; Mathematics; Semantic Web; Information retrieval; Artificial intelligence; Combinatorics","score_opus":0.01815302016986699,"score_gpt":0.2989604839171414,"score_spread":0.28080746374727444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518178976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019050911,0.00022301964,0.9743696,0.00021024632,0.000055068198,0.000138612,0.000428807,0.003456064,0.0020675682],"genre_scores_gemma":[0.16654582,0.00016436717,0.827009,0.000115140305,0.000027374628,0.00020866285,0.0023566324,0.00053483265,0.0030380944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956506,0.00005927684,0.00003045981,0.00012372664,0.00016589584,0.000055578585],"domain_scores_gemma":[0.9995283,0.00008106964,0.00003707736,0.00012877326,0.00019190837,0.00003285893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046148864,0.0007766914,0.0005939847,0.0013052436,0.0008788882,0.0009752227,0.0017013452,0.0006308645,0.003659551],"category_scores_gemma":[0.0013647901,0.00033266167,0.00059943245,0.0016609479,0.00042341568,0.0018387072,0.001495216,0.00071938935,0.00135582],"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.000406195,0.0001437107,0.0011815714,0.00019572485,0.00007573831,0.00016096294,0.00020560906,0.365784,0.033075865,0.025343413,0.02596048,0.5474667],"study_design_scores_gemma":[0.00003402364,0.000020173764,0.0001783468,0.000008096627,0.000007093661,0.00004766992,0.0000498548,0.97751266,0.007260294,0.009962995,0.00490829,0.0000104479905],"about_ca_topic_score_codex":0.009780832,"about_ca_topic_score_gemma":0.010408378,"teacher_disagreement_score":0.009780832,"about_ca_system_score_codex":0.0011072461,"about_ca_system_score_gemma":0.0013454433,"threshold_uncertainty_score":0.019447803},"labels":[],"label_agreement":null},{"id":"W2519402035","doi":"10.1002/cpe.3948","title":"Characteristics analysis and optimization design of entities collaboration for cloud manufacturing","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Digital Transformation in Industry","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Cloud manufacturing; Computer science; Cloud computing; Cluster analysis; Selection (genetic algorithm); Node (physics); Cluster (spacecraft); Process (computing); Preference; Production (economics); Industrial engineering; Artificial intelligence; Computer network","score_opus":0.021603656280081412,"score_gpt":0.27541811114900516,"score_spread":0.25381445486892373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519402035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51589704,0.00024458548,0.4729011,0.0003442146,0.000017979983,0.00017334711,0.00017413814,0.0001930788,0.0100544505],"genre_scores_gemma":[0.9751023,0.000061843624,0.023897136,0.000011742558,0.000004300801,0.000056242825,0.00009020663,0.000015119139,0.0007611958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869955,0.00043935186,0.000066441615,0.0002254851,0.00033174618,0.00023733306],"domain_scores_gemma":[0.99741334,0.00096434064,0.00054718484,0.00026382494,0.0006010028,0.00021029146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013511318,0.00036835356,0.000448682,0.00087796425,0.0006860639,0.0010475132,0.0008390673,0.000425553,0.0019065657],"category_scores_gemma":[0.004395948,0.00025677204,0.00071740703,0.0009967757,0.00040853667,0.0011232028,0.00076806603,0.00035116632,0.00015841024],"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.00017983773,0.000083434265,0.013516159,0.00010251126,0.00007541253,0.00026620657,0.00020599864,0.90835553,0.010374664,0.03354947,0.00087628484,0.032414567],"study_design_scores_gemma":[0.00000784482,0.000042864263,0.0024337757,0.0000044228145,0.000019925694,0.00005394168,0.00010035998,0.990351,0.0019081868,0.004291746,0.0007788472,0.000006996244],"about_ca_topic_score_codex":0.0053265155,"about_ca_topic_score_gemma":0.0033424762,"teacher_disagreement_score":0.0053265155,"about_ca_system_score_codex":0.0015561745,"about_ca_system_score_gemma":0.0014820576,"threshold_uncertainty_score":0.011290848},"labels":[],"label_agreement":null},{"id":"W2528141713","doi":"10.1002/cpe.3966","title":"Increasing secret key capacity of OFDM systems: a geometric program approach","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Key (lock); Computer science; Orthogonal frequency-division multiplexing; Randomness; Key generation; Computer network; Channel (broadcasting); Mathematics; Computer security; Encryption","score_opus":0.03330636539040255,"score_gpt":0.2998832872455095,"score_spread":0.26657692185510695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528141713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13065892,0.0006479499,0.8437434,0.00056475494,0.000039390972,0.000042817504,0.00007552058,0.00015221526,0.02407505],"genre_scores_gemma":[0.96603805,0.0005766856,0.030615525,0.000075989505,0.00005617422,0.00006699396,0.0000438963,0.000044974146,0.0024816555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995789,0.00016238974,0.000009646609,0.000047542264,0.00012263257,0.000078896315],"domain_scores_gemma":[0.99822766,0.0012040514,0.00015159162,0.0001363177,0.00024098717,0.00003937806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006736048,0.00043592072,0.00037002415,0.00088555174,0.00033528334,0.0006972791,0.00040336442,0.0003518518,0.0029231177],"category_scores_gemma":[0.0030518498,0.00021464018,0.00036079963,0.00065076165,0.0012074237,0.0014400149,0.0007717645,0.00067556015,0.0002626885],"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.0000844045,0.000050616793,0.00060187257,0.00009190454,0.000025323883,0.0001960646,0.00013358737,0.5412016,0.012161585,0.41354424,0.0015316685,0.030377131],"study_design_scores_gemma":[0.0000032789976,0.000023142591,0.00011254596,0.000006684596,0.000004505725,0.00006150388,0.000017572238,0.9600979,0.0016114909,0.03744227,0.00061143516,0.0000076286915],"about_ca_topic_score_codex":0.0006369089,"about_ca_topic_score_gemma":0.0003456593,"teacher_disagreement_score":0.0029231177,"about_ca_system_score_codex":0.000839268,"about_ca_system_score_gemma":0.0005729915,"threshold_uncertainty_score":0.009778857},"labels":[],"label_agreement":null},{"id":"W2561635212","doi":"10.1002/cpe.4066","title":"Providing differentiated services, congestion management, and deadlock freedom in dragonfly networks with adaptive routing","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"FPInnovations","keywords":"Computer science; Distributed computing; Computer network; Network topology; Bottleneck; Static routing; Hierarchical routing; Policy-based routing; Network congestion; Deadlock; Dynamic Source Routing; Queueing theory; Routing domain; Routing (electronic design automation); Routing protocol; Network packet; Embedded system","score_opus":0.013776457186735088,"score_gpt":0.2517179663363386,"score_spread":0.2379415091496035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561635212","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6812016,0.00044354872,0.31064454,0.00042589306,0.000071615825,0.00009478167,0.00007135908,0.0011055314,0.005941074],"genre_scores_gemma":[0.9530972,0.000119962,0.04525375,0.0000504214,0.000009340642,0.000023803872,0.000056338635,0.00001850682,0.0013706657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975675,0.00006412657,0.000013085293,0.000038606737,0.00005648285,0.000070871116],"domain_scores_gemma":[0.9994771,0.00021426703,0.00004724424,0.0000985908,0.00010181173,0.00006085698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004111087,0.0003613981,0.00021647738,0.0005992042,0.0006828113,0.00051033136,0.0006117777,0.0003129662,0.0007432477],"category_scores_gemma":[0.0006963305,0.00010491269,0.00019144498,0.00035220114,0.00048590766,0.000664308,0.00060681294,0.00039368236,0.00007250004],"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.0010354735,0.00034918165,0.008288494,0.00016916331,0.000093360024,0.0006671606,0.0007463188,0.5798571,0.13071004,0.04231498,0.005478574,0.23029013],"study_design_scores_gemma":[0.000025817586,0.00014766675,0.00081445574,0.0000096386275,0.000020249368,0.00007739476,0.000098421406,0.9696349,0.020874836,0.0056771263,0.0025929573,0.000026588876],"about_ca_topic_score_codex":0.0075813658,"about_ca_topic_score_gemma":0.0073143467,"teacher_disagreement_score":0.0075813658,"about_ca_system_score_codex":0.0009404576,"about_ca_system_score_gemma":0.00048293328,"threshold_uncertainty_score":0.015074432},"labels":[],"label_agreement":null},{"id":"W2563968022","doi":"10.1002/cpe.4038","title":"A resource allocation game with restriction mechanism in VANET cloud","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Cloud computing; Computer science; Resource allocation; Vehicular ad hoc network; Game theory; Resource (disambiguation); Distributed computing; Resource management (computing); Computer network; Selfishness; Wireless ad hoc network; Telecommunications","score_opus":0.009035782838287496,"score_gpt":0.23979900242788002,"score_spread":0.23076321958959253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563968022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1989165,0.00033641513,0.7677299,0.001232973,0.000122334,0.00032480096,0.0001772653,0.0001449482,0.031014841],"genre_scores_gemma":[0.97912335,0.00011503337,0.015846783,0.000097862925,0.000017062837,0.0001325139,0.000028050636,0.000012511208,0.0046269586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988085,0.0005871044,0.0000458173,0.0001470374,0.00017141564,0.00024002384],"domain_scores_gemma":[0.9983246,0.0009830703,0.00018484879,0.00008154134,0.00019187387,0.00023409813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016790216,0.0006938295,0.0008609552,0.0005321583,0.0008587181,0.0014934295,0.0015622497,0.0012964279,0.0028894919],"category_scores_gemma":[0.003042211,0.00034386013,0.0007338231,0.0005632379,0.0014160217,0.0015998093,0.001510771,0.0013103642,0.00017728459],"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.00016966155,0.00007412947,0.00049072277,0.000054848308,0.00003814996,0.0003884831,0.00012231876,0.79234236,0.0022386562,0.19831038,0.001195487,0.0045748744],"study_design_scores_gemma":[0.000020347661,0.00002512112,0.00006268579,0.0000039256597,0.0000054094035,0.000028436192,0.000029935463,0.9874067,0.0001382674,0.011914168,0.00035571845,0.0000093608205],"about_ca_topic_score_codex":0.008135491,"about_ca_topic_score_gemma":0.003603649,"teacher_disagreement_score":0.008135491,"about_ca_system_score_codex":0.0019761738,"about_ca_system_score_gemma":0.0017446887,"threshold_uncertainty_score":0.016176283},"labels":[],"label_agreement":null},{"id":"W2593000752","doi":"10.1002/cpe.4084","title":"Investigating device‐specific visual feedback for cross‐device transfer in table‐centric multisurface environments","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Human–computer interaction; Usability; Transfer (computing); Workspace; Visual feedback; Table (database); Haptic technology; Bridge (graph theory); Multimedia; Interface (matter); Operating system; Artificial intelligence; Database","score_opus":0.045903951561012825,"score_gpt":0.37333092638983856,"score_spread":0.3274269748288257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593000752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9718472,0.00011011503,0.025092522,0.00006509681,0.000015200865,0.00008954782,0.000020670515,0.00014737886,0.0026124313],"genre_scores_gemma":[0.9880014,0.000080278434,0.011059028,0.000027861262,0.000005304449,0.00006528464,0.000018496945,0.000026774962,0.0007154717],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990376,0.0005258704,0.000046457604,0.00008561829,0.00021632844,0.00008824601],"domain_scores_gemma":[0.9937921,0.0049550356,0.00025323647,0.0003950866,0.00048488387,0.00011958051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014390731,0.00045369723,0.000269547,0.00040955594,0.00030352996,0.0008258007,0.0005643527,0.0005080696,0.0027328883],"category_scores_gemma":[0.008223854,0.00022208472,0.00031396648,0.00024902634,0.00045444045,0.0011012165,0.0014167683,0.00044899603,0.00019024254],"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.0014349037,0.0016700459,0.01674779,0.0022885131,0.000108865046,0.0011088033,0.040723577,0.014650201,0.5460518,0.0038815069,0.0015850675,0.36974898],"study_design_scores_gemma":[0.0005654413,0.016538097,0.19284736,0.0007543291,0.0004687923,0.0031104302,0.037959114,0.124597244,0.5880611,0.0054857507,0.029274715,0.00033766005],"about_ca_topic_score_codex":0.00051342667,"about_ca_topic_score_gemma":0.00055871316,"teacher_disagreement_score":0.0027328883,"about_ca_system_score_codex":0.0002731966,"about_ca_system_score_gemma":0.00026028595,"threshold_uncertainty_score":0.009142458},"labels":[],"label_agreement":null},{"id":"W2594266659","doi":"10.1002/cpe.4069","title":"Hardware‐assisted software event tracing","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tracing; Computer science; x86; Debugging; Embedded system; Software; Overhead (engineering); Memory footprint; Operating system; Computer hardware","score_opus":0.03195901466201988,"score_gpt":0.3455792680153101,"score_spread":0.3136202533532902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594266659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3068067,0.0005337831,0.62472004,0.0003012563,0.00017238529,0.0001616176,0.00041644397,0.052322153,0.014565584],"genre_scores_gemma":[0.8782973,0.000111615096,0.11590025,0.00006196056,0.00002373958,0.000036293666,0.00039282316,0.00059451064,0.004581439],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990977,0.00014484115,0.00005263699,0.000112441405,0.00045058003,0.00014188436],"domain_scores_gemma":[0.9969388,0.0009094508,0.00028423007,0.0010691393,0.0006949221,0.00010341983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000625762,0.00049713976,0.00028856876,0.0007646796,0.00024623144,0.0006056795,0.0011323116,0.00027410637,0.0057810163],"category_scores_gemma":[0.0030896668,0.00023280465,0.00026680148,0.00045370916,0.00033929903,0.00067615596,0.0006026122,0.00060373644,0.00078730466],"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.0014507318,0.00021824843,0.016472416,0.0004589819,0.000088699984,0.00029091092,0.00036953072,0.15877783,0.18153119,0.011958096,0.01410531,0.614278],"study_design_scores_gemma":[0.00012454798,0.0005136157,0.004734559,0.000054637276,0.000051122286,0.0002789592,0.00005070878,0.7734247,0.18932833,0.0030148693,0.028356697,0.00006724649],"about_ca_topic_score_codex":0.004769221,"about_ca_topic_score_gemma":0.0043137395,"teacher_disagreement_score":0.0057810163,"about_ca_system_score_codex":0.0006799741,"about_ca_system_score_gemma":0.0014162867,"threshold_uncertainty_score":0.019339442},"labels":[],"label_agreement":null},{"id":"W2603399189","doi":"10.1002/cpe.4068","title":"Multi‐scale navigation of large trace data: A survey","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"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; TRACE (psycholinguistics); Visualization; Tracing; Correctness; Software visualization; Data science; Scale (ratio); Data visualization; Heuristics; Data structure; Field (mathematics); Data mining; Software; Software system; Programming language; Component-based software engineering","score_opus":0.0727773124512009,"score_gpt":0.40216154067841786,"score_spread":0.32938422822721697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603399189","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039801273,0.27294886,0.6446803,0.005868901,0.00057396654,0.00030067674,0.0029818509,0.016203566,0.016640576],"genre_scores_gemma":[0.25974637,0.31083918,0.40940234,0.00088544097,0.00086718786,0.00040311215,0.00869582,0.003320532,0.005840011],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963672,0.00075951096,0.0003497639,0.000609696,0.0017523924,0.00016132044],"domain_scores_gemma":[0.9814084,0.010598566,0.0012188277,0.0021093655,0.0041184854,0.00054630055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003888512,0.0009599943,0.001164159,0.009618287,0.0006828109,0.004178143,0.0034865409,0.0010647482,0.0028120913],"category_scores_gemma":[0.016203221,0.00086831144,0.0009787597,0.013054322,0.0009256808,0.0073574176,0.002134692,0.0012134613,0.0012820195],"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.00007380787,0.00007836064,0.008136763,0.0035940134,0.000079360885,0.00015104897,0.0016312341,0.005549203,0.002266941,0.012678006,0.016044348,0.94971687],"study_design_scores_gemma":[0.000052189145,0.00028057184,0.019550858,0.0077345353,0.00026737625,0.002611129,0.0052466937,0.076059155,0.016474525,0.05222594,0.81912905,0.00036801494],"about_ca_topic_score_codex":0.0056146244,"about_ca_topic_score_gemma":0.0029484986,"teacher_disagreement_score":0.009618287,"about_ca_system_score_codex":0.00072261255,"about_ca_system_score_gemma":0.0018961771,"threshold_uncertainty_score":0.020564675},"labels":[],"label_agreement":null},{"id":"W2611615090","doi":"10.1002/cpe.4136","title":"A reflection on the origins, evolution, and future of PRAGMA","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centro Nacional de Investigaciones Cardiovasculares; Global Lake Ecological Observatory Network; National Institute of Advanced Industrial Science and Technology; National Science Foundation","keywords":"Reflection (computer programming); Context (archaeology); Set (abstract data type); Engineering ethics; Critical reflection; Computer science; Sociology; Political science; Data science; Epistemology; Engineering; History; Pedagogy; Philosophy; Archaeology","score_opus":0.047920238820822685,"score_gpt":0.352661256295408,"score_spread":0.3047410174745853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611615090","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007508461,0.020431366,0.10606334,0.7998302,0.018001206,0.000054330452,0.00008726983,0.00045036117,0.047573507],"genre_scores_gemma":[0.59209496,0.05126627,0.12862448,0.12017898,0.026295159,0.00045410587,0.0002599663,0.0029314903,0.07789462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.95034266,0.036056567,0.0016008028,0.004511964,0.0059061935,0.0015817774],"domain_scores_gemma":[0.89785653,0.074056275,0.002264859,0.011440515,0.011258947,0.0031228908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.048813038,0.00095528347,0.0012161232,0.0021488438,0.005589784,0.019653551,0.0036040277,0.007340436,0.0068938057],"category_scores_gemma":[0.07177971,0.0008673514,0.00094465195,0.002355883,0.042341158,0.046964683,0.009908738,0.027679939,0.001958942],"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.000050152394,0.0000251283,0.00011377858,0.00015343573,0.000011888109,0.00013593612,0.039071504,0.0006818419,0.00046086594,0.8914503,0.04424608,0.023599226],"study_design_scores_gemma":[0.000019309931,0.000042746313,0.00009905329,0.0004921533,0.0000074745776,0.00024970388,0.010988674,0.0014010812,0.0006130662,0.26636213,0.7196591,0.000065581204],"about_ca_topic_score_codex":0.0042248536,"about_ca_topic_score_gemma":0.002236612,"teacher_disagreement_score":0.048813038,"about_ca_system_score_codex":0.009125473,"about_ca_system_score_gemma":0.0067167985,"threshold_uncertainty_score":0.25815105},"labels":[],"label_agreement":null},{"id":"W2611943955","doi":"10.1002/cpe.4149","title":"Semi‐asynchronous approximate parallel DEVS simulation of web search engines","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Universidad de Santiago de Chile","keywords":"DEVS; Computer science; Asynchronous communication; Discrete event simulation; Distributed computing; Formalism (music); Parallel computing; Modeling and simulation; Simulation","score_opus":0.13975653021478618,"score_gpt":0.47950619188193294,"score_spread":0.33974966166714676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611943955","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7450813,0.00014450043,0.24095023,0.00036942223,0.000048483955,0.0000800825,0.00030596054,0.00068498385,0.012334954],"genre_scores_gemma":[0.9871228,0.000035353096,0.012014342,0.000017845754,0.0000050362287,0.0000407869,0.00008628882,0.000021765834,0.00065567176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969614,0.00012931266,0.00001734996,0.00002627805,0.00008478696,0.000046172798],"domain_scores_gemma":[0.998923,0.0006446352,0.00008361106,0.00013606639,0.00013860353,0.00007406153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006245905,0.00027852922,0.0005476022,0.0003206857,0.00036693187,0.0007959927,0.0008578562,0.0005180185,0.0011306485],"category_scores_gemma":[0.002254315,0.0002566492,0.00040847104,0.0004157717,0.00063431886,0.00047840647,0.0006054484,0.00048440538,0.00012433404],"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.000056593406,0.000014664291,0.0008276101,0.00001107171,0.00000677776,0.000025850472,0.000017867582,0.9942538,0.0007329706,0.0027175564,0.00006370685,0.001271452],"study_design_scores_gemma":[0.0000046618607,0.0000041499925,0.00005397211,3.944585e-7,8.4628635e-7,0.0000017593903,0.0000031078623,0.9993789,0.00016305783,0.00034235022,0.00004582188,8.610492e-7],"about_ca_topic_score_codex":0.011247541,"about_ca_topic_score_gemma":0.0044237804,"teacher_disagreement_score":0.011247541,"about_ca_system_score_codex":0.00079788174,"about_ca_system_score_gemma":0.0008119901,"threshold_uncertainty_score":0.02236414},"labels":[],"label_agreement":null},{"id":"W2625551154","doi":"10.1002/cpe.4215","title":"Special issue on Big Data Security and Intelligent Data in Clouds (<scp>BDS‐IDC</scp>)","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Big Data and Digital Economy","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Big data; Cloud computing; Computer science; Cloud computing security; Computer security; Implementation; Data security; Data science; Encryption; Data mining; Software engineering; Operating system","score_opus":0.14002493384737225,"score_gpt":0.37323813842310266,"score_spread":0.23321320457573042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625551154","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048841105,0.011953435,0.0013252323,0.022582613,0.9249796,0.00023868447,0.0010757572,0.00069341116,0.036662932],"genre_scores_gemma":[0.0020107073,0.014773834,0.0007225449,0.012849133,0.872411,0.00019327097,0.0015756958,0.00066708785,0.09479674],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99644417,0.00030902136,0.00034605848,0.00061755837,0.0018396395,0.00044356077],"domain_scores_gemma":[0.98598355,0.0026657996,0.0011453637,0.00081155926,0.0058796336,0.0035140298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025565687,0.0025389125,0.0031378262,0.0043803025,0.0032334663,0.011214366,0.0031455217,0.0055823573,0.09157542],"category_scores_gemma":[0.006890659,0.0009647999,0.0016723458,0.003038628,0.0014142407,0.005806357,0.0030468295,0.0054584644,0.051632877],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038641152,0.000030317437,0.00011344719,0.00024054662,0.000012476009,0.00006775876,0.0000107612905,0.00005923482,0.00031265605,0.0004493351,0.98070335,0.017961469],"study_design_scores_gemma":[0.000011492461,0.000042459364,0.0004962995,0.00018656303,0.000011756204,0.0001508491,0.000018686636,0.00023965337,0.00022529632,0.00048167515,0.9981213,0.000013894386],"about_ca_topic_score_codex":0.0020787013,"about_ca_topic_score_gemma":0.004296619,"teacher_disagreement_score":0.09157542,"about_ca_system_score_codex":0.0026181666,"about_ca_system_score_gemma":0.0033232174,"threshold_uncertainty_score":0.3063503},"labels":[],"label_agreement":null},{"id":"W2734326530","doi":"10.1002/cpe.4222","title":"Accelerating Apache Spark with FPGAs","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Software portability; SPARK (programming language); Computer science; Field-programmable gate array; Java; Big data; Embedded system; Operating system; Programming language","score_opus":0.04357597152681141,"score_gpt":0.32581465557173206,"score_spread":0.28223868404492064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734326530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22647044,0.0030640753,0.47265148,0.0028071813,0.0030957146,0.0005305298,0.0042089573,0.13263121,0.15454043],"genre_scores_gemma":[0.738285,0.0012254252,0.23302905,0.00048681465,0.0002378397,0.00024448297,0.0063420837,0.002969977,0.017179377],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989573,0.0001510221,0.00005830717,0.00015695581,0.0004545948,0.0002218751],"domain_scores_gemma":[0.99899524,0.00019606791,0.000043887445,0.00024366955,0.00038006945,0.00014107232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010463374,0.0007029256,0.0004233765,0.0006140235,0.0004279893,0.0010587702,0.0012838274,0.0002822821,0.007931335],"category_scores_gemma":[0.002342555,0.00038170922,0.000500519,0.0007852962,0.0003047016,0.0010243967,0.0010118497,0.00082796474,0.003849259],"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.003754541,0.0003764424,0.011312206,0.0008316649,0.0002907823,0.0011858047,0.0005961353,0.17980577,0.056519616,0.041448314,0.2800537,0.42382506],"study_design_scores_gemma":[0.0009194267,0.00059092767,0.004812722,0.00015541805,0.00010930198,0.00043131394,0.00029829468,0.58871806,0.077611916,0.022256251,0.30393612,0.00016025692],"about_ca_topic_score_codex":0.004385496,"about_ca_topic_score_gemma":0.003583902,"teacher_disagreement_score":0.007931335,"about_ca_system_score_codex":0.00066160224,"about_ca_system_score_gemma":0.0011126773,"threshold_uncertainty_score":0.026532888},"labels":[],"label_agreement":null},{"id":"W2735305329","doi":"10.1002/cpe.4207","title":"Targeted content dissemination in mobile social networks taking account of resource limitation","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Computer science; Exploit; Relay; Computer network; Mobile social network; Scheduling (production processes); Overhead (engineering); Limiting; Mobile computing; Computer security","score_opus":0.05854052715219711,"score_gpt":0.3522446911425863,"score_spread":0.2937041639903892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735305329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17515853,0.0006764595,0.8166169,0.00044684837,0.000061182305,0.00016893684,0.000064033564,0.0005115284,0.0062955627],"genre_scores_gemma":[0.9235021,0.00023847233,0.07431932,0.000054331205,0.000031953074,0.00008122827,0.00004710403,0.000027731146,0.0016979686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940586,0.0002452593,0.000026531665,0.00008783428,0.0001579114,0.00007664624],"domain_scores_gemma":[0.99782395,0.0013820408,0.00020087663,0.00022150823,0.0002575787,0.00011411252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010701546,0.00038943713,0.0006490861,0.0007906669,0.0007477115,0.00075254636,0.00082256075,0.000627339,0.000746227],"category_scores_gemma":[0.003383793,0.0002775971,0.00048803666,0.0006774108,0.0003741707,0.001191524,0.0009396573,0.00041683827,0.00012720183],"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.00025584974,0.00017019469,0.002763683,0.00023258642,0.00011222502,0.0008644931,0.00048758113,0.7686224,0.030244071,0.05940104,0.0026430124,0.13420284],"study_design_scores_gemma":[0.000018610175,0.00004704126,0.0002913351,0.0000074640343,0.000024876581,0.00010624494,0.000061920604,0.9820057,0.002227015,0.013341425,0.001860392,0.0000080063355],"about_ca_topic_score_codex":0.0025492022,"about_ca_topic_score_gemma":0.0023417918,"teacher_disagreement_score":0.0025492022,"about_ca_system_score_codex":0.0009351933,"about_ca_system_score_gemma":0.00072571216,"threshold_uncertainty_score":0.006785333},"labels":[],"label_agreement":null},{"id":"W2758674126","doi":"10.1002/cpe.4183","title":"Fast mutual exclusion by the Triangle algorithm","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mutual exclusion; Thread (computing); Computer science; Critical section; Software; Algorithm; Lock (firearm); Parallel computing; Linux kernel; Theoretical computer science; Operating system","score_opus":0.021763926036587677,"score_gpt":0.326384382161828,"score_spread":0.30462045612524036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758674126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018202282,0.0002545948,0.9698747,0.00031047233,0.00015049412,0.00007994848,0.00004409485,0.0014673984,0.009616063],"genre_scores_gemma":[0.40160024,0.000268006,0.58564675,0.0002180661,0.00012967749,0.0002466572,0.00027152977,0.00046371535,0.011155363],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836344,0.00039872344,0.00010154545,0.00022897396,0.00067676924,0.00023063408],"domain_scores_gemma":[0.997542,0.0008656274,0.00017172628,0.00062755705,0.00063978625,0.0001533327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012074204,0.00050827203,0.0007551285,0.00082577905,0.00087769155,0.001072053,0.0017716367,0.0006882193,0.0068199034],"category_scores_gemma":[0.0049226577,0.00024669577,0.0005334897,0.0010236246,0.00082016375,0.0018496237,0.00232361,0.0011856491,0.0017050073],"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.0010273879,0.00017022493,0.0013243415,0.00023930911,0.00006982234,0.00014339667,0.00035108594,0.19578212,0.017642295,0.24618232,0.016397642,0.5206701],"study_design_scores_gemma":[0.00013175268,0.00010057456,0.00011174476,0.000020438863,0.000013045754,0.000094468254,0.000037052945,0.91237974,0.0061939857,0.06751441,0.013381191,0.000021580994],"about_ca_topic_score_codex":0.002619817,"about_ca_topic_score_gemma":0.0024212294,"teacher_disagreement_score":0.0068199034,"about_ca_system_score_codex":0.0009505262,"about_ca_system_score_gemma":0.0014951556,"threshold_uncertainty_score":0.02281487},"labels":[],"label_agreement":null},{"id":"W2760976117","doi":"10.1002/cpe.4338","title":"Dynamic formation of service communities in the cloud under distribution and incomplete information settings","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cégep Marie-Victorin; Concordia University; Maple Leaf Foods","funders":"","keywords":"Cloud computing; Computer science; Visibility; Set (abstract data type); Service (business); Process (computing); Complete information; Data science; Data mining; Operations research; Engineering; Business; Geography; Mathematics","score_opus":0.023142043318403985,"score_gpt":0.3021808909044797,"score_spread":0.2790388475860757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760976117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6163207,0.00032419313,0.37765542,0.001643441,0.000029487464,0.00027266677,0.00039060388,0.0003045614,0.0030589446],"genre_scores_gemma":[0.9635951,0.000060550326,0.03553123,0.00004639487,0.000011159006,0.000056283556,0.00017020412,0.000014922848,0.00051410106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637955,0.0014930248,0.00014892776,0.00082062156,0.00052894634,0.0006289188],"domain_scores_gemma":[0.97908086,0.013591997,0.0027964646,0.0014260988,0.0014543745,0.0016501155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007274886,0.0005715243,0.0013539252,0.00146018,0.0018918935,0.0026176847,0.0023319277,0.0013671839,0.0012231033],"category_scores_gemma":[0.021974571,0.00058664824,0.00086058205,0.0014263387,0.0016210094,0.0034524966,0.0024962195,0.0013957735,0.00014354388],"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.00030571898,0.00016705417,0.010196738,0.00006723907,0.000079060774,0.00027556106,0.00035419187,0.9354596,0.0011772403,0.026074015,0.0010341906,0.024809374],"study_design_scores_gemma":[0.000019269984,0.000012901746,0.0006593163,0.0000042281154,0.000007281823,0.000019912153,0.00010600573,0.9885725,0.00027177043,0.010093592,0.00022728696,0.0000059760105],"about_ca_topic_score_codex":0.018700806,"about_ca_topic_score_gemma":0.010712464,"teacher_disagreement_score":0.018700806,"about_ca_system_score_codex":0.0040645883,"about_ca_system_score_gemma":0.0028027378,"threshold_uncertainty_score":0.038473725},"labels":[],"label_agreement":null},{"id":"W2777032998","doi":"10.1002/cpe.4397","title":"Improving performance of transactional memory through machine learning","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Transactional memory; Software transactional memory; Benchmark (surveying); Exploit; Overhead (engineering); Parallel computing; Database transaction; Software; Embedded system; Distributed computing; Operating system; Database","score_opus":0.023908557378091763,"score_gpt":0.30670713754821877,"score_spread":0.282798580170127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777032998","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5916828,0.0035260639,0.38894904,0.0010152458,0.00013485443,0.00009521851,0.00025748665,0.009474346,0.0048648682],"genre_scores_gemma":[0.8937047,0.00030280135,0.10463502,0.000101990794,0.000044036417,0.000045407945,0.00025564086,0.00013182501,0.00077856274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998885,0.00031454468,0.000090833,0.0002657162,0.00033093808,0.000113060305],"domain_scores_gemma":[0.995904,0.002104621,0.00044103013,0.00057550333,0.0008778948,0.00009687859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014835685,0.0008523648,0.0006872218,0.001028373,0.00034366068,0.000856717,0.0013548881,0.000409202,0.0011346705],"category_scores_gemma":[0.0052179545,0.0002611435,0.00041534766,0.0010945591,0.000367125,0.0014178718,0.00039244542,0.0009909752,0.00035124668],"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.00045235798,0.0004135356,0.012795396,0.0001419288,0.00010656062,0.000047867386,0.00003528793,0.5236889,0.019273346,0.0013983959,0.0029673942,0.43867892],"study_design_scores_gemma":[0.000007513802,0.00004399452,0.00045422494,0.0000038042306,0.000009786808,0.000007066316,0.0000058904334,0.9939512,0.0046050884,0.00069251953,0.00021404943,0.0000048594243],"about_ca_topic_score_codex":0.004137324,"about_ca_topic_score_gemma":0.003974636,"teacher_disagreement_score":0.004137324,"about_ca_system_score_codex":0.00079940795,"about_ca_system_score_gemma":0.0011664013,"threshold_uncertainty_score":0.008226514},"labels":[],"label_agreement":null},{"id":"W2783627778","doi":"10.1002/cpe.4414","title":"Special issue on social network security and privacy","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Digital and Cyber Forensics","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Internet privacy; Computer security; Animation; World Wide Web; Computer graphics (images)","score_opus":0.02356987452473387,"score_gpt":0.31510290985490697,"score_spread":0.2915330353301731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783627778","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004867031,0.031128185,0.0013263577,0.052007213,0.8552988,0.0001379872,0.000913098,0.00036042914,0.05834127],"genre_scores_gemma":[0.0031160004,0.019188149,0.00042717552,0.007291157,0.8309411,0.00016296704,0.0012300196,0.0004857569,0.1371576],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969649,0.00033677978,0.00022222103,0.00046418424,0.0015677225,0.00044421092],"domain_scores_gemma":[0.9895627,0.0027658942,0.00075297314,0.0009131634,0.003407602,0.002597653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034402478,0.0033145284,0.00366476,0.0101905735,0.003953653,0.0109016495,0.002149334,0.006059949,0.14039275],"category_scores_gemma":[0.008339559,0.000987513,0.0021577473,0.005774615,0.0015617366,0.006334208,0.0048566773,0.006168223,0.04591348],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015548594,0.000017653729,0.000056354664,0.00011206586,0.00000835229,0.00003408581,0.000012847562,0.000045510656,0.0000632486,0.0011288666,0.9879166,0.010588866],"study_design_scores_gemma":[0.000016667325,0.000029052697,0.000514107,0.00029769857,0.000016605733,0.00008180288,0.00004607441,0.00019894117,0.0000731542,0.0028124852,0.99590343,0.0000101573305],"about_ca_topic_score_codex":0.0018594293,"about_ca_topic_score_gemma":0.0035524634,"teacher_disagreement_score":0.14039275,"about_ca_system_score_codex":0.0038902154,"about_ca_system_score_gemma":0.0037976997,"threshold_uncertainty_score":0.46966052},"labels":[],"label_agreement":null},{"id":"W2786902291","doi":"10.1002/cpe.4475","title":"High‐contention mutual exclusion by elevator algorithms","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mutual exclusion; Thread (computing); Critical section; Algorithm; Software; Parallel computing; Concurrency; Operating system; Theoretical computer science","score_opus":0.016763403937617015,"score_gpt":0.30754542772180704,"score_spread":0.29078202378419005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786902291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12818685,0.00072775147,0.85465693,0.00042944794,0.00014218499,0.000089807174,0.00006996344,0.0031241719,0.012572859],"genre_scores_gemma":[0.66296595,0.00021003828,0.3303303,0.000109090375,0.000081614344,0.000103652055,0.00017222941,0.00021542027,0.005811693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986908,0.00039837408,0.000081518825,0.0001555726,0.00046968195,0.00020406517],"domain_scores_gemma":[0.9972108,0.0012253302,0.00022689925,0.00070785417,0.00048942,0.00013967385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011567991,0.00046282963,0.0006216345,0.00069182,0.00092277786,0.0010583078,0.0019298824,0.0005031569,0.0035957783],"category_scores_gemma":[0.0033862896,0.00025000912,0.00044140377,0.0007407375,0.00067977,0.0016030067,0.0017519672,0.00108782,0.0007052668],"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.0012667929,0.00030471024,0.0041348785,0.00025601342,0.00013849375,0.00016392735,0.00037934713,0.4686196,0.021405818,0.12227965,0.010398822,0.37065196],"study_design_scores_gemma":[0.000113197166,0.00007853675,0.00033871806,0.000014225639,0.000017885335,0.00007428715,0.000029997182,0.9560783,0.009746246,0.026564408,0.0069233403,0.000020831894],"about_ca_topic_score_codex":0.0016176092,"about_ca_topic_score_gemma":0.0023618303,"teacher_disagreement_score":0.0035957783,"about_ca_system_score_codex":0.0010475043,"about_ca_system_score_gemma":0.0014450441,"threshold_uncertainty_score":0.012029052},"labels":[],"label_agreement":null},{"id":"W2792569903","doi":"10.1002/cpe.4441","title":"Head‐of‐line blocking avoidance in Slim Fly networks using deadlock‐free non‐minimal and adaptive routing","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"FPInnovations","keywords":"Computer science; Computer network; Network topology; Distributed computing; Deadlock; Network performance; Network traffic control; Blocking (statistics); Network packet; Queueing theory","score_opus":0.042297635630294955,"score_gpt":0.33971773757415974,"score_spread":0.2974201019438648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792569903","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5661705,0.00021535269,0.42835554,0.00016971696,0.000045748893,0.00006737317,0.000077976685,0.0014287601,0.0034689202],"genre_scores_gemma":[0.9682142,0.00003727021,0.03103486,0.000028588325,0.0000052311757,0.00002158201,0.00004842056,0.000025622694,0.0005841478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997155,0.0000761404,0.000016089994,0.000047494148,0.0000606469,0.00008407952],"domain_scores_gemma":[0.99895954,0.00033277087,0.00018114642,0.00023018492,0.0001898516,0.00010650654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061530556,0.0003490755,0.00037646055,0.00061192765,0.00068774034,0.0006415219,0.0010004449,0.00030782758,0.000863533],"category_scores_gemma":[0.0012246555,0.00014662828,0.0002771507,0.0002793398,0.00051535683,0.0008216535,0.0009470165,0.00037889677,0.00009953791],"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.00081274915,0.00026024214,0.0039467565,0.00014584581,0.00008040717,0.00019697851,0.00023539475,0.8119804,0.05700467,0.030712768,0.0022865888,0.09233711],"study_design_scores_gemma":[0.000015762123,0.00015783297,0.000283988,0.0000074150157,0.000011853219,0.000041995267,0.000039616378,0.9846756,0.0094472505,0.004637485,0.0006697536,0.0000114543245],"about_ca_topic_score_codex":0.002891758,"about_ca_topic_score_gemma":0.0039872834,"teacher_disagreement_score":0.002891758,"about_ca_system_score_codex":0.0007808417,"about_ca_system_score_gemma":0.0007139552,"threshold_uncertainty_score":0.0057498813},"labels":[],"label_agreement":null},{"id":"W2799867926","doi":"10.1002/cpe.4473","title":"Distributed geometric nonnegative matrix factorization and hierarchical alternating least squares–based nonnegative tensor factorization with the MapReduce paradigm","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Wroclawskie Centrum Sieciowo-Superkomputerowe, Politechnika Wroclawska; Canadian Institute for Advanced Research","keywords":"Matrix decomposition; Non-negative matrix factorization; Multilinear map; Computer science; Factorization; Dimensionality reduction; Computation; Curse of dimensionality; Tensor (intrinsic definition); Matrix (chemical analysis); Algorithm; Mathematics; Artificial intelligence","score_opus":0.037413872453637066,"score_gpt":0.3647767161157716,"score_spread":0.32736284366213453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799867926","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004624022,0.00012169785,0.9941543,0.00014961441,0.00003721265,0.000019966708,0.000030204486,0.0001608179,0.0007021267],"genre_scores_gemma":[0.35272083,0.00044572024,0.6426056,0.00020360023,0.00022639512,0.00017892693,0.00040030768,0.00014900698,0.0030696518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988858,0.00039561474,0.000045643996,0.00024502486,0.0003245009,0.0001035253],"domain_scores_gemma":[0.99851865,0.0005084046,0.00016075814,0.0003133442,0.00040082762,0.00009799564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011973206,0.0009669266,0.0008079989,0.0005433407,0.0004961752,0.0008428507,0.0012967965,0.0005694103,0.001443167],"category_scores_gemma":[0.0036260053,0.00035531222,0.001095214,0.000898137,0.0010855374,0.0014898614,0.0013435667,0.0012667086,0.0005351056],"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.00017009558,0.00008343914,0.00076884055,0.00014871273,0.00008779325,0.00018189517,0.00013115132,0.7668295,0.009027572,0.090747096,0.006260643,0.12556326],"study_design_scores_gemma":[0.000005993362,0.0000124239,0.000064305365,0.0000024313301,0.0000038820394,0.000020895759,0.000011176995,0.97820216,0.00062732946,0.020163218,0.00087971543,0.0000064015244],"about_ca_topic_score_codex":0.0056469557,"about_ca_topic_score_gemma":0.0054057413,"teacher_disagreement_score":0.0056469557,"about_ca_system_score_codex":0.0006275938,"about_ca_system_score_gemma":0.0014481146,"threshold_uncertainty_score":0.011228144},"labels":[],"label_agreement":null},{"id":"W2885921739","doi":"10.1002/cpe.4776","title":"A hierarchical key pre‐distribution scheme for fog networks","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":16,"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":"University of Salford Manchester","keywords":"Computer science; Scalability; Key (lock); Overhead (engineering); Key management; Scheme (mathematics); Computer network; Distributed computing; Node (physics); Key distribution; Secure communication; Computer security; Public-key cryptography; Engineering; Encryption","score_opus":0.021204020065435494,"score_gpt":0.32660812199244355,"score_spread":0.30540410192700806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885921739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053699993,0.0003940054,0.93790096,0.00033218157,0.00014759079,0.0002561909,0.00014829905,0.0008783902,0.0062423167],"genre_scores_gemma":[0.8600987,0.00017229709,0.13541578,0.00017110551,0.000032958793,0.00011076699,0.00021057097,0.000031727795,0.0037561576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992495,0.00013336564,0.00006413934,0.00014737362,0.00022595357,0.00017968005],"domain_scores_gemma":[0.9991186,0.00012619277,0.00010929701,0.0004050924,0.00017475008,0.00006597638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006819681,0.000415453,0.00041345405,0.0004928685,0.00083067484,0.0007594969,0.0013092009,0.00055247656,0.00211886],"category_scores_gemma":[0.0013187797,0.0001891535,0.0004091004,0.00057015894,0.000670477,0.0020302518,0.0018363843,0.0009981324,0.00051788596],"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.0013359764,0.00027406524,0.0011983437,0.0003658787,0.000117140866,0.00047123793,0.00089451426,0.10925458,0.1853449,0.29536334,0.012716786,0.39266333],"study_design_scores_gemma":[0.00021186576,0.00056206016,0.0012637042,0.00006420545,0.00008828746,0.000674142,0.00023068275,0.7794494,0.097208485,0.08609589,0.033987924,0.00016347566],"about_ca_topic_score_codex":0.0014158154,"about_ca_topic_score_gemma":0.0013637338,"teacher_disagreement_score":0.00211886,"about_ca_system_score_codex":0.0012746407,"about_ca_system_score_gemma":0.0012280148,"threshold_uncertainty_score":0.009248257},"labels":[],"label_agreement":null},{"id":"W2888980102","doi":"10.1002/cpe.4667","title":"Design considerations for GPU‐aware collective communications in MPI","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; CUDA; Parallel computing; Message passing; Efficient energy use; Process (computing); Distributed computing; Operating system","score_opus":0.12639618549631798,"score_gpt":0.37804482261956185,"score_spread":0.25164863712324387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888980102","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14978819,0.0012102812,0.8157056,0.0029378226,0.00031782236,0.00013286222,0.0001191677,0.006896385,0.022891827],"genre_scores_gemma":[0.79592925,0.00034708733,0.19464566,0.00028295518,0.000099811215,0.00015724971,0.00015022742,0.0006569347,0.0077308044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99922466,0.00022363568,0.000041827512,0.00006978273,0.00031359628,0.00012645229],"domain_scores_gemma":[0.99874324,0.00035612652,0.00007136994,0.00034835,0.00039166602,0.00008927829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001011444,0.00031937193,0.00039365474,0.00036948305,0.0008283691,0.0013085584,0.0018760953,0.00054359453,0.002807167],"category_scores_gemma":[0.0030470395,0.00031271897,0.00030699465,0.00055562897,0.00051246816,0.0013808326,0.00084649114,0.0010571157,0.00093538675],"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.001079787,0.0003178649,0.010780554,0.00067046785,0.00015258628,0.0008534629,0.0013809041,0.271991,0.19024791,0.24598475,0.032386202,0.24415442],"study_design_scores_gemma":[0.00006818445,0.00023116005,0.00160523,0.00005309395,0.00005549667,0.00026092766,0.00024033267,0.8557526,0.059573196,0.033733003,0.04837032,0.000056492347],"about_ca_topic_score_codex":0.0029569722,"about_ca_topic_score_gemma":0.003788494,"teacher_disagreement_score":0.0029569722,"about_ca_system_score_codex":0.0008811329,"about_ca_system_score_gemma":0.0010506735,"threshold_uncertainty_score":0.009390891},"labels":[],"label_agreement":null},{"id":"W2893723147","doi":"10.1002/cpe.4862","title":"Communication‐aware message matching in MPI","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; Message queue; Message passing; Message Passing Interface; Speedup; Asynchronous communication; Scalability; Parallel computing; Queue; Matching (statistics); Distributed computing; Computer network; Operating system","score_opus":0.024626881156139355,"score_gpt":0.3474426032332346,"score_spread":0.32281572207709525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893723147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049193036,0.0005483663,0.9154059,0.00069686834,0.00021891213,0.00023368192,0.00022171132,0.02298957,0.010491856],"genre_scores_gemma":[0.61255264,0.00030946574,0.37369543,0.00041414722,0.00016219397,0.00040768873,0.00084440917,0.002119917,0.009494143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969554,0.00070282567,0.00028932607,0.0003368964,0.0013110767,0.00040449743],"domain_scores_gemma":[0.9966462,0.000794158,0.0002662322,0.0012841744,0.00084281166,0.00016637219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002054591,0.0006971389,0.0005901654,0.001053758,0.0013372819,0.0016363147,0.0028335992,0.0007948959,0.0032108312],"category_scores_gemma":[0.005739491,0.00047032244,0.00057538965,0.0013152751,0.0007526998,0.0025298405,0.0023644306,0.0013080873,0.000987266],"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.0015986813,0.00048895134,0.008973264,0.0007458672,0.00022963199,0.0005034702,0.0010220588,0.16671462,0.102851324,0.1272977,0.03622032,0.5533541],"study_design_scores_gemma":[0.00015471248,0.00027083076,0.0015024459,0.00004588062,0.00011286789,0.00019795354,0.00013224568,0.7501735,0.12159116,0.05367168,0.072022915,0.00012372823],"about_ca_topic_score_codex":0.0022247965,"about_ca_topic_score_gemma":0.0019032148,"teacher_disagreement_score":0.0032108312,"about_ca_system_score_codex":0.0010956883,"about_ca_system_score_gemma":0.0015993332,"threshold_uncertainty_score":0.0108658075},"labels":[],"label_agreement":null},{"id":"W2894493142","doi":"10.1002/cpe.4719","title":"RIN: A dynamic pseudonym change system for privacy in VANET","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pseudonym; Computer science; Vehicular ad hoc network; Anonymity; Computer security; Protocol (science); Computer network; Credibility; Intelligent transportation system; Wireless ad hoc network; Confidentiality; Telecommunications; Wireless","score_opus":0.023530763349734203,"score_gpt":0.30562076843279307,"score_spread":0.28209000508305887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894493142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01983529,0.00022416627,0.9712101,0.00055636506,0.00020676607,0.00037393643,0.00006549899,0.002066684,0.005461181],"genre_scores_gemma":[0.70992005,0.0003682066,0.27787024,0.00059163576,0.00016286844,0.00064717,0.00043120893,0.0002797831,0.009728868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99441755,0.0025384706,0.0005792704,0.00063850655,0.0014777833,0.0003483565],"domain_scores_gemma":[0.99624205,0.00095761515,0.00041856157,0.0013720952,0.00076303445,0.00024675197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048871837,0.00040545588,0.00061273354,0.0009258219,0.0012991787,0.0019937046,0.0022070643,0.0015604782,0.0023973363],"category_scores_gemma":[0.005755431,0.00033439812,0.0006761125,0.00054813875,0.0021216704,0.0049564987,0.0038797616,0.0024031992,0.0008533677],"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.0015324963,0.0003911782,0.0041467035,0.00058902625,0.00024152412,0.0018021539,0.0047530336,0.063947454,0.07887047,0.5219706,0.014047894,0.30770743],"study_design_scores_gemma":[0.00024766443,0.001035939,0.0012081354,0.00014497092,0.00016812704,0.002031996,0.00105558,0.6623261,0.08055282,0.10391591,0.14699359,0.00031911326],"about_ca_topic_score_codex":0.000786412,"about_ca_topic_score_gemma":0.0003896226,"teacher_disagreement_score":0.0048871837,"about_ca_system_score_codex":0.00083944626,"about_ca_system_score_gemma":0.0011237534,"threshold_uncertainty_score":0.025846183},"labels":[],"label_agreement":null},{"id":"W2895792075","doi":"10.1002/cpe.5035","title":"Optimal matching between energy saving and traffic load for mobile multimedia communication","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"National Natural Science Foundation of China","keywords":"Cellular network; Computer science; Operating expense; Cellular traffic; Maximization; Energy consumption; Computer network; Base station; Capital expenditure; Matching (statistics); Minification; Mobile telephony; Energy (signal processing); Efficient energy use; Telecommunications; Mobile radio; Engineering; Mathematical optimization","score_opus":0.016490010716010785,"score_gpt":0.3060330158584909,"score_spread":0.2895430051424801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895792075","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5225862,0.00050368963,0.4497167,0.0007090182,0.000052995678,0.00009361196,0.00015734615,0.00019225328,0.025988188],"genre_scores_gemma":[0.9904241,0.00006445573,0.008050258,0.00003285525,0.000011336368,0.000020466172,0.000023527815,0.000017274986,0.0013556087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998264,0.000052876905,0.000004642939,0.000029280263,0.000035157504,0.00005173434],"domain_scores_gemma":[0.9994703,0.00035680138,0.000047319987,0.000027659924,0.00006835909,0.000029576753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046489033,0.000369756,0.00038885174,0.00052409753,0.00022226838,0.0006964311,0.00040462342,0.00055442785,0.0021728808],"category_scores_gemma":[0.0022846784,0.00019656686,0.00019880479,0.0005254724,0.0003960572,0.0006336283,0.00054138683,0.00027439004,0.00022109131],"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.00012085536,0.000098138764,0.00094027375,0.000035307286,0.0000213884,0.000033935718,0.000023519455,0.9568182,0.0052088713,0.013454992,0.0009294136,0.022315193],"study_design_scores_gemma":[0.0000047272906,0.00002298822,0.00033802103,0.0000024968008,0.0000047990056,0.000008380405,0.000018282315,0.99385166,0.00095526915,0.004606266,0.00018399129,0.0000030969081],"about_ca_topic_score_codex":0.0015399393,"about_ca_topic_score_gemma":0.0014338188,"teacher_disagreement_score":0.0021728808,"about_ca_system_score_codex":0.00088415295,"about_ca_system_score_gemma":0.00051792467,"threshold_uncertainty_score":0.007269025},"labels":[],"label_agreement":null},{"id":"W2896055537","doi":"10.1002/cpe.5024","title":"A multi‐granularity locking scheme for java packedobjects based on a concurrent multiway tree","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of New Brunswick","funders":"Atlantic Canada Opportunities Agency; Center for Advanced Study, University of Illinois at Urbana-Champaign; New Brunswick Innovation Foundation; International Business Machines Corporation","keywords":"Computer science; Java; Granularity; Concurrent data structure; Tree (set theory); Java concurrency; Parallel computing; Synchronization (alternating current); Consistency (knowledge bases); Distributed computing; Data structure; Workload; Object (grammar); Operating system; Real time Java; Artificial intelligence","score_opus":0.04154552241589729,"score_gpt":0.3547900129040608,"score_spread":0.3132444904881635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896055537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07746359,0.00021365771,0.9145383,0.000087891916,0.00010570552,0.00015893449,0.000063992935,0.005295938,0.002071949],"genre_scores_gemma":[0.5886863,0.00011797174,0.40621024,0.0001378785,0.000041649222,0.00016660626,0.0002512416,0.0006096325,0.003778622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984274,0.00022647931,0.000229528,0.00022489735,0.0006798249,0.00021195525],"domain_scores_gemma":[0.99687374,0.0004600342,0.00025703784,0.0014110884,0.00074644154,0.00025164118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012792996,0.00027537651,0.00047267487,0.0007741732,0.0009272595,0.0012384021,0.0019229586,0.0004276098,0.0017745441],"category_scores_gemma":[0.0024763613,0.00031418985,0.00040453335,0.00077980175,0.0006857406,0.0020260408,0.0016184356,0.0007812012,0.0004527906],"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.0021827498,0.0005625676,0.008629394,0.0003505386,0.00014963432,0.00042161666,0.0012543475,0.08367521,0.26919878,0.08570321,0.0074491194,0.54042286],"study_design_scores_gemma":[0.00028430184,0.00073530705,0.0019763964,0.000042025527,0.000113478665,0.00038494478,0.00017267163,0.78363526,0.16370124,0.014808767,0.033989336,0.000156223],"about_ca_topic_score_codex":0.0031194773,"about_ca_topic_score_gemma":0.003208532,"teacher_disagreement_score":0.0031194773,"about_ca_system_score_codex":0.0008373756,"about_ca_system_score_gemma":0.0015807374,"threshold_uncertainty_score":0.0067656636},"labels":[],"label_agreement":null},{"id":"W2896435355","doi":"10.1002/cpe.5021","title":"Real‐time multiuser scheduling based on end‐user requirement using big data analytics","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"National Natural Science Foundation of China","keywords":"Computer science; Maximum throughput scheduling; Scheduling (production processes); Quality of service; Computer network; Wireless network; Wireless; Throughput; Fading; Distributed computing; Channel (broadcasting); Round-robin scheduling; Fair-share scheduling; Telecommunications; Engineering","score_opus":0.08366151756304095,"score_gpt":0.3472004218482463,"score_spread":0.2635389042852053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896435355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48093176,0.00023545302,0.5130355,0.00058520114,0.0000894921,0.00012696003,0.00022345457,0.0012786535,0.0034935796],"genre_scores_gemma":[0.98134124,0.000031787822,0.01827457,0.00002161443,0.000010070775,0.000020883519,0.00008880241,0.000020331832,0.00019063584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992398,0.00032036987,0.000052447234,0.00009713433,0.00020431196,0.000086031476],"domain_scores_gemma":[0.99350184,0.00439367,0.0003747695,0.00042862393,0.0009742442,0.00032684454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002501874,0.0005920821,0.00075393566,0.0006601262,0.00048248027,0.0008222022,0.0006857305,0.0003624689,0.0007283127],"category_scores_gemma":[0.005173652,0.00026763562,0.00025691456,0.00062368636,0.0003378274,0.0009286418,0.0004863335,0.0006286818,0.00010825923],"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.00071088946,0.00026129326,0.006507867,0.00007830064,0.000055796143,0.00019821088,0.0000929515,0.9307287,0.01121598,0.003431916,0.001373332,0.04534479],"study_design_scores_gemma":[0.0000024015553,0.000014558454,0.00030164796,7.288083e-7,0.0000020223238,0.0000057622287,0.000007262097,0.9981725,0.00093051867,0.00051485153,0.000044948138,0.0000027638775],"about_ca_topic_score_codex":0.0031858026,"about_ca_topic_score_gemma":0.0031023503,"teacher_disagreement_score":0.0031858026,"about_ca_system_score_codex":0.0007287216,"about_ca_system_score_gemma":0.00085933896,"threshold_uncertainty_score":0.013231337},"labels":[],"label_agreement":null},{"id":"W2900103250","doi":"10.1002/cpe.5074","title":"Pansharpening multispectral remote‐sensing images with guided filter for monitoring impact of human behavior on environment","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Image Fusion Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; Department of Science and Technology of Sichuan Province; Alberta Innovates - Health Solutions","keywords":"Panchromatic film; Multispectral image; Computer science; Artificial intelligence; Image fusion; Computer vision; Image resolution; Remote sensing; Redundancy (engineering); Hyperspectral imaging; Composite image filter; Filter (signal processing); Image (mathematics)","score_opus":0.035723690027471125,"score_gpt":0.3739108459302976,"score_spread":0.3381871559028265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900103250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28585517,0.0016517763,0.7029325,0.00030124772,0.0001555961,0.00011173807,0.00027074883,0.002779323,0.0059419526],"genre_scores_gemma":[0.60069907,0.0011906864,0.39388925,0.00028538585,0.000086091786,0.00007058845,0.00040266628,0.00017215214,0.0032040547],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999764,0.000024378138,0.000009442595,0.000047987953,0.0001300979,0.0000240009],"domain_scores_gemma":[0.9997366,0.000048733902,0.000042525073,0.000043790777,0.00011156993,0.000016815664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032688177,0.00057055685,0.00035942282,0.0013929968,0.00017546077,0.00034761097,0.00041857015,0.0004765552,0.0012944605],"category_scores_gemma":[0.0005049206,0.00024544203,0.000602848,0.0007296448,0.00022595839,0.0006754243,0.00037260025,0.00049009995,0.00043390028],"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.00044866762,0.00014636866,0.0030656117,0.0004084423,0.00011884842,0.00023018019,0.00019904769,0.024721941,0.47556743,0.0012123492,0.002866224,0.49101487],"study_design_scores_gemma":[0.00005736764,0.0003506434,0.022869805,0.00006141076,0.00023105693,0.0008057752,0.00020498426,0.6972251,0.26680347,0.0018030194,0.009462489,0.00012484382],"about_ca_topic_score_codex":0.0016159744,"about_ca_topic_score_gemma":0.0023102104,"teacher_disagreement_score":0.0016159744,"about_ca_system_score_codex":0.00021485148,"about_ca_system_score_gemma":0.00026262942,"threshold_uncertainty_score":0.0043303967},"labels":[],"label_agreement":null},{"id":"W2913493033","doi":"10.1002/cpe.5173","title":"An opcode‐based technique for polymorphic Internet of Things malware detection","year":2019,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":101,"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":"Opcode; Computer science; Malware; Internet of Things; The Internet; Computer security; World Wide Web; Operating system","score_opus":0.0161056960932537,"score_gpt":0.32302480902261166,"score_spread":0.306919112929358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913493033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4741755,0.00088797306,0.50793695,0.0003432963,0.00023506818,0.00027104266,0.0011199645,0.0065274644,0.008502744],"genre_scores_gemma":[0.82517034,0.0003155006,0.1710513,0.00007839124,0.00005034163,0.000102858554,0.00057965255,0.00009966921,0.0025519151],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995721,0.00003679998,0.000029824392,0.00006511587,0.0002539482,0.00004224211],"domain_scores_gemma":[0.99876875,0.00029385072,0.00030305135,0.00012944329,0.00045756032,0.000047375062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025744247,0.0004512947,0.00036421593,0.0033079218,0.0003295681,0.00040895087,0.00035132654,0.00035862566,0.0014023246],"category_scores_gemma":[0.0016454738,0.00014932649,0.00033350475,0.0012614718,0.0002753371,0.0004741017,0.0003605335,0.00036790458,0.0007812883],"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.0004004766,0.00017533192,0.026190775,0.0002527227,0.00008033545,0.00094912114,0.00018016894,0.0081195105,0.28306797,0.0024996963,0.0038508847,0.674233],"study_design_scores_gemma":[0.000027384907,0.00043597835,0.0490176,0.00009247362,0.000105150626,0.0064171148,0.00019599774,0.6208878,0.30283037,0.0040721605,0.015813509,0.00010444623],"about_ca_topic_score_codex":0.0012348114,"about_ca_topic_score_gemma":0.0016476702,"teacher_disagreement_score":0.0033079218,"about_ca_system_score_codex":0.00021442497,"about_ca_system_score_gemma":0.00033954787,"threshold_uncertainty_score":0.004691243},"labels":[],"label_agreement":null},{"id":"W2921252202","doi":"10.1002/cpe.5237","title":"An efficient virtual machine allocation algorithm for parallel and distributed simulation applications","year":2019,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Virtual machine; Latency (audio); Distributed computing; Execution time; Scheduling (production processes); Cloud computing; Synchronization (alternating current); Algorithm; Parallel computing; Operating system; Computer network","score_opus":0.013674758637341819,"score_gpt":0.31486774461260847,"score_spread":0.30119298597526667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921252202","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032079346,0.00016141695,0.9641912,0.00014449589,0.000057955138,0.000091124064,0.000038451897,0.0013263002,0.0019096665],"genre_scores_gemma":[0.5752843,0.000105894534,0.42185915,0.000070858405,0.000033754124,0.00022855384,0.00017429961,0.00010801978,0.0021351725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999468,0.00017622428,0.000038437196,0.00011456005,0.00011314982,0.00008948873],"domain_scores_gemma":[0.9995223,0.00019846162,0.00004460494,0.00006167245,0.00012933901,0.000043727563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009669141,0.0006095945,0.00076739036,0.00083396037,0.0006382436,0.0007073602,0.0010977163,0.0005442965,0.00224829],"category_scores_gemma":[0.0017730228,0.00033262392,0.00048502933,0.0007502786,0.00036523328,0.0007167243,0.0008206853,0.0007581938,0.0004362674],"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.00016094201,0.00009617374,0.0009350472,0.000032996886,0.000030213128,0.00003183865,0.000037693764,0.8730479,0.0037749594,0.00550748,0.0015575935,0.11478716],"study_design_scores_gemma":[0.000004728336,0.0000071577433,0.0000315277,6.1139957e-7,0.000001093396,0.0000032252726,0.0000023468922,0.9989716,0.00021714874,0.0005859676,0.00017356184,0.000001076885],"about_ca_topic_score_codex":0.0052741845,"about_ca_topic_score_gemma":0.0035991492,"teacher_disagreement_score":0.0052741845,"about_ca_system_score_codex":0.0008282267,"about_ca_system_score_gemma":0.0014361981,"threshold_uncertainty_score":0.01048696},"labels":[],"label_agreement":null},{"id":"W2927467691","doi":"10.1002/cpe.5252","title":"Deep learning models for diagnosing spleen and stomach diseases in smart Chinese medicine with cloud computing","year":2019,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"AI in cancer detection","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Cloud computing; Computer science; Spleen; Stomach; Deep learning; Modern medicine; Traditional Chinese medicine; Artificial intelligence; Medicine; Pathology; Internal medicine; Intensive care medicine","score_opus":0.019429412356215373,"score_gpt":0.31814882606554995,"score_spread":0.2987194137093346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2927467691","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5975427,0.0056952946,0.3811042,0.0053470638,0.00033577636,0.00015129041,0.001095464,0.0009370102,0.0077911657],"genre_scores_gemma":[0.9761564,0.0007890944,0.01969271,0.0002955376,0.000062887644,0.000045578494,0.00048646744,0.00001600954,0.0024552937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998103,0.000044488665,0.0000152183875,0.000042366206,0.000035942943,0.000051597523],"domain_scores_gemma":[0.9996189,0.00016213502,0.000041667365,0.000022470034,0.00012113094,0.00003355438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007778358,0.0004904696,0.00055106025,0.0006295323,0.00023516049,0.00074904907,0.0006303038,0.0007259972,0.0011541668],"category_scores_gemma":[0.0014757478,0.00021232542,0.00074520515,0.00052509137,0.0002845684,0.000503408,0.0005301072,0.0008591626,0.0001909462],"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.00038196432,0.00027305933,0.030542193,0.00013764347,0.00021425029,0.00029860565,0.00008644813,0.7959087,0.0027712937,0.0040573264,0.0060827457,0.15924573],"study_design_scores_gemma":[0.000003493721,0.000012132711,0.0007348847,0.000006080045,0.000009973454,0.000009895623,0.0000062565086,0.9983016,0.00020142486,0.0005659318,0.00014580325,0.0000023472203],"about_ca_topic_score_codex":0.024511255,"about_ca_topic_score_gemma":0.014359749,"teacher_disagreement_score":0.024511255,"about_ca_system_score_codex":0.00091090804,"about_ca_system_score_gemma":0.0012498708,"threshold_uncertainty_score":0.04873717},"labels":[],"label_agreement":null},{"id":"W2928103424","doi":"10.1002/cpe.5231","title":"LTTng‐HSA: Bringing LTTng tracing to HSA‐based GPU runtimes","year":2019,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tracing; TRACE (psycholinguistics); Profiling (computer programming); Kernel (algebra); Software; Operating system; Parallel computing","score_opus":0.01656622417478217,"score_gpt":0.3033139268613858,"score_spread":0.28674770268660366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2928103424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015486401,0.00020299402,0.7421607,0.0002993495,0.0002242591,0.00012216454,0.000749001,0.23402731,0.00672785],"genre_scores_gemma":[0.37358338,0.00042179946,0.53381133,0.00072553026,0.00013810745,0.00031742154,0.005395718,0.07271005,0.012896704],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99750024,0.00047090286,0.00019478801,0.00046742993,0.0010876398,0.0002789483],"domain_scores_gemma":[0.9960295,0.00077051163,0.00018375301,0.0020044236,0.0007366029,0.00027513792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001754856,0.0012405058,0.000661951,0.001461899,0.000681212,0.002574517,0.0030732593,0.00093339785,0.008971919],"category_scores_gemma":[0.007871071,0.0009184792,0.0011103346,0.0008098759,0.0011668929,0.0031046693,0.0038366218,0.0027752104,0.0034386432],"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.0015639602,0.00051100744,0.018026635,0.0007190441,0.00033400088,0.0009425903,0.0033374473,0.110176146,0.060684193,0.080326386,0.13254516,0.5908334],"study_design_scores_gemma":[0.0002006911,0.000227281,0.0032847738,0.0001795992,0.000077886805,0.0003223673,0.00022085014,0.68626416,0.07820874,0.0353491,0.19540516,0.00025947441],"about_ca_topic_score_codex":0.008289583,"about_ca_topic_score_gemma":0.007207535,"teacher_disagreement_score":0.008971919,"about_ca_system_score_codex":0.0013233878,"about_ca_system_score_gemma":0.0021685937,"threshold_uncertainty_score":0.030014098},"labels":[],"label_agreement":null},{"id":"W2936740280","doi":"10.1002/cpe.5205","title":"Model checking ontology‐driven reasoning agents using strategy and abstraction","year":2019,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Abstraction; Model checking; Linear temporal logic; Ontology; Programming language; Temporal logic; Encoding (memory); Exploit; Theoretical computer science; Artificial intelligence","score_opus":0.07800741567634234,"score_gpt":0.36752603295872555,"score_spread":0.2895186172823832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2936740280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045729276,0.000053028012,0.9509274,0.00016713598,0.000018853701,0.00013819848,0.00006831593,0.0013197602,0.001577878],"genre_scores_gemma":[0.6000159,0.00010598592,0.39774868,0.000114754934,0.000014592081,0.00026565744,0.00025735074,0.00020631563,0.0012707459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518025,0.0018020289,0.00044118354,0.0004838831,0.001604635,0.00048804717],"domain_scores_gemma":[0.9932621,0.004137208,0.00066646584,0.0011338027,0.00067530596,0.00012507927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050676647,0.0007158792,0.0010297309,0.0012431892,0.000727465,0.0027465615,0.0019400599,0.0010729572,0.0010956405],"category_scores_gemma":[0.01190131,0.00088981626,0.0028595466,0.00058969087,0.0029249291,0.0023700723,0.0024547603,0.001766803,0.00021928456],"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.00017122368,0.00012830667,0.00229681,0.00017916659,0.00016972101,0.0005219824,0.0007630118,0.69146925,0.013673954,0.2613712,0.000589281,0.028666124],"study_design_scores_gemma":[0.000046702582,0.000042770018,0.00012696034,0.000028445038,0.00004075411,0.00004105847,0.00005348404,0.94188374,0.0070687067,0.049277138,0.0013687327,0.000021432734],"about_ca_topic_score_codex":0.016745826,"about_ca_topic_score_gemma":0.013529883,"teacher_disagreement_score":0.016745826,"about_ca_system_score_codex":0.0023968164,"about_ca_system_score_gemma":0.003667388,"threshold_uncertainty_score":0.033296704},"labels":[],"label_agreement":null},{"id":"W2944543431","doi":"10.1002/cpe.5311","title":"Identification of Android malware using refined system calls","year":2019,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"European Commission; Intel Corporation; Silicon Valley Community Foundation","keywords":"Malware; System call; Opcode; Feature selection; Computer science; Android malware; Android (operating system); Data mining; Artificial intelligence; Machine learning; Computer security; Operating system","score_opus":0.016725939229347706,"score_gpt":0.32137278620779663,"score_spread":0.3046468469784489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944543431","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84257954,0.00042510565,0.1515475,0.0002177504,0.000043578206,0.00016364464,0.00073283573,0.0021225566,0.0021675043],"genre_scores_gemma":[0.96933025,0.00007416746,0.029481547,0.000023344106,0.000016957805,0.000042701333,0.00067656883,0.000018770794,0.00033572197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986945,0.00017395178,0.000110338515,0.00016340196,0.00074998214,0.00010781255],"domain_scores_gemma":[0.9967738,0.0012736686,0.0005152374,0.0003325013,0.0010115126,0.000093303934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064258353,0.0006321089,0.0006162229,0.003481333,0.000270441,0.0009522216,0.0003347876,0.0003654191,0.0003746213],"category_scores_gemma":[0.004111989,0.0001330366,0.00075188116,0.00090255076,0.00035926382,0.00064966356,0.0005104958,0.00050067314,0.00027790852],"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.000828734,0.00039986696,0.19519925,0.0004011905,0.00025172942,0.0010249214,0.00051314465,0.1399302,0.09819515,0.0036145027,0.0045055146,0.5551358],"study_design_scores_gemma":[0.000021760661,0.00029374709,0.08533588,0.00005103887,0.00010135066,0.0007176918,0.00018477872,0.86298025,0.04435355,0.002972074,0.0028982162,0.000089644374],"about_ca_topic_score_codex":0.0017488577,"about_ca_topic_score_gemma":0.0014762172,"teacher_disagreement_score":0.003481333,"about_ca_system_score_codex":0.00034112865,"about_ca_system_score_gemma":0.00049742206,"threshold_uncertainty_score":0.003477335},"labels":[],"label_agreement":null},{"id":"W2965627370","doi":"10.1002/cpe.5454","title":"Internet of Things ‐ integrated IR‐UWB technology for healthcare applications","year":2019,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Université du Québec à Chicoutimi","funders":"","keywords":"Body area network; Computer science; Wireless; Node (physics); Computer network; Wireless sensor network; Ultra-wideband; Channel (broadcasting); Physical layer; Telecommunications; Electronic engineering; Engineering","score_opus":0.014713538262144091,"score_gpt":0.29036538337381906,"score_spread":0.27565184511167495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965627370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07676268,0.024367781,0.74346995,0.005815971,0.0023999305,0.00031216766,0.00026826537,0.0024029834,0.14420027],"genre_scores_gemma":[0.76552427,0.012543824,0.17786197,0.002689768,0.0006206641,0.00021200492,0.00046296,0.00010026319,0.039984297],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99980766,0.000052719475,0.00001277171,0.000026818912,0.00007948265,0.000020616006],"domain_scores_gemma":[0.9998369,0.000043563854,0.000014479515,0.000020908046,0.00007052665,0.000013644093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003096661,0.0002225133,0.00014659837,0.0002442414,0.00016313227,0.00038717795,0.00033538882,0.0005207193,0.0033917993],"category_scores_gemma":[0.00034885193,0.000086917535,0.00019700178,0.00029890478,0.00014616066,0.0005252581,0.0002663666,0.00035614177,0.001191462],"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.00028683813,0.00015779988,0.0029010777,0.0009114563,0.00007145974,0.0010299918,0.0003229452,0.008464106,0.21262221,0.04173934,0.023861973,0.70763075],"study_design_scores_gemma":[0.00010836552,0.0019628797,0.009830974,0.0004963041,0.00021781816,0.006243745,0.00059516495,0.14117472,0.15767704,0.056912135,0.6246628,0.00011808634],"about_ca_topic_score_codex":0.00017625473,"about_ca_topic_score_gemma":0.00021349982,"teacher_disagreement_score":0.0033917993,"about_ca_system_score_codex":0.00014682277,"about_ca_system_score_gemma":0.00019341371,"threshold_uncertainty_score":0.011346698},"labels":[],"label_agreement":null},{"id":"W2981614872","doi":"10.1002/cpe.5530","title":"The modeling of urban rail transit emergency delay propagation scope under network operation mode","year":2019,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministry of Education and Child Care","funders":"National Key Research and Development Program of China; Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Urban rail transit; Reliability (semiconductor); Scope (computer science); Computer science; Mode (computer interface); Transit (satellite); Transport engineering; Public transport; Simulation; Engineering; Power (physics)","score_opus":0.024750118871127637,"score_gpt":0.3350850981481921,"score_spread":0.31033497927706444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981614872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5263629,0.00033694832,0.4574522,0.00033487804,0.000063117106,0.000051693918,0.00030179464,0.00037876476,0.014717666],"genre_scores_gemma":[0.99445724,0.000103313425,0.0022779452,0.0000070574847,0.0000054318944,0.000019232024,0.000047924346,0.000012542595,0.0030692432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986446,0.000033761786,0.0000051021552,0.000034049826,0.000025782681,0.000036860136],"domain_scores_gemma":[0.99974555,0.000103897204,0.000038831473,0.000013048435,0.00007947582,0.000019131912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003105969,0.00043281174,0.00025190966,0.00051875325,0.0003785677,0.00055787904,0.0006747758,0.0005257675,0.0018072047],"category_scores_gemma":[0.0007433026,0.00021520698,0.0005258595,0.00042072657,0.0003560148,0.0007573344,0.00036978137,0.0004414875,0.00013546614],"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.000016035436,0.000007182188,0.0010719851,0.000009609171,0.000005617652,0.00005663491,0.000033421453,0.9937151,0.0006084368,0.002824935,0.00013724752,0.001513743],"study_design_scores_gemma":[6.522382e-7,0.000003549807,0.000113210386,8.1851215e-7,0.0000020465684,0.0000043310856,0.0000064034875,0.99951863,0.000060425933,0.00024211714,0.000046635283,0.0000011741575],"about_ca_topic_score_codex":0.03178336,"about_ca_topic_score_gemma":0.011269256,"teacher_disagreement_score":0.03178336,"about_ca_system_score_codex":0.0011259189,"about_ca_system_score_gemma":0.0005674182,"threshold_uncertainty_score":0.06319672},"labels":[],"label_agreement":null},{"id":"W2985159807","doi":"10.1002/cpe.6304","title":"Efficient computation of positional population counts using SIMD instructions","year":2021,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ","funders":"National Research Council Canada","keywords":"SIMD; Byte; Computation; Population; Categorical variable; Generalization; Code (set theory)","score_opus":0.028173393668598026,"score_gpt":0.3417117682646383,"score_spread":0.3135383745960403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985159807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11298183,0.00063770515,0.845544,0.00058047654,0.00022528532,0.00012807379,0.001305647,0.02758667,0.011010406],"genre_scores_gemma":[0.44820148,0.00018907031,0.54342127,0.0002328009,0.00006980953,0.00034903525,0.0023625444,0.0008831918,0.004290773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848133,0.00021442478,0.00012901826,0.00023847447,0.000788124,0.00014871637],"domain_scores_gemma":[0.99661726,0.0012375505,0.00022609286,0.0007677892,0.0010050962,0.0001462513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079455087,0.00091750314,0.00066194026,0.0017185998,0.0007299901,0.0016096989,0.0016759479,0.00047741766,0.008015436],"category_scores_gemma":[0.005603847,0.00044988308,0.0005836077,0.0026628142,0.000846723,0.0022855613,0.0013928249,0.001009148,0.0032892723],"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.0012663833,0.00022647379,0.010750537,0.00038343275,0.00012370263,0.0003194301,0.00038558233,0.13714379,0.035068303,0.059151158,0.041124467,0.7140568],"study_design_scores_gemma":[0.000090170135,0.000097393444,0.00077771,0.000033041124,0.000017329512,0.000089420646,0.000092056056,0.91529787,0.039930563,0.034935437,0.008606306,0.00003263028],"about_ca_topic_score_codex":0.0027240692,"about_ca_topic_score_gemma":0.0043351417,"teacher_disagreement_score":0.008015436,"about_ca_system_score_codex":0.0014492881,"about_ca_system_score_gemma":0.0025958242,"threshold_uncertainty_score":0.026814282},"labels":[],"label_agreement":null},{"id":"W3016583051","doi":"10.1002/cpe.1531","title":"Pattern informatics approach to earthquake forecasting in 3D","year":2009,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"earthquake and tectonic studies","field":"Earth and Planetary Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"U.S. Geological Survey; Natural Sciences and Engineering Research Council of Canada; Southern California Earthquake Center; Institute for Catastrophic Loss Reduction; National Science Foundation","keywords":"Induced seismicity; Seismology; Geology; Unobservable; Tectonics; Microseism; Scale (ratio); Geography; Cartography; Econometrics; Mathematics","score_opus":0.040343145715003234,"score_gpt":0.28039744706104325,"score_spread":0.24005430134604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016583051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017063498,0.000121765624,0.9796479,0.0002331244,0.000023445087,0.000027899832,0.00015888002,0.000797598,0.0019259684],"genre_scores_gemma":[0.4751296,0.00039364793,0.5219135,0.00008433773,0.000069137874,0.00015520414,0.00046975925,0.00012806058,0.0016567135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971575,0.000078373734,0.00002633951,0.000056989895,0.00010051149,0.000022122125],"domain_scores_gemma":[0.99911946,0.00046827333,0.000096698976,0.000151832,0.0001283957,0.000035374032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005756892,0.0004381978,0.00058674806,0.0013923012,0.00035394184,0.001473482,0.001035295,0.00055433594,0.0026605153],"category_scores_gemma":[0.002667765,0.00035343354,0.0007191086,0.0015185862,0.00072561536,0.0013422302,0.0011291525,0.00078245805,0.00044654007],"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.00010460106,0.00006507972,0.0034237711,0.000089419875,0.000048008293,0.00017413795,0.00022407038,0.7603674,0.0027069384,0.05389624,0.0017945565,0.1771058],"study_design_scores_gemma":[0.000006003002,0.0000070202623,0.00017822025,0.0000036152346,0.0000034470006,0.000014126975,0.000014635823,0.9849123,0.0003562821,0.013632471,0.00086912385,0.000002866267],"about_ca_topic_score_codex":0.0086105885,"about_ca_topic_score_gemma":0.0062072896,"teacher_disagreement_score":0.0086105885,"about_ca_system_score_codex":0.00072319055,"about_ca_system_score_gemma":0.000794607,"threshold_uncertainty_score":0.017120898},"labels":[],"label_agreement":null},{"id":"W3018597471","doi":"10.1002/cpe.6270","title":"High‐performance SIMD modular arithmetic for polynomial evaluation","year":2021,"lang":"en","type":"preprint","venue":"Concurrency and Computation Practice and Experience","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"SIMD; Computer science; Parallel computing; Polynomial; Modular design; Computation; Modular arithmetic; Matrix polynomial; Compiler; Arithmetic; Mathematics; Algorithm; Programming language","score_opus":0.05114997092760116,"score_gpt":0.37793689660265356,"score_spread":0.3267869256750524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018597471","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12664719,0.000813626,0.8258011,0.0007015449,0.0002726569,0.000050665254,0.0002485272,0.0030379316,0.04242674],"genre_scores_gemma":[0.79911244,0.00030819912,0.19368836,0.00009203473,0.00010453666,0.00005679409,0.0002474995,0.00025802845,0.0061320513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996611,0.000085146676,0.000016668611,0.000041122203,0.00015675588,0.000039289258],"domain_scores_gemma":[0.9995746,0.00010998338,0.000033565757,0.00014929466,0.00010276089,0.000029741614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004582408,0.00040433247,0.00030502916,0.00039869358,0.00031540293,0.00076441653,0.00050106103,0.00019799061,0.0074610705],"category_scores_gemma":[0.0013713092,0.00016470745,0.00033446698,0.000655786,0.0005991057,0.0008211002,0.0010780052,0.0007237794,0.0016189866],"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.00062986836,0.000113917835,0.0022446413,0.0003403379,0.00006492718,0.00033314902,0.000265186,0.15026507,0.07761662,0.51403785,0.018358795,0.23572962],"study_design_scores_gemma":[0.00007845729,0.00011108138,0.00057127926,0.000037462534,0.000013462816,0.00016704036,0.00004014359,0.7854954,0.041741528,0.1466753,0.025048802,0.000020058083],"about_ca_topic_score_codex":0.00036863497,"about_ca_topic_score_gemma":0.00045742057,"teacher_disagreement_score":0.0074610705,"about_ca_system_score_codex":0.00046541577,"about_ca_system_score_gemma":0.00047111395,"threshold_uncertainty_score":0.024959743},"labels":[],"label_agreement":null},{"id":"W3023807074","doi":"10.1002/cpe.5746","title":"Data linking over RDF knowledge graphs: A survey","year":2020,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Data Quality and Management","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi; Université du Québec à Montréal","funders":"","keywords":"Computer science; Matching (statistics); Relation (database); Context (archaeology); Process (computing); Task (project management); RDF; Data science; Asset (computer security); Information retrieval; Object (grammar); Data mining; Semantic Web; Artificial intelligence; Mathematics; Programming language","score_opus":0.48924196060170927,"score_gpt":0.5236692874574922,"score_spread":0.034427326855782925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023807074","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020495845,0.4885844,0.42223382,0.006807708,0.0004685004,0.00038279503,0.003561931,0.0032703872,0.054194618],"genre_scores_gemma":[0.14721356,0.6254916,0.20932359,0.002662921,0.0009775324,0.00034228736,0.009028557,0.0007788359,0.004181139],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9945391,0.0017782244,0.0006140903,0.0010687697,0.0017440866,0.00025565448],"domain_scores_gemma":[0.98275626,0.013230452,0.0008323733,0.0018336232,0.0011760081,0.00017130125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007438621,0.00087140716,0.0013881947,0.014928176,0.0008139931,0.0037626585,0.0022327302,0.0016064384,0.0034432788],"category_scores_gemma":[0.01627914,0.0011535458,0.0017813093,0.021578204,0.0012075825,0.011161915,0.0029658657,0.0012656944,0.0012472145],"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.000052970263,0.00009972823,0.0055751344,0.0056071407,0.00021067054,0.00021219833,0.0004786197,0.015834607,0.0008024068,0.112561785,0.022892786,0.835672],"study_design_scores_gemma":[0.000020354117,0.000065765526,0.005336038,0.0065829405,0.00022245578,0.0014465187,0.0012982484,0.047575578,0.0041435137,0.16338791,0.76981175,0.00010876353],"about_ca_topic_score_codex":0.0050549065,"about_ca_topic_score_gemma":0.0029028363,"teacher_disagreement_score":0.014928176,"about_ca_system_score_codex":0.0018106514,"about_ca_system_score_gemma":0.0018976579,"threshold_uncertainty_score":0.039339602},"labels":[],"label_agreement":null},{"id":"W3027455131","doi":"10.1002/cpe.5823","title":"Mary, Hugo, and Hugo*: Learning to schedule distributed data‐parallel processing jobs on shared clusters","year":2020,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banting and Best Diabetes Centre, University of Toronto; Bundesministerium für Bildung und Forschung","keywords":"Computer science; SPARK (programming language); Yarn; Scheduling (production processes); Distributed computing; Schedule; Resource (disambiguation); Throughput; Cluster (spacecraft); Computer cluster; Job scheduler; Operating system; Computer network; Wireless","score_opus":0.0516348108275705,"score_gpt":0.3270838313335077,"score_spread":0.2754490205059372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027455131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5796608,0.00034627697,0.40986422,0.0021637275,0.00018335345,0.0001909249,0.000066395325,0.0036069814,0.0039173057],"genre_scores_gemma":[0.8938203,0.00008560917,0.10400975,0.00016468129,0.000039753682,0.000086803535,0.000082398416,0.00010544699,0.0016052638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953866,0.00016620736,0.000019023622,0.000094844014,0.000106786196,0.00007442844],"domain_scores_gemma":[0.9969398,0.001783867,0.000177641,0.0003194926,0.00038180136,0.00039742538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020474119,0.0005627281,0.00065826566,0.00029591564,0.0005090808,0.000548214,0.00085181557,0.0004232948,0.0008498163],"category_scores_gemma":[0.006176483,0.0002974762,0.00026152423,0.0003534674,0.0006509527,0.00084036426,0.0008060325,0.0010749681,0.00018127977],"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.0003439164,0.00028884038,0.0046894005,0.00004710336,0.000046427915,0.000053640142,0.00009224634,0.90362644,0.0049529793,0.0022903786,0.0034295577,0.080139086],"study_design_scores_gemma":[0.00002994057,0.0000499413,0.00025008043,0.0000013890349,0.000005113812,0.0000051358597,0.00001725499,0.9969348,0.001374902,0.0010670647,0.00026019133,0.0000041984317],"about_ca_topic_score_codex":0.014000611,"about_ca_topic_score_gemma":0.008372848,"teacher_disagreement_score":0.014000611,"about_ca_system_score_codex":0.0009413851,"about_ca_system_score_gemma":0.0018617787,"threshold_uncertainty_score":0.02783829},"labels":[],"label_agreement":null},{"id":"W3046162336","doi":"10.1002/cpe.5919","title":"Deep and reinforcement learning for automated task scheduling in large‐scale cloud computing systems","year":2020,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":152,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Defence Research and Development Canada","keywords":"Computer science; Cloud computing; Reinforcement learning; Scheduling (production processes); Distributed computing; Artificial intelligence; Deep learning; Machine learning; Operating system","score_opus":0.020746677400473625,"score_gpt":0.3010087496171185,"score_spread":0.28026207221664484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046162336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24213456,0.0006964205,0.7507655,0.0010543793,0.000098192344,0.00009383448,0.00009240157,0.0014844466,0.0035802994],"genre_scores_gemma":[0.97426546,0.000066666464,0.024740323,0.00007684042,0.000014441385,0.00003155805,0.00004265185,0.000023911263,0.00073820713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999616,0.0001048978,0.000021825237,0.00008169402,0.000081511374,0.000094093826],"domain_scores_gemma":[0.9989396,0.00056845107,0.00013479851,0.000058545284,0.00020934005,0.00008931245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009566981,0.000556056,0.00054468936,0.00032232158,0.0003638921,0.0005459769,0.00073562504,0.00058043376,0.0011800083],"category_scores_gemma":[0.002691878,0.00033658792,0.00033332678,0.00027312755,0.00048485026,0.0006756629,0.0005742854,0.001064339,0.00015014004],"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.00006383555,0.000054689353,0.000763558,0.000025966852,0.000012191735,0.00003005017,0.000019299392,0.9737038,0.0013288385,0.0010282658,0.00045209366,0.022517446],"study_design_scores_gemma":[0.0000013520382,0.000004085271,0.00003751311,4.944703e-7,5.4697813e-7,7.409427e-7,0.0000011453565,0.99955255,0.00009731144,0.00028448214,0.000019155254,5.315867e-7],"about_ca_topic_score_codex":0.016398748,"about_ca_topic_score_gemma":0.011802922,"teacher_disagreement_score":0.016398748,"about_ca_system_score_codex":0.0013938228,"about_ca_system_score_gemma":0.0019166443,"threshold_uncertainty_score":0.0326066},"labels":[],"label_agreement":null},{"id":"W3086164996","doi":"10.1002/cpe.5957","title":"Evaluating intrusion sensitivity allocation with supervised learning in collaborative intrusion detection","year":2020,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Intrusion detection system; Computer science; Sensitivity (control systems); Machine learning; Insider; Artificial intelligence; Intrusion; Classifier (UML); Data mining; Network security; Anomaly-based intrusion detection system; Computer security; Engineering","score_opus":0.031121300256024914,"score_gpt":0.32028999285789317,"score_spread":0.2891686926018683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086164996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88948303,0.0007022053,0.106620625,0.00033845953,0.00012043612,0.00020054098,0.00009873773,0.00065111,0.0017848958],"genre_scores_gemma":[0.98059237,0.00005035535,0.018963853,0.00004122638,0.000021968328,0.00003772265,0.000098911,0.00001173412,0.00018176717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99422944,0.002980754,0.0005113845,0.00083826476,0.0010718993,0.0003681795],"domain_scores_gemma":[0.9632179,0.026979571,0.0024924746,0.0024226876,0.0039552418,0.0009320401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011364189,0.0010625306,0.0011800387,0.0017834225,0.0006189694,0.0010599081,0.001258218,0.0014703689,0.0004511629],"category_scores_gemma":[0.028583422,0.00035896534,0.00061176374,0.0007608689,0.0011633043,0.0016170401,0.0012857413,0.0012779813,0.00014850407],"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.0008772251,0.0007534104,0.018399991,0.00011485216,0.0001996832,0.000057060675,0.000089984875,0.9044415,0.0020541032,0.00074546813,0.00062780187,0.07163895],"study_design_scores_gemma":[0.0000108127915,0.00017538235,0.0010596274,0.00000498788,0.000014692064,0.000012571488,0.000017037795,0.99660826,0.0015363358,0.0005047601,0.000049861042,0.0000057282014],"about_ca_topic_score_codex":0.004562905,"about_ca_topic_score_gemma":0.0029570297,"teacher_disagreement_score":0.011364189,"about_ca_system_score_codex":0.0017279735,"about_ca_system_score_gemma":0.0010935534,"threshold_uncertainty_score":0.060100317},"labels":[],"label_agreement":null},{"id":"W3094055078","doi":"10.1002/cpe.6047","title":"5G NB‐IoT: Efficient network call admission control in cellular networks","year":2020,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Computer network; Mobile broadband; Quality of service; Service (business); Energy consumption; Data as a service; Cellular network; Throughput; Latency (audio); Low latency (capital markets); Broadband; Telecommunications; Wireless; Business; Engineering","score_opus":0.013907252166426671,"score_gpt":0.26963912322132716,"score_spread":0.2557318710549005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094055078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026600787,0.0010486456,0.9596718,0.00055292685,0.0001916957,0.000110269546,0.000108833854,0.0014991031,0.010216027],"genre_scores_gemma":[0.9151559,0.00063185015,0.07871317,0.00013604763,0.00012245856,0.00012506836,0.00017677272,0.00009180474,0.0048470334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991375,0.00022638506,0.00003189992,0.00009342285,0.00033896446,0.00017177439],"domain_scores_gemma":[0.9994029,0.000278755,0.000061577106,0.000062565356,0.00014562122,0.000048656068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011340971,0.00049868535,0.0006280213,0.00061978726,0.00070680055,0.0010881061,0.0009219719,0.00047379851,0.002516105],"category_scores_gemma":[0.0026664434,0.0001930861,0.00030394434,0.0006866699,0.0006988182,0.00071336864,0.0008920102,0.0008329826,0.00044410085],"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.00019582058,0.00004225578,0.001259132,0.000061373416,0.000028713452,0.00008218406,0.00008633679,0.828914,0.004399682,0.04435087,0.004320819,0.11625887],"study_design_scores_gemma":[0.0000040558434,0.0000075348844,0.00009464983,0.000004570766,0.0000033509557,0.000012016013,0.000005482142,0.9952858,0.00046534793,0.0031571903,0.0009556938,0.000004356679],"about_ca_topic_score_codex":0.018044619,"about_ca_topic_score_gemma":0.013908677,"teacher_disagreement_score":0.018044619,"about_ca_system_score_codex":0.0017261312,"about_ca_system_score_gemma":0.0014922695,"threshold_uncertainty_score":0.035879195},"labels":[],"label_agreement":null},{"id":"W3104964829","doi":"10.1002/cpe.6052","title":"Distributed Application Global States Monitoring in PEGASUS DA Applied to Parallel Graph Partitioning","year":2020,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Graph partition; Asynchronous communication; Distributed computing; Graph; Benchmark (surveying); Parallel computing; Theoretical computer science","score_opus":0.02998049227623267,"score_gpt":0.31634306788024974,"score_spread":0.28636257560401707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104964829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09799557,0.000083589206,0.895966,0.0000970615,0.000022217777,0.00007193975,0.000025478173,0.0030617316,0.0026763387],"genre_scores_gemma":[0.6564388,0.000060633927,0.34150776,0.00003966214,0.000007668324,0.00006468757,0.000049574224,0.00021878578,0.0016124231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999619,0.00009477044,0.000017191694,0.00012074343,0.00011477815,0.000033550994],"domain_scores_gemma":[0.9995547,0.00012338025,0.000061563616,0.00014836245,0.00008264531,0.000029287667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004745606,0.0003728923,0.00027067726,0.00031016546,0.0002798999,0.0005297387,0.0005892773,0.00022587417,0.0007703548],"category_scores_gemma":[0.00095612806,0.00017384258,0.00021415282,0.00019894511,0.0004833611,0.0004761095,0.00057892845,0.00052279804,0.00014309632],"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.00044218605,0.00014353365,0.0042183325,0.00015405787,0.00004967207,0.00020785362,0.0004961547,0.47269952,0.13976185,0.037367795,0.0017045409,0.34275454],"study_design_scores_gemma":[0.000017434239,0.00008371643,0.00068352977,0.000008586643,0.00001302631,0.000047828275,0.000026229385,0.94202167,0.044912133,0.0061071906,0.006067581,0.0000110761175],"about_ca_topic_score_codex":0.0034732267,"about_ca_topic_score_gemma":0.003066663,"teacher_disagreement_score":0.0034732267,"about_ca_system_score_codex":0.00062801235,"about_ca_system_score_gemma":0.00060137233,"threshold_uncertainty_score":0.0069060326},"labels":[],"label_agreement":null},{"id":"W3112004248","doi":"10.1002/cpe.6124","title":"An efficient shortest path routing on the hypercube with blocking/faulty nodes","year":2020,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Hypercube; Shortest path problem; K shortest path routing; Constrained Shortest Path First; Computer science; Node (physics); Path (computing); Routing (electronic design automation); Shortest Path Faster Algorithm; Blocking (statistics); Yen's algorithm; Equal-cost multi-path routing; Fault tolerance; Longest path problem; Floyd–Warshall algorithm; Algorithm; Mathematics; Mathematical optimization; Link-state routing protocol; Theoretical computer science; Distributed computing; Parallel computing; Dijkstra's algorithm; Computer network; Routing protocol; Graph","score_opus":0.03460719488136469,"score_gpt":0.29395456044820983,"score_spread":0.2593473655668451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112004248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21450105,0.0010957855,0.7692949,0.0014991261,0.00018099156,0.0002549648,0.00049586175,0.0010282277,0.011649037],"genre_scores_gemma":[0.5876047,0.0007458911,0.40349263,0.000115035546,0.000080702,0.0002182987,0.0006383569,0.000098457254,0.0070058363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994229,0.00025207613,0.00003279443,0.000073964584,0.00013889644,0.0000793836],"domain_scores_gemma":[0.9993773,0.00025892668,0.00006823888,0.000117028816,0.00012443998,0.000054012187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006124145,0.00041298292,0.0006392728,0.0006215791,0.00071442046,0.0007548929,0.000752032,0.0005873283,0.002673694],"category_scores_gemma":[0.001210257,0.00022395723,0.00041400045,0.0011072551,0.00045674932,0.0016023505,0.00087619375,0.00048481097,0.00040058722],"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.00047653072,0.00010453534,0.0009770383,0.00027724152,0.000062653446,0.00038073605,0.00020062701,0.8245135,0.019087046,0.041623943,0.006496907,0.10579918],"study_design_scores_gemma":[0.000046360554,0.00007249497,0.00024891895,0.000009805757,0.00000852573,0.000075144184,0.00008768028,0.9675382,0.004088707,0.024528077,0.0032827703,0.000013361812],"about_ca_topic_score_codex":0.0023937114,"about_ca_topic_score_gemma":0.0018080196,"teacher_disagreement_score":0.002673694,"about_ca_system_score_codex":0.0008263253,"about_ca_system_score_gemma":0.0007033277,"threshold_uncertainty_score":0.008944392},"labels":[],"label_agreement":null},{"id":"W3112200194","doi":"10.1002/cpe.6144","title":"Efficient and secure routing protocol based on Blockchain approach for wireless sensor networks","year":2020,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"Université du Québec à Chicoutimi","keywords":"Blockchain; Wireless sensor network; Computer science; Protocol (science); Routing protocol; Routing (electronic design automation); Computer security; Computer network","score_opus":0.022499905913287297,"score_gpt":0.3008806597473093,"score_spread":0.278380753834022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112200194","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12169471,0.0011194197,0.859796,0.0010271893,0.000234869,0.0004933027,0.0001548192,0.0007562405,0.014723506],"genre_scores_gemma":[0.93930477,0.0005199831,0.05516779,0.000055457513,0.00004272725,0.00024820722,0.00012757022,0.000021067595,0.0045122714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990376,0.00037960088,0.000069723705,0.00011857777,0.00026950715,0.00012510212],"domain_scores_gemma":[0.9988319,0.00055513124,0.00012968466,0.00020172106,0.00020192664,0.00007960207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010315935,0.0003169958,0.00065039366,0.00069442095,0.0012744913,0.0010455691,0.0009367495,0.00084486575,0.0029966603],"category_scores_gemma":[0.0017344573,0.00021571401,0.0003362151,0.00066287525,0.00093021366,0.0018017903,0.0011531898,0.00065218034,0.00034079142],"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.0005709206,0.00020564189,0.0020201802,0.00031764607,0.0001064616,0.00096143584,0.0005713212,0.63955086,0.02954965,0.22949503,0.003914185,0.09273664],"study_design_scores_gemma":[0.00008368943,0.00016481824,0.00018240724,0.000028095128,0.000025606461,0.0002003877,0.00006227491,0.95087683,0.005497236,0.037956182,0.004896664,0.000025811087],"about_ca_topic_score_codex":0.0023935793,"about_ca_topic_score_gemma":0.0024937924,"teacher_disagreement_score":0.0029966603,"about_ca_system_score_codex":0.00086342805,"about_ca_system_score_gemma":0.0015426949,"threshold_uncertainty_score":0.010024786},"labels":[],"label_agreement":null},{"id":"W3115903506","doi":"10.1002/cpe.6153","title":"Taming <scp>next‐generation HPC</scp> systems: <scp>Run‐time</scp> system and algorithmic advancements","year":2020,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Concurrency; Informatics; Operations research; Distributed computing; Engineering","score_opus":0.041874892505479835,"score_gpt":0.28903558814437313,"score_spread":0.2471606956388933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115903506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015339659,0.21455315,0.29483017,0.1537845,0.19012132,0.00033423782,0.0013405344,0.006772673,0.12292382],"genre_scores_gemma":[0.20897014,0.27257943,0.13439,0.02083103,0.15086892,0.0006503506,0.005084376,0.012548527,0.19407728],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936039,0.0016937372,0.00046901783,0.0006531209,0.0030156432,0.000564575],"domain_scores_gemma":[0.9852288,0.0071527837,0.00063276454,0.002585777,0.002989922,0.0014100095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007983466,0.00070494425,0.0012167513,0.0021230236,0.002293735,0.009008646,0.002546604,0.002091354,0.030917073],"category_scores_gemma":[0.0216161,0.00076727744,0.000863916,0.0035186873,0.0038894594,0.014640275,0.00593263,0.0052758283,0.007708041],"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.00015398343,0.000051260475,0.0011803713,0.0014435543,0.000069667454,0.00028850095,0.001620761,0.0028591182,0.0028551617,0.21136647,0.53980595,0.23830512],"study_design_scores_gemma":[0.000012385909,0.000048273298,0.00043794597,0.00037703215,0.000017429094,0.00032520047,0.000443441,0.0037321094,0.00113631,0.06336384,0.9300577,0.000048309594],"about_ca_topic_score_codex":0.0015122744,"about_ca_topic_score_gemma":0.0021205966,"teacher_disagreement_score":0.030917073,"about_ca_system_score_codex":0.0021849317,"about_ca_system_score_gemma":0.0037677651,"threshold_uncertainty_score":0.10342795},"labels":[],"label_agreement":null},{"id":"W3172401710","doi":"10.1002/cpe.6297","title":"Ship‐iceberg discrimination from Sentinel‐1 synthetic aperture radar data using parallel convolutional neural network","year":2021,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Synthetic Aperture Radar (SAR) Applications and Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre For Cold Ocean Resources Engineering; Government of Newfoundland and Labrador; Memorial University of Newfoundland","funders":"Jiangxi Provincial Department of Science and Technology; Education Department of Jiangxi Province; National Natural Science Foundation of China","keywords":"Convolutional neural network; Computer science; Artificial intelligence; Iceberg; Synthetic aperture radar; Constant false alarm rate; Pattern recognition (psychology); Support vector machine; Artificial neural network; Deep learning; Computer vision; Geology","score_opus":0.041114091045074616,"score_gpt":0.3108569003007611,"score_spread":0.26974280925568644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172401710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93327147,0.00028000795,0.061142087,0.00026368786,0.00010057115,0.000040322047,0.0005604097,0.0011864897,0.00315496],"genre_scores_gemma":[0.97552437,0.00009283481,0.0221461,0.000041517185,0.000020476276,0.00001091181,0.001130965,0.000025211386,0.0010076397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998259,0.000027152368,0.000010453026,0.00004672184,0.000055451503,0.00003440167],"domain_scores_gemma":[0.99966085,0.00008956542,0.000045262637,0.00004318703,0.00014019471,0.000021034793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060982985,0.0005088021,0.00029832343,0.0008776585,0.00017879254,0.0003791161,0.00035028413,0.00027055448,0.00071802357],"category_scores_gemma":[0.00086608087,0.00017838232,0.00038726674,0.00054030813,0.00019370644,0.000525388,0.00029030445,0.00034922195,0.00025617098],"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.0009061487,0.0004121763,0.052971676,0.00014808985,0.00032290627,0.00035170515,0.000115897456,0.47546542,0.07320416,0.00088845944,0.0069690146,0.38824436],"study_design_scores_gemma":[0.0000067284245,0.000031346874,0.008100081,0.0000048991105,0.000015850199,0.000030674415,0.000021101307,0.9829473,0.008267999,0.00020870064,0.00035694923,0.000008369014],"about_ca_topic_score_codex":0.009893962,"about_ca_topic_score_gemma":0.0094288,"teacher_disagreement_score":0.009893962,"about_ca_system_score_codex":0.00041780857,"about_ca_system_score_gemma":0.0003810699,"threshold_uncertainty_score":0.019672751},"labels":[],"label_agreement":null},{"id":"W4200361452","doi":"10.1002/cpe.6772","title":"Multi‐step wind speed and wind power forecasting using variational momentum factor and deep learning based intelligent neural network models","year":2021,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Energy Load and Power Forecasting","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Artificial neural network; Wind speed; Wind power; Wind power forecasting; Heuristic; Computer science; Renewable energy; Process (computing); Power (physics); Artificial intelligence; Deep learning; Machine learning; Simulation; Electric power system; Engineering; Meteorology","score_opus":0.05216643408450233,"score_gpt":0.2863138410012601,"score_spread":0.23414740691675778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200361452","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17663015,0.00051516836,0.81600696,0.00030782356,0.000089214474,0.000029813707,0.00009299665,0.00028327573,0.0060445727],"genre_scores_gemma":[0.9676299,0.00018552542,0.029695876,0.000026610502,0.000013462956,0.000021126763,0.00005908372,0.000013252437,0.0023550782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999201,0.0000171571,0.000005642873,0.00001763816,0.000026980477,0.000012502772],"domain_scores_gemma":[0.99985576,0.000067223664,0.000021415522,0.00001116842,0.000035929672,0.000008462369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002932062,0.00032499465,0.00034761959,0.00022760125,0.0001831864,0.0005091509,0.0006224369,0.00050417904,0.0006593173],"category_scores_gemma":[0.0006803303,0.00023072219,0.00044062326,0.00031119265,0.0002853707,0.00068751234,0.00033424003,0.0006447939,0.00009313989],"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.000019171428,0.000019850933,0.00080413197,0.000014332631,0.000016822687,0.000022971772,0.0000139604035,0.981837,0.0010743795,0.0021902707,0.0001344352,0.013852748],"study_design_scores_gemma":[3.6818813e-7,0.0000021394462,0.000040216608,5.2231064e-7,5.4691606e-7,9.708637e-7,6.960373e-7,0.9996822,0.0000742591,0.0001765758,0.00002093284,5.9304256e-7],"about_ca_topic_score_codex":0.011930537,"about_ca_topic_score_gemma":0.009889371,"teacher_disagreement_score":0.011930537,"about_ca_system_score_codex":0.0005254078,"about_ca_system_score_gemma":0.0005738961,"threshold_uncertainty_score":0.023722172},"labels":[],"label_agreement":null},{"id":"W4200372371","doi":"10.1002/cpe.6743","title":"Scalable grid‐based approximation algorithms for partially observable Markov decision processes","year":2021,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Partially observable Markov decision process; Computer science; Markov decision process; Scalability; Observable; Mathematical optimization; Implementation; Grid; Markov process; Process (computing); Focus (optics); Algorithm; Markov chain; Markov model; Machine learning; Mathematics","score_opus":0.04756454524991755,"score_gpt":0.3385360643285482,"score_spread":0.29097151907863067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200372371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035366956,0.00046718004,0.9598309,0.000335883,0.000053212927,0.000069272995,0.00012671722,0.0008190753,0.002930943],"genre_scores_gemma":[0.81634337,0.00026606067,0.18128155,0.00009671589,0.000028017006,0.00019961415,0.00023917676,0.000102057405,0.0014433507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933416,0.00025652355,0.000039265626,0.000112899914,0.00015387268,0.00010310739],"domain_scores_gemma":[0.9962585,0.0028295857,0.00027497634,0.0002623467,0.00023111535,0.00014356946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016516919,0.000707464,0.0014915925,0.0005652175,0.0006141212,0.0010020459,0.001607456,0.0008401305,0.0036099073],"category_scores_gemma":[0.0053429543,0.0005073301,0.00062056805,0.000857225,0.00091310334,0.0011467645,0.0016591634,0.0015651203,0.00035387216],"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.000044741744,0.000022041158,0.00036634525,0.000027252003,0.000013291677,0.000017375834,0.000023127062,0.98259246,0.00012090229,0.007376273,0.00034301955,0.0090531865],"study_design_scores_gemma":[0.0000058050946,0.0000030637823,0.000014247415,0.000001827372,8.4317276e-7,0.0000015390481,0.000002931164,0.9970799,0.000024029161,0.002811068,0.00005406598,6.5372114e-7],"about_ca_topic_score_codex":0.0151762515,"about_ca_topic_score_gemma":0.0131347515,"teacher_disagreement_score":0.0151762515,"about_ca_system_score_codex":0.0016961447,"about_ca_system_score_gemma":0.0021152876,"threshold_uncertainty_score":0.030175805},"labels":[],"label_agreement":null},{"id":"W4206668287","doi":"10.1002/cpe.6778","title":"A new model for trustworthy web service <scp>QoS</scp> prediction","year":2021,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Ontario Tech University","funders":"","keywords":"Computer science; Quality of service; Web service; Task (project management); The Internet; Service (business); Trustworthiness; Data mining; World Wide Web; Computer network; Computer security; Engineering","score_opus":0.039025527139702365,"score_gpt":0.31809250374726705,"score_spread":0.2790669766075647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206668287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14557809,0.0010841653,0.8436648,0.0029860165,0.00023512654,0.00019984182,0.00066198024,0.0009942639,0.004595764],"genre_scores_gemma":[0.9202687,0.00041563125,0.07454486,0.0002443298,0.00014756763,0.00023704798,0.0004665282,0.00005274668,0.0036227088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979703,0.0006229597,0.00012512192,0.0005492577,0.0005143019,0.00021798439],"domain_scores_gemma":[0.9916603,0.005295612,0.00066666526,0.0003613512,0.0017904721,0.00022561889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038227183,0.000943876,0.0012591394,0.0017598538,0.00096705416,0.0016218201,0.0024370654,0.0021072328,0.0020498615],"category_scores_gemma":[0.010124618,0.00052959635,0.00090222736,0.0012412996,0.000814615,0.0024709348,0.00094665616,0.0019441805,0.0006200422],"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.0002114346,0.00024321563,0.01066509,0.0001384542,0.00018343373,0.00022490509,0.0003026394,0.91498786,0.0015558433,0.011588407,0.0029581846,0.056940537],"study_design_scores_gemma":[0.000004470059,0.0000159752,0.00027656066,0.0000046949713,0.000012313508,0.000012539318,0.0000063380335,0.99833316,0.000075928954,0.0011097096,0.00014287904,0.0000054754214],"about_ca_topic_score_codex":0.033395242,"about_ca_topic_score_gemma":0.024008762,"teacher_disagreement_score":0.033395242,"about_ca_system_score_codex":0.0020468691,"about_ca_system_score_gemma":0.0017636921,"threshold_uncertainty_score":0.06640172},"labels":[],"label_agreement":null},{"id":"W4225385632","doi":"10.1002/cpe.6974","title":"Execution trace‐based model verification to analyze multicore and real‐time systems","year":2022,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Telefonaktiebolaget LM Ericsson","keywords":"Computer science; Debugging; TRACE (psycholinguistics); Tracing; Multi-core processor; Workflow; Key (lock); Distributed computing; Real-time computing; Embedded system; Programming language; Operating system; Database","score_opus":0.05049310498795191,"score_gpt":0.3517176971639413,"score_spread":0.3012245921759894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225385632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031183654,0.0000895318,0.9651918,0.00009111143,0.000028357561,0.00007238416,0.00012300344,0.0024200713,0.0008001151],"genre_scores_gemma":[0.6170978,0.00012126883,0.37973827,0.00008699808,0.00002085174,0.00020959073,0.000621066,0.0007606921,0.0013434283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980654,0.00060485944,0.00012999681,0.00026783402,0.0007271664,0.000204678],"domain_scores_gemma":[0.9911806,0.0054558613,0.00073564134,0.0009294249,0.0014681893,0.00023031529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021106799,0.001650802,0.00087198446,0.0020923843,0.00080347393,0.0012456712,0.0015012065,0.00093364733,0.003685506],"category_scores_gemma":[0.012853809,0.00064590346,0.0014958291,0.0012549692,0.001165641,0.002212541,0.0015757843,0.0016247297,0.00034167105],"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.00011438286,0.00008351615,0.002160872,0.00011815138,0.00005559439,0.00010547065,0.00006658551,0.9489016,0.0056083114,0.012709656,0.00051783933,0.029558158],"study_design_scores_gemma":[0.000005041096,0.000010318484,0.0000642763,0.0000043508385,0.0000029565826,0.000008798009,0.0000060883003,0.9949056,0.0019235817,0.0028446445,0.00022117402,0.0000032523187],"about_ca_topic_score_codex":0.018491182,"about_ca_topic_score_gemma":0.016958587,"teacher_disagreement_score":0.018491182,"about_ca_system_score_codex":0.0017378738,"about_ca_system_score_gemma":0.0031809835,"threshold_uncertainty_score":0.036767125},"labels":[],"label_agreement":null},{"id":"W4229577914","doi":"10.1002/cpe.1578","title":"A scheduling and load balancing scheme for dynamic P2P‐based system","year":2010,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Distributed computing; Load balancing (electrical power); Scheduling (production processes); Dynamic priority scheduling; Round-robin scheduling; Fair-share scheduling; Peer-to-peer; Computer network; Quality of service; Engineering","score_opus":0.014057672959052782,"score_gpt":0.31389667397781656,"score_spread":0.29983900101876376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229577914","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09739077,0.00040942495,0.8888741,0.00057110906,0.00035556278,0.00033492368,0.000104422375,0.0039180373,0.0080417385],"genre_scores_gemma":[0.89161414,0.00013034763,0.10464451,0.0001265559,0.00014934316,0.0001873685,0.00015709647,0.000098412114,0.0028922115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990778,0.00021506996,0.000075730146,0.00021206944,0.00030549243,0.00011386584],"domain_scores_gemma":[0.99894494,0.00018647053,0.000115900286,0.00027659506,0.0003186834,0.00015744874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010506455,0.0006018752,0.00076166214,0.0009932631,0.0018622023,0.0011967511,0.0018380388,0.00082704733,0.0017905964],"category_scores_gemma":[0.0018593727,0.0002307662,0.00027415992,0.0009972887,0.00062614854,0.0013378699,0.0013762055,0.0007362966,0.0006035704],"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.0013262741,0.0007602984,0.002255011,0.000297603,0.0001523393,0.00090967905,0.00076488376,0.34523576,0.15839656,0.061884347,0.02238685,0.4056304],"study_design_scores_gemma":[0.00007945251,0.00013956391,0.00035216904,0.000006606589,0.000024519177,0.00018838496,0.0000574454,0.9736018,0.010273598,0.0072801025,0.007964355,0.000032004726],"about_ca_topic_score_codex":0.0017236146,"about_ca_topic_score_gemma":0.0013402565,"teacher_disagreement_score":0.0018622023,"about_ca_system_score_codex":0.00094749586,"about_ca_system_score_gemma":0.0011194284,"threshold_uncertainty_score":0.0068745613},"labels":[],"label_agreement":null},{"id":"W4229616670","doi":"10.1002/cpe.1364","title":"Trading off logging overhead and coordinating overhead to achieve efficient rollback recovery","year":2008,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Computer science; Scalability; Overhead (engineering); Rollback; Logging; Fault tolerance; Partition (number theory); Heuristics; Distributed computing; Embedded system; Operating system; Database transaction; Database","score_opus":0.025876742472895526,"score_gpt":0.30326741972070514,"score_spread":0.27739067724780964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229616670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23841324,0.0005934432,0.75266427,0.0004843702,0.0000768665,0.00021443143,0.000042347292,0.0042582727,0.0032527372],"genre_scores_gemma":[0.9171075,0.00011499638,0.081737995,0.000054952365,0.000025251571,0.000057592988,0.000044324268,0.000076963646,0.0007804666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831176,0.00054136984,0.00016908548,0.0002490079,0.00043330985,0.0002953939],"domain_scores_gemma":[0.9946912,0.0013267949,0.00081042363,0.0021368403,0.0006559886,0.00037867276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017800541,0.00059547205,0.000774317,0.00078603026,0.0009274265,0.001395206,0.0012603614,0.0004603513,0.0012069162],"category_scores_gemma":[0.0054987087,0.00031315722,0.00018916072,0.00094683835,0.00085691334,0.002131449,0.0015635511,0.0007614212,0.00039169737],"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.0018955265,0.0008026822,0.008396292,0.0003118551,0.00010972646,0.00049086683,0.0006661479,0.4096607,0.17959489,0.030469313,0.006428599,0.36117348],"study_design_scores_gemma":[0.00021103067,0.0005183365,0.0025140212,0.000030025913,0.000084971216,0.0003475974,0.00032701014,0.88175714,0.09726795,0.012013047,0.004862898,0.00006608818],"about_ca_topic_score_codex":0.0012886807,"about_ca_topic_score_gemma":0.0014600682,"teacher_disagreement_score":0.0017800541,"about_ca_system_score_codex":0.0005738652,"about_ca_system_score_gemma":0.0012510838,"threshold_uncertainty_score":0.009413898},"labels":[],"label_agreement":null},{"id":"W4229946712","doi":"10.1002/cpe.1520","title":"Large‐scale numerical simulations of earthquake fault systems: illuminating the role of dilatational gravity in earthquake nucleation","year":2009,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"earthquake and tectonic studies","field":"Earth and Planetary Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; TD Bank Group","funders":"Basic Energy Sciences; Natural Sciences and Engineering Research Council of Canada; Institute for Catastrophic Loss Reduction; National Aeronautics and Space Administration","keywords":"Seismology; Geology; Foreshock; Shear (geology); Nucleation; Earthquake simulation; Slip (aerodynamics); Tectonics; Earthquake prediction; Physics; Aftershock; Petrology","score_opus":0.014360412734274002,"score_gpt":0.27918148626289824,"score_spread":0.2648210735286242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229946712","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9945878,0.00004525854,0.0041661616,0.00007270516,0.000005476918,0.0000075536723,0.00007357616,0.000073502015,0.00096800906],"genre_scores_gemma":[0.99815375,0.000028270983,0.0016386289,0.000005355634,0.0000025601657,0.0000056271706,0.00005118213,0.000009461523,0.00010523437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988973,0.000047632573,0.0000094793895,0.000019556834,0.000021682732,0.000011829499],"domain_scores_gemma":[0.99802315,0.0015905749,0.00013356144,0.00009737478,0.00007746473,0.000077880286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057791045,0.000195033,0.00025189476,0.0003229435,0.00025408395,0.00048526798,0.00040884153,0.00029947955,0.0007531931],"category_scores_gemma":[0.0031996185,0.0002481456,0.00016612683,0.0003637175,0.0006005224,0.0003407105,0.0003629544,0.0003619577,0.000047081874],"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.00009671351,0.00006505447,0.01799608,0.00002694257,0.00002816892,0.000063507374,0.0001318021,0.9732141,0.0027995259,0.001996615,0.00019937426,0.0033822216],"study_design_scores_gemma":[0.000018104462,0.000019494773,0.0027428456,0.0000018954748,0.00000508602,0.00000585824,0.000017424298,0.99618644,0.00056827004,0.00034225915,0.00008924809,0.0000030172375],"about_ca_topic_score_codex":0.01770888,"about_ca_topic_score_gemma":0.013045405,"teacher_disagreement_score":0.01770888,"about_ca_system_score_codex":0.0005910855,"about_ca_system_score_gemma":0.0005675212,"threshold_uncertainty_score":0.035211563},"labels":[],"label_agreement":null},{"id":"W4231667303","doi":"10.1002/cpe.1640","title":"Proceedings of the 6th ACES Symposium, May 11–16, 2008, Cairns, Australia: Introduction to the Special Issue","year":2010,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"earthquake and tectonic studies","field":"Earth and Planetary Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"China; Government (linguistics); Natural disaster; History; Political science; Geography; Economic growth; Economic history; Meteorology; Law; Economics","score_opus":0.01648935469475344,"score_gpt":0.28082067041236053,"score_spread":0.2643313157176071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231667303","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009851363,0.06773046,0.023310024,0.07723964,0.2328703,0.0011487468,0.0054650228,0.004585779,0.5777987],"genre_scores_gemma":[0.011009558,0.022326555,0.0055555697,0.004036913,0.02047615,0.00027018358,0.004693961,0.0015967946,0.9300344],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899346,0.00012071196,0.00005917902,0.00014828338,0.00055499916,0.00012345063],"domain_scores_gemma":[0.996999,0.00018370329,0.00012333033,0.00015553657,0.0016528253,0.00088553096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022795962,0.0012086713,0.00097126333,0.0014836215,0.0017508643,0.004626289,0.0015719166,0.001705635,0.18816718],"category_scores_gemma":[0.0030649956,0.0007096636,0.00062458037,0.001183193,0.00076261,0.0029724257,0.0031280422,0.0027315333,0.084492646],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043104126,0.000044893328,0.00025440886,0.00016297793,0.000006353937,0.000058015277,0.00009385815,0.00017984648,0.00044530668,0.00073136267,0.95339763,0.044582386],"study_design_scores_gemma":[0.000008403691,0.0000237003,0.0012310672,0.00012081096,0.0000044385647,0.00004949375,0.000089929476,0.00023360147,0.00011357076,0.00042492725,0.99769163,0.000008411502],"about_ca_topic_score_codex":0.009412456,"about_ca_topic_score_gemma":0.024397297,"teacher_disagreement_score":0.18816718,"about_ca_system_score_codex":0.0017782263,"about_ca_system_score_gemma":0.0036150753,"threshold_uncertainty_score":0.6294819},"labels":[],"label_agreement":null},{"id":"W4234190264","doi":"10.1002/cpe.1561","title":"Special Issue: Advances in High‐Performance Computing and Communications","year":2010,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Scalability; Server; Supercomputer; Set (abstract data type); Data science; Distributed computing; World Wide Web; Operating system","score_opus":0.016929418867322677,"score_gpt":0.3305510189059781,"score_spread":0.3136216000386554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234190264","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007957302,0.031213619,0.0016471803,0.008218645,0.9282651,0.00021811429,0.00045274053,0.00040932174,0.02877953],"genre_scores_gemma":[0.0036922356,0.035703167,0.0010259247,0.0040922966,0.8842571,0.00019196606,0.0010174265,0.00057697424,0.06944297],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99606615,0.00042639824,0.00047961457,0.0008211457,0.0017723272,0.00043437677],"domain_scores_gemma":[0.98642784,0.0033059928,0.00095902215,0.0008496198,0.005316412,0.0031410884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003435024,0.004446927,0.004692382,0.005229539,0.0024286406,0.0099512385,0.0037781927,0.0048564654,0.0797151],"category_scores_gemma":[0.006895676,0.00107403,0.0022115612,0.0035742417,0.0014234389,0.0059264326,0.0022036007,0.006933347,0.03962929],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009977463,0.00009627452,0.00024151694,0.0009939566,0.000050673967,0.00016121657,0.000031473697,0.00020495888,0.00060397375,0.0021388829,0.95780015,0.037577253],"study_design_scores_gemma":[0.000022254251,0.00012161822,0.0007183661,0.000307488,0.000041595886,0.00036354054,0.000032506345,0.00060606614,0.00038149822,0.0014625249,0.99591607,0.000026481086],"about_ca_topic_score_codex":0.00038838733,"about_ca_topic_score_gemma":0.00053825974,"teacher_disagreement_score":0.0797151,"about_ca_system_score_codex":0.0021692468,"about_ca_system_score_gemma":0.002540316,"threshold_uncertainty_score":0.26667356},"labels":[],"label_agreement":null},{"id":"W4236073229","doi":"10.1002/cpe.1454","title":"Improving energy efficiency of asymmetric chip multithreaded multiprocessors through reduced OS noise scheduling","year":2009,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Multiprocessing; Multithreading; Embedded system; Scheduling (production processes); Context switch; Thread (computing); Multi-core processor; Efficient energy use; Xeon; Chip; Operating system; Parallel computing","score_opus":0.02347586358554719,"score_gpt":0.31696521371199193,"score_spread":0.2934893501264447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236073229","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77405405,0.00086835836,0.21989599,0.00018707478,0.00007319689,0.00004638107,0.000034028195,0.00085564615,0.0039853337],"genre_scores_gemma":[0.9637407,0.00007205662,0.035508018,0.00002587271,0.00001930321,0.00001626942,0.000024976353,0.000038411872,0.0005544646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961984,0.00012413043,0.000025679088,0.000050277406,0.00011787905,0.00006230656],"domain_scores_gemma":[0.999252,0.00022857444,0.00013689946,0.00017206956,0.00013797541,0.00007245383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000640166,0.00035008532,0.00037908324,0.00039281114,0.00024960705,0.0004093058,0.0009337567,0.00018349128,0.0009415842],"category_scores_gemma":[0.0015714593,0.00015948602,0.00016517707,0.00042776906,0.00024274077,0.00053985254,0.0004790803,0.00030421105,0.00017779379],"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.0016528711,0.00052669214,0.007284993,0.00022627454,0.00008080873,0.0002092328,0.00017763219,0.47490424,0.24075991,0.0121630225,0.0024354975,0.2595788],"study_design_scores_gemma":[0.00007726593,0.00024650255,0.0014024402,0.000005573098,0.000023602473,0.00004063157,0.000017623268,0.9584664,0.03631436,0.001991236,0.0014041708,0.0000101858395],"about_ca_topic_score_codex":0.0005626571,"about_ca_topic_score_gemma":0.0010661966,"teacher_disagreement_score":0.0009415842,"about_ca_system_score_codex":0.0003481441,"about_ca_system_score_gemma":0.0005494197,"threshold_uncertainty_score":0.0033856034},"labels":[],"label_agreement":null},{"id":"W4236588838","doi":"10.1002/cpe.1360","title":"Special Issue: The Best of CCGrid'2007: A Snapshot of an ‘Adolescent’ Area","year":2008,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Snapshot (computer storage); Geography; Computer science; Database","score_opus":0.042477762646939116,"score_gpt":0.31688728249144965,"score_spread":0.27440951984451056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236588838","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005586477,0.016187215,0.0011004298,0.1233554,0.81716865,0.00013501062,0.0010310358,0.001627925,0.038835667],"genre_scores_gemma":[0.0059145032,0.037687123,0.0026120255,0.07100433,0.67922425,0.0002988036,0.004324796,0.004633762,0.1943004],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99453676,0.0005977264,0.0003979372,0.00043263118,0.0032419444,0.000793119],"domain_scores_gemma":[0.9657647,0.003997792,0.0013784256,0.0015715205,0.012180985,0.015106515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010035637,0.0017940429,0.0019542621,0.0042247293,0.0048221895,0.025908869,0.0039570797,0.0079541085,0.10459165],"category_scores_gemma":[0.022701591,0.0008605402,0.0014790545,0.0056166025,0.0028172776,0.014728227,0.0061975108,0.010043485,0.06768722],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011636475,0.000010151837,0.00005031612,0.00008144106,0.0000019075103,0.000039815022,0.000030498222,0.000017338065,0.000043943666,0.00048698043,0.9925051,0.006720865],"study_design_scores_gemma":[0.00000531005,0.0000105131785,0.00020946699,0.00010269488,0.0000030772303,0.00006531209,0.000075991506,0.000022164852,0.000038450507,0.00025342125,0.99920505,0.0000084860185],"about_ca_topic_score_codex":0.003819357,"about_ca_topic_score_gemma":0.006935544,"teacher_disagreement_score":0.10459165,"about_ca_system_score_codex":0.0037635362,"about_ca_system_score_gemma":0.00882628,"threshold_uncertainty_score":0.34989393},"labels":[],"label_agreement":null},{"id":"W4237253841","doi":"10.1002/cpe.1611","title":"e‐Science Central for CARMEN: science as a service","year":2010,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University","keywords":"Workflow; Cloud computing; Computer science; World Wide Web; Scalability; Exploit; Software versioning; Software; Software engineering; Data science; Database; Operating system; Computer security","score_opus":0.09206965903151014,"score_gpt":0.4668605025260619,"score_spread":0.3747908434945518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237253841","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07700191,0.0037932738,0.48926905,0.052843057,0.0022488746,0.0016755705,0.002898733,0.09878496,0.27148455],"genre_scores_gemma":[0.67535204,0.0028552574,0.20450392,0.0076390393,0.0012317477,0.00078003167,0.005295638,0.0030732686,0.09926896],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977968,0.0005902319,0.00013605162,0.0002543782,0.00083456485,0.00038804876],"domain_scores_gemma":[0.99248755,0.0012841353,0.0005116216,0.001485239,0.0020086833,0.0022227885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031159355,0.00043464356,0.0005577732,0.0010011394,0.0015319627,0.0056414995,0.002061146,0.0024191134,0.034388997],"category_scores_gemma":[0.006658711,0.000349965,0.00033867112,0.0023524729,0.000885826,0.0040600584,0.004027242,0.0016098683,0.014564096],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010147514,0.0005750194,0.0077479035,0.00052331446,0.00009341861,0.0012651881,0.0012214356,0.0053160265,0.022344328,0.11108033,0.4982683,0.35055],"study_design_scores_gemma":[0.00021757117,0.00019766393,0.0030740548,0.00011628022,0.0000393085,0.0005732466,0.0007862738,0.05231483,0.009180093,0.030599192,0.9028097,0.00009179454],"about_ca_topic_score_codex":0.00398585,"about_ca_topic_score_gemma":0.0025087665,"teacher_disagreement_score":0.034388997,"about_ca_system_score_codex":0.001746831,"about_ca_system_score_gemma":0.004945118,"threshold_uncertainty_score":0.11504263},"labels":[],"label_agreement":null},{"id":"W4238657552","doi":"10.1002/cpe.1405","title":"Distributed parallel compilation of MSBNs","year":2009,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Tree traversal; Asynchronous communication; Compiler; Set (abstract data type); Inference; Simple (philosophy); Distributed computing; Theoretical computer science; Parallel computing; Programming language; Artificial intelligence; Computer network","score_opus":0.0319058293536043,"score_gpt":0.33328489136371864,"score_spread":0.30137906201011433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238657552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032432795,0.00011925961,0.957099,0.00011126729,0.000048773367,0.00011475081,0.000116881,0.0064733443,0.0034839872],"genre_scores_gemma":[0.34574884,0.00011914103,0.648913,0.00009689691,0.00003374938,0.00023193264,0.00041674048,0.0008303289,0.0036093306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870706,0.00044565604,0.00008939237,0.00027177483,0.00036617543,0.0001198622],"domain_scores_gemma":[0.9967816,0.0013808387,0.00020300933,0.00096532295,0.0005435035,0.00012581477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012802943,0.00063029147,0.0005629433,0.00069741305,0.0005585428,0.0010070321,0.0010768146,0.00038477397,0.0056621656],"category_scores_gemma":[0.0050279032,0.00046202893,0.00073375535,0.0006768874,0.0007287081,0.0011761306,0.0014536808,0.00082831195,0.0009131604],"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.00047018085,0.00023948884,0.0026164816,0.00035138032,0.000108098546,0.00041301348,0.000680247,0.45426443,0.017599067,0.063187204,0.00768571,0.45238468],"study_design_scores_gemma":[0.00008864876,0.00006485094,0.00041507906,0.00003102441,0.000033106324,0.00011579114,0.00008499915,0.9318556,0.011194627,0.045187667,0.010910865,0.00001773237],"about_ca_topic_score_codex":0.0038408868,"about_ca_topic_score_gemma":0.004733241,"teacher_disagreement_score":0.0056621656,"about_ca_system_score_codex":0.0007422224,"about_ca_system_score_gemma":0.0012682901,"threshold_uncertainty_score":0.01894188},"labels":[],"label_agreement":null},{"id":"W4239287583","doi":"10.1002/cpe.1349","title":"Optimizing process allocation of parallel programs for heterogeneous clusters","year":2008,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"Japan Society for the Promotion of Science","keywords":"Benchmark (surveying); Fast Fourier transform; Computer science; Process (computing); Predictability; Finite element method; Parallel computing; Computational fluid dynamics; Listing (finance); Algorithm; Computational science; Mathematical optimization; Mathematics; Statistics","score_opus":0.04248969868934799,"score_gpt":0.33678858178336796,"score_spread":0.29429888309401997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239287583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38254124,0.00014958996,0.6113816,0.00014066367,0.000025682386,0.00010685475,0.000039733375,0.0013869059,0.0042277453],"genre_scores_gemma":[0.89802957,0.0000695426,0.10068558,0.000021037562,0.000008376858,0.000108352055,0.0000580141,0.00013440286,0.0008851452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994783,0.00018439947,0.000019743264,0.00009460612,0.00014564069,0.00007735155],"domain_scores_gemma":[0.9992735,0.00030472293,0.000079574704,0.00015715993,0.0001391156,0.00004596979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090138236,0.00049758,0.0005378418,0.00042690907,0.0004898501,0.00067128614,0.0009132361,0.00036344677,0.0010061432],"category_scores_gemma":[0.0027288366,0.00028906274,0.00032576488,0.0007321593,0.0005022211,0.000968058,0.00072843384,0.000483339,0.00020661544],"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.00012461153,0.000069864946,0.001301044,0.000027285736,0.000012515383,0.000040126375,0.000059728565,0.9553625,0.010654559,0.0058010234,0.00039458828,0.026152225],"study_design_scores_gemma":[0.000006565998,0.000015885116,0.00008926015,6.5885445e-7,0.0000019495299,0.0000026713321,0.000007710745,0.99615854,0.002582886,0.0009715955,0.00016068421,0.0000016445236],"about_ca_topic_score_codex":0.003218313,"about_ca_topic_score_gemma":0.002436261,"teacher_disagreement_score":0.003218313,"about_ca_system_score_codex":0.0009051735,"about_ca_system_score_gemma":0.0010656868,"threshold_uncertainty_score":0.006567478},"labels":[],"label_agreement":null},{"id":"W4239575612","doi":"10.1002/cpe.1293","title":"Towards an integrated GIS‐based coastal forecast workflow","year":2008,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Bedford Institute of Oceanography; Fisheries and Oceans Canada","funders":"National Oceanic and Atmospheric Administration","keywords":"Geospatial analysis; Workflow; Context (archaeology); Computer science; Grid; SCOOP; Geographic information system; Storm surge; Variety (cybernetics); Meteorology; Storm; Database; Remote sensing; Geography","score_opus":0.04360194105333639,"score_gpt":0.3155570917525859,"score_spread":0.2719551506992495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239575612","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006764652,0.000045797187,0.97208655,0.0005411494,0.000047456106,0.00017842883,0.0011076512,0.016635895,0.002592522],"genre_scores_gemma":[0.071790785,0.00013348967,0.9184987,0.00011884894,0.000019429088,0.00018122887,0.006058961,0.0006779889,0.0025205796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817777,0.00034301673,0.0002483887,0.00045217283,0.000660583,0.00011813588],"domain_scores_gemma":[0.9965146,0.0006906424,0.00016715682,0.0011613367,0.0011030782,0.00036318833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055486304,0.00084991223,0.0008222642,0.0021101355,0.0011491637,0.0041305283,0.0034007777,0.0009615037,0.003647789],"category_scores_gemma":[0.0065496042,0.0007618451,0.0012796919,0.003002263,0.001021787,0.003383941,0.0038583293,0.0016790207,0.0020464698],"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.0005005001,0.0006292038,0.008014946,0.00038673362,0.00023581872,0.00092885265,0.0018377503,0.3268515,0.014678253,0.08922238,0.05325467,0.5034594],"study_design_scores_gemma":[0.00008216666,0.000029312489,0.0007143683,0.00006704521,0.000033963315,0.00009589615,0.00052851293,0.8767793,0.009368415,0.060523648,0.051732577,0.000044786022],"about_ca_topic_score_codex":0.025692344,"about_ca_topic_score_gemma":0.018090686,"teacher_disagreement_score":0.025692344,"about_ca_system_score_codex":0.0016214798,"about_ca_system_score_gemma":0.0041265134,"threshold_uncertainty_score":0.05108559},"labels":[],"label_agreement":null},{"id":"W4240841027","doi":"10.1002/cpe.1577","title":"A formalized approach for designing a P2P‐based dynamic load balancing scheme","year":2010,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Canada Research Chairs","keywords":"Computer science; Quality of service; Load balancing (electrical power); Distributed computing; Emulation; Scheduling (production processes); Computer network; Engineering; Grid","score_opus":0.02011401221474497,"score_gpt":0.3180770782938474,"score_spread":0.29796306607910245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240841027","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035153057,0.000025784893,0.99375945,0.0001707063,0.000017009681,0.00013913073,0.00001864944,0.00017094873,0.002182993],"genre_scores_gemma":[0.19445008,0.00015328902,0.8011083,0.0000992917,0.00003089531,0.00062039087,0.00008158412,0.000058993555,0.0033971297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893194,0.00032464898,0.00010312174,0.00016713618,0.00037597,0.0000972104],"domain_scores_gemma":[0.9992015,0.00025972087,0.00008896849,0.00019611363,0.00018819117,0.0000655176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017642892,0.00050546235,0.00037142384,0.000625324,0.0011510103,0.002164874,0.0018666835,0.0011372215,0.0029718517],"category_scores_gemma":[0.003513002,0.00045542247,0.0007584886,0.0006458465,0.0015875628,0.00243039,0.0018464115,0.001590667,0.0007355364],"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.00008365291,0.00014516767,0.00043591295,0.0002084985,0.000049662445,0.00037141555,0.00053428404,0.16148105,0.02198901,0.75687504,0.002373329,0.055453066],"study_design_scores_gemma":[0.00008985388,0.00009112459,0.00013456057,0.00003894718,0.000039233335,0.00023171047,0.00010454582,0.8643036,0.009297576,0.10428461,0.021355068,0.000029198029],"about_ca_topic_score_codex":0.0020922788,"about_ca_topic_score_gemma":0.0020755897,"teacher_disagreement_score":0.0029718517,"about_ca_system_score_codex":0.0014271187,"about_ca_system_score_gemma":0.001985817,"threshold_uncertainty_score":0.010354459},"labels":[],"label_agreement":null},{"id":"W4240874170","doi":"10.1002/cpe.1398","title":"Design of a virtual environment aided by a model‐based formal approach using DEVS","year":2009,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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 Ottawa","funders":"","keywords":"DEVS; Computer science; Human–computer interaction; Software engineering; Virtual machine; X3D; Event (particle physics); Virtual reality; Modeling and simulation; Simulation; Programming language","score_opus":0.045107300504691916,"score_gpt":0.28277629577075164,"score_spread":0.23766899526605972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240874170","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008421752,0.00004366933,0.98872083,0.000085102765,0.00002205114,0.00014113475,0.00005351887,0.0009586423,0.001553413],"genre_scores_gemma":[0.23608916,0.00019057703,0.7601939,0.000067223526,0.000012836419,0.00054290553,0.00032700313,0.0002484387,0.002328078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997874,0.00091463,0.00019271208,0.00016562703,0.0006895146,0.00016349646],"domain_scores_gemma":[0.99677074,0.0020912725,0.00023872593,0.0003408469,0.00046847636,0.000089915986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036316998,0.000753314,0.00056887214,0.0008757451,0.0005898966,0.0020004876,0.0016240011,0.0008867106,0.003085638],"category_scores_gemma":[0.0051080505,0.0009047476,0.0015951557,0.0003076263,0.0015228312,0.0011380082,0.0016646722,0.0012142094,0.0004209992],"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.0001764321,0.00018469691,0.0019796134,0.00056186854,0.00008614816,0.0009623008,0.0011387472,0.6972727,0.015226544,0.21845584,0.0012299643,0.06272517],"study_design_scores_gemma":[0.000083778876,0.000093238814,0.00016169745,0.000108378954,0.000045613688,0.0001571813,0.00010409857,0.9525642,0.0111209005,0.016162917,0.019364405,0.00003365216],"about_ca_topic_score_codex":0.0035444768,"about_ca_topic_score_gemma":0.0030335966,"teacher_disagreement_score":0.0036316998,"about_ca_system_score_codex":0.0010053815,"about_ca_system_score_gemma":0.0020615729,"threshold_uncertainty_score":0.019206464},"labels":[],"label_agreement":null},{"id":"W4247258147","doi":"10.1002/cpe.1264","title":"Babylon: middleware for distributed, parallel, and mobile Java applications","year":2008,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Hospital for Sick Children","funders":"","keywords":"Java; Computer science; Middleware (distributed applications); Operating system; Workstation; Asynchronous communication; Interface (matter); Class (philosophy); Distributed object; Distributed computing; Common Object Request Broker Architecture; Computer network","score_opus":0.033092069753377695,"score_gpt":0.3156579772345361,"score_spread":0.2825659074811584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247258147","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005793143,0.001643092,0.75339794,0.00054305355,0.00048468466,0.00057865004,0.0006424183,0.22835736,0.008559535],"genre_scores_gemma":[0.13275562,0.0033510607,0.76808786,0.0014459728,0.00048179264,0.0023793206,0.0072065974,0.041866947,0.042424854],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967638,0.00070274784,0.0005079504,0.00044037125,0.0011758133,0.0004093377],"domain_scores_gemma":[0.99604553,0.000756028,0.00063121656,0.0010890753,0.0006424359,0.0008356967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003954742,0.0015542398,0.0013666162,0.0018711595,0.00082870113,0.0025274865,0.0053391443,0.0014425347,0.011705018],"category_scores_gemma":[0.009140943,0.0020987252,0.001085906,0.0012319256,0.0009391037,0.005584796,0.0073218355,0.0035299857,0.010324804],"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.0020945007,0.00045047628,0.0038937356,0.003109321,0.00039918948,0.0017869757,0.0020617994,0.021041196,0.11771297,0.05867643,0.28444877,0.5043246],"study_design_scores_gemma":[0.00074090675,0.0006109383,0.0033786537,0.0006460775,0.00020477458,0.0026195853,0.0003004161,0.15984337,0.051925745,0.027861072,0.7513392,0.00052929414],"about_ca_topic_score_codex":0.001527338,"about_ca_topic_score_gemma":0.0012469621,"teacher_disagreement_score":0.011705018,"about_ca_system_score_codex":0.0011115458,"about_ca_system_score_gemma":0.0022150183,"threshold_uncertainty_score":0.039157152},"labels":[],"label_agreement":null},{"id":"W4250704650","doi":"10.1002/cpe.1450","title":"Guest Editorial: Distributed Simulation, Virtual Environments and Real‐time Applications","year":2009,"lang":"en","type":"editorial","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Avatar; Field (mathematics); Process (computing); Human–computer interaction; Virtual reality; Multimedia; Virtual machine; Representation (politics); Concurrency; Virtual representation; Affordance; World Wide Web; Programming language","score_opus":0.009576899784547682,"score_gpt":0.3067561795413589,"score_spread":0.29717927975681124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250704650","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045004115,0.0046702498,0.00037874162,0.01287444,0.98051065,0.000018466659,0.000035249228,0.00008768894,0.0013794539],"genre_scores_gemma":[0.0004161943,0.0044110967,0.00014226692,0.0054677743,0.9822764,0.000026419482,0.00004546829,0.00010778465,0.0071067046],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9915622,0.0010495273,0.0011109167,0.0013986166,0.0041940617,0.00068475027],"domain_scores_gemma":[0.9679607,0.011024127,0.0019806472,0.0010859673,0.012055849,0.005892697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067890864,0.0051825023,0.005162794,0.005149024,0.0030131082,0.012556603,0.004669469,0.012501726,0.03715454],"category_scores_gemma":[0.01778253,0.0017185573,0.0042122607,0.002462138,0.002796712,0.0070139207,0.003255074,0.016451787,0.020618591],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075833465,0.000025688343,0.000044337838,0.0002738225,0.000020386296,0.00010454086,0.000016320984,0.000079430436,0.000117185875,0.00045663115,0.99122405,0.007561833],"study_design_scores_gemma":[0.000072506955,0.00007490881,0.00022232816,0.00027620042,0.000038747898,0.00030640172,0.000045136578,0.00037672068,0.0001334989,0.00095471437,0.9974759,0.000022871945],"about_ca_topic_score_codex":0.00077105145,"about_ca_topic_score_gemma":0.0015058016,"teacher_disagreement_score":0.03715454,"about_ca_system_score_codex":0.002630095,"about_ca_system_score_gemma":0.002142973,"threshold_uncertainty_score":0.12429428},"labels":[],"label_agreement":null},{"id":"W4252223772","doi":"10.1002/cpe.1508","title":"StgDomain—scalable parallel domain software components for particle‐in‐cell finite element methods","year":2009,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Government; National Cancer Research Institute; University of Canterbury; Monash University; Ontario Ministry of Natural Resources and Forestry","keywords":"Computer science; Finite element method; Scalability; Computational science; Domain (mathematical analysis); Parallel computing; Software; Programming language; Mathematics; Engineering; Structural engineering; Operating system; Mathematical analysis","score_opus":0.04844471670493381,"score_gpt":0.3930652425231359,"score_spread":0.3446205258182021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252223772","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04935844,0.00018094668,0.9212639,0.00014665155,0.00008894975,0.0002179819,0.00031003938,0.02066409,0.007768961],"genre_scores_gemma":[0.4737174,0.00021163448,0.51485294,0.000106582265,0.000029546907,0.00053533673,0.001532701,0.00295599,0.006057809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933124,0.00014405194,0.000044476128,0.00006581168,0.00036200363,0.000052438132],"domain_scores_gemma":[0.998502,0.0005411875,0.00011772331,0.00037081455,0.00036269077,0.00010560633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094387546,0.00074953644,0.00050191313,0.0006676545,0.00041761584,0.0011092778,0.0019883306,0.0005943856,0.0059804576],"category_scores_gemma":[0.003959828,0.00037987475,0.00044691202,0.00058414444,0.0005483426,0.0012757763,0.0020043051,0.00083636807,0.0015256294],"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.0009061948,0.00037616098,0.006434166,0.00033345394,0.00014650608,0.00037254803,0.00054937287,0.5245457,0.04213576,0.05351673,0.026564972,0.34411842],"study_design_scores_gemma":[0.000056936024,0.000042823078,0.00030721727,0.00001236047,0.000007729911,0.000034660705,0.00002307461,0.97642267,0.009841669,0.003972837,0.009265377,0.000012688005],"about_ca_topic_score_codex":0.0018265862,"about_ca_topic_score_gemma":0.0016883637,"teacher_disagreement_score":0.0059804576,"about_ca_system_score_codex":0.0004969654,"about_ca_system_score_gemma":0.0010582438,"threshold_uncertainty_score":0.020006657},"labels":[],"label_agreement":null},{"id":"W4255149814","doi":"10.1002/cpe.1400","title":"A biologically inspired framework for multimedia service management in a ubiquitous environment","year":2009,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Transcoding; Computer science; Scalability; Mobile QoS; Quality of service; Multimedia; Service (business); Process (computing); Key (lock); Service composition; Distributed computing; Computer network; Service provider; Database; Computer security; Operating system","score_opus":0.02133997700991505,"score_gpt":0.3119779216447664,"score_spread":0.2906379446348514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255149814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011878322,0.000901826,0.97344714,0.0011579713,0.00013172934,0.00014289882,0.00004684384,0.0006116707,0.011681453],"genre_scores_gemma":[0.2246505,0.000941839,0.7669387,0.00031046054,0.00010892476,0.00040242597,0.00010716734,0.00007484276,0.0064651477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995765,0.00010840162,0.000024882796,0.00007196383,0.00017974057,0.00003850007],"domain_scores_gemma":[0.99975795,0.000072064395,0.000026517635,0.000031037573,0.000052689255,0.00005978891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009385277,0.00041316208,0.00045104162,0.00067380996,0.0011022682,0.001735674,0.0016859712,0.0013515332,0.0024083126],"category_scores_gemma":[0.0009071455,0.000255634,0.00081118045,0.00052037986,0.0018358825,0.0012035995,0.0014179642,0.001083291,0.00048431096],"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.00004080489,0.00010923027,0.00044776077,0.00021285853,0.000063252905,0.0005510418,0.0006054524,0.12300211,0.02359545,0.7901241,0.003645208,0.057602677],"study_design_scores_gemma":[0.000059393737,0.000092246286,0.00037385442,0.00008907234,0.00005847448,0.00042714665,0.00019219692,0.70076305,0.004661668,0.22106224,0.072168574,0.000052136307],"about_ca_topic_score_codex":0.005256931,"about_ca_topic_score_gemma":0.005097102,"teacher_disagreement_score":0.005256931,"about_ca_system_score_codex":0.0016652928,"about_ca_system_score_gemma":0.0018277473,"threshold_uncertainty_score":0.012082636},"labels":[],"label_agreement":null},{"id":"W4286220023","doi":"10.1002/cpe.7188","title":"Visualization of profiling and tracing in CPU‐GPU programs","year":2022,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Debugging; Tracing; Profiling (computer programming); Parallel computing; Visualization; SIMD; Symmetric multiprocessor system; Kernel (algebra); Central processing unit; Queue; Operating system; Programming language; Artificial intelligence","score_opus":0.03139827628702556,"score_gpt":0.3462476522100001,"score_spread":0.3148493759229745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286220023","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51871234,0.0007867165,0.38202,0.0011413184,0.0002982146,0.00014894591,0.00283133,0.074513316,0.019547764],"genre_scores_gemma":[0.87550724,0.0003191385,0.11322932,0.00010770769,0.00003462471,0.000074701056,0.0018964467,0.0039385613,0.0048921546],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995327,0.00009342149,0.000027449709,0.000057806257,0.00021583233,0.0000729304],"domain_scores_gemma":[0.99816436,0.000689133,0.00013500858,0.00034833967,0.0004802574,0.00018287821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059619494,0.00065478985,0.0003522925,0.0015122268,0.00035344416,0.0011009328,0.0006452224,0.00037797232,0.004003842],"category_scores_gemma":[0.0021391087,0.00018974148,0.00036640107,0.00103428,0.00037236264,0.000709405,0.0007190566,0.0010146139,0.000476866],"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.0020603137,0.00071244244,0.038816217,0.0008778235,0.00017095447,0.0018776187,0.007094122,0.21827936,0.17696358,0.038803633,0.051444948,0.46289897],"study_design_scores_gemma":[0.000054748,0.00018661752,0.016772527,0.00015284767,0.00004729814,0.00037743963,0.0005596988,0.8302676,0.10708189,0.0061122053,0.03828463,0.00010241568],"about_ca_topic_score_codex":0.0050431048,"about_ca_topic_score_gemma":0.0027512044,"teacher_disagreement_score":0.0050431048,"about_ca_system_score_codex":0.00062062073,"about_ca_system_score_gemma":0.00080073264,"threshold_uncertainty_score":0.013394237},"labels":[],"label_agreement":null},{"id":"W4289520941","doi":"10.1002/cpe.7219","title":"Machine learning and IoT‐based model for patient monitoring and early prediction of diabetes","year":2022,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Artificial Intelligence in Healthcare","field":"Health Professions","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pan Am Clinic","funders":"","keywords":"Machine learning; Computer science; Naive Bayes classifier; Artificial intelligence; Random forest; Support vector machine; Decision tree; Receiver operating characteristic; Logistic regression; Python (programming language)","score_opus":0.1283474163911486,"score_gpt":0.45726478509937785,"score_spread":0.32891736870822924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289520941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36182866,0.0014703408,0.6175343,0.0018763102,0.0004122821,0.00019075017,0.0014493569,0.0021071946,0.013130924],"genre_scores_gemma":[0.98306054,0.0002629399,0.012425958,0.00007488399,0.000040496285,0.00014106071,0.0003696124,0.000014025524,0.0036103432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997627,0.000051565352,0.000016362534,0.000064278174,0.000056376473,0.000048744703],"domain_scores_gemma":[0.99959177,0.00019046827,0.00004450614,0.000017211074,0.00013895422,0.000017142307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000562053,0.00045656197,0.00058890565,0.0005174204,0.00029319947,0.0006662034,0.0006719973,0.0006795287,0.0021409602],"category_scores_gemma":[0.001325439,0.00019091126,0.0006266622,0.00037476863,0.0001989857,0.00038357746,0.00034513357,0.000664981,0.00045097736],"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.00012448682,0.00013402247,0.00885196,0.00004030283,0.00005157692,0.00012215017,0.00003286342,0.963674,0.0008411892,0.0014689473,0.0011369259,0.023521531],"study_design_scores_gemma":[0.0000024745877,0.000016856555,0.00059854425,0.0000031104541,0.0000060794237,0.000011914075,0.000002484704,0.9988986,0.00009617248,0.00023832559,0.00012279561,0.0000026304695],"about_ca_topic_score_codex":0.012911074,"about_ca_topic_score_gemma":0.0056068427,"teacher_disagreement_score":0.012911074,"about_ca_system_score_codex":0.00068210333,"about_ca_system_score_gemma":0.0008250433,"threshold_uncertainty_score":0.02567184},"labels":[],"label_agreement":null},{"id":"W4292770508","doi":"10.1002/cpe.7303","title":"Enabling power measurement and control on Astra: The first petascale Arm supercomputer","year":2022,"lang":"en","type":"paratext","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Nuclear Security Administration","keywords":"Petascale computing; Supercomputer; ASTRA; Computer science; Parallel computing; Computational science; Operating system; Physics","score_opus":0.028778159703394906,"score_gpt":0.29736654502218235,"score_spread":0.2685883853187874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292770508","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32753786,0.004173654,0.25983638,0.018388957,0.002254531,0.000906004,0.0064575323,0.07784898,0.302596],"genre_scores_gemma":[0.82828665,0.0011123923,0.1051199,0.001496706,0.00035053585,0.00037569721,0.0044877143,0.0027664069,0.056004066],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982843,0.00025627261,0.000062078565,0.0001612141,0.0011151012,0.0001210619],"domain_scores_gemma":[0.9983991,0.0002327354,0.000084083236,0.00039233838,0.00073298183,0.00015880441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011621059,0.00042599565,0.00036003994,0.0005027348,0.0007139851,0.0014797815,0.00066321617,0.0004249482,0.0069582677],"category_scores_gemma":[0.0019654685,0.00028496017,0.00020308935,0.00077363406,0.0007364755,0.0014635532,0.0010076761,0.0015668888,0.0032051879],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010302166,0.00040526298,0.0071506975,0.0004400225,0.00007705299,0.00065925904,0.0011355198,0.04392028,0.13379908,0.035993572,0.3990666,0.3763225],"study_design_scores_gemma":[0.00018121561,0.0008254488,0.009798493,0.00013530924,0.000052648207,0.0003692757,0.00033458235,0.13019888,0.14075993,0.010944111,0.7062062,0.00019389826],"about_ca_topic_score_codex":0.0053762663,"about_ca_topic_score_gemma":0.0062615266,"teacher_disagreement_score":0.0069582677,"about_ca_system_score_codex":0.0010930144,"about_ca_system_score_gemma":0.0015382906,"threshold_uncertainty_score":0.02327776},"labels":[],"label_agreement":null},{"id":"W4307918986","doi":"10.1002/cpe.7348","title":"Breast lesion identification and categorization using mammography screening based on combined convolutional recursive neural network framework with parameters optimized using multi‐objective seagull optimization algorithm","year":2022,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"AI in cancer detection","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Mammography; Convolutional neural network; Artificial intelligence; Artificial neural network; Pattern recognition (psychology); Algorithm; Identification (biology); Machine learning; Breast cancer; Cancer; Medicine","score_opus":0.033870215734192376,"score_gpt":0.30506608446506084,"score_spread":0.2711958687308685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307918986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10803032,0.0006424667,0.88639665,0.0002938035,0.00004535827,0.00005485002,0.000074824085,0.0011983095,0.0032634216],"genre_scores_gemma":[0.81734246,0.0002989255,0.17752853,0.00017230584,0.000026785607,0.00007976095,0.00024795433,0.00006953106,0.0042337785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998394,0.000026535861,0.000010350329,0.000042574375,0.000054844488,0.0000262934],"domain_scores_gemma":[0.9998597,0.000037994927,0.000022393098,0.000011725779,0.000059448717,0.00000862995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000332985,0.0005323193,0.00040169043,0.00046482522,0.0001561066,0.00035902983,0.00056491996,0.00051268603,0.0008778815],"category_scores_gemma":[0.00070980296,0.00020885242,0.00047056796,0.00022713908,0.00020129493,0.00040845896,0.00029692965,0.00033086608,0.00018371554],"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.00014104696,0.00006077588,0.004053869,0.000076509634,0.00007249122,0.000121320314,0.00005382037,0.75397503,0.017601816,0.0019758279,0.0016708531,0.22019657],"study_design_scores_gemma":[0.0000023585928,0.0000124003955,0.0003973449,0.0000031999894,0.000006094251,0.000017747421,0.000004265438,0.99753475,0.0015959867,0.0002629021,0.00015991762,0.0000030487313],"about_ca_topic_score_codex":0.011034782,"about_ca_topic_score_gemma":0.011350445,"teacher_disagreement_score":0.011034782,"about_ca_system_score_codex":0.0005192772,"about_ca_system_score_gemma":0.0006283021,"threshold_uncertainty_score":0.021941125},"labels":[],"label_agreement":null},{"id":"W4317717687","doi":"10.1002/cpe.7635","title":"Performance comparison of Dask and Apache Spark on HPC systems for neuroimaging","year":2023,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canada Foundation for Innovation","keywords":"Computer science; SPARK (programming language); Big data; Python (programming language); File system; Neuroimaging; Pipeline (software); Database; Operating system; Programming language","score_opus":0.07232339667677312,"score_gpt":0.3845238603157263,"score_spread":0.31220046363895315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317717687","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88575846,0.0015976625,0.025414834,0.001359522,0.0007901834,0.00027392726,0.004210786,0.052481197,0.028113527],"genre_scores_gemma":[0.94190437,0.00057643245,0.040434692,0.0002566326,0.000095443684,0.00021855779,0.0104409885,0.0033704084,0.0027024576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994068,0.0010539301,0.00062116503,0.0011564373,0.0022353765,0.00086499355],"domain_scores_gemma":[0.99110174,0.0023105121,0.00034499934,0.0015947984,0.003334065,0.0013139495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067462805,0.0013528636,0.0012586245,0.0017087254,0.0012981453,0.0024448412,0.0030592808,0.0006701771,0.0026532942],"category_scores_gemma":[0.012061334,0.0006912036,0.0010311116,0.003052697,0.0014658936,0.0024764873,0.002632618,0.0014612218,0.0017751574],"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.024578378,0.0020698013,0.06451244,0.004238949,0.00201261,0.0013423268,0.0032995436,0.3957003,0.062134475,0.030683998,0.17751327,0.23191403],"study_design_scores_gemma":[0.0012900187,0.0012514957,0.040821355,0.00014513583,0.0002314522,0.0004319248,0.0015243379,0.8550457,0.05862294,0.00970985,0.030559555,0.00036621143],"about_ca_topic_score_codex":0.0119335,"about_ca_topic_score_gemma":0.0067232153,"teacher_disagreement_score":0.0119335,"about_ca_system_score_codex":0.0020286331,"about_ca_system_score_gemma":0.0040002475,"threshold_uncertainty_score":0.03567815},"labels":[],"label_agreement":null},{"id":"W4321480070","doi":"10.1002/cpe.7655","title":"Design of a portable implementation of partitioned point‐to‐point communication primitives","year":2023,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Science Foundation of Sri Lanka; Office of Science; University of Alabama at Birmingham; Sandia National Laboratories; U.S. Department of Energy; National Nuclear Security Administration; National Science Foundation","keywords":"Computer science; Thread (computing); Message passing; Message Passing Interface; Parallel computing; Point-to-point; Multithreading; Initialization; Serialization; Interface (matter); Inter-process communication; Concurrency; Distributed computing; Operating system; Computer network; Programming language","score_opus":0.046346348883302496,"score_gpt":0.37714700333144846,"score_spread":0.330800654448146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321480070","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04142791,0.00015593057,0.92069715,0.00015503466,0.00006992667,0.00031974498,0.00019360326,0.032714527,0.004266248],"genre_scores_gemma":[0.42888692,0.0002197935,0.55453444,0.0004592954,0.000054263215,0.0008162686,0.0010991791,0.0032387727,0.010691076],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916196,0.00010997365,0.00007568468,0.00011345246,0.0003504651,0.00018858149],"domain_scores_gemma":[0.998591,0.00033921775,0.00017193031,0.0003420769,0.00037995694,0.00017574654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009950944,0.0009167044,0.00078244606,0.0010521696,0.00072611996,0.0019145967,0.004989442,0.0008743178,0.007561845],"category_scores_gemma":[0.002226982,0.0010960794,0.00092222187,0.00084401644,0.00081063097,0.0017657594,0.0022281385,0.0013407909,0.0034635537],"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.0035006532,0.0014408851,0.013737629,0.0015716221,0.00058860675,0.0021350072,0.0021013387,0.16021779,0.3804772,0.07959533,0.036506694,0.31812727],"study_design_scores_gemma":[0.00034198095,0.0009044641,0.0022479254,0.00011540113,0.00024333688,0.0003347625,0.00018370939,0.7436249,0.18666217,0.006451907,0.058739595,0.00014982632],"about_ca_topic_score_codex":0.003027337,"about_ca_topic_score_gemma":0.0018280187,"teacher_disagreement_score":0.007561845,"about_ca_system_score_codex":0.0010921338,"about_ca_system_score_gemma":0.0017400582,"threshold_uncertainty_score":0.025296867},"labels":[],"label_agreement":null},{"id":"W4367053587","doi":"10.1002/cpe.7712","title":"Multiscale aggregation and illumination‐aware attention network for infrared and visible image fusion","year":2023,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Advanced Image Fusion Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; Discriminative model; Artificial intelligence; Image fusion; Computer vision; Salient; Channel (broadcasting); Feature (linguistics); Fusion; Image (mathematics); Feature extraction; Focus (optics); Pattern recognition (psychology); Fusion rules; Optics","score_opus":0.014053380304732473,"score_gpt":0.31230037967996427,"score_spread":0.2982469993752318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367053587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096345425,0.0009227416,0.8979667,0.00033997992,0.00011935373,0.00008411491,0.000102852755,0.0010341107,0.0030847252],"genre_scores_gemma":[0.9100332,0.00036553937,0.08652325,0.00023258595,0.000100716294,0.00007959917,0.00023276191,0.00004653041,0.0023858813],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995958,0.000065589345,0.000021608537,0.00011458474,0.00012051826,0.000082001156],"domain_scores_gemma":[0.9995004,0.00016521473,0.000054434156,0.000056052766,0.00018552647,0.000038385948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009080314,0.0006733048,0.0007399586,0.0008801147,0.00043410546,0.00053845067,0.0011732382,0.00066366314,0.0012750104],"category_scores_gemma":[0.0019470609,0.00025229904,0.000692001,0.0006439197,0.00036817085,0.001176227,0.0014184235,0.00077794143,0.00017629322],"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.00048721896,0.0003033729,0.0036012165,0.00013593952,0.00018322362,0.00020485463,0.00018774993,0.4228956,0.04030331,0.0064067123,0.0042381035,0.52105266],"study_design_scores_gemma":[0.0000047951407,0.000039539736,0.00054350705,0.0000037070445,0.000023653638,0.000029942805,0.00001330757,0.9937617,0.0035417732,0.0016682235,0.00036423834,0.0000056203908],"about_ca_topic_score_codex":0.006740257,"about_ca_topic_score_gemma":0.0061665745,"teacher_disagreement_score":0.006740257,"about_ca_system_score_codex":0.0011272911,"about_ca_system_score_gemma":0.00066806126,"threshold_uncertainty_score":0.013402104},"labels":[],"label_agreement":null},{"id":"W4382894810","doi":"10.1002/cpe.7858","title":"A fairness‐aware task offloading method in edge‐enabled IIoT with multi‐constraints using AGE‐MOEA and weighted MMF","year":2023,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Quanzhou City Science and Technology Program; China Postdoctoral Science Foundation; National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Computer science; Task (project management); Quality of service; Latency (audio); Industrial Internet; Distributed computing; Interconnection; Pareto principle; Resource constraints; Mathematical optimization; Computer network; Internet of Things; Computer security; Mathematics","score_opus":0.05004743630308772,"score_gpt":0.3647906888879399,"score_spread":0.3147432525848522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382894810","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047886945,0.0002865075,0.94722855,0.00014346163,0.00007507169,0.000060977414,0.00003919648,0.0001744657,0.0041047703],"genre_scores_gemma":[0.7681543,0.00016179727,0.2271511,0.00016528027,0.000040181185,0.00012425806,0.00009075062,0.00008363321,0.004028694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995413,0.00011605677,0.000021769602,0.00008925663,0.00010312227,0.00012856093],"domain_scores_gemma":[0.99952114,0.00024059905,0.000043543037,0.000032525943,0.000110160574,0.0000520594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010875241,0.0009079825,0.000984807,0.0007052382,0.0007410379,0.0009804374,0.0010436982,0.0008407299,0.0020656383],"category_scores_gemma":[0.0015795828,0.00032703948,0.0009082391,0.0005985835,0.00047020635,0.0007100621,0.00090293004,0.00066893216,0.00016545024],"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.00008862898,0.000049313887,0.0006609861,0.000046483477,0.000030599425,0.00007547496,0.000045286037,0.9594574,0.002176644,0.0044449125,0.0007327391,0.03219156],"study_design_scores_gemma":[0.0000051276575,0.000016526115,0.00007763437,0.0000033376712,0.00000521739,0.000008993494,0.000010780291,0.99829143,0.00035620827,0.0010105482,0.00021091524,0.0000032853611],"about_ca_topic_score_codex":0.00977562,"about_ca_topic_score_gemma":0.009144248,"teacher_disagreement_score":0.00977562,"about_ca_system_score_codex":0.0008177949,"about_ca_system_score_gemma":0.0015382356,"threshold_uncertainty_score":0.019437432},"labels":[],"label_agreement":null},{"id":"W4386988327","doi":"10.1002/cpe.7917","title":"<scp>DeepMUI</scp>: A novel method to identify malicious users on online social network platforms","year":2023,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Tellabs (Canada)","funders":"","keywords":"Computer science; Malware; Pooling; Metadata; Identification (biology); Dissemination; Social network (sociolinguistics); World Wide Web; Phishing; Computer security; Social media; Task (project management); Internet privacy; Data science; The Internet; Artificial intelligence; Engineering","score_opus":0.05974817568560483,"score_gpt":0.39912975763397524,"score_spread":0.3393815819483704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386988327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2601928,0.0010111862,0.7100811,0.0024116104,0.0003434636,0.00033414603,0.0011080101,0.009980298,0.0145373475],"genre_scores_gemma":[0.8897093,0.00027110113,0.09776328,0.00041147502,0.00018189728,0.000081470695,0.0010249052,0.00015062524,0.010405896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996383,0.00006636196,0.000015713103,0.00007754113,0.00013141661,0.000070602],"domain_scores_gemma":[0.9992962,0.00014373938,0.00012650283,0.00012750487,0.00022370418,0.000082374056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050654466,0.0006933041,0.00044446002,0.0017034927,0.00052047113,0.000765834,0.00094032765,0.00069306296,0.0025883166],"category_scores_gemma":[0.0015671343,0.0002488896,0.00044341624,0.00067674357,0.0005313909,0.001314262,0.0012019502,0.0010508777,0.0009943291],"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.00038889807,0.0003078976,0.019579696,0.00023484317,0.0001454587,0.0007998936,0.0004522803,0.08049254,0.03327336,0.014488029,0.03465207,0.81518495],"study_design_scores_gemma":[0.0000036653996,0.000040466723,0.0023054848,0.000010862489,0.000010062902,0.00013725378,0.000050845596,0.9838468,0.008063356,0.002986393,0.0025303997,0.0000144170535],"about_ca_topic_score_codex":0.0053491388,"about_ca_topic_score_gemma":0.0069995383,"teacher_disagreement_score":0.0053491388,"about_ca_system_score_codex":0.0006644524,"about_ca_system_score_gemma":0.00060129724,"threshold_uncertainty_score":0.010635972},"labels":[],"label_agreement":null},{"id":"W4392353220","doi":"10.1002/cpe.8059","title":"A recurrence for the surface area of the (n,k)$$ \\left(n,k\\right) $$‐star graph","year":2024,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Star (game theory); Computer science; Graph; Star network; A* search algorithm; Surface (topology); Combinatorics; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; Network topology; Geometry; Computer network","score_opus":0.028157599498894282,"score_gpt":0.3089877351882812,"score_spread":0.2808301356893869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392353220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2992011,0.0009280791,0.62852436,0.0018156408,0.00037525818,0.000100368365,0.0007060299,0.00076745375,0.06758172],"genre_scores_gemma":[0.92122513,0.00040951298,0.063935995,0.00017576899,0.00014797732,0.0001199363,0.00043600475,0.00029331297,0.0132563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995926,0.000077582845,0.000032056018,0.00008947864,0.00013248726,0.0000757358],"domain_scores_gemma":[0.998166,0.00079537014,0.00019948976,0.00017102787,0.00056628004,0.00010180198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004905938,0.00030974494,0.0005314423,0.001203361,0.00061556575,0.00086564856,0.0007419745,0.00046174842,0.0059189643],"category_scores_gemma":[0.0034532347,0.00017052593,0.00059941504,0.00085702894,0.001011143,0.0017464702,0.00078753836,0.000786837,0.0011341284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008178863,0.00002671162,0.0032288823,0.0001581135,0.000024229761,0.0008625825,0.0005450745,0.061078764,0.01720301,0.84970045,0.010538951,0.05655146],"study_design_scores_gemma":[0.0000135727405,0.00005009012,0.0024897142,0.00003501459,0.000024087745,0.00083843933,0.00021367575,0.37673822,0.008675866,0.5954548,0.015406028,0.0000605051],"about_ca_topic_score_codex":0.0018333574,"about_ca_topic_score_gemma":0.0016139423,"teacher_disagreement_score":0.0059189643,"about_ca_system_score_codex":0.0009559355,"about_ca_system_score_gemma":0.00036675192,"threshold_uncertainty_score":0.019800842},"labels":[],"label_agreement":null},{"id":"W4413458719","doi":"10.1002/cpe.70238","title":"Cloudhive: A Cloud‐Based Framework for Smart Grid Co‐Simulation, Data, and Communication","year":2025,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Fredericton; University of New Brunswick","funders":"Atlantic Canada Opportunities Agency; Chinese Academy of Sciences","keywords":"Computer science; Cloud computing; Smart grid; Distributed computing; Grid; Operating system; Electrical engineering; Geology","score_opus":0.03150845662676002,"score_gpt":0.3795792603001423,"score_spread":0.3480708036733823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413458719","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008186267,0.00030472287,0.9308275,0.00041064815,0.00015875879,0.00029229076,0.0008316415,0.052303806,0.0066843554],"genre_scores_gemma":[0.40185556,0.00087613345,0.57168365,0.000769175,0.00010902643,0.0008419347,0.0054629953,0.009905715,0.00849583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926275,0.00017546203,0.000058725913,0.0001111128,0.00027863463,0.00011333424],"domain_scores_gemma":[0.9990501,0.00027090102,0.0000613137,0.00027003072,0.00017693566,0.00017063285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014509169,0.00084151054,0.0006897683,0.00068575726,0.00072106754,0.0019727563,0.00235606,0.0008956451,0.0049439],"category_scores_gemma":[0.0027138186,0.0006099049,0.001075023,0.0005809031,0.0009147287,0.0022555734,0.0030995319,0.0021379488,0.0012692477],"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.0008035791,0.00043293898,0.0065151486,0.0007654778,0.00042397366,0.0010961784,0.00094228325,0.5310719,0.022236288,0.1869655,0.09765964,0.15108712],"study_design_scores_gemma":[0.00009607809,0.000032669763,0.00045208287,0.000052805397,0.000019735435,0.000105438055,0.00004722507,0.9169263,0.0056738113,0.018383123,0.058154248,0.000056351844],"about_ca_topic_score_codex":0.011121986,"about_ca_topic_score_gemma":0.010065488,"teacher_disagreement_score":0.011121986,"about_ca_system_score_codex":0.0008610106,"about_ca_system_score_gemma":0.0020468156,"threshold_uncertainty_score":0.022114515},"labels":[],"label_agreement":null},{"id":"W4414986814","doi":"10.1002/cpe.70337","title":"A Systematic Overview of Caching Mechanisms to Improve Hadoop Performance","year":2025,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Cache; Key (lock); Data access; Resource (disambiguation); Relational database; Distributed database; Cache algorithms","score_opus":0.02576432047012451,"score_gpt":0.3240513279266728,"score_spread":0.2982870074565483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414986814","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075008325,0.5472216,0.34490776,0.0028174808,0.0012485445,0.0011070763,0.0012279165,0.008091498,0.018369779],"genre_scores_gemma":[0.50612605,0.18275423,0.3020721,0.0009131104,0.00089157803,0.00074122724,0.0026658757,0.0008927479,0.0029430343],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.99681085,0.0008700438,0.00041844486,0.000411027,0.001163548,0.00032606517],"domain_scores_gemma":[0.9920345,0.0029652368,0.0005223104,0.0007316944,0.003545715,0.00020058917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048371186,0.0014183086,0.0012571124,0.0049566682,0.0012846824,0.0027283537,0.0036526548,0.0010559517,0.00091730565],"category_scores_gemma":[0.01269589,0.000761811,0.0012121629,0.006139931,0.00070415396,0.00531407,0.001220851,0.0010642669,0.00043989575],"study_design_candidate":"systematic_review","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.00041417943,0.00022119505,0.010776957,0.0084082205,0.0004267152,0.00018229397,0.00064406823,0.022087531,0.012957082,0.025629494,0.02329463,0.89495754],"study_design_scores_gemma":[0.00027508332,0.0015779638,0.015805086,0.012828474,0.0019252053,0.0018837672,0.0023355202,0.37078843,0.08716925,0.046797205,0.45772824,0.00088583224],"about_ca_topic_score_codex":0.006680079,"about_ca_topic_score_gemma":0.005171091,"teacher_disagreement_score":0.006680079,"about_ca_system_score_codex":0.002007628,"about_ca_system_score_gemma":0.0042803986,"threshold_uncertainty_score":0.02558148},"labels":[],"label_agreement":null},{"id":"W4416301706","doi":"10.1002/cpe.70435","title":"Faster Positional‐Population Counts for AVX2, AVX‐512, and ASIMD","year":2025,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"","keywords":"SIMD; Set (abstract data type); Population; Adaptation (eye); Implementation; Instruction set","score_opus":0.01288505849856828,"score_gpt":0.3266617003134753,"score_spread":0.313776641814907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416301706","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18199152,0.00076615595,0.74647963,0.0007709205,0.0005034301,0.0002236475,0.0022408976,0.04128456,0.025739217],"genre_scores_gemma":[0.36581483,0.00015964184,0.61704993,0.00020461738,0.000047084308,0.0003251711,0.0035197188,0.0014677227,0.01141123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992636,0.00009491689,0.00007521445,0.00015311223,0.00031912664,0.00009404989],"domain_scores_gemma":[0.9988965,0.00031800428,0.000080094505,0.0002645208,0.00037435256,0.00006647361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000782155,0.0008379395,0.0004883603,0.0014873948,0.0008192441,0.0017131796,0.0018766936,0.00046122517,0.013216378],"category_scores_gemma":[0.003014432,0.00040325525,0.00044075915,0.0021112033,0.00051230623,0.0016369527,0.0012375696,0.00067154306,0.0023712858],"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.0016727749,0.00033089163,0.019700076,0.00039621472,0.000101390484,0.00038051998,0.00048008878,0.09366283,0.06255067,0.09958774,0.047320757,0.673816],"study_design_scores_gemma":[0.00022036262,0.00013611435,0.0024170938,0.00004811879,0.00002457222,0.00017573347,0.000150642,0.85496986,0.085415885,0.025290512,0.031077202,0.00007391733],"about_ca_topic_score_codex":0.0071021724,"about_ca_topic_score_gemma":0.010122558,"teacher_disagreement_score":0.013216378,"about_ca_system_score_codex":0.0020405224,"about_ca_system_score_gemma":0.0017268971,"threshold_uncertainty_score":0.044213176},"labels":[],"label_agreement":null},{"id":"W7111141754","doi":"10.1002/cpe.70477","title":"QTTARNN: A Highly‐Efficient Attention Driven Quantized Tensor Train Recursive Neural Network for Cyber‐Physical‐Social Intelligence","year":2025,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Artificial neural network; Lossless compression; Quantization (signal processing); Action (physics); Feature (linguistics); Recurrent neural network; Pattern recognition (psychology)","score_opus":0.0520028463967384,"score_gpt":0.4057809311656086,"score_spread":0.3537780847688702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7111141754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04781524,0.0017874531,0.94106835,0.0004918859,0.00030693345,0.00010083082,0.0003643382,0.004205123,0.003859809],"genre_scores_gemma":[0.74020755,0.00088981236,0.24608798,0.00040341442,0.0001276002,0.00018735707,0.0015542604,0.00021841054,0.010323583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979585,0.000034691682,0.000014301681,0.00006199518,0.00005609816,0.00003705886],"domain_scores_gemma":[0.9997621,0.000056133787,0.000024433251,0.000033791253,0.00010601364,0.000017438975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041308982,0.00075404305,0.00061879423,0.00032929235,0.00029702703,0.0005518518,0.001489355,0.0006822399,0.0020425976],"category_scores_gemma":[0.0011577014,0.00030767443,0.00052957336,0.0004638691,0.00031316737,0.00094569655,0.0006685427,0.0011519766,0.00055388774],"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.00019538487,0.00015875229,0.0014073696,0.0001414765,0.0001085689,0.000147215,0.00007493736,0.6067804,0.012370414,0.0059991563,0.011501988,0.3611144],"study_design_scores_gemma":[0.000003233498,0.000012869703,0.00006677691,0.000002260499,0.0000043042087,0.000005689293,0.0000025767943,0.9985637,0.0005717815,0.0004465288,0.0003175281,0.0000027865165],"about_ca_topic_score_codex":0.02470099,"about_ca_topic_score_gemma":0.023535162,"teacher_disagreement_score":0.02470099,"about_ca_system_score_codex":0.00083080906,"about_ca_system_score_gemma":0.0009984305,"threshold_uncertainty_score":0.049114466},"labels":[],"label_agreement":null},{"id":"W7117456447","doi":"10.1002/cpe.70496","title":"Predictive Modelling of Tick Distribution: A Machine Learning Approach to <i>Ixodes ricinus</i> Abundance","year":2025,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Vector-borne infectious diseases","field":"Immunology and Microbiology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute of Infection and Immunity","funders":"","keywords":"Random forest; Support vector machine; Hyperparameter optimization; Hyperparameter; Sampling (signal processing); Grid; Pipeline (software); Categorical variable; Feature selection; Feature (linguistics)","score_opus":0.01803323360797663,"score_gpt":0.2849989267748795,"score_spread":0.26696569316690283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117456447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32722393,0.0008567982,0.6646167,0.0009319106,0.00006775569,0.00010995977,0.0010914033,0.0020078805,0.003093696],"genre_scores_gemma":[0.9589567,0.00013552788,0.0394842,0.000065281936,0.00005552831,0.00006387875,0.00055397116,0.00003481401,0.00065012666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996105,0.00015942071,0.000022207323,0.00010525436,0.00005799176,0.00004469195],"domain_scores_gemma":[0.99856853,0.0008517602,0.00015704651,0.00009244712,0.00028687424,0.000043351658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017233938,0.000635253,0.0005876295,0.0013465463,0.00033264613,0.0008997121,0.0009684021,0.0005274548,0.0010156145],"category_scores_gemma":[0.0037403088,0.00027624745,0.00069902965,0.00082893134,0.00037920862,0.0006266754,0.00053409865,0.000975068,0.00029962376],"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.000042378808,0.000050057595,0.0076654223,0.000025545689,0.00005025299,0.00003236986,0.000021965381,0.961167,0.0005965062,0.0009989135,0.0006165904,0.028732967],"study_design_scores_gemma":[0.0000010224313,0.0000050844096,0.0004658956,0.000003853244,0.0000024593069,0.0000031801949,0.0000043302734,0.9988186,0.00011670968,0.0005045004,0.0000726791,0.0000017565218],"about_ca_topic_score_codex":0.016735276,"about_ca_topic_score_gemma":0.009364822,"teacher_disagreement_score":0.016735276,"about_ca_system_score_codex":0.00076795474,"about_ca_system_score_gemma":0.00076732965,"threshold_uncertainty_score":0.033275723},"labels":[],"label_agreement":null}]}