{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14549014,0.00048822674,0.835554,0.001320385,0.00032410456,0.00010966265,0.00007600059,0.0020163876,0.014621151],"genre_scores_gemma":[0.42404577,0.0003764718,0.5711228,0.00015239412,0.00012689365,0.0000723561,0.00014970703,0.0004706037,0.0034830142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985934,0.00028612345,0.000096801,0.00014175527,0.0007661757,0.00011575932],"domain_scores_gemma":[0.99438727,0.0022459414,0.00043498204,0.0010157374,0.0017053224,0.00021085229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022236165,0.0008008239,0.0007237714,0.0013699789,0.00096707995,0.0027126367,0.0007451089,0.0011481905,0.00648],"category_scores_gemma":[0.014519222,0.00040838323,0.0003562117,0.0014655698,0.00055833143,0.0020833137,0.0011354651,0.0014460573,0.0009828719],"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.0009541572,0.00034372022,0.004538635,0.00036559964,0.00012279185,0.00031841628,0.00034352034,0.22790916,0.097623475,0.02488544,0.0062052705,0.6363898],"study_design_scores_gemma":[0.000116336196,0.00020771235,0.0008064411,0.00003491857,0.00007234743,0.0002735,0.0001545788,0.9375894,0.03952378,0.015441687,0.005759809,0.000019461317],"about_ca_topic_score_codex":0.0006239342,"about_ca_topic_score_gemma":0.00095681194,"teacher_disagreement_score":0.00648,"about_ca_system_score_codex":0.0005968013,"about_ca_system_score_gemma":0.001167767,"threshold_uncertainty_score":0.021677792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2087123,0.0012765229,0.7185464,0.0022559909,0.0003808995,0.00027256235,0.00031181643,0.00050968525,0.06773392],"genre_scores_gemma":[0.6087577,0.00079494424,0.3696758,0.00034068624,0.00018735608,0.00019081774,0.0003718935,0.00044251134,0.019238286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995573,0.00016085507,0.000020551664,0.00004990068,0.00013757378,0.00007381921],"domain_scores_gemma":[0.9986714,0.0008682943,0.00011898734,0.00009193305,0.00015058876,0.000098888304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009899857,0.0009814476,0.0011590978,0.0011707011,0.00068618124,0.0012590699,0.0011421818,0.001925071,0.010148119],"category_scores_gemma":[0.006693257,0.00062924536,0.0006968314,0.0011443387,0.0009807089,0.0012090505,0.0015646517,0.0012829816,0.00070387655],"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.00038160576,0.00028936449,0.00044291472,0.00025377696,0.000042725813,0.00015709325,0.0002122421,0.77523345,0.0060260044,0.1112572,0.0068097524,0.09889389],"study_design_scores_gemma":[0.00006927478,0.00008885256,0.00016474858,0.000015151384,0.000015444311,0.00004396382,0.000088095556,0.9671697,0.0010522407,0.029305525,0.0019751992,0.000011830389],"about_ca_topic_score_codex":0.0023027698,"about_ca_topic_score_gemma":0.0030578908,"teacher_disagreement_score":0.010148119,"about_ca_system_score_codex":0.0007922748,"about_ca_system_score_gemma":0.00074810494,"threshold_uncertainty_score":0.03394878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9828486,0.00012289647,0.013232433,0.0001721549,0.00010052783,0.000027505146,0.0001729367,0.0005741382,0.002748805],"genre_scores_gemma":[0.9931503,0.000055210116,0.0051377974,0.00003662777,0.000009444337,0.000022321776,0.0001016575,0.00011591252,0.0013707015],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973184,0.000041102256,0.000014682166,0.000048753704,0.000081821076,0.00008178628],"domain_scores_gemma":[0.99771845,0.0012051979,0.00015067437,0.0005128136,0.00022171454,0.0001911902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006000887,0.00044099765,0.0006333783,0.0004140141,0.00063856575,0.0006660891,0.0010277927,0.00055108755,0.0033930552],"category_scores_gemma":[0.0029873236,0.00029399386,0.00022143326,0.00058966974,0.0009562475,0.0012011937,0.00060897,0.0011621087,0.0002616372],"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.017381929,0.005536092,0.005715188,0.0006940905,0.0002186345,0.00079063023,0.0005252778,0.3230713,0.51896393,0.04832601,0.0067692,0.07200776],"study_design_scores_gemma":[0.0005967384,0.001439601,0.0012652026,0.000013180375,0.00004476994,0.0001025366,0.00012450844,0.74577487,0.24259399,0.0067996364,0.0012045978,0.00004037089],"about_ca_topic_score_codex":0.0021311855,"about_ca_topic_score_gemma":0.0010706354,"teacher_disagreement_score":0.0033930552,"about_ca_system_score_codex":0.00043196022,"about_ca_system_score_gemma":0.00063674105,"threshold_uncertainty_score":0.01135087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15917318,0.0005021465,0.8309482,0.0004950731,0.00023037246,0.000041693886,0.00018761453,0.0020964304,0.0063253427],"genre_scores_gemma":[0.42833626,0.00034477373,0.56380874,0.000090779184,0.00010197763,0.00007662029,0.00056221127,0.0001358944,0.0065427558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993438,0.00013532717,0.000065389715,0.00013851759,0.00022259436,0.00009433529],"domain_scores_gemma":[0.9987502,0.00058545155,0.00006870733,0.0002176969,0.00031395533,0.00006397104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005706849,0.0006375749,0.0008991346,0.0007488168,0.00058372616,0.001326815,0.001118736,0.00075469655,0.005285955],"category_scores_gemma":[0.0043763323,0.00028448078,0.00037843146,0.001706754,0.00047069628,0.0025520872,0.0010103721,0.0007015494,0.0016668164],"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.0015598628,0.00024856778,0.0044206185,0.00026623165,0.0001962358,0.00038716462,0.00023363215,0.27704737,0.04118204,0.036355503,0.010915087,0.62718767],"study_design_scores_gemma":[0.000108545006,0.00018956294,0.0009857231,0.000010669735,0.000031063926,0.00014507816,0.00012286301,0.96045685,0.017186629,0.017504172,0.003238311,0.000020433043],"about_ca_topic_score_codex":0.0029151372,"about_ca_topic_score_gemma":0.0060681337,"teacher_disagreement_score":0.005285955,"about_ca_system_score_codex":0.00057995954,"about_ca_system_score_gemma":0.0010770587,"threshold_uncertainty_score":0.017683268},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024376328,0.12471697,0.015828524,0.05257057,0.2059876,0.00014980302,0.002673866,0.0018223054,0.59381264],"genre_scores_gemma":[0.02295819,0.10812759,0.00673544,0.005648527,0.07251044,0.0001421391,0.0043622865,0.0022065118,0.7773088],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969319,0.00048347123,0.0002912682,0.0003387152,0.0017727583,0.00018182758],"domain_scores_gemma":[0.98986864,0.0016944216,0.0005939902,0.0019853485,0.004261336,0.0015962417],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002633681,0.001316218,0.0025911299,0.0032393134,0.0018017713,0.012401899,0.0014021785,0.0016835066,0.115669675],"category_scores_gemma":[0.009199742,0.0005705152,0.00051844254,0.006853014,0.002715865,0.0043660807,0.0030104723,0.0049410253,0.09916383],"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.000049514565,0.00005311322,0.00045722426,0.00039844646,0.000030305455,0.000040796243,0.00006336006,0.00038880762,0.00032059546,0.056980185,0.83775955,0.103458166],"study_design_scores_gemma":[0.00000786411,0.000009074031,0.00031094215,0.00009985192,0.000008316387,0.000046626352,0.000032193806,0.00032939055,0.000094372685,0.016596349,0.98245955,0.0000053972276],"about_ca_topic_score_codex":0.0024477676,"about_ca_topic_score_gemma":0.0024663787,"teacher_disagreement_score":0.88433033,"about_ca_system_score_codex":0.0018403312,"about_ca_system_score_gemma":0.0072964816,"threshold_uncertainty_score":0.3869536},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11344209,0.0033932354,0.87401855,0.005446027,0.00027161444,0.00018823156,0.00075102434,0.0002841824,0.0022050722],"genre_scores_gemma":[0.48406193,0.0049050753,0.49725792,0.0009047132,0.0016810044,0.0004907253,0.0033331502,0.00048611933,0.0068794135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940602,0.0026172502,0.0006602335,0.0011745256,0.0011805268,0.00030716363],"domain_scores_gemma":[0.9206271,0.067885704,0.0033152148,0.003675342,0.0028990316,0.0015974467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012668562,0.0017362011,0.006368267,0.0038076239,0.0025589166,0.004353508,0.0063880784,0.005034692,0.0033137249],"category_scores_gemma":[0.07987721,0.0018899154,0.002386879,0.006090108,0.0049610706,0.017246641,0.0064685596,0.003159091,0.00044352442],"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.00057618215,0.00034242918,0.004067657,0.0008756902,0.00029343113,0.00045214294,0.0007419596,0.6842487,0.0010456172,0.20401081,0.010247898,0.09309748],"study_design_scores_gemma":[0.00003657472,0.000048840036,0.00033612625,0.000028162525,0.000024915875,0.00008746841,0.00009360939,0.7870699,0.00016285632,0.21139036,0.0006977339,0.000023362545],"about_ca_topic_score_codex":0.009141881,"about_ca_topic_score_gemma":0.005661529,"teacher_disagreement_score":0.012668562,"about_ca_system_score_codex":0.0027350034,"about_ca_system_score_gemma":0.0015922838,"threshold_uncertainty_score":0.0669986},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59919196,0.0007201018,0.38287026,0.0005433999,0.00038561787,0.0001296462,0.00026460804,0.007054704,0.0088396445],"genre_scores_gemma":[0.81957155,0.000118898766,0.1769293,0.00007149731,0.000043457632,0.000052201947,0.00031925374,0.0004496051,0.002444301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989555,0.0002869624,0.00007078535,0.00011275407,0.0004250397,0.00014900722],"domain_scores_gemma":[0.9962464,0.0019688106,0.00012429418,0.000496126,0.00089424074,0.00026999548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022668475,0.0006474556,0.0011602024,0.0007430936,0.00088907004,0.0015084565,0.0018022723,0.0012650839,0.005346166],"category_scores_gemma":[0.0070561008,0.00036885645,0.0005108081,0.0012926654,0.00054396404,0.0019112781,0.0009294048,0.0011400362,0.0007967193],"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.0051242947,0.0012396785,0.0071901586,0.00023477862,0.00028605343,0.00041364468,0.0003399127,0.5251746,0.03742782,0.019850407,0.0085831005,0.3941355],"study_design_scores_gemma":[0.00008038579,0.000053312353,0.000283356,0.0000016233993,0.000009027778,0.00002158194,0.000012309995,0.9957838,0.0028708586,0.00061452703,0.00026094247,0.000008188932],"about_ca_topic_score_codex":0.012715426,"about_ca_topic_score_gemma":0.007905844,"teacher_disagreement_score":0.012715426,"about_ca_system_score_codex":0.00092871574,"about_ca_system_score_gemma":0.002116667,"threshold_uncertainty_score":0.02528286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9815555,0.00012300476,0.015033121,0.00018055407,0.00004379784,0.00003659,0.00012237807,0.00028803002,0.002616994],"genre_scores_gemma":[0.9978258,0.000038413877,0.0016549058,0.00001354442,0.0000039032266,0.000013144663,0.00004436764,0.000016124726,0.00038964837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956626,0.00014191003,0.000018161692,0.00004364299,0.00010766664,0.00012237564],"domain_scores_gemma":[0.99378055,0.0048982995,0.00030082092,0.00020025944,0.0006095189,0.00021053503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012600032,0.0006104242,0.0006506763,0.0009950759,0.0005951012,0.0006289896,0.0009859777,0.0010861281,0.0012939441],"category_scores_gemma":[0.0054712696,0.00037888324,0.00040658744,0.0007648093,0.0008797148,0.0007173595,0.00039985697,0.00087591074,0.00011819896],"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.00019230224,0.0001888612,0.0028889538,0.000017466631,0.00001716906,0.00005140793,0.000046971923,0.9914812,0.0015138125,0.001079339,0.00022144748,0.0023009947],"study_design_scores_gemma":[0.000005847962,0.000021216698,0.00025857706,7.399065e-7,0.0000032943979,0.000003658022,0.000007717903,0.9990422,0.0005654285,0.00007259747,0.000017101784,0.0000016012171],"about_ca_topic_score_codex":0.019407868,"about_ca_topic_score_gemma":0.0067523443,"teacher_disagreement_score":0.019407868,"about_ca_system_score_codex":0.0015429115,"about_ca_system_score_gemma":0.0008357518,"threshold_uncertainty_score":0.038589776},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3660207,0.00022521635,0.63095856,0.00040186924,0.00006941019,0.00007785808,0.00016295079,0.0005980415,0.0014853949],"genre_scores_gemma":[0.96090704,0.00007125975,0.03838622,0.000025975765,0.000026508713,0.000028671118,0.00009381087,0.000018156503,0.00044241187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943215,0.00015520124,0.000028832183,0.00016678953,0.0001426021,0.00007436283],"domain_scores_gemma":[0.9972656,0.0014529276,0.00029125734,0.00021687862,0.0005743352,0.00019908033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010948782,0.00038512604,0.00074085535,0.0016200166,0.0006667731,0.0009808826,0.0012184881,0.0008032577,0.00076029776],"category_scores_gemma":[0.006626467,0.00023242984,0.00048349358,0.00072386145,0.00079897733,0.0019114654,0.0011414797,0.00078900054,0.000101055906],"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.00095215,0.00042365972,0.06781861,0.00038154362,0.0004123291,0.0016385741,0.0010393938,0.46645218,0.044956807,0.20643182,0.006185238,0.2033077],"study_design_scores_gemma":[0.000004595699,0.000026256535,0.0014561559,0.0000027785889,0.000009119388,0.00007678522,0.000027225722,0.9856129,0.0010133818,0.011650807,0.00011021845,0.000009722844],"about_ca_topic_score_codex":0.0029575063,"about_ca_topic_score_gemma":0.0023176575,"teacher_disagreement_score":0.0029575063,"about_ca_system_score_codex":0.00066407636,"about_ca_system_score_gemma":0.00050597644,"threshold_uncertainty_score":0.0058805346},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16260003,0.00090840843,0.81767064,0.00090557564,0.00016012508,0.00010684753,0.00010841861,0.0004436303,0.017096393],"genre_scores_gemma":[0.95698535,0.0001980657,0.040065367,0.000092684684,0.000049759416,0.000057697056,0.000059627244,0.00009305489,0.0023984597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934703,0.00024944282,0.000015046439,0.00007755107,0.00015109919,0.0001599096],"domain_scores_gemma":[0.9907161,0.0075162253,0.00042388155,0.00032309297,0.0006592882,0.00036151792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002794366,0.0006434044,0.0010292302,0.000634777,0.00047856887,0.0011446832,0.0010281383,0.0009884095,0.0046862527],"category_scores_gemma":[0.01814388,0.00035824312,0.00034558662,0.0005119245,0.0016324929,0.0011805035,0.0011985741,0.0015768133,0.00023240657],"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.0004655147,0.00013947644,0.0006026727,0.000101931095,0.000024327315,0.00007139007,0.00009309263,0.94629914,0.001126313,0.032540996,0.0017364805,0.016798602],"study_design_scores_gemma":[0.000014503631,0.000016456992,0.000036323057,0.0000041336607,0.0000019310105,0.0000049861037,0.000007926155,0.9954764,0.00010694516,0.004253701,0.000074834476,0.0000019316517],"about_ca_topic_score_codex":0.0076083387,"about_ca_topic_score_gemma":0.0038207632,"teacher_disagreement_score":0.0076083387,"about_ca_system_score_codex":0.0008884595,"about_ca_system_score_gemma":0.0018035329,"threshold_uncertainty_score":0.015677094},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1419753,0.0002505558,0.85080916,0.00021869376,0.00015938647,0.000067124274,0.00056650996,0.0020469504,0.003906379],"genre_scores_gemma":[0.47245222,0.000104892446,0.5234966,0.000052998006,0.000059309517,0.0000858587,0.00077900285,0.0004917891,0.0024773804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999757,0.00007387706,0.000018076233,0.000054342563,0.00006544346,0.000031261057],"domain_scores_gemma":[0.9990858,0.0004909324,0.000058633595,0.00013360589,0.00019295566,0.000038135928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007536573,0.0007241274,0.00076173694,0.00088708586,0.00054386584,0.0005397347,0.0007345169,0.0008623821,0.0042741057],"category_scores_gemma":[0.0033389628,0.00059617904,0.0008559434,0.0015771248,0.00040465948,0.0008453831,0.0005124911,0.0007091704,0.00083865115],"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.00017085437,0.000056976798,0.0010921095,0.0000665242,0.000034517005,0.00003756596,0.00004808738,0.8782427,0.004552132,0.002512471,0.0014521168,0.111733966],"study_design_scores_gemma":[0.000007070161,0.000009013814,0.00017359684,0.0000018074313,0.0000027191977,0.0000050671138,0.000004124692,0.99827766,0.00076604745,0.00042749292,0.0003224997,0.0000027849508],"about_ca_topic_score_codex":0.02569518,"about_ca_topic_score_gemma":0.02621689,"teacher_disagreement_score":0.02569518,"about_ca_system_score_codex":0.00079335406,"about_ca_system_score_gemma":0.0019113955,"threshold_uncertainty_score":0.051091254},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10048182,0.00055908365,0.89350754,0.0002591045,0.00014384868,0.00008786445,0.0000790145,0.000662696,0.004219028],"genre_scores_gemma":[0.6241982,0.00027173932,0.37068036,0.00008989104,0.000042361455,0.00013280487,0.00018511034,0.00011328667,0.004286362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980754,0.000039345785,0.000013197803,0.000032744407,0.00006115396,0.00004600296],"domain_scores_gemma":[0.999765,0.00007221447,0.000025008352,0.000027732774,0.000086695465,0.000023448898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043127598,0.0004919825,0.00055402634,0.0005382359,0.00061699894,0.0004910661,0.0010174792,0.0003962668,0.0020673336],"category_scores_gemma":[0.0008284671,0.00024285953,0.00036409113,0.0005707485,0.00020656818,0.00054460607,0.00046036314,0.0004425603,0.00031473968],"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.00045662976,0.00017252668,0.00070437253,0.00012234558,0.000048263508,0.000081990074,0.00007522828,0.81366163,0.015968515,0.008048384,0.0029491358,0.15771104],"study_design_scores_gemma":[0.00003516998,0.000034100205,0.00011796022,0.0000026818382,0.0000074581594,0.000015671149,0.00000987697,0.9959001,0.0015616397,0.0017122297,0.0005993143,0.00000367476],"about_ca_topic_score_codex":0.003229657,"about_ca_topic_score_gemma":0.0052144807,"teacher_disagreement_score":0.003229657,"about_ca_system_score_codex":0.00048647998,"about_ca_system_score_gemma":0.0013804317,"threshold_uncertainty_score":0.006915927},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095845245,0.0010910159,0.8831657,0.0031486487,0.0004965317,0.0009165786,0.00015419273,0.0033021448,0.011879913],"genre_scores_gemma":[0.7263341,0.0006834311,0.26471454,0.00075281534,0.00015383911,0.0002535341,0.00017048359,0.00025097159,0.006686343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987992,0.00017339061,0.000083696745,0.00016078797,0.00047645127,0.00030639797],"domain_scores_gemma":[0.9980471,0.0002743866,0.00016698621,0.0005392083,0.0007602584,0.00021195879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017784307,0.0005988291,0.0006275393,0.00068013195,0.0017758023,0.004112557,0.0019948026,0.0013771377,0.0031089804],"category_scores_gemma":[0.0034184682,0.00058357685,0.00052233983,0.00045052724,0.0010087716,0.00477408,0.0033509585,0.0015984494,0.0014096079],"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.0013217987,0.0010349026,0.013408399,0.00072131504,0.00025637657,0.0011713346,0.00082803343,0.20999822,0.1860671,0.24432127,0.03847746,0.30239373],"study_design_scores_gemma":[0.00010155418,0.00029990473,0.0009804945,0.000072815645,0.00011539707,0.0003599306,0.00047011767,0.8420006,0.06723084,0.050306696,0.038002986,0.00005857327],"about_ca_topic_score_codex":0.0022941008,"about_ca_topic_score_gemma":0.0033945276,"teacher_disagreement_score":0.004112557,"about_ca_system_score_codex":0.0011932116,"about_ca_system_score_gemma":0.0028217365,"threshold_uncertainty_score":0.010400593},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86621904,0.0039698617,0.082769066,0.00079851475,0.00026279112,0.0002493893,0.0021627217,0.02081958,0.022749033],"genre_scores_gemma":[0.8877385,0.0009976572,0.100577325,0.00010014071,0.00006699729,0.00011247264,0.0035838503,0.0020884108,0.0047345953],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969675,0.0007056499,0.00015590871,0.00031717715,0.0015033307,0.00035049336],"domain_scores_gemma":[0.98833406,0.004565153,0.00047365186,0.0017702546,0.0043810694,0.00047586244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003263479,0.0008698306,0.0010996708,0.0027485185,0.0013571086,0.0022739724,0.002494685,0.0009950626,0.0031848883],"category_scores_gemma":[0.011757165,0.00044249638,0.0007618665,0.0062129283,0.00068830396,0.0020277482,0.0011139452,0.0007164467,0.00152784],"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.01027323,0.0012882741,0.040711276,0.0019617837,0.0010117919,0.00030214834,0.0014594676,0.33582437,0.033082314,0.01644488,0.034860156,0.52278036],"study_design_scores_gemma":[0.00040179564,0.0012831963,0.03243146,0.00010913187,0.00029822008,0.0002967182,0.001038992,0.9108663,0.036198623,0.0064987065,0.010435182,0.00014159962],"about_ca_topic_score_codex":0.015013282,"about_ca_topic_score_gemma":0.014403251,"teacher_disagreement_score":0.015013282,"about_ca_system_score_codex":0.0015399525,"about_ca_system_score_gemma":0.0026334643,"threshold_uncertainty_score":0.029851794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95588505,0.00072990614,0.03564967,0.0006057032,0.000114183385,0.00017546205,0.00018460762,0.0011485807,0.005506876],"genre_scores_gemma":[0.99242413,0.000077860444,0.0069871177,0.000024025823,0.000016041842,0.00003207146,0.00011282374,0.000034433324,0.0002915105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970452,0.0013970786,0.00022489893,0.00025604464,0.00082743,0.00024931176],"domain_scores_gemma":[0.9872327,0.007843722,0.000648665,0.0017750952,0.0019113497,0.0005883877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059876502,0.0007990908,0.00082985923,0.0012512036,0.0010715869,0.0010998013,0.0014139843,0.0008790332,0.0010094306],"category_scores_gemma":[0.013614943,0.0003322069,0.00027972946,0.0011621967,0.0010298613,0.0017159473,0.0013356787,0.0007482989,0.00015365233],"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.0048185955,0.0020208529,0.020326424,0.00040820328,0.00034648966,0.0003496836,0.0007826087,0.7685305,0.080111675,0.011193339,0.0038302708,0.10728147],"study_design_scores_gemma":[0.00009895086,0.0002975605,0.0019884375,0.000005464025,0.000035226407,0.00004650338,0.00009817913,0.9775033,0.018736057,0.00078450894,0.00038662215,0.000019167686],"about_ca_topic_score_codex":0.005249027,"about_ca_topic_score_gemma":0.0023946806,"teacher_disagreement_score":0.0059876502,"about_ca_system_score_codex":0.0018698268,"about_ca_system_score_gemma":0.0009713762,"threshold_uncertainty_score":0.03166604},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21424413,0.003859667,0.4539407,0.00095963455,0.0024055357,0.0006485452,0.0036872993,0.2933753,0.026879271],"genre_scores_gemma":[0.78265923,0.00039428408,0.19253987,0.00034506794,0.00021780562,0.00038397577,0.0038392402,0.0035198424,0.01610077],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995109,0.000064803884,0.000039065395,0.00008278375,0.00019563964,0.000106836],"domain_scores_gemma":[0.99882144,0.00023356554,0.000057227167,0.0005278456,0.00025733752,0.00010255164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004416784,0.0009916499,0.0008624257,0.0011994867,0.00094150164,0.001463489,0.0026216817,0.0006574102,0.008437784],"category_scores_gemma":[0.0027157834,0.00046833785,0.00036430208,0.0013327193,0.000515292,0.0016329305,0.0018294305,0.0012012675,0.0015684762],"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.0038238643,0.0006551513,0.0036530027,0.00037117253,0.00018212128,0.00046793697,0.00029308422,0.05367723,0.03365705,0.011049223,0.122227296,0.7699428],"study_design_scores_gemma":[0.0011052613,0.0005863508,0.0026453044,0.00007733842,0.000100761405,0.0004469677,0.000178488,0.8638199,0.08070953,0.015770141,0.034421504,0.00013846914],"about_ca_topic_score_codex":0.005901939,"about_ca_topic_score_gemma":0.0077263275,"teacher_disagreement_score":0.008437784,"about_ca_system_score_codex":0.0009419341,"about_ca_system_score_gemma":0.001579964,"threshold_uncertainty_score":0.02822721},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35482135,0.00094227016,0.6117998,0.000784752,0.00027905725,0.000054391498,0.0002869673,0.00116532,0.029866142],"genre_scores_gemma":[0.966815,0.00035471993,0.02609264,0.000078307,0.00007655673,0.000026605798,0.00015131658,0.00009706747,0.0063077984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996284,0.00011629746,0.000017885568,0.00006813837,0.00009159537,0.00007760665],"domain_scores_gemma":[0.99924004,0.0002402886,0.0000939954,0.0001853733,0.00017995221,0.000060386108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058040227,0.00031481052,0.0006518594,0.0006660475,0.0007992854,0.001023663,0.000689283,0.0004091829,0.0034660432],"category_scores_gemma":[0.0021721986,0.00024892998,0.00023922452,0.00096307334,0.00061676285,0.0017049155,0.00077441154,0.00033981228,0.00054760923],"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.0010875935,0.00006295219,0.001079664,0.0001797368,0.00005712059,0.00016019546,0.0001877431,0.61436826,0.0124484375,0.26121145,0.010788212,0.098368704],"study_design_scores_gemma":[0.00004108828,0.000060114744,0.00026291696,0.0000069514176,0.000016712393,0.000046014364,0.00003473555,0.8550673,0.0018283065,0.14003736,0.0025874136,0.000011050526],"about_ca_topic_score_codex":0.0016837447,"about_ca_topic_score_gemma":0.001896977,"teacher_disagreement_score":0.0034660432,"about_ca_system_score_codex":0.00058769534,"about_ca_system_score_gemma":0.0007404481,"threshold_uncertainty_score":0.01159507},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8389442,0.00007589621,0.15698764,0.0005535785,0.000014845259,0.000046145247,0.000061872124,0.00015373666,0.0031621149],"genre_scores_gemma":[0.987278,0.000024907311,0.011675978,0.00002122247,0.0000044455537,0.000034656445,0.00003359143,0.00001366126,0.00091355003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920624,0.0003891662,0.000046225978,0.00015100976,0.00010692042,0.000100464094],"domain_scores_gemma":[0.9855585,0.011888245,0.0006749923,0.0006072275,0.00086421415,0.00040674894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016661024,0.00050607725,0.00043613373,0.00057839736,0.00048350557,0.0019692155,0.0016009376,0.0015931042,0.003132168],"category_scores_gemma":[0.017076975,0.0005364461,0.00041011503,0.00050519913,0.0011932304,0.0031348013,0.001205476,0.0015833925,0.00024877884],"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.0004326023,0.00035681028,0.012197071,0.000041469364,0.000067549874,0.00015259255,0.00087185286,0.94053686,0.0015941816,0.0239539,0.00023409765,0.019561024],"study_design_scores_gemma":[0.00002735596,0.000029102332,0.0003353554,0.000002377943,0.000011211562,0.0000062657446,0.00006709114,0.99086994,0.00022248119,0.008369894,0.00005416749,0.0000046521604],"about_ca_topic_score_codex":0.010329064,"about_ca_topic_score_gemma":0.008793976,"teacher_disagreement_score":0.010329064,"about_ca_system_score_codex":0.0015676871,"about_ca_system_score_gemma":0.0011835666,"threshold_uncertainty_score":0.020537913},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026550615,0.00076288433,0.94273895,0.00056140625,0.00051011244,0.000709752,0.0001532734,0.014021625,0.01399145],"genre_scores_gemma":[0.5175592,0.0006514905,0.45507473,0.0005127748,0.00049010856,0.0007473805,0.0006393065,0.0008799565,0.023445096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985152,0.00047851488,0.00015667552,0.00023184707,0.00044430807,0.00017350639],"domain_scores_gemma":[0.99626046,0.00097119086,0.00042476732,0.0014869405,0.0004582723,0.0003983077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023420793,0.00064526295,0.0008663686,0.0013044582,0.0019687235,0.0026975423,0.0020170691,0.0018309236,0.0037991698],"category_scores_gemma":[0.0055365404,0.00059488945,0.00038992212,0.0009444103,0.0008822175,0.002786654,0.0025783633,0.0021282132,0.0020818163],"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.0022049379,0.0010577425,0.004034191,0.0004156536,0.00016870542,0.0009919199,0.001103534,0.012553807,0.06336897,0.1319074,0.03578076,0.7464124],"study_design_scores_gemma":[0.00042792625,0.0010582119,0.0035808885,0.00015842154,0.00027628033,0.0018491307,0.0005145363,0.56785965,0.129875,0.0702218,0.223962,0.0002161123],"about_ca_topic_score_codex":0.0015170093,"about_ca_topic_score_gemma":0.001802136,"teacher_disagreement_score":0.0037991698,"about_ca_system_score_codex":0.0005379764,"about_ca_system_score_gemma":0.0010309558,"threshold_uncertainty_score":0.012709498},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016960468,0.0011814095,0.97778374,0.0002920314,0.00034761938,0.00009721276,0.000040188588,0.0011222693,0.0021750263],"genre_scores_gemma":[0.76061165,0.0008215368,0.23335712,0.00046661185,0.00032932987,0.0003158717,0.000111493544,0.00010243682,0.0038839716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890924,0.0002525167,0.0000947418,0.0001428714,0.00048449807,0.000116014795],"domain_scores_gemma":[0.9978218,0.0010407352,0.00018001001,0.00027905687,0.000581136,0.000097293145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001461574,0.00068010564,0.0008965484,0.0006368349,0.0010991362,0.0008947154,0.0015964418,0.00068354607,0.00091842026],"category_scores_gemma":[0.0034548086,0.00029585103,0.00042480038,0.0005678859,0.0006976102,0.0013433198,0.0016726404,0.0016640218,0.00022451802],"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.0012640795,0.0005333392,0.0011034674,0.00045979605,0.00033665652,0.0006509679,0.00053641456,0.24775174,0.11283811,0.052558113,0.011143978,0.57082343],"study_design_scores_gemma":[0.000043830554,0.0001862009,0.00023281085,0.000014343026,0.00008310973,0.00023375593,0.000034714576,0.97010046,0.016464284,0.007969233,0.004590506,0.00004668765],"about_ca_topic_score_codex":0.0012846121,"about_ca_topic_score_gemma":0.0028672554,"teacher_disagreement_score":0.0015964418,"about_ca_system_score_codex":0.0005419385,"about_ca_system_score_gemma":0.00077677175,"threshold_uncertainty_score":0.0077296495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015150667,0.0003471715,0.9693996,0.00040170123,0.00020724883,0.000113163944,0.00013195716,0.0024080924,0.011840348],"genre_scores_gemma":[0.41746494,0.00032761184,0.56117374,0.00037983636,0.00034292426,0.00038504676,0.000616724,0.0016254078,0.01768377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961605,0.001086007,0.00024963488,0.0007455817,0.0013369968,0.00042121415],"domain_scores_gemma":[0.98940825,0.005149635,0.00039619787,0.0036834893,0.0010908569,0.00027157587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028320893,0.0013203167,0.0013778447,0.0017828004,0.0014679339,0.0025966996,0.0035489814,0.0011729001,0.017976325],"category_scores_gemma":[0.013477548,0.00085808185,0.00168952,0.0017914352,0.0026526847,0.0065472126,0.004754006,0.0031893402,0.0027858552],"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.0008476485,0.0003187938,0.0017750106,0.00034596192,0.00014847264,0.00017523371,0.00038013808,0.06796348,0.006784383,0.48656663,0.011957567,0.4227367],"study_design_scores_gemma":[0.0001060015,0.000066010114,0.00022355227,0.000029848585,0.000051415547,0.000083286715,0.00006751392,0.2869491,0.0054472014,0.7008592,0.0060901768,0.000026694137],"about_ca_topic_score_codex":0.0021318132,"about_ca_topic_score_gemma":0.0041929693,"teacher_disagreement_score":0.017976325,"about_ca_system_score_codex":0.0014610564,"about_ca_system_score_gemma":0.0020356684,"threshold_uncertainty_score":0.060136735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05228421,0.00046500718,0.6409623,0.000502208,0.0003214554,0.00022127402,0.0008064804,0.29515982,0.009277249],"genre_scores_gemma":[0.4770728,0.0004038334,0.4440135,0.00075738836,0.000445134,0.00045158583,0.005023191,0.061925843,0.009906592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661934,0.0006494721,0.00042488385,0.0005878943,0.0012238972,0.0004944534],"domain_scores_gemma":[0.9838938,0.006830784,0.0010360802,0.005098127,0.0024336975,0.0007073108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004559965,0.0014276643,0.0010393403,0.0014338222,0.0012002393,0.0036114273,0.004199952,0.0012728676,0.010860341],"category_scores_gemma":[0.017626785,0.0017313384,0.0013036142,0.0010862924,0.0009929361,0.003814443,0.002896785,0.0036814283,0.0051504555],"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.00820782,0.00093477225,0.011824764,0.0010115085,0.0004039676,0.0012015221,0.0018113648,0.013516936,0.19534452,0.044023663,0.10082524,0.6208939],"study_design_scores_gemma":[0.0024706633,0.00043554473,0.0071263923,0.00027995039,0.00039729252,0.00083482993,0.00019125563,0.54334724,0.27477622,0.05140246,0.11836232,0.00037577757],"about_ca_topic_score_codex":0.0022846807,"about_ca_topic_score_gemma":0.0026592757,"teacher_disagreement_score":0.010860341,"about_ca_system_score_codex":0.0007794938,"about_ca_system_score_gemma":0.0017549711,"threshold_uncertainty_score":0.036331475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014201233,0.00024268619,0.97373563,0.00022039817,0.00017715823,0.0002640332,0.00025947538,0.005357571,0.005541771],"genre_scores_gemma":[0.08896169,0.00014263215,0.9012891,0.00013794671,0.000097150056,0.00038814486,0.00067719945,0.00029441854,0.008011747],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916804,0.00010228449,0.00006314173,0.00018233799,0.00037401658,0.000110226305],"domain_scores_gemma":[0.9988164,0.00029711332,0.00008758213,0.00041043555,0.0003253692,0.000063036976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065374107,0.0013926778,0.0009880046,0.0012438275,0.0014729958,0.001397846,0.0012394352,0.0010308434,0.013408958],"category_scores_gemma":[0.0022241697,0.00060592464,0.0007768943,0.00141362,0.00065717904,0.0018210314,0.0016692025,0.0012933218,0.006655293],"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.0010723064,0.00041556385,0.0010699268,0.0002270576,0.000109393186,0.00037801615,0.00023794048,0.022778535,0.08440982,0.033645026,0.020880446,0.834776],"study_design_scores_gemma":[0.0009188387,0.00085917773,0.0018931974,0.00008243194,0.00018234337,0.0023574033,0.00022509383,0.6726335,0.18732698,0.08427648,0.049019385,0.00022513633],"about_ca_topic_score_codex":0.0028721087,"about_ca_topic_score_gemma":0.0069229277,"teacher_disagreement_score":0.013408958,"about_ca_system_score_codex":0.0007941823,"about_ca_system_score_gemma":0.0021779495,"threshold_uncertainty_score":0.044857442},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07503703,0.00082016893,0.89660263,0.0012645526,0.00014983637,0.00019053729,0.00056079624,0.0006588219,0.024715673],"genre_scores_gemma":[0.48590136,0.0019229662,0.48860198,0.00037816714,0.0003864468,0.00053696416,0.0016476096,0.0007633691,0.01986109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989072,0.00034409895,0.00009163401,0.0002152807,0.0003023872,0.00013937676],"domain_scores_gemma":[0.99333835,0.003875686,0.00070606935,0.0009926208,0.00079573184,0.00029149815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023372818,0.0009388989,0.00096089195,0.0018894811,0.0016437608,0.0045956364,0.0028902544,0.0015014805,0.0075734016],"category_scores_gemma":[0.011259765,0.00080249715,0.0014044686,0.0032712065,0.0019833115,0.008729356,0.002172973,0.0023874217,0.0012326263],"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.00035024664,0.00013389645,0.0014823271,0.00033136437,0.00006133174,0.00021842837,0.00044455734,0.14251992,0.0039048716,0.7633224,0.009770697,0.07746001],"study_design_scores_gemma":[0.000051493706,0.00006087043,0.0002907822,0.000038598137,0.00003515664,0.00018769923,0.00012933362,0.45095792,0.0018267357,0.5418051,0.0045908764,0.000025411426],"about_ca_topic_score_codex":0.002297797,"about_ca_topic_score_gemma":0.0023163909,"teacher_disagreement_score":0.0075734016,"about_ca_system_score_codex":0.0025079108,"about_ca_system_score_gemma":0.001670429,"threshold_uncertainty_score":0.02533555},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11499191,0.0002318837,0.88123006,0.00026057116,0.0000966025,0.000048825867,0.00021047151,0.00107922,0.0018503469],"genre_scores_gemma":[0.87683946,0.00011770413,0.12115567,0.000063162806,0.00004824537,0.000024414985,0.00024604797,0.00007452305,0.0014307778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985318,0.00020638345,0.00006796497,0.00023757557,0.0007033434,0.00025281828],"domain_scores_gemma":[0.9984641,0.00037820853,0.00014900738,0.0006632205,0.0002500626,0.000095424315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008011418,0.00034303745,0.0009510792,0.00061331695,0.0007750844,0.0015554441,0.0012107067,0.0010024608,0.0011767262],"category_scores_gemma":[0.0030548354,0.00034699033,0.0006694963,0.0014178036,0.00057041436,0.002715675,0.0023680078,0.0008202149,0.0005383485],"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.0024278269,0.0005449519,0.009086289,0.00017499541,0.00021331201,0.0008382207,0.00041494062,0.35400537,0.14191647,0.0366074,0.008119329,0.44565085],"study_design_scores_gemma":[0.000017370417,0.00003715994,0.00077570643,0.0000036095066,0.000014185071,0.00014642594,0.000061737606,0.9607191,0.030079864,0.0071410914,0.0009908222,0.000012968172],"about_ca_topic_score_codex":0.0034711391,"about_ca_topic_score_gemma":0.003336376,"teacher_disagreement_score":0.0034711391,"about_ca_system_score_codex":0.0006564974,"about_ca_system_score_gemma":0.0011142939,"threshold_uncertainty_score":0.0069018602},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010575981,0.00033088747,0.98138225,0.00043456195,0.00026070297,0.000059174326,0.00012711441,0.0016716613,0.005157646],"genre_scores_gemma":[0.13441098,0.00024591153,0.8509832,0.0003462757,0.00030934418,0.0002924115,0.00039868816,0.00081709214,0.012196013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991819,0.0003068728,0.00004108486,0.00008756457,0.00030676599,0.000075783915],"domain_scores_gemma":[0.9982868,0.0006911972,0.00009536498,0.00038907884,0.00042963214,0.000107976965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010368772,0.00086925935,0.0008725555,0.0008631324,0.0006827566,0.00090921146,0.0020553402,0.0010769387,0.009956676],"category_scores_gemma":[0.005015007,0.0004842671,0.0006761937,0.0012411618,0.0010090013,0.001336793,0.0020143047,0.001713301,0.0022692948],"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.00081597344,0.00020175976,0.001274883,0.0003481081,0.00011789982,0.00017852377,0.00023663674,0.50785136,0.007811792,0.071193084,0.022563733,0.38740623],"study_design_scores_gemma":[0.00007135011,0.000030007204,0.00010883099,0.000009183741,0.000008814693,0.000017387352,0.000021499938,0.97679865,0.0014124142,0.017279916,0.0042334357,0.00000863219],"about_ca_topic_score_codex":0.0073515307,"about_ca_topic_score_gemma":0.01702292,"teacher_disagreement_score":0.009956676,"about_ca_system_score_codex":0.0006823156,"about_ca_system_score_gemma":0.0014710929,"threshold_uncertainty_score":0.033308446},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12556228,0.069026366,0.6238538,0.011376259,0.0036607585,0.00028671377,0.0006562493,0.004161691,0.16141583],"genre_scores_gemma":[0.831426,0.028700167,0.121117555,0.00041647424,0.0009013881,0.00009225198,0.00041723912,0.0001233537,0.016805653],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999808,0.000031137326,0.000011731816,0.00002399717,0.000098869605,0.00002629759],"domain_scores_gemma":[0.9993604,0.00014589526,0.00006188255,0.00013531509,0.00023441053,0.00006210011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004772564,0.00037584951,0.00024380656,0.00072510244,0.00036074925,0.001127181,0.00052896095,0.0005442016,0.0062850458],"category_scores_gemma":[0.00097061944,0.00014505617,0.00022290167,0.0013972915,0.00054301164,0.001482856,0.0007626543,0.00064541673,0.0013592701],"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.00014621022,0.000093074355,0.003477515,0.0007851161,0.000044247834,0.00038386014,0.00026301356,0.051795408,0.03565956,0.2943391,0.030510617,0.5825023],"study_design_scores_gemma":[0.000042249285,0.00045273014,0.0063377433,0.00034605098,0.00010671127,0.00095925725,0.00044186242,0.27297473,0.03977602,0.274862,0.40363106,0.000069650516],"about_ca_topic_score_codex":0.0007319116,"about_ca_topic_score_gemma":0.00078705896,"teacher_disagreement_score":0.0062850458,"about_ca_system_score_codex":0.00046966548,"about_ca_system_score_gemma":0.0006607352,"threshold_uncertainty_score":0.021025538},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5365594,0.0058728606,0.32479423,0.003932904,0.0009243673,0.00009307784,0.0009610263,0.0003509796,0.12651119],"genre_scores_gemma":[0.95501554,0.002557526,0.025790889,0.00031623847,0.00083128054,0.00006669263,0.0004175236,0.00024034602,0.01476403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996357,0.00014219328,0.000013263512,0.00006567428,0.00009460298,0.00004852082],"domain_scores_gemma":[0.9980019,0.0011851686,0.00020741508,0.00011191798,0.00031632814,0.00017729751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069441966,0.00082898,0.0006838372,0.0021697897,0.000555477,0.001621979,0.0011151009,0.00081785134,0.0076573915],"category_scores_gemma":[0.0049788337,0.00035497095,0.00040293342,0.0012086389,0.0020232555,0.0027009784,0.0018167063,0.0015745568,0.0008185203],"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.00023254877,0.00004102835,0.0013801934,0.00015871943,0.000029128743,0.00013076239,0.00025223487,0.044870082,0.0042044395,0.90615886,0.005044091,0.03749788],"study_design_scores_gemma":[0.00002172938,0.000044475546,0.0013961999,0.000040242896,0.000015996164,0.00017560921,0.00014767061,0.21969815,0.0009617678,0.7708778,0.0065971883,0.000023247681],"about_ca_topic_score_codex":0.0014751512,"about_ca_topic_score_gemma":0.0008755127,"teacher_disagreement_score":0.0076573915,"about_ca_system_score_codex":0.0005509371,"about_ca_system_score_gemma":0.00025259316,"threshold_uncertainty_score":0.025616467},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2656841,0.0015892634,0.7267057,0.0004174148,0.00022009475,0.00005236186,0.000103184466,0.0002653895,0.0049624452],"genre_scores_gemma":[0.9688991,0.0003302178,0.029371839,0.000021943804,0.000027190146,0.000024777813,0.000038120565,0.000015291498,0.0012715802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977154,0.000093943825,0.000009064208,0.000030489558,0.000061805134,0.000033080512],"domain_scores_gemma":[0.9995167,0.00028843302,0.00005438793,0.000043121127,0.00007496835,0.000022467973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003332251,0.00031231792,0.00038273862,0.00031433036,0.00032460756,0.00035012353,0.00043968466,0.00034083673,0.0005144491],"category_scores_gemma":[0.0012768917,0.00020179918,0.00016775429,0.0004979033,0.00028333528,0.0006313776,0.00057113625,0.00026840426,0.000082621074],"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.00020293712,0.000052595104,0.0017622842,0.000111600035,0.000045734916,0.0001329547,0.00010403716,0.9051035,0.017228669,0.006875276,0.0015383741,0.066841945],"study_design_scores_gemma":[0.0000023260422,0.000019727755,0.00023408473,0.0000021558049,0.0000024919211,0.000014804363,0.000020180645,0.9974605,0.0012284982,0.00074474746,0.0002686394,0.0000017535598],"about_ca_topic_score_codex":0.0025056158,"about_ca_topic_score_gemma":0.0032340318,"teacher_disagreement_score":0.0025056158,"about_ca_system_score_codex":0.0002689586,"about_ca_system_score_gemma":0.00028254435,"threshold_uncertainty_score":0.0049820542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0144091975,0.0000967779,0.97404027,0.0003415738,0.00016707757,0.00013732472,0.00009283707,0.002854364,0.007860537],"genre_scores_gemma":[0.48672915,0.00014958577,0.49625474,0.0006213299,0.0002829339,0.00029389738,0.00028215197,0.0008918679,0.014494318],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99811906,0.0002985786,0.00008661194,0.0005109732,0.00081714283,0.00016750516],"domain_scores_gemma":[0.9967354,0.0006233292,0.00019004628,0.0018105512,0.0005422017,0.000098547614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088942004,0.0015941839,0.0016146332,0.0007042274,0.0014047286,0.0016732066,0.0027311475,0.0014985772,0.008444189],"category_scores_gemma":[0.003487114,0.0007337365,0.00080017967,0.0008526467,0.001124457,0.0026249916,0.0024221323,0.0020514482,0.0028404857],"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.0009836908,0.00068445323,0.0014014741,0.00036065813,0.0001399227,0.00050660095,0.00021931544,0.059046593,0.28893548,0.1368576,0.006475698,0.5043886],"study_design_scores_gemma":[0.000106590865,0.00032765864,0.00067801465,0.000025802568,0.0001168432,0.000655451,0.000052819778,0.72356415,0.20724425,0.055561304,0.01160685,0.00006025469],"about_ca_topic_score_codex":0.0017922294,"about_ca_topic_score_gemma":0.0036930707,"teacher_disagreement_score":0.008444189,"about_ca_system_score_codex":0.0010886665,"about_ca_system_score_gemma":0.0018418132,"threshold_uncertainty_score":0.028248608},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005478811,0.024600765,0.050307967,0.027414506,0.0399932,0.00036287488,0.0019531165,0.0035711143,0.8463177],"genre_scores_gemma":[0.051588766,0.020940691,0.015562929,0.0036904914,0.012418137,0.00030687472,0.0030209676,0.0006891418,0.891782],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988348,0.00016131345,0.000059257996,0.0001517776,0.0006827104,0.000110110974],"domain_scores_gemma":[0.9970962,0.00047566587,0.00015121531,0.00078263076,0.0010881732,0.00040615746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010562375,0.0008552733,0.0012268721,0.0015164035,0.0016496519,0.005401029,0.0011928424,0.00229354,0.12758341],"category_scores_gemma":[0.0036198243,0.00036918433,0.00029971718,0.0029534104,0.0016130483,0.0031876627,0.0028238061,0.00284183,0.09496835],"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.00006437789,0.00008076322,0.0005490116,0.00029739973,0.00002805184,0.00009783765,0.000052475905,0.00084530876,0.0025489056,0.12313905,0.6375179,0.23477894],"study_design_scores_gemma":[0.000011319803,0.000033544526,0.0005454639,0.000077836936,0.00001105854,0.00011632596,0.000040001047,0.0031822363,0.0010170223,0.036542665,0.9584085,0.000014084632],"about_ca_topic_score_codex":0.0011188063,"about_ca_topic_score_gemma":0.0011839157,"teacher_disagreement_score":0.12758341,"about_ca_system_score_codex":0.0009777136,"about_ca_system_score_gemma":0.0020591344,"threshold_uncertainty_score":0.426809},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04836561,0.00043501658,0.93990356,0.0004478972,0.00020781436,0.00019793886,0.0002529758,0.0033287164,0.006860517],"genre_scores_gemma":[0.691829,0.0004328911,0.29712665,0.0003119922,0.000038948157,0.0002770381,0.00047547318,0.00021569127,0.009292315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997125,0.0000722494,0.000011692519,0.00004547448,0.00009949064,0.000058540318],"domain_scores_gemma":[0.9995679,0.00017611621,0.0000621801,0.00007283302,0.00009100031,0.000029842246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057733845,0.00052385207,0.00055137445,0.0006556476,0.00064130453,0.00069711235,0.0013414455,0.000840269,0.0014587903],"category_scores_gemma":[0.0014169134,0.0001832217,0.00036049777,0.0007720598,0.00047745544,0.00068910565,0.0008845545,0.0008316142,0.00030116714],"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.00024601142,0.00015032153,0.00094237406,0.000110504516,0.00010509318,0.0002963525,0.00016189249,0.77989525,0.01537319,0.03803626,0.008299285,0.15638348],"study_design_scores_gemma":[0.000040095434,0.00008335974,0.000235298,0.00000943309,0.000023905915,0.000117097996,0.000031414085,0.98164773,0.0038224612,0.009534546,0.004435276,0.000019403627],"about_ca_topic_score_codex":0.0039659943,"about_ca_topic_score_gemma":0.006775781,"teacher_disagreement_score":0.0039659943,"about_ca_system_score_codex":0.0006625534,"about_ca_system_score_gemma":0.0013060078,"threshold_uncertainty_score":0.007885814},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040650547,0.022840148,0.45038992,0.035862643,0.027457286,0.00008375569,0.00040831897,0.00036066785,0.42194667],"genre_scores_gemma":[0.6136325,0.02910934,0.18627246,0.011560834,0.03175547,0.00031277793,0.0004916307,0.0006706024,0.12619442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994665,0.00021711383,0.000026288706,0.000110981455,0.00013667729,0.000042417767],"domain_scores_gemma":[0.9979809,0.0013873294,0.000084588224,0.00025669756,0.00017768073,0.00011279704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011192679,0.0005941194,0.00059966557,0.00096087734,0.0012716365,0.0016564502,0.0011729889,0.00164121,0.008845161],"category_scores_gemma":[0.00480299,0.00029766344,0.00069419766,0.0012660049,0.0024881966,0.0055823233,0.0017860202,0.0042203628,0.0015832961],"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.000029305415,0.0000072881294,0.000053033527,0.000046637782,0.00000600581,0.00005713374,0.000041599505,0.0013859443,0.00047657924,0.9789933,0.0069906656,0.011912545],"study_design_scores_gemma":[0.0000060629545,0.000012657679,0.000049225964,0.000013490332,0.0000042978727,0.000057268797,0.000010009153,0.003289679,0.00019578746,0.966691,0.029663045,0.0000074699756],"about_ca_topic_score_codex":0.00081372634,"about_ca_topic_score_gemma":0.0007804433,"teacher_disagreement_score":0.008845161,"about_ca_system_score_codex":0.00067452696,"about_ca_system_score_gemma":0.00041420714,"threshold_uncertainty_score":0.029589951},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39047393,0.0117425,0.39816722,0.08476003,0.000697415,0.00018036168,0.000404313,0.0003309197,0.1132432],"genre_scores_gemma":[0.9913714,0.00085248717,0.005063185,0.00033824553,0.000129682,0.000028459006,0.00002763207,0.000013198316,0.0021757388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605006,0.0019116134,0.00026066595,0.00040861688,0.0009089065,0.00046010298],"domain_scores_gemma":[0.9755671,0.014953594,0.0029027886,0.0035428808,0.0019058742,0.0011277762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005164011,0.0002763465,0.00053212553,0.0009198004,0.0025767635,0.007175132,0.00067482336,0.0025641054,0.0023157694],"category_scores_gemma":[0.022949982,0.00039514856,0.0004384341,0.0012109574,0.008202343,0.007835393,0.0031373668,0.0027021077,0.00028538486],"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.00012885779,0.00007469076,0.0066861035,0.00012483621,0.00007016675,0.00029253968,0.0027935372,0.007511691,0.0008378366,0.9404613,0.003601845,0.03741666],"study_design_scores_gemma":[0.00001608349,0.000028624383,0.0019824733,0.000047616875,0.000022419483,0.00016810991,0.001186252,0.01592193,0.00042160894,0.9692727,0.010905912,0.000026254387],"about_ca_topic_score_codex":0.008080988,"about_ca_topic_score_gemma":0.0046547167,"teacher_disagreement_score":0.008080988,"about_ca_system_score_codex":0.0026508297,"about_ca_system_score_gemma":0.002850179,"threshold_uncertainty_score":0.027310252},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07469757,0.00030185294,0.85241073,0.0018035511,0.00019575242,0.00032126775,0.00064172933,0.004504444,0.0651232],"genre_scores_gemma":[0.784358,0.00026238858,0.19296326,0.0003001946,0.00007683556,0.00032017232,0.00063132,0.00025684378,0.02083095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942505,0.00015514954,0.00004206811,0.00007125232,0.00018995529,0.00011655457],"domain_scores_gemma":[0.999603,0.00006198464,0.000029620795,0.00011045616,0.00013569792,0.000059261565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073767913,0.00028893407,0.0003641477,0.0006055641,0.0010715761,0.0025453412,0.0012728282,0.001050622,0.005603895],"category_scores_gemma":[0.0009926694,0.00025710862,0.00070617674,0.00089560496,0.00068246905,0.002495023,0.0010877526,0.0007624156,0.0014542727],"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.00027617137,0.0001963697,0.0019074815,0.00013046978,0.000056887733,0.0006203245,0.00050797284,0.15530497,0.011154682,0.76864076,0.012311328,0.04889252],"study_design_scores_gemma":[0.00005256023,0.000044790166,0.0004482193,0.000024424533,0.000032532254,0.00013092368,0.00011961302,0.83587974,0.0026043968,0.14103518,0.019595077,0.00003258016],"about_ca_topic_score_codex":0.015739975,"about_ca_topic_score_gemma":0.010787538,"teacher_disagreement_score":0.015739975,"about_ca_system_score_codex":0.0015965019,"about_ca_system_score_gemma":0.001979634,"threshold_uncertainty_score":0.03129673},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012472017,0.0014192698,0.000066043984,0.03013539,0.96610594,0.000018189534,0.000042022726,0.000033273132,0.0020551411],"genre_scores_gemma":[0.002518832,0.0022491238,0.00016655297,0.02493363,0.9455089,0.000047600508,0.000060678063,0.000064213484,0.024450416],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99603504,0.0006624659,0.00046476693,0.0006843914,0.0016705678,0.00048273994],"domain_scores_gemma":[0.9666885,0.0078765135,0.0022032883,0.0016809166,0.016583493,0.004967363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068965936,0.0016013819,0.0018314046,0.002722901,0.0025585126,0.0067176516,0.0022219932,0.008028166,0.0270009],"category_scores_gemma":[0.042107034,0.00078312523,0.0013438066,0.0010422434,0.0015557797,0.0023346627,0.0015059814,0.011619213,0.0114694135],"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.000041975414,0.000012612864,0.00007479267,0.00011135236,0.000010575251,0.00014633015,0.000018875413,0.000012173536,0.000053313943,0.00027353168,0.9944185,0.004826045],"study_design_scores_gemma":[0.00004557742,0.000029099889,0.0005535302,0.00019499245,0.00003370355,0.00029929864,0.00009408712,0.00007981012,0.00021057307,0.0004945067,0.99795026,0.000014601285],"about_ca_topic_score_codex":0.0009639927,"about_ca_topic_score_gemma":0.0021595634,"teacher_disagreement_score":0.0270009,"about_ca_system_score_codex":0.0019229677,"about_ca_system_score_gemma":0.0028787341,"threshold_uncertainty_score":0.090327024},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03068529,0.3407411,0.3979747,0.03937588,0.016671216,0.00011500543,0.00047092928,0.00083931495,0.1731266],"genre_scores_gemma":[0.45231622,0.34658375,0.11854366,0.0042015547,0.011268788,0.0001471626,0.0005224684,0.0002499459,0.06616636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945813,0.0001119691,0.000030937088,0.00008939641,0.00024992038,0.000059569247],"domain_scores_gemma":[0.9982948,0.0009955826,0.00009394804,0.00020058788,0.00030815514,0.00010709627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008394651,0.0005876575,0.00052055076,0.00073882454,0.0005204277,0.0020765846,0.0010120634,0.0012617601,0.007994621],"category_scores_gemma":[0.0025066219,0.00027035412,0.00022374254,0.0020359852,0.0011095019,0.0042438093,0.0012767737,0.0020464328,0.001479108],"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.00007480444,0.000070504255,0.0007873765,0.0008704433,0.000026507792,0.00014167823,0.00013990163,0.019014295,0.0037392143,0.5727476,0.040939536,0.36144814],"study_design_scores_gemma":[0.000016832186,0.00007918043,0.0007775857,0.00030391727,0.00003790718,0.0005625498,0.00024257517,0.064573966,0.0020780656,0.2596878,0.67160803,0.000031611922],"about_ca_topic_score_codex":0.0008577675,"about_ca_topic_score_gemma":0.0015069089,"teacher_disagreement_score":0.007994621,"about_ca_system_score_codex":0.0009936832,"about_ca_system_score_gemma":0.0009036659,"threshold_uncertainty_score":0.026744664},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11348974,0.0016649666,0.87218976,0.00047170545,0.0006493355,0.00023812945,0.00014643512,0.0010750889,0.010074832],"genre_scores_gemma":[0.55853397,0.00038924866,0.437054,0.00021487744,0.00010566088,0.0002446339,0.00022788082,0.00014504822,0.0030845995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994454,0.00017353788,0.000032672044,0.000090297086,0.00012920036,0.00012892969],"domain_scores_gemma":[0.9988223,0.0005880366,0.0001068879,0.00010750578,0.00026220086,0.00011300858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084856903,0.00087526586,0.0016078639,0.0014100027,0.0011179785,0.0012984464,0.0019816707,0.0014595836,0.004253177],"category_scores_gemma":[0.0022501296,0.00075348926,0.0007709093,0.0016311636,0.00050283567,0.0012333363,0.0011766119,0.00090425636,0.0004693063],"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.0003778272,0.00020357849,0.00056399853,0.00011082238,0.000059767714,0.00012068738,0.00003597193,0.91489327,0.0032593205,0.0030312587,0.002061062,0.07528233],"study_design_scores_gemma":[0.00004758315,0.000077299344,0.00013596454,0.0000062671043,0.000019165014,0.000024552879,0.000013564884,0.9976585,0.0004985426,0.0010847097,0.0004248197,0.000009038773],"about_ca_topic_score_codex":0.004852273,"about_ca_topic_score_gemma":0.007839649,"teacher_disagreement_score":0.004852273,"about_ca_system_score_codex":0.0009341393,"about_ca_system_score_gemma":0.0017541543,"threshold_uncertainty_score":0.014228284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018955717,0.0007400916,0.97204167,0.00039091372,0.0002944302,0.00013119288,0.00016639513,0.00365281,0.003626745],"genre_scores_gemma":[0.17151086,0.00029534966,0.82006735,0.0003176666,0.00017734157,0.0002694377,0.00077572936,0.00037824642,0.006208055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929404,0.00012562961,0.000052607986,0.000203177,0.00022962516,0.00009476331],"domain_scores_gemma":[0.99921393,0.00026987778,0.00005751517,0.00014078304,0.00025963003,0.000058186208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009566146,0.0010949814,0.0022630254,0.0009807597,0.00084539526,0.0015115293,0.0039118906,0.0015284882,0.005595754],"category_scores_gemma":[0.0026234377,0.00068727153,0.00097299105,0.0017178883,0.00046335603,0.0020506284,0.0017321405,0.002309416,0.001910474],"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.00044585072,0.00029614728,0.0006798489,0.00011185978,0.00014849711,0.00008822496,0.00003004203,0.26353192,0.0044962578,0.0067326203,0.011021181,0.7124176],"study_design_scores_gemma":[0.000027005473,0.000017653456,0.00006392515,0.0000025787647,0.000011598628,0.0000166006,0.0000034978539,0.99683434,0.0007215264,0.0017345573,0.000562807,0.00000401564],"about_ca_topic_score_codex":0.011105385,"about_ca_topic_score_gemma":0.011958923,"teacher_disagreement_score":0.011105385,"about_ca_system_score_codex":0.0012436819,"about_ca_system_score_gemma":0.0021861265,"threshold_uncertainty_score":0.022081494},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096062824,0.0008651345,0.8755822,0.0014487025,0.00063801213,0.00037441606,0.00021392932,0.005463161,0.019351607],"genre_scores_gemma":[0.954108,0.00023974651,0.036254764,0.00022503335,0.00013353184,0.00021487333,0.00014543995,0.00007921049,0.008599461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977569,0.00044186076,0.000243971,0.00035555576,0.00072109397,0.00048055744],"domain_scores_gemma":[0.9970503,0.00041109908,0.00042419042,0.0013281335,0.0005845705,0.00020169144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016876664,0.00049162837,0.0007303683,0.0011389023,0.0019020621,0.0024317561,0.0014579437,0.0014442751,0.005074492],"category_scores_gemma":[0.0030417223,0.00032629046,0.00049334037,0.00081402605,0.0011609215,0.0038751995,0.004017959,0.001625836,0.0015545017],"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.001539112,0.00027284012,0.0026706771,0.00039232662,0.00014493194,0.0017377633,0.001762089,0.019209586,0.05460945,0.7547716,0.02064169,0.14224787],"study_design_scores_gemma":[0.00036933823,0.0009478816,0.0020581377,0.00018202233,0.000356767,0.003197132,0.0009503078,0.489645,0.095701754,0.30782256,0.098492004,0.00027719565],"about_ca_topic_score_codex":0.0007333408,"about_ca_topic_score_gemma":0.00047986067,"teacher_disagreement_score":0.005074492,"about_ca_system_score_codex":0.000955751,"about_ca_system_score_gemma":0.0011448807,"threshold_uncertainty_score":0.01697588},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009965555,0.00017222167,0.98359364,0.00019580465,0.000036613146,0.00020664926,0.000037343394,0.00021013225,0.0055820607],"genre_scores_gemma":[0.4692295,0.00035154942,0.5268645,0.00008571702,0.00004963907,0.0004421039,0.000079124686,0.00009094827,0.0028069492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846613,0.0005077788,0.000062332176,0.00011663856,0.0006719708,0.00017510775],"domain_scores_gemma":[0.9988795,0.00041692768,0.0000739537,0.00012249197,0.00043933588,0.00006771349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029105535,0.00059469446,0.000790326,0.00059561507,0.00070937694,0.0017625894,0.0015002327,0.00095554977,0.0025140857],"category_scores_gemma":[0.0044342116,0.0003417585,0.0005132381,0.00044052166,0.0012398426,0.0012675896,0.0010852944,0.0011869033,0.00042956354],"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.000086693624,0.00014545002,0.00066896586,0.00010875155,0.00004363601,0.0001788653,0.00016568798,0.60310346,0.012950993,0.3345927,0.0013218726,0.046632927],"study_design_scores_gemma":[0.000015545667,0.000052004794,0.00009160778,0.000015775755,0.000011034626,0.000027247432,0.000029654591,0.9808091,0.002027897,0.015312489,0.0015969329,0.0000106716425],"about_ca_topic_score_codex":0.008810743,"about_ca_topic_score_gemma":0.005050084,"teacher_disagreement_score":0.008810743,"about_ca_system_score_codex":0.0017555526,"about_ca_system_score_gemma":0.0034665405,"threshold_uncertainty_score":0.017518878},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048442338,0.00032438393,0.94537616,0.00013579986,0.0001670064,0.000073613664,0.00061309634,0.0038800407,0.0009876253],"genre_scores_gemma":[0.47302005,0.00024146786,0.5222227,0.00014029724,0.00015687691,0.00013937228,0.0015203721,0.00030545818,0.002253474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959844,0.00005871506,0.000029946563,0.00012694832,0.000119131306,0.00006688035],"domain_scores_gemma":[0.9992731,0.000204777,0.000051195228,0.00013817624,0.0002893539,0.000043341966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006391969,0.0008151414,0.0012784798,0.0017636141,0.00041279657,0.0009419355,0.0010035521,0.0008212876,0.0026926384],"category_scores_gemma":[0.0023249204,0.00028135083,0.0010938201,0.0017206814,0.00024313618,0.0011460088,0.0009652086,0.00077865674,0.0014707666],"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.00049252616,0.00047705031,0.01427218,0.00014724821,0.00024714787,0.00024641358,0.00005989575,0.04315374,0.030740445,0.0016786639,0.005307031,0.9031776],"study_design_scores_gemma":[0.000025529485,0.00014861146,0.011181383,0.000021476895,0.00010060427,0.00027521275,0.000034682434,0.9700752,0.01029978,0.005112104,0.0026925348,0.000032880947],"about_ca_topic_score_codex":0.0055856616,"about_ca_topic_score_gemma":0.008080403,"teacher_disagreement_score":0.0055856616,"about_ca_system_score_codex":0.00028675343,"about_ca_system_score_gemma":0.000736251,"threshold_uncertainty_score":0.011106312},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8057717,0.0011697371,0.17486022,0.000956991,0.00028009122,0.00012470124,0.00013843732,0.0008630602,0.015835065],"genre_scores_gemma":[0.94712675,0.0002553131,0.048213713,0.00014265509,0.00010508029,0.00004764723,0.00005303928,0.000013129919,0.004042646],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998004,0.00004516684,0.000010709542,0.000046165325,0.00006672635,0.000030864503],"domain_scores_gemma":[0.99968445,0.0000900506,0.000050998966,0.000052907933,0.000079419675,0.000042281124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023942214,0.00029480163,0.00057183596,0.00045708363,0.0012497534,0.00075569213,0.000989723,0.00063347974,0.00199959],"category_scores_gemma":[0.00030959377,0.00020328,0.00020628652,0.00060295983,0.00044901783,0.0008062595,0.00060569134,0.00039907725,0.0004871234],"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.000720212,0.00036465205,0.00229299,0.00019029414,0.00007371096,0.0009959477,0.00021086715,0.0064237393,0.8611319,0.012733234,0.0019923465,0.11287011],"study_design_scores_gemma":[0.0003282453,0.0027132353,0.0046807304,0.00008219901,0.00032142358,0.004842353,0.00015591033,0.54292125,0.41238403,0.0072827875,0.024095291,0.00019257305],"about_ca_topic_score_codex":0.00043209732,"about_ca_topic_score_gemma":0.0012503791,"teacher_disagreement_score":0.00199959,"about_ca_system_score_codex":0.0004039031,"about_ca_system_score_gemma":0.00040045474,"threshold_uncertainty_score":0.00668931},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06581886,0.0002732769,0.9283905,0.00046593955,0.00016644271,0.00007961963,0.00009652571,0.00042804464,0.004280849],"genre_scores_gemma":[0.6301524,0.0001671717,0.36380675,0.00014408272,0.00007626901,0.0002307338,0.0001926683,0.00026328623,0.0049665486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959844,0.00022092892,0.000020952437,0.000041499006,0.00008557016,0.000032612108],"domain_scores_gemma":[0.998154,0.0012946088,0.00007652279,0.00011440158,0.00026864908,0.00009175749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00130032,0.0006329679,0.0011269501,0.00059625605,0.0005947956,0.0009547681,0.0011294057,0.0014891522,0.003384536],"category_scores_gemma":[0.0046734707,0.0005624474,0.00066741015,0.0007694051,0.0007055656,0.00095306756,0.00092667085,0.0011890472,0.0003167753],"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.000060511546,0.000030099258,0.00024061603,0.000020549414,0.000016693828,0.000028062523,0.00002274437,0.98234105,0.0003476646,0.005854941,0.0007717209,0.010265403],"study_design_scores_gemma":[0.0000025020854,0.000001582683,0.000010035839,3.2675342e-7,4.0260215e-7,4.6053344e-7,8.3744413e-7,0.9995053,0.000017749848,0.00043484956,0.000025262603,5.8901105e-7],"about_ca_topic_score_codex":0.015220708,"about_ca_topic_score_gemma":0.009624966,"teacher_disagreement_score":0.015220708,"about_ca_system_score_codex":0.0010154833,"about_ca_system_score_gemma":0.0014164688,"threshold_uncertainty_score":0.030264199},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041483655,0.000074030926,0.97939634,0.00012898276,0.000040043746,0.00010125576,0.00008984513,0.014470667,0.0015504628],"genre_scores_gemma":[0.16836208,0.00032255694,0.81653166,0.00029150376,0.00009469682,0.000574526,0.0012673968,0.0057850033,0.006770501],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784124,0.000510983,0.00024503257,0.00022817274,0.00089346105,0.00028109766],"domain_scores_gemma":[0.9960445,0.0010689752,0.00021693102,0.0015755142,0.00084986375,0.00024430227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035752333,0.0014733004,0.001011335,0.0015892182,0.0009767286,0.005055607,0.0047858465,0.0027920003,0.0077785635],"category_scores_gemma":[0.008422291,0.0016081188,0.0022332221,0.0013510707,0.0012695465,0.004823613,0.0031287381,0.0037354075,0.003063906],"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.0006736968,0.00068676093,0.0049006315,0.00040316535,0.00043194625,0.0009695518,0.0009687292,0.28745133,0.019429976,0.26152855,0.028528465,0.39402726],"study_design_scores_gemma":[0.00011632851,0.00007398558,0.0003175049,0.000058976937,0.00008176479,0.00015461975,0.00004241885,0.8960842,0.007035541,0.07473357,0.021246992,0.000054136388],"about_ca_topic_score_codex":0.0069341217,"about_ca_topic_score_gemma":0.0054819854,"teacher_disagreement_score":0.0077785635,"about_ca_system_score_codex":0.0013139141,"about_ca_system_score_gemma":0.0019871169,"threshold_uncertainty_score":0.026021838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005055036,0.0006282145,0.99102014,0.00019884363,0.00009307481,0.0000118495755,0.000056033598,0.0003497481,0.0025870071],"genre_scores_gemma":[0.22400911,0.0033465484,0.7579866,0.00017654884,0.00046439696,0.0001047278,0.00050501095,0.000612384,0.0127947265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997373,0.00006214415,0.000015385953,0.000028241564,0.00013867735,0.00001824296],"domain_scores_gemma":[0.9992654,0.00035077022,0.000037930356,0.00016540558,0.00014712289,0.000033480705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003705185,0.0005191559,0.0005151665,0.0006264929,0.00024619413,0.0011081515,0.0005928037,0.0005542397,0.004179556],"category_scores_gemma":[0.0022385013,0.00027283764,0.00033399474,0.0014288566,0.0005938389,0.00097559625,0.0008083501,0.0013881319,0.0014241665],"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.00014632179,0.00007186907,0.00021787894,0.00024222596,0.00004038828,0.00013349892,0.0001597325,0.093707226,0.035184328,0.3099557,0.011010547,0.5491304],"study_design_scores_gemma":[0.000017336355,0.00002192869,0.0001678794,0.0000141414,0.00001240275,0.00007628404,0.000036561883,0.8737465,0.0064431485,0.10519453,0.014255801,0.000013416878],"about_ca_topic_score_codex":0.0012132879,"about_ca_topic_score_gemma":0.0012027617,"teacher_disagreement_score":0.004179556,"about_ca_system_score_codex":0.00025844463,"about_ca_system_score_gemma":0.00035530413,"threshold_uncertainty_score":0.013982058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2971663,0.0010372739,0.6952539,0.0008587134,0.0002701062,0.00011321831,0.0001703519,0.0012437161,0.0038865611],"genre_scores_gemma":[0.93236697,0.00016930384,0.06541322,0.000061045306,0.00006620644,0.00004134331,0.00008436448,0.00007641886,0.0017210691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904364,0.00035808116,0.000058204925,0.000117220254,0.00028677762,0.00013606726],"domain_scores_gemma":[0.9939745,0.0030561981,0.00048396515,0.0010994683,0.0009552232,0.00043065756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016824276,0.0002989903,0.00096343487,0.00060294,0.0009823972,0.0010590471,0.002395754,0.00085800694,0.0013991304],"category_scores_gemma":[0.009801571,0.0006539561,0.0003222601,0.0012350966,0.00089304557,0.001345854,0.0014524028,0.000673002,0.0003401917],"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.0005754838,0.00013554278,0.003955045,0.00013129691,0.000054233013,0.00019690537,0.00024040946,0.89777684,0.010298417,0.020393666,0.0040453,0.062196802],"study_design_scores_gemma":[0.000028080814,0.00002723719,0.00025942773,0.000002026183,0.0000069374705,0.0000368976,0.000036849917,0.9927585,0.000843156,0.0056516407,0.00034172964,0.000007539909],"about_ca_topic_score_codex":0.0040812436,"about_ca_topic_score_gemma":0.0059980126,"teacher_disagreement_score":0.0040812436,"about_ca_system_score_codex":0.0008943468,"about_ca_system_score_gemma":0.0012214564,"threshold_uncertainty_score":0.008897662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7773776,0.008254683,0.13816409,0.0018091683,0.00018671449,0.000064989865,0.00015081659,0.00029016065,0.07370177],"genre_scores_gemma":[0.99307704,0.00050635106,0.002904116,0.000054400967,0.00003402372,0.000008182779,0.000014795058,0.000042309537,0.0033589543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997272,0.00007121991,0.0000060652783,0.000027115193,0.00008213771,0.000086218184],"domain_scores_gemma":[0.99779105,0.0017291663,0.00014614148,0.000103417755,0.00017529521,0.000054818946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000617401,0.00043163664,0.000446476,0.0005082263,0.0003750367,0.0008041077,0.00084200583,0.00048039842,0.0029053574],"category_scores_gemma":[0.0062090023,0.00034415527,0.0003571378,0.00089474436,0.0008286203,0.0011288082,0.00056108634,0.000621045,0.00026981207],"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.00029194946,0.00014802026,0.0030993228,0.00023073069,0.000044896926,0.0004547113,0.00022334368,0.87519485,0.018311387,0.07393801,0.0017396023,0.026323073],"study_design_scores_gemma":[0.0000068701693,0.000030892817,0.00087945967,0.000010542585,0.000013727338,0.00007678658,0.000043644493,0.99156064,0.0016736885,0.0048693665,0.00082869665,0.0000056446],"about_ca_topic_score_codex":0.0028090444,"about_ca_topic_score_gemma":0.0027187178,"teacher_disagreement_score":0.0029053574,"about_ca_system_score_codex":0.00084314914,"about_ca_system_score_gemma":0.0008189525,"threshold_uncertainty_score":0.009719431},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064704865,0.00082963204,0.9256902,0.0009892896,0.00029234675,0.00017514853,0.00017428542,0.0020037692,0.0051406357],"genre_scores_gemma":[0.90558934,0.00033593512,0.08986392,0.0000973129,0.000128535,0.00007340408,0.00014236323,0.00009982717,0.0036694151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831957,0.00039053216,0.00013748115,0.00024044001,0.0006615049,0.00025047938],"domain_scores_gemma":[0.9946991,0.0016347916,0.0009504378,0.0019969402,0.00057784567,0.00014091593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019044137,0.00081406755,0.0008309199,0.0011157863,0.0010134485,0.0017276519,0.001246312,0.001310723,0.0020701056],"category_scores_gemma":[0.0072094635,0.0005988169,0.00052841316,0.00071152527,0.0014048631,0.0026321248,0.0034035312,0.0016413914,0.00077681727],"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.0011658544,0.00012437048,0.0013817861,0.00016288245,0.00015620961,0.00039980406,0.00023403,0.61616147,0.04028445,0.13894787,0.0070016836,0.19397949],"study_design_scores_gemma":[0.000057451358,0.00025461314,0.00037152527,0.000023308317,0.000051090206,0.00022628988,0.00009135459,0.91492194,0.010547606,0.06840004,0.005006308,0.000048438724],"about_ca_topic_score_codex":0.0008590914,"about_ca_topic_score_gemma":0.0016391386,"teacher_disagreement_score":0.0020701056,"about_ca_system_score_codex":0.0013705519,"about_ca_system_score_gemma":0.0010978449,"threshold_uncertainty_score":0.010071635},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053743315,0.020182675,0.0059356447,0.051292602,0.011128172,0.00003572006,0.00020372728,0.00016543698,0.90568185],"genre_scores_gemma":[0.13816832,0.031933147,0.0037431135,0.007706505,0.007880807,0.000055556746,0.00025606458,0.00019798934,0.81005853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930537,0.00014811794,0.000018859262,0.00008749215,0.00035945064,0.00008079063],"domain_scores_gemma":[0.99880123,0.000328566,0.00009234712,0.00025970006,0.0003898712,0.0001282481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079900626,0.00048048887,0.00043583018,0.0012564211,0.0015651799,0.0050310004,0.00045724554,0.0028723315,0.055236574],"category_scores_gemma":[0.0024843533,0.00019410948,0.0002446829,0.0021943275,0.0024986488,0.0032490382,0.0016566908,0.00212811,0.011111697],"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.000024156841,0.00003825225,0.00027116554,0.000114995964,0.000011116677,0.00006686604,0.0001485113,0.0006651906,0.000601861,0.66850626,0.24881499,0.08073664],"study_design_scores_gemma":[0.000003913104,0.00001946996,0.00046952305,0.000119787874,0.000008164084,0.00008048661,0.00017373358,0.0009575977,0.00041427714,0.15405314,0.8436905,0.000009506998],"about_ca_topic_score_codex":0.0034710385,"about_ca_topic_score_gemma":0.0068220254,"teacher_disagreement_score":0.055236574,"about_ca_system_score_codex":0.0022080787,"about_ca_system_score_gemma":0.0022223853,"threshold_uncertainty_score":0.18478477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8722739,0.00027793972,0.11174292,0.00034606867,0.00011658361,0.00030322443,0.00021012027,0.008664189,0.006065041],"genre_scores_gemma":[0.9748359,0.00004203317,0.023489518,0.0000351642,0.000007104505,0.000038584905,0.00012595992,0.000086080974,0.0013396112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998725,0.00032318683,0.00009165093,0.00016192318,0.00038698406,0.00031126608],"domain_scores_gemma":[0.99741024,0.0006305364,0.00016708272,0.0007425073,0.0008211023,0.00022851855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010705002,0.0003753368,0.00042789016,0.0005673284,0.0006671911,0.0010887111,0.0013019063,0.00045607454,0.004811606],"category_scores_gemma":[0.0035111962,0.0002468767,0.0003299309,0.0003615899,0.00036423505,0.0010254972,0.0008576359,0.00065522874,0.00071532],"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.0075369747,0.0026689237,0.075271934,0.0010245887,0.00057728443,0.0011425612,0.0013977754,0.2087356,0.26647207,0.0231649,0.016172064,0.39583534],"study_design_scores_gemma":[0.00026587702,0.001562605,0.011127457,0.000028173725,0.00022382814,0.00029041633,0.00036915392,0.8724473,0.10730002,0.0018202262,0.004506113,0.000058881138],"about_ca_topic_score_codex":0.004141983,"about_ca_topic_score_gemma":0.0031884217,"teacher_disagreement_score":0.004811606,"about_ca_system_score_codex":0.00078075426,"about_ca_system_score_gemma":0.0011958231,"threshold_uncertainty_score":0.016096473},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73896486,0.000727378,0.25493604,0.00036939813,0.00014256773,0.000058325222,0.00048589314,0.0026729426,0.0016426506],"genre_scores_gemma":[0.97499144,0.00011302861,0.023824451,0.000020680789,0.000046440626,0.000031243773,0.00033948416,0.00007509228,0.0005581037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995751,0.000079946236,0.000025653244,0.0001091722,0.00013428064,0.000075886725],"domain_scores_gemma":[0.99652714,0.0021737905,0.00036462967,0.00031877335,0.0004170296,0.0001987939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087094685,0.00086239696,0.00080033374,0.0007568215,0.00038204965,0.00063054747,0.0009688146,0.00070088974,0.0009552358],"category_scores_gemma":[0.0062518083,0.00044151462,0.00025971973,0.0007667836,0.00033624715,0.0008643331,0.0004734351,0.00091371394,0.00027957212],"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.0012085025,0.0003248861,0.013013421,0.00008375603,0.00003719307,0.00016189202,0.000056006094,0.9124057,0.0051694573,0.0018676436,0.0019745538,0.06369701],"study_design_scores_gemma":[0.0000032171215,0.000012110287,0.0003604528,8.462913e-7,0.0000016096004,0.0000043146388,0.0000019307008,0.998836,0.0004718299,0.00027452392,0.000031927568,0.0000012599005],"about_ca_topic_score_codex":0.005627001,"about_ca_topic_score_gemma":0.005319136,"teacher_disagreement_score":0.005627001,"about_ca_system_score_codex":0.00038654768,"about_ca_system_score_gemma":0.00091043377,"threshold_uncertainty_score":0.011188507},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08079976,0.0009919236,0.88210315,0.0005831276,0.00016239201,0.00052356435,0.00039472646,0.020624919,0.013816333],"genre_scores_gemma":[0.78890884,0.0004312731,0.20201322,0.00033704573,0.00007678005,0.0002440875,0.00055127987,0.00043793034,0.00699952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993309,0.00015944727,0.00006611109,0.00009881704,0.00019894146,0.00014587872],"domain_scores_gemma":[0.9994454,0.00008277264,0.00006406399,0.00016683024,0.00011644006,0.00012451755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010951901,0.00046904868,0.0008637013,0.0007578968,0.0012382505,0.002216434,0.0023301535,0.0012899872,0.0023575085],"category_scores_gemma":[0.0013526027,0.00031460111,0.0005168178,0.0005201205,0.0007864112,0.0033756436,0.0033020522,0.0009234696,0.00071257807],"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.002837056,0.0010774023,0.0076786666,0.00073767896,0.00035804952,0.0028010637,0.0025342475,0.05003662,0.080248065,0.32896882,0.048064515,0.4746579],"study_design_scores_gemma":[0.00015075934,0.00039704118,0.002394725,0.00014578928,0.00031695422,0.0012731226,0.00096420903,0.761191,0.07905213,0.05773414,0.09612682,0.00025337652],"about_ca_topic_score_codex":0.0072785583,"about_ca_topic_score_gemma":0.007400733,"teacher_disagreement_score":0.0072785583,"about_ca_system_score_codex":0.00088684703,"about_ca_system_score_gemma":0.001354999,"threshold_uncertainty_score":0.014472365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8426598,0.0001829436,0.15416159,0.00039009156,0.0000744185,0.00003297958,0.00019803456,0.000368621,0.0019315593],"genre_scores_gemma":[0.99606603,0.000028475128,0.0033624726,0.000009015166,0.0000113225615,0.0000065200825,0.000053150976,0.000012579922,0.0004504921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998857,0.000030707062,0.0000055187197,0.000032411106,0.000026288173,0.000019342964],"domain_scores_gemma":[0.9983694,0.0011077541,0.00014312385,0.0001109978,0.00017354773,0.00009512143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006610114,0.00040554555,0.000365968,0.00042107466,0.00029695086,0.00067937886,0.0004356767,0.0005586809,0.0011310088],"category_scores_gemma":[0.003790136,0.00023354766,0.00031855574,0.00020415641,0.00043327757,0.00073321216,0.00038579633,0.0007520119,0.00016186544],"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.00031715335,0.00012645409,0.01372588,0.000040118193,0.00006079265,0.00012843907,0.00006219882,0.9481848,0.004950949,0.0070795473,0.0007809286,0.024542795],"study_design_scores_gemma":[0.0000016824254,0.0000031891034,0.00027842505,3.1012414e-7,7.9087306e-7,0.0000024479143,0.0000010586573,0.9986873,0.00014461455,0.0008706207,0.00000871867,8.282068e-7],"about_ca_topic_score_codex":0.0051997225,"about_ca_topic_score_gemma":0.0033694424,"teacher_disagreement_score":0.0051997225,"about_ca_system_score_codex":0.00047345858,"about_ca_system_score_gemma":0.00047925333,"threshold_uncertainty_score":0.0103389025},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008364411,0.01114678,0.0019843937,0.027880853,0.9274455,0.00009991227,0.00014964389,0.0001300765,0.030326527],"genre_scores_gemma":[0.0071786526,0.01970902,0.0012023494,0.017187534,0.78522617,0.0001240448,0.00045452523,0.00022948443,0.1686883],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988518,0.00013527459,0.000119350945,0.00023394247,0.0004657185,0.00019396807],"domain_scores_gemma":[0.9958098,0.0010094701,0.0002199728,0.00032462378,0.0018622732,0.0007738569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018030925,0.001266737,0.0011860981,0.0014845111,0.0014750783,0.0026258845,0.0014728107,0.0049949493,0.03426252],"category_scores_gemma":[0.0029301194,0.00041718353,0.000954976,0.0010276864,0.00091274985,0.002423843,0.0013486776,0.004238392,0.011403042],"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.0000686953,0.000080538826,0.00026104736,0.00028523937,0.000014745864,0.0002630554,0.000027111915,0.00014638361,0.0011916745,0.0037660592,0.96181905,0.032076374],"study_design_scores_gemma":[0.0000120343,0.000090338806,0.00077279645,0.00013313613,0.000019516505,0.00032649087,0.000035563102,0.00036283044,0.0004431819,0.002008749,0.99578387,0.000011417364],"about_ca_topic_score_codex":0.00094387017,"about_ca_topic_score_gemma":0.0028758077,"teacher_disagreement_score":0.03426252,"about_ca_system_score_codex":0.0011882609,"about_ca_system_score_gemma":0.001688457,"threshold_uncertainty_score":0.11461949},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017195411,0.00043346762,0.9772161,0.0007311687,0.000097525335,0.000090875525,0.0005594222,0.001375924,0.0023000918],"genre_scores_gemma":[0.42690784,0.0008114986,0.5622715,0.0003665199,0.00017474218,0.00020520324,0.0031870932,0.0005130062,0.0055625914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964921,0.0010661623,0.00030201155,0.0010633266,0.0008276234,0.00024886357],"domain_scores_gemma":[0.98286474,0.013311582,0.0005034988,0.0019202415,0.0010668772,0.00033302905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004851315,0.0010169593,0.002276688,0.0033601024,0.0022510288,0.0038903872,0.0046694223,0.0026257732,0.006717276],"category_scores_gemma":[0.023427155,0.0014946715,0.002439755,0.0036429374,0.0028369331,0.013107103,0.004753203,0.0030790807,0.0010213003],"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.0007029036,0.0002800239,0.0026050531,0.0004912471,0.00028161658,0.00034493447,0.0005824804,0.4523987,0.0019307864,0.36700547,0.007089925,0.16628696],"study_design_scores_gemma":[0.000037933507,0.000015497177,0.00013177312,0.000021975364,0.00005660971,0.000032530024,0.000062492945,0.5550855,0.00083940936,0.44195402,0.0017482195,0.00001404855],"about_ca_topic_score_codex":0.015686655,"about_ca_topic_score_gemma":0.022869015,"teacher_disagreement_score":0.015686655,"about_ca_system_score_codex":0.002613223,"about_ca_system_score_gemma":0.003157527,"threshold_uncertainty_score":0.031190693},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6795983,0.00054126745,0.2997981,0.00034940284,0.00012163121,0.00018516924,0.0014474255,0.015364556,0.0025941806],"genre_scores_gemma":[0.7035791,0.00016459763,0.28905353,0.000099668454,0.000033584784,0.0002547091,0.0037934252,0.0011017851,0.0019195967],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988285,0.0003566794,0.00014907327,0.00033239802,0.00018170604,0.0001516246],"domain_scores_gemma":[0.99786794,0.0007076971,0.00015962162,0.00066976453,0.00034404366,0.00025090316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023416826,0.00056055636,0.0008255607,0.0009553258,0.0013446984,0.0012498517,0.0013768222,0.00060845277,0.0013110321],"category_scores_gemma":[0.005441961,0.0006176358,0.0005672846,0.0017445566,0.00040011207,0.0016074169,0.0012275997,0.00080337364,0.0005197419],"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.013207776,0.001024601,0.01703846,0.0008269736,0.0005834161,0.0009135901,0.0011651503,0.18841347,0.4587908,0.013430814,0.01991211,0.284693],"study_design_scores_gemma":[0.00023292121,0.000257224,0.0054518203,0.000026053702,0.000089077526,0.0001337133,0.0002793983,0.8826625,0.095044516,0.00969071,0.0060788547,0.00005321239],"about_ca_topic_score_codex":0.0026859203,"about_ca_topic_score_gemma":0.0074891397,"teacher_disagreement_score":0.0026859203,"about_ca_system_score_codex":0.00086167705,"about_ca_system_score_gemma":0.0017227862,"threshold_uncertainty_score":0.012384176},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87227947,0.000643291,0.11958917,0.0006427532,0.00014862868,0.00005350637,0.00007739044,0.0017772999,0.0047885478],"genre_scores_gemma":[0.9943098,0.000079142825,0.0051975595,0.000020044223,0.00002968671,0.000006749141,0.000029034742,0.000036577974,0.00029150257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995134,0.00011427106,0.000023498711,0.00006658129,0.0001304234,0.00015178284],"domain_scores_gemma":[0.9975937,0.0008056089,0.00030317905,0.00058063254,0.00042015075,0.0002967776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089036627,0.0006408738,0.00052029255,0.0004217932,0.0006486622,0.0010015945,0.0013340324,0.00055014685,0.0013494149],"category_scores_gemma":[0.004752858,0.00029591026,0.00018279714,0.0005089066,0.00042820294,0.0014185741,0.0010486476,0.0006732476,0.00031690518],"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.0015290934,0.00037731352,0.012789739,0.00017144735,0.00011746746,0.00047559338,0.0003212428,0.7345497,0.13780035,0.0054120934,0.0036886507,0.102767326],"study_design_scores_gemma":[0.000047222682,0.00029535126,0.0054079616,0.000010110634,0.000051017447,0.00014877872,0.00011990022,0.97189337,0.016013376,0.0046508457,0.0013381547,0.000023816721],"about_ca_topic_score_codex":0.0012705657,"about_ca_topic_score_gemma":0.0018056527,"teacher_disagreement_score":0.0013494149,"about_ca_system_score_codex":0.000431605,"about_ca_system_score_gemma":0.00076194457,"threshold_uncertainty_score":0.0047087073},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018806113,0.0013030734,0.9744675,0.00038079274,0.00019806408,0.0001310869,0.000089751076,0.00068589445,0.0039376756],"genre_scores_gemma":[0.29064628,0.0020681398,0.6998283,0.0003422337,0.00036861355,0.0001572913,0.00052708224,0.00037486316,0.0056871166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802005,0.00069250417,0.00008967359,0.0002901177,0.00078142225,0.0001261643],"domain_scores_gemma":[0.9946714,0.003205533,0.0001954335,0.0007955188,0.001005142,0.00012695059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002284197,0.0009024514,0.0015388328,0.0018320978,0.0011340394,0.0015037403,0.0039096503,0.0011751256,0.0033033784],"category_scores_gemma":[0.010914464,0.0005384301,0.0008432234,0.002728982,0.00097010494,0.0043438687,0.0017252817,0.0014966832,0.0009437986],"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.00042477285,0.00034628404,0.0011886726,0.00041566312,0.00018152736,0.00008198266,0.00040088999,0.36831373,0.009689448,0.073679365,0.0091704745,0.53610724],"study_design_scores_gemma":[0.000048365902,0.00013469932,0.00021039988,0.000027122482,0.00005301545,0.000073891264,0.00009118803,0.9683248,0.0022527773,0.02396294,0.0048020924,0.000018826582],"about_ca_topic_score_codex":0.0073544057,"about_ca_topic_score_gemma":0.01042848,"teacher_disagreement_score":0.0073544057,"about_ca_system_score_codex":0.0014203773,"about_ca_system_score_gemma":0.0015245634,"threshold_uncertainty_score":0.014623225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09637586,0.00095079624,0.8839307,0.0011972846,0.00014667485,0.000080799866,0.00017020828,0.0007622011,0.016385518],"genre_scores_gemma":[0.96196675,0.00025111574,0.029148404,0.00012075088,0.00007363705,0.000059331654,0.00008349186,0.0002662839,0.008030299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996915,0.00011379569,0.000009000688,0.000044516568,0.000066075554,0.00007513836],"domain_scores_gemma":[0.9991278,0.0005766416,0.000050912124,0.000067655696,0.00012302813,0.000054076107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007100726,0.0009081327,0.0013366904,0.000482383,0.00043547738,0.0009855997,0.0010674242,0.00080062007,0.004567525],"category_scores_gemma":[0.0034559648,0.00045662004,0.00039334732,0.0007812678,0.00087253127,0.0012080392,0.0009949052,0.0008001713,0.00042490952],"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.00006452503,0.000023891027,0.00011860469,0.00002340852,0.000010613395,0.000017836903,0.000013152898,0.9854887,0.00057415094,0.004145124,0.0010233723,0.008496653],"study_design_scores_gemma":[0.000005288945,0.000006831844,0.000040128398,8.7997563e-7,0.0000019837025,0.0000026636114,0.0000044272965,0.9967392,0.00008912151,0.0030327186,0.000075501026,0.0000012599877],"about_ca_topic_score_codex":0.004868152,"about_ca_topic_score_gemma":0.0043652165,"teacher_disagreement_score":0.004868152,"about_ca_system_score_codex":0.001063856,"about_ca_system_score_gemma":0.0008463387,"threshold_uncertainty_score":0.015279949},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2014925,0.00056984834,0.793661,0.00038075092,0.00011319594,0.00009598618,0.00026743097,0.0005803184,0.0028388253],"genre_scores_gemma":[0.95823383,0.00021971327,0.04001887,0.000034056786,0.000034160945,0.000048744238,0.00020281377,0.000033445813,0.0011743722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999597,0.000096793,0.000028036322,0.0000811579,0.000110427805,0.000086589105],"domain_scores_gemma":[0.9980282,0.0010924705,0.00024568714,0.00026777375,0.00027351853,0.00009232213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008508543,0.00043274183,0.0007593359,0.0009967178,0.0008730947,0.000777761,0.001420219,0.00055251183,0.00074891106],"category_scores_gemma":[0.0047848993,0.00044827285,0.00028507836,0.0010627254,0.00061926025,0.0014719989,0.0009793475,0.0005495701,0.00015499449],"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.00016600543,0.000062518986,0.0022415468,0.000052101495,0.000033624598,0.00009456097,0.00011534808,0.9335813,0.0026388902,0.013743468,0.0014250273,0.045845617],"study_design_scores_gemma":[0.0000031630725,0.000008833437,0.00010432229,0.0000016163963,0.000003831912,0.000010549599,0.000010672144,0.9965352,0.00025448648,0.002923999,0.00014026591,0.000002957951],"about_ca_topic_score_codex":0.010590501,"about_ca_topic_score_gemma":0.017384313,"teacher_disagreement_score":0.010590501,"about_ca_system_score_codex":0.0010473626,"about_ca_system_score_gemma":0.0012096657,"threshold_uncertainty_score":0.021057725},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42785093,0.0060350187,0.5606955,0.0005581583,0.00039455775,0.00007857228,0.00015698017,0.00088188244,0.00334842],"genre_scores_gemma":[0.9730734,0.0003725773,0.025674513,0.000059298804,0.00009917488,0.00001696171,0.0000632191,0.00003149543,0.00060929294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996586,0.000081758444,0.000024503523,0.0000622548,0.00011303699,0.000059807775],"domain_scores_gemma":[0.99918157,0.00042212184,0.00007251169,0.00007153948,0.00019342187,0.000058800437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006951937,0.00049405545,0.00080175156,0.00038718624,0.00037985863,0.0005725542,0.0007125974,0.00036174778,0.0005635741],"category_scores_gemma":[0.0021792566,0.0002638625,0.00016778627,0.00045300453,0.00024845576,0.0007410068,0.0006382056,0.00057349034,0.00008597433],"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.0011533826,0.0004518146,0.003767469,0.00022334312,0.00014732165,0.0002894655,0.00021052417,0.598253,0.10072554,0.0072935973,0.004226096,0.28325844],"study_design_scores_gemma":[0.000010174103,0.000056410165,0.00046273915,0.000003465855,0.000018942834,0.000040460927,0.000024222778,0.9931681,0.0049887234,0.0009216874,0.000299275,0.0000057862253],"about_ca_topic_score_codex":0.0021564583,"about_ca_topic_score_gemma":0.0055360286,"teacher_disagreement_score":0.0021564583,"about_ca_system_score_codex":0.0004223855,"about_ca_system_score_gemma":0.0005572206,"threshold_uncertainty_score":0.0042877793},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9067458,0.0016215038,0.07899563,0.00028750356,0.00011973449,0.00003641513,0.00006894421,0.0009900968,0.011134426],"genre_scores_gemma":[0.9866436,0.00014383135,0.011921094,0.000030491536,0.00001656535,0.000010263866,0.000046433597,0.00001819844,0.0011694159],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997758,0.00006583217,0.000013271129,0.000026424426,0.00007276402,0.000045890374],"domain_scores_gemma":[0.99920684,0.0002504499,0.00008240535,0.00010981069,0.0002942949,0.000056142802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005149394,0.0003560501,0.0002953449,0.0003460546,0.000447764,0.0005189241,0.0006370282,0.00028639607,0.0021006675],"category_scores_gemma":[0.0015042794,0.00013537923,0.00010694903,0.00044069177,0.00016625172,0.0007447994,0.000483024,0.00029280726,0.00023193794],"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.002624883,0.00053352024,0.008996263,0.00040488297,0.00013714327,0.00035639832,0.0002861991,0.32471064,0.37714192,0.013809612,0.0050716456,0.265927],"study_design_scores_gemma":[0.00006202206,0.00080330437,0.0028114147,0.000023284838,0.00007726289,0.00012228923,0.00006969265,0.9155688,0.075925484,0.0019155843,0.002599624,0.00002127538],"about_ca_topic_score_codex":0.00075508637,"about_ca_topic_score_gemma":0.0023446833,"teacher_disagreement_score":0.0021006675,"about_ca_system_score_codex":0.0004037857,"about_ca_system_score_gemma":0.0005043977,"threshold_uncertainty_score":0.007027447},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13566916,0.00027788564,0.83291245,0.00088580605,0.0003423882,0.0009416973,0.0017959131,0.018479804,0.008694878],"genre_scores_gemma":[0.7456884,0.00015467456,0.24655904,0.00023920258,0.00005981867,0.00027463082,0.0037156558,0.0011557372,0.002152849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9612971,0.015322072,0.003350231,0.0041177613,0.013297665,0.002615251],"domain_scores_gemma":[0.820796,0.10204316,0.006587024,0.038491435,0.029677391,0.0024049853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022291964,0.0013286194,0.001806981,0.004364325,0.0019695265,0.0069083152,0.005127031,0.0027738,0.0058970866],"category_scores_gemma":[0.12927558,0.0011708004,0.0025543969,0.0017597667,0.0025087208,0.005510476,0.004777144,0.0036963022,0.002219278],"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.0031174256,0.001810941,0.051015496,0.0010432915,0.0009141932,0.0026409943,0.0028181635,0.44213915,0.026722869,0.06896478,0.012973647,0.38583907],"study_design_scores_gemma":[0.00009416368,0.00008045456,0.0014541352,0.00013134016,0.00007988794,0.00012416432,0.00020959196,0.96445006,0.012467431,0.018079465,0.0027722619,0.00005694429],"about_ca_topic_score_codex":0.023150656,"about_ca_topic_score_gemma":0.025878344,"teacher_disagreement_score":0.023150656,"about_ca_system_score_codex":0.001954197,"about_ca_system_score_gemma":0.008273218,"threshold_uncertainty_score":0.11789256},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.290087,0.0010123911,0.69437546,0.0023390278,0.00026397812,0.0001213058,0.00036569816,0.00026119198,0.011173946],"genre_scores_gemma":[0.9842479,0.00019864574,0.010952881,0.00008308314,0.000066412584,0.00007152958,0.00012914602,0.000027106413,0.0042231744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997427,0.00007644347,0.000010861933,0.00005820234,0.000038273258,0.00007361473],"domain_scores_gemma":[0.99818474,0.001342023,0.00013463308,0.000047570855,0.00019749641,0.00009356476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000802363,0.0007300625,0.0014512637,0.0004471515,0.00048262172,0.0007944366,0.0012229693,0.0018799932,0.0038695529],"category_scores_gemma":[0.0037263578,0.0005528305,0.0003805444,0.00048668386,0.00073073036,0.0010740407,0.0009927389,0.0012630661,0.0001650387],"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.00011366805,0.00002539002,0.00027648156,0.000048221835,0.00001662925,0.000030156658,0.000015595077,0.99039394,0.00035403916,0.0028983087,0.00068609376,0.005141468],"study_design_scores_gemma":[0.0000061466835,0.0000048982924,0.000026304839,9.201249e-7,0.0000016860248,0.0000013530986,0.0000022798909,0.9992256,0.00003085856,0.0006774642,0.000021487203,9.300535e-7],"about_ca_topic_score_codex":0.013179886,"about_ca_topic_score_gemma":0.009206168,"teacher_disagreement_score":0.013179886,"about_ca_system_score_codex":0.0011914899,"about_ca_system_score_gemma":0.0011144286,"threshold_uncertainty_score":0.026206374},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09926477,0.0020498442,0.8916309,0.0009713931,0.00025424745,0.00018016211,0.00022703431,0.001297932,0.0041238004],"genre_scores_gemma":[0.934058,0.00034261757,0.06318074,0.000084058185,0.00008984425,0.00008921193,0.00019925501,0.000051285337,0.0019049828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989209,0.00023861519,0.00010355738,0.00014970571,0.0003514977,0.00023561313],"domain_scores_gemma":[0.9975986,0.0008068231,0.00025773846,0.00087392173,0.00034305057,0.00011990216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015762842,0.0005953562,0.0009968099,0.0008008838,0.000997513,0.0013665004,0.0016815483,0.0005641779,0.001785235],"category_scores_gemma":[0.0041208323,0.00032648837,0.00026479494,0.0009455938,0.0007069619,0.0044752304,0.00275108,0.00084419025,0.00032645787],"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.0013880492,0.0002788514,0.0015354813,0.00031809494,0.00016093938,0.00039536096,0.00033522275,0.5067034,0.07481194,0.06849154,0.01420227,0.3313789],"study_design_scores_gemma":[0.000066963636,0.00008424448,0.00029619713,0.00000922175,0.00003636499,0.00009532467,0.00012155929,0.9515321,0.010734039,0.034144513,0.002861844,0.000017586688],"about_ca_topic_score_codex":0.000978207,"about_ca_topic_score_gemma":0.0019302765,"teacher_disagreement_score":0.001785235,"about_ca_system_score_codex":0.0008102939,"about_ca_system_score_gemma":0.00091607234,"threshold_uncertainty_score":0.008336306},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009041506,0.00007869012,0.98771477,0.0001325519,0.000035499746,0.000044718756,0.00007042001,0.0006686862,0.0022132378],"genre_scores_gemma":[0.4471333,0.00011227778,0.5497991,0.00009646549,0.000055352375,0.00007930201,0.00015384225,0.0000901142,0.002480233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993042,0.00014508262,0.00005392064,0.00011888981,0.00029785265,0.00008004891],"domain_scores_gemma":[0.99918884,0.00023262094,0.000053914933,0.00010645725,0.0003284106,0.000089733665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015640738,0.0003882239,0.00058528635,0.0006750083,0.0008459582,0.0015494735,0.0015724337,0.00081239326,0.003403727],"category_scores_gemma":[0.0023150314,0.00021993033,0.0006905694,0.0006540022,0.0004952016,0.0012508765,0.0011190531,0.00093976577,0.00047330337],"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.00038000525,0.00025648007,0.0021762457,0.0002334781,0.000106257496,0.0004585268,0.00027967957,0.5581842,0.020789199,0.18910712,0.0060179685,0.22201088],"study_design_scores_gemma":[0.0000118798425,0.000018652507,0.0001396367,0.0000071186764,0.0000145119375,0.0000388477,0.0000210637,0.98162043,0.0020693846,0.014481517,0.001566304,0.000010638699],"about_ca_topic_score_codex":0.008284908,"about_ca_topic_score_gemma":0.0097264545,"teacher_disagreement_score":0.008284908,"about_ca_system_score_codex":0.0010920345,"about_ca_system_score_gemma":0.0016371616,"threshold_uncertainty_score":0.016473353},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79555726,0.0049880077,0.1301739,0.0014916789,0.00092808914,0.0002189624,0.0010959937,0.014981657,0.05056447],"genre_scores_gemma":[0.94529957,0.0005263185,0.042000536,0.00033731395,0.00008282245,0.000106238476,0.0008107573,0.0004795236,0.01035692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961686,0.00006973373,0.000019121662,0.00006040404,0.00012227206,0.000111598594],"domain_scores_gemma":[0.99922955,0.00023480493,0.00003395303,0.00024053207,0.00020260666,0.000058500485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024807797,0.00055222225,0.00050561316,0.00063645956,0.00086685445,0.0007665502,0.0012911747,0.00048270248,0.0069292807],"category_scores_gemma":[0.001982164,0.00037423774,0.00024143829,0.0017293865,0.00039857862,0.001005344,0.0008963768,0.00066534587,0.001295451],"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.004070529,0.00057437626,0.010220243,0.000619968,0.0001778746,0.0008880293,0.0005456892,0.26264885,0.070057325,0.019717326,0.086952426,0.54352736],"study_design_scores_gemma":[0.00027751888,0.00039284007,0.0039465493,0.00004497122,0.0000777678,0.00020167643,0.00021055338,0.91849685,0.037146512,0.018966565,0.020186486,0.000051701372],"about_ca_topic_score_codex":0.0055152024,"about_ca_topic_score_gemma":0.0128338635,"teacher_disagreement_score":0.0069292807,"about_ca_system_score_codex":0.0005081669,"about_ca_system_score_gemma":0.0010422037,"threshold_uncertainty_score":0.023180723},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68390614,0.00059005513,0.3076567,0.0003702086,0.00015047833,0.000059828923,0.00009330554,0.002668539,0.0045047724],"genre_scores_gemma":[0.89318085,0.00020939895,0.10331511,0.000061668645,0.000047143683,0.000022422706,0.00012065859,0.00032683264,0.0027158891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992312,0.0001362081,0.00004310203,0.0000923609,0.00035470983,0.00014235699],"domain_scores_gemma":[0.99721295,0.0012992333,0.00022252873,0.0005441916,0.0006160656,0.00010506631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011692735,0.00063257595,0.00059383037,0.0006826964,0.0008809399,0.0016524334,0.0013131165,0.00056895294,0.0019003547],"category_scores_gemma":[0.005019973,0.00041620157,0.0005327064,0.0010590274,0.0010799299,0.0026851096,0.00067666295,0.00079795206,0.00028064518],"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.0030771468,0.0005660495,0.026898067,0.00043781122,0.00015171422,0.00034380014,0.0006088185,0.4173716,0.17499678,0.055696554,0.0037882174,0.3160635],"study_design_scores_gemma":[0.000044241904,0.00012921152,0.0018376843,0.0000056237827,0.00005290893,0.00006606147,0.000091268776,0.92315584,0.060152378,0.013090423,0.0013536867,0.000020633423],"about_ca_topic_score_codex":0.006250449,"about_ca_topic_score_gemma":0.008523629,"teacher_disagreement_score":0.006250449,"about_ca_system_score_codex":0.00081543013,"about_ca_system_score_gemma":0.002144206,"threshold_uncertainty_score":0.012428105},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006035227,0.0017542898,0.00008615845,0.009923931,0.9874981,0.000015401054,0.00003350839,0.00002093912,0.00060725847],"genre_scores_gemma":[0.00041453063,0.0013248468,0.000060384005,0.006638033,0.9886507,0.000015515483,0.000024745625,0.000016085616,0.0028552848],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955741,0.00059447606,0.0006816394,0.0008436447,0.0018254941,0.00048070343],"domain_scores_gemma":[0.97821623,0.006495783,0.0023433722,0.0007381966,0.008362239,0.0038441762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061980193,0.004437823,0.0049466663,0.0044523324,0.0031363696,0.0070732804,0.003396033,0.015667554,0.017920475],"category_scores_gemma":[0.01949626,0.001478977,0.0042015933,0.0015296246,0.0020830065,0.0033688357,0.0015115624,0.015541503,0.0074618333],"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.0001350469,0.000049144244,0.00019216287,0.0003817557,0.00005984491,0.00044780303,0.000015754174,0.00006618475,0.00023269412,0.00033224875,0.9915651,0.0065223565],"study_design_scores_gemma":[0.00014051089,0.00011435836,0.0013684758,0.000404174,0.00015025029,0.0007561298,0.00006272145,0.00038927534,0.00027794926,0.00085422915,0.9954484,0.00003339607],"about_ca_topic_score_codex":0.0009837497,"about_ca_topic_score_gemma":0.0037173827,"teacher_disagreement_score":0.017920475,"about_ca_system_score_codex":0.0026309146,"about_ca_system_score_gemma":0.0023656974,"threshold_uncertainty_score":0.059949934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04152945,0.00030025374,0.94940054,0.0011026047,0.0002504999,0.00012490348,0.00028006858,0.0015465507,0.0054650814],"genre_scores_gemma":[0.9262683,0.00022797962,0.064866684,0.00019840506,0.0001963814,0.00009106753,0.00022237994,0.00012770985,0.0078011802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982332,0.0006582874,0.0001155462,0.0003310099,0.000430464,0.00023149574],"domain_scores_gemma":[0.99526286,0.002241684,0.00034400917,0.00086430716,0.00092581974,0.00036135633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003742084,0.0007038792,0.0015781741,0.0010437424,0.0010360404,0.0029563014,0.0030754255,0.0020501981,0.003878573],"category_scores_gemma":[0.010204199,0.00056697405,0.00079811976,0.0011469343,0.001496865,0.0047404165,0.002317666,0.0017132335,0.00080080586],"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.00058478134,0.00018488438,0.0018051062,0.00010789045,0.000107398424,0.00018524814,0.00014875499,0.770821,0.0022316067,0.15738195,0.006242815,0.06019848],"study_design_scores_gemma":[0.000013559197,0.000027835678,0.000055663422,0.0000025645568,0.000009115985,0.000015956295,0.0000060542015,0.9815014,0.00020075911,0.017593583,0.00056483457,0.000008568773],"about_ca_topic_score_codex":0.004978985,"about_ca_topic_score_gemma":0.004038463,"teacher_disagreement_score":0.004978985,"about_ca_system_score_codex":0.0015680977,"about_ca_system_score_gemma":0.0014964958,"threshold_uncertainty_score":0.019790292},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21978949,0.0018027573,0.77087253,0.0010710468,0.0003025967,0.00016105724,0.00019673993,0.0007022653,0.005101583],"genre_scores_gemma":[0.95013154,0.00044576864,0.045816604,0.000103136364,0.00020651337,0.000067856476,0.00013234487,0.00007028086,0.003025951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828136,0.00062678003,0.000104494524,0.00024365105,0.00044702584,0.00029675686],"domain_scores_gemma":[0.9938632,0.0036794879,0.0005345058,0.0007404957,0.0008651045,0.00031723856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029543708,0.0007295628,0.0015842151,0.0011934834,0.0018002095,0.0018108668,0.0029457046,0.0010322266,0.0018469434],"category_scores_gemma":[0.010759091,0.0009684229,0.0002644135,0.0018489126,0.00093455735,0.0030573444,0.0025602365,0.0009409636,0.0006664085],"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.0015438738,0.00049534097,0.005926384,0.00024674868,0.00012636874,0.0003275948,0.0005075623,0.7203133,0.014839065,0.020664282,0.0048247874,0.23018482],"study_design_scores_gemma":[0.000039275354,0.00011600194,0.0004762686,0.000008040888,0.00002831405,0.00012441988,0.00010711026,0.98795146,0.0015211581,0.008791329,0.00082433724,0.000012261241],"about_ca_topic_score_codex":0.001583397,"about_ca_topic_score_gemma":0.003598065,"teacher_disagreement_score":0.0029543708,"about_ca_system_score_codex":0.00095156056,"about_ca_system_score_gemma":0.0011645716,"threshold_uncertainty_score":0.015624344},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5098532,0.0060771387,0.4704152,0.0015630552,0.00041285812,0.00020824187,0.00041046258,0.0015690142,0.009490721],"genre_scores_gemma":[0.9638048,0.00034834858,0.03383438,0.00007023848,0.000072431816,0.000031223557,0.0000857313,0.00008730889,0.0016656504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982394,0.0005585933,0.00013944373,0.00017040643,0.00051556656,0.000376562],"domain_scores_gemma":[0.99067056,0.0037746092,0.0005658745,0.0026106737,0.0019602454,0.00041798016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002697923,0.0007577058,0.0019095206,0.0012184776,0.0018534765,0.0027231588,0.0034393312,0.0011767779,0.0024875638],"category_scores_gemma":[0.012057125,0.00063755177,0.00040654538,0.0025334395,0.00092591223,0.004719892,0.0018046716,0.00075815764,0.00029467352],"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.002175871,0.0004192046,0.005594362,0.00032528315,0.00022661078,0.00036671376,0.0003409403,0.749157,0.016327146,0.071408264,0.012459364,0.14119923],"study_design_scores_gemma":[0.000050243067,0.00006648455,0.0006631402,0.000012800189,0.00007889719,0.000092515635,0.000089987996,0.9779628,0.0031503786,0.016624808,0.0011765006,0.00003153019],"about_ca_topic_score_codex":0.006457879,"about_ca_topic_score_gemma":0.009932108,"teacher_disagreement_score":0.006457879,"about_ca_system_score_codex":0.0027602462,"about_ca_system_score_gemma":0.001981638,"threshold_uncertainty_score":0.020027101},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046986975,0.0008440166,0.9235337,0.0007846996,0.0002517977,0.00011926067,0.00011183103,0.00036957092,0.026998088],"genre_scores_gemma":[0.7922225,0.00069036585,0.1825837,0.00035043407,0.00037212603,0.00039914405,0.00019753243,0.00062552467,0.022558676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961793,0.00014268071,0.000010288012,0.000032238324,0.00013537705,0.00006148759],"domain_scores_gemma":[0.99939895,0.00036957397,0.000030644413,0.000042821663,0.00012774546,0.000030268364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070002634,0.00076222996,0.0008586694,0.00078614743,0.0007239436,0.0011578193,0.0013215238,0.0011957018,0.0061044088],"category_scores_gemma":[0.0020521444,0.0005435179,0.0011372827,0.0008383436,0.000585926,0.0010345101,0.0010356348,0.00098115,0.00054765336],"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.000058725822,0.000053217937,0.00024203215,0.000054083273,0.000056394696,0.000035739602,0.000023315184,0.95295626,0.0015711313,0.029856816,0.0011237083,0.013968608],"study_design_scores_gemma":[0.000003115838,0.000005832849,0.00004323081,0.0000013802364,0.0000036255653,0.0000023376908,0.0000024562444,0.9971373,0.00009016754,0.0024351033,0.00027334783,0.0000020115137],"about_ca_topic_score_codex":0.0066799615,"about_ca_topic_score_gemma":0.00505923,"teacher_disagreement_score":0.0066799615,"about_ca_system_score_codex":0.0008413783,"about_ca_system_score_gemma":0.0010384633,"threshold_uncertainty_score":0.020421267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15273955,0.00063005293,0.8319048,0.0007817955,0.0006704186,0.00031958485,0.00022986323,0.0045040995,0.008219712],"genre_scores_gemma":[0.81772727,0.00015711196,0.17361939,0.00018398368,0.00024756815,0.0002132539,0.00025847714,0.00029487966,0.007298022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931157,0.00016000734,0.00004979078,0.000082046194,0.0002718392,0.00012472429],"domain_scores_gemma":[0.99856865,0.00024483984,0.00008888111,0.00057788874,0.00035578324,0.00016382182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010768515,0.0005777593,0.0011050496,0.0008913819,0.0019473605,0.001310793,0.0024927016,0.0008742548,0.0059985016],"category_scores_gemma":[0.0026919062,0.00032682283,0.00034608183,0.0011850557,0.0008429254,0.0019571632,0.0025534544,0.00090203446,0.0010943016],"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.005172171,0.0008961302,0.0022967902,0.00033475278,0.00017806227,0.00022945166,0.0010730631,0.23171765,0.077056535,0.08161428,0.030996043,0.56843513],"study_design_scores_gemma":[0.00038839792,0.0003616264,0.0004802672,0.000014596606,0.00006965384,0.000058051846,0.000099903446,0.9385939,0.010614099,0.03911042,0.010161819,0.00004732616],"about_ca_topic_score_codex":0.0020250075,"about_ca_topic_score_gemma":0.0027270983,"teacher_disagreement_score":0.0059985016,"about_ca_system_score_codex":0.00088667125,"about_ca_system_score_gemma":0.0009995297,"threshold_uncertainty_score":0.020066977},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058046794,0.00015981513,0.98216176,0.000075737065,0.00021028508,0.000118826254,0.0008129952,0.009247326,0.0014085845],"genre_scores_gemma":[0.074372835,0.0003210915,0.9079271,0.00019996912,0.00031735096,0.00034556803,0.005543703,0.0030194193,0.007952994],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997465,0.00048491333,0.00031855953,0.0007098547,0.0008117599,0.00020989041],"domain_scores_gemma":[0.9964618,0.001097847,0.00022609295,0.0013608861,0.00066317595,0.00019020749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003874108,0.0015037812,0.0018526228,0.0028259621,0.0011663246,0.0021437765,0.0029780837,0.0016893005,0.0167741],"category_scores_gemma":[0.013380808,0.0009101518,0.0026912573,0.0038742959,0.0009962403,0.0036845766,0.0043359273,0.0021704652,0.011249424],"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.001476418,0.00043304544,0.002370878,0.00049216655,0.00030014178,0.0006362491,0.00030980638,0.03976466,0.02999714,0.043293335,0.034398574,0.84652764],"study_design_scores_gemma":[0.00017827173,0.00030239645,0.001340861,0.000079450474,0.00009568643,0.0006775152,0.0001281017,0.8394486,0.026637373,0.08751726,0.0435057,0.000088807115],"about_ca_topic_score_codex":0.002752987,"about_ca_topic_score_gemma":0.0039524157,"teacher_disagreement_score":0.0167741,"about_ca_system_score_codex":0.0004865317,"about_ca_system_score_gemma":0.0022748963,"threshold_uncertainty_score":0.056114912},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9948803,0.00038276988,0.0022391274,0.00017378325,0.000029461768,0.000019052248,0.00017057302,0.0003381468,0.0017667135],"genre_scores_gemma":[0.99928266,0.000047517024,0.00023656929,0.00001702555,0.000010491678,0.000006748763,0.00010232022,0.000038526287,0.00025811128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978229,0.0005311734,0.000119288736,0.0003164959,0.00061991415,0.000590238],"domain_scores_gemma":[0.9660935,0.022769518,0.0023775506,0.0031738726,0.00411974,0.0014658816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031814869,0.0005781697,0.0005761769,0.0011102187,0.00094490167,0.0012233579,0.0008975925,0.0011828543,0.0016886861],"category_scores_gemma":[0.029820347,0.00040946848,0.00041547418,0.0011846799,0.0013161058,0.0017607554,0.0007901347,0.0021009662,0.00037691425],"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.00971381,0.0024842499,0.127739,0.0004932539,0.0006406995,0.0019527257,0.0017726319,0.64395696,0.12853009,0.0073471935,0.0067281583,0.06864125],"study_design_scores_gemma":[0.00013358735,0.001231017,0.068777524,0.00007427644,0.00031240372,0.0012041945,0.0005718761,0.8739145,0.049703464,0.003165114,0.0007678497,0.00014417648],"about_ca_topic_score_codex":0.0038291623,"about_ca_topic_score_gemma":0.0025810872,"teacher_disagreement_score":0.0038291623,"about_ca_system_score_codex":0.0013088401,"about_ca_system_score_gemma":0.00074799056,"threshold_uncertainty_score":0.016825497},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04297561,0.0001991177,0.9503113,0.00016152054,0.00004389375,0.000043671782,0.00019455244,0.00033567724,0.005734699],"genre_scores_gemma":[0.7304813,0.0007172883,0.2538153,0.00021437956,0.00029017057,0.0002955468,0.0010231514,0.00095162063,0.012211275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997106,0.00009457452,0.000010416267,0.00007427084,0.00007464542,0.00003554658],"domain_scores_gemma":[0.9969829,0.0020223164,0.00020194225,0.000294661,0.0003744896,0.00012370173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070453045,0.0006796618,0.00075312203,0.0026267834,0.00050497235,0.0009593181,0.0018515915,0.001401485,0.0064828526],"category_scores_gemma":[0.0045459303,0.00053616444,0.0008840523,0.0013221464,0.0009939593,0.002086706,0.0009682651,0.00134785,0.0012111546],"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.000036377092,0.00010666748,0.0024670127,0.00015013576,0.00003730715,0.00027178737,0.00020112123,0.30104953,0.00496531,0.6094773,0.004954538,0.07628291],"study_design_scores_gemma":[0.0000033838965,0.000014033865,0.00035146685,0.000010746784,0.000007808697,0.000063113046,0.000021274616,0.8369945,0.00056620024,0.16097112,0.0009870108,0.000009191475],"about_ca_topic_score_codex":0.0012363401,"about_ca_topic_score_gemma":0.00143367,"teacher_disagreement_score":0.0064828526,"about_ca_system_score_codex":0.00081366114,"about_ca_system_score_gemma":0.0005412199,"threshold_uncertainty_score":0.02168727},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044628207,0.03413205,0.0055640475,0.038269058,0.8638634,0.00012402175,0.00039275142,0.0002365531,0.056971822],"genre_scores_gemma":[0.004407421,0.028723868,0.0019169291,0.008712239,0.85686374,0.00014388861,0.0007544849,0.0002916367,0.09818581],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971136,0.0005866629,0.00030213682,0.00040667015,0.0013612369,0.0002296185],"domain_scores_gemma":[0.9911773,0.003301056,0.0005837077,0.0009001343,0.0029036666,0.0011341242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003217492,0.002305668,0.0030690797,0.0045477,0.0018378481,0.0058968943,0.0028537754,0.005007979,0.077049986],"category_scores_gemma":[0.009495574,0.00059640466,0.0015677656,0.0027789462,0.0019516151,0.005124033,0.0022107426,0.0048687365,0.0280835],"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.000023744256,0.000023927974,0.000081160484,0.00027181534,0.000017225357,0.00004710608,0.000022644701,0.00010376051,0.00017736026,0.009633828,0.97080743,0.018789995],"study_design_scores_gemma":[0.000016278384,0.000042327498,0.00042120361,0.00022582835,0.000027340988,0.00021221512,0.000028182078,0.0004804634,0.0002058549,0.013291411,0.985036,0.00001282713],"about_ca_topic_score_codex":0.00088046904,"about_ca_topic_score_gemma":0.0018228577,"teacher_disagreement_score":0.077049986,"about_ca_system_score_codex":0.0021005594,"about_ca_system_score_gemma":0.0021732852,"threshold_uncertainty_score":0.2577579},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82014716,0.0039199707,0.16154559,0.000993078,0.00024446123,0.0000415162,0.00006003174,0.0048710275,0.008177123],"genre_scores_gemma":[0.98130715,0.00019596747,0.016816763,0.0000744786,0.000056530203,0.000017104774,0.00003891713,0.00011959891,0.0013736193],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989944,0.0002621773,0.00004670601,0.00011626638,0.0003608092,0.0002196173],"domain_scores_gemma":[0.9954886,0.0018945031,0.00027994564,0.0012635544,0.0008109562,0.00026237857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011071791,0.0004378335,0.0005622877,0.000734414,0.000993564,0.0012512334,0.0025474655,0.0005703893,0.0028375955],"category_scores_gemma":[0.005991437,0.0003543196,0.00023199013,0.001378809,0.00090900355,0.002129742,0.0012703551,0.0010341139,0.0006080826],"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.0043320535,0.0013692714,0.014814842,0.00037244533,0.00019097881,0.00033068337,0.00082014,0.20021497,0.2311204,0.03341387,0.0104399575,0.5025803],"study_design_scores_gemma":[0.00021221713,0.0006527024,0.0014037589,0.000015160567,0.00013317737,0.000118953256,0.00015404267,0.90584683,0.07672502,0.011570155,0.0031232582,0.00004469323],"about_ca_topic_score_codex":0.0021245384,"about_ca_topic_score_gemma":0.0040230267,"teacher_disagreement_score":0.0028375955,"about_ca_system_score_codex":0.00081991334,"about_ca_system_score_gemma":0.0017802641,"threshold_uncertainty_score":0.009492695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9694251,0.00066429615,0.010307166,0.0002671514,0.000046685676,0.000034027027,0.00028645777,0.00012080772,0.018848268],"genre_scores_gemma":[0.9972946,0.0001247917,0.001274136,0.000019939458,0.0000056523695,0.0000111546415,0.00010557776,0.00001932873,0.0011447921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983335,0.00004566129,0.000006490449,0.000018527888,0.000046002606,0.000049968803],"domain_scores_gemma":[0.99898857,0.00062454527,0.000060955103,0.000065952954,0.00021808803,0.000041896743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043683127,0.00040421187,0.00044714403,0.0005637054,0.00030783843,0.0004470243,0.0007514474,0.0005710938,0.0037677435],"category_scores_gemma":[0.0015903474,0.00019154779,0.0005606592,0.00108292,0.00026689895,0.0007598465,0.00018865241,0.00038867438,0.00024757042],"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.0001790984,0.00007806952,0.0029881136,0.000068504705,0.00003394698,0.00010119841,0.000033663564,0.9869027,0.0022957304,0.0015260342,0.0006210172,0.0051719462],"study_design_scores_gemma":[0.00001706568,0.00013724939,0.0016707041,0.000004332565,0.000020322646,0.000024775802,0.00003254631,0.99628496,0.0010090035,0.00037344563,0.00042026475,0.000005247631],"about_ca_topic_score_codex":0.0077204076,"about_ca_topic_score_gemma":0.007326287,"teacher_disagreement_score":0.0077204076,"about_ca_system_score_codex":0.00062823587,"about_ca_system_score_gemma":0.00050708576,"threshold_uncertainty_score":0.015350938},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06087622,0.0010877798,0.93052465,0.00048517674,0.000295904,0.000121483936,0.000082642044,0.00092750107,0.00559858],"genre_scores_gemma":[0.7592251,0.00063261384,0.23273225,0.00016685555,0.00006315246,0.00015931902,0.0001795178,0.00011516069,0.006725972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997894,0.00005225814,0.00001634689,0.000030051711,0.000095471085,0.000016511704],"domain_scores_gemma":[0.9996233,0.00014360937,0.000039970302,0.00006625896,0.000091920076,0.00003506237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036206385,0.00026187528,0.0004646272,0.0003828074,0.00043179674,0.0005123495,0.0008970864,0.0004894072,0.0009130882],"category_scores_gemma":[0.0013681015,0.00016957188,0.00025551653,0.00045424033,0.00025436562,0.0007045809,0.0007318628,0.0006207488,0.00019626516],"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.00060318864,0.0002669162,0.0012304755,0.00038875284,0.00018954813,0.00034396065,0.00045104016,0.37587187,0.13880466,0.04456959,0.010314137,0.42696583],"study_design_scores_gemma":[0.000041376028,0.0001123,0.0002219157,0.000006542344,0.000031234795,0.00011678655,0.000034125896,0.98218936,0.0067163636,0.0041507157,0.0063639185,0.000015321384],"about_ca_topic_score_codex":0.0009826472,"about_ca_topic_score_gemma":0.0016603511,"teacher_disagreement_score":0.0009826472,"about_ca_system_score_codex":0.0002738582,"about_ca_system_score_gemma":0.00038401486,"threshold_uncertainty_score":0.0030545592},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103043094,0.0047037476,0.8335335,0.0030037938,0.0012207192,0.00015953407,0.00019396354,0.0029934547,0.05114819],"genre_scores_gemma":[0.8294628,0.0023501776,0.14497103,0.00052380824,0.0006112034,0.00026351068,0.0006631517,0.0017326826,0.019421525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979115,0.0009798085,0.00009032986,0.0002220482,0.0004245305,0.00037170193],"domain_scores_gemma":[0.9944469,0.0025967606,0.0003096255,0.0016665979,0.0006185466,0.00036147248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025935622,0.000915274,0.0012651742,0.0014502889,0.0019510782,0.002808474,0.0022159163,0.0011433973,0.00609751],"category_scores_gemma":[0.015764734,0.0009227488,0.00049950223,0.0020940765,0.0030551518,0.0048287087,0.0049863467,0.0027609093,0.0013724504],"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.0015413191,0.00012547038,0.0024817043,0.000222535,0.00006084607,0.00023085349,0.00051010645,0.28501073,0.005249726,0.5225788,0.0287456,0.15324229],"study_design_scores_gemma":[0.000105101055,0.00005122392,0.00035060072,0.000042927997,0.000026924747,0.00007562951,0.00007425871,0.73489815,0.0026214945,0.24756397,0.014162575,0.000027157044],"about_ca_topic_score_codex":0.0027990923,"about_ca_topic_score_gemma":0.0034224682,"teacher_disagreement_score":0.00609751,"about_ca_system_score_codex":0.001391331,"about_ca_system_score_gemma":0.0013184871,"threshold_uncertainty_score":0.02039814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021722594,0.00017246832,0.9757873,0.00022393427,0.00009120873,0.00007148999,0.00041592485,0.0010353135,0.0004796753],"genre_scores_gemma":[0.32986298,0.00026584393,0.6634223,0.00015331153,0.0001506489,0.0002455012,0.0034526675,0.00020899218,0.0022377488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803346,0.00042794837,0.00017101428,0.00045151086,0.0005961027,0.00032000509],"domain_scores_gemma":[0.9965509,0.00082984776,0.00024616014,0.0009798006,0.0012460633,0.00014715022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027958509,0.00066589867,0.0023083086,0.0014425231,0.001984297,0.0017131902,0.00376934,0.0010241639,0.002528891],"category_scores_gemma":[0.0067359773,0.0006743428,0.0022834972,0.0034875297,0.00053937803,0.0021469237,0.0019568577,0.0019654918,0.0012394949],"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.0008843162,0.00063059496,0.01926575,0.0001886605,0.00059420965,0.0005054164,0.0002721013,0.37956402,0.005086749,0.013779659,0.020185327,0.5590432],"study_design_scores_gemma":[0.000020602032,0.00002596913,0.0012339255,0.0000069790453,0.00002753286,0.000056263154,0.000043374588,0.99218047,0.001302932,0.0041534943,0.0009355322,0.000012915755],"about_ca_topic_score_codex":0.013225959,"about_ca_topic_score_gemma":0.01074453,"teacher_disagreement_score":0.013225959,"about_ca_system_score_codex":0.00088587246,"about_ca_system_score_gemma":0.0035627394,"threshold_uncertainty_score":0.026297987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034578055,0.00033115005,0.9463059,0.00013295417,0.00009992635,0.00016112668,0.00013710384,0.01244437,0.0058094156],"genre_scores_gemma":[0.6020746,0.00019346864,0.391246,0.00017112034,0.00006993604,0.00030097956,0.00036946769,0.0014751292,0.0040992834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993236,0.000116638366,0.000040176885,0.00011724662,0.0002823094,0.00012008807],"domain_scores_gemma":[0.9995049,0.00011314709,0.000039169397,0.00012997256,0.00014474384,0.00006798281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007856959,0.0006431444,0.0008214528,0.00078357547,0.00085925014,0.0011283305,0.0020137345,0.00072758674,0.0046247984],"category_scores_gemma":[0.0020472724,0.00038562017,0.00053182995,0.00058402197,0.00040229288,0.0008698787,0.001097321,0.0009123177,0.0010688335],"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.0010220348,0.0006167216,0.004634159,0.00040587806,0.000227443,0.00031135482,0.00035195562,0.44045827,0.115199216,0.035258487,0.014068502,0.3874459],"study_design_scores_gemma":[0.000054817374,0.000040268973,0.00034443862,0.0000084580715,0.000018994688,0.000035088673,0.000018609968,0.98114485,0.010203361,0.0036463942,0.0044649336,0.000019886756],"about_ca_topic_score_codex":0.0031716153,"about_ca_topic_score_gemma":0.0033896691,"teacher_disagreement_score":0.0046247984,"about_ca_system_score_codex":0.0007085098,"about_ca_system_score_gemma":0.0012749054,"threshold_uncertainty_score":0.015471458},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33696625,0.0028460186,0.6429581,0.0023851262,0.0004934544,0.0001631426,0.00035702213,0.0017884633,0.01204241],"genre_scores_gemma":[0.9723734,0.00030595873,0.025078734,0.00007597141,0.00006775976,0.000025157746,0.00006926306,0.000098662764,0.0019051202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865854,0.00036100863,0.000064935615,0.000190649,0.00034454121,0.00038034265],"domain_scores_gemma":[0.9961887,0.0018464843,0.00037930056,0.0007226992,0.0005493205,0.00031348807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015881812,0.0008073305,0.0010456578,0.0005163466,0.0018711362,0.0020565356,0.0022054487,0.0010985327,0.002226514],"category_scores_gemma":[0.007925904,0.0005011681,0.00031617665,0.0016578316,0.0010813407,0.003160006,0.0021013853,0.00079301995,0.00040525149],"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.0006543289,0.00012642115,0.002905854,0.0001647318,0.00005193333,0.00016249028,0.00024805558,0.88873786,0.0075208414,0.045237638,0.004743525,0.049446415],"study_design_scores_gemma":[0.000035201545,0.00010203358,0.00065080344,0.000008299793,0.00002996236,0.00006503083,0.00026956637,0.9593427,0.0023344373,0.03519008,0.0019575385,0.000014336859],"about_ca_topic_score_codex":0.008390183,"about_ca_topic_score_gemma":0.011135594,"teacher_disagreement_score":0.008390183,"about_ca_system_score_codex":0.001546566,"about_ca_system_score_gemma":0.0027067878,"threshold_uncertainty_score":0.016682684},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4368338,0.0013400352,0.5530288,0.0014043052,0.0004342352,0.00012244884,0.0002648959,0.0017162185,0.0048552887],"genre_scores_gemma":[0.84824306,0.00034062917,0.14840636,0.00024887462,0.00018309992,0.000111208756,0.0006275367,0.0001418007,0.0016974357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927646,0.00023325803,0.00006202275,0.00013800313,0.0002128409,0.00007739074],"domain_scores_gemma":[0.9975957,0.00123405,0.000209067,0.0003647456,0.0005013227,0.000095000236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028314968,0.0008883901,0.0010544951,0.0012901709,0.00059527456,0.0015437029,0.0008993269,0.0009284026,0.00079446007],"category_scores_gemma":[0.0063724923,0.00030591537,0.0006145378,0.0010603842,0.00053233485,0.0018158504,0.0009685677,0.0010812825,0.00047370957],"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.0006659612,0.00050486164,0.013583306,0.00015410807,0.00023553948,0.00008566126,0.00023824754,0.5873432,0.01401512,0.0062059467,0.0074397745,0.36952826],"study_design_scores_gemma":[0.000012483766,0.000034353692,0.00065594405,0.0000031806,0.000007844205,0.000007393396,0.000016320626,0.996222,0.0012470975,0.0015166027,0.00027353063,0.0000032102082],"about_ca_topic_score_codex":0.0024958088,"about_ca_topic_score_gemma":0.0016646993,"teacher_disagreement_score":0.0028314968,"about_ca_system_score_codex":0.00071946956,"about_ca_system_score_gemma":0.0006444625,"threshold_uncertainty_score":0.014974594},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33728227,0.0013657059,0.6086571,0.0009595452,0.0012728248,0.00016119248,0.0014674084,0.018040182,0.030793788],"genre_scores_gemma":[0.6658505,0.00033565477,0.31705916,0.00025153172,0.000079594254,0.000092250244,0.0011938473,0.0004285392,0.014708852],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99986315,0.000016796474,0.000007690244,0.00003106773,0.00005657383,0.00002462176],"domain_scores_gemma":[0.9997031,0.00005951973,0.000013165727,0.000051807303,0.00014776201,0.000024675452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021541596,0.00044671714,0.000440322,0.0004123865,0.0003563987,0.00060526,0.0011459794,0.0005045949,0.0066650882],"category_scores_gemma":[0.0008134627,0.00023654818,0.00030449076,0.00078258966,0.00019951804,0.00071807834,0.0004913702,0.0007332021,0.0015443321],"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.0014186068,0.0005947196,0.0035440677,0.0003287544,0.00024898583,0.0003747403,0.00013569075,0.2953408,0.06943935,0.008642597,0.037906386,0.5820253],"study_design_scores_gemma":[0.000026028663,0.0000377184,0.0003428287,0.0000037031762,0.000014111984,0.000023863773,0.000009838982,0.9886819,0.007948078,0.0013967155,0.0015082614,0.0000070710703],"about_ca_topic_score_codex":0.01379674,"about_ca_topic_score_gemma":0.025517974,"teacher_disagreement_score":0.01379674,"about_ca_system_score_codex":0.00055348297,"about_ca_system_score_gemma":0.0010761746,"threshold_uncertainty_score":0.027432859},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10843113,0.0006358093,0.88636684,0.00013366631,0.00010419061,0.00016338188,0.0005459411,0.0022276957,0.001391238],"genre_scores_gemma":[0.3946616,0.00033215876,0.5983428,0.00012167766,0.0001153274,0.00022537982,0.0027708474,0.00029834377,0.003131861],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806684,0.00032524168,0.00025510622,0.000687453,0.0004821286,0.0001833341],"domain_scores_gemma":[0.9967739,0.0014085378,0.0002934124,0.00052791974,0.00084735616,0.0001488755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035497874,0.00091865164,0.0018743611,0.005837472,0.0013093662,0.0018201283,0.0021438664,0.0015305796,0.004731541],"category_scores_gemma":[0.007231791,0.00060691906,0.0017949004,0.00529163,0.00062033004,0.002117505,0.0017578898,0.0010050557,0.0019174152],"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.0009778601,0.0009369489,0.023338722,0.00020069852,0.0007944312,0.0004834563,0.00020677573,0.06996732,0.016577711,0.0056154644,0.005402067,0.8754986],"study_design_scores_gemma":[0.000042943768,0.00014306088,0.005219998,0.0000130303315,0.00012887057,0.00023552294,0.00009286361,0.9836728,0.0036870157,0.004886618,0.001852012,0.000025372368],"about_ca_topic_score_codex":0.006473403,"about_ca_topic_score_gemma":0.0061227316,"teacher_disagreement_score":0.006473403,"about_ca_system_score_codex":0.0004321896,"about_ca_system_score_gemma":0.0015579633,"threshold_uncertainty_score":0.018773258},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108063504,0.0012320689,0.88446087,0.0012470802,0.00013736093,0.00021508665,0.00015784263,0.0013700057,0.0031161786],"genre_scores_gemma":[0.5969499,0.00050802244,0.39811224,0.00022823847,0.00010032853,0.00014787771,0.00027217102,0.00014472379,0.0035366232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864656,0.00053418474,0.00008923629,0.00024478353,0.00040950277,0.000075647804],"domain_scores_gemma":[0.9931706,0.0046485234,0.00033863747,0.00073439756,0.00090618996,0.00020168486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003346641,0.00061790197,0.00075224915,0.0010631324,0.00058686355,0.0019182905,0.0022639,0.0011824392,0.00149179],"category_scores_gemma":[0.009396997,0.00025976458,0.0004792095,0.0013472063,0.000883151,0.0015030146,0.001457895,0.0018423409,0.00042986585],"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.00056004425,0.0008132941,0.014037615,0.00043310787,0.00021228695,0.00063456706,0.0016024122,0.15227985,0.010262515,0.018089572,0.0054258867,0.7956489],"study_design_scores_gemma":[0.000032159158,0.000109438195,0.000993643,0.00001918528,0.000023817018,0.00016614588,0.00030814065,0.9766814,0.0031970378,0.015215908,0.003240295,0.000012842096],"about_ca_topic_score_codex":0.0032332852,"about_ca_topic_score_gemma":0.005246078,"teacher_disagreement_score":0.003346641,"about_ca_system_score_codex":0.0004951122,"about_ca_system_score_gemma":0.0013234138,"threshold_uncertainty_score":0.017698944},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0748899,0.00076058315,0.9120309,0.0003330116,0.00012357486,0.00011050864,0.000075564945,0.00034582082,0.011330122],"genre_scores_gemma":[0.34122077,0.0005563565,0.65293866,0.00012828504,0.00005566104,0.00030478524,0.0002443503,0.00010472288,0.004446452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969935,0.00010339463,0.00001655062,0.000038793183,0.000104049854,0.00003791435],"domain_scores_gemma":[0.99941623,0.00039695037,0.00004275193,0.000045435125,0.00008077294,0.000017864828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000734618,0.0006084841,0.0009330142,0.0011019008,0.00055893924,0.0007440648,0.00089363294,0.0014290287,0.0039691674],"category_scores_gemma":[0.0041273697,0.00045094403,0.0007769565,0.0012486945,0.0006657512,0.0012492166,0.0008330933,0.0008649931,0.00048933394],"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.00016265878,0.00012257887,0.00087013916,0.00015970094,0.0000763192,0.0001216572,0.00010107344,0.8730178,0.0020436,0.026909705,0.0019060823,0.09450876],"study_design_scores_gemma":[0.000026047324,0.000039474697,0.00008877751,0.000011919945,0.000009977987,0.000036185967,0.000024503104,0.9899099,0.00035064833,0.0087342905,0.00076513266,0.0000032160701],"about_ca_topic_score_codex":0.0017690101,"about_ca_topic_score_gemma":0.0018006285,"teacher_disagreement_score":0.0039691674,"about_ca_system_score_codex":0.00050079083,"about_ca_system_score_gemma":0.0007653357,"threshold_uncertainty_score":0.013278186},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010370057,0.00007626169,0.98554265,0.000029463226,0.000015722173,0.000040037517,0.000031880987,0.00025333103,0.0036405763],"genre_scores_gemma":[0.46162704,0.00017381416,0.53201574,0.00006704048,0.000027996193,0.00033374658,0.0001741201,0.00017769322,0.00540286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998776,0.000020212748,0.0000045028287,0.00002300207,0.000060558934,0.00001410316],"domain_scores_gemma":[0.9998951,0.00003732061,0.000012466122,0.000009291995,0.000037075763,0.000008739951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003039533,0.0006580186,0.0007646657,0.00031936372,0.00035609677,0.00040542477,0.0014126397,0.0011163454,0.0036484196],"category_scores_gemma":[0.00044643943,0.00035381483,0.0006640874,0.0002520377,0.0003057212,0.00032590373,0.00064098433,0.00053717446,0.0005374846],"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.000029700037,0.000032151824,0.00022085606,0.00008640134,0.000023469334,0.00008283287,0.000032039246,0.94775844,0.00795174,0.0066771195,0.00057170494,0.036533486],"study_design_scores_gemma":[0.0000047553526,0.00002027458,0.000033007113,0.0000028045774,0.0000029085497,0.000009501064,0.000003352209,0.9983127,0.0005172869,0.0005162958,0.00057500636,0.0000020835507],"about_ca_topic_score_codex":0.0033138648,"about_ca_topic_score_gemma":0.004667851,"teacher_disagreement_score":0.0036484196,"about_ca_system_score_codex":0.0003453997,"about_ca_system_score_gemma":0.00061371253,"threshold_uncertainty_score":0.012205243},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02159827,0.00010493725,0.9760692,0.00017555224,0.000030714953,0.00003162453,0.00003408673,0.00016162438,0.001794024],"genre_scores_gemma":[0.8195535,0.00020267336,0.17416231,0.00007708843,0.00006267879,0.00009360735,0.000110157656,0.000037102993,0.0057008984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874985,0.0004080037,0.000075257834,0.0002128653,0.00039870854,0.00015533304],"domain_scores_gemma":[0.9988182,0.00043192809,0.00012150126,0.0001014373,0.000451373,0.00007554157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020028825,0.00057345943,0.0008889045,0.00094689196,0.00075004663,0.002120406,0.001290855,0.00101691,0.0027220026],"category_scores_gemma":[0.002879568,0.00025960265,0.0009913344,0.00088856916,0.0005627978,0.0021670042,0.00097019965,0.0010866439,0.00027437278],"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.00012550718,0.00013311258,0.0013366576,0.00007738906,0.000082713224,0.00009163591,0.00012863468,0.86377734,0.002630581,0.054920655,0.0012459377,0.075449854],"study_design_scores_gemma":[0.0000035335736,0.000016529644,0.000081858234,0.0000024855703,0.000010892085,0.000007024295,0.000009125064,0.9951015,0.00027294303,0.0042824415,0.00020516118,0.000006512551],"about_ca_topic_score_codex":0.012523319,"about_ca_topic_score_gemma":0.007236377,"teacher_disagreement_score":0.012523319,"about_ca_system_score_codex":0.0015834821,"about_ca_system_score_gemma":0.0020326686,"threshold_uncertainty_score":0.024900854},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68935734,0.0014280946,0.23243314,0.0027215001,0.0009061417,0.00064947543,0.00043244177,0.021118062,0.05095379],"genre_scores_gemma":[0.9104968,0.00019583589,0.08345265,0.0002981582,0.0000981113,0.00012021329,0.00025343604,0.000875872,0.0042089797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979134,0.00063941133,0.00006115067,0.00023633864,0.00071914017,0.00043057156],"domain_scores_gemma":[0.99774545,0.00079025497,0.00008856139,0.00062671426,0.00042612848,0.00032276422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004413959,0.00065705914,0.0005757446,0.00043238554,0.0015149782,0.0029076198,0.0034124204,0.000883526,0.004055574],"category_scores_gemma":[0.0054686368,0.0004984442,0.00056246517,0.0005643328,0.001546186,0.0031303596,0.0023826363,0.0013836721,0.0006904053],"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.008294003,0.0021271398,0.025043653,0.00097272365,0.00060829014,0.0014352655,0.0026097777,0.19890662,0.10674147,0.32810274,0.05107151,0.2740868],"study_design_scores_gemma":[0.0008281203,0.0011136645,0.0038280976,0.000051534105,0.00023151138,0.0002536087,0.00082317076,0.88606715,0.02893891,0.047495067,0.030266881,0.00010225018],"about_ca_topic_score_codex":0.009298123,"about_ca_topic_score_gemma":0.009469146,"teacher_disagreement_score":0.009298123,"about_ca_system_score_codex":0.0015749473,"about_ca_system_score_gemma":0.0036185673,"threshold_uncertainty_score":0.023343563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03005581,0.0011519004,0.9629452,0.0003346282,0.00012257759,0.00021853861,0.000030600328,0.0028252853,0.0023153732],"genre_scores_gemma":[0.6790197,0.0007686221,0.31569305,0.00031058455,0.0003224008,0.0003466887,0.00009375985,0.00036281216,0.0030822945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99483067,0.0013390675,0.00046553498,0.0005742472,0.0022193438,0.0005711836],"domain_scores_gemma":[0.97265255,0.00981082,0.005124362,0.008583039,0.0028331862,0.0009960382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00698382,0.00097591145,0.00062975165,0.0014949632,0.0008008315,0.00182722,0.0026268847,0.0010428111,0.0034798244],"category_scores_gemma":[0.016921235,0.00057452515,0.0008457151,0.00060520007,0.0017865417,0.0041460725,0.005160891,0.0024844182,0.0007537722],"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.0011820656,0.0007597871,0.006196181,0.0016714433,0.00038509865,0.001162058,0.0019125434,0.07520335,0.1539227,0.28255305,0.005339091,0.46971262],"study_design_scores_gemma":[0.0006320463,0.002828339,0.007192901,0.0007397493,0.00078536884,0.0031749236,0.0004473476,0.47105289,0.17878789,0.24918747,0.08473376,0.00043728325],"about_ca_topic_score_codex":0.00029448618,"about_ca_topic_score_gemma":0.00022537207,"teacher_disagreement_score":0.00698382,"about_ca_system_score_codex":0.0007854964,"about_ca_system_score_gemma":0.001044682,"threshold_uncertainty_score":0.036934376},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7331834,0.0063074436,0.22106323,0.001276713,0.0007137519,0.00020949906,0.0012184862,0.009411095,0.026616365],"genre_scores_gemma":[0.91201746,0.00074691215,0.079597235,0.0003850506,0.000092553884,0.00013926126,0.0011032879,0.000503439,0.005414844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994567,0.00011276461,0.0000331744,0.000060054583,0.00023899536,0.00009833412],"domain_scores_gemma":[0.9987991,0.00033618396,0.00006184531,0.00041886306,0.0003350016,0.000049024926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004394561,0.00036173366,0.0004938469,0.00080810016,0.00061546953,0.0010814231,0.0012517906,0.0005484283,0.002398501],"category_scores_gemma":[0.003721861,0.0002757096,0.00025428727,0.0022966014,0.00043638019,0.0012522212,0.0008166957,0.00075307785,0.0005157249],"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.0024691056,0.00042998174,0.013251552,0.00042269708,0.0002320062,0.00078653713,0.0005276256,0.25301003,0.043125555,0.042839408,0.03851679,0.6043887],"study_design_scores_gemma":[0.00012318535,0.00028197787,0.004003273,0.00006169082,0.00008595633,0.0003484809,0.00024153235,0.9122533,0.050054673,0.019173877,0.013319076,0.000053085958],"about_ca_topic_score_codex":0.0038856098,"about_ca_topic_score_gemma":0.008575844,"teacher_disagreement_score":0.0038856098,"about_ca_system_score_codex":0.00062289153,"about_ca_system_score_gemma":0.0012246228,"threshold_uncertainty_score":0.008023739},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24290937,0.0021109625,0.72043335,0.0013935855,0.0004167971,0.00020573907,0.00041935843,0.00037191564,0.031738956],"genre_scores_gemma":[0.97021604,0.00060020975,0.01704236,0.00009038957,0.00007808143,0.000083006664,0.000103693645,0.0000638027,0.011722473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999551,0.00012221935,0.000017252605,0.00007526923,0.00009857956,0.00013569201],"domain_scores_gemma":[0.9992567,0.00039199932,0.000084213105,0.000038929553,0.00014550233,0.00008270596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008429756,0.00074275135,0.0010597733,0.0004902257,0.0007185685,0.0017200403,0.0021180261,0.001419172,0.0027386774],"category_scores_gemma":[0.0021013902,0.0006247143,0.0008493909,0.0009205132,0.00064722856,0.0010736239,0.0006239375,0.0012236673,0.0003787937],"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.00002673884,0.000022524737,0.00018103633,0.000018050543,0.000005582904,0.00003559069,0.00001618196,0.9930841,0.00037968994,0.0044979462,0.00025258874,0.0014800286],"study_design_scores_gemma":[0.0000018844939,0.0000028970305,0.000035869634,7.99964e-7,0.0000015341105,0.0000027375852,0.0000027155506,0.9994253,0.0000333004,0.00043565777,0.000056455454,8.787713e-7],"about_ca_topic_score_codex":0.028746633,"about_ca_topic_score_gemma":0.01149303,"teacher_disagreement_score":0.028746633,"about_ca_system_score_codex":0.001582101,"about_ca_system_score_gemma":0.00215244,"threshold_uncertainty_score":0.05715865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99569136,0.00014359216,0.00013345796,0.0000681855,0.000019372817,0.000020620311,0.00005273994,0.0000209299,0.003849807],"genre_scores_gemma":[0.9985208,0.000052862884,0.00020982583,0.000042951568,0.000028553306,0.000017073258,0.000050208386,0.00004591856,0.0010317524],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9967637,0.0016419025,0.00025702053,0.0003223901,0.00074233743,0.00027267038],"domain_scores_gemma":[0.82142234,0.1596411,0.007506438,0.0019556873,0.006173079,0.003301395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036216287,0.00040909514,0.000528427,0.0008948284,0.00061976956,0.0046686134,0.00047768033,0.0011614271,0.00685245],"category_scores_gemma":[0.09480775,0.00032075084,0.00073288876,0.0006360263,0.00081446674,0.0015114653,0.00088822254,0.0013734539,0.0008514025],"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.029198062,0.006538976,0.8028626,0.0013895503,0.0010114323,0.0016453153,0.018723587,0.0018738806,0.057023417,0.0012946945,0.0017183758,0.07672013],"study_design_scores_gemma":[0.00027051545,0.0030391414,0.9769991,0.00010063197,0.00080638553,0.0005983303,0.0051965,0.0060919262,0.0052110837,0.0008573788,0.00072057865,0.00010837643],"about_ca_topic_score_codex":0.0033901974,"about_ca_topic_score_gemma":0.0026066354,"teacher_disagreement_score":0.00685245,"about_ca_system_score_codex":0.00047487894,"about_ca_system_score_gemma":0.00056510087,"threshold_uncertainty_score":0.022923708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14600018,0.00047092722,0.8179253,0.0008263431,0.0005811045,0.00018195382,0.00018168385,0.0009731074,0.032859482],"genre_scores_gemma":[0.8664221,0.00012270379,0.122190736,0.0001932575,0.00009923549,0.00023297012,0.00011097633,0.00028032024,0.010347629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991602,0.00037890414,0.000032688087,0.0001354474,0.00019183458,0.00010095321],"domain_scores_gemma":[0.9959608,0.002751924,0.00017706996,0.00046821937,0.00043186624,0.00021029702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018039922,0.000580108,0.0010790793,0.00056179403,0.0011317498,0.0015840356,0.0020018923,0.0013660177,0.006369791],"category_scores_gemma":[0.008260356,0.0006857609,0.0008965518,0.0006604267,0.0015080378,0.0013491432,0.0016753362,0.0011712188,0.00054827536],"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.00038134085,0.000079660465,0.0006629963,0.00006623176,0.00004423412,0.000066439505,0.000081341466,0.9158718,0.0020557283,0.06802027,0.0012175792,0.011452409],"study_design_scores_gemma":[0.000030884647,0.000014442152,0.000056403336,0.000001401,0.000006962481,0.0000047462886,0.0000067207925,0.98985577,0.00026888208,0.009464294,0.00028572307,0.000003818299],"about_ca_topic_score_codex":0.0047535663,"about_ca_topic_score_gemma":0.007075166,"teacher_disagreement_score":0.006369791,"about_ca_system_score_codex":0.001030431,"about_ca_system_score_gemma":0.0020942308,"threshold_uncertainty_score":0.021309078},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71791357,0.0047139986,0.2545748,0.0035185595,0.00023409206,0.00038532753,0.0010292962,0.00048300807,0.017147435],"genre_scores_gemma":[0.9938811,0.00056499033,0.004385754,0.000117619624,0.00006803882,0.000050185183,0.00019322657,0.00005764563,0.00068133324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995934,0.0022262337,0.00018142416,0.00057928637,0.0005602312,0.0005187351],"domain_scores_gemma":[0.8026479,0.17614187,0.009863241,0.0047293142,0.0052115195,0.0014062832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018041475,0.0012760158,0.0016582372,0.0026114723,0.00070581376,0.0024839195,0.0019908869,0.0018349785,0.004182794],"category_scores_gemma":[0.086525425,0.00055172143,0.0017581618,0.0013979272,0.0025424457,0.0044421246,0.0023693081,0.0019236213,0.00019936325],"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.0014885974,0.0002307035,0.008030552,0.0006235982,0.00077158585,0.00028144964,0.00017661412,0.9019571,0.00458005,0.05854413,0.0028944998,0.02042109],"study_design_scores_gemma":[0.00010545833,0.00064628175,0.005812563,0.00010116452,0.00061237294,0.00017009898,0.00038855735,0.95450574,0.0019024583,0.035056625,0.0006303102,0.00006839704],"about_ca_topic_score_codex":0.003339363,"about_ca_topic_score_gemma":0.0016461916,"teacher_disagreement_score":0.018041475,"about_ca_system_score_codex":0.0021167304,"about_ca_system_score_gemma":0.0011881907,"threshold_uncertainty_score":0.095413566},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61475694,0.002545358,0.17188437,0.0014604792,0.0010218819,0.0014328136,0.0048073544,0.18635933,0.015731484],"genre_scores_gemma":[0.94742125,0.00024323072,0.045178257,0.00034050914,0.00007423582,0.00013252949,0.002507962,0.00030363654,0.003798455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984927,0.00022237403,0.00015484908,0.000352721,0.00054045115,0.0002369621],"domain_scores_gemma":[0.998041,0.0002198964,0.00025092918,0.0004924971,0.00059356634,0.000402169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016971503,0.0008149116,0.0008917166,0.0012528416,0.00081203034,0.0011875157,0.0013339925,0.00044987947,0.002407245],"category_scores_gemma":[0.002217263,0.00029194786,0.00038405327,0.00056502817,0.00034279193,0.0015761679,0.001448312,0.0008274166,0.0009235682],"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.0066162394,0.00294286,0.115022644,0.0007355151,0.00083753525,0.0017525656,0.0010110777,0.02429597,0.11298312,0.008109704,0.10958737,0.6161054],"study_design_scores_gemma":[0.00046790988,0.0020740684,0.033750348,0.00006784207,0.0003809753,0.0017772893,0.00036161067,0.7826088,0.13213137,0.0037638387,0.04244478,0.00017105827],"about_ca_topic_score_codex":0.0030961833,"about_ca_topic_score_gemma":0.0038721615,"teacher_disagreement_score":0.0030961833,"about_ca_system_score_codex":0.0009663477,"about_ca_system_score_gemma":0.0018230589,"threshold_uncertainty_score":0.008975506},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2080984,0.0009465348,0.7776552,0.0011787148,0.00032082203,0.00032423218,0.0040198425,0.0019365794,0.0055196276],"genre_scores_gemma":[0.8944779,0.00064057193,0.089791834,0.00012958681,0.00010932385,0.00035125008,0.0062627075,0.00008197838,0.008154843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994087,0.000110117835,0.000049771505,0.00021021118,0.00012897699,0.00009216629],"domain_scores_gemma":[0.99927574,0.00028746176,0.00006126803,0.000053341675,0.00027743998,0.00004481029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006224494,0.0007113304,0.0006619037,0.002198848,0.0005443777,0.0013254641,0.0012500576,0.0007042241,0.0034151913],"category_scores_gemma":[0.0020013493,0.0002674173,0.0011900613,0.001969834,0.0003930143,0.0017126846,0.0009082309,0.0010865,0.0014573782],"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.001261097,0.0008693905,0.05409158,0.00037389563,0.00045702382,0.00044506296,0.00043833925,0.2239353,0.00992319,0.025828486,0.015939519,0.66643715],"study_design_scores_gemma":[0.000012667111,0.00006509271,0.0037367735,0.000015454034,0.000040471754,0.00006385581,0.00008680258,0.9892636,0.0010364209,0.004333553,0.0013249939,0.000020416746],"about_ca_topic_score_codex":0.026515886,"about_ca_topic_score_gemma":0.015730066,"teacher_disagreement_score":0.026515886,"about_ca_system_score_codex":0.00072245416,"about_ca_system_score_gemma":0.0019172964,"threshold_uncertainty_score":0.05272311},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5479924,0.0006303489,0.3749737,0.0007521078,0.00063681236,0.0002774063,0.0017503699,0.016264906,0.056721993],"genre_scores_gemma":[0.788064,0.00014642527,0.1987992,0.00013518381,0.00004494961,0.00016493349,0.0020047247,0.0015211109,0.009119483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997266,0.00004866366,0.000016920396,0.00003532788,0.00012342878,0.000049052862],"domain_scores_gemma":[0.99944264,0.0001069445,0.000025928768,0.00010568797,0.00026621186,0.000052577685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025125817,0.0005897774,0.0006082495,0.00045242472,0.0006575631,0.00060302246,0.001284258,0.0005624678,0.0098199835],"category_scores_gemma":[0.0009607766,0.00033458564,0.0005941273,0.0005344488,0.0002158072,0.00045582594,0.0005643424,0.0007695415,0.0013120177],"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.001230982,0.00073966384,0.006877997,0.0003769336,0.00019829771,0.0008170526,0.00046404367,0.67140704,0.10548727,0.012048436,0.024456538,0.17589572],"study_design_scores_gemma":[0.000033037035,0.00003480121,0.00066514744,0.0000040198784,0.0000060837156,0.000024927038,0.000019107392,0.9906413,0.006663217,0.00029009298,0.0016089733,0.000009364556],"about_ca_topic_score_codex":0.012353541,"about_ca_topic_score_gemma":0.012317726,"teacher_disagreement_score":0.012353541,"about_ca_system_score_codex":0.00040271072,"about_ca_system_score_gemma":0.0009942183,"threshold_uncertainty_score":0.0328511},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6814596,0.023076793,0.10367177,0.05561079,0.0003936809,0.00023216002,0.00053518626,0.00018148524,0.13483854],"genre_scores_gemma":[0.9875651,0.0036741528,0.007002427,0.0005899531,0.000065539025,0.0000301727,0.0000702489,0.000017276087,0.0009851104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783343,0.0011064964,0.00010905445,0.00018306481,0.00050159876,0.00026632368],"domain_scores_gemma":[0.98919034,0.006803495,0.0017637727,0.000570014,0.0010218209,0.0006506453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050478084,0.00062749715,0.00051763747,0.0077833156,0.0028394582,0.009444485,0.00095233193,0.002277308,0.0031289018],"category_scores_gemma":[0.009957283,0.0003999313,0.00046068977,0.0029903627,0.0091362465,0.024650795,0.0053700716,0.0031452645,0.00040304445],"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.00017379902,0.00023949418,0.14130592,0.0011658453,0.00010389262,0.0016409232,0.07173803,0.01144455,0.0016003521,0.64182687,0.007456143,0.12130421],"study_design_scores_gemma":[0.000008093205,0.00014452645,0.048299395,0.001718206,0.00003760086,0.0017721849,0.16584675,0.02863612,0.0007188271,0.6980178,0.054718953,0.000081537604],"about_ca_topic_score_codex":0.0033333485,"about_ca_topic_score_gemma":0.0037478234,"teacher_disagreement_score":0.009444485,"about_ca_system_score_codex":0.0030127,"about_ca_system_score_gemma":0.0026004543,"threshold_uncertainty_score":0.026695728},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34545198,0.47083905,0.044647593,0.025355643,0.0014270494,0.00013385045,0.0026942512,0.0016843062,0.107766256],"genre_scores_gemma":[0.7972775,0.15024555,0.027585328,0.0024558094,0.0009644043,0.00007269921,0.002338698,0.0003679001,0.018692037],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994784,0.00006437013,0.000039216124,0.000110383124,0.00017153354,0.00013609778],"domain_scores_gemma":[0.9986582,0.00044624216,0.000098509925,0.000081585706,0.00057212444,0.00014339754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012036815,0.0008348472,0.0005957843,0.00082335476,0.00028443793,0.0032129027,0.0011517616,0.0013205387,0.01071898],"category_scores_gemma":[0.0017821838,0.00033685516,0.0004960636,0.001362341,0.0006128431,0.004108893,0.0009135672,0.0008741706,0.0026949663],"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.0013386897,0.00023597412,0.016545216,0.0022603546,0.00012620621,0.0001484355,0.0002018409,0.015755616,0.042597,0.027132845,0.030385481,0.8632724],"study_design_scores_gemma":[0.00020912346,0.004331511,0.058481496,0.0030629148,0.00095084583,0.0022995642,0.0030813208,0.15447046,0.082082756,0.07842171,0.61216426,0.00044394276],"about_ca_topic_score_codex":0.003132125,"about_ca_topic_score_gemma":0.009144227,"teacher_disagreement_score":0.01071898,"about_ca_system_score_codex":0.0011218779,"about_ca_system_score_gemma":0.0011554412,"threshold_uncertainty_score":0.035858512},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061877903,0.0007310578,0.77407867,0.0013607584,0.0009778399,0.00047850338,0.004589361,0.1284983,0.027407559],"genre_scores_gemma":[0.8584414,0.00033279505,0.11714575,0.00035927046,0.00021425294,0.00024245046,0.00491306,0.001608573,0.016742432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993611,0.00012890235,0.00005507806,0.00009720711,0.00025214712,0.00010552698],"domain_scores_gemma":[0.9986644,0.00019098332,0.00008219654,0.0007529447,0.00021199645,0.00009757534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008542178,0.0008625786,0.0006179906,0.0007827224,0.0005443061,0.0014986335,0.0015328338,0.0006439841,0.015056355],"category_scores_gemma":[0.0022597979,0.00031854116,0.0004885156,0.0007287553,0.00074461626,0.0023694728,0.002347487,0.0010639223,0.0047515384],"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.0037151615,0.00040607242,0.003780612,0.00043752868,0.0002979302,0.00041110913,0.0001981445,0.25375012,0.033625104,0.10329148,0.20687005,0.39321673],"study_design_scores_gemma":[0.0002040154,0.00022053477,0.00046150156,0.00002411948,0.000056286073,0.00010861547,0.000054453598,0.8804839,0.02420189,0.053415287,0.04073585,0.000033479937],"about_ca_topic_score_codex":0.0023735599,"about_ca_topic_score_gemma":0.0024235686,"teacher_disagreement_score":0.015056355,"about_ca_system_score_codex":0.00077734597,"about_ca_system_score_gemma":0.001291219,"threshold_uncertainty_score":0.050368488},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32190475,0.0026337886,0.61870885,0.010091824,0.00064196676,0.0010686858,0.00529855,0.0010319977,0.038619574],"genre_scores_gemma":[0.7044485,0.0023294203,0.26081434,0.0011736463,0.00054772734,0.0008020902,0.0049206126,0.0006270051,0.02433677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790996,0.0008469324,0.00012321037,0.0004467751,0.00035048256,0.0003226322],"domain_scores_gemma":[0.98823327,0.008998029,0.00069536455,0.0006596856,0.0005929715,0.0008206687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003265608,0.0018785371,0.0030435203,0.0013247979,0.0021218867,0.004356901,0.004300184,0.004602382,0.013889004],"category_scores_gemma":[0.017238254,0.0014793222,0.0016666704,0.0029384422,0.0019830556,0.008134605,0.004852704,0.0031139704,0.001124517],"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.0009544482,0.00044115013,0.0013058046,0.00086271466,0.00026244196,0.00044637817,0.00045957003,0.7772909,0.0016747629,0.14048968,0.021869082,0.053943112],"study_design_scores_gemma":[0.00022620706,0.00021573306,0.00035101088,0.00008577979,0.000076068034,0.00018997675,0.0004815788,0.76520467,0.0013277367,0.22769444,0.004116321,0.00003044583],"about_ca_topic_score_codex":0.005098723,"about_ca_topic_score_gemma":0.003997422,"teacher_disagreement_score":0.013889004,"about_ca_system_score_codex":0.0018944398,"about_ca_system_score_gemma":0.0026933646,"threshold_uncertainty_score":0.04646337},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038072877,0.0003454687,0.94375765,0.0003569526,0.00022851316,0.00022879885,0.00034554646,0.0063632685,0.0103009865],"genre_scores_gemma":[0.23386656,0.00015696966,0.75505245,0.00022977614,0.00007161008,0.00016818062,0.0008425478,0.0013165509,0.008295277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986603,0.00032335427,0.00006637365,0.00034685046,0.00041785176,0.00018513046],"domain_scores_gemma":[0.9958359,0.0010503822,0.00022675071,0.0020575374,0.0006620355,0.00016741104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011386886,0.001101215,0.0013495794,0.0017789707,0.0014489444,0.0014856735,0.0043468783,0.0011376564,0.014554553],"category_scores_gemma":[0.005326397,0.0008440048,0.0011358015,0.0031726602,0.0009080972,0.0026329446,0.003238208,0.0018585674,0.0026190022],"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.0011437245,0.0005764323,0.0020658532,0.0005773305,0.00022749061,0.00026857783,0.0002807222,0.21025614,0.032946635,0.036632188,0.028620144,0.6864047],"study_design_scores_gemma":[0.00020389828,0.00014456404,0.0005991218,0.00003598751,0.00007562433,0.00018923842,0.00016954182,0.912644,0.028014695,0.050722595,0.0071619484,0.00003871692],"about_ca_topic_score_codex":0.0046666,"about_ca_topic_score_gemma":0.008407665,"teacher_disagreement_score":0.014554553,"about_ca_system_score_codex":0.000794577,"about_ca_system_score_gemma":0.0023278035,"threshold_uncertainty_score":0.048689842},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022059843,0.0008051249,0.97406614,0.00030789254,0.0002299289,0.0000664929,0.000081910446,0.0005499176,0.0018327537],"genre_scores_gemma":[0.7152858,0.00055601675,0.27513897,0.0006394766,0.000406899,0.00028616938,0.0005643183,0.00020505447,0.00691722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907565,0.00027717237,0.000052498068,0.00022280877,0.00025279223,0.000118990785],"domain_scores_gemma":[0.9981179,0.00092132745,0.00013422243,0.00018092478,0.00052616704,0.000119494594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021725737,0.00081881444,0.0023386902,0.000803353,0.00057222747,0.0010790234,0.002450587,0.0016606546,0.002232677],"category_scores_gemma":[0.006074038,0.00058422016,0.0008627439,0.0010801347,0.000627206,0.0016801738,0.0014090188,0.0016183362,0.00059889734],"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.00026675977,0.00016941704,0.0014347219,0.000072330724,0.00010161857,0.000054344026,0.000066514316,0.80841124,0.0018825129,0.00557362,0.0038334616,0.17813346],"study_design_scores_gemma":[0.0000040672285,0.00001416446,0.000044896187,0.0000021552985,0.000004354425,0.000004904611,0.0000016623675,0.9993845,0.00008293242,0.00035668773,0.00009808577,0.0000015146048],"about_ca_topic_score_codex":0.0076311156,"about_ca_topic_score_gemma":0.007560675,"teacher_disagreement_score":0.0076311156,"about_ca_system_score_codex":0.00056796253,"about_ca_system_score_gemma":0.0011651209,"threshold_uncertainty_score":0.015173435},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44906265,0.0010509309,0.500427,0.0011410755,0.000997609,0.0002424486,0.00048602663,0.008510559,0.03808167],"genre_scores_gemma":[0.758648,0.00024784767,0.23196682,0.00018980971,0.0001295982,0.00016066886,0.00063768507,0.00067871896,0.007340876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939525,0.00012825574,0.000028178723,0.000048357,0.0003041439,0.00009578422],"domain_scores_gemma":[0.9977423,0.0008160877,0.00012642205,0.00044300954,0.0006936226,0.00017852697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095828174,0.00066536525,0.0005715709,0.00050737197,0.000727921,0.0009751205,0.0017385986,0.0008171619,0.0050911643],"category_scores_gemma":[0.0060527553,0.00034777555,0.0004494345,0.00065996335,0.0006116075,0.0012001102,0.0014442145,0.0015687518,0.0009315618],"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.00045624372,0.00023816703,0.005711851,0.00026448534,0.00012475056,0.0002652095,0.00031961096,0.82393473,0.01369825,0.034555778,0.014121081,0.1063099],"study_design_scores_gemma":[0.000030337682,0.000018700666,0.00026179207,0.0000073355604,0.000004873329,0.000011749871,0.000016075232,0.9943646,0.001796242,0.0024304658,0.0010526959,0.000005131176],"about_ca_topic_score_codex":0.008350368,"about_ca_topic_score_gemma":0.014179396,"teacher_disagreement_score":0.008350368,"about_ca_system_score_codex":0.00074380636,"about_ca_system_score_gemma":0.0019771361,"threshold_uncertainty_score":0.01703161},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067814626,0.00073924713,0.8653295,0.0011787736,0.0005371807,0.00096161186,0.0013377946,0.045995105,0.016106138],"genre_scores_gemma":[0.8255687,0.0004828768,0.15098381,0.00043983464,0.00012884547,0.00046609627,0.002612183,0.0008713146,0.018446438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886775,0.00027177058,0.00010027043,0.00013738463,0.00044928747,0.00017354712],"domain_scores_gemma":[0.99821836,0.00037281786,0.000151008,0.0006491099,0.0003102262,0.00029847567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017032737,0.0005067437,0.0008394819,0.00074516353,0.001319117,0.0015041707,0.0017436526,0.0012394424,0.007745965],"category_scores_gemma":[0.0037680492,0.00042870408,0.000355255,0.0007764683,0.0005995187,0.0035862476,0.004014461,0.0014551982,0.0024437064],"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.0038583926,0.0011729528,0.007445468,0.0011599279,0.00042810437,0.0019727312,0.0012932874,0.084418446,0.06400665,0.10193288,0.09758704,0.6347241],"study_design_scores_gemma":[0.0003828812,0.00043072185,0.0013777605,0.00008372922,0.00011043258,0.00049078173,0.00019761563,0.8501339,0.022494521,0.053202916,0.07095239,0.00014232649],"about_ca_topic_score_codex":0.0028095345,"about_ca_topic_score_gemma":0.0039831307,"teacher_disagreement_score":0.007745965,"about_ca_system_score_codex":0.00065965956,"about_ca_system_score_gemma":0.0020990877,"threshold_uncertainty_score":0.025912762},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012295221,0.00035687623,0.98246896,0.00027444345,0.00006448474,0.00006465902,0.00006706478,0.0008745428,0.0035336174],"genre_scores_gemma":[0.49045128,0.000626141,0.50193024,0.00044896093,0.00007568684,0.00027569628,0.00036532796,0.00011947774,0.005707226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996308,0.000059925664,0.000017598852,0.00012695583,0.00009871378,0.000066022294],"domain_scores_gemma":[0.99979967,0.000053868105,0.000028689708,0.000024281182,0.00007670774,0.000016669554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043842848,0.0007621835,0.0005851678,0.0008095931,0.0003764191,0.00078746106,0.0015580292,0.0010002409,0.0013127615],"category_scores_gemma":[0.0010954692,0.00029465414,0.00077525177,0.0005289183,0.00056210713,0.0008296659,0.0007063702,0.0007308505,0.00032513874],"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.00007311543,0.00006965474,0.0026943183,0.00007673056,0.00009094513,0.00020821678,0.00006261091,0.78240377,0.0077352994,0.021651533,0.002620338,0.1823135],"study_design_scores_gemma":[0.0000026306402,0.000015410022,0.0001674607,0.0000040724844,0.000007865837,0.000026296557,0.000004382902,0.9955805,0.0011469412,0.0022763007,0.00076317735,0.000004983283],"about_ca_topic_score_codex":0.017099017,"about_ca_topic_score_gemma":0.013817705,"teacher_disagreement_score":0.017099017,"about_ca_system_score_codex":0.0013325968,"about_ca_system_score_gemma":0.0013793678,"threshold_uncertainty_score":0.033998966},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2097358,0.001311382,0.7680518,0.00173738,0.0003745254,0.00010574426,0.00056533265,0.002176026,0.01594191],"genre_scores_gemma":[0.9544358,0.00024230302,0.03441934,0.00014485115,0.000064240776,0.00008836689,0.00040741815,0.000091589034,0.010106084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986076,0.000031187203,0.0000052647783,0.0000531028,0.0000175648,0.0000321544],"domain_scores_gemma":[0.9996691,0.00013383976,0.000032940818,0.00004418899,0.00008827054,0.000031657368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000369448,0.00049927656,0.000628675,0.00026819913,0.00032840262,0.0008942338,0.0009579458,0.00076252205,0.0074025556],"category_scores_gemma":[0.001546605,0.00027269797,0.00082067435,0.00021950797,0.0003359317,0.0009661396,0.0005501141,0.0014280201,0.0016313025],"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.00059289974,0.00041175992,0.006115586,0.00013051223,0.00019264742,0.00025094688,0.0003652777,0.6868474,0.009145562,0.0351226,0.01283789,0.2479869],"study_design_scores_gemma":[0.0000053166764,0.000018564795,0.0006129068,0.0000033879398,0.000008343393,0.000013125499,0.000016730486,0.98948497,0.0002947884,0.0090898825,0.0004476128,0.0000044523817],"about_ca_topic_score_codex":0.00637515,"about_ca_topic_score_gemma":0.0066534053,"teacher_disagreement_score":0.0074025556,"about_ca_system_score_codex":0.00060553785,"about_ca_system_score_gemma":0.00035614806,"threshold_uncertainty_score":0.024764061},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1267118,0.0010548341,0.86564195,0.0005515196,0.00014560882,0.00011324972,0.00016558975,0.0012069871,0.0044084913],"genre_scores_gemma":[0.83747405,0.00021802718,0.15922554,0.00013884222,0.000060711347,0.00015222534,0.0002712078,0.00024579818,0.0022136548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99965584,0.00011023512,0.000015732077,0.00007077623,0.00008623753,0.00006108907],"domain_scores_gemma":[0.99944335,0.00028144373,0.000043621025,0.000049086782,0.00013538814,0.0000471479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009902224,0.001085268,0.0012330607,0.0004666336,0.0003902064,0.0007021172,0.0011677693,0.000731432,0.0015734065],"category_scores_gemma":[0.0021422664,0.00042358806,0.0005331829,0.0005981928,0.00064774236,0.00085349166,0.0010161487,0.000922174,0.00025148323],"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.00008959421,0.000043306878,0.0002666893,0.000033665056,0.000026945327,0.000032492382,0.000012742828,0.97945935,0.0011977106,0.0019070508,0.0006622901,0.016268207],"study_design_scores_gemma":[0.0000033751908,0.0000052515325,0.000020896736,7.824443e-7,9.656574e-7,9.0062576e-7,0.0000012220379,0.9993894,0.00015101556,0.00038483672,0.00004070914,6.300028e-7],"about_ca_topic_score_codex":0.010012872,"about_ca_topic_score_gemma":0.0074316435,"teacher_disagreement_score":0.010012872,"about_ca_system_score_codex":0.0012696837,"about_ca_system_score_gemma":0.0011704726,"threshold_uncertainty_score":0.019909143},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12440298,0.00024338719,0.8696931,0.00031660323,0.000081198996,0.00008435094,0.000019394814,0.0004178282,0.004741197],"genre_scores_gemma":[0.9688324,0.000047957652,0.029462343,0.00005181731,0.000022865126,0.000064851556,0.000017627632,0.000024753861,0.0014753856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992418,0.00030706247,0.000039674713,0.00011786346,0.00017265248,0.00012097514],"domain_scores_gemma":[0.99645174,0.0023770519,0.000213024,0.00028644252,0.00048779682,0.00018395895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019296098,0.00071931427,0.001278055,0.00042786202,0.0005932958,0.0008374757,0.0017879783,0.0013263375,0.0019243447],"category_scores_gemma":[0.006922085,0.00041461442,0.0003899803,0.0003506112,0.0011420175,0.0014954745,0.0020488347,0.0012730234,0.00028598733],"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.00015399166,0.00014975328,0.00050683273,0.00004088233,0.00004244134,0.00006544545,0.00008660057,0.9622668,0.0017196893,0.005164966,0.0003546824,0.029447922],"study_design_scores_gemma":[0.000013897861,0.000024171819,0.000038181435,0.0000013347425,0.0000038974636,0.0000044498374,0.000003499963,0.99836427,0.00019173426,0.0013073202,0.00004486092,0.0000024110543],"about_ca_topic_score_codex":0.0045068995,"about_ca_topic_score_gemma":0.0028825977,"teacher_disagreement_score":0.0045068995,"about_ca_system_score_codex":0.0007242679,"about_ca_system_score_gemma":0.001004123,"threshold_uncertainty_score":0.010204852},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004066808,0.014168662,0.0012616016,0.16326575,0.60861593,0.00022548003,0.0011699998,0.00058422796,0.21030168],"genre_scores_gemma":[0.0018880947,0.0048526167,0.0005916203,0.07490894,0.08166603,0.00013385693,0.00080149795,0.0003512807,0.83480597],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899787,0.00012530979,0.00006281491,0.00014356346,0.00054480205,0.00012561755],"domain_scores_gemma":[0.99474066,0.00071165414,0.00023613947,0.00031051968,0.002761291,0.0012398254],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014558682,0.00091286335,0.00081717013,0.0014313557,0.0019645363,0.0035206354,0.0012876152,0.0043267994,0.25872254],"category_scores_gemma":[0.009401494,0.0002606465,0.000719666,0.000740674,0.00066634506,0.0021657837,0.002067055,0.0045232456,0.26349634],"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.000013873324,0.000007692591,0.000023484437,0.00004084451,0.0000012373382,0.000021741169,0.0000060820857,0.0000058001256,0.00006150028,0.00069428276,0.98191744,0.017206097],"study_design_scores_gemma":[0.000004673624,0.000008949433,0.00009382822,0.00006209994,0.0000022363022,0.00004821096,0.000013080905,0.000009951219,0.00006924808,0.00069614727,0.9989888,0.0000026810253],"about_ca_topic_score_codex":0.002266471,"about_ca_topic_score_gemma":0.0045231963,"teacher_disagreement_score":0.74127746,"about_ca_system_score_codex":0.0014001942,"about_ca_system_score_gemma":0.0025616249,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07995884,0.1389506,0.70348436,0.0041498924,0.00054833747,0.0006941922,0.00018336585,0.00044216868,0.07158819],"genre_scores_gemma":[0.5645775,0.08420422,0.33983102,0.00078089355,0.0005689043,0.0003308634,0.0004276333,0.00005812881,0.00922082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878436,0.00030528742,0.00018522427,0.00012762855,0.00045215944,0.00014527442],"domain_scores_gemma":[0.99844295,0.0005324873,0.0002164239,0.00046102187,0.00027433317,0.00007282769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014471282,0.00044276664,0.00048459196,0.002423188,0.00077427825,0.0024214264,0.00088031054,0.0014021298,0.00085983204],"category_scores_gemma":[0.0019067952,0.00038181277,0.000796938,0.002752924,0.0014399834,0.006055091,0.0016568477,0.0016977612,0.00031590852],"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.00008682306,0.00016337397,0.0030200062,0.00077846367,0.000041186217,0.00044946815,0.00042120222,0.017084539,0.0060640913,0.7672932,0.0019670587,0.20263055],"study_design_scores_gemma":[0.000038449773,0.0005347652,0.0037819499,0.0014188089,0.00011914225,0.0057113776,0.00080942555,0.16561644,0.022282593,0.5417053,0.25781548,0.00016627746],"about_ca_topic_score_codex":0.00049184187,"about_ca_topic_score_gemma":0.0003255845,"teacher_disagreement_score":0.002423188,"about_ca_system_score_codex":0.0010220873,"about_ca_system_score_gemma":0.00082959473,"threshold_uncertainty_score":0.0076532364},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11396995,0.0014048187,0.8596733,0.001501118,0.0006649381,0.0003453936,0.0005230594,0.0039144754,0.018002952],"genre_scores_gemma":[0.93097705,0.00037788475,0.056874357,0.00032066228,0.00020039339,0.00021676703,0.00032353651,0.00014929897,0.01055995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947914,0.0011667553,0.0004380115,0.00067752483,0.0019801199,0.0009462551],"domain_scores_gemma":[0.99209607,0.0017996018,0.0005726589,0.0038886599,0.0014004083,0.00024263031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026740856,0.0007158205,0.0013544823,0.00097207376,0.0018963468,0.002162535,0.0014413451,0.0015998405,0.0048097707],"category_scores_gemma":[0.005638726,0.0004966742,0.00074153877,0.0014918455,0.0017008804,0.006163133,0.005262407,0.003040219,0.0017626984],"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.004953562,0.0005052167,0.002909678,0.0009544079,0.00028501183,0.0014920293,0.001408158,0.051029228,0.100690715,0.63841677,0.016814554,0.18054071],"study_design_scores_gemma":[0.0007556521,0.0012315,0.0027013975,0.00035801288,0.00041185107,0.0022253771,0.00040521385,0.38653606,0.14048669,0.42697793,0.03751141,0.00039889966],"about_ca_topic_score_codex":0.0005094577,"about_ca_topic_score_gemma":0.00036375667,"teacher_disagreement_score":0.0048097707,"about_ca_system_score_codex":0.0014369936,"about_ca_system_score_gemma":0.0022445077,"threshold_uncertainty_score":0.016090274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010297156,0.00023223682,0.98573303,0.0002847507,0.00002441289,0.00013986885,0.00005547662,0.00026274356,0.002970302],"genre_scores_gemma":[0.2593106,0.0005587148,0.7360383,0.0002376053,0.000054745098,0.00032662696,0.0001873587,0.00038085744,0.0029052272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828017,0.00071428134,0.00008284671,0.00024359011,0.0005028802,0.00017623286],"domain_scores_gemma":[0.9977962,0.001174274,0.00020950724,0.00024120462,0.00047576815,0.000103143284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024990637,0.002077736,0.0015867935,0.0012058814,0.00072643766,0.001998967,0.002176774,0.0016202719,0.0046496405],"category_scores_gemma":[0.0054313154,0.0013257861,0.0014778614,0.0011765587,0.0011607717,0.0019320953,0.002183139,0.0024277442,0.0008382909],"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.000048993716,0.00015207441,0.00054787606,0.00014316593,0.00004747384,0.000095129355,0.0000778402,0.9335598,0.0033036827,0.017181953,0.0010078959,0.043834157],"study_design_scores_gemma":[0.000008126034,0.00004906195,0.000061965606,0.000012769337,0.000013857152,0.00001829357,0.000023286771,0.9915524,0.0005363691,0.007056113,0.00066295685,0.00000471886],"about_ca_topic_score_codex":0.0031233039,"about_ca_topic_score_gemma":0.0042491425,"teacher_disagreement_score":0.0046496405,"about_ca_system_score_codex":0.000994414,"about_ca_system_score_gemma":0.0023510386,"threshold_uncertainty_score":0.015554607},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19857402,0.004600195,0.6045327,0.0024082905,0.0029255012,0.00046397847,0.0029242502,0.049068354,0.13450271],"genre_scores_gemma":[0.6821721,0.0017252286,0.23692437,0.00092167244,0.00013610255,0.00028995157,0.0031593412,0.0023290722,0.07234211],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99984217,0.000023642526,0.0000033418708,0.000027903223,0.000066316716,0.000036643378],"domain_scores_gemma":[0.99978095,0.00003130283,0.000012320139,0.000063574356,0.00006739735,0.000044615845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003224817,0.0005565812,0.00034948057,0.00042993083,0.0006250526,0.00084383506,0.0010618819,0.00047797844,0.008046627],"category_scores_gemma":[0.000434346,0.0001577807,0.0002754881,0.0003629328,0.00036252802,0.0007396987,0.0011489289,0.000857834,0.0013489325],"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.0012043365,0.0003814647,0.00260334,0.0008673502,0.0001713312,0.0005344456,0.00041067423,0.12225723,0.14792463,0.110763475,0.21532378,0.39755794],"study_design_scores_gemma":[0.00018529304,0.000655601,0.0016880066,0.00014791741,0.000101750404,0.00031761348,0.00020578566,0.5011363,0.12830971,0.05308501,0.31406602,0.000100958576],"about_ca_topic_score_codex":0.002069629,"about_ca_topic_score_gemma":0.005920915,"teacher_disagreement_score":0.008046627,"about_ca_system_score_codex":0.0008613413,"about_ca_system_score_gemma":0.0009113546,"threshold_uncertainty_score":0.02691865},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0079827085,0.0004934023,0.98954344,0.00045418928,0.00007281323,0.000039732342,0.00021227487,0.0003305629,0.0008708961],"genre_scores_gemma":[0.4688644,0.0015136419,0.51554537,0.0007045738,0.0008537865,0.0004913141,0.0021732359,0.0001846022,0.009669125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829787,0.0006123006,0.00014635634,0.00029667147,0.00047205674,0.00017475647],"domain_scores_gemma":[0.9957135,0.0025294677,0.0003222747,0.00023799697,0.0010437699,0.0001530858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051246793,0.0007318377,0.0019571315,0.002170843,0.00090537575,0.0019469758,0.0027737394,0.0019458798,0.003436051],"category_scores_gemma":[0.010347774,0.0007480725,0.0014734371,0.0020531914,0.0007732515,0.0025446438,0.0013362914,0.0023959852,0.0011886287],"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.0003211864,0.00045027432,0.0038260722,0.00016756139,0.00026517257,0.00009652653,0.00013700176,0.45838195,0.0022162262,0.07560728,0.010258309,0.4482725],"study_design_scores_gemma":[0.000010549249,0.000015423519,0.00023204897,0.000011691216,0.000017592338,0.000009121485,0.00000518662,0.98191005,0.0001466198,0.01711585,0.00051685725,0.000009015217],"about_ca_topic_score_codex":0.017920215,"about_ca_topic_score_gemma":0.018468812,"teacher_disagreement_score":0.017920215,"about_ca_system_score_codex":0.0013026121,"about_ca_system_score_gemma":0.002366106,"threshold_uncertainty_score":0.035631835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050135832,0.0002085579,0.9374069,0.00082309754,0.00009090788,0.0001511008,0.00015299673,0.0006071795,0.010423346],"genre_scores_gemma":[0.92284626,0.00037433914,0.069677874,0.00028078957,0.00029261774,0.0002954964,0.0003281238,0.00032451915,0.005579927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9881854,0.004188296,0.0006740287,0.0013935652,0.004073925,0.0014848273],"domain_scores_gemma":[0.95251757,0.03232092,0.0034894163,0.0064368,0.004284534,0.00095067744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076952972,0.0011415961,0.0009400419,0.0037474171,0.0020810645,0.0059481277,0.0029913709,0.001864124,0.0064979685],"category_scores_gemma":[0.028343974,0.0009954552,0.0021872565,0.002018137,0.006764492,0.015761495,0.0053178193,0.005862742,0.00091304985],"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.00016924288,0.00010994585,0.0004733917,0.000096908036,0.00003278402,0.00014936528,0.0006104827,0.025428291,0.0019882068,0.95953214,0.00075341214,0.010655831],"study_design_scores_gemma":[0.000033544704,0.0000478271,0.00013998237,0.00003932091,0.00004171749,0.000058134592,0.00014252808,0.20930822,0.003056967,0.78536344,0.0017365513,0.000031781452],"about_ca_topic_score_codex":0.0017491233,"about_ca_topic_score_gemma":0.0010679231,"teacher_disagreement_score":0.0076952972,"about_ca_system_score_codex":0.003093735,"about_ca_system_score_gemma":0.002433876,"threshold_uncertainty_score":0.040697157},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036726412,0.0005858088,0.003251548,0.056550346,0.93381286,0.00004380742,0.0017991001,0.0010781725,0.0025111078],"genre_scores_gemma":[0.042351596,0.0059130834,0.032234553,0.10631929,0.49433333,0.00035068972,0.0050039124,0.0043976344,0.30909598],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99795794,0.00025691258,0.00044238436,0.00036796113,0.0007489939,0.00022577473],"domain_scores_gemma":[0.97721887,0.0054245163,0.00083446124,0.0014712095,0.013882438,0.0011685994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020553665,0.0015416706,0.0016226958,0.0026782956,0.002013016,0.0026524148,0.0036201715,0.00695391,0.06844009],"category_scores_gemma":[0.057219945,0.0009493424,0.0014755025,0.0015734395,0.0024442214,0.0017976383,0.001455031,0.008145948,0.036175795],"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.000073389245,0.000009243908,0.00015506276,0.000111318426,0.000018854282,0.00063924585,0.000031107935,0.00012226765,0.000121678364,0.0012865986,0.9861224,0.011308752],"study_design_scores_gemma":[0.000116631025,0.000054456927,0.0014267485,0.00024180434,0.00006249737,0.0027548296,0.00013870117,0.0023938585,0.0012113611,0.0061384086,0.9853808,0.00007985885],"about_ca_topic_score_codex":0.01997763,"about_ca_topic_score_gemma":0.023011217,"teacher_disagreement_score":0.06844009,"about_ca_system_score_codex":0.0026917767,"about_ca_system_score_gemma":0.0036970943,"threshold_uncertainty_score":0.22895485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07905271,0.00084981846,0.90583193,0.00099317,0.00021965316,0.00022510948,0.0009672817,0.0039009696,0.007959268],"genre_scores_gemma":[0.824898,0.00033112484,0.16691218,0.00021747821,0.00013087533,0.00022565576,0.0020806442,0.0004562212,0.0047477856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973341,0.0014783951,0.0000992689,0.0006113278,0.0003105088,0.00016638798],"domain_scores_gemma":[0.9912747,0.0070919446,0.00018867392,0.00063962716,0.00058783044,0.00021723483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026396748,0.00093317777,0.00075752387,0.0012040088,0.0009692707,0.0025061045,0.0015667097,0.0019312946,0.007351538],"category_scores_gemma":[0.016391618,0.0007239473,0.0009968674,0.000847983,0.0006129392,0.004629547,0.0027968786,0.0025041967,0.0025235154],"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.0023700288,0.0009898508,0.011988635,0.0010856735,0.00044533773,0.0009255678,0.009680212,0.07343304,0.030400002,0.038729623,0.02017899,0.809773],"study_design_scores_gemma":[0.000085609936,0.0001777242,0.0020997995,0.00011437417,0.00015213464,0.00030828468,0.0012616946,0.92565817,0.009331107,0.04984784,0.010890665,0.00007254494],"about_ca_topic_score_codex":0.003028693,"about_ca_topic_score_gemma":0.0037721756,"teacher_disagreement_score":0.007351538,"about_ca_system_score_codex":0.0006743242,"about_ca_system_score_gemma":0.0009519826,"threshold_uncertainty_score":0.024593353},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014769628,0.00024278824,0.9825441,0.00014517983,0.00013335544,0.00001989771,0.0002683065,0.001351442,0.00052523945],"genre_scores_gemma":[0.46739057,0.00048295516,0.52310705,0.0002610303,0.00029693072,0.00009804533,0.0024587144,0.0003996465,0.005505082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941957,0.00008393559,0.000038757113,0.00013551279,0.00021200912,0.00011030885],"domain_scores_gemma":[0.9991099,0.0002930845,0.0000889566,0.00015571865,0.00029791688,0.000054351432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012334419,0.0010445049,0.0011478006,0.0012494839,0.0005215468,0.0008425701,0.001653776,0.0009394837,0.001682434],"category_scores_gemma":[0.0034983116,0.00034724647,0.00084173266,0.0016853942,0.0003451349,0.001309496,0.0010764935,0.0019693512,0.00083080627],"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.00033933594,0.00020509251,0.0068040197,0.00006423772,0.0001581506,0.0001389023,0.00006838918,0.31762785,0.010213854,0.0058050053,0.008338646,0.65023655],"study_design_scores_gemma":[0.0000029925836,0.000012008056,0.00034507588,0.0000035930361,0.0000054756592,0.000018401934,0.000008037169,0.9963469,0.0010255432,0.0015263103,0.0007003406,0.0000053243566],"about_ca_topic_score_codex":0.016368633,"about_ca_topic_score_gemma":0.021384953,"teacher_disagreement_score":0.016368633,"about_ca_system_score_codex":0.00055651943,"about_ca_system_score_gemma":0.0013123982,"threshold_uncertainty_score":0.0325467},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05258972,0.0003829256,0.93917143,0.0007948959,0.00009232098,0.00009680305,0.00030805432,0.0012977774,0.0052660103],"genre_scores_gemma":[0.92888623,0.00014130442,0.06528351,0.00024366482,0.00008552812,0.000100562655,0.00020975214,0.00005627363,0.0049932003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964832,0.001121716,0.00020765381,0.00062176987,0.0009691752,0.00059642794],"domain_scores_gemma":[0.9926872,0.0023471941,0.00043819292,0.0038124,0.00048509828,0.00022987349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002929044,0.00047153293,0.0015347471,0.00063424814,0.0009895863,0.0025416852,0.0019358174,0.001569401,0.0037514714],"category_scores_gemma":[0.007841037,0.0003771515,0.0007347748,0.0011749812,0.0017642498,0.0052984357,0.0046606213,0.0022903297,0.0012756517],"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.0021579585,0.0008455249,0.0026458828,0.00031605898,0.00018298598,0.0004519474,0.00044521096,0.24034122,0.010304247,0.47952121,0.009791531,0.25299618],"study_design_scores_gemma":[0.00015038688,0.00019008473,0.00031126224,0.000040519222,0.00003960767,0.0003848722,0.00006336136,0.60352236,0.011605892,0.38110167,0.0025492269,0.000040679442],"about_ca_topic_score_codex":0.00037580958,"about_ca_topic_score_gemma":0.00038624785,"teacher_disagreement_score":0.0037514714,"about_ca_system_score_codex":0.0014856141,"about_ca_system_score_gemma":0.0022969379,"threshold_uncertainty_score":0.015490472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019386552,0.00012198149,0.97807044,0.00012510232,0.00009256748,0.00005242317,0.000033335866,0.0016924789,0.00042503956],"genre_scores_gemma":[0.43302682,0.00010171544,0.56275135,0.00019425595,0.00020296591,0.00018566498,0.00039084067,0.00020758995,0.0029388065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871254,0.00023317222,0.000089944,0.00035921152,0.0004866697,0.00011851522],"domain_scores_gemma":[0.9979284,0.00062032155,0.00020091223,0.0003028449,0.00082726777,0.00012026548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017400865,0.0007098145,0.0020803658,0.0013118302,0.00094922935,0.0010649825,0.0029258276,0.0012023328,0.0014678151],"category_scores_gemma":[0.0034531364,0.00041804538,0.00073981227,0.0010792176,0.00054396095,0.0017157233,0.0012916679,0.0018274158,0.0006187659],"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.00046294893,0.0004541179,0.0029673704,0.000054786207,0.00021631451,0.00006784662,0.00007690023,0.15406303,0.015544468,0.0042536682,0.0046725674,0.81716603],"study_design_scores_gemma":[0.000014183515,0.000027649738,0.00028026415,0.0000013974325,0.000009822892,0.000027194059,0.0000046270147,0.99655104,0.0015312845,0.0012817333,0.00026409887,0.0000066731263],"about_ca_topic_score_codex":0.0041795876,"about_ca_topic_score_gemma":0.0050877407,"teacher_disagreement_score":0.0041795876,"about_ca_system_score_codex":0.0007978814,"about_ca_system_score_gemma":0.001419057,"threshold_uncertainty_score":0.00920254},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32162166,0.0042441194,0.64543015,0.0008716472,0.0012416496,0.0005788454,0.004538769,0.010931488,0.010541748],"genre_scores_gemma":[0.83862907,0.00075305055,0.14082973,0.0005773563,0.00021259591,0.0005664037,0.004331571,0.00026552705,0.01383466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997793,0.000049542286,0.000008384174,0.00008348489,0.000038717408,0.00004064203],"domain_scores_gemma":[0.99977845,0.000080520746,0.00001865666,0.000017598128,0.00006700029,0.000037714057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060707645,0.0010648222,0.0006322878,0.00076255144,0.00043005767,0.0005041293,0.0009382465,0.00082410435,0.003386631],"category_scores_gemma":[0.0008114321,0.0003233104,0.0004427605,0.00047757063,0.00020651973,0.00074508437,0.0010721347,0.0011038529,0.0011368374],"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.0017633338,0.0011852437,0.011748616,0.00030721794,0.0004137927,0.00021878873,0.00026853866,0.042205445,0.06471067,0.0013708231,0.018328587,0.8574791],"study_design_scores_gemma":[0.000043096887,0.00028792932,0.0060968627,0.00002810676,0.000077802295,0.00006296507,0.000072895185,0.9796893,0.0092551345,0.0011090745,0.003242908,0.000033886023],"about_ca_topic_score_codex":0.006469552,"about_ca_topic_score_gemma":0.0125631085,"teacher_disagreement_score":0.006469552,"about_ca_system_score_codex":0.0005802781,"about_ca_system_score_gemma":0.00048727592,"threshold_uncertainty_score":0.012863755},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018609468,0.00029351565,0.9661211,0.00017898362,0.00012468407,0.00018579327,0.00030815636,0.009735154,0.0044431095],"genre_scores_gemma":[0.1456926,0.00019592862,0.8444413,0.0001556718,0.000048586975,0.00032614652,0.0013637352,0.0012135999,0.0065624965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968827,0.000059969017,0.000018667826,0.0000655871,0.00010993056,0.0000576199],"domain_scores_gemma":[0.99948394,0.00013835033,0.000028493218,0.00016520903,0.00012216861,0.0000618259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004522857,0.0009592445,0.00085959694,0.0009258532,0.0010089619,0.0010657609,0.0021553144,0.0007666909,0.0066928924],"category_scores_gemma":[0.0015001277,0.0005084787,0.00058000576,0.0010950565,0.0004440107,0.0014501329,0.0022012042,0.0009671748,0.0025110648],"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.0011004,0.0003220978,0.001278254,0.00034678957,0.00015757009,0.00016840742,0.0002730241,0.23520063,0.030124173,0.018299486,0.035293523,0.6774357],"study_design_scores_gemma":[0.00017815769,0.00011113823,0.0003130554,0.000014469448,0.000029080642,0.00007848727,0.000047125086,0.9737458,0.0072698765,0.010173425,0.0080216285,0.000017768913],"about_ca_topic_score_codex":0.00661754,"about_ca_topic_score_gemma":0.010949369,"teacher_disagreement_score":0.0066928924,"about_ca_system_score_codex":0.00081647426,"about_ca_system_score_gemma":0.0015462112,"threshold_uncertainty_score":0.022389948},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03404056,0.00013926737,0.9597394,0.0004200981,0.00018685045,0.00012700347,0.000050039245,0.0013609485,0.0039358404],"genre_scores_gemma":[0.8991282,0.00013875605,0.095928855,0.0002129642,0.00009250455,0.000070404836,0.000070982,0.00008215874,0.004275171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972018,0.0007729598,0.00022041035,0.00040909403,0.0009762614,0.00041960622],"domain_scores_gemma":[0.9949012,0.0012651661,0.0005379166,0.0024764407,0.0006686514,0.0001507136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024424049,0.00043133352,0.0005200814,0.00067543914,0.0009779559,0.0021560048,0.0009952376,0.0014955022,0.0030881208],"category_scores_gemma":[0.0057235234,0.00033612695,0.0006398201,0.00055986247,0.001503492,0.0048117773,0.0029541377,0.00202819,0.001384225],"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.0024362027,0.00056733773,0.0052183997,0.0003071253,0.0001635384,0.0013688306,0.0007811034,0.08113285,0.20667136,0.47168604,0.0063234298,0.22334377],"study_design_scores_gemma":[0.000104050785,0.00039350038,0.00078618457,0.000042227,0.00008042553,0.00081965304,0.00012993392,0.7517462,0.13982402,0.091464855,0.014526301,0.00008269901],"about_ca_topic_score_codex":0.00035363896,"about_ca_topic_score_gemma":0.00036973128,"teacher_disagreement_score":0.0030881208,"about_ca_system_score_codex":0.00049662305,"about_ca_system_score_gemma":0.0013083902,"threshold_uncertainty_score":0.012916803},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019872095,0.0007679576,0.0011192119,0.104985386,0.88977504,0.000025443002,0.0008434473,0.0005310366,0.001753703],"genre_scores_gemma":[0.02639481,0.008661366,0.0063835797,0.25534633,0.48560202,0.00031145324,0.0020362327,0.0017159426,0.2135483],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943921,0.0007562529,0.0009037198,0.0009676299,0.0022967206,0.0006835115],"domain_scores_gemma":[0.9480398,0.012315201,0.0025391914,0.0030619663,0.031620175,0.0024236313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004081358,0.002076472,0.0021046975,0.002757174,0.0037977376,0.0048018983,0.004060961,0.013867221,0.03565654],"category_scores_gemma":[0.0789812,0.0012077689,0.0017586857,0.0021349844,0.0040974612,0.0027464477,0.0025987693,0.019583253,0.034382984],"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.000041943502,0.000007231443,0.00007027196,0.0001049943,0.00001593945,0.00023008815,0.0000711016,0.0000722567,0.00007402843,0.0011467373,0.9941156,0.0040498255],"study_design_scores_gemma":[0.000060865048,0.000026644013,0.0007554164,0.0002580709,0.000044850876,0.00051384035,0.00017176055,0.0005541535,0.00057621306,0.0019823485,0.9949921,0.000063775384],"about_ca_topic_score_codex":0.02467052,"about_ca_topic_score_gemma":0.02237507,"teacher_disagreement_score":0.03565654,"about_ca_system_score_codex":0.0059247273,"about_ca_system_score_gemma":0.008927638,"threshold_uncertainty_score":0.11928302},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07208539,0.0011036489,0.92256474,0.00020516808,0.00014862815,0.00008172643,0.0010776902,0.0007412685,0.0019917458],"genre_scores_gemma":[0.8073538,0.0010024281,0.18282925,0.000118075885,0.0001311861,0.00013263214,0.0016818471,0.000069621994,0.0066810516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998441,0.000024697605,0.000009502833,0.000057872923,0.000041771935,0.000022126358],"domain_scores_gemma":[0.9998667,0.000034198594,0.000022566304,0.000021012896,0.00004174468,0.000013832948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034902676,0.00046392795,0.00049286144,0.0007654425,0.00020258401,0.00034568843,0.0004183785,0.0003813103,0.0023018727],"category_scores_gemma":[0.0007176795,0.00017646022,0.0003613914,0.0011311728,0.00014305866,0.00061767345,0.00042022616,0.0003433635,0.00047020457],"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.00047993864,0.00023859022,0.004024066,0.0001236452,0.00012941085,0.00013079701,0.0000434293,0.08910483,0.059100255,0.004761658,0.005297075,0.8365663],"study_design_scores_gemma":[0.000009179934,0.00006284729,0.00483832,0.0000069194057,0.000029342915,0.0000747149,0.000014883446,0.9852593,0.006071656,0.00257682,0.0010460385,0.00000992668],"about_ca_topic_score_codex":0.0057240073,"about_ca_topic_score_gemma":0.009428182,"teacher_disagreement_score":0.0057240073,"about_ca_system_score_codex":0.00033251548,"about_ca_system_score_gemma":0.0004363949,"threshold_uncertainty_score":0.011381388},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018669888,0.00068557396,0.9644739,0.0008291138,0.00039551264,0.0001145153,0.001048315,0.010628949,0.0031542748],"genre_scores_gemma":[0.38785386,0.0007006026,0.5880568,0.001274608,0.0004183352,0.0004242921,0.006011335,0.0013101951,0.013950006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896026,0.00025203946,0.000049996685,0.00040060582,0.00023935552,0.0000976916],"domain_scores_gemma":[0.9993284,0.00017618385,0.00003541745,0.00022440968,0.00016866115,0.00006698859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011864902,0.0009462071,0.0015079597,0.0008257846,0.00084480294,0.0013826374,0.00290655,0.0021618642,0.0040053804],"category_scores_gemma":[0.0037599157,0.00046062915,0.001104736,0.0013123457,0.00066920597,0.0038923207,0.0029073071,0.0026009898,0.0036987613],"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.000419944,0.000538682,0.0015027535,0.00022690541,0.00022322402,0.0001991215,0.0001352718,0.119575836,0.0142281335,0.036513306,0.05296925,0.7734676],"study_design_scores_gemma":[0.00002259244,0.000052736148,0.00015083037,0.000007276876,0.000021286025,0.00005861106,0.00001864183,0.96268886,0.0030106625,0.030060986,0.0038915102,0.000016001306],"about_ca_topic_score_codex":0.005529228,"about_ca_topic_score_gemma":0.009895451,"teacher_disagreement_score":0.005529228,"about_ca_system_score_codex":0.00076319557,"about_ca_system_score_gemma":0.00227484,"threshold_uncertainty_score":0.013399303},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11825252,0.0010870222,0.8595911,0.0013198318,0.00025433474,0.00030901542,0.00024033675,0.00055904913,0.018386807],"genre_scores_gemma":[0.96349525,0.0003651129,0.031470347,0.00011126859,0.00005143386,0.00009745707,0.00010857689,0.000027302487,0.004273175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970945,0.0009918642,0.0001817669,0.00036450586,0.0009998668,0.00036755812],"domain_scores_gemma":[0.9960233,0.0017265044,0.00033270914,0.0012014807,0.00057255547,0.00014343798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025534423,0.00028290178,0.0007875226,0.0008133197,0.0015328521,0.0017447767,0.0010030952,0.0012716497,0.0036801922],"category_scores_gemma":[0.0048616095,0.00021548787,0.00056289334,0.0011051965,0.0015138224,0.0030665437,0.0021408682,0.0010669983,0.00045401245],"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.0013164869,0.00031290797,0.0038624187,0.000655318,0.00022026,0.0012279459,0.00094603904,0.17345104,0.041235175,0.5584901,0.0068429257,0.21143945],"study_design_scores_gemma":[0.00015155904,0.00033854487,0.00069835666,0.00011879667,0.00008131029,0.000725193,0.0001958484,0.6883338,0.026152188,0.27055198,0.01258685,0.000065478125],"about_ca_topic_score_codex":0.0009570354,"about_ca_topic_score_gemma":0.0007650702,"teacher_disagreement_score":0.0036801922,"about_ca_system_score_codex":0.0008233755,"about_ca_system_score_gemma":0.0021310332,"threshold_uncertainty_score":0.013504088},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04346244,0.0013733165,0.9498314,0.00055943424,0.00012341955,0.00010467152,0.0009645144,0.0015961347,0.0019847704],"genre_scores_gemma":[0.64436346,0.0009962535,0.34254476,0.00034008108,0.00017810897,0.00019415973,0.003058085,0.0003230749,0.008001852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874735,0.00027998645,0.0000828409,0.0004270505,0.000348598,0.00011410293],"domain_scores_gemma":[0.99453074,0.0032413045,0.00032900536,0.0008696255,0.00081362925,0.00021568137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014423288,0.0007465542,0.0019600918,0.0029452455,0.0011221471,0.0014048899,0.0035701052,0.0018572862,0.0029913252],"category_scores_gemma":[0.009219452,0.0010801526,0.0014302043,0.00438499,0.00083498243,0.0031819872,0.0014848037,0.002151339,0.0010271599],"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.00038239147,0.00038291808,0.00655065,0.00030067997,0.0003327932,0.00018669521,0.0002707706,0.64886,0.004950116,0.031887237,0.010705259,0.29519042],"study_design_scores_gemma":[0.0000055914975,0.000015652382,0.0002503808,0.0000060288535,0.000015576987,0.000025325335,0.000009884693,0.9935262,0.00023191932,0.005379119,0.00052812387,0.000006297899],"about_ca_topic_score_codex":0.029792964,"about_ca_topic_score_gemma":0.048397683,"teacher_disagreement_score":0.029792964,"about_ca_system_score_codex":0.0013940458,"about_ca_system_score_gemma":0.0014604123,"threshold_uncertainty_score":0.05923909},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038633335,0.000102987295,0.95704055,0.00011797208,0.000027609485,0.000057176218,0.00009509429,0.0009765843,0.0029486425],"genre_scores_gemma":[0.9563122,0.00009025971,0.042074904,0.000020791096,0.00001928853,0.00008442998,0.000088076646,0.00012507023,0.0011850185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727315,0.0012313074,0.0001264517,0.00025714794,0.00086784293,0.00024408562],"domain_scores_gemma":[0.9919518,0.0054551074,0.0006712038,0.0007934523,0.0009685864,0.00015988696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004020154,0.00092377583,0.0008281625,0.001055483,0.00044191486,0.0019642175,0.0012210744,0.0006214645,0.0033647332],"category_scores_gemma":[0.011923215,0.00034333012,0.0009704539,0.0005129977,0.0017003396,0.0022160786,0.0008951788,0.00097376364,0.00033281205],"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.00008241069,0.00003866805,0.0006632803,0.000087677625,0.000023169463,0.000038653707,0.000067206885,0.9421108,0.002068032,0.047023483,0.00017274637,0.0076239966],"study_design_scores_gemma":[0.000003333164,0.000016063874,0.00006703732,0.0000052385644,0.000006070331,0.0000037519753,0.0000066968782,0.9925217,0.0008364033,0.006412352,0.000118388234,0.0000030321723],"about_ca_topic_score_codex":0.005193983,"about_ca_topic_score_gemma":0.0028510334,"teacher_disagreement_score":0.005193983,"about_ca_system_score_codex":0.001993644,"about_ca_system_score_gemma":0.0018907053,"threshold_uncertainty_score":0.021260858},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03736192,0.0010282408,0.9507484,0.00058349187,0.0005655432,0.00023243681,0.00032846938,0.001790773,0.00736071],"genre_scores_gemma":[0.3651452,0.000514964,0.62537533,0.00031257226,0.00016388104,0.00018808722,0.00050429645,0.0002786804,0.0075171017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961543,0.00007384026,0.000020780342,0.00008490286,0.00013308522,0.000071975686],"domain_scores_gemma":[0.9994816,0.00018251492,0.00004973703,0.000059309554,0.00014586482,0.00008105108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005745438,0.0005956718,0.00079557794,0.0006441563,0.0006698543,0.00075302116,0.0016375638,0.0007992976,0.0021572115],"category_scores_gemma":[0.0011832154,0.00039224836,0.0005606343,0.0015723865,0.00026426683,0.00069129805,0.0007372687,0.0008968876,0.00043910186],"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.0006388827,0.0003869002,0.0011655175,0.00023712097,0.00012688922,0.00016824283,0.000035674784,0.6708649,0.008341434,0.007961449,0.014067288,0.2960057],"study_design_scores_gemma":[0.000054701122,0.000044083725,0.0001365695,0.0000041469043,0.000009562001,0.000048172074,0.000005447469,0.99602735,0.00067202863,0.0011530005,0.0018386245,0.000006359305],"about_ca_topic_score_codex":0.012442913,"about_ca_topic_score_gemma":0.015090633,"teacher_disagreement_score":0.012442913,"about_ca_system_score_codex":0.0006101016,"about_ca_system_score_gemma":0.0027380304,"threshold_uncertainty_score":0.024740994},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13985898,0.000952375,0.77409905,0.0018609529,0.0011413648,0.0007737741,0.0033711584,0.06523865,0.012703632],"genre_scores_gemma":[0.69676954,0.00032788288,0.29572567,0.00045927544,0.00018934449,0.0002599527,0.0019345322,0.0004627759,0.0038709599],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920684,0.00019839368,0.00007545774,0.00015996494,0.0003038999,0.00005561168],"domain_scores_gemma":[0.99794024,0.00092275534,0.00020405326,0.0003401609,0.00045009068,0.00014281423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016690166,0.0010127809,0.0006823705,0.002530608,0.00060064223,0.0017403051,0.0010379906,0.00068377407,0.0022642575],"category_scores_gemma":[0.003910993,0.00032313477,0.00051315,0.0012821632,0.0006005696,0.001646632,0.0010102118,0.00099329,0.0006944322],"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.0017612688,0.0017445743,0.078033775,0.0007844788,0.0009022452,0.0009808067,0.00083680486,0.19746004,0.037061792,0.0327659,0.053706404,0.59396195],"study_design_scores_gemma":[0.000033267897,0.00010081133,0.0031254252,0.000015692149,0.000045618202,0.00011596676,0.0000857868,0.9743465,0.010320605,0.006527387,0.0052625216,0.000020404095],"about_ca_topic_score_codex":0.0031283782,"about_ca_topic_score_gemma":0.0032687634,"teacher_disagreement_score":0.0031283782,"about_ca_system_score_codex":0.00076432736,"about_ca_system_score_gemma":0.0013034523,"threshold_uncertainty_score":0.008826733},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36257818,0.0010594982,0.62567633,0.0006430448,0.00015792689,0.000046977857,0.0024523246,0.0037260582,0.003659585],"genre_scores_gemma":[0.904101,0.0004829879,0.0887157,0.00008959083,0.00013502293,0.000040380673,0.0033238342,0.00023109095,0.002880464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997123,0.00006311176,0.000015661843,0.00008270123,0.00005602766,0.00007020898],"domain_scores_gemma":[0.9992574,0.00041935104,0.000086087886,0.00007690926,0.0001241581,0.000036068654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005656128,0.00051552436,0.0005018502,0.0020744503,0.00025009114,0.00069550454,0.00047931756,0.00050637376,0.0021289282],"category_scores_gemma":[0.0016321603,0.0002603063,0.0007242447,0.0017422853,0.00018074404,0.0007444715,0.0004900339,0.0008171542,0.0015668373],"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.0006414166,0.00044861977,0.042870734,0.00012964214,0.00018276562,0.00037550885,0.00017765259,0.043449298,0.06619084,0.004301295,0.010961871,0.83027023],"study_design_scores_gemma":[0.000022821825,0.00009471571,0.024192814,0.000020962747,0.000072236035,0.00015732905,0.00012921347,0.95655066,0.0085274475,0.0068103345,0.003394979,0.000026357999],"about_ca_topic_score_codex":0.0035124281,"about_ca_topic_score_gemma":0.004072073,"teacher_disagreement_score":0.0035124281,"about_ca_system_score_codex":0.00017886092,"about_ca_system_score_gemma":0.00047815364,"threshold_uncertainty_score":0.00712198},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06316064,0.0007356342,0.9280299,0.0036870686,0.00010298503,0.00008458401,0.00016631017,0.0005333217,0.003499543],"genre_scores_gemma":[0.9159196,0.00027996305,0.081792265,0.00035241357,0.00010472235,0.000067601904,0.00014417242,0.00008186277,0.0012573737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9623663,0.022944635,0.0014128137,0.004262099,0.006254095,0.002760027],"domain_scores_gemma":[0.8675765,0.09074152,0.005079138,0.026791487,0.007371041,0.0024403532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.035955444,0.0008352857,0.002503756,0.0018778604,0.002563414,0.010156001,0.0047269533,0.003387115,0.00248672],"category_scores_gemma":[0.13525707,0.00091110845,0.0015265523,0.002814146,0.0062411143,0.02429552,0.010007144,0.0059085875,0.0003684354],"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.00082802365,0.00043640062,0.0066685993,0.00018759245,0.00020086807,0.00013428638,0.00078170345,0.17867112,0.00099544,0.7112295,0.0021373346,0.09772906],"study_design_scores_gemma":[0.000022374372,0.000060542876,0.00033487752,0.000040570274,0.000027183461,0.000041484785,0.00015838117,0.44723853,0.00129215,0.54978347,0.0009817824,0.000018732857],"about_ca_topic_score_codex":0.003112137,"about_ca_topic_score_gemma":0.0018782152,"teacher_disagreement_score":0.035955444,"about_ca_system_score_codex":0.005353575,"about_ca_system_score_gemma":0.006413811,"threshold_uncertainty_score":0.19015282},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018981624,0.00061688403,0.9634777,0.00055211026,0.0003918328,0.00016941837,0.00012030922,0.00062002655,0.015070268],"genre_scores_gemma":[0.28419206,0.00039839104,0.70529085,0.00083924487,0.00018476018,0.0005433517,0.0002585282,0.00026157213,0.008031233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999637,0.00011622738,0.000017967457,0.000055582055,0.00013021394,0.000042904223],"domain_scores_gemma":[0.9994216,0.00030103535,0.000056684694,0.000042356034,0.0001319293,0.000046447458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009425244,0.0010246279,0.0013638051,0.0013304803,0.0007662865,0.0011622909,0.0023918606,0.0024859526,0.004415323],"category_scores_gemma":[0.0018712255,0.0005844134,0.0012222537,0.0013567965,0.0008335857,0.0010324725,0.0018546873,0.0015792947,0.000601321],"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.00010633545,0.00011864873,0.00047340203,0.00008793259,0.000105722174,0.000060023805,0.000045582517,0.9216217,0.0017605927,0.018929185,0.0031226333,0.053568218],"study_design_scores_gemma":[0.000033279925,0.000027291591,0.000034140136,0.000005861396,0.000011468419,0.000009408562,0.0000054936836,0.9974572,0.00014374069,0.0016457203,0.00062193203,0.0000045395327],"about_ca_topic_score_codex":0.006080605,"about_ca_topic_score_gemma":0.007535724,"teacher_disagreement_score":0.006080605,"about_ca_system_score_codex":0.0010307162,"about_ca_system_score_gemma":0.0025896525,"threshold_uncertainty_score":0.014770746},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0101450635,0.0003084024,0.9829301,0.000590863,0.00017284584,0.00007067595,0.00038820299,0.0025058596,0.0028879794],"genre_scores_gemma":[0.4779857,0.0004298575,0.48806542,0.001085639,0.0005105185,0.00046409757,0.0021198862,0.001356647,0.02798222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994436,0.00014976019,0.000022261327,0.00018756799,0.00013141945,0.00006536899],"domain_scores_gemma":[0.99850994,0.00088724936,0.000079510944,0.00030261246,0.0001598581,0.000060780698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010781068,0.0013047621,0.0012398916,0.0009417878,0.00040276098,0.001180422,0.0020920718,0.0025064645,0.0077128317],"category_scores_gemma":[0.0040347097,0.00077521405,0.0015519371,0.0010509919,0.001135899,0.0014980036,0.0022051414,0.0024785295,0.002805779],"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.00025126126,0.00014286117,0.00040812642,0.00013176863,0.00009644499,0.00015383157,0.00006355528,0.7839429,0.00959501,0.018753603,0.009373073,0.17708763],"study_design_scores_gemma":[0.00000722417,0.000011704668,0.000028814426,0.0000031166505,0.000007009442,0.00001830107,0.000003700705,0.9926906,0.0017827246,0.004876025,0.00056690024,0.000003910815],"about_ca_topic_score_codex":0.0028424247,"about_ca_topic_score_gemma":0.0045901737,"teacher_disagreement_score":0.0077128317,"about_ca_system_score_codex":0.00077306695,"about_ca_system_score_gemma":0.0009359127,"threshold_uncertainty_score":0.025802016},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11130782,0.000073317475,0.8531713,0.00040256834,0.000057108806,0.00009912534,0.00004604726,0.0005430054,0.034299638],"genre_scores_gemma":[0.87270427,0.000037909384,0.12249646,0.0000588891,0.000010054639,0.00004867759,0.0000419038,0.00006344512,0.0045384085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950814,0.00024318184,0.000012083204,0.00010870207,0.000087468936,0.000040479088],"domain_scores_gemma":[0.9989429,0.00055974425,0.00006805003,0.00023917042,0.00012276112,0.00006742702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008055733,0.00037348643,0.00023999307,0.00034371638,0.00038030304,0.0016683978,0.0007853979,0.0005843995,0.0059578144],"category_scores_gemma":[0.0022962487,0.0002774217,0.000631464,0.00026334476,0.0016678618,0.0018395843,0.0014275393,0.0007747691,0.00045249224],"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.0003870066,0.00036333792,0.010193714,0.00036882955,0.00018700003,0.00074237585,0.0083413655,0.15860446,0.11164309,0.48193234,0.0030551904,0.22418128],"study_design_scores_gemma":[0.00002335802,0.0001560748,0.0041764914,0.000039933944,0.000034302713,0.00038541967,0.0009893945,0.83254355,0.0121909315,0.13971393,0.009704024,0.00004253927],"about_ca_topic_score_codex":0.0010023768,"about_ca_topic_score_gemma":0.0013327599,"teacher_disagreement_score":0.0059578144,"about_ca_system_score_codex":0.00042899148,"about_ca_system_score_gemma":0.0003379955,"threshold_uncertainty_score":0.01993084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13049045,0.0008602236,0.862925,0.00029095204,0.00025276907,0.00008740281,0.00016112982,0.001580016,0.0033520213],"genre_scores_gemma":[0.68826365,0.0004881029,0.29552817,0.0003213521,0.00014691486,0.000103866725,0.00041365618,0.00007033848,0.01466392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985826,0.000016100319,0.000006801226,0.00004740739,0.000046948826,0.00002442712],"domain_scores_gemma":[0.9998141,0.00005038035,0.000012030094,0.000017831948,0.00009188152,0.000013750057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042929663,0.0004964073,0.00050990254,0.00034938514,0.00024626503,0.0004169402,0.0010187969,0.0007062097,0.0022201387],"category_scores_gemma":[0.0005401766,0.00030175576,0.0003339785,0.00032773113,0.00020517546,0.00059450883,0.000603884,0.00055765174,0.0005773908],"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.0005730783,0.00036714596,0.001908848,0.00013533054,0.0001540307,0.00021394102,0.00005550221,0.19857754,0.09202815,0.0025590437,0.00462943,0.6987979],"study_design_scores_gemma":[0.00000859617,0.000072205505,0.00050018873,0.0000031200495,0.00002335556,0.000036666304,0.0000040411,0.99122334,0.0070956023,0.00034420966,0.00068365963,0.000005073158],"about_ca_topic_score_codex":0.0043772548,"about_ca_topic_score_gemma":0.008960356,"teacher_disagreement_score":0.0043772548,"about_ca_system_score_codex":0.00039285736,"about_ca_system_score_gemma":0.0005197671,"threshold_uncertainty_score":0.00870353},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006888274,0.00006322175,0.9912544,0.000038250746,0.000013113994,0.000035715213,0.000032342898,0.0011718293,0.00050278933],"genre_scores_gemma":[0.04850153,0.00007656035,0.9490727,0.000067834844,0.000010772317,0.000054492903,0.00020097729,0.00051819923,0.0014970253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909973,0.00014576905,0.000053686836,0.00014759145,0.00046840028,0.00008483154],"domain_scores_gemma":[0.9977145,0.00082079525,0.00011363002,0.0006712972,0.0005726646,0.00010707424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013244982,0.0009971572,0.001188507,0.0014836497,0.00068552926,0.0014329467,0.0027946557,0.0015655847,0.005298687],"category_scores_gemma":[0.0052504344,0.0010179984,0.0010898977,0.0014924393,0.0010487605,0.0013942331,0.0029012566,0.002116099,0.0022765938],"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.0003745768,0.00012781238,0.0015181665,0.00017264327,0.000084266,0.00016627548,0.0004258642,0.12629083,0.034258146,0.019523328,0.005812128,0.811246],"study_design_scores_gemma":[0.000018788622,0.00004275865,0.0001424454,0.0000096489275,0.000010715965,0.000086674125,0.000024038623,0.98396367,0.00837603,0.00449064,0.002819073,0.000015472471],"about_ca_topic_score_codex":0.008009644,"about_ca_topic_score_gemma":0.012656646,"teacher_disagreement_score":0.008009644,"about_ca_system_score_codex":0.0005599959,"about_ca_system_score_gemma":0.001759704,"threshold_uncertainty_score":0.017725825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005881211,0.000085217085,0.98857343,0.00011509163,0.00004502117,0.00015297164,0.00012849015,0.0025198725,0.0024988134],"genre_scores_gemma":[0.1945676,0.00017349655,0.79834807,0.00016271237,0.00006350578,0.0003187024,0.00074198004,0.0009423363,0.004681681],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960383,0.00087436667,0.00036764442,0.00070437806,0.0014809658,0.00053425925],"domain_scores_gemma":[0.985499,0.0062822974,0.00059501635,0.0057267016,0.0015694476,0.000327558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030454046,0.0013981841,0.0015284271,0.0020797777,0.0013721583,0.0032351436,0.004338005,0.0017154205,0.01848751],"category_scores_gemma":[0.019728566,0.0012220273,0.0021062002,0.0018100913,0.0022395966,0.0059408443,0.004465664,0.0031616238,0.0041692187],"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.00105685,0.00035588077,0.0011142332,0.00055926025,0.0001195054,0.0001729328,0.00046684273,0.18995474,0.012030885,0.276013,0.013101328,0.50505453],"study_design_scores_gemma":[0.00020342387,0.000090691705,0.00033140177,0.000055916553,0.00011151844,0.00012322702,0.00007395577,0.6296661,0.011530184,0.35023242,0.0075272084,0.00005396914],"about_ca_topic_score_codex":0.005097182,"about_ca_topic_score_gemma":0.007783787,"teacher_disagreement_score":0.01848751,"about_ca_system_score_codex":0.0026400653,"about_ca_system_score_gemma":0.003463254,"threshold_uncertainty_score":0.061846912},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09381748,0.00045462584,0.89923394,0.00023409475,0.00023202239,0.00003756695,0.00008060986,0.0015034701,0.004406122],"genre_scores_gemma":[0.92039764,0.00019737352,0.07421045,0.000085870524,0.000044427616,0.000046170764,0.00010377778,0.00003521653,0.0048791524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998461,0.000022067503,0.000009032885,0.000048831967,0.000048594666,0.000025235453],"domain_scores_gemma":[0.99984396,0.00003730795,0.000012235145,0.000011351143,0.000084937405,0.000010061544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025764236,0.0004485165,0.00037828775,0.00023286593,0.0002815325,0.00036788103,0.00061291497,0.00053128577,0.0012561729],"category_scores_gemma":[0.0005614745,0.00020206913,0.00018865798,0.00032819607,0.00021251745,0.0005403012,0.00042948147,0.0005672811,0.00041338586],"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.00069360016,0.00020984447,0.003465503,0.00013132696,0.00008496477,0.00014719863,0.0000995727,0.38430077,0.05235102,0.001921095,0.0028839132,0.5537112],"study_design_scores_gemma":[0.000006416393,0.000029285635,0.000354314,0.000003075658,0.000008431954,0.000013548663,0.000006875859,0.9952366,0.0039397683,0.00015626357,0.00024062855,0.0000048299344],"about_ca_topic_score_codex":0.008076472,"about_ca_topic_score_gemma":0.0076436745,"teacher_disagreement_score":0.008076472,"about_ca_system_score_codex":0.00031748094,"about_ca_system_score_gemma":0.00048562244,"threshold_uncertainty_score":0.016058922},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22000033,0.00048951333,0.765138,0.00042561343,0.00017563856,0.000105645326,0.00006793034,0.00083163276,0.012765633],"genre_scores_gemma":[0.79050773,0.000101275764,0.20459291,0.00014048483,0.000038697268,0.00015412107,0.000113298935,0.00012219428,0.004229253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948895,0.0001773828,0.000021280668,0.000086046515,0.00014482823,0.00008136526],"domain_scores_gemma":[0.9991485,0.00031497172,0.00004912512,0.00014412895,0.00023350102,0.000109839246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011949969,0.0006707688,0.0010042976,0.00044831412,0.00066350575,0.00074329233,0.0017916526,0.0011952069,0.0017300583],"category_scores_gemma":[0.0022899713,0.00043040383,0.00071134896,0.00063199655,0.0006267718,0.0008455749,0.0016805282,0.0012097612,0.0003590139],"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.00012803994,0.00013295852,0.00089366816,0.00004190534,0.00007415714,0.00010828529,0.000066053355,0.9532689,0.0037139354,0.0037269727,0.0015208252,0.036324263],"study_design_scores_gemma":[0.0000096581225,0.000019408692,0.000072779505,9.222135e-7,0.000004179983,0.00000611334,0.0000053650197,0.9988992,0.00025322242,0.00059258856,0.0001345638,0.0000018924956],"about_ca_topic_score_codex":0.0059945364,"about_ca_topic_score_gemma":0.0076565254,"teacher_disagreement_score":0.0059945364,"about_ca_system_score_codex":0.0004841607,"about_ca_system_score_gemma":0.0011448817,"threshold_uncertainty_score":0.01191926},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03251089,0.00024609515,0.94708645,0.00044695375,0.000073164774,0.0001816434,0.00048490838,0.015220597,0.0037493887],"genre_scores_gemma":[0.34943455,0.00015171211,0.6434933,0.00023513309,0.000088681205,0.00021805974,0.0013138988,0.0010054251,0.004059264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987453,0.0003986592,0.000109307446,0.00032359836,0.0002793282,0.0001437521],"domain_scores_gemma":[0.9967218,0.0014474767,0.00011371352,0.0008047121,0.0007127628,0.00019947448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015769731,0.00089558196,0.0013459054,0.0014900224,0.0010397716,0.0020362495,0.0024456193,0.0008341133,0.008616065],"category_scores_gemma":[0.006508486,0.00054441614,0.0020324383,0.0011268525,0.000802683,0.0046773762,0.002882354,0.0021850294,0.0024504412],"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.0006464237,0.00061548565,0.0031002488,0.0004610073,0.00021141524,0.00049842737,0.001597068,0.06002975,0.027346227,0.0673518,0.023958512,0.81418365],"study_design_scores_gemma":[0.00005366978,0.00006642627,0.0002931091,0.000015346486,0.00009613193,0.00007780637,0.00021201825,0.9327101,0.0089239655,0.052014172,0.0055050203,0.0000322307],"about_ca_topic_score_codex":0.008757343,"about_ca_topic_score_gemma":0.014413259,"teacher_disagreement_score":0.008757343,"about_ca_system_score_codex":0.0012114841,"about_ca_system_score_gemma":0.0032128524,"threshold_uncertainty_score":0.028823614},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054508384,0.0011119656,0.8990781,0.0010028089,0.00075539097,0.00007879544,0.00013252569,0.00024938758,0.04308271],"genre_scores_gemma":[0.6678358,0.0019710464,0.29363188,0.0009833578,0.00090353464,0.0002547725,0.00031598503,0.00032093626,0.03378282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957603,0.000177503,0.000025534619,0.0000703743,0.000100147845,0.00005048011],"domain_scores_gemma":[0.9993211,0.00027642047,0.00006420808,0.00008212017,0.0001254752,0.00013071505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014518166,0.0008887669,0.00063325185,0.002493987,0.0011582496,0.002036364,0.001298136,0.0014444133,0.005731051],"category_scores_gemma":[0.0038651424,0.00037273736,0.00076402404,0.0013176969,0.0029186613,0.0022444213,0.0023044564,0.0024778398,0.0014498057],"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.000012039264,0.000006712641,0.000038867223,0.000021153763,0.0000024883648,0.00005445436,0.000121757395,0.0015451522,0.0005872412,0.99048984,0.00056856096,0.006551768],"study_design_scores_gemma":[0.0000064875117,0.000024442994,0.0000460531,0.000014917541,0.000003493341,0.000082644096,0.00003800351,0.021344518,0.00038332396,0.9742668,0.0037765433,0.000012705844],"about_ca_topic_score_codex":0.0006842412,"about_ca_topic_score_gemma":0.00058022025,"teacher_disagreement_score":0.005731051,"about_ca_system_score_codex":0.0006947914,"about_ca_system_score_gemma":0.0006501786,"threshold_uncertainty_score":0.019172251},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24283934,0.0036898016,0.6853842,0.0029493133,0.0022648273,0.0012749893,0.0063154697,0.035489045,0.019793013],"genre_scores_gemma":[0.6956043,0.0005719486,0.28059787,0.00097629224,0.00050257595,0.00025035912,0.0044424515,0.0002595227,0.016794618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994742,0.0000680696,0.00005058561,0.00018074403,0.00016948009,0.00005697069],"domain_scores_gemma":[0.99851674,0.0004430808,0.00006394639,0.00019067248,0.0006079395,0.00017771222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000850528,0.00088145916,0.0010364905,0.0013782792,0.0008914856,0.001270017,0.0015474256,0.0012888261,0.0031304162],"category_scores_gemma":[0.0022923278,0.00048246767,0.0007022996,0.0010106985,0.00019557713,0.0015915191,0.0009972113,0.0011106574,0.0028183428],"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.001864505,0.0027684825,0.035900336,0.0007367006,0.0011053034,0.0019135576,0.0005087652,0.05300196,0.07834386,0.0036768524,0.06550491,0.75467473],"study_design_scores_gemma":[0.00007448918,0.000239459,0.005992156,0.000021932488,0.0001629574,0.00033393857,0.00012217755,0.9777199,0.00676796,0.0015089541,0.006977815,0.00007835877],"about_ca_topic_score_codex":0.020167904,"about_ca_topic_score_gemma":0.059497625,"teacher_disagreement_score":0.020167904,"about_ca_system_score_codex":0.00043128888,"about_ca_system_score_gemma":0.0008818146,"threshold_uncertainty_score":0.04010105},"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":"editorial","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040916636,0.0013921696,0.0029207633,0.02561166,0.9600459,0.000029602399,0.0016125019,0.0009624516,0.0070158443],"genre_scores_gemma":[0.050577138,0.010295092,0.018420449,0.045455694,0.24151817,0.00027653953,0.0073345844,0.0054302467,0.62069213],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957826,0.0005839442,0.00061916484,0.0006668365,0.0020233442,0.00032411626],"domain_scores_gemma":[0.95976806,0.004960633,0.001322491,0.0036926733,0.029079895,0.001176295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003613018,0.0017743575,0.0022383577,0.0035824943,0.0033001143,0.0045810733,0.004603874,0.005115083,0.07870463],"category_scores_gemma":[0.0561215,0.0009900243,0.0016705339,0.0043922924,0.0025893815,0.003230615,0.0023865327,0.009554164,0.045723375],"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.000054872435,0.000007365133,0.00013525492,0.00019286347,0.000024403545,0.00019543617,0.00004768764,0.00028537615,0.00010970799,0.0026720397,0.9861078,0.01016702],"study_design_scores_gemma":[0.000062781866,0.00003474704,0.0010351276,0.000283147,0.00006610603,0.0005879707,0.00011041239,0.0013602972,0.0010672605,0.0033815654,0.99195486,0.00005572465],"about_ca_topic_score_codex":0.022047898,"about_ca_topic_score_gemma":0.022154484,"teacher_disagreement_score":0.07870463,"about_ca_system_score_codex":0.0036318053,"about_ca_system_score_gemma":0.006140004,"threshold_uncertainty_score":0.2632932},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019517331,0.00057755853,0.0009928171,0.08877498,0.90600157,0.000025774438,0.0017682562,0.00044673786,0.001217038],"genre_scores_gemma":[0.027813982,0.005896573,0.0075042266,0.21022245,0.56688684,0.00030400162,0.00408824,0.0017222322,0.17556149],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956,0.0006753209,0.0007889009,0.0008139099,0.0016651079,0.0004567008],"domain_scores_gemma":[0.9450823,0.014546063,0.00214218,0.0031885712,0.032267034,0.0027739531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036622658,0.0018592585,0.0019874307,0.0029625373,0.0032183575,0.0046321116,0.0033336324,0.010525952,0.05865746],"category_scores_gemma":[0.10004361,0.001053352,0.0016967673,0.0023015693,0.0028195812,0.0026195517,0.0023043302,0.012622357,0.04199102],"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.000056638546,0.000007589269,0.00012632979,0.000111429836,0.000019716292,0.00021140264,0.000045200308,0.000072185736,0.00006528376,0.0007682898,0.99504495,0.0034709997],"study_design_scores_gemma":[0.00010654306,0.00003321507,0.0012985496,0.0003270887,0.00005549528,0.0006645251,0.00020308353,0.0010051145,0.0005716956,0.0025870071,0.993067,0.0000807269],"about_ca_topic_score_codex":0.02622357,"about_ca_topic_score_gemma":0.027436659,"teacher_disagreement_score":0.05865746,"about_ca_system_score_codex":0.0039812014,"about_ca_system_score_gemma":0.005726181,"threshold_uncertainty_score":0.1962288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015780235,0.0001893571,0.9796158,0.0003125227,0.000066663015,0.000068400055,0.00045314574,0.0021278176,0.0013860977],"genre_scores_gemma":[0.6312339,0.00022318307,0.3587322,0.00055387785,0.00012319464,0.00020338093,0.0018424225,0.00042370483,0.006664249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997209,0.0009185579,0.00012883543,0.0007670507,0.0006257435,0.0003507125],"domain_scores_gemma":[0.99495983,0.001627761,0.00026961954,0.0023788828,0.00058041984,0.00018344911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030497946,0.0011032458,0.0023842414,0.0008388258,0.0011122751,0.0022004168,0.0036828385,0.0018923185,0.0034887814],"category_scores_gemma":[0.010350031,0.00069344253,0.0013064196,0.0017473957,0.001643203,0.0034610953,0.0042507043,0.0022170846,0.0016964951],"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.0011461946,0.00029385145,0.0019883858,0.00019659578,0.0002210116,0.00026771778,0.00030782347,0.7263558,0.007850464,0.073148035,0.012417342,0.1758068],"study_design_scores_gemma":[0.000013102984,0.000024250372,0.000092258335,0.000005925645,0.000007212042,0.0000465361,0.000019981264,0.9726552,0.0010883729,0.025538588,0.0004998173,0.000008785625],"about_ca_topic_score_codex":0.0034745468,"about_ca_topic_score_gemma":0.005477165,"teacher_disagreement_score":0.0036828385,"about_ca_system_score_codex":0.001390491,"about_ca_system_score_gemma":0.0019914014,"threshold_uncertainty_score":0.016129017},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03781039,0.30027694,0.5699855,0.0033373707,0.0013590252,0.00047176878,0.0028784988,0.011181716,0.072698735],"genre_scores_gemma":[0.28748855,0.313749,0.3522035,0.0025293953,0.0010794458,0.000503216,0.0055774874,0.0026301185,0.034239333],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987198,0.00032689434,0.000104573526,0.00015860051,0.0005863479,0.000103842285],"domain_scores_gemma":[0.99737394,0.0012296177,0.00012825172,0.00051686325,0.0006494273,0.00010193932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018837301,0.000976128,0.0012308547,0.0019942874,0.00046977832,0.0022737645,0.0032570749,0.0014623996,0.009832706],"category_scores_gemma":[0.006873894,0.0009239906,0.0006601558,0.0035632167,0.00050268444,0.004621759,0.0013990406,0.0012983277,0.0033113193],"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.0004007832,0.00025320676,0.0041309074,0.003733995,0.00012982967,0.00011618492,0.00017894038,0.074826226,0.008024747,0.07413305,0.04310723,0.79096496],"study_design_scores_gemma":[0.00009584454,0.0005566075,0.0019198739,0.0017795803,0.000191738,0.0010816603,0.00022615601,0.20529655,0.02271044,0.050158884,0.71584094,0.00014178501],"about_ca_topic_score_codex":0.0014770678,"about_ca_topic_score_gemma":0.001636504,"teacher_disagreement_score":0.009832706,"about_ca_system_score_codex":0.0010717032,"about_ca_system_score_gemma":0.0019039033,"threshold_uncertainty_score":0.032893717},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052933108,0.0003241269,0.9403163,0.00032971846,0.00005565029,0.000082498744,0.00011322168,0.0019312913,0.003914068],"genre_scores_gemma":[0.6033216,0.00018649834,0.39045,0.00022852543,0.00005481227,0.00021929278,0.00053286547,0.0005860425,0.0044203154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924314,0.00029227554,0.000031046216,0.00013681027,0.0002348473,0.00006184591],"domain_scores_gemma":[0.99827826,0.0011129637,0.00014406,0.00017220888,0.00023939591,0.000052995903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013367375,0.00089195586,0.0010155234,0.0009944101,0.00047786775,0.00092989823,0.001618888,0.0009581804,0.0036317257],"category_scores_gemma":[0.005919753,0.0002704869,0.0007920922,0.0008153256,0.00072098954,0.0010165442,0.0013289833,0.0011618885,0.0006685255],"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.000096107186,0.000087764165,0.0020748898,0.000080768834,0.00004673213,0.00010411087,0.00009423572,0.83868736,0.0026775496,0.016321208,0.0025108936,0.13721834],"study_design_scores_gemma":[0.0000069504376,0.000018834833,0.000060102942,0.00000400219,0.0000031634788,0.000011387758,0.0000069639786,0.99680007,0.0004567011,0.0022813138,0.000347951,0.0000025763677],"about_ca_topic_score_codex":0.0039268667,"about_ca_topic_score_gemma":0.0032364891,"teacher_disagreement_score":0.0039268667,"about_ca_system_score_codex":0.00068233476,"about_ca_system_score_gemma":0.0012821039,"threshold_uncertainty_score":0.012149274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33689073,0.0019853888,0.60711145,0.0017217145,0.00095247914,0.00012947571,0.0004311352,0.004617955,0.04615977],"genre_scores_gemma":[0.8664831,0.00022733363,0.12504339,0.00021947884,0.000059444465,0.00004623014,0.0001578206,0.000080509,0.0076826666],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999933,0.000011839504,0.0000033420151,0.000009997758,0.00003095834,0.000010767312],"domain_scores_gemma":[0.9999021,0.00002143981,0.000009777779,0.000015349882,0.0000335404,0.00001777299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014368232,0.00018236054,0.00024513798,0.00020419729,0.0002461676,0.000548354,0.0007022564,0.00031242453,0.0059417393],"category_scores_gemma":[0.00033120537,0.000115568146,0.00011051312,0.0003439762,0.00018965862,0.00056178495,0.00034765556,0.00047456534,0.00061958],"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.0017127119,0.0006837947,0.0023235595,0.00057628803,0.00017707297,0.0003397385,0.00018434781,0.15126163,0.2600589,0.17912698,0.035161134,0.36839393],"study_design_scores_gemma":[0.000092565,0.00029284976,0.00029235613,0.00002183323,0.000032489563,0.00008261176,0.000028578927,0.9340417,0.038863942,0.016856369,0.009372932,0.000021650847],"about_ca_topic_score_codex":0.00064486545,"about_ca_topic_score_gemma":0.0023959773,"teacher_disagreement_score":0.0059417393,"about_ca_system_score_codex":0.00032026804,"about_ca_system_score_gemma":0.0005217243,"threshold_uncertainty_score":0.019877136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8585226,0.0014430204,0.02839317,0.0010065926,0.00034328096,0.0005095834,0.09371561,0.011699836,0.004366249],"genre_scores_gemma":[0.70566726,0.00047889125,0.048335925,0.00041268088,0.00013063311,0.00049995695,0.2415401,0.00068261917,0.0022520206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983866,0.00027316305,0.00013773135,0.00043120957,0.0005445215,0.00022678518],"domain_scores_gemma":[0.99655604,0.00082206924,0.0004173174,0.00089045626,0.0010167947,0.00029735154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011958657,0.001827234,0.0005762266,0.0050445697,0.0007039067,0.0011721757,0.0014631874,0.0013823662,0.0005453663],"category_scores_gemma":[0.0053229146,0.0003287024,0.00081640936,0.0024695965,0.0005396319,0.0016014553,0.0013519389,0.0013401379,0.0007240853],"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.0015429411,0.0046779206,0.2868668,0.002072041,0.0012521183,0.0017658648,0.0008098674,0.12544629,0.062425043,0.00643281,0.20358062,0.3031277],"study_design_scores_gemma":[0.00026940182,0.0014796633,0.19310296,0.0002590713,0.0003756578,0.0019966473,0.0011502005,0.65524304,0.06814226,0.0076182336,0.07015429,0.00020861362],"about_ca_topic_score_codex":0.0077692424,"about_ca_topic_score_gemma":0.013627084,"teacher_disagreement_score":0.0077692424,"about_ca_system_score_codex":0.0006765865,"about_ca_system_score_gemma":0.0009995817,"threshold_uncertainty_score":0.015448093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55777085,0.0009135861,0.43468142,0.00029210246,0.00020850709,0.000120761,0.0007812334,0.0020490591,0.003182492],"genre_scores_gemma":[0.9627925,0.00018969022,0.035745963,0.000030564213,0.00006008509,0.00003266985,0.0005563578,0.000026127254,0.0005660528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990727,0.000090935006,0.00005839109,0.00021064008,0.00039721432,0.0001701565],"domain_scores_gemma":[0.9989654,0.00025126225,0.00016412654,0.00013697548,0.00040314006,0.00007922794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060459186,0.00077110104,0.0011233423,0.0030121587,0.00035957908,0.00089437613,0.00047584638,0.00038086833,0.0008361425],"category_scores_gemma":[0.00206463,0.00018525824,0.00074462587,0.0017778049,0.00031235366,0.0013164349,0.00097252266,0.0007122491,0.00032875908],"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.0010113866,0.00048793224,0.055440065,0.00013064501,0.000325556,0.00031932342,0.00016959445,0.034013595,0.10818577,0.0022813824,0.003981578,0.79365313],"study_design_scores_gemma":[0.000019564577,0.00033864204,0.05183162,0.000014875544,0.0001712391,0.0005339052,0.000106549705,0.9175565,0.025188588,0.002518568,0.0016641702,0.000055748755],"about_ca_topic_score_codex":0.0015348252,"about_ca_topic_score_gemma":0.0015519253,"teacher_disagreement_score":0.0030121587,"about_ca_system_score_codex":0.00036783566,"about_ca_system_score_gemma":0.0004955168,"threshold_uncertainty_score":0.003197372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13903444,0.0008196597,0.8282669,0.0013021118,0.00026042483,0.00025951295,0.00081210915,0.0023659468,0.026878849],"genre_scores_gemma":[0.77539796,0.00018661558,0.21228662,0.00035860765,0.00008891726,0.00037078976,0.00096887525,0.00064914656,0.0096923765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997429,0.00008059502,0.000010069339,0.000051272957,0.000059001366,0.00005616794],"domain_scores_gemma":[0.99965,0.00016380072,0.000023069564,0.000036512407,0.00010343816,0.000023127675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071681314,0.0009851805,0.0009881129,0.00042874968,0.00052503607,0.0010329841,0.0012861493,0.0011305177,0.008916384],"category_scores_gemma":[0.0016568407,0.00045683602,0.00076308247,0.00038136914,0.0004827589,0.0009919528,0.0006842568,0.001136104,0.0008248319],"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.00010867536,0.0000487126,0.00043045462,0.00005080704,0.000019827676,0.000034254255,0.000014533766,0.9729733,0.0007639827,0.0039118263,0.002836431,0.018807145],"study_design_scores_gemma":[0.000005583945,0.0000076169176,0.00003285029,0.0000019009073,0.0000020679304,0.000002196113,0.0000032561516,0.99923205,0.00008366094,0.00051943416,0.00010855707,8.9479886e-7],"about_ca_topic_score_codex":0.018120041,"about_ca_topic_score_gemma":0.019477915,"teacher_disagreement_score":0.018120041,"about_ca_system_score_codex":0.00082478975,"about_ca_system_score_gemma":0.0023421347,"threshold_uncertainty_score":0.03602916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052606042,0.0011989246,0.8912972,0.009155698,0.00087306224,0.00009140055,0.00042076583,0.0002642335,0.044092562],"genre_scores_gemma":[0.92043185,0.00093407475,0.06510771,0.0012723737,0.0011024569,0.00022502207,0.00020240393,0.00019978122,0.010524154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896824,0.00045639253,0.000039702263,0.00010692197,0.0003158687,0.00011294235],"domain_scores_gemma":[0.99552166,0.002870297,0.0002728058,0.0006328532,0.0004399473,0.00026237877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025683504,0.00068111724,0.0020081333,0.0011847527,0.0015883611,0.0026211157,0.0042649508,0.0028201109,0.0042250585],"category_scores_gemma":[0.00852207,0.0006476158,0.0012660808,0.0013406364,0.004590908,0.005776907,0.002848682,0.0032917135,0.00048528484],"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.000015852773,0.000026439147,0.0001514551,0.000020574105,0.000016678796,0.000035658948,0.00004285301,0.09753502,0.00018230891,0.89978933,0.00085297675,0.0013309479],"study_design_scores_gemma":[0.0000054688203,0.0000044044823,0.000042577834,0.0000043845666,0.000003180982,0.0000064722935,0.000008068291,0.4494188,0.000047751582,0.55017126,0.00027798786,0.000009607796],"about_ca_topic_score_codex":0.004885647,"about_ca_topic_score_gemma":0.0029841324,"teacher_disagreement_score":0.004885647,"about_ca_system_score_codex":0.0022754169,"about_ca_system_score_gemma":0.0015261575,"threshold_uncertainty_score":0.016509414},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12089129,0.0018302457,0.6240237,0.00079100137,0.0006660848,0.0006885204,0.0030853485,0.23751612,0.010507652],"genre_scores_gemma":[0.6289538,0.00063742965,0.3338369,0.0014080346,0.00019401683,0.0005893501,0.0056805573,0.0019264299,0.026773427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993801,0.00006840039,0.000044188815,0.0001368238,0.00031428074,0.00005613744],"domain_scores_gemma":[0.9991443,0.000261029,0.00010822112,0.00018311189,0.00021542197,0.00008774509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007346824,0.0008968585,0.0009161413,0.001523927,0.00043173027,0.000907535,0.002367063,0.00061451294,0.0057667275],"category_scores_gemma":[0.0017654586,0.00051714206,0.00041121314,0.0005944765,0.00037928924,0.001896149,0.0018065622,0.00096653786,0.0020257323],"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.0037917718,0.00081492093,0.00999857,0.0006015849,0.00059118937,0.00038545934,0.00013727341,0.035845097,0.08340076,0.0040415702,0.07389751,0.7864944],"study_design_scores_gemma":[0.00021912977,0.0005526065,0.0033108683,0.000037239115,0.00015210905,0.00024973074,0.000034122284,0.91538584,0.05677693,0.003827949,0.019343762,0.00010966906],"about_ca_topic_score_codex":0.0036357706,"about_ca_topic_score_gemma":0.0062016537,"teacher_disagreement_score":0.0057667275,"about_ca_system_score_codex":0.0008513546,"about_ca_system_score_gemma":0.00092200004,"threshold_uncertainty_score":0.01929158},"labels":[],"label_agreement":null}]}