{"meta":{"query_hash":"bd4564b564ce","filters":{"venue":"The Journal of Supercomputing"},"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/bd4564b564ce","api":"https://metacan.xera.ac/api/v1/cohort?venue=The+Journal+of+Supercomputing"},"results":[{"id":"W1488661425","doi":"10.1023/a:1011179823237","title":"Improving A Solution's Quality Through Parallel Processing","year":2001,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"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","score_opus":0.04406715998923561,"score_gpt":0.3002528029644518,"score_spread":0.2561856429752162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488661425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26698437,0.00062117394,0.7299286,0.0019130365,0.00022276158,0.00006527469,1.512416e-7,0.00005928196,0.00020532911],"genre_scores_gemma":[0.86094964,0.00003270405,0.13811521,0.00042376886,0.000449009,4.3898208e-7,2.6548938e-7,0.0000111184345,0.000017856784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977341,0.00036340827,0.0007387482,0.00018014098,0.0005884044,0.00039519233],"domain_scores_gemma":[0.998341,0.00033498355,0.00055118225,0.0003254638,0.0003659165,0.000081458034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034414139,0.00016677835,0.00025915055,0.000091242284,0.00049520103,0.00022964284,0.0011689108,0.00005170662,0.000008512716],"category_scores_gemma":[0.000212078,0.00011544386,0.00013781255,0.00051297,0.00008568644,0.0020630534,0.00028064707,0.0004897232,0.000012875946],"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.0002528437,0.0004159962,0.004704145,0.00019509572,0.00010409568,0.00015821471,0.027470415,0.038436506,0.20402114,0.006203537,0.00091571343,0.7171223],"study_design_scores_gemma":[0.0021083495,0.00037888318,0.012432808,0.0004818131,0.000072727584,0.0041402476,0.0016467049,0.96183,0.0035699464,0.011584584,0.0011174788,0.00063643476],"about_ca_topic_score_codex":0.0002630587,"about_ca_topic_score_gemma":0.00000945987,"teacher_disagreement_score":0.9233935,"about_ca_system_score_codex":0.00014806983,"about_ca_system_score_gemma":0.0002081811,"threshold_uncertainty_score":0.4707664},"labels":[],"label_agreement":null},{"id":"W1512495408","doi":"10.1023/a:1013587415197","title":"Optimal BSR Solutions to Several Convex Polygon Problems","year":2002,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Polygon (computer graphics); Regular polygon; Computer science; Convex polygon; Star-shaped polygon; Point in polygon; Reduction (mathematics); Constant (computer programming); Convex set; Rectilinear polygon; Algorithm; Combinatorics; Mathematics; Convex optimization; Simple polygon; Geometry; Telecommunications","score_opus":0.04107786948675623,"score_gpt":0.23524618273809336,"score_spread":0.19416831325133713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512495408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3025896,0.0003972221,0.6918573,0.004357698,0.00047695494,0.000079975915,5.066421e-7,0.00002550794,0.00021524909],"genre_scores_gemma":[0.9307606,0.000018145956,0.06788971,0.00068735046,0.0004883261,5.7320176e-7,4.2869317e-7,0.000006066795,0.00014875864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864924,0.00014655339,0.00041978402,0.00011885393,0.00038392656,0.0002816389],"domain_scores_gemma":[0.99909216,0.00020878398,0.00013141625,0.00019004096,0.0002505456,0.00012704621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001134216,0.00010822849,0.00015524177,0.00018464238,0.0003902578,0.0001320872,0.0007148157,0.00003168155,0.000036452122],"category_scores_gemma":[0.00006306481,0.00007874117,0.00008593051,0.0005769216,0.00002563402,0.0005198941,0.0002223297,0.00023535936,0.00006119063],"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.0000048843317,0.00007458042,0.000056857167,0.000006114041,0.000031232288,0.000007750712,0.0057938974,0.95814484,0.0052489857,0.0028824713,0.005282967,0.02246544],"study_design_scores_gemma":[0.00034902286,0.00026281594,0.0010274432,0.00005506852,0.000016144266,0.00089641643,0.00014064943,0.9920607,0.000926459,0.00048527785,0.00362319,0.00015676256],"about_ca_topic_score_codex":0.000010948228,"about_ca_topic_score_gemma":0.0000016689925,"teacher_disagreement_score":0.628171,"about_ca_system_score_codex":0.000054328182,"about_ca_system_score_gemma":0.000042410156,"threshold_uncertainty_score":0.32109717},"labels":[],"label_agreement":null},{"id":"W1514982098","doi":"10.1023/a:1011118432742","title":"Selective Idling: Experiments in Transport Layer Energy Conservation","year":2001,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Idle; Computer network; Network congestion; Network packet; Node (physics); Transceiver; Distributed computing; Real-time computing; Wireless; Telecommunications","score_opus":0.023625062186739848,"score_gpt":0.24583507421647774,"score_spread":0.2222100120297379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514982098","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5943477,0.00037154657,0.4035053,0.0012027094,0.00019348047,0.00003069673,4.527313e-8,0.000017045275,0.0003314814],"genre_scores_gemma":[0.9967738,0.00006837326,0.0021089267,0.00079811394,0.0002109859,6.7616105e-7,1.9952319e-7,0.0000054881784,0.00003346699],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890584,0.0001544686,0.00041295038,0.00009436995,0.00023452661,0.00019785913],"domain_scores_gemma":[0.9993377,0.00020618679,0.00013960684,0.00012601512,0.00014242448,0.000048116905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008735011,0.000091378686,0.0001657208,0.000097903954,0.00009883216,0.000028020999,0.00049702654,0.00003685849,0.000005385734],"category_scores_gemma":[0.000014482858,0.000065254564,0.00005664936,0.00038421756,0.000022985381,0.00036594362,0.00002691947,0.0002021176,0.0000017123049],"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.00041694037,0.0005282639,0.11328853,0.000011155443,0.0002248149,0.000372297,0.02663429,0.15152594,0.017125389,0.026646921,0.0015401696,0.6616853],"study_design_scores_gemma":[0.0026143217,0.00028290274,0.03629991,0.00021761273,0.000029074896,0.0008279842,0.0009223327,0.94962394,0.0031332166,0.0019751778,0.0037565557,0.00031697543],"about_ca_topic_score_codex":0.00008053146,"about_ca_topic_score_gemma":0.000032271306,"teacher_disagreement_score":0.79809797,"about_ca_system_score_codex":0.000050313538,"about_ca_system_score_gemma":0.00008289288,"threshold_uncertainty_score":0.26610038},"labels":[],"label_agreement":null},{"id":"W1558179332","doi":"10.1023/a:1023948712732","title":"Computing the Euclidean Distance Transform on a Linear Array of Processors","year":2003,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Pixel; Computation; Euclidean distance; Metric (unit); Feature (linguistics); Algorithm; Artificial intelligence","score_opus":0.01907606018143219,"score_gpt":0.26737464587175164,"score_spread":0.24829858569031946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558179332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11839141,0.000388418,0.8746306,0.0013898069,0.00015545663,0.0001264074,5.545978e-7,0.000069806956,0.004847542],"genre_scores_gemma":[0.92282575,0.000017157548,0.076758556,0.00028486465,0.00007841101,3.0333334e-7,8.657691e-8,0.000015472833,0.000019392066],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99803257,0.0001990387,0.0007427238,0.00015087887,0.00056457793,0.0003102295],"domain_scores_gemma":[0.9980451,0.00065818225,0.00048549552,0.00039379124,0.00035568766,0.00006177843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00320817,0.00018254227,0.00029664044,0.000103228806,0.0002853189,0.00016024582,0.0019092478,0.000038573806,0.0000014053156],"category_scores_gemma":[0.00035265763,0.000096829026,0.00014067108,0.00061399594,0.00018371723,0.00068185525,0.00007469502,0.0004943409,0.000002240692],"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.00023023078,0.0013179563,0.0024987299,0.0007459685,0.0003775937,0.00009946122,0.087960064,0.02235835,0.0345608,0.12384848,0.0015305025,0.72447187],"study_design_scores_gemma":[0.0018798613,0.0020030239,0.0009641377,0.004405222,0.0001441194,0.0026048294,0.004055973,0.11624691,0.7669827,0.09095759,0.0085943295,0.0011613118],"about_ca_topic_score_codex":0.000004916596,"about_ca_topic_score_gemma":0.0000012177463,"teacher_disagreement_score":0.80443436,"about_ca_system_score_codex":0.00004282419,"about_ca_system_score_gemma":0.00013666695,"threshold_uncertainty_score":0.39485732},"labels":[],"label_agreement":null},{"id":"W1564285798","doi":"10.1007/11227.1573-0484","title":"The Journal of Supercomputing","year":2013,"lang":"en","type":"paratext","venue":"The Journal of Supercomputing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":276,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Supercomputer; Parallel computing; Computational science; Data science","score_opus":0.015916538136379235,"score_gpt":0.24322044759079622,"score_spread":0.22730390945441697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564285798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0823569,0.04122835,0.8309072,0.0026517508,0.033932947,0.0005855279,0.00001735446,0.00006189909,0.00825802],"genre_scores_gemma":[0.96872425,0.002538488,0.0102850385,0.0004525107,0.0124621,9.172934e-7,0.000010712937,0.00013292726,0.0053930604],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9904114,0.002464501,0.0038042937,0.00029931846,0.001902525,0.0011179348],"domain_scores_gemma":[0.986713,0.0049196533,0.004302537,0.0012161835,0.0025101884,0.0003384741],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.013093682,0.0007340678,0.0015208392,0.00042343288,0.0013776193,0.0011332529,0.010046257,0.0003878066,0.00006330404],"category_scores_gemma":[0.00045029767,0.00038782952,0.00083772605,0.0009273758,0.00028709596,0.0008443232,0.0013181078,0.0032630719,0.0005137379],"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.000066884066,0.00013915129,0.000097293945,0.00022916436,0.0009293443,0.00008248377,0.008608923,0.08079856,0.0006201854,0.00060965185,0.8596569,0.04816147],"study_design_scores_gemma":[0.0031672344,0.0022135014,0.00056353613,0.008024362,0.00070407847,0.031675257,0.005099204,0.1630813,0.00070732494,0.0013541415,0.7812705,0.0021395585],"about_ca_topic_score_codex":0.00016078666,"about_ca_topic_score_gemma":0.000003971403,"teacher_disagreement_score":0.8863673,"about_ca_system_score_codex":0.0002500229,"about_ca_system_score_gemma":0.0010485698,"threshold_uncertainty_score":0.99992245},"labels":[],"label_agreement":null},{"id":"W1571741349","doi":"10.1023/a:1014310721543","title":"On a Nearest-Neighbor Problem Under Minkowski and Power Metrics for Large Data Sets","year":2002,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Voronoi diagram; Computer science; Metric (unit); Set (abstract data type); Data structure; Computational geometry; Binary logarithm; Algorithm; Online analytical processing; Preprocessor; Point (geometry); Theoretical computer science; Data mining; Data warehouse; Discrete mathematics; Mathematics; Programming language","score_opus":0.06344665619959859,"score_gpt":0.28906850617709595,"score_spread":0.22562184997749735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571741349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15991578,0.0012275943,0.83526933,0.002881716,0.00033240073,0.0001232862,0.000009166786,0.000017820279,0.00022294172],"genre_scores_gemma":[0.9199601,0.00003788557,0.079030894,0.00075310044,0.00015568193,4.5119197e-7,0.0000033101903,0.000007798867,0.00005078345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988217,0.00010879993,0.0003401742,0.0001734001,0.0003405822,0.00021538581],"domain_scores_gemma":[0.9980213,0.0012080722,0.00016248401,0.00032923248,0.0002022806,0.00007661617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001824871,0.000107668995,0.00015254947,0.00019952796,0.00029609277,0.00016514621,0.00084570225,0.000037307687,0.000012561483],"category_scores_gemma":[0.00022160281,0.000072923234,0.00004292585,0.0004732664,0.000017005375,0.000557373,0.00032342193,0.00018436469,0.000005155163],"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.0001673782,0.0014029552,0.0008369368,0.00017048062,0.00052383693,0.00006257368,0.016179733,0.12513809,0.002713504,0.27321887,0.083553426,0.49603224],"study_design_scores_gemma":[0.00092160195,0.00040764193,0.0010544495,0.00006183985,0.000030493324,0.00032264405,0.00014201237,0.982199,0.00012577727,0.008385192,0.0061992332,0.0001501271],"about_ca_topic_score_codex":0.000001903502,"about_ca_topic_score_gemma":0.0000017357519,"teacher_disagreement_score":0.8570609,"about_ca_system_score_codex":0.000025600952,"about_ca_system_score_gemma":0.000034112934,"threshold_uncertainty_score":0.2973723},"labels":[],"label_agreement":null},{"id":"W1576210310","doi":"10.1023/a:1024464001273","title":"Performance Evaluation of a Multithreaded Fast Fourier Transform Algorithm for Derivative Pricing","year":2003,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Fast Fourier transform; Parallel computing; Speedup; Algorithm; Parallel algorithm","score_opus":0.04097960310350324,"score_gpt":0.28025941954782696,"score_spread":0.23927981644432372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576210310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3561478,0.00017447496,0.6427756,0.00006764132,0.00031159958,0.00023637655,0.0000014003037,0.000010756308,0.00027436024],"genre_scores_gemma":[0.85974807,0.0000072271037,0.14008835,0.000023197383,0.00011457458,0.0000017795147,8.3908594e-7,0.000008221731,0.000007772788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978501,0.00035518006,0.0007152218,0.00012613669,0.00068029173,0.0002730239],"domain_scores_gemma":[0.9977692,0.00047070946,0.00045446533,0.00022663843,0.0010235516,0.000055438475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072559584,0.00014391035,0.00030419574,0.00011104937,0.00023698533,0.000047569967,0.00066329254,0.00004736851,0.000002480644],"category_scores_gemma":[0.00016091188,0.00009721502,0.00013618129,0.0003763165,0.00004467498,0.0004181869,0.0000353306,0.0001896168,0.0000010157555],"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.00001638332,0.000092385235,0.0005707419,0.000058317088,0.00013426595,0.0000011053843,0.016139572,0.097899325,0.0013396333,0.0006281178,0.00007831948,0.88304186],"study_design_scores_gemma":[0.0012624541,0.00023837836,0.00079480244,0.00025179097,0.00006308412,0.00018185133,0.0007775989,0.9900543,0.005646298,0.0004023208,0.00020908445,0.0001180009],"about_ca_topic_score_codex":0.000009334692,"about_ca_topic_score_gemma":8.364819e-7,"teacher_disagreement_score":0.892155,"about_ca_system_score_codex":0.00007967096,"about_ca_system_score_gemma":0.00022701836,"threshold_uncertainty_score":0.39643136},"labels":[],"label_agreement":null},{"id":"W1757801143","doi":"10.1023/a:1011134903609","title":"Simulation and Analysis of Packet Loss in User Datagram Protocol Transfers","year":2001,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Packet loss; Computer network; Datagram; Network packet; User Datagram Protocol; Quality of service; Internet Protocol; Packet analyzer; End-to-end delay; Internet protocol suite; The Internet; Real-time computing; World Wide Web","score_opus":0.022065840465387572,"score_gpt":0.29235055437351903,"score_spread":0.27028471390813147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1757801143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5432721,0.00001810993,0.45505244,0.00033330955,0.000025345946,0.0012746607,4.3972017e-7,0.0000064638466,0.000017138305],"genre_scores_gemma":[0.9980748,0.0000071307218,0.0017755518,0.00006720227,0.000048442453,0.000020128666,3.4759745e-7,0.000002973979,0.0000034185603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989242,0.00018270809,0.000457694,0.000086673186,0.00021455348,0.00013417106],"domain_scores_gemma":[0.9990293,0.0005249963,0.00013292735,0.00016580413,0.00010500688,0.000041970892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013087314,0.000074866824,0.00024066746,0.00022486354,0.000057895835,0.000036337613,0.0003920225,0.00002949311,0.0000060727693],"category_scores_gemma":[0.00003137351,0.000049454855,0.00007028223,0.00086248334,0.00004160309,0.00035419213,0.00004064052,0.0001589888,2.9988138e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054752865,0.000039193026,0.039063435,0.000005721027,0.00011091083,0.000011143275,0.0012142161,0.7758409,0.000058271387,0.00039474788,0.00000639807,0.18320033],"study_design_scores_gemma":[0.00066880113,0.000085878004,0.035750296,0.00004040291,0.00009380163,0.000022146234,0.00008298134,0.96291107,0.000012887436,0.00009766479,0.00018040469,0.00005368409],"about_ca_topic_score_codex":0.000015394988,"about_ca_topic_score_gemma":0.000021580983,"teacher_disagreement_score":0.4548027,"about_ca_system_score_codex":0.000014985846,"about_ca_system_score_gemma":0.000028972949,"threshold_uncertainty_score":0.20167105},"labels":[],"label_agreement":null},{"id":"W1966676530","doi":"10.1007/s11227-011-0644-y","title":"An anomaly-based detection in ubiquitous network using the equilibrium state of the catastrophe theory","year":2011,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":false,"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; Anomaly detection; Catastrophe theory; State (computer science); Computer security; Distributed computing; Data mining; Algorithm","score_opus":0.022327271869888678,"score_gpt":0.2520841345001339,"score_spread":0.22975686263024522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966676530","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87151545,0.00015608913,0.12799063,0.000017688608,0.00011361848,0.00011195144,0.0000015914428,0.000008317403,0.00008464132],"genre_scores_gemma":[0.99728453,0.000001423832,0.002154582,0.000033635275,0.0005044284,5.953093e-7,5.2641894e-7,0.000018626102,0.0000016291222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979048,0.00092785514,0.00058804924,0.00009265288,0.00021146299,0.00027518268],"domain_scores_gemma":[0.998652,0.00025618685,0.0005141649,0.00041923142,0.00012371388,0.00003473323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026948713,0.00014098299,0.00025098943,0.00006583721,0.00020830389,0.000027625074,0.0007500172,0.000019848387,0.00003160298],"category_scores_gemma":[0.000007578738,0.00007079312,0.00019459736,0.00045352752,0.0001437381,0.0001688573,0.00013000537,0.00043624354,2.8627042e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003969954,0.00029509183,0.13422792,0.000017488963,0.00026211463,0.0000041947565,0.0066008763,0.68031305,0.07820536,0.0006241924,0.00003433727,0.099018395],"study_design_scores_gemma":[0.0010250601,0.0005593849,0.086362064,0.0005617475,0.00067682983,0.000064891276,0.0039199907,0.68923783,0.17143239,0.045587815,0.000087039196,0.0004849778],"about_ca_topic_score_codex":0.0005785457,"about_ca_topic_score_gemma":0.00005702017,"teacher_disagreement_score":0.12583604,"about_ca_system_score_codex":0.000040369712,"about_ca_system_score_gemma":0.00007604364,"threshold_uncertainty_score":0.28868595},"labels":[],"label_agreement":null},{"id":"W1967936195","doi":"10.1023/b:supe.0000040613.43581.53","title":"Feedback Guided Dynamic Loop Scheduling: Convergence of the Continuous Case","year":2004,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Convergence (economics); Scheduling (production processes); Workload; Loop (graph theory); Mathematical optimization; Feedback loop; Parallel computing; Distributed computing; Mathematics","score_opus":0.01889259081758587,"score_gpt":0.2653310294289088,"score_spread":0.24643843861132292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967936195","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50369704,0.00033129097,0.49464685,0.0008311085,0.00032143257,0.000069224676,2.964379e-7,0.00003793323,0.00006484767],"genre_scores_gemma":[0.87403995,0.000040087478,0.12562215,0.00020975116,0.000057761197,1.9149894e-7,9.078718e-8,0.000009117611,0.000020896841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823827,0.0002289331,0.00077902875,0.0001361052,0.0003676265,0.00025004428],"domain_scores_gemma":[0.99810165,0.00022001218,0.0006075394,0.0005226346,0.0004811063,0.000067082656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017462156,0.00015154484,0.00028447883,0.00007625833,0.0003169118,0.000066343804,0.0017866135,0.000058192774,0.0000034331415],"category_scores_gemma":[0.00017543577,0.00008843986,0.00017225425,0.0005446815,0.00014858082,0.00026923112,0.00043945079,0.00038341753,0.0000032270907],"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.000014851701,0.00015927896,0.0018973069,0.000036869656,0.000096721604,0.00024378071,0.006341851,0.97481155,0.0044920626,0.0044120364,0.00028103596,0.007212675],"study_design_scores_gemma":[0.001835976,0.0003408241,0.0030325304,0.00082241447,0.00010528416,0.03314627,0.00090422755,0.9238591,0.028140163,0.007277706,0.000089130444,0.00044637578],"about_ca_topic_score_codex":0.00008125801,"about_ca_topic_score_gemma":0.0000051261686,"teacher_disagreement_score":0.3703429,"about_ca_system_score_codex":0.00006632718,"about_ca_system_score_gemma":0.00022304848,"threshold_uncertainty_score":0.3606473},"labels":[],"label_agreement":null},{"id":"W1968014753","doi":"10.1023/b:supe.0000020178.66165.f3","title":"Optimization of DTM Interpolation Using SFS with Single Satellite Imagery","year":2004,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Remote Sensing and LiDAR Applications","field":"Environmental Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Interpolation (computer graphics); Terrain; Remote sensing; Computation; Digital elevation model; Satellite; Context (archaeology); Computer vision; Artificial intelligence; Field (mathematics); Elevation (ballistics); Computer graphics (images); Algorithm; Geology; Image (mathematics); Geography; Cartography","score_opus":0.015900411206529703,"score_gpt":0.22383923536395106,"score_spread":0.20793882415742135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968014753","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65453845,0.00003315625,0.3445921,0.000108666565,0.000025182842,0.000034177916,1.3890387e-7,0.00000426715,0.0006638526],"genre_scores_gemma":[0.86269957,0.0000094079005,0.13720389,0.000028499326,0.000047345235,1.0955134e-8,4.5139672e-7,0.0000075361454,0.0000033024967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934626,0.00004610061,0.00027342042,0.000054625667,0.00018669774,0.000092893555],"domain_scores_gemma":[0.99955624,0.000054132917,0.00022378172,0.000103470855,0.000033670927,0.000028707733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004213988,0.00006052116,0.000097708704,0.000035865436,0.000107555185,0.000017547682,0.000111565336,0.000019976093,0.00001880786],"category_scores_gemma":[0.000017273713,0.00003861049,0.000033466265,0.000205229,0.00011054074,0.00018993102,0.000035180998,0.00010416182,0.000003209651],"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.000014641564,0.000029576244,0.0012028591,0.0000022867264,0.000006776352,9.0278434e-7,0.0015063555,0.86496687,0.12691137,0.000006213857,0.0000028059367,0.00534933],"study_design_scores_gemma":[0.0016684926,0.0006547268,0.027068349,0.0009501924,0.00027519354,0.0022232707,0.005158202,0.85799,0.10222705,0.0010964457,0.0002310999,0.00045692906],"about_ca_topic_score_codex":0.00017592846,"about_ca_topic_score_gemma":0.0000072284765,"teacher_disagreement_score":0.2081611,"about_ca_system_score_codex":0.00009438134,"about_ca_system_score_gemma":0.000015098752,"threshold_uncertainty_score":0.157449},"labels":[],"label_agreement":null},{"id":"W1968264568","doi":"10.1007/s11227-012-0771-0","title":"Energy-efficient tasks scheduling algorithm for real-time multiprocessor embedded systems","year":2012,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Multiprocessing; Parallel computing; Scheduling (production processes); Distributed computing; Embedded system; Mathematical optimization","score_opus":0.01879960574576279,"score_gpt":0.25800864333167434,"score_spread":0.23920903758591155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968264568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16641311,0.001739966,0.8293416,0.0001151731,0.0018116361,0.00026098636,0.000002222831,0.00010039487,0.00021490705],"genre_scores_gemma":[0.71294224,0.000020960118,0.2850299,0.000040904764,0.0018687471,0.0000053259078,0.000001158607,0.000037742833,0.000053054147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960526,0.0005710754,0.0013420187,0.00026522935,0.00082011055,0.00094896636],"domain_scores_gemma":[0.99590266,0.0015271369,0.000917145,0.0005985174,0.00072262523,0.00033192936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00915401,0.00033397146,0.0006435365,0.00027007874,0.00054735487,0.00036109512,0.0017983221,0.0001360831,0.0000033909648],"category_scores_gemma":[0.00021797388,0.0002280151,0.00027383858,0.00052803406,0.000060993225,0.0010686277,0.00033244287,0.0003555006,0.000026073523],"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.0000628973,0.0005851513,0.00033648981,0.000331516,0.0005551122,0.000032167703,0.025818463,0.64695936,0.11743461,0.006044589,0.0006829745,0.20115665],"study_design_scores_gemma":[0.00066345686,0.00009652046,0.00005194001,0.00037042372,0.000056786044,0.0010263241,0.0014521183,0.99161595,0.004136242,0.000046563575,0.0002061716,0.0002774986],"about_ca_topic_score_codex":0.00013033708,"about_ca_topic_score_gemma":3.2406308e-7,"teacher_disagreement_score":0.5465291,"about_ca_system_score_codex":0.00018338299,"about_ca_system_score_gemma":0.00017594689,"threshold_uncertainty_score":0.9298186},"labels":[],"label_agreement":null},{"id":"W1969465120","doi":"10.1007/s11227-011-0709-y","title":"Toward designing a secure biosurveillance cloud","year":2011,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Cloud computing; Situation awareness; Computer science; Computer security; Authentication (law); Information sharing; World Wide Web","score_opus":0.05008264011211729,"score_gpt":0.2433150662211054,"score_spread":0.1932324261089881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969465120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0761256,0.00033591434,0.92213464,0.00019139267,0.0005430569,0.000065452325,2.1138038e-7,0.0001619585,0.0004417516],"genre_scores_gemma":[0.71702766,0.000031964893,0.28257236,0.00015746891,0.00019625404,3.2700706e-7,2.8780466e-8,0.000008839434,0.0000051115885],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986889,0.00022048838,0.0004465887,0.00012263216,0.00026962347,0.00025180104],"domain_scores_gemma":[0.9988292,0.00022836632,0.0003116318,0.00031246792,0.00024582812,0.00007253473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018256903,0.00012982116,0.00020236641,0.00012625214,0.00017372778,0.000045081702,0.0013215344,0.00004786578,0.00000878824],"category_scores_gemma":[0.00012250488,0.000087094646,0.00009593777,0.00038467947,0.00005642375,0.0005555202,0.00026154245,0.00039414002,0.000007291137],"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.00037450585,0.00044977485,0.008986805,0.00018975894,0.00044825047,0.0008958484,0.18573865,0.0032787242,0.15098867,0.04008765,0.0056242244,0.60293716],"study_design_scores_gemma":[0.0016841938,0.0024081925,0.008206534,0.00077109813,0.00007496088,0.014946358,0.0044302125,0.034985736,0.82970005,0.09687402,0.004510176,0.0014084668],"about_ca_topic_score_codex":0.000018353556,"about_ca_topic_score_gemma":0.0000012158672,"teacher_disagreement_score":0.6787114,"about_ca_system_score_codex":0.000048421844,"about_ca_system_score_gemma":0.000049862243,"threshold_uncertainty_score":0.35516164},"labels":[],"label_agreement":null},{"id":"W1969934278","doi":"10.1007/s11227-013-0906-y","title":"High performance data clustering: a comparative analysis of performance for GPU, RASC, MPI, and OpenMP implementations","year":2013,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"National Center for Research Resources; National Institute of General Medical Sciences","keywords":"Computer science; Parallel computing; Implementation; CUDA; Scalability; Cluster analysis; Supercomputer; Shared memory; Computer architecture; Programming paradigm; Distributed memory; Field-programmable gate array; Operating system; Programming language; Artificial intelligence","score_opus":0.07788277327650803,"score_gpt":0.3280618811365622,"score_spread":0.25017910786005415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969934278","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59507334,0.00010523138,0.40437794,0.0001872531,0.0000875937,0.00013193786,0.000016610007,0.000005276769,0.000014828081],"genre_scores_gemma":[0.88942194,0.00009936594,0.110315226,0.000059528797,0.00007226569,0.0000017307664,0.000019963352,0.000003644093,0.0000063436523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987049,0.00007969889,0.00059678947,0.00016414643,0.00025480348,0.00019967389],"domain_scores_gemma":[0.9983015,0.00040687522,0.0003791535,0.00055828446,0.00029017625,0.000063979416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011955353,0.000117331205,0.0003701653,0.00019656094,0.00032446405,0.00012989895,0.0015858435,0.00002166515,0.00001759824],"category_scores_gemma":[0.00001907889,0.00007437687,0.00004988764,0.00047319275,0.000062480474,0.0020371045,0.0011118901,0.00013978317,0.0000014884711],"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.00024698258,0.0005014239,0.052504208,0.00044294898,0.0043753544,0.000004000535,0.043285362,0.28519,0.019137219,0.0024754219,0.008641234,0.58319587],"study_design_scores_gemma":[0.0004357237,0.00017526766,0.05720627,0.000062780055,0.00018730789,0.000029163784,0.00063209207,0.9402232,0.00068513985,0.0000318087,0.00024312093,0.00008811924],"about_ca_topic_score_codex":0.00013817409,"about_ca_topic_score_gemma":0.000011676056,"teacher_disagreement_score":0.65503323,"about_ca_system_score_codex":0.000018401663,"about_ca_system_score_gemma":0.00004785993,"threshold_uncertainty_score":0.30330008},"labels":[],"label_agreement":null},{"id":"W1970042324","doi":"10.1007/s11227-006-4669-6","title":"Scalability and Performance Evaluation of DDM-Based Aggregation/Dissaggregation Protocols for Large-Scale Distributed Interactive Simulations Systems","year":2006,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Scalability; Interoperability; Distributed computing; High-level architecture; Grid; Consistency (knowledge bases); Scale (ratio); Concurrency; Database; Operating system","score_opus":0.09338641958437574,"score_gpt":0.41428816888583075,"score_spread":0.320901749301455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970042324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6426343,0.0000303852,0.35402828,0.00018730981,0.000033258813,0.003004939,0.000049883376,0.0000091021775,0.000022560613],"genre_scores_gemma":[0.9962243,5.3690115e-7,0.0034860247,0.00000982256,0.00010897919,0.00013471578,0.000022422855,0.0000067837427,0.000006434497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718183,0.00040056193,0.0011765037,0.00014122791,0.0009779924,0.00012188096],"domain_scores_gemma":[0.9925379,0.002723535,0.0010113887,0.0002680242,0.003424727,0.00003438575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009410938,0.00009462608,0.00023720937,0.00016137019,0.0003396099,0.000104474486,0.000270066,0.000051445997,0.000016063608],"category_scores_gemma":[0.0012673497,0.000061013572,0.000082573664,0.00050595234,0.00007014131,0.00042660182,0.00003351396,0.000112729955,6.68606e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012242366,0.00017020163,0.0712909,0.000027007822,0.000011808914,2.7643171e-8,0.0005306812,0.90172815,0.001450522,0.00044708606,0.00017937772,0.024041805],"study_design_scores_gemma":[0.000783405,0.00010175027,0.07793926,0.00014623825,0.00004779348,0.0000046669784,0.00056956406,0.911348,0.004065705,0.004684871,0.00024891508,0.00005986449],"about_ca_topic_score_codex":0.000023151199,"about_ca_topic_score_gemma":0.000011448131,"teacher_disagreement_score":0.35359,"about_ca_system_score_codex":0.000099107296,"about_ca_system_score_gemma":0.000118723576,"threshold_uncertainty_score":0.3261662},"labels":[],"label_agreement":null},{"id":"W1979190765","doi":"10.1007/s11227-015-1429-5","title":"FITDOC: fast virtual machines checkpointing with delta memory compression","year":2015,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Bitmap; Operating system; Page; Scalability; Overhead (engineering); Server; Byte; Virtual memory; Demand paging; Parallel computing; Virtual machine; Memory management; Computer graphics (images); Overlay","score_opus":0.020391052150157785,"score_gpt":0.23411081356223723,"score_spread":0.21371976141207943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979190765","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7367256,0.00029600982,0.2599752,0.0015219958,0.0004609483,0.000072301096,1.8418308e-7,0.00007155462,0.000876169],"genre_scores_gemma":[0.9742327,0.0000027165968,0.024686776,0.0003011457,0.00063085236,2.446557e-7,2.9700078e-7,0.000017272187,0.0001280168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977868,0.00032377965,0.0005640575,0.00019097322,0.0007692565,0.00036513022],"domain_scores_gemma":[0.9983468,0.00031317805,0.00040379315,0.00044780926,0.00030122165,0.00018721377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029177933,0.00021212609,0.00030888862,0.00015702771,0.0003618936,0.000198159,0.0017257488,0.000040294293,0.0000027758956],"category_scores_gemma":[0.00008975675,0.00011483321,0.000099539604,0.00041185104,0.00008543335,0.0001289289,0.0009469222,0.00050137483,0.000009734995],"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.00010425125,0.00015986626,0.0028114032,0.000030758372,0.00014950322,0.00013090107,0.020110631,0.7189722,0.0008847118,0.0009115943,0.002850555,0.2528836],"study_design_scores_gemma":[0.0014819035,0.00062388636,0.0015196366,0.00050524913,0.00005230691,0.0016428526,0.004161203,0.98748434,0.00056038034,0.00030111847,0.0013640649,0.0003030375],"about_ca_topic_score_codex":0.000083986386,"about_ca_topic_score_gemma":0.000004049119,"teacher_disagreement_score":0.26851213,"about_ca_system_score_codex":0.00006222289,"about_ca_system_score_gemma":0.00008814004,"threshold_uncertainty_score":0.46827623},"labels":[],"label_agreement":null},{"id":"W1980092883","doi":"10.1007/s11227-007-0128-2","title":"Perfect load balancing on the star interconnection network","year":2007,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Load balancing (electrical power); Star (game theory); Interconnection; Preprocessor; Tree network; Algorithm; Tree (set theory); Spanning tree; A* search algorithm; Time complexity; Distributed computing; Computer network; Mathematics; Discrete mathematics","score_opus":0.016155434261176597,"score_gpt":0.2315069813058925,"score_spread":0.2153515470447159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980092883","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54526234,0.0002463798,0.44868177,0.0012026804,0.002990356,0.00008354009,6.451327e-8,0.000031969033,0.0015009043],"genre_scores_gemma":[0.9948198,0.0000151841505,0.0011649007,0.0011179467,0.002825293,2.7828756e-7,6.3354584e-8,0.000011324871,0.00004516342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783105,0.0004535733,0.00066793413,0.00013483396,0.000500311,0.00041231528],"domain_scores_gemma":[0.9969587,0.00197402,0.00033003886,0.00036405324,0.00030355653,0.00006967131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013130725,0.00015299415,0.00022219599,0.00007754637,0.0005983755,0.00017967963,0.0010262247,0.000057135258,0.000017478698],"category_scores_gemma":[0.00017226944,0.000076738885,0.0001730642,0.00042383777,0.00003935972,0.0003161731,0.00015328085,0.00068181806,0.000023445695],"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.00078393676,0.00034323748,0.011417885,0.00008494777,0.00090102036,0.0003154303,0.07649403,0.43252727,0.012481338,0.16678174,0.0789016,0.21896759],"study_design_scores_gemma":[0.0016885224,0.0028215637,0.013414889,0.002630952,0.000104785664,0.007708488,0.012994115,0.9162961,0.004994735,0.0065820296,0.029796634,0.0009671683],"about_ca_topic_score_codex":0.0000668911,"about_ca_topic_score_gemma":0.00005200784,"teacher_disagreement_score":0.48376885,"about_ca_system_score_codex":0.00021016225,"about_ca_system_score_gemma":0.000059702932,"threshold_uncertainty_score":0.4602281},"labels":[],"label_agreement":null},{"id":"W1980603000","doi":"10.1007/s11227-005-0283-2","title":"Modeling Beliefs and Solution Strategies in a Distributed Learning System","year":2005,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Calgary","funders":"","keywords":"Computer science; Identification (biology); Domain (mathematical analysis); Architecture; Intelligent tutoring system; Client–server model; Distributed computing; Machine learning; Human–computer interaction; Artificial intelligence; Server; Operating system","score_opus":0.017624453758418722,"score_gpt":0.23495564776981967,"score_spread":0.21733119401140094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980603000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4457248,0.0004859915,0.5534058,0.00018643565,0.000092532246,0.000028831413,6.559902e-8,0.000023414372,0.000052128154],"genre_scores_gemma":[0.9924551,0.000020889256,0.007111535,0.000010712433,0.00037331306,2.3625695e-7,1.8771104e-7,0.0000063638226,0.000021623297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986483,0.00027364312,0.0004983064,0.00010552053,0.00023369769,0.00024056363],"domain_scores_gemma":[0.9994334,0.00014276555,0.00015569985,0.000098337034,0.00012649367,0.000043328433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024029284,0.00010465816,0.00019488769,0.00012115083,0.0002659428,0.00019075439,0.0003581857,0.000038692022,4.1833957e-7],"category_scores_gemma":[0.000047836784,0.000073107614,0.000043973407,0.00018599798,0.000016707905,0.00075757614,0.00013942324,0.0005049976,0.000002649738],"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.0000048593156,0.00000863955,0.0007069147,0.000023359331,0.000010649655,0.000009683265,0.0061350083,0.95948714,0.001354573,0.026015634,0.0000018966634,0.0062416513],"study_design_scores_gemma":[0.0001771511,0.00005865075,0.00049711415,0.0005140109,0.0000051479838,0.0004063213,0.006618049,0.9912517,0.00009321927,0.00005901753,0.00023626753,0.0000833668],"about_ca_topic_score_codex":0.00015543091,"about_ca_topic_score_gemma":0.000011205047,"teacher_disagreement_score":0.54673034,"about_ca_system_score_codex":0.00013210993,"about_ca_system_score_gemma":0.000053205644,"threshold_uncertainty_score":0.29812422},"labels":[],"label_agreement":null},{"id":"W1983065095","doi":"10.1023/b:supe.0000049326.25067.80","title":"Mobile Agent Connection Establishment and Management (CEMA)—Message Exchange for Pervasive Computing Environments","year":2004,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Egg Farmers of Canada","keywords":"Computer science; Ubiquitous computing; Context-aware pervasive systems; Mobile agent; Variety (cybernetics); Mobile computing; Distributed computing; Server; Mobile device; Computer network; Human–computer interaction; World Wide Web; Artificial intelligence","score_opus":0.016651066620493215,"score_gpt":0.23488119645011876,"score_spread":0.21823012982962556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983065095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21022834,0.0014821485,0.78613186,0.00038210166,0.000618983,0.0009563333,0.0000011360153,0.000033376233,0.00016574525],"genre_scores_gemma":[0.9332854,0.0013800581,0.06424752,0.0006467253,0.00033288958,0.000019602314,0.0000023805976,0.000025743602,0.000059665967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978587,0.0001655632,0.0006569639,0.00031976646,0.0005255047,0.0004735025],"domain_scores_gemma":[0.99872077,0.00023341662,0.00042295887,0.00042541017,0.000060744904,0.00013670562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023314443,0.0002496625,0.0003038412,0.00019137775,0.0004902253,0.00020193041,0.0008838757,0.000044197626,0.000006735943],"category_scores_gemma":[0.000015563728,0.00019206281,0.00013482916,0.0002534047,0.00006796765,0.00048722152,0.00081230846,0.00021266215,0.0000058747114],"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.00011536555,0.0005478403,0.0005331624,0.0006076861,0.0006707826,0.00021696406,0.017206658,0.52024966,0.0014171593,0.012425054,0.0023737552,0.44363588],"study_design_scores_gemma":[0.035794944,0.010364781,0.022079246,0.0051250546,0.0019978108,0.0027091892,0.030221269,0.6723833,0.013872445,0.019814007,0.1815346,0.004103323],"about_ca_topic_score_codex":0.000019511175,"about_ca_topic_score_gemma":0.0000028784566,"teacher_disagreement_score":0.7230571,"about_ca_system_score_codex":0.00041173864,"about_ca_system_score_gemma":0.000026175025,"threshold_uncertainty_score":0.78320944},"labels":[],"label_agreement":null},{"id":"W1983727850","doi":"10.1007/s11227-008-0243-8","title":"An interference-aware multichannel media access control protocol for wireless sensor networks","year":2008,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Wireless sensor network; Computer network; Scalability; Node (physics); Channel (broadcasting); Hidden node problem; Control channel; Media access control; Overhead (engineering); Unicast; Key distribution in wireless sensor networks; Protocol (science); Wireless; Transmission (telecommunications); Access control; Sensor node; Transceiver; Wireless network; Wi-Fi array; Base station; Network packet; Telecommunications","score_opus":0.05354608619151592,"score_gpt":0.30951849803454173,"score_spread":0.2559724118430258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983727850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11032543,0.000027147746,0.8777526,0.00028871262,0.00065783085,0.010841664,0.0000015522679,0.00009064424,0.000014424571],"genre_scores_gemma":[0.98356426,0.000009661179,0.013448114,0.00037326908,0.0014593528,0.0010999999,0.0000011577898,0.000038066664,0.000006151261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969688,0.0005167368,0.00095917104,0.00030681017,0.00051075773,0.0007377148],"domain_scores_gemma":[0.9959687,0.0017869727,0.0006001234,0.0006102702,0.00078423304,0.00024969864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017973566,0.0003164265,0.0005308959,0.00018289096,0.00067013636,0.00023274725,0.003343689,0.0001435961,0.0000054413917],"category_scores_gemma":[0.00009729762,0.00020865891,0.00020385692,0.00043858367,0.00017441256,0.0012656499,0.00030316756,0.00063785416,0.0000017898274],"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.00021086205,0.00017392686,0.0009517578,0.00002142903,0.00005222098,0.000051432577,0.0028579533,0.9841179,0.0005140764,0.00028301962,0.00031652508,0.010448899],"study_design_scores_gemma":[0.0024506485,0.00034040472,0.00095555274,0.0002515236,0.000020757661,0.00067569467,0.0002486926,0.993865,0.0008081475,0.000050071045,0.000076148484,0.00025733773],"about_ca_topic_score_codex":0.000026910908,"about_ca_topic_score_gemma":0.000013132943,"teacher_disagreement_score":0.8732388,"about_ca_system_score_codex":0.00007673397,"about_ca_system_score_gemma":0.00012908505,"threshold_uncertainty_score":0.85088634},"labels":[],"label_agreement":null},{"id":"W1987607498","doi":"10.1007/s11227-008-0205-1","title":"Parallel methods for absolute irreducibility testing","year":2008,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Irreducibility; Polytope; Computer science; Degree (music); Univariate; Heuristic; Range (aeronautics); Bivariate analysis; Mathematics; Applied mathematics; Multivariate statistics; Algorithm; Discrete mathematics; Mathematical optimization; Statistics; Pure mathematics","score_opus":0.09384136408495593,"score_gpt":0.3400073885871322,"score_spread":0.24616602450217628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987607498","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24650826,0.00032619017,0.7515886,0.0008801671,0.0004826807,0.00008914826,2.187984e-7,0.000032610365,0.00009213335],"genre_scores_gemma":[0.4335267,0.00000499808,0.56601286,0.00012959512,0.00030568038,4.6838846e-7,1.1361351e-7,0.0000047676067,0.000014847545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857014,0.00027650135,0.0005611681,0.0001513149,0.00017385087,0.0002669943],"domain_scores_gemma":[0.99665636,0.00240784,0.00028571548,0.00027290272,0.0002934583,0.00008371955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003755914,0.00011473216,0.00023197819,0.00007469719,0.00046063296,0.000048335834,0.00094268995,0.000031379393,0.0000013422801],"category_scores_gemma":[0.00065867894,0.00007518628,0.00013560502,0.00031309618,0.00006842688,0.00043029813,0.00020038166,0.00021648177,0.0000025213567],"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.0000489398,0.00011612116,0.0007876838,0.000031500393,0.00007378629,0.000013949539,0.0077940226,0.029036483,0.011628317,0.0021739968,0.0012855256,0.9470097],"study_design_scores_gemma":[0.0008107537,0.00030974956,0.019954901,0.00007098758,0.000027903572,0.0022337306,0.00011946341,0.9452588,0.0017729976,0.028307954,0.0009104641,0.00022228925],"about_ca_topic_score_codex":0.000027127147,"about_ca_topic_score_gemma":5.196669e-7,"teacher_disagreement_score":0.94678736,"about_ca_system_score_codex":0.000042384698,"about_ca_system_score_gemma":0.0001598937,"threshold_uncertainty_score":0.35428628},"labels":[],"label_agreement":null},{"id":"W1990025926","doi":"10.1023/b:supe.0000014804.20789.21","title":"Run-Time Support for the Automatic Parallelization of Java Programs","year":2004,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Computer science; Thread (computing); Parallel computing; Java; Speedup; Compiler; Multiprocessing; Asynchronous communication; Pointer (user interface); Just-in-time compilation; Runtime system; Automatic parallelization; Java concurrency; Operating system; Real time Java","score_opus":0.021248956082100916,"score_gpt":0.26366312515750134,"score_spread":0.24241416907540042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990025926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04054628,0.00021229574,0.95721877,0.0013615028,0.00016747382,0.00028827714,3.3465088e-7,0.000103353486,0.00010169931],"genre_scores_gemma":[0.7061565,0.000035124558,0.2935136,0.00014311186,0.00011452822,0.0000017479887,0.0000010716825,0.000010078295,0.00002427376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854934,0.000107456086,0.00068312546,0.00010051408,0.00033718496,0.0002223823],"domain_scores_gemma":[0.998306,0.00043441897,0.0004986867,0.00032879628,0.00038757783,0.000044543318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023386355,0.00012280897,0.00023247515,0.000092592265,0.00027607215,0.00009066599,0.0013372747,0.00004526969,0.0000039676524],"category_scores_gemma":[0.00012176675,0.000068063884,0.00014885367,0.00034510778,0.00007793333,0.0002887203,0.00015224803,0.00015635925,0.000003405963],"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.00003131797,0.00028668795,0.00051308586,0.00009974925,0.00018344408,0.0000049123155,0.010624652,0.7946919,0.0014911813,0.011470614,0.0014979058,0.17910454],"study_design_scores_gemma":[0.00075999874,0.00056333415,0.0007920889,0.00022081974,0.000057598805,0.00025199563,0.00015047978,0.9880169,0.0026255453,0.0059772898,0.00043639936,0.00014756122],"about_ca_topic_score_codex":0.0000148319505,"about_ca_topic_score_gemma":6.7797083e-7,"teacher_disagreement_score":0.6656102,"about_ca_system_score_codex":0.00004146849,"about_ca_system_score_gemma":0.00015475969,"threshold_uncertainty_score":0.27755648},"labels":[],"label_agreement":null},{"id":"W1996503705","doi":"10.1007/s11227-007-0107-7","title":"A Parallel Algorithm for determining the inverse of a matrix for use in blockcipher encryption/decryption","year":2007,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Encryption; 56-bit encryption; Probabilistic encryption; On-the-fly encryption; Algorithm; Multiple encryption; Cryptography; Computer security; 40-bit encryption; Key (lock); Theoretical computer science","score_opus":0.04553439668611031,"score_gpt":0.32438283499808607,"score_spread":0.27884843831197575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996503705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4602589,0.000028251858,0.5392929,0.000105735155,0.00011130324,0.00019552761,0.0000021010978,0.0000037872987,0.0000015288734],"genre_scores_gemma":[0.51399857,0.000013578407,0.48578003,0.000088725414,0.00010831298,0.0000022915524,0.0000010947102,0.0000054185507,0.0000019647614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868506,0.00008465803,0.00067643967,0.00009162963,0.0002120471,0.00025013785],"domain_scores_gemma":[0.9977298,0.0014223946,0.00032539835,0.00017681919,0.00030899464,0.000036613194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040189954,0.00009259779,0.00017086996,0.00016458961,0.00021305641,0.000065982866,0.0005228297,0.00003613976,0.0000023071552],"category_scores_gemma":[0.000100004676,0.000056890054,0.00015423122,0.00035313438,0.00005152813,0.0004074956,0.000081741695,0.00014438272,1.9003673e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040287254,0.0006908031,0.04387683,0.00015564013,0.00025807234,0.000014434356,0.069713615,0.01226351,0.006288125,0.019314662,0.0015329906,0.8454884],"study_design_scores_gemma":[0.003364278,0.0004560708,0.027727406,0.00010954309,0.000060167353,0.000099025296,0.0038546969,0.9561685,0.00043915244,0.006562422,0.0009825886,0.0001762012],"about_ca_topic_score_codex":0.000061293125,"about_ca_topic_score_gemma":0.00018036655,"teacher_disagreement_score":0.94390494,"about_ca_system_score_codex":0.000036547553,"about_ca_system_score_gemma":0.00005082009,"threshold_uncertainty_score":0.23199092},"labels":[],"label_agreement":null},{"id":"W1996662615","doi":"10.1007/s11227-014-1130-0","title":"Some properties and algorithms for the hyper-torus network","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"National Research Foundation of Korea","keywords":"Torus; Hypercube; Computer science; Grid network; Algorithm; Broadcasting (networking); Hamiltonian path; Topology (electrical circuits); Parallel computing; Theoretical computer science; Graph; Mathematics; Combinatorics; Computer network; Grid","score_opus":0.04503358846702985,"score_gpt":0.23130041617350927,"score_spread":0.18626682770647943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996662615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11877528,0.0055572665,0.86924464,0.003347707,0.002827442,0.00016661215,1.3091045e-7,0.000023111861,0.00005781924],"genre_scores_gemma":[0.9882709,0.00009637447,0.005880574,0.00065719103,0.0050270497,0.0000015051528,3.5914525e-8,0.000008530492,0.000057876452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998888,0.00022624698,0.00037313506,0.00009081289,0.00018273349,0.00023904812],"domain_scores_gemma":[0.99846476,0.0009455571,0.00017212171,0.00021378319,0.00015953126,0.000044258035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038653081,0.00009753463,0.00019334226,0.000027887616,0.0005874953,0.00020274692,0.00069494004,0.00003312953,7.1950234e-7],"category_scores_gemma":[0.00007549494,0.0000432043,0.000085360596,0.00009774567,0.000057034325,0.00032127116,0.00014836759,0.00020063022,0.0000015511071],"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.000106495514,0.00006273109,0.0014194417,0.00009820733,0.00034248113,0.0000032767307,0.01710557,0.21666127,0.0017954255,0.073321,0.018719653,0.67036444],"study_design_scores_gemma":[0.00027870206,0.00020468619,0.0003685549,0.0001286632,0.000020866244,0.000522517,0.00038978606,0.98015535,0.00010658149,0.0023507045,0.015385276,0.00008831401],"about_ca_topic_score_codex":0.000023762952,"about_ca_topic_score_gemma":0.0000029472155,"teacher_disagreement_score":0.8694956,"about_ca_system_score_codex":0.00001639423,"about_ca_system_score_gemma":0.000021729853,"threshold_uncertainty_score":0.4518598},"labels":[],"label_agreement":null},{"id":"W1997616856","doi":"10.1007/s11227-013-0976-x","title":"Privacy aware image template matching in clouds using ambient data","year":2013,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Cloud computing; Encryption; Image processing; Scalability; Encoding (memory); Scheme (mathematics); Image (mathematics); Computer vision; Pixel; Artificial intelligence; Database; Computer network","score_opus":0.05443423812840791,"score_gpt":0.2980685866706304,"score_spread":0.2436343485422225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997616856","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5585665,0.00008330159,0.4402368,0.0007235675,0.000250237,0.00009769319,8.3554505e-7,0.000021987018,0.000019054403],"genre_scores_gemma":[0.8828138,0.00001316083,0.116660886,0.0002325981,0.00025749832,2.6714852e-7,0.0000014824178,0.00001670391,0.000003562869],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976693,0.00035344926,0.0008007169,0.00024285194,0.0005213403,0.0004123744],"domain_scores_gemma":[0.99805623,0.00037791667,0.0003658379,0.00088547805,0.0002076221,0.00010693788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030507003,0.0001839337,0.00028114402,0.00022017816,0.0002449333,0.0003722399,0.0030494842,0.000044771165,0.000024328083],"category_scores_gemma":[0.000112805166,0.00013222589,0.00006956406,0.0004984122,0.000060679326,0.0033465375,0.0016166222,0.0006286254,0.000036821297],"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.000046105582,0.00030720583,0.003875391,0.00013295218,0.0000964569,0.0003203243,0.020157123,0.08101336,0.8336368,0.0004215285,0.001725366,0.058267392],"study_design_scores_gemma":[0.00065980805,0.00007061769,0.0064393445,0.00047122192,0.000020041312,0.0011325108,0.0007412087,0.9834369,0.0036076163,0.0031156247,0.00006621742,0.00023887945],"about_ca_topic_score_codex":0.00088183285,"about_ca_topic_score_gemma":0.000007226639,"teacher_disagreement_score":0.90242356,"about_ca_system_score_codex":0.00017664702,"about_ca_system_score_gemma":0.00013937426,"threshold_uncertainty_score":0.5666751},"labels":[],"label_agreement":null},{"id":"W2000074722","doi":"10.1023/b:supe.0000026847.75355.69","title":"Parallel MCGLS and ICGLS Methods for Least Squares Problems on Distributed Memory Architectures","year":2004,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Bottleneck; Parallel computing; Conjugate gradient method; Synchronization (alternating current); Distributed memory; Parallel algorithm; Least-squares function approximation; Product (mathematics); Algorithm; Shared memory; Mathematics; Telecommunications","score_opus":0.02407950502449638,"score_gpt":0.3036313280909358,"score_spread":0.2795518230664394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000074722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15200667,0.00064681075,0.8448403,0.002023508,0.00022365022,0.00018550802,0.0000033049253,0.00003065989,0.000039578365],"genre_scores_gemma":[0.63885885,0.000016472963,0.3605811,0.00025136478,0.00027283843,0.00000157335,6.150363e-7,0.0000098528835,0.000007313548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985671,0.0003592303,0.0004256705,0.0001585648,0.00019667223,0.00029278282],"domain_scores_gemma":[0.99820536,0.0011282339,0.00021287594,0.00024346802,0.00010657321,0.00010347781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032499975,0.00016486687,0.00027613106,0.000103296974,0.0003586075,0.0001221892,0.00081066694,0.00004488501,0.0000020431053],"category_scores_gemma":[0.00018964244,0.00009820315,0.000120691926,0.0001778625,0.00009178643,0.00015988508,0.00016314835,0.0003312414,0.0000011875329],"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.0001814655,0.00017703274,0.00004981794,0.0001348851,0.00014671878,0.000019489471,0.012189835,0.51746225,0.0064390493,0.03881421,0.000093815564,0.42429143],"study_design_scores_gemma":[0.0070941593,0.0032305708,0.0028738512,0.0013338069,0.00017285603,0.0039660614,0.0019584908,0.22036758,0.031710595,0.7238664,0.0023892745,0.0010363304],"about_ca_topic_score_codex":0.000011205727,"about_ca_topic_score_gemma":0.0000010166779,"teacher_disagreement_score":0.6850522,"about_ca_system_score_codex":0.000031592655,"about_ca_system_score_gemma":0.000054249784,"threshold_uncertainty_score":0.4004608},"labels":[],"label_agreement":null},{"id":"W2000511619","doi":"10.1007/s11227-013-1027-3","title":"Advanced technologies and applications for Highly-Reliable Cyber Physical System (HRCPS)","year":2013,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Cyber-physical system; Computer security; Operating system","score_opus":0.004769148502051667,"score_gpt":0.19799067947849702,"score_spread":0.19322153097644534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000511619","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9623508,0.0011608296,0.03545979,0.00017479774,0.00016822934,0.0002779187,0.0000011024323,0.0001530341,0.00025352542],"genre_scores_gemma":[0.9959277,0.00007606688,0.003711331,0.0000076993965,0.00024858926,0.000012127257,2.005276e-7,0.0000105180125,0.0000057638763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995201,0.0000088488505,0.000186671,0.00004979483,0.00008368313,0.00015089597],"domain_scores_gemma":[0.9995416,0.00021079724,0.000040315957,0.000104841594,0.000076404554,0.00002608174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017862885,0.0000761439,0.00014515477,0.000042967255,0.00014391042,0.000029104645,0.00020232733,0.00003619976,5.938678e-7],"category_scores_gemma":[0.00001589717,0.000047496844,0.000040007784,0.000100795216,0.00005735704,0.00017436653,0.00003634448,0.00017324807,0.0000060237453],"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.00002864386,0.000110731125,0.0007340692,0.0012079953,0.00022867211,0.0000037527443,0.0053607784,0.45644066,0.19073293,0.011557455,0.003685139,0.32990918],"study_design_scores_gemma":[0.0012619168,0.00026650925,0.0017538817,0.000748925,0.00016050978,0.00061716983,0.03535298,0.87841845,0.057734676,0.00483948,0.018294008,0.0005515074],"about_ca_topic_score_codex":0.00000496765,"about_ca_topic_score_gemma":5.6970964e-7,"teacher_disagreement_score":0.42197776,"about_ca_system_score_codex":0.000025852838,"about_ca_system_score_gemma":0.000006286726,"threshold_uncertainty_score":0.1936865},"labels":[],"label_agreement":null},{"id":"W2001291849","doi":"10.1007/s11227-011-0641-1","title":"On the surface area of the augmented cubes","year":2011,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Vertex (graph theory); Cube (algebra); Surface (topology); Function (biology); Telecommunications network; Topology (electrical circuits); Theoretical computer science; Algorithm; Distributed computing; Computer network; Graph; Mathematics; Geometry; Combinatorics","score_opus":0.04741821532123593,"score_gpt":0.2118977143211143,"score_spread":0.16447949899987835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001291849","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93082005,0.00013580348,0.06400832,0.0011894964,0.0013379122,0.00008727647,2.7464841e-7,0.000010606876,0.0024102377],"genre_scores_gemma":[0.99902457,0.0000075729226,0.00043309244,0.00033085878,0.00012208187,1.3441591e-7,1.5835175e-8,0.000005317218,0.00007634159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854803,0.00044747788,0.00044621658,0.00007148191,0.00032457613,0.00016219002],"domain_scores_gemma":[0.99843764,0.00062095595,0.00031060792,0.00041442586,0.000188541,0.00002784215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023713491,0.00009305331,0.00016004378,0.000029177578,0.00027261188,0.000040755076,0.001565978,0.000029137358,0.00002692636],"category_scores_gemma":[0.00007146659,0.000035141875,0.00014863649,0.00024932093,0.00006803198,0.00014315608,0.00020380782,0.00031712218,0.000005163783],"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.00037868146,0.0009255902,0.020923248,0.00009788052,0.0012146988,0.000049825823,0.21033655,0.22847477,0.03228618,0.42440417,0.05770036,0.023208061],"study_design_scores_gemma":[0.001042557,0.0009805931,0.017122494,0.0017916396,0.00009066124,0.0014793384,0.008910666,0.9143553,0.039543204,0.012846184,0.001426015,0.00041136626],"about_ca_topic_score_codex":0.0000777484,"about_ca_topic_score_gemma":0.0000069087355,"teacher_disagreement_score":0.68588054,"about_ca_system_score_codex":0.000025619376,"about_ca_system_score_gemma":0.00003455207,"threshold_uncertainty_score":0.2910003},"labels":[],"label_agreement":null},{"id":"W2003224378","doi":"10.1007/s11227-014-1161-6","title":"UAV-assisted data gathering in wireless sensor networks","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":166,"is_retracted":false,"has_abstract":false,"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; Wireless sensor network; Key distribution in wireless sensor networks; Process (computing); Data collection; Real-time computing; Visual sensor network; Computer network; Mobile wireless sensor network; Wireless; Wireless network; Telecommunications","score_opus":0.01877998752770289,"score_gpt":0.21977816694175448,"score_spread":0.2009981794140516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003224378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5854636,0.00011342479,0.41389248,0.0000601354,0.000107427346,0.000034372897,4.5553347e-7,0.000023852888,0.00030425747],"genre_scores_gemma":[0.99122244,0.00009561414,0.008387437,0.000024672237,0.0002442826,2.2229796e-7,0.000003566484,0.000018813871,0.0000029705395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935156,0.000054227396,0.0003160614,0.000053384378,0.00008860644,0.0001361577],"domain_scores_gemma":[0.9994576,0.00016006597,0.00005413276,0.00026315646,0.000035625697,0.000029402512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000970651,0.00007179234,0.00012889053,0.000053737713,0.000058039972,0.000028121649,0.0003714555,0.000035424262,0.0000069401676],"category_scores_gemma":[0.000018716897,0.00005301287,0.00001906741,0.0001908515,0.000014251997,0.000141452,0.00006306419,0.00023364912,0.000002194941],"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.0000027841884,0.000008022203,0.00095904106,0.0000079974825,0.000010755803,8.361527e-7,0.00025491827,0.96687865,0.001574919,0.000034961107,0.00010385569,0.030163256],"study_design_scores_gemma":[0.00017359832,0.000007787268,0.005440147,0.00006865212,0.000012505264,0.00005886977,0.000216012,0.99358547,0.00007829476,0.000013025239,0.0002840694,0.00006156694],"about_ca_topic_score_codex":0.000018262965,"about_ca_topic_score_gemma":0.000016774024,"teacher_disagreement_score":0.40575883,"about_ca_system_score_codex":0.000024377736,"about_ca_system_score_gemma":0.0000057333073,"threshold_uncertainty_score":0.2161802},"labels":[],"label_agreement":null},{"id":"W2005442946","doi":"10.1007/s11227-006-2742-9","title":"A Parallel Approach Eliminates Measurement Perturbations in RLC Circuits","year":2006,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"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","keywords":"Computer science; RLC circuit; Electronic circuit; Parallel computing; Electrical engineering; Voltage; Capacitor","score_opus":0.02849223114808994,"score_gpt":0.221802715866332,"score_spread":0.19331048471824205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005442946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20558678,0.0009318308,0.79026204,0.0014159937,0.00006689037,0.0001088285,2.6155877e-7,0.00002768031,0.0015996847],"genre_scores_gemma":[0.9796258,0.000011410295,0.020149412,0.00006818214,0.00011860045,0.0000019581994,7.420973e-7,0.000005650824,0.000018244338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987328,0.00011397598,0.00043805884,0.000105602645,0.00041287352,0.00019669502],"domain_scores_gemma":[0.99927896,0.00012393636,0.00014008684,0.00025450718,0.00016762661,0.000034887562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016074239,0.00009100832,0.00014192311,0.00012297522,0.00017401905,0.000089437184,0.0008386048,0.000027465503,0.0000020557356],"category_scores_gemma":[0.000032547967,0.000062323896,0.000069623165,0.00039803327,0.000030263629,0.00026385766,0.00010149308,0.0002104087,0.000005746879],"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.000017007069,0.0026882335,0.0106915375,0.00013316261,0.00014955476,0.00006766108,0.026622808,0.42365265,0.13852815,0.22977294,0.00691387,0.16076243],"study_design_scores_gemma":[0.0009887989,0.000076222204,0.08894216,0.00013397458,0.00003940762,0.0007502658,0.00090934616,0.89359933,0.0014748212,0.011273248,0.0015045828,0.00030786413],"about_ca_topic_score_codex":0.0000813793,"about_ca_topic_score_gemma":0.000010772236,"teacher_disagreement_score":0.77403903,"about_ca_system_score_codex":0.000081774604,"about_ca_system_score_gemma":0.000072605144,"threshold_uncertainty_score":0.25414947},"labels":[],"label_agreement":null},{"id":"W2006246786","doi":"10.1007/s11227-009-0298-1","title":"High performance computing and communications","year":2009,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"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; Supercomputer; Grid computing; Snapshot (computer storage); Fault tolerance; Distributed computing; Mainstream; Task (project management); Grid; Telecommunications; Computer architecture; Parallel computing; Operating system; Systems engineering","score_opus":0.020339854655903718,"score_gpt":0.254766099473941,"score_spread":0.2344262448180373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006246786","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6992192,0.0008109318,0.2969938,0.002345365,0.00025014658,0.000049736216,2.9696588e-7,0.00004419594,0.00028633562],"genre_scores_gemma":[0.962005,0.00009176642,0.037315242,0.00036118392,0.00021383504,4.161286e-8,6.039282e-7,0.0000042233123,0.00000805692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861085,0.00024261292,0.0005448462,0.000102187994,0.0002573125,0.0002421617],"domain_scores_gemma":[0.99841225,0.00043335298,0.00030835136,0.0005812605,0.0001867272,0.00007803052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002093858,0.00012470907,0.00023865559,0.00008635204,0.00051173527,0.00016460942,0.002016541,0.000036396512,6.394431e-7],"category_scores_gemma":[0.000042370477,0.00008418264,0.00004990593,0.0003227717,0.00007158639,0.00038309614,0.00035969052,0.0003767937,0.0000044563444],"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.000030946616,0.00023801802,0.007914998,0.00006140578,0.000126462,0.000025937761,0.018623209,0.06605156,0.0030618187,0.057138316,0.0017774747,0.84494984],"study_design_scores_gemma":[0.000777135,0.0005289446,0.07177577,0.00045400037,0.000033830995,0.0025655387,0.0003844019,0.9190683,0.0003057418,0.002099771,0.0017039557,0.0003026199],"about_ca_topic_score_codex":0.00001391032,"about_ca_topic_score_gemma":3.404705e-7,"teacher_disagreement_score":0.85301673,"about_ca_system_score_codex":0.000025335887,"about_ca_system_score_gemma":0.00004490892,"threshold_uncertainty_score":0.39359057},"labels":[],"label_agreement":null},{"id":"W2006741433","doi":"10.1007/s11227-014-1195-9","title":"GAER: genetic algorithm-based energy-efficient routing protocol for infrastructure-less opportunistic networks","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Routing protocol; Hop (telecommunications); Latency (audio); Zone Routing Protocol; Distance-vector routing protocol; Distributed computing; Routing (electronic design automation); Wireless Routing Protocol; Telecommunications","score_opus":0.021805783350238046,"score_gpt":0.2538559763131712,"score_spread":0.23205019296293314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006741433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008361831,0.000024581539,0.9916993,0.00023478849,0.0006769443,0.0062502692,0.0000017221557,0.00006235491,0.00021386927],"genre_scores_gemma":[0.77593005,0.0000018836693,0.22065239,0.00095429004,0.0016843178,0.00071932934,0.0000026181954,0.000038868224,0.000016234322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969296,0.00039125423,0.0011415925,0.00029157044,0.0005646626,0.00068133784],"domain_scores_gemma":[0.99666476,0.0012696263,0.0007729343,0.0005552227,0.0004501798,0.00028730277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028461234,0.00032364062,0.0004914238,0.00013891033,0.0005876235,0.00025487063,0.0016239254,0.0001322025,0.000008526328],"category_scores_gemma":[0.000045127097,0.00021770578,0.0002346017,0.0003359416,0.000121475816,0.00013608341,0.0002614208,0.00044850042,9.32352e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003575273,0.000054072163,0.00011326895,0.000022484075,0.000026725058,0.000017572753,0.00017171663,0.4634582,0.00002114609,0.0024113501,0.00082031335,0.5328474],"study_design_scores_gemma":[0.001346457,0.0003290854,0.00019708162,0.00023531867,0.00004584382,0.0003289177,0.000074338495,0.9936157,0.000031548003,0.00121139,0.0023192726,0.00026503348],"about_ca_topic_score_codex":0.000014452099,"about_ca_topic_score_gemma":8.550426e-7,"teacher_disagreement_score":0.7750939,"about_ca_system_score_codex":0.00008019556,"about_ca_system_score_gemma":0.00031735678,"threshold_uncertainty_score":0.8877784},"labels":[],"label_agreement":null},{"id":"W2007692703","doi":"10.1007/s11227-010-0434-y","title":"A note on the alternating group network","year":2010,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Interconnection; Group (periodic table); Class (philosophy); Alternating group; Network topology; Star (game theory); Topology (electrical circuits); Discrete mathematics; Computer network; Combinatorics; Mathematics; Physics; Astrophysics; Artificial intelligence; Symmetric group","score_opus":0.015074374550928884,"score_gpt":0.23891198934996868,"score_spread":0.2238376147990398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007692703","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6247039,0.00006063456,0.36492723,0.0034009775,0.005139065,0.00007603072,8.730935e-8,0.000027357451,0.0016647205],"genre_scores_gemma":[0.9894088,0.00000534737,0.005220638,0.0012327717,0.004097503,4.2523865e-7,4.4672824e-8,0.000009029388,0.000025466583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998482,0.00030384574,0.00047448432,0.00010030694,0.00035733893,0.0002820331],"domain_scores_gemma":[0.99766815,0.0014489698,0.0003097904,0.00038112307,0.00013729237,0.000054682234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050720274,0.00011355457,0.00016354275,0.00004400009,0.00054415665,0.0002282242,0.0015359124,0.000044633623,0.000014047351],"category_scores_gemma":[0.00012600138,0.000053257845,0.0001287025,0.00024067407,0.000040132123,0.0002358253,0.00019341367,0.0009872145,0.000017910561],"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.00008064714,0.00015661637,0.0029473423,0.000021716462,0.00023631664,0.00011056736,0.02128683,0.2003109,0.021962631,0.5639356,0.025156694,0.16379416],"study_design_scores_gemma":[0.00034682313,0.00029193566,0.0014502329,0.00030020447,0.00001574087,0.0018431209,0.00038128239,0.9783885,0.0004622311,0.005729654,0.010589817,0.00020048073],"about_ca_topic_score_codex":0.00003722649,"about_ca_topic_score_gemma":0.000028222948,"teacher_disagreement_score":0.77807754,"about_ca_system_score_codex":0.000020895977,"about_ca_system_score_gemma":0.000024078612,"threshold_uncertainty_score":0.42890105},"labels":[],"label_agreement":null},{"id":"W2008488657","doi":"10.1007/s11227-013-0953-4","title":"Trust, security and privacy for pervasive applications","year":2013,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Access Control and Trust","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Computer security; Ubiquitous computing; Internet privacy; Human–computer interaction","score_opus":0.017146314528226344,"score_gpt":0.29357319519868563,"score_spread":0.2764268806704593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008488657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97926545,0.00094058365,0.010832213,0.0066199484,0.00008005227,0.00043084967,0.0000012410637,0.000010923249,0.0018187372],"genre_scores_gemma":[0.9978733,0.00011123221,0.0010730497,0.00016996845,0.0007282578,0.0000057074517,1.7479708e-7,0.0000041784742,0.00003409788],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999397,0.00008603603,0.00018763325,0.000045934943,0.00013504998,0.00014833659],"domain_scores_gemma":[0.9990033,0.00051294843,0.000113225506,0.00006049207,0.00024122925,0.00006881906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009173296,0.000046899415,0.000108173466,0.000026733953,0.0006705492,0.0000854588,0.00026794543,0.000029443647,0.000034920402],"category_scores_gemma":[0.00014405303,0.000029612955,0.000048593112,0.00007599825,0.0001237127,0.00031299455,0.000040991494,0.000117670636,0.000004119952],"study_design_candidate":"qualitative","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.000073171395,0.0002279148,0.06903555,0.0001015811,0.0002771484,0.0000023720627,0.3112232,0.00018111599,0.00163627,0.07582479,0.005167389,0.5362495],"study_design_scores_gemma":[0.0046741394,0.00045447558,0.10586734,0.00022031358,0.00055600435,0.00017451675,0.24544236,0.01731786,0.00038222264,0.353833,0.27025574,0.0008220243],"about_ca_topic_score_codex":0.00043854935,"about_ca_topic_score_gemma":0.000026060543,"teacher_disagreement_score":0.53542745,"about_ca_system_score_codex":0.000020126874,"about_ca_system_score_gemma":0.000056413133,"threshold_uncertainty_score":0.515739},"labels":[],"label_agreement":null},{"id":"W2008556387","doi":"10.1007/s11227-008-0212-2","title":"3-Hierarchical resource management model on web grid service architecture","year":2008,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Wonkwang University","keywords":"Computer science; Resource management (computing); Virtual organization; Grid; Semantic grid; Distributed computing; Grid computing; Resource Management System; Resource allocation; Human resource management system; Metadata; Service (business); Resource (disambiguation); Database; Knowledge management; Computer network; World Wide Web; Human resource management; Semantic Web","score_opus":0.025000745316175594,"score_gpt":0.22775370202639725,"score_spread":0.20275295671022164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008556387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44132313,0.00013809238,0.5494541,0.0035129404,0.0004074078,0.0001100706,0.000002481229,0.00008318249,0.0049686376],"genre_scores_gemma":[0.9737592,0.000019743364,0.023757124,0.0016960186,0.00064910797,4.183747e-7,0.0000015708208,0.000015248886,0.00010157422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997645,0.0003630217,0.0006021347,0.00022022634,0.00075263396,0.00041694732],"domain_scores_gemma":[0.9985335,0.00036943823,0.00023972229,0.0005707919,0.00013402505,0.0001525485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015376244,0.00021702198,0.0003121315,0.00018401019,0.000515104,0.00008266125,0.0023163522,0.000059991344,0.0000020904577],"category_scores_gemma":[0.000021420054,0.0001386852,0.0001535326,0.0005639672,0.000056094384,0.00014408749,0.00047190595,0.0007680505,0.000026718995],"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.000049044233,0.00009152028,0.00011485945,0.000036214147,0.000072698946,0.0001702601,0.0048093894,0.97657174,0.00016484309,0.004086162,0.006624544,0.0072087003],"study_design_scores_gemma":[0.000819133,0.00021943328,0.00087049237,0.00036160246,0.000027506103,0.0036469111,0.00021965792,0.9798149,0.00006136596,0.001539357,0.012151431,0.000268216],"about_ca_topic_score_codex":0.000006240114,"about_ca_topic_score_gemma":0.0000010711727,"teacher_disagreement_score":0.5324361,"about_ca_system_score_codex":0.00005042318,"about_ca_system_score_gemma":0.00008697543,"threshold_uncertainty_score":0.5655418},"labels":[],"label_agreement":null},{"id":"W2012673999","doi":"10.1023/b:supe.0000020185.08308.17","title":"Guest Editors' Editorial","year":2004,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Qualitative Comparative Analysis Research","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Data science","score_opus":0.058972170507291866,"score_gpt":0.4187435492698043,"score_spread":0.3597713787625124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012673999","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7825339,0.00059682253,0.013419149,0.014131838,0.17694843,0.00021450508,0.0000018199264,0.00003704184,0.012116495],"genre_scores_gemma":[0.6511096,0.00003304314,0.00037397462,0.00003851993,0.34838262,1.618378e-7,2.0467684e-7,0.0000050015683,0.000056866873],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967129,0.0012175975,0.00040103393,0.00006860916,0.0013032353,0.0002966128],"domain_scores_gemma":[0.9973259,0.0012678236,0.00018350611,0.00010699669,0.0009864725,0.00012933231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008703192,0.0000784097,0.00020731632,0.00011889067,0.0007866513,0.00009065345,0.0006642521,0.000054757456,0.00009465942],"category_scores_gemma":[0.001726335,0.000050287363,0.00012942357,0.00048336232,0.00042209262,0.00036288728,0.00007050334,0.00050592923,0.000096366464],"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.00012880568,0.00023480986,0.0016758044,0.000010460756,0.00028510217,0.000021190868,0.27643776,0.0045826975,0.008251909,0.014724068,0.6924257,0.0012216688],"study_design_scores_gemma":[0.00124174,0.00032881452,0.0010584417,0.00014756923,0.00008672683,0.000015975806,0.080248795,0.000055888315,0.002062589,0.015856214,0.8986547,0.00024255521],"about_ca_topic_score_codex":0.00106577,"about_ca_topic_score_gemma":0.00018207656,"teacher_disagreement_score":0.20622896,"about_ca_system_score_codex":0.00022597927,"about_ca_system_score_gemma":0.00047373,"threshold_uncertainty_score":0.6050365},"labels":[],"label_agreement":null},{"id":"W2012928197","doi":"10.1007/s11227-013-0927-6","title":"Advances in communication networks for pervasive and ubiquitous applications","year":2013,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Ubiquitous computing; Cyberspace; Data science; Computer security; Human–computer interaction; World Wide Web; The Internet","score_opus":0.011104250280494948,"score_gpt":0.24154065995190527,"score_spread":0.23043640967141032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012928197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019477993,0.0074627753,0.97129095,0.0011152294,0.00007774496,0.00026656475,2.0532684e-7,0.000010855973,0.0002976919],"genre_scores_gemma":[0.9610863,0.0021863147,0.036303353,0.00024329162,0.00015965888,0.000009421676,7.0752355e-7,0.0000049722253,0.000005989663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921453,0.000092964954,0.00035413523,0.00007653175,0.000097902564,0.00016394375],"domain_scores_gemma":[0.99847436,0.000888012,0.00017852975,0.00023052769,0.00017432922,0.000054248118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083383365,0.00007330667,0.00014888616,0.00005078695,0.00019921007,0.00008749686,0.00062485796,0.00003602906,0.0000019013033],"category_scores_gemma":[0.000007858518,0.000050123515,0.000034294622,0.00014883502,0.000059468133,0.0005987662,0.00014323922,0.00020852304,0.0000010340004],"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.0000071917184,0.00003151806,0.0010544998,0.0000130308445,0.0000081117905,9.3442367e-7,0.0015233883,0.010088992,0.00003093317,0.0052711875,0.0003541345,0.9816161],"study_design_scores_gemma":[0.00027703404,0.00005933188,0.0007816002,0.00006829122,0.000007907987,0.00012417184,0.00067620905,0.9864399,0.0000045242928,0.010337527,0.0011511358,0.000072393945],"about_ca_topic_score_codex":0.000014862676,"about_ca_topic_score_gemma":0.0000062143213,"teacher_disagreement_score":0.98154366,"about_ca_system_score_codex":0.000018138235,"about_ca_system_score_gemma":0.000029269473,"threshold_uncertainty_score":0.20439777},"labels":[],"label_agreement":null},{"id":"W2015457254","doi":"10.1007/s11227-007-0144-2","title":"A multiprocessor based heuristic for multi-dimensional multiple-choice knapsack problem","year":2007,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Knapsack problem; Computer science; Heuristic; Multiprocessing; Parallel computing; Overhead (engineering); Change-making problem; Mathematical optimization; Algorithm; Continuous knapsack problem; Mathematics","score_opus":0.03654757383663416,"score_gpt":0.2712778168740724,"score_spread":0.23473024303743822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015457254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23680905,0.00041500683,0.7617663,0.00010155068,0.00044470147,0.00028072455,0.0000056148992,0.00009872428,0.00007830686],"genre_scores_gemma":[0.81639886,0.000005414893,0.1831199,0.00015135201,0.00025408747,0.0000011057776,0.0000040209725,0.00004253067,0.00002272088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986551,0.000039675444,0.0006384781,0.00008898877,0.00023512098,0.00034263072],"domain_scores_gemma":[0.99716985,0.0021275529,0.00014190954,0.000116896124,0.00033257963,0.000111235175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017659136,0.00017424674,0.00022892414,0.0001442911,0.00018852533,0.000037001173,0.00025179132,0.00007411065,0.000015667514],"category_scores_gemma":[0.00048084892,0.0001258095,0.00011513593,0.00020654056,0.00003824161,0.0001359721,0.000021568665,0.0003210536,0.0000053520803],"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.000055420325,0.0000556723,0.0026495606,0.00015315608,0.000045244942,0.0000034820878,0.00077494717,0.98866516,0.004447985,0.000009299385,0.0003730942,0.0027669554],"study_design_scores_gemma":[0.0020462202,0.00007113505,0.0018056937,0.00023251207,0.000044824097,0.00006595229,0.00013175736,0.9916015,0.0026648524,0.000018273564,0.0011465055,0.00017074365],"about_ca_topic_score_codex":0.000009757843,"about_ca_topic_score_gemma":0.00002232053,"teacher_disagreement_score":0.57958984,"about_ca_system_score_codex":0.000058791113,"about_ca_system_score_gemma":0.000039308972,"threshold_uncertainty_score":0.51303625},"labels":[],"label_agreement":null},{"id":"W2016545623","doi":"10.1007/s11227-012-0746-1","title":"An efficient parallel neural network-based multi-instance learning algorithm","year":2012,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Artificial neural network; Weighting; Artificial intelligence; Machine learning; Algorithm; Relevance (law); Feature (linguistics); Data mining","score_opus":0.02617929907523009,"score_gpt":0.2777491308410951,"score_spread":0.251569831765865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016545623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06335236,0.0008584198,0.93487746,0.00033117557,0.00036677485,0.00007347667,2.0130717e-7,0.00011276633,0.000027373484],"genre_scores_gemma":[0.6696349,0.000011178689,0.3298033,0.00018053372,0.0003539453,3.748192e-7,2.869735e-7,0.000007778705,0.000007730681],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821657,0.00043661852,0.00043190445,0.00010793018,0.00037659897,0.00043036227],"domain_scores_gemma":[0.99879205,0.000269403,0.00029956867,0.00027841164,0.00021434056,0.00014624916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00284042,0.00013506185,0.00018526433,0.000068343295,0.00039147979,0.000112442176,0.0010044065,0.00004477275,0.000004387519],"category_scores_gemma":[0.000058311784,0.00008795076,0.00009735508,0.00036619048,0.000062209685,0.0005402405,0.00009314481,0.0005044548,0.00000612569],"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.000034128847,0.00049535837,0.008314374,0.000017879212,0.00003435511,0.000016224783,0.004382883,0.47121957,0.006795112,0.0013301735,0.00017193152,0.507188],"study_design_scores_gemma":[0.0002683621,0.000118280695,0.00520286,0.00003905981,0.000010437125,0.00011598887,0.00014113958,0.99138564,0.0022327865,0.00003237443,0.0003326374,0.000120436154],"about_ca_topic_score_codex":0.000006445442,"about_ca_topic_score_gemma":2.0192599e-7,"teacher_disagreement_score":0.60628253,"about_ca_system_score_codex":0.000054804583,"about_ca_system_score_gemma":0.00005049225,"threshold_uncertainty_score":0.35865277},"labels":[],"label_agreement":null},{"id":"W2019020869","doi":"10.1007/s11227-011-0674-5","title":"Secure communication mechanism for ubiquitous Smart grid infrastructure","year":2011,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Authentication (law); Computer security; Mobile device; Computer network; Smart grid; Trusted Platform Module; Default gateway; Scalability; Digital signature; Operating system","score_opus":0.02786160850852305,"score_gpt":0.2621968361261642,"score_spread":0.23433522761764114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019020869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037688196,0.000080111204,0.9601517,0.00054819504,0.00036946445,0.00095677486,0.0000016624366,0.000042455078,0.00016145152],"genre_scores_gemma":[0.7342146,0.000012575313,0.26532418,0.0002872557,0.00012854027,0.000016801701,6.4664573e-7,0.000009721997,0.0000056937465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875206,0.0001895979,0.00049452815,0.000110331726,0.0002395439,0.00021396606],"domain_scores_gemma":[0.99812126,0.0002702417,0.00043685848,0.00058428256,0.00051981834,0.000067530644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012814114,0.00012305853,0.0001792044,0.00007576529,0.00032399074,0.000053914726,0.00198713,0.00005796001,0.0000106341295],"category_scores_gemma":[0.00013553609,0.000084669635,0.00009664666,0.00018974989,0.000056128432,0.00065133127,0.00033273204,0.0003507992,0.0000037213974],"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.000051829174,0.00010059502,0.00025630984,0.00004889036,0.000062740466,0.0000033572485,0.039822813,0.00034476657,0.0044138012,0.93340766,0.00041645722,0.021070784],"study_design_scores_gemma":[0.0006543767,0.00024102397,0.0013975778,0.00011696741,0.000032808366,0.0004026831,0.0008084449,0.03978674,0.016486615,0.939237,0.00065443775,0.00018135068],"about_ca_topic_score_codex":0.00000754584,"about_ca_topic_score_gemma":0.0000028257025,"teacher_disagreement_score":0.6965264,"about_ca_system_score_codex":0.00004920495,"about_ca_system_score_gemma":0.00006863225,"threshold_uncertainty_score":0.36926147},"labels":[],"label_agreement":null},{"id":"W2020067699","doi":"10.1007/s11227-008-0190-4","title":"A framework for development and evaluation of a dynamic subchannel allocation scheme in an OFDMA system","year":2008,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Channel allocation schemes; Telecommunications link; Quality of service; Computer network; Bandwidth (computing); Bandwidth allocation; Orthogonal frequency-division multiple access; Dynamic bandwidth allocation; Channel (broadcasting); Orthogonal frequency-division multiplexing; Frequency-division multiple access; Spectral efficiency; Real-time computing; WiMAX; Telecommunications; Wireless","score_opus":0.13030107394383447,"score_gpt":0.36711369778323205,"score_spread":0.23681262383939758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020067699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63155913,0.0006563299,0.3673157,0.00026297878,0.000040412913,0.00015598534,9.837937e-8,0.0000061220726,0.0000032255837],"genre_scores_gemma":[0.8129336,0.000051313265,0.18696526,0.000008818825,0.00002859428,0.0000059010777,5.0937757e-7,0.0000053277713,6.5861343e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816847,0.00050215406,0.0005228824,0.00009427428,0.00055815827,0.00015405635],"domain_scores_gemma":[0.99806243,0.00056579814,0.00025284235,0.00030035374,0.00077258935,0.000046012934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006323358,0.00007087909,0.00016861418,0.00018142212,0.00018269304,0.000028105302,0.00083414826,0.000048129903,4.631099e-7],"category_scores_gemma":[0.00013567216,0.000053784308,0.000025353103,0.00035310024,0.00004636909,0.00036733242,0.00017740244,0.00022410882,2.6428063e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002202963,0.00054272177,0.013721759,0.00044011232,0.00016840387,0.0000074730333,0.12794264,0.15280409,0.013148204,0.034123514,0.00002822096,0.65685254],"study_design_scores_gemma":[0.00040466082,0.000050615086,0.0245011,0.0004068652,0.0000061771307,0.00008114484,0.00088175095,0.97246295,0.0006696643,0.00047738082,0.0000035447356,0.000054159045],"about_ca_topic_score_codex":0.000009786483,"about_ca_topic_score_gemma":0.000013498069,"teacher_disagreement_score":0.8196589,"about_ca_system_score_codex":0.00017370863,"about_ca_system_score_gemma":0.00028705114,"threshold_uncertainty_score":0.21932603},"labels":[],"label_agreement":null},{"id":"W2020884679","doi":"10.1007/s11227-013-1056-y","title":"Integrating the enriched feature with machine learning algorithms for human movement and fall detection","year":2013,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wearable computer; Artificial intelligence; Accelerometer; Wireless sensor network; Feature (linguistics); Wireless; Machine learning; Algorithm; Artificial neural network; Computer vision; Embedded system; Telecommunications","score_opus":0.020646474950314,"score_gpt":0.24443531803512167,"score_spread":0.22378884308480768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020884679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4610828,0.00018332386,0.53725535,0.0011070526,0.000097230586,0.00022338009,2.0540453e-7,0.000021874199,0.000028780498],"genre_scores_gemma":[0.98935914,0.00000613046,0.010097034,0.00021909471,0.00024887096,0.0000062068902,3.762853e-7,0.0000116106785,0.000051542058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988263,0.00028089024,0.00030225897,0.0001281068,0.0002652072,0.00019722283],"domain_scores_gemma":[0.9983997,0.0007361885,0.00033385388,0.00015675672,0.0003216288,0.00005187888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017627224,0.00013696431,0.00019714532,0.00007871517,0.00067776756,0.0003306183,0.00045037648,0.000037433085,0.000002045262],"category_scores_gemma":[0.00008731128,0.00006609423,0.00006223834,0.00018170358,0.0000409202,0.0005741409,0.00014041313,0.0005444789,0.0000013637562],"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.00002291344,0.00004749536,0.0046212617,0.000040255818,0.00018379223,0.000003923327,0.017135713,0.0007177784,0.085891545,0.0002780858,0.000084517065,0.89097273],"study_design_scores_gemma":[0.0021225282,0.0016697213,0.014171846,0.0004179057,0.00009700338,0.0016572542,0.013531992,0.9541346,0.008294295,0.0026427167,0.000823711,0.00043644168],"about_ca_topic_score_codex":0.00048731556,"about_ca_topic_score_gemma":0.0001854787,"teacher_disagreement_score":0.9534168,"about_ca_system_score_codex":0.000051047908,"about_ca_system_score_gemma":0.000022232469,"threshold_uncertainty_score":0.5212909},"labels":[],"label_agreement":null},{"id":"W2023343476","doi":"10.1007/s11227-012-0795-5","title":"A subcarrier modulation based optical wireless communication system employing transmission diversity","year":2012,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Medical Research Council","keywords":"Computer science; Optical wireless; Subcarrier; Transmit diversity; Transmission (telecommunications); Wireless; Antenna diversity; Optical wireless communications; Optical power; Transmitter power output; Modulation (music); SIGNAL (programming language); Electronic engineering; Diversity scheme; Optical communication; Telecommunications; Computer network; Transmitter; Fading; Orthogonal frequency-division multiplexing; Optics; Physics; Channel (broadcasting)","score_opus":0.02072136740883126,"score_gpt":0.2191156291548907,"score_spread":0.19839426174605942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023343476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7880196,0.0013911433,0.2097675,0.00021117728,0.00009543797,0.00006888006,4.5146592e-7,0.00020970886,0.00023610327],"genre_scores_gemma":[0.9852271,0.000118572505,0.014563266,0.000012933754,0.000055023047,6.1726104e-7,0.0000015493531,0.000020144984,7.737701e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988474,0.00017815386,0.00042084447,0.0000414054,0.0002790627,0.00023308759],"domain_scores_gemma":[0.99890655,0.00039897248,0.00009096001,0.00039598977,0.00012267914,0.00008485936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014392519,0.000119027936,0.00020347412,0.0001065129,0.0003934564,0.000024091012,0.0006983198,0.00010170098,0.0000049775745],"category_scores_gemma":[0.00004165446,0.00008797705,0.000081924336,0.00021488644,0.000084894236,0.00040072153,0.0002133171,0.00051640184,0.0000049941796],"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.000101321355,0.00023645165,0.035323795,0.0005086952,0.0002513176,0.0000046202085,0.012259023,0.41791514,0.06242448,0.010583545,0.0001935642,0.46019804],"study_design_scores_gemma":[0.00042945726,0.00003174766,0.026154853,0.00040888347,0.000064546075,0.00006417818,0.0027920816,0.956758,0.012968599,0.00006820395,0.00007828316,0.00018115695],"about_ca_topic_score_codex":0.000009112053,"about_ca_topic_score_gemma":5.2051416e-7,"teacher_disagreement_score":0.53884286,"about_ca_system_score_codex":0.00018073388,"about_ca_system_score_gemma":0.000011177045,"threshold_uncertainty_score":0.35876003},"labels":[],"label_agreement":null},{"id":"W2025586852","doi":"10.1007/s11227-013-0893-z","title":"Normalized particle swarm optimization for complex chooser option pricing on graphics processing unit","year":2013,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Computer science; Valuation of options; Particle swarm optimization; Exotic option; Mathematical optimization; Black–Scholes model; Binomial options pricing model; Profit (economics); Finance; Algorithm; Economics; Microeconomics; Volatility (finance); Mathematics","score_opus":0.06439300136935261,"score_gpt":0.2568065548535011,"score_spread":0.19241355348414851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025586852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28271794,0.00024317377,0.7157826,0.0008287561,0.0000671374,0.00021242094,0.0000033795825,0.000011295932,0.00013328293],"genre_scores_gemma":[0.97179,0.00003517813,0.027543906,0.0003579878,0.00023295566,0.000010837332,0.000003828812,0.00001683325,0.000008465073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999003,0.000007621247,0.00063642743,0.00010291854,0.00005082892,0.00019920962],"domain_scores_gemma":[0.9989735,0.00014576521,0.0004892888,0.00010811621,0.00023413157,0.00004919717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007319363,0.0000951306,0.00021934742,0.000098636425,0.00036323816,0.00008751988,0.000218726,0.000042676445,0.000023956803],"category_scores_gemma":[0.00013718217,0.00007755565,0.0000732578,0.00031513345,0.000036426394,0.00030925105,0.000026663238,0.0001437483,0.000020115489],"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.0001233717,0.0003149506,0.0033249592,0.00015920399,0.00007482902,5.284924e-7,0.0038965517,0.45223433,0.0013497137,0.51223516,0.00021378614,0.026072633],"study_design_scores_gemma":[0.00072749815,0.00014368557,0.009392613,0.00006928899,0.000018823346,0.000016496542,0.00034256687,0.93932176,0.00020464574,0.049192227,0.0004315275,0.00013887866],"about_ca_topic_score_codex":0.00006332896,"about_ca_topic_score_gemma":0.0000012207609,"teacher_disagreement_score":0.6890721,"about_ca_system_score_codex":0.000035092056,"about_ca_system_score_gemma":0.000020439818,"threshold_uncertainty_score":0.31626275},"labels":[],"label_agreement":null},{"id":"W2029329838","doi":"10.1007/s11227-008-0182-4","title":"A software architecture framework for on-line option pricing","year":2008,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Architecture; Valuation of options; Mobile device; Distributed computing; Operating system; Finance","score_opus":0.06088063218122076,"score_gpt":0.26091719210250686,"score_spread":0.2000365599212861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029329838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1363324,0.00075206684,0.8616325,0.00089863647,0.00018431964,0.00012078053,0.000011335039,0.000010875908,0.000057073503],"genre_scores_gemma":[0.8481539,0.00005053512,0.1506968,0.0003304312,0.000740428,0.000003014423,0.0000011403637,0.000014002741,0.000009765724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992257,0.000003649811,0.00047654595,0.00009519266,0.000039520837,0.00015940898],"domain_scores_gemma":[0.9989333,0.00048100392,0.00034621052,0.00012756878,0.0000746537,0.000037264053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005087489,0.00008370612,0.0002255961,0.0000994569,0.00033271365,0.000013947165,0.00023915684,0.00005493169,0.0000052188475],"category_scores_gemma":[0.0005549206,0.000064817395,0.0001056893,0.00018372702,0.00003810826,0.000056258014,0.000026197922,0.00027496216,0.0000150957085],"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.00012805218,0.00013210473,0.001082966,0.000049203034,0.00005775756,0.00000322843,0.0048861816,0.06082116,0.000051144936,0.913495,0.0001352773,0.019157948],"study_design_scores_gemma":[0.00040003154,0.00033122918,0.0025734806,0.00012498898,0.0000125622855,0.00021523205,0.00013626572,0.0068040234,0.000077591336,0.9876702,0.0015129881,0.00014139578],"about_ca_topic_score_codex":0.0000114188,"about_ca_topic_score_gemma":5.1962263e-7,"teacher_disagreement_score":0.7118215,"about_ca_system_score_codex":0.000037210033,"about_ca_system_score_gemma":0.000023560307,"threshold_uncertainty_score":0.26431766},"labels":[],"label_agreement":null},{"id":"W2031228433","doi":"10.1007/s11227-006-7945-6","title":"Spherical harmonic transforms for discrete multiresolution applications","year":2006,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Seismic Imaging and Inversion Techniques","field":"Earth and Planetary Sciences","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; University of Calgary","funders":"","keywords":"Computer science; Spherical harmonics; Computation; Grid; Quadrature (astronomy); Computational science; Harmonic analysis; Geodetic datum; Algorithm; Fast Fourier transform; Representation (politics); Multiresolution analysis; Theoretical computer science; Applied mathematics; Mathematics; Geometry; Discrete wavelet transform; Mathematical analysis; Wavelet; Geodesy; Physics","score_opus":0.013502561644357794,"score_gpt":0.22747388833467477,"score_spread":0.213971326690317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031228433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3160593,0.00084467314,0.68039244,0.001675349,0.00011593546,0.00018874908,0.000009802689,0.000036552432,0.00067723513],"genre_scores_gemma":[0.98045903,0.000031923224,0.018897766,0.00024717726,0.00031977225,3.304478e-7,0.00000909664,0.0000024906308,0.00003237969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993849,0.00003573886,0.00025108553,0.00005134186,0.00012762865,0.00014929753],"domain_scores_gemma":[0.9995858,0.00018599565,0.0000821746,0.00006275037,0.000052834974,0.000030440602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006214585,0.000059567592,0.00009498534,0.000031331718,0.00023948443,0.000024378334,0.00019347623,0.000023766728,0.000039980936],"category_scores_gemma":[0.000009373795,0.00003400537,0.00008298488,0.00009209823,0.00006050514,0.00014644503,0.0000033534398,0.00012488275,0.000006590464],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017992302,0.000059304533,0.026174132,0.00005095572,0.000042651438,0.000003061841,0.00088843604,0.024355577,0.004384234,0.00031305052,0.021203153,0.9223455],"study_design_scores_gemma":[0.0009797743,0.00039179414,0.036214992,0.00009057286,0.00011205321,0.00033767943,0.0013361605,0.83193475,0.01092492,0.010167782,0.10722344,0.00028607761],"about_ca_topic_score_codex":0.0011251671,"about_ca_topic_score_gemma":0.000013264006,"teacher_disagreement_score":0.9220594,"about_ca_system_score_codex":0.0000066218686,"about_ca_system_score_gemma":0.000022372606,"threshold_uncertainty_score":0.18419449},"labels":[],"label_agreement":null},{"id":"W2031282765","doi":"10.1007/s11227-009-0371-9","title":"Adaptive popularity-driven replica placement in hierarchical data grids","year":2009,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Replica; Latency (audio); Distributed computing; Scalability; Data access; Data grid; Grid; Replication (statistics); Popularity; Computer network; Database","score_opus":0.05649258628647368,"score_gpt":0.2941479790441187,"score_spread":0.23765539275764502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031282765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27142528,0.00042128004,0.7227743,0.0039829714,0.00052984915,0.00016392644,0.0000052220216,0.000051987696,0.0006451975],"genre_scores_gemma":[0.9729872,0.000013912908,0.026187763,0.000377279,0.0004090927,1.3853072e-7,0.0000054099114,0.0000057590337,0.000013487145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741167,0.0005342027,0.00083361426,0.00028147342,0.0005438387,0.0003951956],"domain_scores_gemma":[0.99810535,0.00034972825,0.00028602048,0.0010300692,0.00011165794,0.00011718786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003684183,0.00016919275,0.00035487494,0.00015027083,0.00019060142,0.00014052217,0.0037584014,0.000061837214,0.0000026024884],"category_scores_gemma":[0.00012425805,0.00011588869,0.00007697512,0.0004898772,0.000040645784,0.000503447,0.0007223611,0.00073283946,0.0000073218266],"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.00063611905,0.001963108,0.01678749,0.00008161894,0.00040472805,0.001410567,0.037434462,0.554997,0.0031594476,0.064100645,0.03383587,0.28518894],"study_design_scores_gemma":[0.0011380295,0.00072412693,0.02182181,0.000452678,0.000023487195,0.0013514231,0.00038021198,0.9675673,0.000043446555,0.003691402,0.0025009075,0.00030513987],"about_ca_topic_score_codex":0.000059663966,"about_ca_topic_score_gemma":0.000007468164,"teacher_disagreement_score":0.70156187,"about_ca_system_score_codex":0.000083363266,"about_ca_system_score_gemma":0.00012752243,"threshold_uncertainty_score":0.69841075},"labels":[],"label_agreement":null},{"id":"W2033647326","doi":"10.1007/s11227-014-1086-0","title":"An analytical study of resource division and its impact on power and performance of multi-core processors","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Benchmark (surveying); Computer science; Division (mathematics); Power consumption; Resource (disambiguation); Power (physics); Core (optical fiber); Multi-core processor; Chip; Architecture; Microarchitecture; Parallel computing; Distributed computing; Computer architecture; Embedded system; Computer engineering; Telecommunications; Computer network; Arithmetic","score_opus":0.028537090420772605,"score_gpt":0.3203201213855511,"score_spread":0.2917830309647785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033647326","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93479323,0.00008926353,0.0649398,0.000032120883,0.000018122222,0.000082974024,1.8485382e-7,0.000018901026,0.000025407186],"genre_scores_gemma":[0.9935634,0.000013849639,0.006373143,0.000023503053,0.000017716795,9.467673e-8,8.251559e-8,0.000006265196,0.000001934523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879193,0.00021211404,0.0004379915,0.0001267815,0.0002971848,0.00013401863],"domain_scores_gemma":[0.9989136,0.0002795767,0.0003038481,0.00021391558,0.00021292621,0.00007615732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020640977,0.000114166214,0.00027651218,0.00016465594,0.00012434516,0.00003349268,0.0004761049,0.000034146346,6.2633865e-7],"category_scores_gemma":[0.00010309558,0.000066508044,0.00003413102,0.00022589455,0.000044911074,0.00024991797,0.00016446864,0.00020310617,1.14278436e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004181004,0.0019106058,0.29580128,0.00015507435,0.00014651132,0.0000059762,0.052185312,0.5913647,0.0029205144,0.00053870876,0.000059610902,0.054493647],"study_design_scores_gemma":[0.00044556052,0.0035934532,0.123174846,0.00014268157,0.00001197161,0.000036192065,0.00025664756,0.871499,0.0007542005,0.000019104562,0.0000012163152,0.00006512306],"about_ca_topic_score_codex":0.000007172452,"about_ca_topic_score_gemma":2.7727276e-7,"teacher_disagreement_score":0.28013435,"about_ca_system_score_codex":0.000010461452,"about_ca_system_score_gemma":0.000019302233,"threshold_uncertainty_score":0.27121195},"labels":[],"label_agreement":null},{"id":"W2033649629","doi":"10.1007/s11227-013-1009-5","title":"Secure and robust multipath routings for advanced metering infrastructure","year":2013,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Wireless mesh network; Multipath routing; Robustness (evolution); Smart grid; Routing protocol; Wireless; Default gateway; Multipath propagation; Wireless network; Distributed computing; Link-state routing protocol; Routing (electronic design automation); Telecommunications","score_opus":0.009435914658442499,"score_gpt":0.21218127396769954,"score_spread":0.20274535930925702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033649629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48887262,0.0003138208,0.5100237,0.0003353508,0.00024453105,0.00016500699,2.5265928e-7,0.000019812149,0.00002489798],"genre_scores_gemma":[0.7420973,0.000023526018,0.2573865,0.0002056934,0.0002663599,0.0000020107796,1.6407851e-7,0.000011793932,0.000006614474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987925,0.000084692336,0.00043909322,0.00015134466,0.0002036799,0.00032866737],"domain_scores_gemma":[0.99859613,0.00053572777,0.00027858076,0.00025007225,0.00023592732,0.00010354781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090730586,0.00015582578,0.0002510105,0.000062660634,0.0002483108,0.00019308648,0.00084393576,0.000058264817,0.000006602213],"category_scores_gemma":[0.000103675986,0.00010016493,0.00007852683,0.00016531268,0.00004378787,0.00089071796,0.00035310208,0.00036479952,0.0000013467685],"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.000032022712,0.000028779044,0.0014919661,0.000085597865,0.00010609088,0.000010313207,0.013787364,0.496981,0.023799118,0.0017150425,0.002063365,0.45989934],"study_design_scores_gemma":[0.00093931437,0.00022294522,0.0048672627,0.00019619685,0.000026011221,0.0006546566,0.0007799237,0.987564,0.0009589607,0.0031905868,0.00038741887,0.00021271134],"about_ca_topic_score_codex":0.000013755545,"about_ca_topic_score_gemma":0.0000015217704,"teacher_disagreement_score":0.490583,"about_ca_system_score_codex":0.000036572532,"about_ca_system_score_gemma":0.00002997385,"threshold_uncertainty_score":0.40846074},"labels":[],"label_agreement":null},{"id":"W2034014585","doi":"10.1007/s11227-011-0718-x","title":"Green computing and communications","year":2011,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Green IT and Sustainability","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"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; Distributed computing; Telecommunications","score_opus":0.03232018699916013,"score_gpt":0.233890973435665,"score_spread":0.2015707864365049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034014585","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98932934,0.0010758134,0.0072852396,0.00012398825,0.000090457135,0.000041342497,2.6992663e-7,0.00003365155,0.0020198815],"genre_scores_gemma":[0.9945287,0.00005511393,0.0053044027,0.000025045569,0.00007264059,5.4390235e-8,1.3163942e-7,0.000009662887,0.000004256613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940854,0.00007598017,0.00027671503,0.000029373294,0.00007767327,0.00013173878],"domain_scores_gemma":[0.99941313,0.00017916787,0.00004292721,0.00022861954,0.000089877525,0.0000462714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093114737,0.00006824833,0.0001232397,0.000046027457,0.00014855627,0.000011563337,0.00036872705,0.000025138188,0.000006753358],"category_scores_gemma":[0.0000255564,0.000047309273,0.00003549875,0.00009021942,0.000095124415,0.000109036606,0.00012926022,0.00027542177,0.0000014561705],"study_design_candidate":"observational","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.00005878694,0.00016804524,0.29317126,0.00043081882,0.00046306563,0.000043645883,0.21714741,0.006306105,0.003961256,0.004338135,0.0008619116,0.47304955],"study_design_scores_gemma":[0.0011186863,0.00025397053,0.43990567,0.0002725889,0.00022141617,0.0015725548,0.028953495,0.5138158,0.0011495034,0.010138768,0.0020461162,0.00055141654],"about_ca_topic_score_codex":0.000092257564,"about_ca_topic_score_gemma":0.000012461235,"teacher_disagreement_score":0.5075097,"about_ca_system_score_codex":0.000024524452,"about_ca_system_score_gemma":0.0000102737695,"threshold_uncertainty_score":0.19292161},"labels":[],"label_agreement":null},{"id":"W2034652489","doi":"10.1007/s11227-011-0732-z","title":"Implementation and performance analysis of multilevel security system in pervasive computing environment","year":2012,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Access Control and Trust","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Cache; Access control; Computer network; Overhead (engineering); Security policy; Security domain; Distributed computing; Operating system","score_opus":0.02076416909389848,"score_gpt":0.30259526821300636,"score_spread":0.28183109911910786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034652489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99753845,0.00048970047,0.0015694234,0.000076486955,0.000073628835,0.00007860459,0.000001423002,0.000003470831,0.00016881846],"genre_scores_gemma":[0.9994489,0.00009188896,0.00027912663,0.000014931677,0.00016073346,1.6766244e-7,4.6866347e-7,0.0000028730751,8.970021e-7],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99878424,0.00027604055,0.0004177,0.000045315413,0.0002754157,0.00020127866],"domain_scores_gemma":[0.9992368,0.00030527814,0.00030244564,0.000051442406,0.00005014238,0.000053884207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032808543,0.000059536073,0.00023096071,0.0001468901,0.00024580376,0.00001604009,0.00014524719,0.00002640763,0.000015399384],"category_scores_gemma":[0.00002223546,0.000042094864,0.00005899495,0.00020886392,0.00008015491,0.00032650455,0.000056968394,0.00012607603,5.114301e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012211316,0.000024348385,0.8913564,0.000020336716,0.00013076096,5.4387726e-7,0.079454035,0.0021320311,0.00008632578,0.00041114708,0.0000013138404,0.02637056],"study_design_scores_gemma":[0.0003291647,0.000025068128,0.8683335,0.00004860886,0.00029149518,0.00000527,0.09250892,0.0382891,0.00008345175,0.000006821346,0.000025782905,0.00005280075],"about_ca_topic_score_codex":0.0014305396,"about_ca_topic_score_gemma":0.00015533548,"teacher_disagreement_score":0.036157068,"about_ca_system_score_codex":0.00010288163,"about_ca_system_score_gemma":0.000026479272,"threshold_uncertainty_score":0.21625575},"labels":[],"label_agreement":null},{"id":"W2035171729","doi":"10.1007/s11227-012-0748-z","title":"Online execution time prediction for computationally intensive applications with periodic progress updates","year":2012,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Real-time computing","score_opus":0.015584401919121272,"score_gpt":0.263583593051369,"score_spread":0.24799919113224775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035171729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057501044,0.00053022295,0.94007623,0.001274109,0.00010789569,0.00033902112,0.0000065108366,0.0001369493,0.000028014369],"genre_scores_gemma":[0.6164096,0.000013313506,0.38289103,0.000237613,0.00039861217,0.0000064692886,0.000020997759,0.000010209445,0.000012144351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988224,0.00011109071,0.00043174432,0.00011247939,0.00027782068,0.00024449892],"domain_scores_gemma":[0.9978598,0.00031189574,0.00036034742,0.00019040138,0.0011937942,0.000083787345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052219,0.00012949477,0.00018634617,0.00013840344,0.00037045145,0.000093181494,0.0005744035,0.000043337328,0.000001940862],"category_scores_gemma":[0.0000479641,0.000083950465,0.00006775653,0.00031210604,0.00009521438,0.0006162001,0.00010131468,0.00018507778,0.0000037474347],"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.0005372157,0.0028030665,0.044688255,0.00028124938,0.0009641158,0.000008302481,0.039371617,0.5864513,0.0029298514,0.033819232,0.023354823,0.26479095],"study_design_scores_gemma":[0.0007169011,0.0005067246,0.010497768,0.0001792897,0.00008086624,0.0008472888,0.0005489504,0.9822108,0.00061615603,0.0010387059,0.0025338682,0.00022264547],"about_ca_topic_score_codex":0.0000017406671,"about_ca_topic_score_gemma":1.9441269e-7,"teacher_disagreement_score":0.5589086,"about_ca_system_score_codex":0.000057085625,"about_ca_system_score_gemma":0.00008648312,"threshold_uncertainty_score":0.34234008},"labels":[],"label_agreement":null},{"id":"W2036555304","doi":"10.1007/s11227-008-0202-4","title":"U-multimedia framework: a secure and intelligent multimedia service framework based on context information in U-home","year":2008,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Access Control and Trust","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Multimedia; Context (archaeology); Service (business); World Wide Web; Context awareness","score_opus":0.024085482486223875,"score_gpt":0.28219345413565894,"score_spread":0.25810797164943505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036555304","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97168416,0.00041528387,0.021018289,0.0057625533,0.0004840146,0.00020877912,0.0000022961174,0.0000217306,0.00040289032],"genre_scores_gemma":[0.9909208,0.00020759263,0.0055850996,0.0027975764,0.00047700692,9.874602e-7,9.357338e-7,0.0000076200113,0.0000024144206],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828136,0.00030473893,0.0005266007,0.00007328916,0.0005200164,0.00029402183],"domain_scores_gemma":[0.99689686,0.0023497813,0.00025318994,0.00011279879,0.00025057435,0.00013680993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017520818,0.00012966852,0.00025715985,0.00017932174,0.000468048,0.00007045852,0.00037453376,0.00017368021,0.0000646397],"category_scores_gemma":[0.0010180973,0.00008927936,0.000058621867,0.00040800375,0.00017063788,0.00062311353,0.000051162162,0.0008831451,0.000022940112],"study_design_candidate":"qualitative","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.00056895736,0.0002249726,0.08656622,0.000059647522,0.00006875255,0.000061127546,0.61748123,0.016375888,0.000026063974,0.002594674,0.00021688975,0.27575555],"study_design_scores_gemma":[0.0038972998,0.00044619446,0.17734641,0.0028854483,0.00010501781,0.00011686148,0.11947525,0.67887783,0.00014705503,0.008497037,0.007387747,0.00081782293],"about_ca_topic_score_codex":0.00087527395,"about_ca_topic_score_gemma":0.00023576649,"teacher_disagreement_score":0.662502,"about_ca_system_score_codex":0.000088655404,"about_ca_system_score_gemma":0.00016351006,"threshold_uncertainty_score":0.38368753},"labels":[],"label_agreement":null},{"id":"W2036738287","doi":"10.1007/s11227-008-0215-z","title":"Prediction of dynamical, nonlinear, and unstable process behavior","year":2008,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Scheduling (production processes); Nonlinear system; Process (computing); Distributed computing; Mathematical optimization","score_opus":0.03187427107375176,"score_gpt":0.25064224053703243,"score_spread":0.21876796946328067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036738287","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9100042,0.00016812401,0.08937218,0.0002815841,0.000068017835,0.000057944744,0.0000011771177,0.000011148205,0.000035617384],"genre_scores_gemma":[0.98848563,0.00009658727,0.011269033,0.00003391601,0.00010313678,4.9297887e-7,2.85813e-7,0.000003473732,0.0000074359104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993462,0.00003122623,0.00028518948,0.000062776555,0.00017434172,0.00010029802],"domain_scores_gemma":[0.9994614,0.000092139664,0.00013964779,0.00012327162,0.00014145406,0.00004208617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030135192,0.00005301141,0.0001114634,0.000036188023,0.00018048169,0.000015901336,0.0003484233,0.000020452106,0.0000012573981],"category_scores_gemma":[0.000009444268,0.000033765653,0.000029725505,0.00020682043,0.00007152676,0.0002567689,0.00007447383,0.00015756425,3.762241e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014303076,0.0028123248,0.26919082,0.00033362152,0.00027347883,0.00019004554,0.03387698,0.14280386,0.21341658,0.010131982,0.003660697,0.32316658],"study_design_scores_gemma":[0.0005448343,0.00029801775,0.05116598,0.00012605649,0.000052515545,0.0032075224,0.00029656108,0.9387239,0.0045711845,0.0006489653,0.00024163633,0.00012278532],"about_ca_topic_score_codex":0.000008783265,"about_ca_topic_score_gemma":6.018064e-7,"teacher_disagreement_score":0.7959201,"about_ca_system_score_codex":0.000007982287,"about_ca_system_score_gemma":0.000034902303,"threshold_uncertainty_score":0.13881375},"labels":[],"label_agreement":null},{"id":"W2046763581","doi":"10.1007/s11227-015-1424-x","title":"Special section on support technology and architecture for networked and distributed applications in big data era","year":2015,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Special section; Architecture; Section (typography); Big data; Computer architecture; Data science; Distributed computing; Operating system","score_opus":0.05338250444969183,"score_gpt":0.271514553858921,"score_spread":0.21813204940922915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046763581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29450503,0.00011732841,0.70007795,0.0019300701,0.003094221,0.0001618371,0.0000013301947,0.000023104561,0.000089161826],"genre_scores_gemma":[0.9392666,0.000018862236,0.028032692,0.00014062384,0.03250684,0.0000016692879,0.000014308,0.000012920103,0.000005447635],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991155,0.00006469978,0.00030534973,0.0001700944,0.00013014895,0.00021415121],"domain_scores_gemma":[0.9991083,0.00030786122,0.00013330937,0.0002945759,0.00008821441,0.00006771049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014619557,0.000099935874,0.00017767782,0.00024238082,0.00018455561,0.0000798449,0.00069252966,0.00006328141,9.985193e-8],"category_scores_gemma":[0.00008125523,0.00006942034,0.000017647795,0.00049934245,0.0000620513,0.00015535469,0.0004751755,0.00038313042,3.2415318e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008554573,0.00008139624,0.008216421,0.00002466145,0.000036098863,0.000010445914,0.0035015964,0.0058018398,0.00023233672,0.0009465991,0.016155548,0.9649075],"study_design_scores_gemma":[0.005662198,0.0019608592,0.01935419,0.00042134325,0.000114542076,0.0035533202,0.0020779932,0.45612448,0.00038735196,0.037930157,0.47156242,0.00085116655],"about_ca_topic_score_codex":0.000006881632,"about_ca_topic_score_gemma":0.000007735465,"teacher_disagreement_score":0.9640564,"about_ca_system_score_codex":0.000035520454,"about_ca_system_score_gemma":0.0000781491,"threshold_uncertainty_score":0.28308794},"labels":[],"label_agreement":null},{"id":"W2047084253","doi":"10.1023/b:supe.0000026852.08638.96","title":"Distributed Path-Based Inference in Semantic Networks","year":2004,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Multiprocessing; Task (project management); Path (computing); Scheme (mathematics); Host (biology); Programming language; Set (abstract data type); Distributed computing; Parallel computing","score_opus":0.01528037355071005,"score_gpt":0.2430658513515625,"score_spread":0.22778547780085245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047084253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33207113,0.00026488618,0.6664819,0.00066019257,0.00039730736,0.000063787986,9.710142e-7,0.000034236276,0.00002558799],"genre_scores_gemma":[0.99308157,0.000008139804,0.0064994115,0.00019331875,0.00020471866,3.6453991e-7,0.0000029443204,0.000008301339,0.0000012545594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979626,0.0002857918,0.00078227394,0.00015750591,0.00038512493,0.00042669],"domain_scores_gemma":[0.99825704,0.00074336963,0.00033560084,0.00037801664,0.00018470916,0.00010129055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022569331,0.00017921795,0.0003349293,0.00013406509,0.00016994975,0.0001626002,0.0016150195,0.00007113894,0.0000015793943],"category_scores_gemma":[0.00018702594,0.00012232948,0.000117225645,0.00085083843,0.000055272834,0.000304624,0.00019014382,0.00055294816,0.0000071854524],"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.000008988774,0.00006720588,0.004484685,0.000012920282,0.000011850807,0.000078970304,0.0006779781,0.99104834,0.000105824365,0.0015651158,0.000042127107,0.0018959779],"study_design_scores_gemma":[0.0014802604,0.0001913444,0.016102212,0.00086882885,0.000014460745,0.00027485107,0.00014951143,0.9783529,0.00012039413,0.001996622,0.00020536904,0.00024324708],"about_ca_topic_score_codex":0.00012758575,"about_ca_topic_score_gemma":0.000010935341,"teacher_disagreement_score":0.6610104,"about_ca_system_score_codex":0.0001215977,"about_ca_system_score_gemma":0.00022199885,"threshold_uncertainty_score":0.49884516},"labels":[],"label_agreement":null},{"id":"W2049607712","doi":"10.1007/s11227-012-0768-8","title":"Multiple biological sequence alignment in heterogeneous multicore clusters with user-selectable task allocation policies","year":2012,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Task (project management); Multi-core processor; Sequence (biology); Distributed computing; Parallel computing; Human–computer interaction","score_opus":0.028084091125361723,"score_gpt":0.2520893068376104,"score_spread":0.22400521571224866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049607712","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99682033,0.0018342176,0.0009571039,0.00017539113,0.00008564015,0.000103089464,0.0000022436686,0.0000012938077,0.000020707443],"genre_scores_gemma":[0.9974424,0.00032372287,0.0017651747,0.0001998579,0.00024689376,0.0000015390567,0.0000030565286,0.000010170357,0.0000071444306],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916947,0.00010683216,0.00025614022,0.00008402241,0.0000986895,0.00028487385],"domain_scores_gemma":[0.99958575,0.000057754845,0.0001126269,0.00011923667,0.00007015847,0.000054481185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005059629,0.000115414085,0.00014453747,0.00003199472,0.000094332114,0.000011530012,0.00018643218,0.000050732266,0.0000013829085],"category_scores_gemma":[0.00004583121,0.000068375644,0.000042741518,0.000064927386,0.00007526295,0.0000027649642,0.00009899603,0.0000935515,0.0000010855139],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093423536,0.000059007085,0.18859991,0.000004950417,0.000059428352,0.0000015179158,0.0013869058,0.014257135,0.79488945,0.000006311825,0.00003288262,0.00060907],"study_design_scores_gemma":[0.0038864422,0.00292038,0.31310293,0.0001957396,0.00015273169,0.0023215467,0.006409873,0.006629225,0.6565659,0.00004376135,0.0068428363,0.0009286036],"about_ca_topic_score_codex":0.00009717873,"about_ca_topic_score_gemma":0.000042727785,"teacher_disagreement_score":0.13832355,"about_ca_system_score_codex":0.000031522228,"about_ca_system_score_gemma":0.000028150775,"threshold_uncertainty_score":0.2788278},"labels":[],"label_agreement":null},{"id":"W2049920528","doi":"10.1007/s11227-012-0826-2","title":"Enhancing performance of failure-prone clusters by adaptive provisioning of cloud resources","year":2012,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Provisioning; Computer science; Cloud computing; Distributed computing; Scheduling (production processes); Virtual machine; Probabilistic logic; Resource (disambiguation); Fault tolerance; Computer network; Operating system","score_opus":0.010408366038522826,"score_gpt":0.21209750636113273,"score_spread":0.2016891403226099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049920528","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9062852,0.0011010234,0.09154863,0.000305277,0.00037732217,0.000107935695,3.542808e-7,0.000020880098,0.00025334192],"genre_scores_gemma":[0.97834784,0.000011475312,0.021156892,0.00005653496,0.0003768565,2.6530694e-7,1.1846873e-7,0.000012864675,0.0000371696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975753,0.0003016031,0.0009199935,0.00013140753,0.00064873334,0.00042296876],"domain_scores_gemma":[0.9979474,0.0004992341,0.0008813496,0.00036442085,0.00020665988,0.000100946796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041095815,0.00017617176,0.00039573867,0.00016965895,0.00023980625,0.000033278302,0.0013087981,0.000049921084,0.0000026957032],"category_scores_gemma":[0.00007141749,0.000115010414,0.00014027183,0.0004270229,0.000119008306,0.00016745205,0.000713422,0.00037976605,0.0000020465943],"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.00051715685,0.0011218254,0.025207702,0.0010630423,0.0009918147,0.000012716924,0.26959482,0.30753872,0.13719428,0.0025403688,0.0039175986,0.25029996],"study_design_scores_gemma":[0.0022123267,0.002606747,0.008102684,0.0040619005,0.0002494519,0.0005544993,0.023469042,0.78538996,0.16975975,0.00011645,0.0026427216,0.0008344902],"about_ca_topic_score_codex":0.000042046348,"about_ca_topic_score_gemma":8.551354e-7,"teacher_disagreement_score":0.47785124,"about_ca_system_score_codex":0.000053296022,"about_ca_system_score_gemma":0.00003655379,"threshold_uncertainty_score":0.46899885},"labels":[],"label_agreement":null},{"id":"W2051974480","doi":"10.1007/s11227-011-0662-9","title":"Revisiting relative neighborhood graph-based broadcasting algorithms for multimedia ad hoc wireless networks","year":2011,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Broadcast radiation; Broadcasting (networking); Wireless ad hoc network; Wireless; Wireless network; Latency (audio); Multimedia Broadcast Multicast Service; Atomic broadcast; Node (physics); Algorithm; Distributed computing; Telecommunications; Multicast","score_opus":0.03750323977494538,"score_gpt":0.2517758194162315,"score_spread":0.21427257964128613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051974480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029629156,0.0026850281,0.96586454,0.00023154792,0.0009390265,0.00035854228,0.0000011787926,0.0000897035,0.00020129362],"genre_scores_gemma":[0.69912744,0.00006556872,0.2995648,0.0002394453,0.0009573347,0.0000037235804,0.0000011311381,0.00003519684,0.0000053399085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687237,0.0004559225,0.0011336325,0.00032651084,0.0004667582,0.0007448069],"domain_scores_gemma":[0.99502885,0.0026730613,0.0009706972,0.0005322959,0.0005841108,0.0002109603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041993293,0.00032714749,0.00053440937,0.00018053588,0.00057980826,0.00013178706,0.001859704,0.00014301372,0.000009656246],"category_scores_gemma":[0.00024195529,0.00023810928,0.00034406077,0.0007230357,0.0001246378,0.00093961036,0.00031754092,0.00095493696,0.0000033115994],"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.00010367117,0.00008925369,0.001437545,0.000042823292,0.00017050636,0.00006079204,0.00796574,0.049244177,0.0002522485,0.0017011536,0.00015036055,0.93878174],"study_design_scores_gemma":[0.0010658895,0.0003034563,0.0010944935,0.00064722105,0.00007988575,0.00020694708,0.00036147633,0.99432355,0.0002879951,0.0012786111,0.000067857305,0.00028261132],"about_ca_topic_score_codex":0.000012066876,"about_ca_topic_score_gemma":0.0000017405644,"teacher_disagreement_score":0.9450794,"about_ca_system_score_codex":0.00008704177,"about_ca_system_score_gemma":0.00012897329,"threshold_uncertainty_score":0.9709814},"labels":[],"label_agreement":null},{"id":"W2052756861","doi":"10.1007/s11227-014-1141-x","title":"Adaptive global power optimization for Web servers","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Server; Distributed computing; Power (physics); Key (lock); Power optimization; Web server; Node (physics); Central processing unit; Operating system; Power consumption; Embedded system; The Internet","score_opus":0.014409524055755667,"score_gpt":0.22231226062745257,"score_spread":0.20790273657169692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052756861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26164073,0.00006980617,0.7368081,0.0006870927,0.0004606625,0.00004502451,7.383312e-7,0.00002060131,0.00026723542],"genre_scores_gemma":[0.96251786,0.0000044780404,0.03689271,0.00039643148,0.00017652633,1.8229481e-7,1.9817273e-7,0.0000042250354,0.0000073942924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915755,0.00013839324,0.00025352268,0.000083340106,0.00020382967,0.00016336769],"domain_scores_gemma":[0.99913895,0.0002580322,0.0001514142,0.00016379217,0.00023648006,0.000051318235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013798752,0.0000806577,0.00013371243,0.000037676706,0.00018047831,0.00008182054,0.00066756445,0.000027928032,0.0000024947165],"category_scores_gemma":[0.00008646961,0.00005411097,0.000113460475,0.00014678182,0.000020865915,0.00036461413,0.00010698701,0.00011452504,0.0000023699179],"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.00012935374,0.0000746371,0.0012149417,0.0000127135945,0.00012225012,0.000005477276,0.0019124848,0.9245968,0.0010815203,0.035659637,0.0021123395,0.03307788],"study_design_scores_gemma":[0.00045147724,0.00023354308,0.00035203045,0.000048069287,0.000017423452,0.00012601214,0.00023323456,0.99725324,0.00003320032,0.0010377921,0.00014077572,0.000073213356],"about_ca_topic_score_codex":0.000015013892,"about_ca_topic_score_gemma":0.0000017579587,"teacher_disagreement_score":0.70087713,"about_ca_system_score_codex":0.000055710687,"about_ca_system_score_gemma":0.00005225133,"threshold_uncertainty_score":0.22065814},"labels":[],"label_agreement":null},{"id":"W2057440614","doi":"10.1007/s11227-014-1243-5","title":"Efficient routing based on past information to predict the future location for message passing in infrastructure-less opportunistic networks","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Routing protocol; Geographic routing; Latency (audio); Wireless Routing Protocol; Dynamic Source Routing; Probabilistic logic; Distributed computing; Routing (electronic design automation); Link-state routing protocol; Zone Routing Protocol; Telecommunications; Artificial intelligence","score_opus":0.009991258978234632,"score_gpt":0.2177091045419444,"score_spread":0.20771784556370976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057440614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048994046,0.00003650582,0.94716984,0.0023459077,0.0009354692,0.00030533999,0.0000011350419,0.000025574203,0.00018619775],"genre_scores_gemma":[0.9885285,0.0000030919825,0.008135655,0.0020710393,0.0012420934,0.000002908126,0.0000047182566,0.000010614262,0.0000013668232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979025,0.00030757912,0.00081522425,0.00013313616,0.00046402137,0.0003775251],"domain_scores_gemma":[0.9975475,0.0011854391,0.00046673705,0.00037566788,0.00029801438,0.00012660482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046578576,0.00018620699,0.00025649086,0.00017072597,0.00047037395,0.00027512477,0.00092894863,0.00008709538,0.0000012766857],"category_scores_gemma":[0.00008023473,0.00010758488,0.00007956008,0.00052594696,0.000042569864,0.0002411041,0.00013082566,0.0004945539,0.0000010430545],"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.000037597172,0.000013289641,0.00048096155,0.000010925784,0.0000049612922,0.000001049774,0.00094506925,0.75187767,0.000002482682,0.0020958043,0.00036719738,0.24416298],"study_design_scores_gemma":[0.0005189533,0.00017156864,0.006414172,0.00036521498,0.000020582162,0.000043872275,0.0007243664,0.991045,0.0000026645012,0.00014735457,0.00042211515,0.0001241574],"about_ca_topic_score_codex":0.0000059260456,"about_ca_topic_score_gemma":0.0000023718048,"teacher_disagreement_score":0.9395345,"about_ca_system_score_codex":0.00010674574,"about_ca_system_score_gemma":0.00014412079,"threshold_uncertainty_score":0.4387184},"labels":[],"label_agreement":null},{"id":"W2058513528","doi":"10.1007/s11227-009-0321-6","title":"Context-aware cross-layer optimized video streaming in wireless multimedia sensor networks","year":2009,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"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; Computer network; Routing (electronic design automation); Geographic routing; Real-time computing; Path (computing); Node (physics); Transmission (telecommunications); Context (archaeology); Routing protocol; Distributed computing; Dynamic Source Routing; Telecommunications","score_opus":0.015286554774269864,"score_gpt":0.2585850917082789,"score_spread":0.24329853693400905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058513528","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58441013,0.00041915142,0.41382736,0.0005311559,0.0005809071,0.000097271746,2.973076e-7,0.00005619438,0.000077544704],"genre_scores_gemma":[0.9670561,0.00009736997,0.031521786,0.00065981963,0.00061499124,4.417663e-7,0.0000010276156,0.000023676477,0.00002477052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996581,0.00053073687,0.0011888493,0.00031796674,0.0006042097,0.00077723875],"domain_scores_gemma":[0.9969488,0.001436483,0.0005247738,0.0005582531,0.00034320334,0.00018848163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024574604,0.00033379943,0.000617512,0.00026296562,0.00030623603,0.0002959185,0.0018238286,0.00017857902,0.0000075433445],"category_scores_gemma":[0.00011060189,0.00024105357,0.00020970935,0.0007595717,0.00012209138,0.0007070163,0.0002464276,0.0011132192,0.0000050784606],"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.00006487898,0.0000946958,0.0019866137,0.000003464538,0.000023834757,0.00015378132,0.0016072557,0.92795014,0.0009169515,0.0001960557,0.00007224945,0.06693008],"study_design_scores_gemma":[0.0017592785,0.0001264248,0.008069121,0.00035023445,0.0000157874,0.00040025887,0.0003828278,0.98764074,0.0009245299,0.00003418608,0.000028682556,0.00026795812],"about_ca_topic_score_codex":0.00006565321,"about_ca_topic_score_gemma":0.000016641518,"teacher_disagreement_score":0.38264602,"about_ca_system_score_codex":0.0001516144,"about_ca_system_score_gemma":0.00007977524,"threshold_uncertainty_score":0.9829879},"labels":[],"label_agreement":null},{"id":"W2059613731","doi":"10.1007/s11227-012-0793-7","title":"Improving performance of multi-core NUCA coherent systems using NoC-assisted mechanisms","year":2012,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; Cache coherence; Cache; Network packet; Computer network; Multicast; Power consumption; Architecture; Routing (electronic design automation); Wormhole; Scalability; Embedded system; Distributed computing; Power (physics); CPU cache; Cache algorithms; Operating system","score_opus":0.06753242563293141,"score_gpt":0.26676867722085074,"score_spread":0.19923625158791933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059613731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5327077,0.0005259553,0.46430725,0.0000111735535,0.0023267004,0.000082591796,2.741853e-7,0.0000142405615,0.000024122557],"genre_scores_gemma":[0.9777339,0.000008783806,0.021587597,0.0000301358,0.0006064283,5.038072e-7,1.4097168e-7,0.00001463746,0.000017864784],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979145,0.0002487415,0.0009240557,0.000104511135,0.0004133018,0.0003948835],"domain_scores_gemma":[0.99821794,0.00019095473,0.0008039926,0.0003120967,0.00036623533,0.00010879927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003338461,0.00016341441,0.00037519445,0.00013728945,0.00027978476,0.00008797756,0.00075767847,0.00007195809,0.000004137751],"category_scores_gemma":[0.00003486289,0.000104639206,0.00014009423,0.00028417425,0.000032820284,0.00076551095,0.00021259529,0.00032622326,0.0000027935157],"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.00013975213,0.00071996055,0.02023514,0.0009430037,0.0005406428,0.000022322589,0.029895866,0.26248765,0.6119973,0.014108576,0.0002710008,0.058638807],"study_design_scores_gemma":[0.0003673854,0.00015202865,0.0012250994,0.0005052126,0.000031983287,0.0015125362,0.001239418,0.99179447,0.0030005206,0.000007566879,0.00003356592,0.00013020009],"about_ca_topic_score_codex":0.00017366829,"about_ca_topic_score_gemma":0.0000020662146,"teacher_disagreement_score":0.7293069,"about_ca_system_score_codex":0.00012383434,"about_ca_system_score_gemma":0.00006301632,"threshold_uncertainty_score":0.42670628},"labels":[],"label_agreement":null},{"id":"W2061899429","doi":"10.1007/s11227-010-0492-1","title":"Rule-based validation of SLA choreographies","year":2010,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Workflow; Interoperation; Service-level agreement; Process management; Service (business); Workflow management system; Business model; Quality of service; Knowledge management; Database; World Wide Web; Business; Interoperability; Computer network; Marketing","score_opus":0.012420896332121746,"score_gpt":0.21485118848203155,"score_spread":0.20243029214990982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061899429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98772365,0.000098747034,0.010393846,0.0010643172,0.00031569053,0.000028997058,2.844458e-7,0.000019135281,0.00035532616],"genre_scores_gemma":[0.9974262,0.000008168036,0.0011582142,0.0002220502,0.0011647099,1.9686661e-7,0.0000025466331,0.000013551253,0.000004358654],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989944,0.000014110211,0.00047342322,0.00006847564,0.00031194946,0.0001376521],"domain_scores_gemma":[0.9985313,0.0000994906,0.0005178557,0.00014784707,0.0006952413,0.000008268415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015529861,0.000105271865,0.0002227778,0.00042576584,0.00018301378,0.00010008945,0.00036596166,0.000044731576,0.000043339598],"category_scores_gemma":[0.00016515954,0.000066736895,0.0001533742,0.0007090142,0.000087695335,0.00057012093,0.000051368133,0.00029538135,0.0000055566725],"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.00048377944,0.00069102185,0.3465781,0.0013299725,0.0005316391,0.000016837972,0.0011891964,0.2563551,0.27983066,0.00499257,0.0013175833,0.10668354],"study_design_scores_gemma":[0.00432518,0.00009856605,0.053299144,0.0014799079,0.0028599398,0.00010511076,0.0039142105,0.8486238,0.054765344,0.024050973,0.0052104066,0.0012674275],"about_ca_topic_score_codex":0.00019497186,"about_ca_topic_score_gemma":0.000009511807,"teacher_disagreement_score":0.5922687,"about_ca_system_score_codex":0.0000032545504,"about_ca_system_score_gemma":0.000025488996,"threshold_uncertainty_score":0.27214518},"labels":[],"label_agreement":null},{"id":"W2062919300","doi":"10.1007/s11227-010-0473-4","title":"On-demand chaotic neural network for broadcast scheduling problem","year":2010,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Time division multiple access; Chaotic; Scheduling (production processes); Network packet; Noise (video); Artificial neural network; Real-time computing; Computer network; Mathematical optimization; Artificial intelligence","score_opus":0.014821757348859349,"score_gpt":0.24297341611377973,"score_spread":0.22815165876492038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062919300","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.674035,0.0001692962,0.32479098,0.00008404577,0.000557456,0.00014215482,9.830552e-7,0.00012187638,0.00009818544],"genre_scores_gemma":[0.79828477,0.000013238041,0.20056677,0.00004731154,0.0010410346,0.0000014625572,4.297104e-7,0.00004042841,0.000004535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990848,0.000026873377,0.00036684104,0.00007119969,0.000135624,0.00031469547],"domain_scores_gemma":[0.9991485,0.0004505085,0.00009207008,0.00015459425,0.00009289785,0.00006145539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086967694,0.00015395111,0.00021450839,0.000060535604,0.00016058882,0.000032706957,0.00032812142,0.000055009998,0.000005943089],"category_scores_gemma":[0.00007773582,0.000108862245,0.0000918137,0.00010178956,0.000041296676,0.00015938647,0.00004625697,0.00071888976,0.0000019397191],"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.000025249492,0.000008667055,0.000096993674,0.00003564697,0.000029931602,0.000003742293,0.0002995026,0.9424255,0.045797646,0.00097458554,0.0002841547,0.010018409],"study_design_scores_gemma":[0.000686428,0.00041524888,0.0005909587,0.0005497139,0.00006028576,0.0006092023,0.00012487962,0.96233594,0.013794562,0.018973636,0.0014805251,0.00037859805],"about_ca_topic_score_codex":0.0000010709251,"about_ca_topic_score_gemma":0.0000014098549,"teacher_disagreement_score":0.124249764,"about_ca_system_score_codex":0.000028171899,"about_ca_system_score_gemma":0.000010055887,"threshold_uncertainty_score":0.44392738},"labels":[],"label_agreement":null},{"id":"W2068300465","doi":"10.1007/s11227-008-0184-2","title":"Scalable and efficient key management for heterogeneous sensor networks","year":2008,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University; Acadia University","funders":"Higher Education Commision, Pakistan; Higher Education Commission, Pakistan; Acadia University","keywords":"Computer science; Scalability; Wireless sensor network; Key management; Key (lock); Distributed computing; Hash function; Computer network; Overhead (engineering); Key generation; Hash chain; Encryption; Computer security","score_opus":0.01707679819292564,"score_gpt":0.22265352274462183,"score_spread":0.20557672455169618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068300465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5221676,0.0011023539,0.47578064,0.00030589337,0.00041123544,0.00014254509,2.4406063e-7,0.00002593016,0.00006352606],"genre_scores_gemma":[0.9380743,0.000313853,0.060872097,0.00030572622,0.00039926654,8.381701e-7,2.2170472e-7,0.000014682407,0.000019052583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985085,0.00013166845,0.0004657821,0.00017134435,0.00031513892,0.0004075481],"domain_scores_gemma":[0.9986712,0.0005460198,0.00019436772,0.0003195259,0.0001584711,0.000110436544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010730188,0.0001573155,0.00025651368,0.000095757125,0.00049503695,0.00008348759,0.0007756442,0.000055198994,0.0000016562811],"category_scores_gemma":[0.000020551051,0.00011115974,0.00010868995,0.00022449775,0.000100404366,0.00011990391,0.00031584036,0.0002554103,0.0000020537427],"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.000029745897,0.000052989766,0.00025684887,0.000020984702,0.000077462704,0.00011107295,0.0023952192,0.9841201,0.00008439453,0.00082260836,0.0005250557,0.011503528],"study_design_scores_gemma":[0.0005680451,0.00012532494,0.00047980782,0.00008526416,0.00003036263,0.0039443155,0.00015842641,0.9935218,0.000271744,0.0001309571,0.00054309866,0.00014083911],"about_ca_topic_score_codex":0.0000057392685,"about_ca_topic_score_gemma":6.4824195e-7,"teacher_disagreement_score":0.41590664,"about_ca_system_score_codex":0.000044989058,"about_ca_system_score_gemma":0.000015360974,"threshold_uncertainty_score":0.45329624},"labels":[],"label_agreement":null},{"id":"W2071100473","doi":"10.1007/s11227-011-0728-8","title":"A fuzzy Grid-QoS framework for obtaining higher grid resources availability","year":2011,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Quality of service; Grid; Vagueness; Mobile QoS; Fuzzy logic; Grid computing; Scalability; Distributed computing; Service-level agreement; Quality (philosophy); Service (business); Database; Service provider; Computer network; Artificial intelligence","score_opus":0.06475664988681405,"score_gpt":0.26629444987144524,"score_spread":0.20153779998463117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071100473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33712554,0.0006652664,0.6544031,0.0005169457,0.005469638,0.00022021115,0.0000064325436,0.00011706362,0.0014757803],"genre_scores_gemma":[0.8862177,0.000006344003,0.10931283,0.00025553853,0.004152114,0.0000015817722,9.861691e-7,0.000018120414,0.000034763714],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733424,0.00044208643,0.00096149795,0.00026712645,0.00045514276,0.00053987507],"domain_scores_gemma":[0.9966578,0.0015418185,0.00059789885,0.00062785204,0.00041370775,0.0001609318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047777845,0.00024191872,0.00044625803,0.00011383989,0.00049220875,0.00018450062,0.002350662,0.00012222622,0.000013735121],"category_scores_gemma":[0.00032806833,0.00016061495,0.00024456508,0.00047515114,0.0000984953,0.00040724548,0.00036771476,0.00058989774,0.000019213341],"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.0014320695,0.0019534412,0.087562315,0.0011852293,0.0020799453,0.00033604476,0.3854805,0.031591326,0.0022843871,0.28969657,0.08510856,0.11128963],"study_design_scores_gemma":[0.008751205,0.007020987,0.1559304,0.007406046,0.0008314986,0.005403633,0.013606028,0.13672051,0.0031699904,0.42654106,0.22958915,0.00502948],"about_ca_topic_score_codex":0.00005563592,"about_ca_topic_score_gemma":0.000001246093,"teacher_disagreement_score":0.5490922,"about_ca_system_score_codex":0.00006173548,"about_ca_system_score_gemma":0.000099350924,"threshold_uncertainty_score":0.65496874},"labels":[],"label_agreement":null},{"id":"W2072837011","doi":"10.1007/s11227-014-1331-6","title":"Power-efficient prefetching on GPGPUs","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Instruction prefetch; Computer science; Graphics processing unit; Graphics; Efficient energy use; Energy consumption; General-purpose computing on graphics processing units; Parallel computing; Latency (audio); CUDA; Operating system; Telecommunications","score_opus":0.012106152293516767,"score_gpt":0.2412229570264522,"score_spread":0.22911680473293541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072837011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24680537,0.00003607332,0.7467671,0.0009534034,0.0003985759,0.000047815938,8.106546e-8,0.00010523122,0.0048863096],"genre_scores_gemma":[0.95386636,0.0000053310773,0.044935636,0.0009774955,0.00018705541,1.7226603e-7,7.641939e-8,0.000009695682,0.000018164767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983804,0.00036826116,0.00042421275,0.00013983886,0.0004453614,0.00024192304],"domain_scores_gemma":[0.99834824,0.00075390947,0.00026238075,0.00041568378,0.00014236777,0.00007740543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002812071,0.00013815584,0.00019566005,0.00017781144,0.00030999372,0.00012192798,0.0013092408,0.000039118422,0.0000035167393],"category_scores_gemma":[0.00021672236,0.000085158754,0.000100049125,0.00025154755,0.000030742354,0.00010769341,0.00018157292,0.00042037826,0.000019740119],"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.000018945335,0.000096590295,0.000072369614,0.0000040359514,0.000016309894,0.000004716988,0.0023812703,0.94643736,0.00027318957,0.024388006,0.0011293553,0.02517784],"study_design_scores_gemma":[0.00035178315,0.0007856864,0.0009342473,0.00023244788,0.0000064196092,0.00017303499,0.00006237042,0.99156827,0.0024237027,0.0018218774,0.0014674194,0.00017276604],"about_ca_topic_score_codex":0.0000029823689,"about_ca_topic_score_gemma":6.687878e-8,"teacher_disagreement_score":0.707061,"about_ca_system_score_codex":0.000045598827,"about_ca_system_score_gemma":0.00003169321,"threshold_uncertainty_score":0.34726733},"labels":[],"label_agreement":null},{"id":"W2074688378","doi":"10.1007/s11227-009-0294-5","title":"Analyzing and enhancing the parallel sort operation on multithreaded architectures","year":2009,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Multithreading; Parallel computing; Quicksort; sort; Simultaneous multithreading; Parallelism (grammar); Sorting algorithm; Computer architecture; Thread (computing); Operating system","score_opus":0.015821519187792784,"score_gpt":0.26317924726198616,"score_spread":0.24735772807419337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074688378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29809636,0.00033080272,0.6983079,0.0029653693,0.00006924264,0.0000677748,6.621535e-8,0.000051213086,0.00011132438],"genre_scores_gemma":[0.90348923,0.000056575303,0.09541252,0.0008475059,0.00018084323,2.0464643e-7,1.7518846e-7,0.0000045975053,0.000008369735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987582,0.00026174716,0.00042035177,0.00012530874,0.00024124916,0.00019314435],"domain_scores_gemma":[0.99896276,0.00043709294,0.00019744401,0.00025384314,0.00009982006,0.000049065893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018886634,0.00012829066,0.00017670407,0.000119360084,0.0005178781,0.00020164363,0.0007361689,0.00003468032,0.0000010758292],"category_scores_gemma":[0.000106893116,0.00006646084,0.00006250413,0.00019824489,0.000043411652,0.0001623955,0.00009336206,0.0003830954,0.0000012222268],"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.000036329235,0.000056392746,0.00045334667,0.000005956921,0.0000395265,0.000010459891,0.009849861,0.8472196,0.0063090795,0.0045157834,0.00030901947,0.13119465],"study_design_scores_gemma":[0.0005064513,0.0005059135,0.012143731,0.0002160378,0.000027520942,0.0005245126,0.0002615167,0.97144246,0.009015399,0.005014994,0.00011074786,0.0002307153],"about_ca_topic_score_codex":0.000011789067,"about_ca_topic_score_gemma":0.000002726436,"teacher_disagreement_score":0.6053929,"about_ca_system_score_codex":0.000023448449,"about_ca_system_score_gemma":0.000037097758,"threshold_uncertainty_score":0.3983152},"labels":[],"label_agreement":null},{"id":"W2079037666","doi":"10.1007/s11227-013-0945-4","title":"Editorial of special section on multimedia applications and ubiquitous computing","year":2013,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Multimedia Communication and Technology","field":"Social Sciences","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Special section; Section (typography); Multimedia; Ubiquitous computing; World Wide Web; Human–computer interaction; Operating system","score_opus":0.017995472763727188,"score_gpt":0.2946090274617738,"score_spread":0.2766135546980466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079037666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9666218,0.00011926193,0.0026131673,0.0025259114,0.022836048,0.00038012915,7.594867e-7,0.000039075698,0.004863801],"genre_scores_gemma":[0.901086,0.00010094497,0.0026542041,0.000037742007,0.096104644,7.623314e-7,3.590251e-7,0.000005018986,0.000010351807],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894136,0.0002513011,0.00034116223,0.000053778997,0.000278256,0.00013414052],"domain_scores_gemma":[0.99825525,0.000994168,0.0002673403,0.00013419242,0.0002933396,0.000055678644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013466603,0.00005860357,0.0001428637,0.00010034643,0.00041662366,0.000026042082,0.0003638575,0.00009597965,0.00005143918],"category_scores_gemma":[0.00029242702,0.000043336455,0.000038833005,0.00017203634,0.00030413384,0.00010738397,0.00007629076,0.00036821596,0.00000902553],"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.00006904096,0.0003520847,0.004589534,0.00002846799,0.000105461695,6.1569983e-7,0.11479335,0.0004614463,0.015711952,0.010201432,0.06874969,0.7849369],"study_design_scores_gemma":[0.0055324766,0.0011893484,0.031286344,0.0005409012,0.00025014978,0.00012791663,0.16703424,0.026421877,0.004770381,0.013339525,0.7485638,0.00094298815],"about_ca_topic_score_codex":0.0006131155,"about_ca_topic_score_gemma":0.00006996782,"teacher_disagreement_score":0.78399396,"about_ca_system_score_codex":0.000041534266,"about_ca_system_score_gemma":0.00006132925,"threshold_uncertainty_score":0.32043746},"labels":[],"label_agreement":null},{"id":"W2081694913","doi":"10.1007/s11227-010-0545-5","title":"ADVS: a reputation-based model on filtering SPIT over P2P-VoIP networks","year":2011,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Voice over IP; Computer science; Computer network; Reputation; The Internet; Computer security; Telecommunications; World Wide Web","score_opus":0.031160309036980298,"score_gpt":0.236091909905304,"score_spread":0.20493160086832368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081694913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2614186,0.00007189247,0.73764604,0.00009492204,0.00021038225,0.000037481528,2.1781273e-7,0.00003169033,0.00048875867],"genre_scores_gemma":[0.96933895,0.0000040652203,0.029584765,0.00070908805,0.00033438517,3.179528e-7,5.018029e-7,0.000014423423,0.000013494495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830735,0.00014838304,0.00065299985,0.00017741085,0.00039966748,0.00031420696],"domain_scores_gemma":[0.9988347,0.0002814303,0.00036492985,0.00024322816,0.00018923439,0.000086435684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001749061,0.000172748,0.00026415315,0.00015480329,0.00023536652,0.00011343874,0.0010959978,0.0000573268,0.000021038977],"category_scores_gemma":[0.00006259095,0.000114301176,0.00022725092,0.00021533934,0.000039350314,0.00035823637,0.00013178546,0.00047529122,0.0000053327576],"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.000023034827,0.000049399536,0.00011007866,0.000004624528,0.00004743573,0.000024249535,0.0050553223,0.98227495,0.000047354522,0.0069843275,0.00016792437,0.005211281],"study_design_scores_gemma":[0.00025419096,0.00014990669,0.00043507348,0.00018450731,0.00003418537,0.00005413235,0.0001553332,0.9983217,0.00014805247,0.00011279652,0.000017860268,0.00013223386],"about_ca_topic_score_codex":0.000021165257,"about_ca_topic_score_gemma":0.000011109884,"teacher_disagreement_score":0.7080613,"about_ca_system_score_codex":0.00005735856,"about_ca_system_score_gemma":0.00006416208,"threshold_uncertainty_score":0.46610665},"labels":[],"label_agreement":null},{"id":"W2083266561","doi":"10.1007/s11227-010-0519-7","title":"Load-balanced AP association in multi-hop wireless mesh networks","year":2010,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Computer network; Wireless mesh network; Wireless; Wireless network; Latency (audio); Mesh networking; Service set; Internet access; Bandwidth (computing); Software deployment; The Internet; Distributed computing; Wi-Fi; Telecommunications; Operating system","score_opus":0.01283095564413703,"score_gpt":0.2444973781197483,"score_spread":0.23166642247561128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083266561","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6191683,0.00009839923,0.3784155,0.00057947496,0.0015056722,0.00009617402,1.3065043e-7,0.00003146536,0.00010491544],"genre_scores_gemma":[0.9850696,0.000054780452,0.013793279,0.00031427946,0.00071760395,9.3851867e-7,2.6311997e-7,0.000014583256,0.00003468553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977846,0.00030823224,0.0006932081,0.00016800607,0.0005681116,0.00047781243],"domain_scores_gemma":[0.99777824,0.00087552064,0.0005162904,0.00039285643,0.0003383572,0.000098721204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052338527,0.00016188229,0.00032502742,0.00008757731,0.00016079946,0.00015119533,0.0015397004,0.00015944375,0.000008954321],"category_scores_gemma":[0.00020170705,0.000118237906,0.00010748709,0.00053432677,0.000033962584,0.0005801155,0.0002898633,0.0015578645,0.000008557039],"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.000109475455,0.0006771063,0.21436277,0.000039551174,0.00026000256,0.00021969576,0.019619396,0.33626807,0.044843644,0.008762502,0.005427756,0.36941004],"study_design_scores_gemma":[0.00083236914,0.00004322998,0.026411174,0.0000858687,0.000011082603,0.0001233296,0.000090369926,0.97158486,0.00034559157,0.00015852366,0.00016380208,0.00014981152],"about_ca_topic_score_codex":0.00006482686,"about_ca_topic_score_gemma":0.00019417221,"teacher_disagreement_score":0.6353168,"about_ca_system_score_codex":0.0002431752,"about_ca_system_score_gemma":0.0001331925,"threshold_uncertainty_score":0.67682326},"labels":[],"label_agreement":null},{"id":"W2083437586","doi":"10.1007/s11227-009-0342-1","title":"Cost-aware caching schemes in heterogeneous storage systems","year":2009,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Thrashing; Cache; Partition (number theory); Workload; Disk buffer; Scheme (mathematics); Choking; Parallel computing; Byte; Distributed computing; Cache algorithms; Computer network; CPU cache; Operating system","score_opus":0.03329468887582841,"score_gpt":0.2822184076849176,"score_spread":0.2489237188090892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083437586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35819662,0.001660087,0.6391512,0.00051059463,0.00026986306,0.00009846787,8.0691694e-7,0.00009398066,0.000018366913],"genre_scores_gemma":[0.9798439,0.00005533954,0.019823948,0.00015504085,0.000109237546,4.3328808e-7,3.6889085e-7,0.000007967226,0.0000037229884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839914,0.00017354211,0.0005646798,0.00015875467,0.00034888936,0.00035497878],"domain_scores_gemma":[0.99876577,0.00026541462,0.00028451518,0.0005279946,0.000101740006,0.00005458927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013659893,0.00016147253,0.00030100538,0.0002483522,0.00017157446,0.00012801283,0.00201799,0.000065977576,8.2796e-7],"category_scores_gemma":[0.00016272548,0.00011125769,0.00006277468,0.00042612126,0.0000490096,0.00094538945,0.00031953945,0.00063201564,0.0000044499047],"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.000016080621,0.00007110569,0.00049263495,0.000017296881,0.000022810773,0.0006055412,0.0019683058,0.8972977,0.004042712,0.0026757,0.00015152589,0.09263858],"study_design_scores_gemma":[0.0013305516,0.00064611685,0.0018553053,0.0008876526,0.000026607197,0.0081650065,0.0029701437,0.9713215,0.006225673,0.00377873,0.0021149064,0.0006777601],"about_ca_topic_score_codex":0.000020799067,"about_ca_topic_score_gemma":0.0000029489593,"teacher_disagreement_score":0.62164736,"about_ca_system_score_codex":0.00017478163,"about_ca_system_score_gemma":0.00005178264,"threshold_uncertainty_score":0.45369568},"labels":[],"label_agreement":null},{"id":"W2092071486","doi":"10.1007/s11227-005-0157-7","title":"A Hybrid Analysis of an Optimization Approach for Cluster Applications","year":2005,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Overhead (engineering); Distributed computing; Key (lock); Parallel programming model; Cluster (spacecraft); Parallel computing; Computer cluster; Supercomputer; Computation; Programming paradigm; Parallel algorithm; Computer network; Algorithm; Operating system","score_opus":0.017001849029642826,"score_gpt":0.2554606433094504,"score_spread":0.23845879427980757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092071486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040845778,0.00008413205,0.95845884,0.00021210068,0.000072896095,0.00015610554,0.0000012185327,0.000011780092,0.00015713353],"genre_scores_gemma":[0.6763539,0.0000034949246,0.3232079,0.0000977072,0.00031895278,0.0000022268168,0.0000024115154,0.0000037501832,0.000009650728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989519,0.00013767109,0.0005312376,0.00009322443,0.00016814802,0.00011777989],"domain_scores_gemma":[0.99885446,0.00019641312,0.00031970692,0.00025304643,0.00033528663,0.000041080122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018103757,0.0000671592,0.00022481191,0.00022774101,0.00014394023,0.000059335714,0.00061160495,0.000023156686,0.0000030716153],"category_scores_gemma":[0.000014365255,0.000044655666,0.00016865142,0.00045073184,0.000018766643,0.00041541635,0.000050536397,0.00009068769,2.1914575e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075954526,0.000048324087,0.00003633357,0.0000054472207,0.0001454905,4.6949367e-8,0.0008748737,0.9866201,0.00007035093,0.0009091156,0.00006942178,0.011212899],"study_design_scores_gemma":[0.00018461615,0.00006216899,0.00003983969,0.00000835653,0.00015583925,0.00006958466,0.00019116337,0.99879855,0.00016232481,0.00003919001,0.00023854568,0.00004981086],"about_ca_topic_score_codex":0.000008324549,"about_ca_topic_score_gemma":0.0000023101045,"teacher_disagreement_score":0.6355081,"about_ca_system_score_codex":0.00003095243,"about_ca_system_score_gemma":0.000022840202,"threshold_uncertainty_score":0.18210052},"labels":[],"label_agreement":null},{"id":"W2092515100","doi":"10.1023/b:supe.0000022101.41799.cc","title":"A Group-Based Load Balance Scheme for Software Distributed Shared Memory Systems","year":2004,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Scheme (mathematics); Distributed computing; Balance (ability); Shared memory; Software; Group (periodic table); Distributed memory; Parallel computing; Operating system","score_opus":0.019612961401985887,"score_gpt":0.24928739543048312,"score_spread":0.22967443402849724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092515100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027945828,0.00085459877,0.96950155,0.00074498606,0.00042413015,0.00024133082,0.000008464509,0.0002629325,0.000016181099],"genre_scores_gemma":[0.5521161,0.0000078635485,0.4474545,0.00020135137,0.00019541766,0.0000026766706,0.000004801787,0.000012391833,0.000004906673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982508,0.00013671449,0.0006325715,0.00018500822,0.00045115128,0.0003437846],"domain_scores_gemma":[0.9979809,0.0004853206,0.0004177534,0.00038770036,0.00062694494,0.00010141199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021380712,0.00018246938,0.00032059828,0.00010125844,0.0003584058,0.00022477962,0.0014705034,0.000072382005,0.000001060177],"category_scores_gemma":[0.000341857,0.00013086727,0.00016091943,0.00039166986,0.000049124515,0.00040310263,0.00015321605,0.0002756928,0.0000026823554],"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.0000619616,0.00014024944,0.00043141085,0.00011158895,0.00006253711,0.00002001826,0.0011135361,0.9895706,0.0012715232,0.0018699294,0.0023397487,0.0030068906],"study_design_scores_gemma":[0.0022293616,0.0003489176,0.0003637007,0.0007059075,0.000026065849,0.00030104513,0.000117007025,0.9915572,0.0016096896,0.0016870096,0.0007437187,0.00031040094],"about_ca_topic_score_codex":0.00003706498,"about_ca_topic_score_gemma":0.0000010156889,"teacher_disagreement_score":0.5241702,"about_ca_system_score_codex":0.00023195903,"about_ca_system_score_gemma":0.00028555162,"threshold_uncertainty_score":0.5336612},"labels":[],"label_agreement":null},{"id":"W2110790338","doi":"10.1007/s11227-015-1525-6","title":"NSPRING: the SPRING extension for subsequence matching of time series supporting normalization","year":2015,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Universidade de Macau","keywords":"Computer science; Normalization (sociology); Subsequence; Data stream mining; Data mining; Time series; Database normalization; Artificial intelligence; Data science; Machine learning; Pattern recognition (psychology)","score_opus":0.030620593923416022,"score_gpt":0.25316287441920193,"score_spread":0.22254228049578592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110790338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4944873,0.00017445243,0.50449276,0.0005523128,0.00014208908,0.00006612994,3.6801566e-7,0.000014895536,0.000069710295],"genre_scores_gemma":[0.9464684,0.000013577209,0.05321871,0.000055334847,0.00020851256,3.359849e-7,3.7376134e-7,0.000011265735,0.000023445227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827915,0.00013885654,0.0008022614,0.00011628961,0.00039325233,0.00027019568],"domain_scores_gemma":[0.997859,0.00034728277,0.00081709155,0.00029961142,0.00060905726,0.00006798313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005483535,0.00012100849,0.000270767,0.00008517161,0.0003566981,0.00012606406,0.0009548697,0.0000311173,0.000002497057],"category_scores_gemma":[0.0003428825,0.00006859107,0.0001470887,0.0003476785,0.0000668895,0.0009941342,0.00031859247,0.00017895947,0.0000019498195],"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.00018270819,0.0000876162,0.008379957,0.00015661409,0.00025763898,0.000029812372,0.048657957,0.7193494,0.12872727,0.028020244,0.00026921084,0.06588159],"study_design_scores_gemma":[0.00051455357,0.0003568716,0.002653491,0.0004086081,0.00012686313,0.0007971227,0.005539356,0.96524614,0.017812837,0.0057205088,0.0005629467,0.00026073033],"about_ca_topic_score_codex":0.00009695561,"about_ca_topic_score_gemma":0.0000069005455,"teacher_disagreement_score":0.45198116,"about_ca_system_score_codex":0.000043796634,"about_ca_system_score_gemma":0.00009498287,"threshold_uncertainty_score":0.27970627},"labels":[],"label_agreement":null},{"id":"W2116204307","doi":"10.1023/a:1020157925260","title":"TCP Performance and Behaviors with Local Retransmissions","year":2002,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Goodput; Computer network; Timeout; TCP acceleration; Zeta-TCP; Transmission Control Protocol; TCP delayed acknowledgment; TCP Vegas; Throughput; TCP Westwood plus; Datagram; TCP global synchronization; Network packet; TCP Westwood; Wireless; Telecommunications","score_opus":0.01006158897202606,"score_gpt":0.18284181829171947,"score_spread":0.17278022931969342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116204307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6087373,0.000543759,0.38904238,0.0013414278,0.000087237204,0.000030806375,5.8230746e-8,0.000018990875,0.00019805106],"genre_scores_gemma":[0.99385726,0.00015179976,0.005648035,0.00017883086,0.00010572942,1.8306925e-7,2.5629218e-8,0.0000049003033,0.00005325749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992268,0.000071121314,0.00022476744,0.00007787847,0.00023021354,0.00016921671],"domain_scores_gemma":[0.9994471,0.00014298015,0.00008375852,0.00014409133,0.0000865422,0.000095517906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004914865,0.00008429006,0.00012801363,0.000046597463,0.00024101308,0.000051931373,0.0004225737,0.000026588901,0.00001589198],"category_scores_gemma":[0.0000048983516,0.00004596676,0.00002892229,0.00018000792,0.000089784626,0.00031306266,0.00004396329,0.00029579,0.0000036497675],"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.000014100225,0.00003251492,0.0024872131,0.0000052326945,0.00001736789,0.000023333467,0.0022225073,0.008386936,0.00009507457,0.00036815173,0.00051584846,0.98583174],"study_design_scores_gemma":[0.0006725939,0.00038797685,0.0057085427,0.00016931423,0.000040736577,0.0019340611,0.00026505432,0.9895344,0.00007788725,0.000024437459,0.0010633767,0.00012162611],"about_ca_topic_score_codex":0.0000024372841,"about_ca_topic_score_gemma":8.914085e-7,"teacher_disagreement_score":0.9857101,"about_ca_system_score_codex":0.000012612938,"about_ca_system_score_gemma":0.000018083805,"threshold_uncertainty_score":0.18744701},"labels":[],"label_agreement":null},{"id":"W2124706286","doi":"10.1007/s11227-014-1085-1","title":"Deriving length two path centered surface area for the arrangement graph: a generating function approach","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Path (computing); Graph; Scalability; Path length; Surface (topology); Focus (optics); Algorithm; Combinatorics; Theoretical computer science; Mathematics; Geometry; Physics","score_opus":0.03476657181284009,"score_gpt":0.23308848152644016,"score_spread":0.19832190971360006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124706286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24724782,0.0003363378,0.75022215,0.0003732275,0.0014985456,0.0001747353,2.6962553e-7,0.000024960997,0.00012197408],"genre_scores_gemma":[0.9743141,0.000014927443,0.024020901,0.0003452744,0.0012707401,0.0000022412937,5.055747e-7,0.000013228734,0.000018107667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982103,0.0004175183,0.00058217824,0.00016250981,0.00031776383,0.0003096961],"domain_scores_gemma":[0.99817693,0.0008123654,0.00037331684,0.00032884468,0.0002549387,0.000053604515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005177432,0.00015381764,0.00023567585,0.000053463136,0.00080797356,0.0002919125,0.00080704456,0.00003288959,0.0000022071376],"category_scores_gemma":[0.00006844453,0.00008171727,0.00019483439,0.00020564157,0.000027963204,0.00031960852,0.00013474113,0.00027781984,0.0000010226449],"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.00004910465,0.000076881595,0.00096213334,0.000043345688,0.00023779007,0.0000010450997,0.008116858,0.92493266,0.009807655,0.0058143586,0.0022219047,0.047736235],"study_design_scores_gemma":[0.00052031607,0.0001659945,0.00020106688,0.000104583894,0.000036628648,0.00016279322,0.0013541913,0.9960254,0.00014231403,0.00025800467,0.00092425395,0.00010449746],"about_ca_topic_score_codex":0.000036132707,"about_ca_topic_score_gemma":0.000010636056,"teacher_disagreement_score":0.7270663,"about_ca_system_score_codex":0.000046353183,"about_ca_system_score_gemma":0.000023431301,"threshold_uncertainty_score":0.62143606},"labels":[],"label_agreement":null},{"id":"W2125012489","doi":"10.1007/s11227-010-0514-z","title":"Special issue on “Theory and practice of high-performance computing, communications, and security”","year":2010,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Mainstream; Field (mathematics); Key (lock); Quality (philosophy); Data science; Management science; Computer security; Telecommunications","score_opus":0.012621445415591315,"score_gpt":0.26762155430832313,"score_spread":0.25500010889273184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125012489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97247833,0.00043361614,0.021077236,0.0015907198,0.0013762604,0.00010509291,0.0000018294867,0.000024865385,0.0029120545],"genre_scores_gemma":[0.9822796,0.00015217844,0.014944475,0.00022422531,0.00237924,1.00769974e-7,6.481758e-7,0.000007847201,0.000011712028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979697,0.0007868317,0.00059361075,0.00013490258,0.00031771016,0.00019725309],"domain_scores_gemma":[0.99479073,0.0036703243,0.0005608578,0.00060914346,0.00028553803,0.00008338882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006875175,0.00014270598,0.00029595406,0.0001068934,0.00033770115,0.00011492372,0.001342442,0.00006508312,0.0000037587045],"category_scores_gemma":[0.000445263,0.00010204262,0.000036475634,0.00022065389,0.00024646003,0.0004046745,0.00059880706,0.00071367156,0.000004116518],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005401617,0.0006682473,0.004919512,0.0003105236,0.00034684825,0.000033601427,0.05938153,0.003257787,0.004137619,0.25876418,0.0078112967,0.65982866],"study_design_scores_gemma":[0.0073697832,0.005177459,0.04198479,0.0032253612,0.00046412757,0.023155635,0.009454531,0.49234062,0.0047411514,0.020765124,0.3893031,0.0020183274],"about_ca_topic_score_codex":0.000032511372,"about_ca_topic_score_gemma":0.000002190749,"teacher_disagreement_score":0.6578104,"about_ca_system_score_codex":0.000011497824,"about_ca_system_score_gemma":0.000049952814,"threshold_uncertainty_score":0.41611773},"labels":[],"label_agreement":null},{"id":"W2128222559","doi":"10.1007/s11227-012-0854-y","title":"Improving performance of software transactional memory through contention locality","year":2013,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Transactional memory; Software transactional memory; Locality; Benchmark (surveying); Suite; Database transaction; Transactional leadership; Parallel computing; Distributed computing; Locality of reference; Database; Cache","score_opus":0.01477276391523287,"score_gpt":0.21357204766565477,"score_spread":0.19879928375042188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128222559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48328474,0.0002010834,0.51596206,0.00014273824,0.00028825385,0.00005744218,9.870905e-7,0.000011871872,0.000050820654],"genre_scores_gemma":[0.98386544,0.000012651572,0.015884586,0.0000810756,0.00012973708,6.632077e-7,4.6191334e-7,0.0000049748055,0.000020407648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854684,0.00012367769,0.0006513338,0.00009687192,0.00039093537,0.00019033122],"domain_scores_gemma":[0.99869114,0.00015849502,0.0003948678,0.00022017221,0.0004909016,0.00004439435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011150511,0.00010191728,0.00023623396,0.00003603353,0.0001689425,0.000060333237,0.00068709016,0.00004273638,0.000015773934],"category_scores_gemma":[0.0000370943,0.000066160705,0.00012064687,0.00019166572,0.00006818486,0.0013571624,0.000055243345,0.00025469085,0.0000072669072],"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.00010968667,0.00042858085,0.01121432,0.0007744178,0.0002940111,0.000014220701,0.013964199,0.061531734,0.07256723,0.0019599895,0.0013998309,0.83574176],"study_design_scores_gemma":[0.0020521535,0.0006347854,0.054430034,0.0009839124,0.00006688601,0.0013171341,0.0029992776,0.91684574,0.018865433,0.0010255504,0.00031658716,0.0004625323],"about_ca_topic_score_codex":0.0003352206,"about_ca_topic_score_gemma":0.0000016593347,"teacher_disagreement_score":0.85531396,"about_ca_system_score_codex":0.000040199775,"about_ca_system_score_gemma":0.00006897365,"threshold_uncertainty_score":0.26979554},"labels":[],"label_agreement":null},{"id":"W2128714872","doi":"10.1007/s11227-014-1263-1","title":"A comparative simulation study on the power–performance of multi-core architecture","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Multi-core processor; Pipeline (software); Thread (computing); Laptop; Parallel computing; Microarchitecture; Power consumption; Multiprocessing; Embedded system; Instruction-level parallelism; Chip; Power (physics); Computer architecture; Parallelism (grammar); Operating system","score_opus":0.05907143284523812,"score_gpt":0.31438640329547873,"score_spread":0.2553149704502406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128714872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5308968,0.000020117077,0.46861473,0.00015552797,0.00006988226,0.00011147189,1.0357011e-7,0.000025521893,0.000105870495],"genre_scores_gemma":[0.9758056,0.0000022298677,0.023942923,0.00017117518,0.000065770495,4.62458e-7,1.05201906e-7,0.000006047376,0.000005683357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834913,0.0004986365,0.000498719,0.00011183044,0.0003840295,0.00015768297],"domain_scores_gemma":[0.99751085,0.0013502629,0.0004305998,0.0003945514,0.00027893746,0.000034820547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025536506,0.0001351613,0.00027709152,0.00012252238,0.00027687382,0.00004720554,0.0010924421,0.000029640283,0.0000017475036],"category_scores_gemma":[0.00012905669,0.00006828113,0.00007592831,0.00034364802,0.00006367365,0.00014099409,0.00017765902,0.00039322392,0.0000025436082],"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.000025562043,0.00015619962,0.0020196587,0.00000361181,0.000027972816,5.149315e-7,0.014652781,0.9796509,0.0002754879,0.00039750087,0.000041805368,0.0027480132],"study_design_scores_gemma":[0.00033671764,0.0010274791,0.014166012,0.000099509096,0.000010687866,0.000020134064,0.0005470436,0.9823085,0.0011774398,0.00018555216,0.000038302733,0.00008258821],"about_ca_topic_score_codex":0.000005147453,"about_ca_topic_score_gemma":6.34242e-7,"teacher_disagreement_score":0.44490883,"about_ca_system_score_codex":0.00002029578,"about_ca_system_score_gemma":0.00002955996,"threshold_uncertainty_score":0.27844235},"labels":[],"label_agreement":null},{"id":"W2133690794","doi":"10.1007/s11227-012-0804-8","title":"An ant-swarm inspired dynamic multiresolution data dissemination protocol for wireless sensor networks","year":2012,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Wireless sensor network; Benchmark (surveying); Dissemination; Swarm intelligence; Distributed computing; Wireless; Energy consumption; Protocol (science); Efficient energy use; Data aggregator; Swarm behaviour; Ant colony; Key distribution in wireless sensor networks; Computer network; Power consumption; Ant colony optimization algorithms; Variety (cybernetics); Power (physics); Wireless network; Particle swarm optimization; Telecommunications; Artificial intelligence; Algorithm","score_opus":0.04103843900464921,"score_gpt":0.34784128788782753,"score_spread":0.3068028488831783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133690794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1589471,0.00008585982,0.8312909,0.00019698248,0.00058224896,0.008806634,0.0000026885077,0.00007590444,0.000011683872],"genre_scores_gemma":[0.93452317,0.000008600356,0.06388564,0.0000633731,0.00105108,0.0004115788,0.00001592827,0.000032569093,0.000008091555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973977,0.0004556268,0.000757139,0.00026010373,0.00047549454,0.0006539185],"domain_scores_gemma":[0.99697536,0.00088253286,0.0005875432,0.0010363298,0.00032745578,0.00019079553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039080433,0.00023279924,0.00029678812,0.00014135426,0.00048655173,0.00012740701,0.0025117174,0.00012264895,0.0000014497879],"category_scores_gemma":[0.00009526144,0.0001643501,0.000087605324,0.00040940513,0.00007860768,0.001969931,0.0004284915,0.00040537713,0.0000014809312],"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.00013258282,0.000528097,0.0013026908,0.000050357747,0.00005291881,0.000005215645,0.00271313,0.79795057,0.007012387,0.00043993513,0.0005460559,0.18926609],"study_design_scores_gemma":[0.0006749986,0.00016662067,0.002111192,0.00023238371,0.000026674692,0.00019074228,0.00023856395,0.9950552,0.0006535264,0.00001144278,0.00043390988,0.00020474778],"about_ca_topic_score_codex":0.000016175938,"about_ca_topic_score_gemma":0.000007862562,"teacher_disagreement_score":0.77557606,"about_ca_system_score_codex":0.00013240652,"about_ca_system_score_gemma":0.000051929317,"threshold_uncertainty_score":0.6702003},"labels":[],"label_agreement":null},{"id":"W2152838725","doi":"10.1023/a:1008120609055","title":"On the Dynamic Initialization of Parallel Computers","year":2000,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Polygon mesh; Initialization; Hypercube; Network topology; A priori and a posteriori; Parallel computing; Interconnection; Theoretical computer science; Algorithm; Topology (electrical circuits); Computer network; Mathematics","score_opus":0.014990884043113368,"score_gpt":0.23250163000511262,"score_spread":0.21751074596199926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152838725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44417858,0.0000836795,0.5529207,0.0012509739,0.0005878907,0.00006389557,2.3231097e-7,0.000012095237,0.00090196275],"genre_scores_gemma":[0.99763185,0.000033307886,0.0015596977,0.00057126966,0.00016314487,2.1138514e-7,1.8936632e-7,0.000005612051,0.00003474303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861234,0.00038402015,0.0005071384,0.00007145405,0.00028443808,0.00014061658],"domain_scores_gemma":[0.9986424,0.00071903656,0.00022880618,0.00024715927,0.0001340109,0.000028589435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015694449,0.00008670181,0.00016901088,0.00006272221,0.00019009355,0.000065389024,0.00087652885,0.00003070635,0.000041590396],"category_scores_gemma":[0.000026599382,0.00004405622,0.00010187496,0.00024258083,0.000046182344,0.0001952187,0.000049844613,0.0002123986,0.000010753162],"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.00007293575,0.00009950188,0.00012617205,0.000018270748,0.00011728996,0.000013778774,0.011424422,0.8392566,0.00044029002,0.067925446,0.0044272933,0.07607799],"study_design_scores_gemma":[0.00026778592,0.00022894233,0.00057369645,0.0002398945,0.000009753807,0.00033808022,0.00028108165,0.99467134,0.00008182042,0.002720341,0.0005111796,0.00007608586],"about_ca_topic_score_codex":0.000021147984,"about_ca_topic_score_gemma":0.0000028834509,"teacher_disagreement_score":0.55345327,"about_ca_system_score_codex":0.000028565144,"about_ca_system_score_gemma":0.000027348118,"threshold_uncertainty_score":0.17965606},"labels":[],"label_agreement":null},{"id":"W2181058803","doi":"10.1007/s11227-015-1433-9","title":"Incomplete high-dimensional data imputation algorithm using feature selection and clustering analysis on cloud","year":2015,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"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":"Computer science; Imputation (statistics); Cluster analysis; Data mining; Missing data; Feature selection; Data set; Algorithm; Cloud computing; Hierarchical clustering; Pattern recognition (psychology); Artificial intelligence; Machine learning","score_opus":0.05964736565991257,"score_gpt":0.2945540920085865,"score_spread":0.23490672634867393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181058803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44576323,0.00009514417,0.55335605,0.00043322807,0.00029981873,0.00003158623,0.0000023343637,0.000014236306,0.0000043603914],"genre_scores_gemma":[0.7710712,0.000006665091,0.22833069,0.00019138279,0.00038211606,7.513912e-8,0.0000090673575,0.0000058722608,0.0000029371079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986712,0.00025541394,0.00029681294,0.00018132674,0.00043266098,0.00016261349],"domain_scores_gemma":[0.9989806,0.00018763644,0.00023623576,0.00024014823,0.00025300554,0.000102388796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017748981,0.000113985494,0.00021013556,0.00026753577,0.00025573446,0.00014270097,0.0005028236,0.00005162481,0.0000018637138],"category_scores_gemma":[0.0000602121,0.000076648306,0.000044450724,0.0006186288,0.000020503496,0.0008042677,0.00045267807,0.00029704798,0.0000023589419],"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.00008157443,0.000068902984,0.0007284996,0.0000130746,0.00039831467,0.000024500026,0.0023334804,0.78200465,0.0059029986,0.00007473724,0.0017105961,0.20665866],"study_design_scores_gemma":[0.00037523455,0.000110024084,0.0011403455,0.00007330607,0.00013869465,0.00038492237,0.00016993399,0.9965911,0.00044525397,0.00043320016,0.000045830337,0.00009217441],"about_ca_topic_score_codex":0.00011964599,"about_ca_topic_score_gemma":0.00001148429,"teacher_disagreement_score":0.32530797,"about_ca_system_score_codex":0.000061321174,"about_ca_system_score_gemma":0.000063837855,"threshold_uncertainty_score":0.31256273},"labels":[],"label_agreement":null},{"id":"W2189035983","doi":"10.1007/s11227-015-1575-9","title":"Tuning framework for stencil computation in heterogeneous parallel platforms","year":2015,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Polytechnique Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Stencil; Computer science; Computation; Parallel computing; Flexibility (engineering); Computational science; Supercomputer; Computer engineering; Algorithm","score_opus":0.07174342816708904,"score_gpt":0.3080689272630681,"score_spread":0.23632549909597908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189035983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12981395,0.00036132298,0.86881167,0.00040985976,0.0003213329,0.00014437226,2.673659e-7,0.00007681142,0.000060431717],"genre_scores_gemma":[0.52717835,0.000010815677,0.4725311,0.00016169083,0.00010648055,7.982025e-7,4.839846e-7,0.000007453704,0.0000028156242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842906,0.000109945875,0.0006626184,0.00013918722,0.00036401316,0.0002951615],"domain_scores_gemma":[0.99824065,0.0007011928,0.00035147983,0.00020786263,0.00039004817,0.0001087399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029905487,0.00014329185,0.00027140786,0.00020134888,0.00014932046,0.00011600626,0.0009686798,0.00008011805,4.9897324e-7],"category_scores_gemma":[0.0003243511,0.0001003958,0.00009402664,0.0003771632,0.000037657755,0.0004303152,0.00018493738,0.0003368824,0.0000020050966],"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.00004810246,0.00003861091,0.0005033095,0.000009247487,0.00001593159,0.000011049738,0.005294177,0.9762883,0.000024197336,0.0036304707,0.00025056247,0.0138860075],"study_design_scores_gemma":[0.00060148427,0.00026675043,0.00020352489,0.0001586094,0.0000071423574,0.0003063279,0.00035463792,0.9361529,0.00016506908,0.061567612,0.00007866236,0.00013728476],"about_ca_topic_score_codex":0.00001566619,"about_ca_topic_score_gemma":0.0000022366428,"teacher_disagreement_score":0.3973644,"about_ca_system_score_codex":0.000116895266,"about_ca_system_score_gemma":0.0001467403,"threshold_uncertainty_score":0.4094022},"labels":[],"label_agreement":null},{"id":"W2214523822","doi":"10.1007/s11227-015-1538-1","title":"Minimizing latency in geo-distributed clouds","year":2015,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Latency (audio); Distributed computing; Parallel computing; Telecommunications","score_opus":0.033253420081973115,"score_gpt":0.2474098637117053,"score_spread":0.21415644362973218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214523822","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87864393,0.00061513373,0.11650068,0.0027874454,0.00064968126,0.00006512412,2.090727e-7,0.00004442203,0.0006933576],"genre_scores_gemma":[0.98789054,0.0000063766033,0.011521841,0.00021655447,0.00032549645,1.756009e-7,2.5393553e-7,0.00000831783,0.000030421894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805665,0.0003190033,0.00064564816,0.0001398548,0.00047443886,0.000364393],"domain_scores_gemma":[0.99880844,0.0002828654,0.0002481882,0.00034423,0.00018263579,0.0001336073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00414998,0.00014071711,0.000257135,0.0001733387,0.00012521232,0.00010771784,0.0015398476,0.000045257155,0.0000017151679],"category_scores_gemma":[0.00016709638,0.000092226896,0.000092315044,0.0006560382,0.000040813935,0.00007551916,0.0006302661,0.00043389076,0.0000132657315],"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.00007439195,0.00034427125,0.01573166,0.000045073735,0.00012461538,0.0005390645,0.032438505,0.83925056,0.00053149264,0.0051940964,0.0069411257,0.09878511],"study_design_scores_gemma":[0.0020936148,0.00034988558,0.013711254,0.0003954182,0.000035607525,0.00091009896,0.0040972335,0.9684177,0.00026745404,0.00465793,0.0046906536,0.00037314926],"about_ca_topic_score_codex":0.00008100604,"about_ca_topic_score_gemma":0.0000035323742,"teacher_disagreement_score":0.12916711,"about_ca_system_score_codex":0.00011960569,"about_ca_system_score_gemma":0.0000930928,"threshold_uncertainty_score":0.37609035},"labels":[],"label_agreement":null},{"id":"W2241877823","doi":"10.1007/s11227-015-1541-6","title":"Improving the classification performance of biological imbalanced datasets by swarm optimization algorithms","year":2015,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Universidade de Macau","keywords":"Computer science; Machine learning; Artificial intelligence; Class (philosophy); Data mining; Swarm behaviour; Particle swarm optimization; Population; Algorithm","score_opus":0.054495153893035705,"score_gpt":0.2758229984584579,"score_spread":0.2213278445654222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2241877823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15533131,0.00022864329,0.8432104,0.0008124494,0.00019320394,0.000126517,0.000016172042,0.000047229114,0.000034107194],"genre_scores_gemma":[0.8659882,0.00013306724,0.13359386,0.0001361442,0.00010297321,0.0000016419564,0.000034020344,0.000006866027,0.000003259123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982619,0.00029501115,0.00066340505,0.00015282458,0.00042696795,0.00019988579],"domain_scores_gemma":[0.9979271,0.0002748324,0.0007399307,0.0006177272,0.0003734821,0.00006687917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033990599,0.00012406416,0.00019844121,0.000073846895,0.00017445977,0.0000792083,0.0019904564,0.00006271142,0.0000014956792],"category_scores_gemma":[0.00028633233,0.00006636471,0.000044327182,0.00040840215,0.00014542657,0.00082918967,0.00030312018,0.00029978235,0.000002554921],"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.00027434435,0.00063524634,0.01013491,0.00010367418,0.00016422017,0.0000071184395,0.007931906,0.10980196,0.39214554,0.004684436,0.04302894,0.4310877],"study_design_scores_gemma":[0.0003063572,0.00024069445,0.001987632,0.000041997122,0.000012291209,0.00011884981,0.00037279708,0.9635275,0.032724403,0.000081848266,0.00047751854,0.00010809074],"about_ca_topic_score_codex":0.000017508793,"about_ca_topic_score_gemma":1.711429e-7,"teacher_disagreement_score":0.85372555,"about_ca_system_score_codex":0.00007914764,"about_ca_system_score_gemma":0.00010979741,"threshold_uncertainty_score":0.36987963},"labels":[],"label_agreement":null},{"id":"W2252795377","doi":"10.1007/s11227-016-1633-y","title":"GPU-enabled back-propagation artificial neural network for digit recognition in parallel","year":2016,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Fundo para o Desenvolvimento das Ciências e da Tecnologia; Universidade de Macau","keywords":"Computer science; CUDA; Programmer; Artificial neural network; Graphics processing unit; Graphics; Parallel computing; Code (set theory); Central processing unit; General-purpose computing on graphics processing units; GPU cluster; Backpropagation; Computer architecture; Computer hardware; Computer engineering; Artificial intelligence; Embedded system; Computer graphics (images); Programming language","score_opus":0.047587179519779164,"score_gpt":0.26928656411199237,"score_spread":0.2216993845922132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252795377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2795927,0.000055195866,0.7160042,0.003783813,0.00026339904,0.00023869323,9.891967e-7,0.0000221952,0.000038821054],"genre_scores_gemma":[0.9157739,0.00003438236,0.08292557,0.00026482035,0.0009611851,0.000006116688,0.0000013942872,0.000013035188,0.00001955615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852747,0.00015371552,0.00062438264,0.00015737448,0.00019063284,0.0003464365],"domain_scores_gemma":[0.9981397,0.0010638259,0.00031711024,0.00022767075,0.00019195955,0.00005978004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000979655,0.00011839757,0.00018804234,0.000075470736,0.00019915776,0.00006574369,0.0006344893,0.00004162848,0.000005406116],"category_scores_gemma":[0.000108543834,0.00006869283,0.00008295693,0.0004134391,0.000043055978,0.000870509,0.00010587204,0.00017141645,0.00001931827],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016631649,0.00007320348,0.00076158065,0.000012516784,0.000019448134,0.0000059512718,0.0005098253,0.14490113,0.013251556,0.0042877425,0.001420049,0.8345907],"study_design_scores_gemma":[0.0025020684,0.00054975477,0.005171114,0.00060940394,0.000041987612,0.0004606061,0.00014009382,0.67333555,0.007144644,0.3075045,0.001959239,0.0005809969],"about_ca_topic_score_codex":0.0000032649561,"about_ca_topic_score_gemma":0.00001125904,"teacher_disagreement_score":0.8340097,"about_ca_system_score_codex":0.00007016856,"about_ca_system_score_gemma":0.000037181588,"threshold_uncertainty_score":0.28012124},"labels":[],"label_agreement":null},{"id":"W2268908812","doi":"10.1007/s11227-016-1632-z","title":"Discovering sub-patterns from time series using a normalized cross-match algorithm","year":2016,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Universidade de Macau","keywords":"Computer science; Dynamic time warping; Normalization (sociology); Data stream mining; Data mining; Time series; Data stream; Algorithm; Series (stratigraphy); Artificial intelligence; Machine learning","score_opus":0.012283690589900973,"score_gpt":0.23255946196968422,"score_spread":0.22027577137978324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2268908812","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54393065,0.00011000827,0.45547277,0.00023597397,0.00018129403,0.000024055556,0.0000056235986,0.000020753634,0.000018893303],"genre_scores_gemma":[0.90778166,0.000041985204,0.09143772,0.000053071406,0.0006134317,1.5956263e-7,4.9672036e-7,0.000019789033,0.00005169131],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805886,0.0001644724,0.00074308994,0.0001888575,0.00044028106,0.0004044667],"domain_scores_gemma":[0.9984019,0.00044591792,0.00046023607,0.0003825065,0.00020459876,0.000104852516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012319688,0.00020111621,0.00039753073,0.000102058104,0.0004121569,0.0003959959,0.0011780516,0.000049057166,0.0000656446],"category_scores_gemma":[0.000081387625,0.000106357744,0.00022855528,0.00024066286,0.00008827301,0.002263073,0.00060152187,0.00019646052,0.000020318648],"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.00014201365,0.00011840413,0.036868982,0.00003408071,0.000786351,0.0002542141,0.011962401,0.01889553,0.49179095,0.00043982538,0.00010046552,0.4386068],"study_design_scores_gemma":[0.00204052,0.00030231185,0.018284017,0.0013842676,0.00021622964,0.00210383,0.0008114791,0.90025353,0.070416,0.0028980232,0.0004339286,0.0008558644],"about_ca_topic_score_codex":0.00028550174,"about_ca_topic_score_gemma":0.000007172116,"teacher_disagreement_score":0.88135797,"about_ca_system_score_codex":0.00008425311,"about_ca_system_score_gemma":0.000063499916,"threshold_uncertainty_score":0.4337143},"labels":[],"label_agreement":null},{"id":"W2287774888","doi":"10.1007/s11227-016-1639-5","title":"Improvised methods for tackling big data stream mining challenges: case study of human activity recognition","year":2016,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Universidade de Macau","keywords":"Data stream mining; Big data; Computer science; Data stream; Stream processing; Data mining; Data pre-processing; Decision tree; Analytics; Outlier; Data science; Preprocessor; Mode (computer interface); Machine learning; Artificial intelligence; Distributed computing","score_opus":0.2956431881915972,"score_gpt":0.419922318577618,"score_spread":0.12427913038602084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287774888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54419947,0.00007624551,0.45520362,0.00011361632,0.00016221248,0.00018366687,0.000009638109,0.000040266706,0.000011256299],"genre_scores_gemma":[0.70856637,0.000027102556,0.29114237,0.000007267207,0.00023879891,0.0000018432695,0.0000010052389,0.000014097578,0.0000011397078],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976416,0.00079738535,0.00071086356,0.0003170512,0.00025688377,0.00027616887],"domain_scores_gemma":[0.99505043,0.002610779,0.0006712771,0.001257293,0.00033739413,0.00007281462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008441932,0.00018130276,0.00040601223,0.00022755208,0.00027427176,0.00006645184,0.002247318,0.000058404883,0.0000010299175],"category_scores_gemma":[0.0006756486,0.00010786098,0.000072664596,0.00019210382,0.000057585567,0.001107152,0.0011881985,0.00019593081,2.7005132e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022007289,0.00023805762,0.00007476322,0.00002671968,0.00007496141,0.0000503101,0.005877977,0.0000032244916,0.033829827,0.000009500177,0.000033926357,0.9597587],"study_design_scores_gemma":[0.022844335,0.03650082,0.0031790975,0.007892475,0.0021661865,0.03239926,0.15189123,0.25872502,0.46945548,0.011038617,0.00051881647,0.0033886859],"about_ca_topic_score_codex":0.00022658997,"about_ca_topic_score_gemma":0.00007169285,"teacher_disagreement_score":0.95637006,"about_ca_system_score_codex":0.000052481613,"about_ca_system_score_gemma":0.00008128564,"threshold_uncertainty_score":0.4398443},"labels":[],"label_agreement":null},{"id":"W2399372960","doi":"10.1007/s11227-016-1739-2","title":"Finding approximate solutions of NP-hard optimization and TSP problems using elephant search algorithm","year":2016,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Universidade de Macau","keywords":"Travelling salesman problem; Computer science; Metaheuristic; Mathematical optimization; Firefly algorithm; Search algorithm; Beam search; Algorithm; Combinatorial optimization; Guided Local Search; Local search (optimization); Best-first search; Optimization problem; Benchmark (surveying); Mathematics; Particle swarm optimization","score_opus":0.08004275425044745,"score_gpt":0.2965008824944893,"score_spread":0.21645812824404187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399372960","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026654005,0.00032470239,0.9719294,0.00070491235,0.0001650254,0.00017153482,0.000003326062,0.00001989053,0.000027259164],"genre_scores_gemma":[0.20173833,0.00022282854,0.7978581,0.000019103267,0.00012055221,5.1086215e-7,2.9337124e-7,0.000015032657,0.000025221345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746895,0.0004874206,0.00072183454,0.00017901197,0.0007253661,0.00041742017],"domain_scores_gemma":[0.99781156,0.0007315922,0.0003274412,0.0002961444,0.00070165016,0.0001316378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048892065,0.00013624495,0.00028549085,0.00035845442,0.0003601066,0.00011973822,0.0008060564,0.00005147639,0.000021337326],"category_scores_gemma":[0.0003095896,0.00007913387,0.00006685445,0.0006109239,0.00016588265,0.00072140136,0.00054269575,0.00023412672,0.0000016068449],"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.000013330469,0.000119208155,0.0005073774,0.000089150235,0.000107170796,0.00001359583,0.003272945,0.8408728,0.032526977,0.0011446116,0.00006621051,0.12126657],"study_design_scores_gemma":[0.00052832614,0.00009407658,0.00010119687,0.00019174274,0.00002057265,0.00048593266,0.00012737491,0.99594736,0.002087598,0.00030629302,0.000009741715,0.00009976368],"about_ca_topic_score_codex":0.000022920209,"about_ca_topic_score_gemma":2.68282e-7,"teacher_disagreement_score":0.17508432,"about_ca_system_score_codex":0.00008625007,"about_ca_system_score_gemma":0.00018338514,"threshold_uncertainty_score":0.32269853},"labels":[],"label_agreement":null},{"id":"W2464411218","doi":"10.1007/s11227-016-1806-8","title":"A novel fruit fly framework for multi-objective shape design of tubular linear synchronous motor","year":2016,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Initialization; Benchmark (surveying); Computer science; Convergence (economics); Point (geometry); Feature (linguistics); Mathematical optimization; Population; Optimization algorithm; Interior point method; Algorithm; Mathematics","score_opus":0.04898033443481277,"score_gpt":0.30189309775653383,"score_spread":0.2529127633217211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464411218","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074626263,0.00028543078,0.9908703,0.00031745358,0.0004961596,0.00050719443,0.000009811409,0.0000464453,0.0000045909765],"genre_scores_gemma":[0.21911308,0.000037939106,0.78041947,0.00010123109,0.00028046675,0.0000037757666,1.4918824e-7,0.000029056806,0.000014829021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997936,0.00020693798,0.000781727,0.00026636667,0.00041032702,0.00039863563],"domain_scores_gemma":[0.9948607,0.002809072,0.0006756342,0.00042257132,0.0011117684,0.00012021815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017194335,0.00024274628,0.0004539652,0.00020821443,0.00024210374,0.000037811034,0.0013327723,0.00011496819,0.000010404487],"category_scores_gemma":[0.0014646915,0.0001441875,0.0001986084,0.00038991752,0.00014414468,0.00072596327,0.0002634382,0.0002951444,0.0000055517685],"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.000497024,0.0009556719,0.00024054144,0.00008024469,0.00059778,0.000029658651,0.016485991,0.42355233,0.3622454,0.006244125,0.00004823098,0.189023],"study_design_scores_gemma":[0.0019263459,0.00061667344,0.00042551255,0.0004141668,0.000040721698,0.00024923368,0.00025538704,0.9773001,0.01702105,0.00149567,0.000029443463,0.00022567266],"about_ca_topic_score_codex":0.0000063390935,"about_ca_topic_score_gemma":4.4284477e-7,"teacher_disagreement_score":0.5537478,"about_ca_system_score_codex":0.00018569376,"about_ca_system_score_gemma":0.00021887408,"threshold_uncertainty_score":0.58797956},"labels":[],"label_agreement":null},{"id":"W2578574048","doi":"10.1007/s11227-017-1960-7","title":"Implementing fuzzy rank function model for a new supply chain risk management","year":2017,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Supply Chain Resilience and Risk Management","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Supply chain risk management; Supply chain; Computer science; Risk analysis (engineering); Risk management; Supply chain management; Fuzzy logic; Outsourcing; Financial risk; Fuzzy set; Vulnerability (computing); Function (biology); Service management; Operations research; Business; Finance; Marketing; Computer security","score_opus":0.02397773957261045,"score_gpt":0.25828773692316187,"score_spread":0.2343099973505514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578574048","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5149264,0.00049473497,0.46863204,0.0044031795,0.0016211126,0.0011304381,0.000003886892,0.000075112854,0.0087130945],"genre_scores_gemma":[0.9893442,0.00020572718,0.0052431542,0.0008343874,0.0036208,0.000005345617,0.00000461029,0.00004034135,0.0007014745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978966,0.000025495829,0.00071269704,0.00021916753,0.00049055985,0.0006554607],"domain_scores_gemma":[0.9978733,0.00011544428,0.0012318434,0.0005363432,0.00021034593,0.000032687898],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004399414,0.0002492894,0.00031687543,0.000302243,0.0025112224,0.0007683866,0.0012179051,0.000048391383,0.000041059637],"category_scores_gemma":[0.0001489548,0.00016892378,0.00027480302,0.00013835798,0.00006719178,0.00149999,0.0007226622,0.00026901887,0.000025990666],"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.00097343023,0.00020429518,0.058828786,0.0005804617,0.00089844415,0.000033047345,0.0018851078,0.1315743,0.00038487065,0.043010965,0.063682385,0.6979439],"study_design_scores_gemma":[0.004886285,0.00008688197,0.022722661,0.0003733228,0.0014254063,0.000018182214,0.0068955203,0.8522455,0.000040424882,0.05402061,0.05673717,0.00054805115],"about_ca_topic_score_codex":0.00060339185,"about_ca_topic_score_gemma":0.00013979682,"teacher_disagreement_score":0.7206712,"about_ca_system_score_codex":0.0000491449,"about_ca_system_score_gemma":0.00002969988,"threshold_uncertainty_score":0.99878734},"labels":[],"label_agreement":null},{"id":"W2589534916","doi":"10.1007/s11227-017-1987-9","title":"Investigating Apache Hama: a bulk synchronous parallel computing framework","year":2017,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Bottleneck; Data science; Big data; Distributed computing; Field (mathematics); Computation; Graph; Process (computing); Supercomputer; Software; Theoretical computer science; Parallel computing; Data mining; Programming language","score_opus":0.02688130806492081,"score_gpt":0.2689697161924645,"score_spread":0.2420884081275437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2589534916","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5522729,0.00041083756,0.44105816,0.004383686,0.00094694656,0.000099286124,1.5273596e-7,0.0000786448,0.00074939604],"genre_scores_gemma":[0.83997875,0.00000928148,0.15803967,0.0005323558,0.0013840488,2.7827468e-7,1.1208533e-7,0.000022039641,0.000033487813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969888,0.00035164674,0.0009342769,0.00030908905,0.00075572997,0.0006604744],"domain_scores_gemma":[0.99564666,0.0010933772,0.0013440843,0.0014549219,0.0002437057,0.0002172667],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0046365536,0.00030842636,0.00049245305,0.00014791303,0.002862615,0.0010721165,0.005306378,0.00011017498,0.0000039335996],"category_scores_gemma":[0.0010155592,0.00020935078,0.0002526258,0.00022465593,0.0002927799,0.00018391981,0.002394706,0.0011695332,0.00002177172],"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.000019873913,0.00025261735,0.020033395,0.0001682078,0.000512407,0.00025518512,0.037179995,0.5111417,0.0007451779,0.029197609,0.0018465032,0.3986473],"study_design_scores_gemma":[0.00079334143,0.00023011692,0.02240997,0.0013055331,0.00007515771,0.0009800807,0.0010757535,0.9619391,0.00016237171,0.009720915,0.00084375637,0.00046393575],"about_ca_topic_score_codex":0.00012249283,"about_ca_topic_score_gemma":0.000002646101,"teacher_disagreement_score":0.45079735,"about_ca_system_score_codex":0.0001035684,"about_ca_system_score_gemma":0.00011281281,"threshold_uncertainty_score":0.9999649},"labels":[],"label_agreement":null},{"id":"W2600740027","doi":"10.1007/s11227-017-2003-0","title":"Dependability enhancing mechanisms for integrated clinical environments","year":2017,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Distributed systems and fault tolerance","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":"U.S. Food and Drug Administration; Hamilton Health Sciences Foundation; National Institute for Health and Care Research; Arkansas Research Alliance; National Institutes of Health; Arkansas Science and Technology Authority; National Institute of General Medical Sciences; Cleveland State University","keywords":"Dependability; Computer science; Supervisor; Component (thermodynamics); Overhead (engineering); Set (abstract data type); Distributed computing; Embedded system; Operating system; Software engineering","score_opus":0.04021160288853961,"score_gpt":0.3230690008375627,"score_spread":0.2828573979490231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600740027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24616909,0.00006276606,0.7520703,0.00045748168,0.0010612662,0.00011420217,0.0000031007644,0.000009571984,0.000052185613],"genre_scores_gemma":[0.9458627,0.000011720492,0.053738464,0.00009737053,0.00025418887,7.550809e-7,5.0487864e-7,0.0000069112825,0.000027401558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822134,0.00021465377,0.0008625642,0.00016676167,0.00028058683,0.00025412146],"domain_scores_gemma":[0.99788725,0.00047354956,0.000701976,0.0007203346,0.000119077355,0.00009778178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065662754,0.00012174929,0.0003277379,0.000026255466,0.00072612136,0.00026235453,0.0022272868,0.00006828631,0.0000029969128],"category_scores_gemma":[0.0005676388,0.00007470131,0.00019942957,0.00004005365,0.00008048934,0.0006004765,0.00029811697,0.0003271951,0.0000067034525],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032532748,0.00087236374,0.01657632,0.0001485795,0.0005999242,0.00009388069,0.00533592,0.0025028267,0.06984696,0.03720122,0.0020644837,0.8644322],"study_design_scores_gemma":[0.0087752715,0.0024358318,0.13016343,0.0016907798,0.00026393784,0.0014662164,0.0026040485,0.7110507,0.054598562,0.053491432,0.03201306,0.0014467388],"about_ca_topic_score_codex":0.000031660566,"about_ca_topic_score_gemma":0.000009707045,"teacher_disagreement_score":0.8629855,"about_ca_system_score_codex":0.000050368668,"about_ca_system_score_gemma":0.00007486068,"threshold_uncertainty_score":0.5584812},"labels":[],"label_agreement":null},{"id":"W2767887452","doi":"10.1007/s11227-017-2185-5","title":"Data-type specific cache compression in GPGPUs","year":2017,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Cache; Parallel computing; Smart Cache; Cache algorithms; Cache pollution; General-purpose computing on graphics processing units; Cache invalidation; CPU cache; Operating system; Graphics","score_opus":0.10683008991284698,"score_gpt":0.3358702260270575,"score_spread":0.22904013611421054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767887452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2184901,0.0011254443,0.7763603,0.001637671,0.0009993488,0.000089060995,9.349577e-7,0.00007000246,0.0012271643],"genre_scores_gemma":[0.8934211,0.00021638926,0.106004916,0.000086633954,0.00024217238,6.150578e-8,0.0000010184322,0.000007314542,0.000020360214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985854,0.00022747435,0.00048981706,0.00016788453,0.00030665097,0.0002227439],"domain_scores_gemma":[0.9975835,0.00024814755,0.000458346,0.001484052,0.00016756558,0.000058366244],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0028926304,0.00011519918,0.00022779613,0.00012394154,0.00053111714,0.00034169358,0.0055980613,0.000048512105,0.0000041382887],"category_scores_gemma":[0.0001880974,0.000075838805,0.00003823236,0.00014832367,0.000073558855,0.00096297974,0.0015475771,0.0004345096,0.000007214417],"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.00025383328,0.00073817227,0.06145686,0.00008391165,0.00015843016,0.0005953005,0.014495776,0.27777094,0.011934591,0.00972586,0.07821627,0.5445701],"study_design_scores_gemma":[0.0007615429,0.00013675964,0.03270602,0.00042486654,0.000010582273,0.00048809993,0.0001251181,0.9530334,0.0013384162,0.0019124816,0.008800491,0.0002622478],"about_ca_topic_score_codex":0.000049582508,"about_ca_topic_score_gemma":0.0000050734325,"teacher_disagreement_score":0.67526245,"about_ca_system_score_codex":0.00003535296,"about_ca_system_score_gemma":0.00006543291,"threshold_uncertainty_score":0.99978215},"labels":[],"label_agreement":null},{"id":"W2783145157","doi":"10.1007/s11227-017-2226-0","title":"Preemptive cloud resource allocation modeling of processing jobs","year":2018,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Cloud computing; Distributed computing; Scheduling (production processes); Quality of service; Cloud testing; Software deployment; Resource allocation; Workload; Job scheduler; Cloud computing security; Operating system; Computer network","score_opus":0.02319223057667303,"score_gpt":0.24942048185848878,"score_spread":0.22622825128181576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783145157","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5264653,0.00027850215,0.47150183,0.000691785,0.00018587497,0.00005591339,6.610838e-8,0.000026816408,0.00079392456],"genre_scores_gemma":[0.97840977,0.000003865765,0.020391999,0.0001527483,0.0009982805,1.768045e-7,1.0458408e-7,0.0000116286365,0.000031432446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981009,0.00024455332,0.0006934981,0.00016115828,0.0005300894,0.00026983646],"domain_scores_gemma":[0.9983867,0.00018630819,0.00047744403,0.0003690399,0.0005169316,0.000063624815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002956822,0.00013911299,0.00024241749,0.00016174196,0.0003640213,0.000085302905,0.0014501978,0.00004344795,0.000001831272],"category_scores_gemma":[0.000094651106,0.00009233986,0.00010277989,0.0004877543,0.00011731523,0.00009360041,0.0005324203,0.0002842652,0.000003857182],"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.00006681456,0.00013571559,0.0004612201,0.000094534276,0.00011255994,0.000008416437,0.044458788,0.7675275,0.002657316,0.0025188797,0.0005203816,0.18143785],"study_design_scores_gemma":[0.000258416,0.00023124201,0.00023623634,0.00039838674,0.00003125979,0.000116104486,0.0015683048,0.9948798,0.0011275025,0.0007104904,0.0003345102,0.000107749795],"about_ca_topic_score_codex":0.000032915923,"about_ca_topic_score_gemma":0.0000016808465,"teacher_disagreement_score":0.45194447,"about_ca_system_score_codex":0.000052460975,"about_ca_system_score_gemma":0.0000761457,"threshold_uncertainty_score":0.37655103},"labels":[],"label_agreement":null},{"id":"W2790511610","doi":"10.1007/s11227-018-2313-x","title":"The influence of textual and verbal word-of-mouth on website usability and visual appeal","year":2018,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Digital Marketing and Social Media","field":"Social Sciences","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Usability; Appeal; Word of mouth; Computer science; Perception; Web usability; World Wide Web; Human–computer interaction; Advertising; Psychology; Political science","score_opus":0.012470803387772277,"score_gpt":0.3010013188395673,"score_spread":0.28853051545179503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790511610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9971944,0.00013194793,0.000005574058,0.00041218725,0.000139969,0.00005751086,0.0000011795411,0.0000048179545,0.0020524147],"genre_scores_gemma":[0.99942386,0.00007164417,0.000037848637,0.00003424302,0.00041165698,7.546187e-8,3.8962057e-8,0.0000037402363,0.000016864451],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985919,0.0004397774,0.0003393948,0.00006571723,0.00038130264,0.00018188279],"domain_scores_gemma":[0.99723214,0.0022033,0.00021422647,0.000060733764,0.00021386115,0.00007574834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050109,0.00006668421,0.00017090364,0.000026649512,0.000565038,0.00005327774,0.00021069958,0.000042759657,0.000002214248],"category_scores_gemma":[0.0017463282,0.000038475206,0.00003995698,0.00015162851,0.0017822756,0.00014700403,0.000083739134,0.00018164233,7.7092943e-7],"study_design_candidate":"observational","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.0007624176,0.00014809055,0.09992449,0.000051044663,0.00009423626,0.000002887224,0.21959741,0.00006824061,0.0019239635,0.0027930692,0.00012788069,0.67450625],"study_design_scores_gemma":[0.0006936533,0.0006868721,0.873468,0.0005858776,0.00006557273,0.000018735376,0.119550854,0.0002487746,0.00032659157,0.0028320265,0.0013339774,0.00018906465],"about_ca_topic_score_codex":0.00033898995,"about_ca_topic_score_gemma":0.00012619045,"teacher_disagreement_score":0.77354354,"about_ca_system_score_codex":0.000022553178,"about_ca_system_score_gemma":0.00009921107,"threshold_uncertainty_score":0.6566869},"labels":[],"label_agreement":null},{"id":"W2791919917","doi":"10.1007/s11227-018-2327-4","title":"Parallel synchronous and asynchronous coupled simulated annealing","year":2018,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Asynchronous communication; Parallel computing; Simulated annealing; Bulk synchronous parallel; Synchronizer; Distributed computing; Parallel algorithm; Computer network; Algorithm","score_opus":0.016615070952962527,"score_gpt":0.27791210360696145,"score_spread":0.2612970326539989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791919917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3827065,0.0004270495,0.6163441,0.00019057984,0.00017968305,0.000056666482,1.2632285e-7,0.0000634195,0.00003188015],"genre_scores_gemma":[0.9647634,0.00011988611,0.03440393,0.0003269168,0.0003724004,1.2771969e-7,2.5637425e-7,0.0000107385495,0.0000023371044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987075,0.00014483756,0.0005010311,0.00014537918,0.00025943381,0.00024182629],"domain_scores_gemma":[0.99864006,0.00029534957,0.00025591097,0.00028508762,0.00043050954,0.00009310122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00149951,0.00014014078,0.00022997572,0.00017459398,0.0003883309,0.00020072552,0.00083578844,0.00005245231,0.0000052345895],"category_scores_gemma":[0.000046206296,0.00009669273,0.00006346665,0.00039600418,0.00013787992,0.00037818344,0.0003459933,0.00021372641,0.0000024674366],"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.0003177465,0.00082052295,0.02734206,0.00028717326,0.0011470659,0.00033578766,0.09539739,0.040064856,0.01733175,0.38146597,0.0035179555,0.4319717],"study_design_scores_gemma":[0.00035327324,0.00044855537,0.0016652403,0.000094788666,0.000015919803,0.00043447723,0.000074449665,0.9925554,0.00068105006,0.0033237152,0.00021867255,0.00013449068],"about_ca_topic_score_codex":0.000043024324,"about_ca_topic_score_gemma":0.0000030495273,"teacher_disagreement_score":0.9524905,"about_ca_system_score_codex":0.000028394583,"about_ca_system_score_gemma":0.00006842555,"threshold_uncertainty_score":0.39430153},"labels":[],"label_agreement":null},{"id":"W2800830922","doi":"10.1007/s11227-018-2402-x","title":"Scaling-up versus scaling-out networking in data centers: a comparative robustness analysis","year":2018,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Robustness (evolution); Computer science; Scalability; Cloud computing; Distributed computing; Data center; Scaling; Server; Fault tolerance; Computer network; Operating system","score_opus":0.1513087231449609,"score_gpt":0.3470831585228438,"score_spread":0.19577443537788292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800830922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47639954,0.0006244978,0.52002156,0.00031848907,0.002482711,0.00005999803,0.0000013563563,0.000030783853,0.00006106209],"genre_scores_gemma":[0.9822022,0.000054875807,0.015777985,0.0001490109,0.0017926935,2.6155644e-7,0.000004699305,0.00001115205,0.0000071237528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972905,0.00045430238,0.00085777265,0.0003434051,0.00051896524,0.00053504325],"domain_scores_gemma":[0.99668163,0.001497567,0.00043969238,0.00096342765,0.00029341574,0.00012428184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035086859,0.00022538812,0.00058600976,0.00036110007,0.0003507989,0.000281538,0.0033684468,0.000074057294,0.000011421272],"category_scores_gemma":[0.000111007255,0.00015897701,0.00016056246,0.0019380809,0.00016532715,0.00081006374,0.0012070249,0.0005549151,0.000010150989],"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.0007827406,0.00026160356,0.044909976,0.000023104292,0.0019277005,0.000107131986,0.032297526,0.8385393,0.00011509079,0.00030499513,0.0041557574,0.07657504],"study_design_scores_gemma":[0.0011214726,0.0000955942,0.0051428606,0.0002278248,0.00023618087,0.000050028713,0.00089942035,0.99156517,0.000043337917,0.00007565495,0.00034106718,0.00020139715],"about_ca_topic_score_codex":0.00007036536,"about_ca_topic_score_gemma":0.0002964064,"teacher_disagreement_score":0.5058027,"about_ca_system_score_codex":0.00009796163,"about_ca_system_score_gemma":0.00007553493,"threshold_uncertainty_score":0.64828944},"labels":[],"label_agreement":null},{"id":"W2888814465","doi":"10.1007/s11227-018-2572-6","title":"Multi-tenant intrusion detection system for public cloud (MTIDS)","year":2018,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; École de Technologie Supérieure","funders":"","keywords":"Computer science; Cloud computing; Intrusion detection system; Intrusion prevention system; Computer security; Operating system","score_opus":0.031184584880363304,"score_gpt":0.24806878434897434,"score_spread":0.21688419946861104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888814465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30620748,0.000103244405,0.6892878,0.0005921542,0.0035960265,0.00012670492,2.806628e-7,0.00006300414,0.00002333144],"genre_scores_gemma":[0.9697461,0.000021573796,0.02705685,0.0001226248,0.0030295453,0.0000011590599,1.6814316e-7,0.000011342753,0.000010617038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983719,0.00026588715,0.00057256094,0.0001546067,0.00031078974,0.00032428364],"domain_scores_gemma":[0.9983274,0.00027831626,0.00036095784,0.00029415212,0.00063927664,0.000099916186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032077688,0.0001310963,0.00020891205,0.00017689452,0.00087804574,0.00019089648,0.00088903174,0.00008256162,0.0000038798253],"category_scores_gemma":[0.00014886864,0.00007299955,0.0001357388,0.0004540596,0.000074188116,0.000700268,0.00025439716,0.00029885428,0.000016375969],"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.00027511021,0.00016480997,0.00011615536,0.00011532161,0.000113937655,0.000010826912,0.0073260716,0.0007577091,0.15592591,0.0034841755,0.00087808847,0.8308319],"study_design_scores_gemma":[0.0010033656,0.0012501284,0.00032363995,0.00024875897,0.00003118066,0.001397078,0.0007490046,0.91790503,0.06643518,0.0004460511,0.010016765,0.00019379659],"about_ca_topic_score_codex":0.000023154682,"about_ca_topic_score_gemma":0.000032064145,"teacher_disagreement_score":0.91714734,"about_ca_system_score_codex":0.00013667453,"about_ca_system_score_gemma":0.000056737368,"threshold_uncertainty_score":0.6753307},"labels":[],"label_agreement":null},{"id":"W2888991534","doi":"10.1007/s11227-018-2559-3","title":"Establishment of herbal prescription vector space model based on word co-occurrence","year":2018,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Ideological and Political Education","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Science Foundation of Shandong Province; National Social Science Fund of China; National Natural Science Foundation of China","keywords":"Medical prescription; Computer science; Vector space model; Word (group theory); Cluster analysis; Space (punctuation); Traditional medicine; Order (exchange); Artificial intelligence; Natural language processing; Medicine; Mathematics; Pharmacology","score_opus":0.04718717193651335,"score_gpt":0.3415800033724886,"score_spread":0.2943928314359753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888991534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9792598,0.000029815024,0.01121063,0.0043593356,0.00048062752,0.00007546279,0.000004338609,0.00000881927,0.0045712027],"genre_scores_gemma":[0.99772483,0.000007692781,0.0011817571,0.00033464003,0.00067718246,2.337988e-7,7.6588134e-7,0.0000022558145,0.00007061593],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987905,0.00029642758,0.0002642183,0.000058001227,0.0003853119,0.00020556392],"domain_scores_gemma":[0.99900824,0.00041430912,0.00014420244,0.000080217585,0.00026201736,0.00009100175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017928081,0.000059521255,0.00011986815,0.000043330958,0.000266865,0.00002815359,0.00025074193,0.00004431737,0.00010296366],"category_scores_gemma":[0.0005586421,0.000037076472,0.000054679404,0.00014318914,0.0003375249,0.00011089764,0.000016511569,0.00017577909,0.000007790689],"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.0021802664,0.0029837051,0.042569757,0.00025634034,0.00014844105,0.00001079021,0.33240762,0.11490291,0.021176746,0.28173637,0.060647853,0.14097919],"study_design_scores_gemma":[0.0031743436,0.0052989773,0.08343661,0.0021288246,0.00037250173,0.0000305517,0.04727186,0.7610859,0.02348096,0.04043923,0.03205258,0.0012276624],"about_ca_topic_score_codex":0.00032597105,"about_ca_topic_score_gemma":0.000019850542,"teacher_disagreement_score":0.646183,"about_ca_system_score_codex":0.00007994492,"about_ca_system_score_gemma":0.00022281567,"threshold_uncertainty_score":0.20525369},"labels":[],"label_agreement":null},{"id":"W2896383989","doi":"10.1007/s11227-018-2653-6","title":"GPU parallelization of multigrid RANS solver for three-dimensional aerodynamic simulations on multiblock grids","year":2018,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Computational Fluid Dynamics and Aerodynamics","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bombardier (Canada); Polytechnique Montréal","funders":"","keywords":"Multigrid method; Computer science; Parallel computing; Solver; Computational science; CUDA; Reynolds-averaged Navier–Stokes equations; Smoothing; Finite volume method; Context (archaeology); Computational fluid dynamics; Nonlinear system","score_opus":0.012708400662713807,"score_gpt":0.2379001118671519,"score_spread":0.2251917112044381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896383989","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7063381,0.000060979346,0.2928365,0.00007412586,0.0004903668,0.00013502073,0.000022139551,0.0000211709,0.000021641306],"genre_scores_gemma":[0.9889084,0.0000073321453,0.010521022,0.0000388663,0.0004649086,5.2863874e-7,0.00002111247,0.000031993422,0.0000058196574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883425,0.0000331272,0.00058492576,0.00008547661,0.00027340543,0.00018880014],"domain_scores_gemma":[0.99846,0.0007490853,0.00012280876,0.00013278257,0.00048740895,0.000047893736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044231964,0.0001501076,0.0002281633,0.0001453482,0.00017925378,0.000016794847,0.00021295351,0.000056846206,0.0000114964605],"category_scores_gemma":[0.00007478429,0.00011361923,0.00013384018,0.00018486913,0.000067885325,0.000109908506,0.000030221368,0.0001732284,0.000002808441],"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.000054154447,0.000037839454,0.0006978918,0.000021427275,0.000069919246,4.8445065e-7,0.0003025301,0.9857821,0.0102128405,0.00040906068,0.00010075577,0.002311018],"study_design_scores_gemma":[0.00079205935,0.0001754352,0.012225811,0.00011695669,0.000046186233,0.000018614675,0.000024585497,0.98551947,0.00021032058,0.0007129098,0.00004048982,0.00011717335],"about_ca_topic_score_codex":0.000013237092,"about_ca_topic_score_gemma":0.00014170774,"teacher_disagreement_score":0.28257033,"about_ca_system_score_codex":0.00006637462,"about_ca_system_score_gemma":0.000035819212,"threshold_uncertainty_score":0.46332577},"labels":[],"label_agreement":null},{"id":"W2981340892","doi":"10.1007/s11227-019-03028-9","title":"Threats on the horizon: understanding security threats in the era of cyber-physical systems","year":2019,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Information and Cyber Security","field":"Computer Science","cited_by":81,"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 security; Computer science; Vulnerability (computing); Asset (computer security); Cyber-physical system; Physical security; Usability; Hacker; Internet privacy","score_opus":0.03878453997431759,"score_gpt":0.26480935664810984,"score_spread":0.22602481667379226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981340892","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9786111,0.00026488537,0.010792454,0.0033022412,0.00056850235,0.00025178387,9.103032e-7,0.000013416431,0.006194682],"genre_scores_gemma":[0.99937123,0.0000349561,0.00006579757,0.0003201771,0.00019556387,5.5169727e-7,2.1448909e-7,0.0000053117055,0.000006184358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978853,0.0005182313,0.0005242023,0.00009793367,0.00072138425,0.0002529853],"domain_scores_gemma":[0.9977352,0.0012877461,0.0003313965,0.0005020179,0.00010834382,0.00003532054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003739066,0.0001428181,0.00027609678,0.000074153155,0.00022584069,0.00017220958,0.0016061341,0.000044853594,0.0000046117757],"category_scores_gemma":[0.00003113082,0.000062686646,0.00013683566,0.00044341176,0.00007091147,0.00053787493,0.00016620514,0.00085188885,0.00001875839],"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.000037478654,0.00014113369,0.0011448849,0.000043810243,0.00005203019,0.000010395748,0.109544136,0.004759813,0.00018572577,0.88035345,0.000257787,0.0034693498],"study_design_scores_gemma":[0.0026031986,0.0020321156,0.009425593,0.0020501693,0.0000849915,0.0013436774,0.10403222,0.6821175,0.0017766494,0.19357567,0.00026964006,0.0006885754],"about_ca_topic_score_codex":0.00003886477,"about_ca_topic_score_gemma":0.0000063801135,"teacher_disagreement_score":0.6867778,"about_ca_system_score_codex":0.00010907245,"about_ca_system_score_gemma":0.00007428011,"threshold_uncertainty_score":0.37010804},"labels":[],"label_agreement":null},{"id":"W3025251425","doi":"10.1007/s11227-020-03312-z","title":"Smartphone processor architecture, operations, and functions: current state-of-the-art and future outlook: energy performance trade-off","year":2020,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Green IT and Sustainability","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Energy consumption; Context (archaeology); Microarchitecture; Embedded system; Efficient energy use; Architecture; Computer architecture; Mobile device; Energy minimization; Energy (signal processing); State (computer science); Cloud computing; Minification; Distributed computing; Mobile processor; Operating system; Mobile technology; World Wide Web; Electrical engineering","score_opus":0.006926934747545233,"score_gpt":0.1873348349806729,"score_spread":0.18040790023312767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025251425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98332036,0.008028205,0.0063183513,0.0019544729,0.00026007276,0.000076804696,0.0000025601182,0.000017129922,0.000022066986],"genre_scores_gemma":[0.9983543,0.00091505714,0.0002815281,0.0000662343,0.00036284086,7.4170316e-7,6.54746e-7,0.000011623033,0.000007022452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925816,0.000059516522,0.0003284093,0.00006671962,0.00015046082,0.00013674278],"domain_scores_gemma":[0.99968153,0.000056332156,0.000042668024,0.00008330662,0.00006601664,0.000070128066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002973559,0.00011134173,0.00017375768,0.00003507619,0.00016982101,0.00002792643,0.00013341664,0.000021279378,0.0000028734594],"category_scores_gemma":[0.000028412764,0.00006523786,0.000041530053,0.00016136417,0.000064449065,0.00014126336,0.000049188642,0.00034701065,2.3409048e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055956287,0.000025833167,0.010558505,0.00051082316,0.000061347964,0.0000013073338,0.011006537,0.11360967,0.0011114996,0.000017519513,0.00053739717,0.8625036],"study_design_scores_gemma":[0.0024202494,0.0007159422,0.22343731,0.000537095,0.0003044389,0.0007167406,0.00614565,0.6772768,0.0073178853,0.00055997225,0.07983178,0.00073613203],"about_ca_topic_score_codex":0.000002644214,"about_ca_topic_score_gemma":0.000010058359,"teacher_disagreement_score":0.8617675,"about_ca_system_score_codex":0.000019662442,"about_ca_system_score_gemma":0.000039071085,"threshold_uncertainty_score":0.26603225},"labels":[],"label_agreement":null},{"id":"W3119935873","doi":"10.1007/s11227-020-03582-7","title":"SS-ITS: secure scalable intelligent transportation systems","year":2021,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Scalability; Intelligent transportation system; Reinforcement learning; Merge (version control); Distributed computing; Anomaly detection; Baseline (sea); Process (computing); Artificial intelligence; Database; Parallel computing; Operating system","score_opus":0.01773233525814767,"score_gpt":0.24458984945994575,"score_spread":0.2268575142017981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119935873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11435982,0.001291932,0.88280284,0.00084622897,0.00037794738,0.00006384661,0.0000010250446,0.00004949171,0.0002068889],"genre_scores_gemma":[0.98761135,0.00017193855,0.01176428,0.00011819271,0.00017199706,0.0000011563226,7.685463e-7,0.0000061056403,0.00015423207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990528,0.00008728116,0.0004183536,0.00009268986,0.0002188234,0.0001300137],"domain_scores_gemma":[0.99909496,0.00009795466,0.00017100347,0.00021140456,0.0003722252,0.00005245922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066699274,0.00007300499,0.0001314115,0.00005103636,0.00019447485,0.000105000385,0.0004841181,0.000036895424,0.000010989713],"category_scores_gemma":[0.000015554593,0.000051323415,0.000080202575,0.00040698407,0.000015754948,0.00029105885,0.00003383979,0.00022388229,0.000009570731],"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.00004636403,0.00078829855,0.0026666627,0.00039700372,0.00046107513,0.0002904794,0.028480846,0.16032259,0.17731078,0.42323348,0.01755198,0.18845043],"study_design_scores_gemma":[0.00068959245,0.00044317657,0.0039290683,0.0007701902,0.00015862552,0.0040333048,0.0077640302,0.55681354,0.33445305,0.006627698,0.083631486,0.0006862372],"about_ca_topic_score_codex":0.000016270185,"about_ca_topic_score_gemma":0.0000027890694,"teacher_disagreement_score":0.8732515,"about_ca_system_score_codex":0.000038962342,"about_ca_system_score_gemma":0.00007532317,"threshold_uncertainty_score":0.2092908},"labels":[],"label_agreement":null},{"id":"W3168603277","doi":"10.1007/s11227-021-03872-8","title":"Node-to-set disjoint paths problem in cross-cubes","year":2021,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Young Scientists Fund; Qinglan Project of Jiangsu Province of China; Secretário de Ciência, Tecnologia e Ensino Superior, Governo do Estado de Parana; National Natural Science Foundation of China; Ivey Foundation","keywords":"Hypercube; Disjoint sets; Computer science; Node (physics); Set (abstract data type); Multiprocessing; Binary logarithm; Combinatorics; Cube (algebra); Fault tolerance; Discrete mathematics; Algorithm; Parallel computing; Mathematics; Distributed computing","score_opus":0.022393139082332026,"score_gpt":0.27649482505904455,"score_spread":0.2541016859767125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168603277","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7080579,0.00030066475,0.2883947,0.0015498543,0.0010146765,0.000065810724,4.812915e-7,0.000017289423,0.00059864746],"genre_scores_gemma":[0.98545414,0.000013808775,0.01343659,0.00056570617,0.00044513374,6.430205e-7,2.2430004e-7,0.000008623387,0.0000751459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820405,0.00030513757,0.00072859204,0.00015395701,0.00031357823,0.00029470064],"domain_scores_gemma":[0.99884486,0.00026991556,0.00015229196,0.00029785943,0.00034815617,0.00008693285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024856543,0.00011540228,0.00026079227,0.00011197534,0.00016480211,0.0003102987,0.0007610755,0.000043773918,0.000013959304],"category_scores_gemma":[0.000095057454,0.00007597813,0.00011349814,0.0005195137,0.000023884715,0.0004185846,0.00033419282,0.00037098696,0.000022750954],"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.000082867,0.00036231684,0.051346395,0.00014574693,0.00016065419,0.0011195501,0.07091975,0.7726028,0.020380951,0.018167123,0.0070515727,0.057660248],"study_design_scores_gemma":[0.0017678164,0.00045391807,0.038554378,0.0020524669,0.0000220821,0.007881524,0.004822286,0.9242213,0.006187343,0.0045347107,0.008819983,0.000682234],"about_ca_topic_score_codex":0.00005639366,"about_ca_topic_score_gemma":0.000034456127,"teacher_disagreement_score":0.27739623,"about_ca_system_score_codex":0.00007916308,"about_ca_system_score_gemma":0.00010052004,"threshold_uncertainty_score":0.30982983},"labels":[],"label_agreement":null},{"id":"W3186166992","doi":"10.1007/s11227-022-04457-9","title":"Efficient parallel graph trimming by arc-consistency","year":2022,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Trimming; Computer science; Graph; Algorithm; Correctness; Parallel computing; Theoretical computer science","score_opus":0.011233306583897377,"score_gpt":0.2142469495600161,"score_spread":0.20301364297611874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186166992","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61110884,0.0017097057,0.38519874,0.0009286041,0.0007288042,0.00006825361,0.0000015977776,0.000030903808,0.00022457121],"genre_scores_gemma":[0.9882102,0.000010812921,0.011251759,0.00039353647,0.000092260605,9.640623e-7,3.7748993e-7,0.00000866719,0.00003140958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978845,0.00058806635,0.0005185795,0.00014388452,0.000543369,0.00032159078],"domain_scores_gemma":[0.99878913,0.00046289735,0.00026696848,0.0003126923,0.0000810022,0.000087335764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037799627,0.00013157979,0.0002218859,0.00017601417,0.0010875674,0.00007276908,0.0016987054,0.00001781639,0.00001988575],"category_scores_gemma":[0.000040217103,0.00009216228,0.00020250994,0.0006188209,0.000076169206,0.00012326139,0.0005241808,0.00058973307,0.000003745732],"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.00017114049,0.0012946887,0.0011483347,0.000041026517,0.00036214566,0.00033928695,0.042951554,0.70312506,0.023007838,0.078139305,0.005760879,0.14365876],"study_design_scores_gemma":[0.0054235808,0.0018734279,0.0018470292,0.00019210574,0.00019180706,0.010670962,0.018736174,0.8751711,0.0031843542,0.075271435,0.0061458466,0.0012921345],"about_ca_topic_score_codex":0.0000107425785,"about_ca_topic_score_gemma":1.3358822e-7,"teacher_disagreement_score":0.3771014,"about_ca_system_score_codex":0.00004308389,"about_ca_system_score_gemma":0.000067537745,"threshold_uncertainty_score":0.83647996},"labels":[],"label_agreement":null},{"id":"W3211602915","doi":"10.1007/s11227-021-04177-6","title":"A binary PSO-based ensemble under-sampling model for rebalancing imbalanced training data","year":2021,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Artificial intelligence; Ensemble learning; Machine learning; Sampling (signal processing); Selection (genetic algorithm); Binary number; Binary classification; Data mining; Pattern recognition (psychology); Support vector machine; Mathematics","score_opus":0.2111408925881917,"score_gpt":0.35105609274242977,"score_spread":0.13991520015423808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211602915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032048184,0.00035335164,0.9637471,0.003258025,0.00025676505,0.00013494109,0.000019517693,0.00012926839,0.000052876145],"genre_scores_gemma":[0.53384656,0.000020226727,0.46531403,0.0006352442,0.00013526459,0.0000012842899,0.000021246693,0.000015075351,0.000011065548],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785924,0.00018536152,0.00076390884,0.0003517713,0.00041404617,0.0004256907],"domain_scores_gemma":[0.9963803,0.0011461343,0.00044445487,0.0014473012,0.0004884768,0.00009328985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034050096,0.0001843621,0.00036056567,0.00013345761,0.00040101862,0.00021196996,0.0027783671,0.00007336003,0.0000016809968],"category_scores_gemma":[0.00050458295,0.00014625896,0.000107209955,0.0004548247,0.00005036182,0.001021084,0.0006305681,0.00040442272,0.0000014074917],"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.00007593414,0.00017453048,0.00014964517,0.00013349146,0.00011823574,0.000038255395,0.005360699,0.38824853,0.48250225,0.011683257,0.0031573125,0.10835786],"study_design_scores_gemma":[0.000516972,0.00005446681,0.00014714229,0.0002538899,0.000028437205,0.00022537292,0.00061097095,0.98141146,0.011543576,0.0047290293,0.00030471588,0.000173966],"about_ca_topic_score_codex":0.00000437432,"about_ca_topic_score_gemma":0.0000047280764,"teacher_disagreement_score":0.59316295,"about_ca_system_score_codex":0.00010695942,"about_ca_system_score_gemma":0.0007650533,"threshold_uncertainty_score":0.5964267},"labels":[],"label_agreement":null},{"id":"W322361519","doi":"10.1007/s11227-015-1444-6","title":"Accelerating low-fidelity aerodynamic codes on multi- and many-core architectures","year":2015,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Computational Fluid Dynamics and Aerodynamics","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"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; Aerodynamics; Code (set theory); Lattice (music); Fidelity; Vortex; Parallel computing; Graphics; Computational science; Computer architecture; Computer engineering; Programming language; Computer graphics (images); Aerospace engineering; Telecommunications; Acoustics; Physics","score_opus":0.03438642243390386,"score_gpt":0.2566660270043772,"score_spread":0.22227960457047333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W322361519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95281786,0.00039459873,0.046158038,0.00009659582,0.0003172316,0.00006929772,0.000004877282,0.000045407138,0.00009610906],"genre_scores_gemma":[0.9900364,0.000028265482,0.009580287,0.00009180827,0.00022809661,2.6275023e-7,0.000002732384,0.000027213491,0.0000049274186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893415,0.00006152441,0.00044201675,0.000087735956,0.0002656149,0.00020898144],"domain_scores_gemma":[0.99917555,0.00036696848,0.000076751814,0.00011918946,0.00014425749,0.00011727413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009953587,0.0001685326,0.00022764137,0.0000990991,0.00012780055,0.00006852253,0.00023184434,0.00004416165,0.0000015379891],"category_scores_gemma":[0.00011659068,0.00011797293,0.000059775823,0.000113794515,0.00004811838,0.000072170216,0.000075573276,0.00046136632,0.0000022169336],"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.000017889017,0.000018286237,0.0012635202,0.00002583222,0.00003781017,0.000009451507,0.0011429026,0.9858839,0.0037738213,0.00037990915,0.00003767672,0.0074089956],"study_design_scores_gemma":[0.0004539715,0.00006930121,0.021311607,0.00012009405,0.000017951364,0.00022085327,0.00036369913,0.9764109,0.000047807825,0.0008487476,0.0000076359565,0.00012738611],"about_ca_topic_score_codex":0.000021984632,"about_ca_topic_score_gemma":0.000038419592,"teacher_disagreement_score":0.037218563,"about_ca_system_score_codex":0.00008888015,"about_ca_system_score_gemma":0.000032585525,"threshold_uncertainty_score":0.48107964},"labels":[],"label_agreement":null},{"id":"W4205740225","doi":"10.1007/s11227-021-04231-3","title":"LBTM: A lightweight blockchain-based trust management system for social internet of things","year":2022,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Blockchain; Computer science; Internet of Things; Trust management (information system); The Internet; Trustworthiness; Computer security; Metric (unit); Order (exchange); Information sharing; Social network (sociolinguistics); World Wide Web; Data science; Distributed computing; Social media","score_opus":0.013202881194835576,"score_gpt":0.22874663236252982,"score_spread":0.21554375116769425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205740225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45363796,0.00018969552,0.5430123,0.0025208623,0.00021874957,0.00021930816,0.0000018662112,0.00005451575,0.00014472794],"genre_scores_gemma":[0.96824235,7.9710253e-7,0.031435307,0.00020250899,0.000075229225,0.000011993356,4.15006e-7,0.000008578747,0.000022818358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865294,0.00014551426,0.0005402351,0.00013421087,0.0003230299,0.00020405925],"domain_scores_gemma":[0.99892503,0.00020571188,0.00042789406,0.00027607006,0.00013717616,0.000028097571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023262543,0.000105397936,0.00024817843,0.00016294514,0.0005190999,0.000024022736,0.0018671221,0.000041176045,0.0000052874952],"category_scores_gemma":[0.000008642509,0.00007923756,0.00015973799,0.00039891788,0.000064123386,0.000036486337,0.000504889,0.00034063103,5.993524e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022106401,0.0007701993,0.00060880807,0.0006293755,0.0005890955,0.000055936383,0.04306343,0.009644009,0.0031465504,0.8245422,0.004677547,0.11205175],"study_design_scores_gemma":[0.0014094027,0.00041457562,0.00018387691,0.00009474058,0.00010978237,0.00030013005,0.0040744115,0.9747267,0.0069269687,0.005190205,0.0063621774,0.00020705201],"about_ca_topic_score_codex":0.0000146977745,"about_ca_topic_score_gemma":3.4144554e-7,"teacher_disagreement_score":0.96508265,"about_ca_system_score_codex":0.00011828589,"about_ca_system_score_gemma":0.000044790606,"threshold_uncertainty_score":0.3992549},"labels":[],"label_agreement":null},{"id":"W4205867922","doi":"10.1007/s11227-021-04222-4","title":"A framework of genetic algorithm-based CNN on multi-access edge computing for automated detection of COVID-19","year":2022,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"COVID-19 diagnosis using AI","field":"Medicine","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"March of Dimes Canada","funders":"King Saud University","keywords":"Computer science; Convolutional neural network; Staffing; Enhanced Data Rates for GSM Evolution; Computational intelligence; Cloud computing; Artificial intelligence; Edge computing; Machine learning","score_opus":0.06620902740773783,"score_gpt":0.3829997209550136,"score_spread":0.3167906935472758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205867922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5871534,0.00023341275,0.4095805,0.0022017953,0.00038708953,0.00037294743,0.000010775273,0.00005919958,8.8490583e-7],"genre_scores_gemma":[0.9326427,0.000007989842,0.06252949,0.004493867,0.00027662376,0.0000036373367,0.0000029824125,0.00004113486,0.0000015744757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974471,0.00042393,0.0010554675,0.00018050206,0.0006100076,0.0002830481],"domain_scores_gemma":[0.9942047,0.004047409,0.00091067137,0.00030382627,0.00038127304,0.00015212376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025507018,0.00018581437,0.0005986217,0.00045134625,0.00041464492,0.000019173174,0.00046009553,0.000077571494,0.000028449062],"category_scores_gemma":[0.001777691,0.00014985776,0.00028258335,0.0006633695,0.00010934849,0.000051785413,0.00018303846,0.000623436,4.9039784e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008193783,0.0009075584,0.007169289,0.0008484122,0.00022634496,0.00003977503,0.0038093734,0.92714876,0.028697731,0.0000065680006,0.0005448487,0.029781941],"study_design_scores_gemma":[0.003538521,0.0017611262,0.015776832,0.000739537,0.00032797325,0.00021909965,0.000865025,0.9589244,0.017099757,0.000057682806,0.0005439288,0.00014610455],"about_ca_topic_score_codex":0.00022512092,"about_ca_topic_score_gemma":0.0000025515762,"teacher_disagreement_score":0.34705102,"about_ca_system_score_codex":0.0004824992,"about_ca_system_score_gemma":0.00062164385,"threshold_uncertainty_score":0.6111022},"labels":[],"label_agreement":null},{"id":"W4220684352","doi":"10.1007/s11227-022-04416-4","title":"Emotion recognition models for companion robots","year":2022,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Emotion and Mood Recognition","field":"Psychology","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Mitacs","keywords":"Computer science; Facial expression; Leverage (statistics); Artificial intelligence; Machine learning; Humanoid robot; Deep learning; Robot; Human–computer interaction; Multimodal learning; Speech recognition","score_opus":0.10475040894688759,"score_gpt":0.31858701873513157,"score_spread":0.21383660978824398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220684352","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80216515,0.00020943259,0.19214244,0.0008972272,0.0022259017,0.00023820746,0.000013094199,0.000026298898,0.0020822624],"genre_scores_gemma":[0.9970661,0.0000112388325,0.0017941518,0.00043398858,0.0005321703,0.000004824755,0.000029753899,0.000017685927,0.000110118046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866515,0.00046255995,0.0004109625,0.000083929466,0.00020675779,0.00017063835],"domain_scores_gemma":[0.9991592,0.00024887177,0.00026923354,0.000090914364,0.00019118536,0.000040598617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020011626,0.00008021926,0.0001460962,0.00013384025,0.00047460018,0.000015621665,0.00016993811,0.000032282376,0.0004320775],"category_scores_gemma":[0.000023891691,0.00006315585,0.00013012486,0.00013539742,0.000020826476,0.00015123474,0.000045006425,0.00032831414,0.000015505851],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011237386,0.0011486204,0.00034512137,0.000066147106,0.00037920027,0.000018321061,0.042658355,0.1986099,0.008093857,0.0041438593,0.028690558,0.71472234],"study_design_scores_gemma":[0.023540445,0.00805157,0.017539168,0.00068396097,0.0014947288,0.017322315,0.19518326,0.48034918,0.002748446,0.23916079,0.012165053,0.0017610714],"about_ca_topic_score_codex":0.000019765912,"about_ca_topic_score_gemma":0.0000012552338,"teacher_disagreement_score":0.71296126,"about_ca_system_score_codex":0.00006961293,"about_ca_system_score_gemma":0.000020868063,"threshold_uncertainty_score":0.47309455},"labels":[],"label_agreement":null},{"id":"W4221026608","doi":"10.1007/s11227-022-04399-2","title":"Heterogeneous gradient computing optimization for scalable deep neural networks","year":2022,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Estatal de Investigación; Universidad de Extremadura; Horizon 2020; European Commission; European Regional Development Fund; Banco Bilbao Vizcaya Argentaria; Consejería de Educación y Empleo, Junta de Extremadura; Fundación BBVA; Ministerio de Ciencia e Innovación; Canadian Institute for Advanced Research; Junta de Extremadura; Ministerio de Ciencia, Innovación y Universidades","keywords":"Computer science; Scalability; Replica; Distributed computing; Workload; Artificial neural network; Computation; Partition (number theory); Symmetric multiprocessor system; Data parallelism; Supercomputer; Parallel computing; Process (computing); Artificial intelligence; Parallelism (grammar); Algorithm; Database","score_opus":0.01791124502814537,"score_gpt":0.24772969038386516,"score_spread":0.2298184453557198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221026608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07055359,0.00068490155,0.9268458,0.0009039346,0.0006739849,0.0002683303,7.688355e-7,0.000056462493,0.000012236184],"genre_scores_gemma":[0.8473774,0.0000121612175,0.15168409,0.00053780264,0.00035968033,0.0000046408354,0.0000023288005,0.00001806415,0.000003833912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998271,0.00025003607,0.00057635945,0.000186378,0.00032074863,0.00039551055],"domain_scores_gemma":[0.99826497,0.00071494206,0.00042467017,0.00033208504,0.00017650228,0.00008682017],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012451488,0.00014263566,0.00021478168,0.000093276234,0.0014050315,0.00008667831,0.0014415216,0.000021596778,0.000007899917],"category_scores_gemma":[0.000032772623,0.00011388681,0.00014009023,0.00058139965,0.000039439357,0.00028441934,0.000664837,0.00040790817,4.0374886e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014317782,0.000031992957,0.000057894627,0.0000029976736,0.000014965649,0.000004341016,0.00040966013,0.9661212,0.000076178454,0.0006262488,0.00010576809,0.032534458],"study_design_scores_gemma":[0.00031926567,0.00019914779,0.00003594477,0.000007230402,0.000018959287,0.0010404125,0.0001222555,0.9972423,0.00006265056,0.00053907646,0.00029383306,0.00011895057],"about_ca_topic_score_codex":0.0000032784674,"about_ca_topic_score_gemma":8.3851097e-7,"teacher_disagreement_score":0.7768238,"about_ca_system_score_codex":0.00012657049,"about_ca_system_score_gemma":0.000022124446,"threshold_uncertainty_score":0.999895},"labels":[],"label_agreement":null},{"id":"W4221102161","doi":"10.1007/s11227-022-04305-w","title":"Improved reinforcement learning in cooperative multi-agent environments using knowledge transfer","year":2022,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Reinforcement learning; Abstraction; State space; Convergence (economics); Process (computing); Artificial intelligence; Fuse (electrical); Mechanism (biology); State (computer science); Space (punctuation); Transfer of learning; Class (philosophy); Machine learning; Distributed computing; Algorithm","score_opus":0.03410398160610389,"score_gpt":0.26108662622533757,"score_spread":0.22698264461923368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221102161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3396178,0.00042288948,0.6591298,0.00010507881,0.00044760839,0.00023264268,9.2248865e-7,0.000012512128,0.000030767456],"genre_scores_gemma":[0.99824065,0.000013385573,0.0014538809,0.00008525295,0.00008640969,0.0000043918544,0.000001561393,0.000016260095,0.00009820368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996942,0.001061974,0.0009062244,0.00020252552,0.00046596956,0.00042133135],"domain_scores_gemma":[0.999163,0.00020965813,0.00021086742,0.00026192114,0.0000621539,0.000092455324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003164259,0.00020008656,0.00034587414,0.00019686516,0.0005948789,0.00008656122,0.0012307498,0.000032234813,0.000024082401],"category_scores_gemma":[0.000051651918,0.00015620948,0.000129945,0.00041780339,0.00003808739,0.00043317382,0.0005233195,0.00083954714,0.000005362364],"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.000026874692,0.00013923847,0.0005779192,0.0000071756454,0.000060089493,0.000028227778,0.011088157,0.9133945,0.07241602,0.000085269,0.000009370585,0.002167121],"study_design_scores_gemma":[0.0021996563,0.00024379494,0.0005987154,0.000055564265,0.000023550834,0.00018884818,0.0023692849,0.9914036,0.0018322888,0.0000029923356,0.0009085783,0.00017315983],"about_ca_topic_score_codex":0.000091606176,"about_ca_topic_score_gemma":0.0000069502175,"teacher_disagreement_score":0.65862286,"about_ca_system_score_codex":0.00066394696,"about_ca_system_score_gemma":0.00015145888,"threshold_uncertainty_score":0.6370038},"labels":[],"label_agreement":null},{"id":"W4230504013","doi":"10.1007/s11227-006-8292-3","title":"Foreword","year":2006,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science","score_opus":0.009721519555180575,"score_gpt":0.22282218553258484,"score_spread":0.21310066597740426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230504013","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927223,0.0006690558,0.0037593695,0.00032725124,0.00022579882,0.000043869095,0.0000022515937,0.000029594556,0.0022205254],"genre_scores_gemma":[0.9956757,0.0000025097786,0.002861061,0.000077724515,0.0012653313,5.3127504e-8,4.6180517e-7,0.00003673697,0.00008043871],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9986333,0.0001629561,0.0005155782,0.000049728078,0.00037487477,0.00026354488],"domain_scores_gemma":[0.99907136,0.0002961202,0.00025377877,0.00015358253,0.00018265525,0.00004249115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002335985,0.00010286512,0.00018222308,0.00011124585,0.00018030118,0.00002656671,0.00042094127,0.00002934216,0.000046703193],"category_scores_gemma":[0.000066325956,0.0000601472,0.00011853658,0.00025706537,0.00007047191,0.00021563712,0.00006662735,0.00034347113,0.00023064888],"study_design_candidate":"observational","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.0006844456,0.00071129575,0.108916506,0.00006983668,0.0004043669,0.00036667802,0.010917854,0.15467753,0.48166165,0.014838091,0.18350907,0.043242693],"study_design_scores_gemma":[0.011273219,0.0015641814,0.58291817,0.0017321571,0.0013682919,0.03342182,0.015143336,0.13171159,0.07880563,0.062324952,0.07747489,0.0022617793],"about_ca_topic_score_codex":0.00010640992,"about_ca_topic_score_gemma":0.000021661954,"teacher_disagreement_score":0.47400165,"about_ca_system_score_codex":0.000071408314,"about_ca_system_score_gemma":0.000039433697,"threshold_uncertainty_score":0.29646018},"labels":[],"label_agreement":null},{"id":"W4282600344","doi":"10.1007/s11227-022-04586-1","title":"Advanced encryption schemes in multi-tier heterogeneous internet of things: taxonomy, capabilities, and objectives","year":2022,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":13,"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":"Computer science; Taxonomy (biology); Encryption; The Internet; Computer security; World Wide Web; Distributed computing","score_opus":0.017783478548324055,"score_gpt":0.2342371898780992,"score_spread":0.21645371132977514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282600344","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8152784,0.001408654,0.18290605,0.0002113723,0.00006246664,0.00010814954,4.5297438e-7,0.000014269794,0.000010171432],"genre_scores_gemma":[0.9444001,0.000029419989,0.055488043,0.00005918208,0.000008914312,0.0000065436534,1.618032e-7,0.0000036091144,0.0000040581667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909747,0.0001635293,0.00036675308,0.000114269904,0.00013227142,0.00012571998],"domain_scores_gemma":[0.9993259,0.00018500804,0.00020832369,0.00019619752,0.000064085616,0.000020520587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011075974,0.00007467856,0.0001709633,0.00015346777,0.00012580196,0.000013675638,0.0006466137,0.00002922717,0.0000048840616],"category_scores_gemma":[0.000043467237,0.000058900703,0.00003952793,0.00022415364,0.00010778223,0.00020547613,0.00048622623,0.00039247615,1.4932377e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019409227,0.0013090976,0.039185468,0.0001656466,0.00024679606,0.000048598406,0.19236639,0.042736836,0.04683293,0.044289503,0.00007482146,0.6325498],"study_design_scores_gemma":[0.0021111472,0.00091164524,0.005829462,0.000151762,0.000027194625,0.0018750043,0.016490454,0.92734534,0.027703999,0.014663473,0.002494323,0.00039622275],"about_ca_topic_score_codex":0.00007651546,"about_ca_topic_score_gemma":0.0000064370142,"teacher_disagreement_score":0.8846085,"about_ca_system_score_codex":0.00006588394,"about_ca_system_score_gemma":0.000037764385,"threshold_uncertainty_score":0.24019009},"labels":[],"label_agreement":null},{"id":"W4285728674","doi":"10.1007/s11227-022-04641-x","title":"Provable user authentication scheme on ECC in multi-server environment","year":2022,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Computer security; Scheme (mathematics); Authentication (law); Authentication server; Cryptography; Elliptic curve cryptography; Architecture; Service provider; Service (business); Smart card; The Internet; Public-key cryptography; World Wide Web; Encryption","score_opus":0.03464890627516356,"score_gpt":0.2763917721470537,"score_spread":0.24174286587189012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285728674","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5400567,0.00006375349,0.45723328,0.0013988578,0.00015364579,0.0010443241,6.1460565e-7,0.000021030695,0.00002781624],"genre_scores_gemma":[0.9508666,0.000004025918,0.04872902,0.00023034234,0.000028584021,0.00005120642,4.6447605e-7,0.000009677286,0.00008008507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825025,0.00034968118,0.0004919775,0.00016146965,0.00052579894,0.00022081789],"domain_scores_gemma":[0.999018,0.00016550477,0.00029009854,0.00043798974,0.00004160846,0.000046763726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021758005,0.000103918566,0.00014197385,0.00013337223,0.00028533672,0.000042690463,0.0012107061,0.000018538909,0.00005592707],"category_scores_gemma":[0.000054868317,0.00008008737,0.00005878798,0.00027576013,0.000033933327,0.0004299165,0.00055278017,0.00050131435,0.000022676031],"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.0002981656,0.0061634085,0.037542928,0.00012962263,0.00016089315,0.00011705508,0.07949305,0.4939654,0.079122834,0.2550909,0.00030769035,0.047608066],"study_design_scores_gemma":[0.0029449486,0.00065596873,0.04133466,0.00013875093,0.00001922827,0.00027872968,0.0016755067,0.9159505,0.008387026,0.02303693,0.0051262653,0.0004514968],"about_ca_topic_score_codex":0.000007650742,"about_ca_topic_score_gemma":9.17856e-7,"teacher_disagreement_score":0.42198512,"about_ca_system_score_codex":0.00025254674,"about_ca_system_score_gemma":0.000055123946,"threshold_uncertainty_score":0.3265868},"labels":[],"label_agreement":null},{"id":"W4290519822","doi":"10.1007/s11227-022-04741-8","title":"Toward a context-driven deployment optimization for embedded systems: a product line approach","year":2022,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Horizon 2020 Framework Programme","keywords":"Computer science; MPSoC; Variety (cybernetics); Context (archaeology); Software deployment; Resource (disambiguation); Product (mathematics); Semantics (computer science); Probabilistic logic; Product line; Dependency (UML); Software engineering; Embedded system; System on a chip; Programming language; Artificial intelligence; Manufacturing engineering","score_opus":0.058165799714744,"score_gpt":0.26956840739685667,"score_spread":0.21140260768211266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290519822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007883694,0.0012550509,0.98819894,0.00082899723,0.00056069944,0.0010035635,0.0000030286537,0.00014904447,0.00011700812],"genre_scores_gemma":[0.7420798,0.000010775732,0.25739127,0.00019808278,0.00023165684,0.000038943,0.000001790133,0.000022013784,0.000025683308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967617,0.0012481126,0.0008505981,0.0002290607,0.0006247895,0.00028575043],"domain_scores_gemma":[0.99799824,0.00048871484,0.00060611055,0.00044002366,0.00039886916,0.00006804218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070185997,0.00017317623,0.0003832649,0.0002031604,0.00038563638,0.0001653751,0.0016256061,0.000028080593,0.0000029590863],"category_scores_gemma":[0.00016190435,0.00012460779,0.00014607498,0.00038640987,0.000027439872,0.00044855746,0.00047879515,0.0003914043,5.6324114e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004537635,0.00014151672,0.00002452728,0.000109131586,0.000087731336,0.000008942436,0.013754683,0.97165406,0.0018735214,0.0059535545,0.0021330938,0.0042138766],"study_design_scores_gemma":[0.0004989524,0.0004638472,0.0000037273928,0.000086396576,0.000031858413,0.0014712407,0.0030676876,0.9928109,0.0007805769,0.0001577314,0.0004767368,0.00015032808],"about_ca_topic_score_codex":0.000029961822,"about_ca_topic_score_gemma":3.3801277e-7,"teacher_disagreement_score":0.73419607,"about_ca_system_score_codex":0.0002559113,"about_ca_system_score_gemma":0.00020763441,"threshold_uncertainty_score":0.5081358},"labels":[],"label_agreement":null},{"id":"W4292066621","doi":"10.1007/s11227-022-04749-0","title":"Godiva: green on-chip interconnection for DNNs","year":2022,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Interconnection; Scalability; Overhead (engineering); Efficient energy use; Parallel computing; Embedded system; Computer architecture; Distributed computing; Operating system; Computer network","score_opus":0.02845487092469902,"score_gpt":0.24578314658198339,"score_spread":0.21732827565728435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292066621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26878345,0.00014247249,0.7230659,0.0030553378,0.004301877,0.00016513423,0.0000017031756,0.000037729682,0.00044635206],"genre_scores_gemma":[0.99660814,0.0000034527902,0.0013328334,0.0008211682,0.0010865774,0.0000038334847,5.0336496e-7,0.000010752318,0.00013272876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984461,0.00037073076,0.0005116513,0.00012667103,0.00032103836,0.00022381358],"domain_scores_gemma":[0.9986001,0.0007090764,0.00026625922,0.00021644233,0.00015796526,0.000050111845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003148131,0.000106778134,0.00019948746,0.00014791952,0.0007582892,0.00008393051,0.0010466618,0.000023861501,0.000022295522],"category_scores_gemma":[0.000056514124,0.0000729241,0.00019078245,0.0002502682,0.000017871971,0.00025514766,0.0002669623,0.0004365819,0.000004920546],"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.0007252224,0.00057763455,0.0012721115,0.00010252301,0.00058743043,0.000079234924,0.058487643,0.40967408,0.00879879,0.21754739,0.109739855,0.19240808],"study_design_scores_gemma":[0.0015903969,0.003368814,0.0003561772,0.00013982572,0.00004492846,0.003204795,0.008139178,0.91860855,0.0009706626,0.007802954,0.05539303,0.0003806642],"about_ca_topic_score_codex":0.00006112326,"about_ca_topic_score_gemma":0.0000058650494,"teacher_disagreement_score":0.7278247,"about_ca_system_score_codex":0.00013710528,"about_ca_system_score_gemma":0.00004253428,"threshold_uncertainty_score":0.5832224},"labels":[],"label_agreement":null},{"id":"W4297962057","doi":"10.1007/s11227-022-04834-4","title":"A Bayesian-based classification framework for financial time series trend prediction","year":2022,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Hyperparameter; Artificial intelligence; Machine learning; Sharpe ratio; Bayesian optimization; Metric (unit); Preprocessor; Bayesian probability; Time series; Performance metric; Deep learning; Finance; Portfolio","score_opus":0.09994368813030834,"score_gpt":0.3707152048949446,"score_spread":0.27077151676463623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297962057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23464428,0.00007955144,0.7616605,0.0020780356,0.0011113874,0.00016705529,0.00002687657,0.000022654074,0.00020966106],"genre_scores_gemma":[0.8322929,9.814328e-7,0.16654997,0.00021667857,0.0007663968,0.000006420241,0.0000025725587,0.000016927906,0.00014712042],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595493,0.0014427697,0.0009807386,0.00017573814,0.0012156785,0.00023016018],"domain_scores_gemma":[0.98757595,0.010976579,0.0007538991,0.00032357004,0.00030535227,0.00006467103],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.021378292,0.000117288255,0.00028475153,0.00030612084,0.0010351997,0.00010692191,0.00088829716,0.00005392004,0.0003126457],"category_scores_gemma":[0.013399931,0.000078360135,0.00021401265,0.00086330896,0.000080225116,0.00023438378,0.00012130012,0.00050232303,0.0000041784474],"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.003507294,0.0002787515,0.013795031,0.000024036235,0.000078233075,0.000013195124,0.009536085,0.1663886,0.009751132,0.0038907363,0.038962267,0.75377464],"study_design_scores_gemma":[0.0010747483,0.0015334234,0.038513985,0.000104091385,0.00012552025,0.00054327317,0.003950012,0.7663686,0.0007256969,0.1668127,0.019991362,0.0002565282],"about_ca_topic_score_codex":0.0000019871127,"about_ca_topic_score_gemma":9.944293e-7,"teacher_disagreement_score":0.7535181,"about_ca_system_score_codex":0.00012415896,"about_ca_system_score_gemma":0.00022858797,"threshold_uncertainty_score":0.9949106},"labels":[],"label_agreement":null},{"id":"W4311477341","doi":"10.1007/s11227-022-04993-4","title":"Formal unlinkability analysis of message authentication protocols based on authentic channels","year":2022,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"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":"Computer science; Authentication (law); Confidentiality; Channel (broadcasting); Computer security; Initialization; Protocol (science); Bluetooth; Computer network; Wireless; Telecommunications","score_opus":0.02595956415809417,"score_gpt":0.30827889140013803,"score_spread":0.28231932724204384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311477341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16774896,0.000010323481,0.82459193,0.00088658714,0.00013068966,0.0065553724,0.000005996429,0.0000317238,0.00003841001],"genre_scores_gemma":[0.9904621,2.3174329e-7,0.008458115,0.00022460298,0.00003822764,0.0007952259,0.0000026159023,0.000009753108,0.000009117924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657613,0.00084968563,0.0010265504,0.00021518889,0.0010335154,0.00029890667],"domain_scores_gemma":[0.9970101,0.0007013209,0.0009979159,0.0008746171,0.00033702512,0.00007902342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056470367,0.00015611034,0.00041220293,0.00054727594,0.0004941888,0.00005774438,0.0019886182,0.000030354446,0.000092393],"category_scores_gemma":[0.00021769987,0.00011629625,0.00032215123,0.0020109122,0.00009264612,0.0005304872,0.00049279514,0.0004735225,0.0000018160297],"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.0002386704,0.0015877612,0.0039199996,0.00012924903,0.00049139315,0.000007849516,0.020368246,0.9157593,0.004964973,0.036115628,0.000029999637,0.016386922],"study_design_scores_gemma":[0.0005644022,0.00043659593,0.0064780717,0.000050536357,0.00020087033,0.000014975416,0.00034731656,0.9808586,0.0023727773,0.008388685,0.00016075508,0.00012637625],"about_ca_topic_score_codex":0.0000072654566,"about_ca_topic_score_gemma":6.8885254e-7,"teacher_disagreement_score":0.82271314,"about_ca_system_score_codex":0.00016392057,"about_ca_system_score_gemma":0.00014947551,"threshold_uncertainty_score":0.47424236},"labels":[],"label_agreement":null},{"id":"W4319789621","doi":"10.1007/s11227-023-05063-z","title":"Correction to: A framework of genetic algorithm-based CNN on multi-access edge computing for automated detection of COVID-19","year":2023,"lang":"en","type":"erratum","venue":"The Journal of Supercomputing","topic":"COVID-19 diagnosis using AI","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"March of Dimes Canada","funders":"","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Coronavirus disease 2019 (COVID-19); Artificial intelligence; Algorithm","score_opus":0.059746266643185296,"score_gpt":0.38677361671485677,"score_spread":0.3270273500716715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319789621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052843545,0.00055986154,0.89581615,0.0036386068,0.045134533,0.0015873354,0.000047813355,0.00036306566,0.0000091118145],"genre_scores_gemma":[0.7896807,0.00041196297,0.17086625,0.020299675,0.016540432,0.00003523432,0.00016088398,0.00089599506,0.0011088491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958666,0.00044319977,0.0019010787,0.0003862317,0.0009201206,0.00048277384],"domain_scores_gemma":[0.9883476,0.007687952,0.0019189751,0.000529507,0.0011990432,0.0003169332],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029086743,0.00046679648,0.0014320908,0.0013203243,0.00032297516,0.000054800625,0.0006744664,0.00051465275,0.000010402933],"category_scores_gemma":[0.009604493,0.00037693526,0.000585009,0.0013832717,0.00013592717,0.000065162356,0.00019043597,0.0018090202,0.0000047835833],"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.001117451,0.0007809326,0.0009823613,0.0047553894,0.00070223835,0.00007160084,0.0037228346,0.55512744,0.0047025126,8.900687e-7,0.37359536,0.054441012],"study_design_scores_gemma":[0.0023159806,0.002235785,0.01042811,0.015333049,0.0009603618,0.00016654188,0.00044254918,0.95790243,0.0042735897,0.000021137479,0.005579372,0.00034108656],"about_ca_topic_score_codex":0.0008335276,"about_ca_topic_score_gemma":0.000041975396,"teacher_disagreement_score":0.73683715,"about_ca_system_score_codex":0.00096640474,"about_ca_system_score_gemma":0.0017747026,"threshold_uncertainty_score":0.9998683},"labels":[],"label_agreement":null},{"id":"W4362700380","doi":"10.1007/s11227-023-05209-z","title":"Exploring implicit persona knowledge for personalized dialogue generation","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Topic Modeling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Social Science Fund of China","keywords":"Persona; Computer science; Consistency (knowledge bases); Key (lock); Human–computer interaction; Style (visual arts); World Wide Web; Data science; Artificial intelligence","score_opus":0.25661851092955423,"score_gpt":0.3163193920778916,"score_spread":0.05970088114833738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362700380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49837562,0.00022086194,0.49953702,0.00091151963,0.0007831287,0.00007945176,5.441222e-7,0.000050778806,0.00004107398],"genre_scores_gemma":[0.9740406,0.00008257124,0.023822581,0.000102078964,0.0018598584,0.000004700784,0.0000013531982,0.000014852737,0.00007139742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987867,0.00013038752,0.000405085,0.00014619953,0.00022948433,0.00030218082],"domain_scores_gemma":[0.998857,0.0005012044,0.0001321169,0.00022622697,0.00021576605,0.0000676924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024139194,0.00011380097,0.00019970097,0.00017059207,0.00037262158,0.00010734498,0.0007890119,0.000029549532,0.0000019836045],"category_scores_gemma":[0.0001402031,0.00008085266,0.00015024614,0.00037194398,0.000023531873,0.000660655,0.00018984209,0.00018655827,0.000014231349],"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.000052682535,0.0001008876,0.00062801834,0.00014874096,0.00022394717,0.00003244283,0.1854018,0.06671264,0.19634354,0.070872985,0.0048386008,0.47464374],"study_design_scores_gemma":[0.00057471194,0.00008562929,0.00039922967,0.00006569889,0.000022197271,0.00013607138,0.0014632224,0.9921863,0.0021040533,0.000927588,0.0018958914,0.00013939629],"about_ca_topic_score_codex":0.000014751477,"about_ca_topic_score_gemma":0.0000038301737,"teacher_disagreement_score":0.9254737,"about_ca_system_score_codex":0.00006664367,"about_ca_system_score_gemma":0.00008410596,"threshold_uncertainty_score":0.32970756},"labels":[],"label_agreement":null},{"id":"W4367054037","doi":"10.1007/s11227-023-05283-3","title":"Multivariate outlier filtering for A-NFVLearn: an advanced deep VNF resource usage forecasting technique","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); École de Technologie Supérieure; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Quality of service; Resource (disambiguation); Distributed computing; Key (lock); Virtual network; Data mining; Computer network; Operating system","score_opus":0.048451232499991524,"score_gpt":0.2814806096692189,"score_spread":0.23302937716922736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367054037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19830832,0.00010965203,0.80038315,0.0003240649,0.0003405958,0.0002506121,0.0000010497639,0.00021308135,0.00006947927],"genre_scores_gemma":[0.73807293,0.000012228295,0.26107848,0.00019472015,0.000562533,0.000006721323,0.000001772514,0.00003795995,0.000032617805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980381,0.00022121827,0.0006185405,0.00023924206,0.00031997208,0.00056293455],"domain_scores_gemma":[0.99746656,0.0014731663,0.0003270107,0.0004259854,0.00017760533,0.00012966609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003904141,0.00020058495,0.0003111426,0.00020668165,0.0005613493,0.00017492138,0.0013691477,0.00007922773,0.000003413604],"category_scores_gemma":[0.0003929981,0.00014347634,0.00015591747,0.0006712861,0.00003869797,0.00068940804,0.00046114656,0.00044836354,0.000004534394],"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.00011729324,0.000060186947,0.0006029829,0.00006318123,0.00007003777,0.00008497822,0.011205696,0.37791702,0.022608697,0.00053997396,0.00047021132,0.5862597],"study_design_scores_gemma":[0.00072532316,0.00038245437,0.0011221182,0.00031689837,0.000022329645,0.00046614328,0.00073810684,0.9893486,0.0020914697,0.0019289869,0.0025938647,0.00026371607],"about_ca_topic_score_codex":0.000012069194,"about_ca_topic_score_gemma":0.0000034041507,"teacher_disagreement_score":0.6114316,"about_ca_system_score_codex":0.000051432526,"about_ca_system_score_gemma":0.00004024139,"threshold_uncertainty_score":0.5850795},"labels":[],"label_agreement":null},{"id":"W4378533280","doi":"10.1007/s11227-023-05378-x","title":"Local differentially private federated learning with homomorphic encryption","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"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":"Homomorphic encryption; Computer science; Differential privacy; Shuffling; MNIST database; Inference; Encryption; Reduction (mathematics); Federated learning; Data mining; Machine learning; Artificial intelligence; Theoretical computer science; Computer security; Deep learning","score_opus":0.0252148229056052,"score_gpt":0.24526583584400732,"score_spread":0.22005101293840212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378533280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49059805,0.000041344276,0.5043477,0.0043693264,0.00014457753,0.00004489127,2.1446164e-7,0.0004338151,0.000020112358],"genre_scores_gemma":[0.9634251,0.00007891872,0.03632979,0.00005204071,0.00008195704,5.475426e-7,0.000001659202,0.000021382795,0.000008608551],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813265,0.00029358838,0.00043327265,0.00018840373,0.00055110076,0.000400985],"domain_scores_gemma":[0.9977019,0.00044315457,0.0002903623,0.001318931,0.00018439363,0.00006127479],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0019365977,0.00016470141,0.00024051272,0.00024852756,0.00049701193,0.00025963446,0.010604734,0.00007434759,0.000005683754],"category_scores_gemma":[0.0022696005,0.000100677455,0.000055822857,0.0011018286,0.00014871742,0.00067034847,0.015743716,0.0008828319,0.00004483859],"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.00036977234,0.0003230237,0.0252403,0.0002223961,0.0008727091,0.0016256958,0.005812512,0.1145479,0.15340373,0.005469959,0.038843844,0.65326816],"study_design_scores_gemma":[0.0006684234,0.0004356711,0.01026068,0.00033040767,0.000030416792,0.00095340563,0.00054800604,0.96277833,0.007987841,0.015451174,0.00030769705,0.00024797115],"about_ca_topic_score_codex":0.000018866325,"about_ca_topic_score_gemma":0.0000045723077,"teacher_disagreement_score":0.8482304,"about_ca_system_score_codex":0.000071406095,"about_ca_system_score_gemma":0.00007817319,"threshold_uncertainty_score":0.99474835},"labels":[],"label_agreement":null},{"id":"W4380590100","doi":"10.1007/s11227-023-05474-y","title":"A network anomaly detection algorithm based on semi-supervised learning and adaptive multiclass balancing","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"China Scholarship Council; Natural Science Foundation of Fujian Province; National Natural Science Foundation of China","keywords":"Computer science; Anomaly detection; Machine learning; Artificial intelligence; Data mining; Internet traffic; The Internet; Algorithm","score_opus":0.01359575752609415,"score_gpt":0.22346109848850876,"score_spread":0.2098653409624146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380590100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42930457,0.00012942246,0.56942225,0.00028201655,0.00059108157,0.000079622354,1.6816094e-7,0.00011139928,0.00007950634],"genre_scores_gemma":[0.9850063,0.000043386954,0.013954308,0.0002537784,0.00071707915,7.54485e-7,2.848539e-7,0.00001332525,0.000010813895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822164,0.0005009693,0.00038111059,0.00017578449,0.00037744638,0.00034302828],"domain_scores_gemma":[0.99845,0.00096308516,0.00020224357,0.00014993605,0.00014499233,0.00008977703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026628908,0.00014826922,0.00021388498,0.00019327631,0.0007010373,0.00012742695,0.00034374322,0.000071698,0.000004700645],"category_scores_gemma":[0.00010427567,0.00010940299,0.000079839665,0.0009310932,0.000041237094,0.00034987167,0.00017455357,0.00069937325,0.0000108758895],"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.00009423139,0.000027990125,0.0008501237,0.000013153218,0.000035320023,0.00004786054,0.0026950606,0.47176468,0.004234134,0.00009078801,0.00014711516,0.51999956],"study_design_scores_gemma":[0.00047671783,0.00056056114,0.0020650113,0.00018309511,0.00001534511,0.00014832678,0.00037252923,0.9944935,0.00089298916,0.00043047662,0.00023988634,0.00012158749],"about_ca_topic_score_codex":0.00002978544,"about_ca_topic_score_gemma":0.0000083392515,"teacher_disagreement_score":0.55570173,"about_ca_system_score_codex":0.00006466372,"about_ca_system_score_gemma":0.000037026617,"threshold_uncertainty_score":0.5391883},"labels":[],"label_agreement":null},{"id":"W4380714981","doi":"10.1007/s11227-023-05439-1","title":"DialogueINAB: an interaction neural network based on attitudes and behaviors of interlocutors for dialogue emotion recognition","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"National Natural Science Foundation of China","keywords":"Conversation; Computer science; Emotion recognition; Focus (optics); Perception; Comprehension; Classifier (UML); Cognitive psychology; Human–computer interaction; Artificial intelligence; Psychology; Communication","score_opus":0.05491289198521056,"score_gpt":0.3106297191072561,"score_spread":0.2557168271220456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380714981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93553364,0.000021715805,0.06335282,0.0002636488,0.0007233137,0.00007729496,0.0000012743968,0.000022044049,0.0000042633865],"genre_scores_gemma":[0.9950114,0.000013639627,0.0045056567,0.00007070803,0.00037223514,7.620716e-7,0.00001704922,0.0000071992886,0.0000013621418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989398,0.00020096777,0.0004090997,0.00011288,0.000187389,0.00014983477],"domain_scores_gemma":[0.9989584,0.00047890274,0.00025354672,0.00012702226,0.00013850488,0.000043588843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001658801,0.000088487264,0.00018214528,0.00022075468,0.00016434444,0.00007641965,0.00026075428,0.000031762338,0.0000025199383],"category_scores_gemma":[0.00005935209,0.00006345784,0.00010390932,0.0003315923,0.000028296887,0.00046707978,0.00005856077,0.00013453339,9.736807e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002700072,0.00031547452,0.062383316,0.00009639076,0.00014862516,0.00001431969,0.008242145,0.47646168,0.009139224,0.0003319043,0.0007676782,0.44182923],"study_design_scores_gemma":[0.00038107618,0.00064807176,0.040035103,0.00023470583,0.000051840783,0.000016113752,0.00043794748,0.9570333,0.0008178758,0.00024635857,0.000011020498,0.00008660072],"about_ca_topic_score_codex":0.000026867036,"about_ca_topic_score_gemma":0.00000796394,"teacher_disagreement_score":0.4805716,"about_ca_system_score_codex":0.000021084876,"about_ca_system_score_gemma":0.000014569625,"threshold_uncertainty_score":0.25877357},"labels":[],"label_agreement":null},{"id":"W4381165139","doi":"10.1007/s11227-023-05492-w","title":"iPartition: a distributed partitioning algorithm for block-centric graph processing systems","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Graph partition; Graph; Distributed computing; Algorithm; Skew; Theoretical computer science","score_opus":0.02137050743923048,"score_gpt":0.2510161233004746,"score_spread":0.22964561586124416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381165139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07317946,0.0007105761,0.9243597,0.0005386819,0.00087170355,0.00017165078,0.00000985003,0.0001423068,0.000016067088],"genre_scores_gemma":[0.9826577,0.000035173056,0.016574629,0.00006405243,0.00062732614,0.000005817908,0.000007020021,0.000013893113,0.000014434897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824977,0.0002109906,0.0005874594,0.00015484195,0.00036124483,0.00043568737],"domain_scores_gemma":[0.9985245,0.00047345128,0.0003179272,0.0002047789,0.00037365485,0.00010571957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029928405,0.00014490068,0.00024937483,0.0002457162,0.00079758296,0.00030692606,0.00079263764,0.00004649996,0.0000012037034],"category_scores_gemma":[0.00007658573,0.00010132649,0.00016228655,0.0015762713,0.00006362876,0.00061604363,0.00012998228,0.00023924687,0.000008069297],"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.00006906509,0.00041179918,0.0010424032,0.00046212022,0.0004694796,0.00031310983,0.014588989,0.32499498,0.0028626393,0.033792857,0.0065434733,0.6144491],"study_design_scores_gemma":[0.00060349045,0.00013617714,0.00041606525,0.00032318398,0.000047597736,0.00072223746,0.0011796005,0.9854063,0.00045410503,0.009926731,0.0006137593,0.00017078307],"about_ca_topic_score_codex":0.0000038580874,"about_ca_topic_score_gemma":2.0093347e-7,"teacher_disagreement_score":0.9094782,"about_ca_system_score_codex":0.000034180845,"about_ca_system_score_gemma":0.000072758194,"threshold_uncertainty_score":0.6134444},"labels":[],"label_agreement":null},{"id":"W4384927041","doi":"10.1007/s11227-023-05535-2","title":"Using a privacy-enhanced authentication process to secure IoT-based smart grid infrastructures","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Physical Unclonable Functions (PUFs) and Hardware Security","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Vanier College","funders":"Shahid Rajaee Teacher Training University; Kharazmi University; Universidad Carlos III de Madrid; Comunidad de Madrid","keywords":"Computer science; Mutual authentication; Smart grid; Computer security; Elliptic curve cryptography; Authentication (law); Cryptography; Electricity; Process (computing); Physical unclonable function; Computer network; Embedded system; Public-key cryptography; Encryption; Electrical engineering","score_opus":0.029425875205501755,"score_gpt":0.30018029717263905,"score_spread":0.2707544219671373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384927041","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5975841,0.000018186658,0.4007625,0.00089479744,0.0005299383,0.00009783484,0.0000017680984,0.00007563577,0.00003517553],"genre_scores_gemma":[0.9827687,0.0000018715269,0.016260894,0.0003628149,0.0005834624,0.0000012421098,0.0000017509607,0.000013217994,0.000006038579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983248,0.00015930893,0.00043595853,0.00019232063,0.00053199223,0.00035557864],"domain_scores_gemma":[0.9985906,0.00026539882,0.00020624582,0.00038247646,0.00041106687,0.00014420437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000993637,0.00016116293,0.00023799115,0.00026888863,0.00045021376,0.00015429671,0.0012116451,0.000048331243,0.000009343672],"category_scores_gemma":[0.0002462977,0.00011215349,0.00011528608,0.0015676413,0.00004285847,0.00036972048,0.0002678646,0.00038875153,0.00002450282],"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.00019187451,0.00031214894,0.0014907705,0.0002791435,0.00020295591,0.00004550455,0.060559355,0.66368794,0.22694208,0.005372505,0.0039087445,0.03700699],"study_design_scores_gemma":[0.00075959036,0.00031236958,0.016904704,0.00043579825,0.00007951268,0.00012510779,0.00087725144,0.9194662,0.035889346,0.023822168,0.00090639497,0.0004215778],"about_ca_topic_score_codex":0.00002199998,"about_ca_topic_score_gemma":0.000003136884,"teacher_disagreement_score":0.38518456,"about_ca_system_score_codex":0.00008143065,"about_ca_system_score_gemma":0.0002429571,"threshold_uncertainty_score":0.45734864},"labels":[],"label_agreement":null},{"id":"W4386028207","doi":"10.1007/s11227-023-05555-y","title":"Correction to: Using a privacy‑enhanced authentication process to secure IoT‑based smart grid infrastructures","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Vanier College","funders":"","keywords":"Computer science; Internet of Things; Authentication (law); Computer security; Smart grid; Process (computing); Grid; Operating system; Electrical engineering","score_opus":0.011728792749411245,"score_gpt":0.2616277981462245,"score_spread":0.24989900539681326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386028207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92482984,0.000038472073,0.07105159,0.00020386509,0.0035902055,0.00014517015,0.0000015673601,0.0001093234,0.000029961642],"genre_scores_gemma":[0.9974718,0.0000046159266,0.0016727864,0.00010570064,0.0007157143,0.0000010339437,0.0000013358266,0.00002183496,0.00000515705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896663,0.00005307219,0.00034045865,0.00008962908,0.00029591838,0.00025429906],"domain_scores_gemma":[0.9993697,0.0001767136,0.000062122584,0.00013787298,0.00014697839,0.00010665551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056923117,0.00012484568,0.00016314368,0.00024594253,0.00020157732,0.00004806529,0.0003147151,0.000044179244,0.000010722353],"category_scores_gemma":[0.00023678537,0.000092513954,0.000056168992,0.00088828185,0.000020305048,0.00010856928,0.0000457618,0.00032088117,0.000017161086],"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.000021182957,0.0000060183866,0.00039505918,0.0000439788,0.000014393843,0.0000023563996,0.011709256,0.8830893,0.1017277,0.0000018614056,0.0013987174,0.0015901817],"study_design_scores_gemma":[0.00021630172,0.00009209684,0.020952018,0.0005632322,0.00003790377,0.000097754695,0.0018308389,0.895109,0.080533415,0.00012135565,0.0002571807,0.00018887776],"about_ca_topic_score_codex":0.000014506039,"about_ca_topic_score_gemma":0.000009660536,"teacher_disagreement_score":0.072641976,"about_ca_system_score_codex":0.000080957965,"about_ca_system_score_gemma":0.000052948442,"threshold_uncertainty_score":0.37726095},"labels":[],"label_agreement":null},{"id":"W4386410404","doi":"10.1007/s11227-023-05607-3","title":"Spatiotemporal multi-scale bilateral motion network for gait recognition","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Gait Recognition and Analysis","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; Gait; Optical flow; Artificial intelligence; Segmentation; Block (permutation group theory); Context (archaeology); Motion (physics); Computer vision; Feature (linguistics); Set (abstract data type); Representation (politics); Frame (networking); Noise (video); Pattern recognition (psychology); Scale (ratio); Image (mathematics)","score_opus":0.04179882377295301,"score_gpt":0.2473368593612798,"score_spread":0.20553803558832678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386410404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8609186,0.0000624125,0.1381668,0.00015693954,0.0004665942,0.00007698887,0.00000682736,0.000103133825,0.000041734576],"genre_scores_gemma":[0.9892511,0.00007072945,0.009701895,0.00004957557,0.0008365809,0.0000012201331,0.00003709911,0.000022846669,0.00002899132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992065,0.00005217846,0.00036947837,0.00005123879,0.000117917945,0.00020269543],"domain_scores_gemma":[0.9995878,0.000118542855,0.00006231411,0.000059002832,0.00012559272,0.000046757483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091585884,0.00008988557,0.00016052269,0.00012426036,0.00013378113,0.000035006513,0.000100087884,0.000044609398,0.00002725689],"category_scores_gemma":[0.00002631614,0.00006630209,0.00014808866,0.00032126362,0.00001391336,0.0001508424,0.000013906625,0.00016265156,0.000043144282],"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.000024968815,0.00002741355,0.0034973528,0.00007993381,0.00015639921,0.000005448013,0.0013895374,0.81989944,0.0074168197,0.0000019513132,0.0039027797,0.16359794],"study_design_scores_gemma":[0.00051939546,0.000036904858,0.009070799,0.000121187804,0.00008941214,0.00004181403,0.00041138416,0.98758596,0.0013189019,0.0004299881,0.000261129,0.00011312605],"about_ca_topic_score_codex":0.00001250059,"about_ca_topic_score_gemma":0.000018020502,"teacher_disagreement_score":0.1676865,"about_ca_system_score_codex":0.000028581624,"about_ca_system_score_gemma":0.0000062877148,"threshold_uncertainty_score":0.2703721},"labels":[],"label_agreement":null},{"id":"W4386422441","doi":"10.1007/s11227-023-05592-7","title":"SiMaLSTM-SNP: novel semantic relatedness learning model preserving both Siamese networks and membrane computing","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Topic Modeling","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Natural language processing; Sentence; Task (project management); Semantic similarity; Deep learning; State (computer science); Algorithm","score_opus":0.03696003122406642,"score_gpt":0.26234672475837906,"score_spread":0.22538669353431262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386422441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4700805,0.00039597572,0.52853787,0.0004913604,0.0002245303,0.00006230988,9.462737e-8,0.00010879949,0.000098589444],"genre_scores_gemma":[0.97079015,0.0001570997,0.02845108,0.00014214139,0.00033820642,2.103164e-7,4.9340736e-7,0.00003524851,0.00008537154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741393,0.00025315626,0.00083742273,0.00030233862,0.0005425703,0.000650593],"domain_scores_gemma":[0.9978361,0.0009998793,0.00040801006,0.00041679703,0.0001847109,0.00015450768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004728584,0.00024376609,0.00042358553,0.0002575364,0.0007227937,0.00027612658,0.0014415138,0.00011132274,0.0000021476355],"category_scores_gemma":[0.0002770131,0.000184816,0.00011292837,0.00076138455,0.00008056672,0.00078250223,0.0014162923,0.0011623511,0.000004676752],"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.000007239992,0.00001719735,0.0007097754,0.00004156823,0.00004200554,0.000026957465,0.0057048574,0.97933215,0.0031674684,0.0006161719,0.00002742562,0.010307184],"study_design_scores_gemma":[0.00047651405,0.000052884683,0.00036761002,0.00047489177,0.00003779191,0.0004917119,0.0012826149,0.9960704,0.00009382282,0.00042858178,0.000021400472,0.00020178415],"about_ca_topic_score_codex":0.00004721564,"about_ca_topic_score_gemma":0.000002330622,"teacher_disagreement_score":0.50070965,"about_ca_system_score_codex":0.000051175146,"about_ca_system_score_gemma":0.000075008626,"threshold_uncertainty_score":0.75365776},"labels":[],"label_agreement":null},{"id":"W4386995867","doi":"10.1007/s11227-023-05657-7","title":"Data protection in internet of medical things using blockchain and secret sharing method","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Blockchain; Computer security; The Internet; Internet of Things; Secret sharing; Data sharing; Privacy protection; Internet privacy; World Wide Web; Cryptography","score_opus":0.074025589283162,"score_gpt":0.3339816888096673,"score_spread":0.2599560995265053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386995867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5249652,0.00011185693,0.47307828,0.0017241429,0.00004271738,0.000050926363,2.7930673e-7,0.000023004039,0.0000035742023],"genre_scores_gemma":[0.94244665,0.000025024785,0.057419084,0.00005803082,0.00004364132,4.359072e-7,3.5462756e-7,0.000005011382,0.000001761325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987174,0.00015644671,0.00047131744,0.00016485802,0.00033411186,0.0001558302],"domain_scores_gemma":[0.999021,0.0002562632,0.00020275656,0.00042263189,0.00005790651,0.000039426763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009468931,0.00007192632,0.00019021796,0.00026737078,0.000079459234,0.000030201796,0.0020834047,0.00010147621,0.0000022949062],"category_scores_gemma":[0.00024867323,0.000051970168,0.000021776174,0.00071899575,0.00006835777,0.00023373486,0.0019259737,0.00058085343,4.6288665e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005766652,0.00026308763,0.011080986,0.00033585945,0.0002422535,0.00016121934,0.06713998,0.009786034,0.03385584,0.08400464,0.00027562014,0.7927968],"study_design_scores_gemma":[0.00017965536,0.000027550563,0.0005389098,0.00017225172,0.0000070758206,0.00052925333,0.00036574423,0.98965114,0.00085359934,0.007566752,0.00005962922,0.000048410006],"about_ca_topic_score_codex":0.00037312167,"about_ca_topic_score_gemma":0.000015886257,"teacher_disagreement_score":0.97986513,"about_ca_system_score_codex":0.000021165833,"about_ca_system_score_gemma":0.00004985163,"threshold_uncertainty_score":0.3871519},"labels":[],"label_agreement":null},{"id":"W4387019446","doi":"10.1007/s11227-023-05645-x","title":"Temporal-order association-based dynamic graph evolution for recommendation","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Fundamental Research Funds for the Central Universities","keywords":"Computer science; Graph; Recommender system; Theoretical computer science; Information retrieval; Similarity (geometry); Data mining; Machine learning; Artificial intelligence","score_opus":0.018358752612374248,"score_gpt":0.27462802551169485,"score_spread":0.2562692728993206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387019446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03757994,0.00005004398,0.95139563,0.009733686,0.00082358794,0.0001854099,0.000002170301,0.00015312876,0.00007637414],"genre_scores_gemma":[0.95780575,0.000013450259,0.041768547,0.00019477913,0.00014745462,0.0000039431434,0.0000065331014,0.000011370431,0.000048150683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986812,0.00021887808,0.000514184,0.000106047744,0.00024720226,0.00023249997],"domain_scores_gemma":[0.99811643,0.00077928766,0.00047666207,0.00017821937,0.00041063197,0.000038764654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00467973,0.00009814023,0.0001800215,0.00027195332,0.0002936445,0.000105234656,0.0005521633,0.000061030565,0.0000030145438],"category_scores_gemma":[0.00017827081,0.000069583904,0.00012545679,0.0007627095,0.000009250422,0.00040300767,0.00006854417,0.0001769238,0.000005696274],"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.00015228987,0.0005945723,0.12927853,0.0005048845,0.0009860451,0.000027157676,0.011580677,0.04010444,0.015665248,0.022594256,0.22928685,0.54922503],"study_design_scores_gemma":[0.00072073535,0.00024017053,0.008395142,0.00013116252,0.000028127542,0.0000434723,0.0003609592,0.96935654,0.0005667832,0.014664091,0.005295992,0.00019683488],"about_ca_topic_score_codex":0.0000439325,"about_ca_topic_score_gemma":0.000015120303,"teacher_disagreement_score":0.9292521,"about_ca_system_score_codex":0.00025029384,"about_ca_system_score_gemma":0.00010268229,"threshold_uncertainty_score":0.28375494},"labels":[],"label_agreement":null},{"id":"W4387304729","doi":"10.1007/s11227-023-05669-3","title":"Performance modeling and quantitative evaluation for cyber-physical systems based on LTS","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Novelis (Canada)","funders":"Fundamental Research Funds for the Central Universities; Chinese Aeronautical Establishment; National Natural Science Foundation of China","keywords":"Computer science; Cyber-physical system; Probabilistic logic; Reliability (semiconductor); Software deployment; Model checking; Complex system; Distributed computing; Reliability engineering; Theoretical computer science; Artificial intelligence; Software engineering","score_opus":0.1274955694609024,"score_gpt":0.36929573885408246,"score_spread":0.24180016939318005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387304729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5088297,0.000029476865,0.49057582,0.00012464804,0.00025673714,0.00012984184,3.3301959e-7,0.000017740229,0.000035701018],"genre_scores_gemma":[0.8791855,0.000008357852,0.12062467,0.000029664892,0.00013889199,0.0000035679473,5.977602e-7,0.000006905435,0.0000018512422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986249,0.00033480607,0.0003077048,0.0001101864,0.00045853975,0.0001638561],"domain_scores_gemma":[0.9983639,0.0008670527,0.00017067385,0.00018653154,0.00037526284,0.00003657529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071848347,0.00008490979,0.00015115828,0.00015102583,0.00025047973,0.00007885414,0.00038873116,0.000025097032,1.4983634e-7],"category_scores_gemma":[0.0003798921,0.000056979377,0.00004493815,0.0003299466,0.000025672423,0.0004583063,0.00005440847,0.00015638772,0.0000037257116],"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.00003118744,0.000013074949,0.000056197463,0.0000310646,0.000008091828,2.815876e-7,0.0025027208,0.97071254,0.0009433928,0.0040550358,0.00001595334,0.021630485],"study_design_scores_gemma":[0.00032313156,0.0003423541,0.0007674222,0.00016481617,0.000019646903,0.000016589802,0.00045287836,0.99693996,0.0003799325,0.0005202379,0.0000066562257,0.000066354725],"about_ca_topic_score_codex":0.000004791933,"about_ca_topic_score_gemma":1.1607319e-7,"teacher_disagreement_score":0.3703558,"about_ca_system_score_codex":0.000056550176,"about_ca_system_score_gemma":0.000065468106,"threshold_uncertainty_score":0.24901347},"labels":[],"label_agreement":null},{"id":"W4388522269","doi":"10.1007/s11227-023-05753-8","title":"PCP–ACO: a hybrid deadline-constrained workflow scheduling algorithm for cloud environment","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Alberta","funders":"","keywords":"Computer science; Workflow; Cloud computing; Ant colony optimization algorithms; Distributed computing; Scheduling (production processes); Algorithm; Workflow management system; Job shop scheduling; Mathematical optimization; Operating system; Database; Computer network; Routing (electronic design automation)","score_opus":0.01936236161578111,"score_gpt":0.23588851900962005,"score_spread":0.21652615739383893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388522269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31633225,0.00025795805,0.6798995,0.0023345123,0.0008373749,0.0001749429,0.0000013340851,0.00011517709,0.000046964382],"genre_scores_gemma":[0.6739225,0.000040940493,0.3237245,0.00035024024,0.0017938317,0.0000025344627,0.0000015439293,0.000029642384,0.00013428784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976595,0.00018613967,0.0007485598,0.0002629422,0.00054735004,0.0005954957],"domain_scores_gemma":[0.9980754,0.0009114606,0.0003247983,0.00045084517,0.00009796906,0.00013950228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004085127,0.0002314186,0.00034345192,0.00024065548,0.00055218465,0.00017643998,0.0015978088,0.00004460567,0.0000038844732],"category_scores_gemma":[0.00008353557,0.00016230537,0.00028657966,0.00044935808,0.00008316369,0.00006276701,0.00070381496,0.00039100758,0.00003656346],"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.000009558199,0.000052433184,0.00004597717,0.000023174547,0.0001176504,0.000063801526,0.001410831,0.3711155,0.0003199353,0.00043084705,0.0008561915,0.6255541],"study_design_scores_gemma":[0.00076917873,0.00016858702,0.00015948317,0.00017846376,0.00003970481,0.00032239466,0.0005052241,0.9919509,0.00037711044,0.0019417125,0.0033841094,0.00020312419],"about_ca_topic_score_codex":0.000007246311,"about_ca_topic_score_gemma":1.6211042e-7,"teacher_disagreement_score":0.62535095,"about_ca_system_score_codex":0.00008663614,"about_ca_system_score_gemma":0.000062059415,"threshold_uncertainty_score":0.6618621},"labels":[],"label_agreement":null},{"id":"W4388565318","doi":"10.1007/s11227-023-05764-5","title":"ICS-IDS: application of big data analysis in AI-based intrusion detection systems to identify cyberattacks in ICS networks","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Computer science; Intrusion detection system; Data mining; Component (thermodynamics); Industrial control system; Artificial intelligence; Machine learning; Normalization (sociology); Curse of dimensionality; Control (management)","score_opus":0.038744956379112176,"score_gpt":0.3072545786417354,"score_spread":0.2685096222626232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388565318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44059065,0.000110668894,0.55837846,0.0002240384,0.0005537547,0.00011757352,8.0367454e-7,0.000019753745,0.000004286591],"genre_scores_gemma":[0.99873686,0.00006787748,0.0006581463,0.00011002255,0.00040837456,0.0000019866982,0.000006516116,0.0000088375855,0.0000013715304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974986,0.00050371833,0.0010104573,0.0002589784,0.00046315495,0.000265121],"domain_scores_gemma":[0.99831456,0.00043337067,0.00037972743,0.00059944944,0.00020620164,0.00006669301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059320764,0.00012812819,0.00036176355,0.0012686545,0.00014395747,0.00012571116,0.0012166183,0.00010727945,0.0000010442034],"category_scores_gemma":[0.000088941946,0.00010386939,0.000082332044,0.006743835,0.000026567208,0.00050141884,0.000531576,0.0005303229,0.00000464545],"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.00003461098,0.000036674235,0.004603089,0.000017790611,0.00003213799,0.000005518888,0.0006303829,0.8830893,0.0040510003,0.00003188448,0.000057423087,0.107410155],"study_design_scores_gemma":[0.0002649282,0.00008104349,0.017583946,0.00015500665,0.000043273336,0.00001647656,0.00020066649,0.98053527,0.0008074324,0.00011600187,0.00009706903,0.00009887307],"about_ca_topic_score_codex":0.0008529919,"about_ca_topic_score_gemma":0.0011256572,"teacher_disagreement_score":0.55814624,"about_ca_system_score_codex":0.00012817196,"about_ca_system_score_gemma":0.000053330063,"threshold_uncertainty_score":0.4235671},"labels":[],"label_agreement":null},{"id":"W4389505752","doi":"10.1007/s11227-023-05826-8","title":"Exploring autoregression patterns for automatic vessel type classification","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Maritime Navigation and Safety","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"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":"Computer science; Autoregressive model; Univariate; Automatic Identification System; Identification (biology); Artificial intelligence; Multivariate statistics; Support vector machine; Trajectory; Domain (mathematical analysis); Machine learning; Pattern recognition (psychology); Usability; Data mining; Statistics; Mathematics","score_opus":0.14815110563556783,"score_gpt":0.2891017406939119,"score_spread":0.1409506350583441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389505752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9823354,0.00005961481,0.01606163,0.00031560354,0.0008756442,0.00008135291,0.0000016853905,0.00017397435,0.00009512095],"genre_scores_gemma":[0.9986848,0.00014535763,0.00080141437,0.000017649045,0.0003063264,0.0000017960703,0.0000057772068,0.000020290272,0.000016561788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931246,0.00003828029,0.00032069007,0.00003880336,0.00015008386,0.00013967448],"domain_scores_gemma":[0.9994241,0.00029105842,0.000059655464,0.00009399589,0.000092568676,0.000038649814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085216644,0.00007045643,0.00011517697,0.00009340899,0.00011413601,0.000023429517,0.00015478757,0.000026611222,0.000017421247],"category_scores_gemma":[0.000073392905,0.000049187558,0.000049407812,0.00023048196,0.000008732753,0.00019764747,0.000018971148,0.00015453178,0.000017751401],"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.00006159464,0.000052809017,0.007857742,0.0011176205,0.00022247064,0.000016249174,0.016416823,0.25792903,0.10369867,0.0009078002,0.019888526,0.5918307],"study_design_scores_gemma":[0.00024461152,0.000031489933,0.045055397,0.0002936864,0.000021986347,0.00002597088,0.0011217109,0.9502021,0.0015164185,0.00010674227,0.0013013862,0.00007849257],"about_ca_topic_score_codex":0.000001878502,"about_ca_topic_score_gemma":2.85808e-7,"teacher_disagreement_score":0.6922731,"about_ca_system_score_codex":0.000042412838,"about_ca_system_score_gemma":0.0000138345495,"threshold_uncertainty_score":0.20058104},"labels":[],"label_agreement":null},{"id":"W4390262813","doi":"10.1007/s11227-023-05846-4","title":"Exploring privacy measurement in federated learning","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Confidentiality; Information privacy; Privacy by Design; Field (mathematics); Data science; Computer security; Artificial intelligence","score_opus":0.21561942198453501,"score_gpt":0.2934067596087868,"score_spread":0.0777873376242518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390262813","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88636565,0.000183716,0.0986413,0.013780023,0.00048914924,0.00007598717,1.1871145e-7,0.00037323017,0.00009080915],"genre_scores_gemma":[0.9759048,0.00022804593,0.023715956,0.00004273713,0.00009149993,0.0000013287854,2.8513017e-7,0.00001267972,0.0000026665282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774337,0.0003282697,0.00057772105,0.00017069936,0.0007503893,0.00042952388],"domain_scores_gemma":[0.99769735,0.0004352344,0.00020790732,0.0014088356,0.00020276669,0.000047888156],"candidate_categories":["metaresearch","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.007300109,0.000133098,0.0002240565,0.00042520242,0.00028197689,0.00017475142,0.013527515,0.00004045516,0.0000020555424],"category_scores_gemma":[0.017818803,0.00009601672,0.00005682505,0.0015776765,0.00003889934,0.0012552757,0.02597179,0.00088000833,0.000028190942],"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.00007891381,0.0002239467,0.037382867,0.00015464213,0.00026419686,0.0009601366,0.019098282,0.068315,0.07857175,0.0010286688,0.034876835,0.75904477],"study_design_scores_gemma":[0.0010018861,0.00022626047,0.03576725,0.0009410234,0.000014802134,0.00037321274,0.0029511664,0.9235286,0.014076309,0.019210996,0.0015147864,0.00039367305],"about_ca_topic_score_codex":0.000037937527,"about_ca_topic_score_gemma":0.0000047452127,"teacher_disagreement_score":0.85521364,"about_ca_system_score_codex":0.00019447312,"about_ca_system_score_gemma":0.0000903392,"threshold_uncertainty_score":0.9918098},"labels":[],"label_agreement":null},{"id":"W4390590962","doi":"10.1007/s11227-023-05790-3","title":"Prism refraction search: a novel physics-based metaheuristic algorithm","year":2024,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Metaheuristic; Computer science; Algorithm; Test suite; Robustness (evolution); Suite; Benchmark (surveying); Heuristics; Prism; Test case; Machine learning; Optics","score_opus":0.033782771308699056,"score_gpt":0.2937976566970732,"score_spread":0.26001488538837414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390590962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015098499,0.0005197536,0.99563867,0.0009485997,0.0010622363,0.00011742601,0.0000016318785,0.000120921846,0.00008090573],"genre_scores_gemma":[0.19092873,0.000028354614,0.8082018,0.0001839147,0.00058446074,7.851073e-7,7.935958e-7,0.000024847803,0.00004630391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982686,0.00019615421,0.00046490633,0.00021095613,0.0005789047,0.0002804512],"domain_scores_gemma":[0.99808824,0.0010309248,0.00015457736,0.0003031835,0.00032791804,0.000095171665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016616576,0.00017030833,0.0002251502,0.00019881852,0.00024676608,0.00025346281,0.0007543879,0.000044012333,0.0000058174114],"category_scores_gemma":[0.00014617998,0.00011684459,0.00014492376,0.00085396296,0.00007107369,0.0010428743,0.00015540532,0.0006786301,0.000024015964],"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.000010462191,0.00012778348,0.0000074505538,0.000029879582,0.00011211989,0.00007925999,0.0024220352,0.3982857,0.0073491363,0.0010040409,0.00009583958,0.5904763],"study_design_scores_gemma":[0.0003477062,0.00009706645,0.0001102767,0.00014307686,0.000036619247,0.00042333012,0.000117130425,0.9938705,0.0032548895,0.00088182953,0.0005856684,0.0001318838],"about_ca_topic_score_codex":0.000015391168,"about_ca_topic_score_gemma":2.011324e-7,"teacher_disagreement_score":0.5955848,"about_ca_system_score_codex":0.00018153687,"about_ca_system_score_gemma":0.00023964475,"threshold_uncertainty_score":0.4764784},"labels":[],"label_agreement":null},{"id":"W4391926338","doi":"10.1007/s11227-024-05912-5","title":"Meta generative image and text data augmentation optimization","year":2024,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Discriminator; Computer science; Generator (circuit theory); Generative grammar; Artificial intelligence; Machine learning; Intuition; Domain (mathematical analysis); Generative model; Image (mathematics); Data mining; Pattern recognition (psychology); Mathematics","score_opus":0.06707860647216189,"score_gpt":0.2854487057895803,"score_spread":0.2183700993174184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391926338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002810393,0.0049257013,0.98889893,0.002789932,0.00039914236,0.000057310997,0.0000026094983,0.00001915944,0.00009683782],"genre_scores_gemma":[0.50223565,0.00039742532,0.49664542,0.00019271573,0.00049062254,2.800676e-7,0.0000031199872,0.00000845441,0.00002633175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989856,0.0002688233,0.0002858285,0.00015261966,0.00019247632,0.000114691386],"domain_scores_gemma":[0.9991358,0.0003664262,0.00008661206,0.00025959525,0.00011162099,0.00003998064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016212751,0.000097249875,0.00016194489,0.00007490035,0.00018710448,0.00045745188,0.0006422242,0.000019398962,0.000020133519],"category_scores_gemma":[0.000048783466,0.000055768538,0.000047405196,0.00023079096,0.0000470692,0.0018836211,0.00036780408,0.00014983575,0.0000028342488],"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.000014685616,0.000035972927,0.000018363931,0.000033824497,0.0016849088,0.000050213617,0.008347887,0.79996467,0.021493556,0.0019526668,0.0068218126,0.15958144],"study_design_scores_gemma":[0.000085789485,0.000039282113,0.000031042666,0.000029802082,0.0003131103,0.00014062873,0.0002006096,0.99667907,0.0017549708,0.00030415232,0.0003566392,0.00006487877],"about_ca_topic_score_codex":0.000015808084,"about_ca_topic_score_gemma":0.0000018008986,"teacher_disagreement_score":0.49942523,"about_ca_system_score_codex":0.00001833002,"about_ca_system_score_gemma":0.000049181468,"threshold_uncertainty_score":0.4411219},"labels":[],"label_agreement":null},{"id":"W4394782655","doi":"10.1007/s11227-024-06083-z","title":"Human–machine co-creation: a complementary cognitive approach to creative character design process using GANs","year":2024,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Aesthetic Perception and Analysis","field":"Neuroscience","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Generative grammar; Process (computing); Character (mathematics); Animation; Human–computer interaction; Cognition; Context (archaeology); Engineering design process; Artificial intelligence; Engineering; Psychology","score_opus":0.11669932910017848,"score_gpt":0.39620487238372654,"score_spread":0.27950554328354804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394782655","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.764502,0.000052525385,0.23316379,0.00037153935,0.000052846997,0.00018156032,0.000014872619,0.000028772844,0.0016321193],"genre_scores_gemma":[0.9969448,0.000009941732,0.0016240493,0.0010584783,0.0002783964,0.0000013370366,0.0000039036413,0.000021008032,0.000058128957],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982321,0.00047944344,0.0004507108,0.00019428841,0.000422927,0.00022053074],"domain_scores_gemma":[0.99940526,0.00015845089,0.00012238373,0.000087323,0.00012574963,0.00010083647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011308288,0.00016078552,0.00025101943,0.00023155948,0.0004922589,0.00014118648,0.00029265505,0.000026017085,0.00022813334],"category_scores_gemma":[0.00007385602,0.00010300429,0.00011802313,0.0005052033,0.00012109959,0.00029864992,0.000048319307,0.00034354752,0.00005249956],"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.0003046121,0.0007114527,0.0014555289,0.00015525248,0.00018274039,0.00016969381,0.1597428,0.034793686,0.7789174,0.0005171269,0.00078200805,0.022267735],"study_design_scores_gemma":[0.0018942618,0.0009820707,0.0038530305,0.0021128599,0.0013192721,0.0054271496,0.06801194,0.84465736,0.06937789,0.0007889682,0.00062200136,0.00095317286],"about_ca_topic_score_codex":0.000017973782,"about_ca_topic_score_gemma":6.27851e-7,"teacher_disagreement_score":0.8098637,"about_ca_system_score_codex":0.00007634059,"about_ca_system_score_gemma":0.00006528688,"threshold_uncertainty_score":0.4200393},"labels":[],"label_agreement":null},{"id":"W4395695919","doi":"10.1007/s11227-024-06136-3","title":"An enhanced object detection network for ship target detection in SAR images","year":2024,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Object detection; Artificial intelligence; Robustness (evolution); Synthetic aperture radar; Computer vision; Deep learning; Precision and recall; Pattern recognition (psychology)","score_opus":0.016356276126645614,"score_gpt":0.2822543687340377,"score_spread":0.26589809260739206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395695919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22862214,0.0006472262,0.76957685,0.00025297658,0.0006235536,0.00017698888,4.8921214e-7,0.00008131076,0.000018478982],"genre_scores_gemma":[0.9108575,0.000041599113,0.087910324,0.00007947285,0.0010853005,0.0000040080668,4.3748878e-7,0.000016551396,0.000004824276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868,0.00018858832,0.00044662185,0.00019753168,0.00017871342,0.00030852164],"domain_scores_gemma":[0.9987225,0.0007374612,0.00012594255,0.0002514758,0.00010505801,0.000057573143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016230757,0.00012698503,0.00016973623,0.00013890644,0.00026915915,0.00014758598,0.00062845496,0.000048646678,0.0000013356339],"category_scores_gemma":[0.000050944127,0.00009399426,0.00009098092,0.000825245,0.000030225101,0.0009372362,0.00006540954,0.00041017222,0.0000034598831],"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.0000371602,0.000024654742,0.000036489113,0.000022245356,0.000016962229,0.000005526815,0.0011267699,0.36880624,0.19898766,0.00035503905,0.000053689135,0.43052757],"study_design_scores_gemma":[0.00020267046,0.00029028923,0.0009705277,0.00012471892,0.000015459897,0.00020559295,0.00011799655,0.79677254,0.17958471,0.021159178,0.00040874313,0.0001475502],"about_ca_topic_score_codex":0.000009766452,"about_ca_topic_score_gemma":0.00002899688,"teacher_disagreement_score":0.68223536,"about_ca_system_score_codex":0.0001087278,"about_ca_system_score_gemma":0.00004074225,"threshold_uncertainty_score":0.38329747},"labels":[],"label_agreement":null},{"id":"W4398142347","doi":"10.1007/s11227-024-06175-w","title":"Prudent carving: a progressively refining algorithm for shape reconstruction from dot patterns","year":2024,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"3D Shape Modeling and Analysis","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Carving; Refining (metallurgy); Computer science; Algorithm; Artificial intelligence; Engineering drawing; Computer graphics (images); Materials science; Engineering; Mechanical engineering; Metallurgy","score_opus":0.018022435222896056,"score_gpt":0.2437163095804618,"score_spread":0.22569387435756574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398142347","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6277733,0.0025607403,0.36874345,0.00010711529,0.00066832075,0.000030757426,0.00001208209,0.0000814743,0.000022751807],"genre_scores_gemma":[0.97342867,0.0001152497,0.025186013,0.00001588909,0.0012042074,0.0000015023604,0.000004047754,0.00003439193,0.00001004274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904245,0.00003750497,0.00044374054,0.000097233096,0.00018565942,0.00019340978],"domain_scores_gemma":[0.9994651,0.00023875257,0.00006159351,0.000090952366,0.000093204806,0.000050381073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063784583,0.00012794998,0.00021631646,0.00012877955,0.00009844134,0.00013657716,0.00019647162,0.000050308405,0.000019715544],"category_scores_gemma":[0.000021025457,0.000088177934,0.0001771493,0.00013097338,0.000015275493,0.0001721096,0.000028633522,0.00033309526,0.0000036366534],"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.0000033325023,0.000005643399,0.00042137655,0.000050402017,0.00030031233,0.000014764718,0.0021453793,0.07284866,0.0024596965,0.0000030397591,0.00008709643,0.9216603],"study_design_scores_gemma":[0.00014066693,0.000033759876,0.00013520954,0.000928086,0.00020012904,0.00020370218,0.0009298376,0.9961168,0.00089854165,0.00012582472,0.0001795913,0.000107864005],"about_ca_topic_score_codex":0.00003428423,"about_ca_topic_score_gemma":0.000004147554,"teacher_disagreement_score":0.92326814,"about_ca_system_score_codex":0.00007607171,"about_ca_system_score_gemma":0.000025585925,"threshold_uncertainty_score":0.35957918},"labels":[],"label_agreement":null},{"id":"W4399094989","doi":"10.1007/s11227-024-06190-x","title":"Simplified algorithms for order-based core maintenance","year":2024,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Trent University","funders":"","keywords":"Core (optical fiber); Computer science; Algorithm; Order (exchange); Business; Telecommunications","score_opus":0.08875001468785083,"score_gpt":0.34971537947116355,"score_spread":0.2609653647833127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399094989","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02025641,0.00047913674,0.97591734,0.0015158264,0.0015144795,0.00013911158,0.000001675847,0.00007307352,0.000102975246],"genre_scores_gemma":[0.31782258,0.0000099767585,0.68153363,0.00028281996,0.00031368196,0.0000012823347,4.0835002e-7,0.000011298164,0.00002433815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878937,0.000107037886,0.0004517236,0.00013367053,0.00026668198,0.00025154412],"domain_scores_gemma":[0.99828464,0.0008931852,0.00013578245,0.00029672397,0.00033473878,0.000054916272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036115493,0.00011049094,0.00016529385,0.000118361146,0.00017520599,0.00016410805,0.0011092924,0.00004245498,0.0000030773615],"category_scores_gemma":[0.0003530263,0.00006868698,0.00011187618,0.00049329654,0.00005515532,0.00042363757,0.00008711381,0.00028790443,0.000006984415],"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.00007870696,0.0000782654,0.00007543069,0.00026532178,0.0001054566,0.000041050058,0.0046947002,0.036443923,0.014069526,0.14259796,0.0053654546,0.7961842],"study_design_scores_gemma":[0.00022351508,0.00016719502,0.00014351086,0.00019723197,0.00001805651,0.0002339699,0.00012715968,0.98440534,0.0032049539,0.006020452,0.005162871,0.000095732],"about_ca_topic_score_codex":0.0000051570846,"about_ca_topic_score_gemma":3.994883e-7,"teacher_disagreement_score":0.94796145,"about_ca_system_score_codex":0.000071472336,"about_ca_system_score_gemma":0.00017197561,"threshold_uncertainty_score":0.28009737},"labels":[],"label_agreement":null},{"id":"W4399181523","doi":"10.1007/s11227-024-06245-z","title":"Real-time RSS-based target localization for UWSNs using an IDE-BP neural network","year":2024,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"RSS; Artificial neural network; Computer science; Artificial intelligence; World Wide Web","score_opus":0.030396351860016185,"score_gpt":0.26485455883898684,"score_spread":0.23445820697897066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399181523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.438636,0.0007062397,0.56010747,0.0001006755,0.00022473311,0.000085832726,0.0000017046633,0.000095979325,0.000041347022],"genre_scores_gemma":[0.98189,0.000023529974,0.01709981,0.000055855777,0.00087006,6.608057e-7,0.0000065699983,0.000045795692,0.00000772394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989789,0.00013841475,0.00046565165,0.00006201717,0.00014512576,0.00020985087],"domain_scores_gemma":[0.99939454,0.00022017628,0.0000578639,0.00017406736,0.000096126685,0.00005725771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011411192,0.00011255643,0.00017849078,0.000068685295,0.0001922051,0.00014066599,0.0002922184,0.00004655831,0.0000113651],"category_scores_gemma":[0.0000030460355,0.00008123902,0.000091294736,0.00019821509,0.000019783341,0.00026142868,0.000026290198,0.00017683727,0.0000028705208],"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.000008888204,0.0000070807073,0.00015956491,0.000058039648,0.00003483509,0.0000019108188,0.0007868177,0.9696103,0.027306894,0.000019786157,0.00023099926,0.001774917],"study_design_scores_gemma":[0.00014450018,0.000053832624,0.000028190807,0.00024108328,0.00004068824,0.00009468827,0.00021043408,0.99497795,0.001747441,0.00027394938,0.002091553,0.00009570891],"about_ca_topic_score_codex":0.0000314878,"about_ca_topic_score_gemma":0.0000025274605,"teacher_disagreement_score":0.543254,"about_ca_system_score_codex":0.00007525488,"about_ca_system_score_gemma":0.000033400513,"threshold_uncertainty_score":0.33128312},"labels":[],"label_agreement":null},{"id":"W4403636947","doi":"10.1007/s11227-024-06525-8","title":"Cooperative, collaborative, coevolutionary multi-objective optimization on CPU-GPU multi-core","year":2024,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Multi-core processor; Parallel computing; Core (optical fiber); Many core; CUDA; Computational science","score_opus":0.028781018083377546,"score_gpt":0.2976588001028732,"score_spread":0.26887778201949564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403636947","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003299866,0.0016534153,0.9921879,0.0006064171,0.001434622,0.00040414432,0.000014477098,0.00018717708,0.00021196171],"genre_scores_gemma":[0.2973056,0.00023121531,0.70158726,0.00031426386,0.00029764933,0.00000494453,0.000005491498,0.000044499902,0.00020903072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997411,0.00048041533,0.00074219366,0.00040244416,0.0005848362,0.00037909485],"domain_scores_gemma":[0.99670714,0.0009837669,0.0002950639,0.0003651727,0.0015056517,0.00014317826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011742092,0.00034288736,0.00037786682,0.0004342617,0.0006103757,0.00026645427,0.00088001083,0.00010490914,0.000023965531],"category_scores_gemma":[0.00036388755,0.00023957678,0.00013800907,0.0018688632,0.00018871689,0.0016192655,0.00026895574,0.0007772664,0.000038545997],"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.00003698656,0.00018224693,0.000067597524,0.000013188192,0.00010441851,0.000068926034,0.005552691,0.9860325,0.0007846233,0.0016338325,0.00030792493,0.0052150744],"study_design_scores_gemma":[0.001075771,0.00031957807,0.0005781512,0.00028811756,0.000028972854,0.00034983983,0.0012485221,0.9946756,0.0007714749,0.0000835484,0.00030795456,0.00027247905],"about_ca_topic_score_codex":0.000009951956,"about_ca_topic_score_gemma":0.000004936693,"teacher_disagreement_score":0.29400575,"about_ca_system_score_codex":0.00042424732,"about_ca_system_score_gemma":0.00045159532,"threshold_uncertainty_score":0.9769658},"labels":[],"label_agreement":null},{"id":"W4403659146","doi":"10.1007/s11227-024-06499-7","title":"Enhancing Chinese comprehension and reasoning for large language models: an efficient LoRA fine-tuning and tree of thoughts framework","year":2024,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Topic Modeling","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Sichuan Province Science and Technology Support Program","keywords":"Computer science; Comprehension; Tree (set theory); Artificial intelligence; Natural language processing; Theoretical computer science; Programming language","score_opus":0.017503935983843675,"score_gpt":0.2834888811719226,"score_spread":0.2659849451880789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403659146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49651808,0.003802624,0.49932995,0.00009883708,0.00016724179,0.000052241456,6.45122e-7,0.000021457225,0.000008950868],"genre_scores_gemma":[0.7797329,0.00003194686,0.21987662,0.000033951736,0.00030997995,2.848094e-7,3.0083942e-7,0.000011710107,0.0000023473262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987444,0.00012522002,0.0004516931,0.00019599857,0.00024579852,0.00023684892],"domain_scores_gemma":[0.9985091,0.00093587535,0.00013277544,0.00024302781,0.00009919679,0.00008002515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017362487,0.00014091289,0.00027802138,0.0001405508,0.00021134573,0.00014704633,0.0003733229,0.000056965757,5.981859e-7],"category_scores_gemma":[0.00012197132,0.000090321846,0.0000644232,0.00021102445,0.000026694093,0.00044817443,0.00028638032,0.00033803433,1.2999826e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009985616,0.00014607726,0.0010750236,0.0008983092,0.00016156283,0.000102797945,0.2755671,0.4022655,0.09213939,0.054607715,0.000019141684,0.17291752],"study_design_scores_gemma":[0.00022996956,0.00009540049,0.00022476545,0.001223577,0.000024966426,0.0002303483,0.0014930599,0.9914195,0.0010291733,0.003924894,0.000007274419,0.00009707325],"about_ca_topic_score_codex":0.000015650001,"about_ca_topic_score_gemma":0.000011686623,"teacher_disagreement_score":0.589154,"about_ca_system_score_codex":0.00002065967,"about_ca_system_score_gemma":0.00003891844,"threshold_uncertainty_score":0.36832178},"labels":[],"label_agreement":null},{"id":"W4404610787","doi":"10.1007/s11227-024-06608-6","title":"The Jacobsthal–Padovan–Fibonacci p-sequence and its application in the concise representation of vibrating systems with dual proximal groups","year":2024,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Fibonacci number; Computer science; Representation (politics); Sequence (biology); Dual (grammatical number); Arithmetic; Theoretical computer science; Algorithm; Combinatorics; Mathematics","score_opus":0.020219136181311697,"score_gpt":0.2941316481985342,"score_spread":0.2739125120172225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404610787","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.850817,0.000783663,0.14712746,0.0005321329,0.000033417873,0.00036254997,0.0000035711023,0.000005934851,0.00033423599],"genre_scores_gemma":[0.998963,0.000017436405,0.0007644153,0.000007850591,0.00021589002,0.000014296765,0.0000012897193,0.000008217963,0.000007632472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991247,0.00010718526,0.00039025227,0.00007937334,0.00018393209,0.00011453505],"domain_scores_gemma":[0.9983181,0.0012604755,0.00018603026,0.0001292349,0.00008688361,0.000019329413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009861668,0.00007818403,0.00013494455,0.000019873038,0.00021303631,0.00008053041,0.00017940075,0.000012675874,0.0000013637178],"category_scores_gemma":[0.000021532527,0.00003397677,0.000032460302,0.00024731422,0.00008581007,0.00018681394,0.000037741072,0.00022100458,7.7078886e-7],"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.000034386838,0.000040746585,0.0009985326,0.00008838534,0.000053107688,0.000002369704,0.0060095135,0.007471559,0.013417134,0.952466,0.000012005454,0.019406265],"study_design_scores_gemma":[0.0009737818,0.00032051184,0.0018859876,0.0014511338,0.00024234636,0.0005674575,0.11266964,0.6609266,0.0077099497,0.21235612,0.0005363774,0.00036009538],"about_ca_topic_score_codex":0.000026480639,"about_ca_topic_score_gemma":0.0000011749747,"teacher_disagreement_score":0.74010986,"about_ca_system_score_codex":0.0000114124,"about_ca_system_score_gemma":0.000026840587,"threshold_uncertainty_score":0.16385247},"labels":[],"label_agreement":null},{"id":"W4405230030","doi":"10.1007/s11227-024-06722-5","title":"An AI-driven social media recommender system leveraging smartphone and IoT data","year":2024,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Digital Marketing and Social Media","field":"Social Sciences","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Henan Provincial Science and Technology Research Project","keywords":"Computer science; Social media; Recommender system; Domain (mathematical analysis); Context (archaeology); Encoder; Data science; Internet of Things; Information retrieval; World Wide Web; Artificial intelligence","score_opus":0.07660188432227857,"score_gpt":0.3408339851137664,"score_spread":0.26423210079148785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405230030","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98394626,0.0011555565,0.000775558,0.0067537483,0.0027193073,0.00007171187,0.000011465413,0.00010905895,0.0044573224],"genre_scores_gemma":[0.9951673,0.00007543187,0.00038863817,0.00015523993,0.0041739387,1.7409893e-7,0.0000034097036,0.000017817374,0.000018052999],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99789697,0.0008137201,0.00036671374,0.00014653783,0.0004819128,0.0002941656],"domain_scores_gemma":[0.9978382,0.0016721075,0.000094145,0.00014172935,0.000111197936,0.00014264123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006853543,0.00010483989,0.00022800364,0.000086205866,0.000868232,0.00047803292,0.0006769858,0.00007400209,0.000012973099],"category_scores_gemma":[0.0005126899,0.000076183445,0.000050916064,0.0002500547,0.00021809136,0.00057532056,0.00016574448,0.00045053524,0.0000049887976],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050965285,0.000058932426,0.0027867171,0.00016894744,0.0001956258,0.00011327984,0.5410026,0.00005249452,0.00031053304,0.0055790017,0.013340866,0.4363401],"study_design_scores_gemma":[0.0010093403,0.0001604824,0.010983295,0.0026726818,0.0004988631,0.00040542945,0.88247263,0.03842663,0.00003079874,0.0035471525,0.05894899,0.00084372156],"about_ca_topic_score_codex":0.00025221944,"about_ca_topic_score_gemma":0.00015543867,"teacher_disagreement_score":0.43549636,"about_ca_system_score_codex":0.0001168381,"about_ca_system_score_gemma":0.00022052728,"threshold_uncertainty_score":0.6677826},"labels":[],"label_agreement":null},{"id":"W4405384256","doi":"10.1007/s11227-024-06803-5","title":"Publisher Correction: Cooperative, collaborative, coevolutionary multi-objective optimization on CPU-GPU multi-core","year":2024,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Core (optical fiber); Multi-core processor; Parallel computing; Many core; Telecommunications","score_opus":0.041707348238248565,"score_gpt":0.3120371033853171,"score_spread":0.27032975514706853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405384256","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009780795,0.0011451178,0.9890103,0.0013043763,0.0063082213,0.00033919263,0.0000037721459,0.00013138006,0.0007795605],"genre_scores_gemma":[0.25633365,0.00035754166,0.73847014,0.00046804632,0.0008083333,0.000009826159,0.000012342521,0.00006747115,0.0034726802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969066,0.0007727422,0.0007233383,0.00034517213,0.0008972439,0.00035491274],"domain_scores_gemma":[0.99582195,0.0012979549,0.00021019383,0.00036582013,0.0021381385,0.00016593274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025008677,0.000252383,0.00032155114,0.00054231193,0.00058571954,0.00079299335,0.000978962,0.00009983768,0.0000875955],"category_scores_gemma":[0.00091238285,0.00017141287,0.00011190822,0.0025144734,0.00016206889,0.0017172828,0.00028237514,0.00091666327,0.000047845973],"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.00003507379,0.000187036,0.00011254072,0.000015865793,0.000117818534,0.000060568764,0.0033578477,0.96599185,0.000089094014,0.0008794201,0.021358764,0.0077941315],"study_design_scores_gemma":[0.0006630564,0.00028064093,0.00054231135,0.00019720999,0.000022364766,0.00036448313,0.0008525957,0.99570465,0.000079901125,0.000048942504,0.0010615475,0.00018231486],"about_ca_topic_score_codex":0.000019774348,"about_ca_topic_score_gemma":0.000004750433,"teacher_disagreement_score":0.25535557,"about_ca_system_score_codex":0.00031860865,"about_ca_system_score_gemma":0.0007067339,"threshold_uncertainty_score":0.7646853},"labels":[],"label_agreement":null},{"id":"W4406228104","doi":"10.1007/s11227-024-06857-5","title":"Correction to: An AI-driven social media recommender system leveraging smartphone and IoT data","year":2025,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Impact of AI and Big Data on Business and Society","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Recommender system; Internet of Things; Social media; World Wide Web; Data science; Information retrieval","score_opus":0.20350800544375772,"score_gpt":0.4034992724894124,"score_spread":0.1999912670456547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406228104","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.930634,0.00016099711,0.056665488,0.0074467333,0.0047870646,0.000059812068,0.000016724318,0.000016609525,0.00021252326],"genre_scores_gemma":[0.99707645,0.000015888421,0.00090081815,0.0011851268,0.00077544875,9.0376965e-8,0.000005525551,0.000005692536,0.000034976652],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99798733,0.0003690332,0.0006301755,0.00018484352,0.00062663486,0.00020199695],"domain_scores_gemma":[0.99736035,0.0015768111,0.00020829734,0.00036368857,0.00039855487,0.00009227086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007304782,0.0001095911,0.00031120252,0.00016806617,0.00072446646,0.00041489417,0.0010987383,0.000049792525,0.000016178561],"category_scores_gemma":[0.0010902331,0.00006274202,0.00005481458,0.00058453466,0.00005319263,0.00062391046,0.000528765,0.00033710472,0.0000047116905],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015909733,0.00009185019,0.0149451485,0.00002758612,0.000108183354,0.000012846688,0.031351708,0.0010296202,0.0017331716,0.00018823038,0.3377952,0.61255735],"study_design_scores_gemma":[0.0023213655,0.00022526432,0.39840642,0.0011625066,0.00028151742,0.0008324013,0.24131192,0.32724983,0.0003549371,0.001250371,0.026004484,0.0005989808],"about_ca_topic_score_codex":0.00009676163,"about_ca_topic_score_gemma":0.000040583756,"teacher_disagreement_score":0.6119584,"about_ca_system_score_codex":0.000060226415,"about_ca_system_score_gemma":0.00011882987,"threshold_uncertainty_score":0.55720836},"labels":[],"label_agreement":null},{"id":"W4407633021","doi":"10.1007/s11227-025-07006-2","title":"Privacy-preserved federated clustering with Non-IID data via GANs","year":2025,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Cluster analysis; Data mining; Information retrieval; Database; Artificial intelligence","score_opus":0.03669382134284633,"score_gpt":0.28341439263806045,"score_spread":0.24672057129521413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407633021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17370915,0.00027300793,0.80313206,0.021795223,0.0004279026,0.00014793719,0.000003556515,0.00018759188,0.0003235721],"genre_scores_gemma":[0.7350191,0.0000431044,0.26451492,0.00029652423,0.00009106354,5.4844503e-7,0.0000041312715,0.000014784555,0.000015815589],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760973,0.00023299661,0.0007291621,0.00039357468,0.00052522,0.0005093133],"domain_scores_gemma":[0.98907834,0.0007099719,0.00036574123,0.009459401,0.0003092554,0.000077313874],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0029313602,0.00025397053,0.0003968111,0.000276012,0.0005266354,0.0004471743,0.06310246,0.00010232378,0.000006020809],"category_scores_gemma":[0.005400363,0.00016177646,0.000054057113,0.0011097777,0.00014713405,0.0018492977,0.13495082,0.00089770055,0.000006725835],"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.00078448793,0.00087044225,0.029329801,0.00073928206,0.002546836,0.0010924719,0.0042564236,0.018748257,0.08324183,0.0007281946,0.51276517,0.34489682],"study_design_scores_gemma":[0.00081465085,0.00013764219,0.0025588754,0.00061073696,0.000051209092,0.0004669275,0.0002467715,0.98325175,0.004706989,0.0062867412,0.0006456663,0.00022205709],"about_ca_topic_score_codex":0.0001005899,"about_ca_topic_score_gemma":0.00003696632,"teacher_disagreement_score":0.96450347,"about_ca_system_score_codex":0.000103365695,"about_ca_system_score_gemma":0.00024491933,"threshold_uncertainty_score":0.9419666},"labels":[],"label_agreement":null},{"id":"W4408271059","doi":"10.1007/s11227-025-07078-0","title":"A survey of SSD simulators and emulators","year":2025,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Springboard (Canada)","funders":"","keywords":"Computer science; Data science","score_opus":0.020345641292385357,"score_gpt":0.2800162098649732,"score_spread":0.25967056857258786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408271059","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6344187,0.0010389565,0.36411,0.00018891883,0.0001512487,0.00003391142,0.000001154726,0.00002766681,0.000029400697],"genre_scores_gemma":[0.9789257,0.000049636514,0.020942058,0.0000618177,0.000011872658,6.18108e-8,1.5893941e-7,0.0000037827967,0.000004884471],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99897385,0.00014383478,0.00044065362,0.00009993082,0.00018694793,0.00015481235],"domain_scores_gemma":[0.9980727,0.001078864,0.00022379255,0.0003880431,0.00020952948,0.000027087219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017601545,0.000095154326,0.0002483834,0.00020842519,0.00010498839,0.000031106487,0.0011537964,0.000043865417,6.948944e-7],"category_scores_gemma":[0.0006892936,0.00006230967,0.00003555562,0.0006585353,0.00014573199,0.00040998912,0.00071865646,0.0002535614,4.6504132e-7],"study_design_candidate":"observational","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.00010022016,0.00018625302,0.29713094,0.00017357909,0.00039192144,0.000056419438,0.005654733,0.061924275,0.009054384,0.04550901,0.0012568495,0.5785614],"study_design_scores_gemma":[0.0017573241,0.00046759567,0.58151895,0.00075609493,0.00008656273,0.00028381436,0.0016995219,0.36510512,0.018827092,0.028411884,0.0005913166,0.00049471937],"about_ca_topic_score_codex":0.00007070588,"about_ca_topic_score_gemma":0.000008363682,"teacher_disagreement_score":0.5780667,"about_ca_system_score_codex":0.000028008202,"about_ca_system_score_gemma":0.00006587365,"threshold_uncertainty_score":0.25409144},"labels":[],"label_agreement":null},{"id":"W4409121959","doi":"10.1007/s11227-025-07132-x","title":"SPINEX-symbolic regression: similarity-based symbolic regression with explainable neighbors exploration","year":2025,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Evolutionary Algorithms and Applications","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 Manitoba","funders":"Clemson University","keywords":"Symbolic regression; Computer science; Similarity (geometry); Regression; The Symbolic; Regression analysis; Symbolic data analysis; Artificial intelligence; Theoretical computer science; Machine learning; Statistics; Mathematics; Genetic programming","score_opus":0.01733863392500166,"score_gpt":0.26642008987218996,"score_spread":0.2490814559471883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409121959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11054438,0.000756881,0.8734838,0.014157534,0.00026274132,0.0001922063,6.9243026e-7,0.00007036543,0.0005313949],"genre_scores_gemma":[0.9128422,0.000064809814,0.08595091,0.0007142885,0.00027983662,0.0000064753217,0.0000027276628,0.000012235027,0.00012650782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998228,0.00023024016,0.0005470308,0.00022172478,0.0004641837,0.000308787],"domain_scores_gemma":[0.99829775,0.0003148206,0.00033127982,0.00056852447,0.00038951988,0.00009811266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011405364,0.00020814447,0.0002891422,0.0002654698,0.00088015356,0.00014439673,0.0011313782,0.00007355918,0.0000072245025],"category_scores_gemma":[0.000056056677,0.000116960095,0.000098805205,0.0011417542,0.0000903779,0.0009994231,0.00020634063,0.00046130506,0.0000038023056],"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.00052405964,0.0021793758,0.011937817,0.0004847779,0.00045540734,0.00028215963,0.017524386,0.41170028,0.025493313,0.3149216,0.033036508,0.18146034],"study_design_scores_gemma":[0.0021709977,0.00043754803,0.0070424424,0.0023426036,0.000104017905,0.00033381482,0.002143391,0.9483478,0.009626905,0.021056619,0.0059230053,0.000470873],"about_ca_topic_score_codex":0.0000257799,"about_ca_topic_score_gemma":0.0000032107575,"teacher_disagreement_score":0.80229783,"about_ca_system_score_codex":0.000097069984,"about_ca_system_score_gemma":0.00034397258,"threshold_uncertainty_score":0.6769518},"labels":[],"label_agreement":null},{"id":"W4409229075","doi":"10.1007/s11227-025-07176-z","title":"Synergizing spintronics and quaternary logic: a hardware accelerator for neural networks with optimized quantization algorithm","year":2025,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut interdisciplinaire d'innovation technologique; Université de Sherbrooke","funders":"","keywords":"Computer science; Quantization (signal processing); Spintronics; Artificial neural network; Computer architecture; Algorithm; Artificial intelligence; Physics","score_opus":0.013886908048315258,"score_gpt":0.24550396923516007,"score_spread":0.23161706118684483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409229075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38974482,0.0013977219,0.60829854,0.000094780466,0.00030538088,0.00010672574,4.839065e-7,0.000042490694,0.000009025096],"genre_scores_gemma":[0.94846326,0.00014640618,0.05088114,0.00013472368,0.00034237813,0.000001065795,0.0000012840399,0.000023253404,0.0000065103386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999146,0.000055018845,0.00036681164,0.00009213292,0.00009216808,0.0002478855],"domain_scores_gemma":[0.99923503,0.0004178713,0.00009822622,0.00009102949,0.00011439474,0.000043432337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043551248,0.00015924452,0.00027021772,0.000076848155,0.0002482665,0.00004770353,0.00017816456,0.000046385914,0.0000010008243],"category_scores_gemma":[0.00003632647,0.00010305828,0.00005528984,0.0001685348,0.000033377117,0.00023936314,0.00005425465,0.00033710268,7.699654e-8],"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.00008296523,0.0000053298827,0.00011829266,0.000047436926,0.00005459083,0.000007938829,0.00017307069,0.96751535,0.0012429424,0.000053459826,0.000027092112,0.030671526],"study_design_scores_gemma":[0.0008861755,0.00011875189,0.000119988064,0.00025515555,0.00006767272,0.00017106657,0.00037523793,0.99618125,0.0015370332,0.00012877984,0.000042248645,0.000116624375],"about_ca_topic_score_codex":0.0000015590011,"about_ca_topic_score_gemma":7.020384e-7,"teacher_disagreement_score":0.55871844,"about_ca_system_score_codex":0.000038868773,"about_ca_system_score_gemma":0.000015528543,"threshold_uncertainty_score":0.42025948},"labels":[],"label_agreement":null},{"id":"W4409839251","doi":"10.1007/s11227-025-07267-x","title":"Unveiling evasive malware behavior: toward generating a multi-sources benchmark dataset and evasive malware behavior profiling using network traffic and memory analysis","year":2025,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada); York University","funders":"Canada Research Chairs","keywords":"Computer science; Malware; Profiling (computer programming); Benchmark (surveying); Traffic analysis; Malware analysis; Computer security; Operating system","score_opus":0.029449059473584876,"score_gpt":0.28751207794697464,"score_spread":0.25806301847338975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409839251","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89975965,0.005113313,0.09418382,0.00010660714,0.00046668798,0.0003082821,0.000021456408,0.000036902013,0.0000033058398],"genre_scores_gemma":[0.9284175,0.00019609084,0.070736915,0.0001915322,0.00041415961,0.0000037117181,0.00002171836,0.000014109718,0.0000042736624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721295,0.0005531612,0.0009115969,0.00042853528,0.0004128225,0.00048092625],"domain_scores_gemma":[0.9981627,0.00051763124,0.00049991446,0.0003788593,0.00029522702,0.00014570059],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00236274,0.00031049742,0.0005722351,0.00043257032,0.0012411574,0.00043915317,0.0007041381,0.0001395853,0.000011047899],"category_scores_gemma":[0.000109701075,0.00024588255,0.00017480648,0.0013318693,0.00013520279,0.0007981009,0.0007286915,0.00074391096,5.106631e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000712321,0.00017830514,0.031337358,0.00015039857,0.00073963724,0.00019123832,0.011023442,0.8434782,0.0094304215,0.00006233639,0.00017965605,0.103157766],"study_design_scores_gemma":[0.0006000075,0.00012572453,0.006208349,0.0003703964,0.0016083902,0.00058599375,0.0032461737,0.9854385,0.001461362,0.000020140345,0.000034227123,0.00030072153],"about_ca_topic_score_codex":0.00008942784,"about_ca_topic_score_gemma":0.000071441704,"teacher_disagreement_score":0.14196031,"about_ca_system_score_codex":0.00009791516,"about_ca_system_score_gemma":0.00013015293,"threshold_uncertainty_score":0.99999934},"labels":[],"label_agreement":null},{"id":"W4409946973","doi":"10.1007/s11227-025-07271-1","title":"Network intrusion detection based on feature fusion of attack dimension","year":2025,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"China Scholarship Council; Natural Science Foundation of Fujian Province","keywords":"Computer science; Intrusion detection system; Dimension (graph theory); Intrusion; Feature (linguistics); Artificial intelligence; Pattern recognition (psychology); Fusion; Data mining; Computer security","score_opus":0.01198807964291903,"score_gpt":0.2387668699702351,"score_spread":0.22677879032731607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409946973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58404225,0.00035255853,0.41149884,0.0016937911,0.0019381103,0.0001069939,1.5219999e-7,0.000032639517,0.000334675],"genre_scores_gemma":[0.9931289,0.000051057566,0.0056100604,0.00079038047,0.0003929323,2.5994694e-7,3.067947e-7,0.0000062046684,0.000019919495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834627,0.00040185003,0.00047881316,0.0001446685,0.0004138883,0.00021448344],"domain_scores_gemma":[0.99844927,0.00053076283,0.00035216563,0.00035298435,0.00026984542,0.00004497586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019583758,0.00013966265,0.00024903007,0.00023055519,0.0004276316,0.00004764429,0.0006123434,0.000116542506,0.000006885444],"category_scores_gemma":[0.00008979365,0.000091606176,0.00013086307,0.0009862629,0.000043506054,0.0002617602,0.00024445044,0.0005972892,0.0000028506392],"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.0006472231,0.00018231587,0.00048075497,0.000071186325,0.000043190175,0.0000112851,0.0011103371,0.5197663,0.05063443,0.0015332806,0.0073902267,0.4181295],"study_design_scores_gemma":[0.0006821752,0.0007211133,0.0033752255,0.0010330642,0.000037305308,0.00006276155,0.00007227949,0.96123224,0.02836181,0.0017729593,0.0025207147,0.00012831949],"about_ca_topic_score_codex":0.000013287312,"about_ca_topic_score_gemma":0.0000074404875,"teacher_disagreement_score":0.441466,"about_ca_system_score_codex":0.00007443898,"about_ca_system_score_gemma":0.00006138199,"threshold_uncertainty_score":0.37355915},"labels":[],"label_agreement":null},{"id":"W4411240974","doi":"10.1007/s11227-025-07509-y","title":"Feasibility analysis and opposition white shark optimizer for optimizing modified EfficientNetV2 model for road crack classification","year":2025,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Infrastructure Maintenance and Monitoring","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Opposition (politics); Operations research; Artificial intelligence; Simulation; Mathematics","score_opus":0.026680699832149875,"score_gpt":0.27823488967042054,"score_spread":0.25155418983827066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411240974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39306796,0.00012213025,0.6062688,0.000086956556,0.00017794796,0.00018561789,0.0000052188198,0.000018554336,0.00006677816],"genre_scores_gemma":[0.9092813,0.000027095803,0.090476654,0.000032961856,0.00014086158,0.0000046777086,0.000005512495,0.000012683527,0.000018241473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990992,0.000028016579,0.00044396025,0.000112172704,0.000101083155,0.00021556116],"domain_scores_gemma":[0.99929774,0.00016683152,0.00009860222,0.00014747442,0.00025069542,0.00003865139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010252122,0.0001286052,0.00027128085,0.00021280046,0.00022645577,0.00007003383,0.00016434104,0.000065104796,7.549742e-7],"category_scores_gemma":[0.000060926635,0.00009630291,0.000169012,0.00025148792,0.00002742113,0.00017121166,0.000027836522,0.00016858157,5.813983e-8],"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.00008931485,0.000008403298,0.00039271114,0.00007059147,0.00019960958,1.1712611e-7,0.00086487946,0.98282754,0.010917755,0.000097904216,0.0000912951,0.0044398713],"study_design_scores_gemma":[0.0006116245,0.000020486032,0.0037701759,0.0000868283,0.00054249,0.0000046310406,0.00046639418,0.9923141,0.0017991698,0.00028884652,0.0000046132063,0.0000906189],"about_ca_topic_score_codex":0.000002727438,"about_ca_topic_score_gemma":0.0000017935718,"teacher_disagreement_score":0.51621336,"about_ca_system_score_codex":0.00012286587,"about_ca_system_score_gemma":0.000023267423,"threshold_uncertainty_score":0.39271185},"labels":[],"label_agreement":null},{"id":"W4415464680","doi":"10.1007/s11227-025-07970-9","title":"A quantum computing approach to model uncertainty in end-of-life prediction","year":2025,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Superposition principle; Process (computing); Noise (video); Computation; Quantum; Quantum computer; Quantum entanglement; Filter (signal processing); Uncertainty analysis","score_opus":0.019797886401757604,"score_gpt":0.25629616319236587,"score_spread":0.23649827679060825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415464680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45770976,0.00018644005,0.54082036,0.0006407577,0.00028307052,0.0000945638,0.0000010190633,0.000025690128,0.0002383163],"genre_scores_gemma":[0.90329796,0.000007509085,0.096127905,0.0004102351,0.00014130703,3.7439665e-7,4.760973e-7,0.000008600802,0.00000564468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756557,0.00030947852,0.0010460519,0.00024017201,0.00044704296,0.00039168634],"domain_scores_gemma":[0.9984013,0.00057203416,0.00030122933,0.00039443414,0.0002190492,0.00011196553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032312416,0.00019653146,0.00045899863,0.00052393175,0.00021445433,0.00007381073,0.001583988,0.000068907604,4.7629896e-7],"category_scores_gemma":[0.00022872219,0.00013701776,0.00014377414,0.0012630662,0.00006874909,0.00018125091,0.000605869,0.0006597646,7.2600915e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023852066,0.00009824876,0.0006538678,0.000042931664,0.000028511507,0.0000020545215,0.0055919806,0.96052015,0.0007149605,0.007286899,0.0001355174,0.024901045],"study_design_scores_gemma":[0.0004990482,0.00009372384,0.002884458,0.0004157696,0.000012718976,0.00006180659,0.0004593518,0.99211013,0.000106221974,0.0032040724,0.00004106046,0.000111618785],"about_ca_topic_score_codex":0.00010266277,"about_ca_topic_score_gemma":0.0000029759024,"teacher_disagreement_score":0.4455882,"about_ca_system_score_codex":0.00008734341,"about_ca_system_score_gemma":0.00037444744,"threshold_uncertainty_score":0.5587422},"labels":[],"label_agreement":null},{"id":"W7116858272","doi":"10.1007/s11227-025-08158-x","title":"LightIDS: a lightweight neural network-based intrusion detection system","year":2025,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Benchmark (surveying); Intrusion detection system; Block (permutation group theory); Artificial neural network; Supercomputer; Baseline (sea); Intrusion; Power (physics)","score_opus":0.008018972321483941,"score_gpt":0.21544715818538254,"score_spread":0.2074281858638986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116858272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34231701,0.00084060885,0.65195805,0.0010011113,0.0032907217,0.0001091323,9.95005e-8,0.00010831879,0.00037494377],"genre_scores_gemma":[0.99365336,0.000024018897,0.0048056166,0.0004942074,0.000998135,8.426554e-7,1.6329902e-7,0.0000076907445,0.000015992655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797326,0.0004984408,0.000680525,0.00016666514,0.00036100962,0.00032006926],"domain_scores_gemma":[0.9985429,0.00043051137,0.00032061702,0.00036402536,0.00027191575,0.00007001434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002099765,0.00016501434,0.00026926742,0.00024209064,0.0007346059,0.00018405405,0.0010081492,0.000098422635,0.000004393294],"category_scores_gemma":[0.00004780045,0.000107403146,0.00016568539,0.0010954469,0.000042137803,0.0004977663,0.0002620355,0.00057833776,0.000007685998],"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.00045906001,0.00018378523,0.0010952705,0.0002637282,0.00020387598,0.00009551989,0.002492743,0.3782017,0.02543165,0.017708851,0.0040031956,0.56986064],"study_design_scores_gemma":[0.0005047001,0.000245308,0.00069394364,0.00052659615,0.000039512415,0.00031778053,0.00010780301,0.9773313,0.015633445,0.0008100844,0.0036502003,0.00013931589],"about_ca_topic_score_codex":0.000020669306,"about_ca_topic_score_gemma":0.000011793034,"teacher_disagreement_score":0.6513363,"about_ca_system_score_codex":0.00015936214,"about_ca_system_score_gemma":0.000086883374,"threshold_uncertainty_score":0.5650069},"labels":[],"label_agreement":null}]}