{"meta":{"query_hash":"3a11c843eba1","filters":{"venue":"Journal of Parallel and Distributed Computing"},"cohort_total":76,"direct_labels_cover":0,"predictions_cover":76,"exported":76,"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/3a11c843eba1","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Parallel+and+Distributed+Computing"},"results":[{"id":"W1700848872","doi":"10.1016/j.jpdc.2008.03.002","title":"Computing all the best swap edges distributively","year":2008,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"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; University of Ottawa","funders":"","keywords":"Computer science; Swap (finance); Computation; Routing (electronic design automation); Distributed computing; Computer network; Algorithm","score_opus":0.0480711353341684,"score_gpt":0.27243581450483123,"score_spread":0.22436467917066283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1700848872","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.3689837,0.0006487458,0.59424525,0.0026085682,0.00042395928,0.0005749913,0.000873405,0.0036434783,0.027997982],"genre_scores_gemma":[0.55083656,0.0002607177,0.43130147,0.00056461163,0.00014649772,0.00020975145,0.0011261159,0.00080344477,0.0147508485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972595,0.00067407097,0.00017650556,0.0006525714,0.0006411129,0.0005961968],"domain_scores_gemma":[0.9929395,0.0031262701,0.00032492646,0.0024668765,0.0007821588,0.00036027498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023422262,0.0013967761,0.0022313972,0.0014329037,0.0025922784,0.0035273668,0.0037429393,0.001681414,0.011311701],"category_scores_gemma":[0.009210936,0.0011973863,0.0013094915,0.003157456,0.0022671795,0.0066605564,0.0028609245,0.0021238958,0.001835742],"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.0036911897,0.0014409961,0.0052191387,0.00052175287,0.00039535214,0.00029451426,0.000596409,0.37337098,0.028546244,0.08259413,0.021670876,0.48165846],"study_design_scores_gemma":[0.00040500512,0.0002634373,0.0007495704,0.000036571488,0.00023808816,0.00019718637,0.0005577021,0.6882419,0.024484556,0.27912366,0.005654893,0.00004754254],"about_ca_topic_score_codex":0.0025965823,"about_ca_topic_score_gemma":0.0099403085,"teacher_disagreement_score":0.011311701,"about_ca_system_score_codex":0.001704965,"about_ca_system_score_gemma":0.0041304263,"threshold_uncertainty_score":0.03784144},"labels":[],"label_agreement":null},{"id":"W1966659084","doi":"10.1016/j.jpdc.2008.07.013","title":"Replica selection strategies in data grid","year":2008,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":56,"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":"Replica; Computer science; Latency (audio); Grid; File transfer; Artificial neural network; Data mining; Transfer (computing); Parallel computing; Artificial intelligence","score_opus":0.04508819402732072,"score_gpt":0.28308071354938025,"score_spread":0.23799251952205952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966659084","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.3088469,0.0029311772,0.6679892,0.0016052789,0.00031972147,0.0002850471,0.0001957199,0.0010880916,0.016738856],"genre_scores_gemma":[0.9176006,0.00039778772,0.07729079,0.0001012264,0.00006827688,0.00010277244,0.000082258346,0.00013644721,0.004219865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986449,0.00066830317,0.00008287113,0.00014562807,0.00028311327,0.00017517821],"domain_scores_gemma":[0.99270177,0.004371863,0.0003247096,0.0012850557,0.0008842741,0.00043238103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035595447,0.0004740208,0.001518354,0.00092638884,0.001333821,0.0023829467,0.002412896,0.0009443919,0.0031172496],"category_scores_gemma":[0.0140625825,0.0004913166,0.00041283868,0.001703663,0.0009487895,0.002210649,0.0012791966,0.0008927249,0.00058642577],"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.0021172483,0.00040714635,0.0066827354,0.00033407303,0.00017698015,0.00043228554,0.0008164809,0.43081862,0.0133511275,0.29498932,0.012095916,0.23777805],"study_design_scores_gemma":[0.00013657703,0.000104522085,0.00046026532,0.000013034702,0.000042755935,0.00010761344,0.00016777328,0.90437716,0.0022753421,0.09014706,0.0021494876,0.000018447168],"about_ca_topic_score_codex":0.0022569322,"about_ca_topic_score_gemma":0.0024474638,"teacher_disagreement_score":0.0035595447,"about_ca_system_score_codex":0.0010866129,"about_ca_system_score_gemma":0.0012987674,"threshold_uncertainty_score":0.018824875},"labels":[],"label_agreement":null},{"id":"W1969255113","doi":"10.1016/j.jpdc.2013.10.002","title":"Research on the conjugate gradient algorithm with a modified incomplete Cholesky preconditioner on GPU","year":2013,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":27,"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":"Arctic Goose Joint Venture","keywords":"Cholesky decomposition; Preconditioner; Computer science; Conjugate gradient method; Incomplete Cholesky factorization; Kernel (algebra); Parallel computing; Algorithm; Multiplication (music); Matrix (chemical analysis); Sparse matrix; Mathematics; Iterative method; Eigenvalues and eigenvectors; Combinatorics","score_opus":0.04024971374101494,"score_gpt":0.28791589224487785,"score_spread":0.2476661785038629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969255113","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.045502856,0.0038846028,0.9298332,0.0014609917,0.00074080244,0.00010800271,0.00011020347,0.0008930446,0.01746634],"genre_scores_gemma":[0.3800877,0.0039763036,0.59523135,0.00043483183,0.0005943013,0.00014869992,0.0003316446,0.00057750446,0.01861765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943703,0.0001597097,0.000023213779,0.00010083674,0.00023155288,0.00004756245],"domain_scores_gemma":[0.9991222,0.000219345,0.00004211026,0.0001390029,0.0004186189,0.000058610352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005801014,0.0005682064,0.000793255,0.00065008254,0.0005291072,0.00090034324,0.00095615274,0.00084784563,0.004040418],"category_scores_gemma":[0.0024726114,0.00037855812,0.0006444471,0.001479449,0.0006550312,0.0017922241,0.0005849434,0.0011866998,0.0008126542],"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.0005964934,0.0003138962,0.0051028985,0.0008569549,0.0003121031,0.00031720795,0.00036201935,0.31074625,0.05578336,0.18269674,0.018888596,0.4240235],"study_design_scores_gemma":[0.00006150844,0.00007955086,0.0007375827,0.000028254852,0.00003297963,0.00007773113,0.000035675268,0.9648211,0.008838184,0.012756509,0.012501254,0.000029622553],"about_ca_topic_score_codex":0.008556231,"about_ca_topic_score_gemma":0.00492163,"teacher_disagreement_score":0.008556231,"about_ca_system_score_codex":0.0004789239,"about_ca_system_score_gemma":0.001669734,"threshold_uncertainty_score":0.017012835},"labels":[],"label_agreement":null},{"id":"W1976080115","doi":"10.1006/jpdc.2000.1707","title":"A Case Study in Real-Time Parallel Computation: Correcting Algorithms","year":2001,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Digital Image Processing Techniques","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; Speedup; Computation; Algorithm; Measure (data warehouse); Analysis of parallel algorithms; Parallel algorithm; Representation (politics); Class (philosophy); Theoretical computer science; Parallel computing; Artificial intelligence; Data mining","score_opus":0.03567379679215091,"score_gpt":0.3173730342745842,"score_spread":0.2816992374824333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976080115","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.5690624,0.0014986568,0.38595006,0.0056810253,0.00037951095,0.00048204075,0.0003202423,0.0024633221,0.03416277],"genre_scores_gemma":[0.8192135,0.00044949702,0.1668403,0.00023517357,0.00010129624,0.00010222613,0.00013310162,0.00037460975,0.012550345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970299,0.0011959891,0.00016288058,0.00032397182,0.001020097,0.0002671724],"domain_scores_gemma":[0.9752422,0.016736193,0.00094490306,0.0033583355,0.0031095787,0.0006088303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027190954,0.0007508165,0.0006292063,0.00093649956,0.0029635502,0.002508862,0.002359544,0.0061311782,0.0043729716],"category_scores_gemma":[0.021761352,0.0003815237,0.0006598661,0.0021510874,0.001842426,0.002165828,0.0010340648,0.001550779,0.0008900736],"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.0024921114,0.0018890653,0.033931393,0.0016855829,0.00022970463,0.0645581,0.0066761086,0.31337908,0.02152327,0.13401553,0.032309003,0.38731107],"study_design_scores_gemma":[0.00057072006,0.0010680961,0.0069940886,0.00020682978,0.00028050758,0.0505698,0.00387708,0.690829,0.09371672,0.05712243,0.09454038,0.00022425523],"about_ca_topic_score_codex":0.00678619,"about_ca_topic_score_gemma":0.007579106,"teacher_disagreement_score":0.00678619,"about_ca_system_score_codex":0.0011188383,"about_ca_system_score_gemma":0.0015433134,"threshold_uncertainty_score":0.014629066},"labels":[],"label_agreement":null},{"id":"W1977083128","doi":"10.1016/j.jpdc.2011.10.013","title":"Microwave tomography for breast cancer detection on Cell broadband engine processors","year":2011,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Microwave Imaging and Scattering Analysis","field":"Engineering","cited_by":23,"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":"University of Manitoba; Georgia Institute of Technology","keywords":"Computer science; Parallel computing; SIMD; Algorithm; Finite-difference time-domain method; Asynchronous communication; Computation; Node (physics); Distributed memory; Shared memory; Telecommunications; Optics","score_opus":0.010763604985945955,"score_gpt":0.20716583280642717,"score_spread":0.19640222782048122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977083128","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.63342744,0.00064635713,0.3548783,0.00047320325,0.000059106027,0.0000600984,0.0001670518,0.00087714806,0.009411269],"genre_scores_gemma":[0.8986798,0.0002595599,0.09599359,0.00009911492,0.000016086888,0.000043849548,0.0001380454,0.000045703157,0.0047242735],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999106,0.000028915476,0.000004343856,0.000011109638,0.000033514818,0.0000115643425],"domain_scores_gemma":[0.9997795,0.00012850968,0.000013768149,0.000022484342,0.000046266174,0.000009392196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001918834,0.00019659966,0.0002023925,0.00018123758,0.0001547737,0.00036080222,0.00032438978,0.00024632795,0.0032356356],"category_scores_gemma":[0.00085375604,0.00013977861,0.00010640949,0.0003120215,0.00011272824,0.00052984623,0.0002773117,0.0002142047,0.000505927],"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.00314965,0.00017226987,0.010186211,0.00022930805,0.0001315456,0.00047494294,0.00026541637,0.075975426,0.63677955,0.01272936,0.004853558,0.2550527],"study_design_scores_gemma":[0.00010160042,0.00041455362,0.0051220153,0.000022030521,0.00010928913,0.0003504143,0.00016101674,0.7632626,0.22220647,0.0027699668,0.005461058,0.000018932038],"about_ca_topic_score_codex":0.0005628553,"about_ca_topic_score_gemma":0.0019953686,"teacher_disagreement_score":0.0032356356,"about_ca_system_score_codex":0.00019300087,"about_ca_system_score_gemma":0.00028966638,"threshold_uncertainty_score":0.010824263},"labels":[],"label_agreement":null},{"id":"W1980911550","doi":"10.1006/jpdc.2001.1809","title":"From Design Patterns to Parallel Architectural Skeletons","year":2002,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","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 Waterloo","funders":"","keywords":"Computer science; Software design pattern; Design pattern; Flexibility (engineering); Architectural pattern; Extensibility; Object-oriented programming; Structural pattern; Context (archaeology); Distributed computing; Set (abstract data type); Programmer; Programming language; Object-oriented design; Parallel programming model; Programming paradigm; Software engineering; Theoretical computer science; Software; Software development; Software design","score_opus":0.03132999815766805,"score_gpt":0.24712708620602022,"score_spread":0.21579708804835218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980911550","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.025227705,0.00075273414,0.9459721,0.0025758324,0.00014229405,0.00012970263,0.00024478306,0.0018484942,0.023106344],"genre_scores_gemma":[0.28146452,0.0016281129,0.69683295,0.00056679803,0.0001070109,0.00032825378,0.00085744157,0.0015315476,0.016683478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983664,0.0005871648,0.00016786846,0.00030665976,0.00045640432,0.00011549816],"domain_scores_gemma":[0.9942484,0.0026287609,0.00042088097,0.0016826651,0.00082753255,0.00019171217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019506782,0.0006836245,0.00045721635,0.0014733977,0.0011562703,0.0036031166,0.0011957455,0.0015001205,0.0072379014],"category_scores_gemma":[0.012491128,0.0013494741,0.0007599497,0.0014919434,0.003452718,0.009368193,0.0021146778,0.0023285754,0.0016869177],"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.000044430068,0.00004865144,0.0014234709,0.00029160816,0.000024428697,0.00029994317,0.001630699,0.011149758,0.0022901369,0.852439,0.006278349,0.12407949],"study_design_scores_gemma":[0.000025542537,0.000037363716,0.00031931966,0.00015720214,0.000038856746,0.00032027272,0.00056050176,0.03508589,0.0021701208,0.9047926,0.05647113,0.000021281936],"about_ca_topic_score_codex":0.0014982875,"about_ca_topic_score_gemma":0.0024629917,"teacher_disagreement_score":0.0072379014,"about_ca_system_score_codex":0.00087695924,"about_ca_system_score_gemma":0.001408527,"threshold_uncertainty_score":0.024213254},"labels":[],"label_agreement":null},{"id":"W1994187164","doi":"10.1016/s0743-7315(02)00035-7","title":"SCO link sharing in Bluetooth voice access networks","year":2003,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Bluetooth and Wireless Communication Technologies","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","funders":"","keywords":"Bluetooth; Computer science; Base station; Computer network; Blocking (statistics); Call blocking; Wireless; Node (physics); Telecommunications; Handover; Engineering","score_opus":0.027496472289956254,"score_gpt":0.2815972869643745,"score_spread":0.25410081467441825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994187164","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.4557237,0.00086819736,0.511526,0.00035620283,0.00015462175,0.0001296245,0.00008527672,0.00062146573,0.030534968],"genre_scores_gemma":[0.9847246,0.00011244018,0.011104769,0.000041926964,0.000040928862,0.00003550316,0.00004070764,0.000032339252,0.0038667684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884987,0.0002623307,0.000048883343,0.00014471907,0.00038762233,0.0003065775],"domain_scores_gemma":[0.99679035,0.0013840144,0.00026136148,0.0006978468,0.00068552076,0.00018088378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010429318,0.00037506458,0.0007247377,0.0010526698,0.002147047,0.0020581745,0.0014607621,0.00069228734,0.003341325],"category_scores_gemma":[0.004020633,0.00044786945,0.00031855152,0.0014087793,0.00095675315,0.002043737,0.0019669526,0.0004866549,0.00061566575],"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.0022794243,0.0007973409,0.007919657,0.00023191607,0.0001331989,0.0010665327,0.0014767945,0.39038724,0.06934163,0.17161183,0.005284125,0.34947035],"study_design_scores_gemma":[0.000063634165,0.00030021538,0.0010830876,0.000022214012,0.000070766044,0.0005998796,0.0005004091,0.93680716,0.016371302,0.040185474,0.0039556595,0.00004016293],"about_ca_topic_score_codex":0.0017452419,"about_ca_topic_score_gemma":0.002685194,"teacher_disagreement_score":0.003341325,"about_ca_system_score_codex":0.00076638185,"about_ca_system_score_gemma":0.000883974,"threshold_uncertainty_score":0.011177838},"labels":[],"label_agreement":null},{"id":"W2000185635","doi":"10.1006/jpdc.2002.1861","title":"Efficient Selection and Sorting Schemes Using Coteries for Processing Large Distributed Files","year":2002,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed systems and fault tolerance","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 Waterloo","funders":"","keywords":"Computer science; Sorting; Node (physics); Quicksort; Sorting algorithm; Key (lock); Selection (genetic algorithm); Ranking (information retrieval); Scheme (mathematics); Theoretical computer science; Binary logarithm; Sorting network; Distributed computing; Computer network; sort; Algorithm; Mathematics; Discrete mathematics; Information retrieval; Operating system; Artificial intelligence","score_opus":0.024613023142266023,"score_gpt":0.26770370086357137,"score_spread":0.24309067772130535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000185635","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.28390867,0.0011065431,0.69384897,0.00059184775,0.0005841061,0.00038059265,0.00046118782,0.0109381,0.00818003],"genre_scores_gemma":[0.44894266,0.00035658493,0.5310459,0.000325191,0.00010718911,0.00021454913,0.00091910764,0.0004264258,0.017662343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993129,0.0001199651,0.000087899854,0.0001351192,0.00021188502,0.00013222413],"domain_scores_gemma":[0.99741167,0.0005963042,0.00018465193,0.00089259446,0.0006955372,0.0002192729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009144407,0.00072361075,0.00094573846,0.001513225,0.0018134734,0.0018561895,0.0020987531,0.00080506847,0.007881727],"category_scores_gemma":[0.002670348,0.00054577994,0.0004512091,0.002668609,0.0006280877,0.0019190749,0.0017167535,0.00069714186,0.0014692436],"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.0049469536,0.00056098384,0.00496538,0.00033942034,0.00012760093,0.00025151277,0.0004898404,0.024987426,0.13491228,0.027943138,0.019462248,0.7810132],"study_design_scores_gemma":[0.0010634131,0.0014644377,0.004717963,0.00008207265,0.00022611335,0.0007336553,0.000532073,0.7287668,0.1894698,0.03541285,0.037342284,0.00018852127],"about_ca_topic_score_codex":0.0048452993,"about_ca_topic_score_gemma":0.012463503,"teacher_disagreement_score":0.007881727,"about_ca_system_score_codex":0.0011864982,"about_ca_system_score_gemma":0.0016941563,"threshold_uncertainty_score":0.026367009},"labels":[],"label_agreement":null},{"id":"W2007719809","doi":"10.1016/j.jpdc.2010.12.009","title":"The impact of mobility on Mobile Ad Hoc Networks through the perspective of complex networks","year":2011,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":40,"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; Mobile ad hoc network; Computer network; Wireless ad hoc network; Vehicular ad hoc network; Mobility model; Network topology; Wireless network; Perspective (graphical); Optimized Link State Routing Protocol; Wireless; Distributed computing; Telecommunications; Network packet","score_opus":0.04403697820227219,"score_gpt":0.29815294663029746,"score_spread":0.25411596842802525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007719809","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.24317536,0.06079837,0.47853583,0.051980965,0.0032150603,0.00008969602,0.0003703405,0.00009642122,0.16173796],"genre_scores_gemma":[0.9642056,0.020664047,0.008298759,0.00041963256,0.0018771059,0.00003294907,0.000027490756,0.000027449521,0.0044468334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994692,0.0002773889,0.000013699746,0.000046730656,0.00013612845,0.000056736288],"domain_scores_gemma":[0.9972887,0.0018481397,0.00026924838,0.00014657094,0.00026042995,0.0001868406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092970236,0.000489518,0.00042249818,0.0007865765,0.0008979103,0.0027995089,0.0007385264,0.0013322459,0.0018919071],"category_scores_gemma":[0.005290937,0.0003198244,0.00031559542,0.0010640012,0.0021318244,0.005671357,0.0011658147,0.0012987357,0.000230889],"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.00004125276,0.000029354223,0.0011651311,0.00013045532,0.000035083223,0.00036975084,0.00042867474,0.10926511,0.0009082282,0.8696592,0.002070402,0.015897375],"study_design_scores_gemma":[0.000020548492,0.000085962194,0.0015679764,0.000100438185,0.000047113546,0.0002897718,0.000615522,0.327007,0.00024943906,0.6469761,0.023003682,0.00003645444],"about_ca_topic_score_codex":0.0024560296,"about_ca_topic_score_gemma":0.001797949,"teacher_disagreement_score":0.0027995089,"about_ca_system_score_codex":0.0011394504,"about_ca_system_score_gemma":0.00047441857,"threshold_uncertainty_score":0.008267283},"labels":[],"label_agreement":null},{"id":"W2017982663","doi":"10.1016/j.jpdc.2010.03.009","title":"Private key agreement and secure communication for heterogeneous sensor networks","year":2010,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":54,"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 Ontario Institute of Technology","funders":"","keywords":"Computer science; Key management; Key (lock); Computer network; Key space; Computer security; Public-key cryptography; Encryption; Protocol (science); Node (physics); Key distribution; Wireless sensor network; Cryptography; Symmetric-key algorithm; Key-agreement protocol; Elliptic curve cryptography","score_opus":0.010956776450406344,"score_gpt":0.24514785311038734,"score_spread":0.23419107665998098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017982663","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.029585423,0.0010767023,0.96325153,0.00137262,0.00018909719,0.000108062006,0.000077638055,0.00015689663,0.004181953],"genre_scores_gemma":[0.8978407,0.0009504992,0.09285804,0.00023920092,0.00028656848,0.00026764232,0.00017869829,0.00007437831,0.0073042978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948709,0.001994685,0.0003592548,0.00063183723,0.0015908446,0.00055244484],"domain_scores_gemma":[0.9917557,0.0045826985,0.0008207719,0.0020279652,0.00062635523,0.00018656415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005408257,0.00060343236,0.0015194821,0.0006784556,0.0015437852,0.0030920177,0.0020615924,0.0017883035,0.0018099732],"category_scores_gemma":[0.01299947,0.00067793234,0.00067338365,0.001399705,0.0037738644,0.007396952,0.0043464927,0.0031878655,0.00044642045],"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.000795859,0.000089413064,0.00046564423,0.0001829317,0.00009925963,0.0004249085,0.0005433473,0.20056286,0.0068700314,0.74056804,0.0034687102,0.045929026],"study_design_scores_gemma":[0.00012290034,0.000065202825,0.00013304572,0.000014055584,0.000035768357,0.00011402664,0.00008961567,0.52735126,0.0026722513,0.46597403,0.0033995935,0.000028099495],"about_ca_topic_score_codex":0.0011208443,"about_ca_topic_score_gemma":0.0010540843,"teacher_disagreement_score":0.005408257,"about_ca_system_score_codex":0.0018224603,"about_ca_system_score_gemma":0.0018931986,"threshold_uncertainty_score":0.028601944},"labels":[],"label_agreement":null},{"id":"W2023756568","doi":"10.1016/j.jpdc.2007.01.009","title":"QoS and data relaying for wireless sensor networks","year":2007,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Network packet; Quality of service; Energy consumption; Base station; Wireless sensor network; Computer network; Efficient energy use; Distributed computing","score_opus":0.02813664022835643,"score_gpt":0.28684932049795236,"score_spread":0.25871268026959593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023756568","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.027844073,0.02214694,0.9243665,0.008910462,0.0023595246,0.0000769753,0.00018605927,0.00036212621,0.013747514],"genre_scores_gemma":[0.85801697,0.01965963,0.09606877,0.0007964278,0.0038198652,0.00014016032,0.00023933449,0.00022465865,0.021034209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893385,0.00032194136,0.000088545195,0.00014015622,0.00040794382,0.000107469205],"domain_scores_gemma":[0.99566627,0.0029378524,0.00028897836,0.0003989969,0.00056437275,0.00014351326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023024927,0.0008654651,0.0010351978,0.0007815128,0.00081474386,0.0023255267,0.0013686552,0.001578262,0.0031304131],"category_scores_gemma":[0.008803421,0.0005403076,0.00037073472,0.001150042,0.0018232532,0.0038580676,0.0011597693,0.0018485828,0.00052381365],"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.0003659099,0.00008820471,0.00069716707,0.00048142363,0.00007127316,0.0003588366,0.0003610965,0.15874377,0.008133373,0.6777625,0.013884675,0.13905184],"study_design_scores_gemma":[0.000033355027,0.000078187855,0.00023568798,0.000045811496,0.00003693361,0.00027556714,0.00009030627,0.50125635,0.0018986663,0.48167923,0.01434044,0.000029448287],"about_ca_topic_score_codex":0.0014691141,"about_ca_topic_score_gemma":0.0015004155,"teacher_disagreement_score":0.0031304131,"about_ca_system_score_codex":0.0013869639,"about_ca_system_score_gemma":0.00070339744,"threshold_uncertainty_score":0.012176931},"labels":[],"label_agreement":null},{"id":"W2023971739","doi":"10.1016/j.jpdc.2003.06.003","title":"A fine-grain load-adaptive algorithm of the 2D discrete wavelet transform for multithreaded architectures","year":2003,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Image and Signal Denoising Methods","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 Manitoba","funders":"","keywords":"Computer science; Multithreading; Computation; Parallel computing; Algorithm; Implementation; Discrete wavelet transform; Multiprocessing; Overhead (engineering); Thread (computing); Wavelet; Wavelet transform","score_opus":0.02036601986041314,"score_gpt":0.27516533822574246,"score_spread":0.2547993183653293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023971739","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.016914243,0.0001386704,0.9803233,0.00013113582,0.000103782884,0.000035504174,0.00002628523,0.0012090128,0.0011180101],"genre_scores_gemma":[0.19894005,0.000111548004,0.796643,0.00009853028,0.000060624236,0.00012843922,0.00012686153,0.00032658942,0.0035642448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976367,0.0000421303,0.000015927577,0.00003893712,0.000107863976,0.000031446056],"domain_scores_gemma":[0.9995369,0.00012889318,0.000023818455,0.00011968593,0.0001503615,0.000040341667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046404247,0.00045591028,0.0006003847,0.00044589886,0.0005267685,0.0007483927,0.001243237,0.0005864746,0.0038526852],"category_scores_gemma":[0.0016937,0.00039731155,0.00032669885,0.0005670668,0.00035656916,0.00097528816,0.0009291198,0.00096080813,0.0007413667],"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.0007638865,0.00019482477,0.001578898,0.00013106762,0.00009927102,0.00013607214,0.00024896566,0.22802344,0.08432396,0.026075315,0.010264058,0.6481603],"study_design_scores_gemma":[0.000030750063,0.000030766347,0.0001566136,0.0000029041237,0.000007582621,0.00001779998,0.000008661691,0.9902908,0.00457244,0.0031922904,0.0016803077,0.000009053971],"about_ca_topic_score_codex":0.0038192223,"about_ca_topic_score_gemma":0.007554173,"teacher_disagreement_score":0.0038526852,"about_ca_system_score_codex":0.00052345503,"about_ca_system_score_gemma":0.0008584633,"threshold_uncertainty_score":0.012888551},"labels":[],"label_agreement":null},{"id":"W2029876542","doi":"10.1016/j.jpdc.2005.07.002","title":"Computing nearest neighbors in real time","year":2005,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; k-nearest neighbors algorithm; Computer graphics (images); Artificial intelligence","score_opus":0.0071435757756449815,"score_gpt":0.22395687474992323,"score_spread":0.21681329897427826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029876542","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.11069425,0.0015497383,0.8791245,0.0005484727,0.0006446355,0.0000998943,0.00031541495,0.0024879132,0.0045350613],"genre_scores_gemma":[0.66228896,0.00040438582,0.33026767,0.00013998542,0.00017617701,0.00007294681,0.00067688694,0.00022454419,0.0057485146],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99809235,0.0003840661,0.00017559697,0.00045614722,0.0007213207,0.00017053123],"domain_scores_gemma":[0.99506736,0.0024748319,0.00035956688,0.000996744,0.0008600218,0.0002415645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017449005,0.00062666886,0.0015172397,0.0013864647,0.0015061192,0.0019303316,0.0020041438,0.0010963723,0.0041546277],"category_scores_gemma":[0.010357922,0.0007729421,0.00046574505,0.0017104237,0.00091903424,0.0043418254,0.0012262084,0.00086904736,0.0013586754],"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.0020526238,0.00045934998,0.0074544474,0.00020813668,0.00020692624,0.00032359062,0.0003007909,0.4352207,0.009360278,0.026100801,0.011937309,0.5063751],"study_design_scores_gemma":[0.000038210896,0.000069537025,0.0004045875,0.000007194069,0.000022828368,0.000098200406,0.00007525144,0.9819452,0.002358478,0.013191972,0.0017764253,0.000012084934],"about_ca_topic_score_codex":0.0059163617,"about_ca_topic_score_gemma":0.010048749,"teacher_disagreement_score":0.0059163617,"about_ca_system_score_codex":0.0006610511,"about_ca_system_score_gemma":0.001033811,"threshold_uncertainty_score":0.013898611},"labels":[],"label_agreement":null},{"id":"W2035930584","doi":"10.1016/j.jpdc.2007.06.006","title":"Strategies to create platforms for differentiated services from dedicated and opportunistic resources","year":2007,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed and Parallel Computing Systems","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; Goodput; Preemption; Scheduling (production processes); Distributed computing; Heuristic; Quality of service; Premise; Limited resources; Computer network; Operating system; Risk analysis (engineering); Wireless; Artificial intelligence","score_opus":0.01546604077717492,"score_gpt":0.26333236093784174,"score_spread":0.24786632016066681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035930584","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.1329507,0.00069055037,0.69452745,0.009308412,0.0006898677,0.00082480937,0.0001355039,0.0017778872,0.15909478],"genre_scores_gemma":[0.74861056,0.00034147897,0.21331294,0.000788067,0.00016561354,0.00047543683,0.0001378967,0.00025156903,0.035916403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983334,0.00042761894,0.00006361989,0.00021994657,0.0006228783,0.0003325382],"domain_scores_gemma":[0.9949405,0.0009418949,0.00040154817,0.0015560011,0.00094365806,0.0012163972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034050175,0.00052209245,0.00030083797,0.0009319849,0.0016636328,0.0061007044,0.0023029044,0.0018082123,0.007019941],"category_scores_gemma":[0.007819654,0.000477536,0.00047374482,0.00068972557,0.0014394938,0.0070587434,0.0056574536,0.0021293093,0.002246389],"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.00022775444,0.00029392712,0.002351118,0.00012814118,0.00004745911,0.00049335713,0.0015556607,0.008900732,0.016095228,0.82294697,0.012272921,0.13468672],"study_design_scores_gemma":[0.00026405248,0.0004618501,0.002110045,0.00018435417,0.00012400773,0.0011125806,0.0037820328,0.12037171,0.024291739,0.57903945,0.26808307,0.00017506747],"about_ca_topic_score_codex":0.0009196133,"about_ca_topic_score_gemma":0.0018840114,"teacher_disagreement_score":0.007019941,"about_ca_system_score_codex":0.0013844373,"about_ca_system_score_gemma":0.002666025,"threshold_uncertainty_score":0.023484051},"labels":[],"label_agreement":null},{"id":"W2035937973","doi":"10.1016/j.jpdc.2011.04.003","title":"HD Tree: A novel data structure to support multi-dimensional range query for P2P networks","year":2011,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Peer-to-Peer Network Technologies","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 Ottawa","funders":"","keywords":"Computer science; Distributed computing; Static routing; Range query (database); Routing (electronic design automation); Dynamic Source Routing; Multipath routing; Tree (set theory); Destination-Sequenced Distance Vector routing; Computer network; Routing protocol; Web search query; Mathematics; Sargable; Information retrieval","score_opus":0.09141247208430599,"score_gpt":0.29746708846716274,"score_spread":0.20605461638285677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035937973","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.022488914,0.0024209765,0.93351567,0.0009145701,0.0006595243,0.00037573383,0.0057815565,0.027461283,0.006381867],"genre_scores_gemma":[0.29487285,0.0022523715,0.6670195,0.0009901007,0.00066771975,0.00066300074,0.018993879,0.0023901637,0.012150408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988978,0.00013709832,0.00013651045,0.00014213617,0.00057864573,0.000107856096],"domain_scores_gemma":[0.99734277,0.00063976855,0.00018048883,0.0010049698,0.0005764067,0.00025566542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001112637,0.0006081513,0.0013834639,0.0019675153,0.0012323733,0.0021592467,0.003029505,0.0010460254,0.004611629],"category_scores_gemma":[0.0044468297,0.0005575056,0.00056610355,0.003479039,0.0007108357,0.004692959,0.0036170857,0.0012471563,0.0018806752],"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.001799436,0.0004451182,0.004716108,0.0013647663,0.00030087688,0.0005652967,0.0009026251,0.037592176,0.047169056,0.071375184,0.19367352,0.6400959],"study_design_scores_gemma":[0.00058606104,0.0006575777,0.0027344592,0.00016623361,0.00029167955,0.0012246661,0.0005462546,0.6017909,0.048750855,0.08645501,0.25646105,0.00033526262],"about_ca_topic_score_codex":0.0041190814,"about_ca_topic_score_gemma":0.0049949586,"teacher_disagreement_score":0.004611629,"about_ca_system_score_codex":0.00079842896,"about_ca_system_score_gemma":0.0014438336,"threshold_uncertainty_score":0.01542747},"labels":[],"label_agreement":null},{"id":"W2039340660","doi":"10.1016/j.jpdc.2015.04.003","title":"An energy-efficient and sink-location privacy enhanced scheme for WSNs through ring based routing","year":2015,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Sink (geography); Computer science; Computer network; Multipath routing; Geographic routing; Network packet; Static routing; Wireless sensor network; Equal-cost multi-path routing; Routing protocol; Anonymity; Dynamic Source Routing; Routing (electronic design automation); Policy-based routing; Topology (electrical circuits); Distributed computing; Computer security; Engineering; Geography","score_opus":0.031372219195388504,"score_gpt":0.28521945076363614,"score_spread":0.2538472315682476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039340660","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.08221938,0.0007974943,0.9119897,0.00048186214,0.00019898682,0.00016705615,0.00022666827,0.00087556546,0.0030432588],"genre_scores_gemma":[0.8611839,0.00033975282,0.13296215,0.0001489007,0.00005651304,0.0000836851,0.00020549628,0.000044528104,0.00497505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876523,0.0003488244,0.000090212314,0.00026168456,0.0003411627,0.0001929795],"domain_scores_gemma":[0.9986204,0.00032074002,0.00017368955,0.00056423416,0.00025071212,0.000070266935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010949048,0.0004204954,0.0011202898,0.00045307985,0.0008629153,0.0008903968,0.002097121,0.0007731683,0.0013600211],"category_scores_gemma":[0.0019884137,0.00024615045,0.00057835464,0.0008059907,0.0005538495,0.0021616523,0.0026274521,0.0008377889,0.00042697074],"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.0028311526,0.0005502653,0.0023086183,0.00051744044,0.00034194652,0.00067542196,0.00077693077,0.3470221,0.24950169,0.110085286,0.011205375,0.27418375],"study_design_scores_gemma":[0.00008465092,0.00045772048,0.0005203942,0.000014419073,0.00010032797,0.0005945103,0.000102240054,0.940614,0.035546847,0.015191064,0.006697988,0.00007595024],"about_ca_topic_score_codex":0.0005432871,"about_ca_topic_score_gemma":0.0008096861,"teacher_disagreement_score":0.002097121,"about_ca_system_score_codex":0.00075104437,"about_ca_system_score_gemma":0.0010398296,"threshold_uncertainty_score":0.005790472},"labels":[],"label_agreement":null},{"id":"W2047772825","doi":"10.1006/jpdc.2001.1812","title":"A Parallel Algorithm for Lagrange Interpolation on the Star Graph","year":2002,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Interconnection Networks and Systems","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":"Queen's University","funders":"","keywords":"Computer science; Initialization; Algorithm; Computation; Star (game theory); Lagrange polynomial; Interpolation (computer graphics); Multiplication (music); Graph; Parallel computing; Theoretical computer science; Mathematics; Class (philosophy)","score_opus":0.031095339842299796,"score_gpt":0.24343438412987287,"score_spread":0.21233904428757308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047772825","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.004360712,0.000060715087,0.9933123,0.00008967744,0.000067303605,0.000043409906,0.000051869007,0.00046284893,0.0015511455],"genre_scores_gemma":[0.058511112,0.00010279248,0.9369697,0.000056978985,0.000059734877,0.00013569927,0.00020828673,0.00024315983,0.003712597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954236,0.00012405112,0.000023390616,0.00009012869,0.0001596991,0.000060501057],"domain_scores_gemma":[0.99918073,0.00036317535,0.000035885972,0.00016794755,0.00019288145,0.000059482903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009507001,0.00078843004,0.0013587355,0.0011102706,0.000938107,0.00080391,0.0018099119,0.00093248975,0.0092824465],"category_scores_gemma":[0.0026099514,0.0006128314,0.0009375017,0.0018448286,0.0007544664,0.0015005578,0.00242259,0.0018450632,0.0022054361],"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.00057205063,0.0002116853,0.0006848118,0.00019599257,0.00010489367,0.00015674457,0.0001922033,0.32701918,0.008551396,0.113151014,0.011744279,0.5374158],"study_design_scores_gemma":[0.00009567458,0.000059074122,0.00008411305,0.0000097546745,0.000013341237,0.00004086937,0.000024529305,0.9540817,0.0020761564,0.039645895,0.0038532978,0.00001555441],"about_ca_topic_score_codex":0.006565074,"about_ca_topic_score_gemma":0.009356464,"teacher_disagreement_score":0.0092824465,"about_ca_system_score_codex":0.00081107643,"about_ca_system_score_gemma":0.0018609928,"threshold_uncertainty_score":0.031052828},"labels":[],"label_agreement":null},{"id":"W2052326735","doi":"10.1006/jpdc.2000.1625","title":"Optimal Broadcasting in Faulty Trees","year":2000,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","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":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Computer science; Fault tolerance; Vulnerability (computing); Tree (set theory); Distributed computing; Algorithm; Upper and lower bounds; Computer network; Computer security; Mathematics; Combinatorics","score_opus":0.014055091223624768,"score_gpt":0.2458713300918413,"score_spread":0.23181623886821653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052326735","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.5878224,0.0031930218,0.36879936,0.0051147556,0.00042982254,0.00015241002,0.000610689,0.0011412312,0.032736246],"genre_scores_gemma":[0.943496,0.0011662563,0.046181235,0.00027518228,0.00021265047,0.00007622045,0.00033118445,0.00025498838,0.008006215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990073,0.0003336467,0.000047263617,0.00012898556,0.0002280952,0.00025483014],"domain_scores_gemma":[0.9859044,0.010653759,0.0008117398,0.0011164116,0.0008975108,0.0006160814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017665094,0.00055076304,0.0020235607,0.0013432301,0.0021071476,0.0021826178,0.0017977426,0.0016371094,0.0042607],"category_scores_gemma":[0.016765049,0.0009776801,0.000499366,0.002169279,0.002271036,0.0030435885,0.001992374,0.0015736348,0.0003996773],"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.002044567,0.00020037331,0.002363189,0.00048531865,0.00009640044,0.00029382214,0.00067135954,0.5376086,0.009206243,0.3673132,0.01772631,0.061990697],"study_design_scores_gemma":[0.00019654396,0.00007239536,0.0004309041,0.000034328335,0.000052258325,0.000090757196,0.00016405522,0.6247976,0.0018910033,0.37060097,0.0016515368,0.00001769559],"about_ca_topic_score_codex":0.005091954,"about_ca_topic_score_gemma":0.007448672,"teacher_disagreement_score":0.005091954,"about_ca_system_score_codex":0.003100892,"about_ca_system_score_gemma":0.0020442323,"threshold_uncertainty_score":0.022498608},"labels":[],"label_agreement":null},{"id":"W2052478271","doi":"10.1016/j.jpdc.2010.05.007","title":"Distributed hierarchical search for balanced energy consumption routing spanning trees in wireless sensor networks","year":2010,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Energy Efficient Wireless Sensor Networks","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":"St. Francis Xavier University; Acadia University","funders":"","keywords":"Computer science; Spanning tree; Wireless sensor network; Minimum spanning tree; Routing (electronic design automation); Kruskal's algorithm; Energy consumption; Heuristic; Distributed minimum spanning tree; Cluster analysis; Tree (set theory); Hierarchical routing; Distributed computing; Connected dominating set; Degree (music); Routing protocol; Static routing; Algorithm; Computer network; Mathematics","score_opus":0.015416781139306376,"score_gpt":0.2589145652732349,"score_spread":0.24349778413392853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052478271","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.11723515,0.0007291477,0.8780531,0.00046094804,0.00006933092,0.00011891686,0.00015128916,0.0004615179,0.0027205392],"genre_scores_gemma":[0.8043845,0.00021670401,0.19258487,0.00010206884,0.000043445496,0.00017258771,0.00027078934,0.00007359242,0.0021513132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942917,0.00018080413,0.000036757538,0.00010389959,0.00016812378,0.00008117617],"domain_scores_gemma":[0.99883074,0.0006987413,0.00009816641,0.00012363729,0.0001841031,0.0000647131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001190559,0.00046496702,0.0011730872,0.00086031924,0.0007584644,0.00077282795,0.0013312731,0.0008500796,0.0016540705],"category_scores_gemma":[0.004631613,0.0004797667,0.0003633283,0.0012670108,0.0005115321,0.0014578397,0.0012961987,0.0005012134,0.00022858426],"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.0004356517,0.0001261447,0.0009557954,0.00012235405,0.000058437712,0.00005890374,0.00016419173,0.8903367,0.0056896443,0.015873456,0.002443308,0.083735354],"study_design_scores_gemma":[0.00003063026,0.00003495038,0.00009376874,0.0000030199628,0.000007495238,0.000010807037,0.000018148054,0.9943135,0.00043716398,0.0048814025,0.00016644612,0.0000028459974],"about_ca_topic_score_codex":0.0029433053,"about_ca_topic_score_gemma":0.0048926966,"teacher_disagreement_score":0.0029433053,"about_ca_system_score_codex":0.0008992476,"about_ca_system_score_gemma":0.0012149521,"threshold_uncertainty_score":0.006524503},"labels":[],"label_agreement":null},{"id":"W2058714038","doi":"10.1016/j.jpdc.2009.11.005","title":"Employing transport layer multi-railing in cluster networks","year":2009,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Network Traffic and Congestion Control","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 British Columbia","funders":"Ohio State University; Cisco Systems","keywords":"Computer science; Cluster (spacecraft); Layer (electronics); Computer network; Nanotechnology; Materials science","score_opus":0.017034058662209698,"score_gpt":0.25480977510717967,"score_spread":0.23777571644496998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058714038","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.3925874,0.0005347556,0.5938693,0.0005100761,0.00020185515,0.00011798915,0.00009434937,0.004170096,0.007914217],"genre_scores_gemma":[0.95707333,0.00008018418,0.04103855,0.00003308146,0.000016460986,0.000022335355,0.000043434196,0.000060558286,0.0016320789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995022,0.00017593255,0.000030249443,0.000079816695,0.000068190995,0.00014366211],"domain_scores_gemma":[0.9987031,0.00030765677,0.00008945846,0.0004672756,0.0003155383,0.00011708178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013232266,0.00037407348,0.0007543902,0.00066895125,0.0015355224,0.0013619246,0.0016343256,0.00055599987,0.0030763203],"category_scores_gemma":[0.002464935,0.0003862661,0.00043276884,0.00089609664,0.0006417221,0.0016277907,0.0015437779,0.0005928922,0.0004860457],"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.0015015999,0.00029283075,0.0054859812,0.0001941778,0.00013914966,0.00025969718,0.00041538491,0.7215666,0.060579702,0.03985445,0.0040482236,0.16566223],"study_design_scores_gemma":[0.000018013343,0.00013257384,0.00035325403,0.000007885103,0.000032205862,0.000029647195,0.00007502726,0.983328,0.009438323,0.0048989006,0.0016666675,0.000019401097],"about_ca_topic_score_codex":0.00823738,"about_ca_topic_score_gemma":0.010033529,"teacher_disagreement_score":0.00823738,"about_ca_system_score_codex":0.0014650598,"about_ca_system_score_gemma":0.0010480408,"threshold_uncertainty_score":0.01637888},"labels":[],"label_agreement":null},{"id":"W2064330718","doi":"10.1016/j.jpdc.2014.10.002","title":"Robust network supercomputing with unreliable workers","year":2014,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed systems and fault tolerance","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 Northern British Columbia; University of British Columbia","funders":"National Science Foundation","keywords":"Correctness; Computer science; Computation; A priori and a posteriori; Process (computing); Supercomputer; Task (project management); Master/slave; Master equation; Distributed computing; Theoretical computer science; Algorithm; Parallel computing; Programming language","score_opus":0.013396595270680893,"score_gpt":0.20833888110127916,"score_spread":0.19494228583059825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064330718","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.3380562,0.0011336692,0.63683516,0.0017440397,0.00057967985,0.00012233513,0.00021234677,0.0018925451,0.01942405],"genre_scores_gemma":[0.96810216,0.00012812614,0.02814073,0.000059932572,0.00012732476,0.000046172765,0.000060582617,0.00011447853,0.0032205842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988186,0.00035065637,0.00005659876,0.00015595023,0.00043869787,0.0001795887],"domain_scores_gemma":[0.99577373,0.0014264993,0.00044307215,0.0014365658,0.00065709394,0.00026304583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016145787,0.0004708857,0.0011117915,0.00067272043,0.0012758395,0.0016043541,0.0018163248,0.0008627241,0.0022197277],"category_scores_gemma":[0.00905357,0.0004566314,0.00032457197,0.0009558266,0.001700291,0.0015449278,0.0020889153,0.0009593684,0.0005286051],"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.0014965925,0.0001331566,0.0024362553,0.000109235276,0.00009653658,0.00024595804,0.00016231768,0.8847924,0.009380553,0.046623897,0.0050651236,0.04945795],"study_design_scores_gemma":[0.000044212116,0.000059676877,0.00037765395,0.000004825419,0.00001652212,0.000025697544,0.00003231809,0.9757592,0.0022463368,0.020613393,0.00080864335,0.00001162514],"about_ca_topic_score_codex":0.003291135,"about_ca_topic_score_gemma":0.0027983831,"teacher_disagreement_score":0.003291135,"about_ca_system_score_codex":0.0009927554,"about_ca_system_score_gemma":0.0012205428,"threshold_uncertainty_score":0.008538842},"labels":[],"label_agreement":null},{"id":"W2066429853","doi":"10.1016/j.jpdc.2005.10.011","title":"Optimal decision strategies in Byzantine environments","year":2005,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed systems and fault tolerance","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":"Université du Québec en Outaouais","funders":"","keywords":"Correctness; Computer science; Probability distribution; Expected value; Set (abstract data type); Optimal decision; Markov decision process; Mathematical optimization; Value (mathematics); Decision rule; Decision problem; Construct (python library); Theoretical computer science; Mathematics; Algorithm; Decision tree; Artificial intelligence; Markov process; Machine learning; Statistics","score_opus":0.00963331687269626,"score_gpt":0.2521058600829257,"score_spread":0.24247254321022943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066429853","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.28124726,0.0007472561,0.6855276,0.0019301352,0.00008945484,0.00018900026,0.00021704643,0.00044146256,0.029610828],"genre_scores_gemma":[0.8977226,0.00044901794,0.091799475,0.00013015167,0.000044058575,0.0001155818,0.000101765836,0.00010247317,0.00953474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841225,0.0009388695,0.000054135486,0.0001602552,0.00014350435,0.00029094057],"domain_scores_gemma":[0.99544746,0.0035650546,0.00027814286,0.0002039263,0.00024703925,0.00025838462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002065875,0.00079886086,0.0013374316,0.00070191856,0.0010172388,0.0030182048,0.0013062777,0.0016196179,0.004327666],"category_scores_gemma":[0.009311468,0.0005201859,0.00033165372,0.00083355076,0.001371861,0.0037454257,0.0018799457,0.0015022533,0.00055383233],"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.0009841766,0.00012478213,0.00060166157,0.0001945321,0.00005593603,0.00018865094,0.0005578812,0.43674278,0.0019238578,0.50611657,0.003752708,0.048756395],"study_design_scores_gemma":[0.000113606045,0.000102226484,0.00012343834,0.000017310098,0.000018322798,0.000040731236,0.00014108923,0.6458379,0.00094908563,0.35036692,0.0022724776,0.00001692082],"about_ca_topic_score_codex":0.0017117081,"about_ca_topic_score_gemma":0.0020531174,"teacher_disagreement_score":0.004327666,"about_ca_system_score_codex":0.0010992347,"about_ca_system_score_gemma":0.0011059142,"threshold_uncertainty_score":0.014477432},"labels":[],"label_agreement":null},{"id":"W2066431556","doi":"10.1016/j.jpdc.2003.11.007","title":"Sorting and election in anonymous asynchronous rings","year":2003,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":43,"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; University of Ottawa","funders":"","keywords":"Multiset; Combinatorics; Sorting; Upper and lower bounds; Ring (chemistry); Asynchronous communication; Prime (order theory); Leader election; Characterization (materials science); Computer science; Discrete mathematics; Mathematics; Theoretical computer science; Algorithm; Computer network; Physics; Chemistry","score_opus":0.008125596502436955,"score_gpt":0.2324580116784604,"score_spread":0.22433241517602343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066431556","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.42343935,0.00066661125,0.54386616,0.0026552898,0.00052409514,0.0001899362,0.00024506776,0.0008523885,0.027561102],"genre_scores_gemma":[0.93175006,0.00030547,0.047857173,0.00017025783,0.00019216683,0.000082238555,0.00012184059,0.00008176652,0.01943906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976452,0.0008933562,0.00020490933,0.00029946724,0.00048389466,0.00047311594],"domain_scores_gemma":[0.9881881,0.0069368817,0.001212657,0.0016685041,0.0011736661,0.000820292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004003241,0.0003032942,0.0010914864,0.0014896656,0.0034176898,0.004293283,0.0015033573,0.0014514073,0.004511754],"category_scores_gemma":[0.017227473,0.00047783926,0.0006709507,0.0022981393,0.00287945,0.006017957,0.0022062778,0.0014643952,0.0005879477],"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.0005091217,0.000077612356,0.00092025194,0.00005122301,0.00001440005,0.000099834695,0.0004124535,0.024748579,0.0012951378,0.95228887,0.001815609,0.017766805],"study_design_scores_gemma":[0.0001028004,0.00006350363,0.00022675555,0.000011298553,0.000028835058,0.00008783522,0.00017473983,0.122782625,0.0017058109,0.870849,0.0039402163,0.00002655217],"about_ca_topic_score_codex":0.0015558026,"about_ca_topic_score_gemma":0.002018934,"teacher_disagreement_score":0.004511754,"about_ca_system_score_codex":0.0013742514,"about_ca_system_score_gemma":0.0021354954,"threshold_uncertainty_score":0.021171391},"labels":[],"label_agreement":null},{"id":"W2067366494","doi":"10.1016/j.jpdc.2008.01.001","title":"On the complexity and algorithm of grooming regular traffic in WDM optical networks","year":2008,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Advanced Optical Network Technologies","field":"Engineering","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Traffic grooming; Synchronous optical networking; Computer science; Wavelength-division multiplexing; Multiplexing; Multiplexer; Upper and lower bounds; Algorithm; Channel (broadcasting); Computer network; Time complexity; Wavelength; Mathematics; Telecommunications","score_opus":0.02036499625000479,"score_gpt":0.21897816752008364,"score_spread":0.19861317127007885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067366494","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.21379384,0.0011664125,0.7689468,0.0022279928,0.000249637,0.0002452196,0.00036090554,0.0007878866,0.012221218],"genre_scores_gemma":[0.7107812,0.0009928193,0.2795841,0.0004844079,0.00037669553,0.00030497907,0.0006231745,0.00032517652,0.006527385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763393,0.0008341327,0.00011399116,0.00028399157,0.0008053841,0.00032859447],"domain_scores_gemma":[0.97053605,0.02508941,0.0010934367,0.0014264967,0.0013028284,0.0005517381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032154159,0.0010949444,0.0015387419,0.0012602973,0.0012947731,0.003835953,0.0026362138,0.0020331987,0.0038881202],"category_scores_gemma":[0.024641074,0.0009291273,0.0008989495,0.0018678514,0.002382849,0.0059542092,0.0026507126,0.0031804922,0.00047547888],"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.001201583,0.0003415125,0.0037378797,0.0002815155,0.00009135597,0.00014350397,0.00044697965,0.763905,0.0059752823,0.12873991,0.006942669,0.08819285],"study_design_scores_gemma":[0.00004520533,0.000036510588,0.00025233664,0.000009745312,0.000013168579,0.000026467475,0.00003594897,0.9426787,0.00046858445,0.056123205,0.0002978318,0.000012324141],"about_ca_topic_score_codex":0.0060909623,"about_ca_topic_score_gemma":0.006904489,"teacher_disagreement_score":0.0060909623,"about_ca_system_score_codex":0.003152227,"about_ca_system_score_gemma":0.0033270451,"threshold_uncertainty_score":0.022871077},"labels":[],"label_agreement":null},{"id":"W2069254940","doi":"10.1016/j.jpdc.2013.08.009","title":"Searching for a black hole in interconnected networks using mobile agents and tokens","year":2013,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Mobile Agent-Based Network Management","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":"Carleton University; Ontario Tech University","funders":"","keywords":"Asynchronous communication; Security token; Computer science; Network topology; FIFO (computing and electronics); Hypercube; Focus (optics); Mathematical proof; Torus; Whiteboard; Computer network; Distributed computing; Topology (electrical circuits); Theoretical computer science; Mathematics; Combinatorics; Parallel computing; Telecommunications","score_opus":0.023289915080597173,"score_gpt":0.2744323974459021,"score_spread":0.2511424823653049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069254940","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.36008278,0.00051788014,0.6315929,0.0012180983,0.00015339021,0.00013323152,0.00004584238,0.00043045817,0.0058254045],"genre_scores_gemma":[0.8905071,0.00021830254,0.10566789,0.00012238692,0.000030850148,0.00008143774,0.00003226913,0.00005906854,0.0032806692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990274,0.00041092865,0.0000474434,0.00018277451,0.00016258209,0.0001689595],"domain_scores_gemma":[0.9919275,0.005804123,0.0007714157,0.0005926877,0.00039464067,0.0005096573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002511184,0.0005425109,0.0015253404,0.0012278494,0.0023247213,0.0025951762,0.0017924614,0.0027090039,0.0025558467],"category_scores_gemma":[0.014186082,0.0009700218,0.0009237733,0.00087817374,0.003416925,0.0069748377,0.004417206,0.0013851236,0.00030525113],"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.0017406569,0.00022682882,0.0059297103,0.00030014807,0.000259355,0.0011940666,0.001345087,0.5427866,0.0092624165,0.3892917,0.0023801692,0.045283295],"study_design_scores_gemma":[0.00010791019,0.00013548117,0.00019766987,0.00003005195,0.000052336956,0.00012603136,0.00029343535,0.85462976,0.0023828316,0.14078856,0.0012320958,0.000023849096],"about_ca_topic_score_codex":0.0013347288,"about_ca_topic_score_gemma":0.0012596935,"teacher_disagreement_score":0.0027090039,"about_ca_system_score_codex":0.00080888596,"about_ca_system_score_gemma":0.0010527435,"threshold_uncertainty_score":0.0132805705},"labels":[],"label_agreement":null},{"id":"W2078536718","doi":"10.1016/j.jpdc.2014.09.014","title":"Hybrid parallel task placement in irregular applications","year":2014,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures","keywords":"Locality; Computer science; Speedup; Scheduling (production processes); Asynchronous communication; Parallel computing; Load balancing (electrical power); Distributed computing; Computer network","score_opus":0.009939898745951825,"score_gpt":0.2466919551668542,"score_spread":0.23675205642090236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078536718","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.31415543,0.0006908729,0.6737799,0.0002567258,0.000271421,0.000089581205,0.00010012326,0.0012973419,0.009358522],"genre_scores_gemma":[0.89087945,0.00013691116,0.105140336,0.00005860498,0.000053106603,0.000058011214,0.00009446604,0.00014602668,0.0034331458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978024,0.00006302239,0.000013929802,0.000032675136,0.00006244934,0.000047714784],"domain_scores_gemma":[0.99945885,0.00020309698,0.000048143294,0.00011802214,0.000108258486,0.000063578795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003991855,0.000334907,0.0004505842,0.00039544905,0.0005662366,0.00065992144,0.0009414972,0.00040599526,0.002625872],"category_scores_gemma":[0.0010927229,0.00028885392,0.00025050205,0.000667063,0.00034766318,0.00045438303,0.0008312743,0.0003914978,0.00041452175],"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.0011313906,0.00023547506,0.0022850565,0.00020106838,0.000059182756,0.00030780994,0.0001412001,0.8203153,0.031845763,0.012410913,0.0035161404,0.12755065],"study_design_scores_gemma":[0.000032562748,0.00011747653,0.0003553072,0.0000043996993,0.000010552217,0.000053339863,0.000038714534,0.98871034,0.0042900285,0.005215284,0.0011659289,0.0000060846564],"about_ca_topic_score_codex":0.00096833205,"about_ca_topic_score_gemma":0.0020835635,"teacher_disagreement_score":0.002625872,"about_ca_system_score_codex":0.00030805424,"about_ca_system_score_gemma":0.0004679153,"threshold_uncertainty_score":0.008784473},"labels":[],"label_agreement":null},{"id":"W2083028490","doi":"10.1016/j.jpdc.2012.02.019","title":"Parallel differential evolution with self-adapting control parameters and generalized opposition-based learning for solving high-dimensional optimization problems","year":2012,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Differential evolution; Speedup; Benchmark (surveying); Computational complexity theory; Graphics; Parallel computing; Optimization problem; Execution time; Mathematical optimization; Algorithm; Mathematics; Computer graphics (images)","score_opus":0.014252950860160355,"score_gpt":0.2382615037605564,"score_spread":0.22400855290039606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083028490","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.05160889,0.0005259758,0.9414863,0.00020779678,0.00013621655,0.0000793643,0.000015906453,0.0002064264,0.0057331235],"genre_scores_gemma":[0.75224274,0.00028701473,0.2440888,0.00012626535,0.000059103015,0.000248066,0.000044186014,0.00007055204,0.0028331378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964404,0.00013692482,0.000020726015,0.0000374771,0.00013142501,0.000029404475],"domain_scores_gemma":[0.99926573,0.00043734667,0.00006981775,0.000053116462,0.00014665366,0.000027350306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00141381,0.0005892972,0.001018337,0.00057138427,0.0004232609,0.0006317403,0.0011506288,0.0009492646,0.0009941903],"category_scores_gemma":[0.0026119195,0.00041501183,0.00061021914,0.0007809838,0.0007925735,0.00070860534,0.0009840046,0.0010246793,0.00015400436],"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.000056898894,0.0000661184,0.00023048316,0.000049353966,0.000040635117,0.00003351229,0.000037481692,0.95568216,0.0014795936,0.0055763717,0.0002902811,0.03645718],"study_design_scores_gemma":[0.000008658118,0.00001568028,0.000027289912,0.0000015881362,0.0000030101455,0.000005199056,0.0000017449619,0.9988275,0.00016247702,0.0008388064,0.0001062718,0.0000017675071],"about_ca_topic_score_codex":0.0025749137,"about_ca_topic_score_gemma":0.0025903091,"teacher_disagreement_score":0.0025749137,"about_ca_system_score_codex":0.0005382113,"about_ca_system_score_gemma":0.0006028435,"threshold_uncertainty_score":0.007477045},"labels":[],"label_agreement":null},{"id":"W2086669962","doi":"10.1016/j.jpdc.2007.07.002","title":"Implementing sequentially consistent programs on processor consistent platforms","year":2007,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; American University of Sharjah","keywords":"Computer science; Sequential consistency; Compiler; Consistency (knowledge bases); Consistency model; Scalability; Programming language; Semantics (computer science); Memory model; Set (abstract data type); Transformation (genetics); Program transformation; Strong consistency; Implementation; Shared memory; Parallel computing; Operating system; Artificial intelligence","score_opus":0.023508172232703742,"score_gpt":0.275532434328486,"score_spread":0.25202426209578227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086669962","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.15645893,0.00011100489,0.833021,0.0002912549,0.00012470088,0.00017760386,0.00005607131,0.0061516226,0.0036078144],"genre_scores_gemma":[0.5152224,0.000114080096,0.4791298,0.00015423397,0.000053914355,0.00027159203,0.00019267549,0.0009339961,0.003927402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99600816,0.0013284439,0.0003346165,0.00037265747,0.0013786914,0.00057745154],"domain_scores_gemma":[0.9889214,0.0043706694,0.00067343673,0.004233353,0.0014768654,0.00032430922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045979056,0.0009283336,0.0011470984,0.0005912148,0.0012484994,0.0022917117,0.0031166035,0.0015638086,0.0034744875],"category_scores_gemma":[0.014209314,0.0013457431,0.00083729136,0.0011351559,0.0020549595,0.0036282819,0.00391556,0.0024606462,0.0006478559],"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.0035246175,0.00116052,0.012075735,0.00045196296,0.00028406113,0.0010898927,0.0020860473,0.3251381,0.0886273,0.24784988,0.009602569,0.30810937],"study_design_scores_gemma":[0.0005041006,0.00052760687,0.00056992355,0.000038044014,0.00014637866,0.00012523464,0.00031777067,0.8024908,0.06732915,0.12143921,0.006459435,0.000052403946],"about_ca_topic_score_codex":0.0017785727,"about_ca_topic_score_gemma":0.0033157584,"teacher_disagreement_score":0.0045979056,"about_ca_system_score_codex":0.0007787402,"about_ca_system_score_gemma":0.0020776629,"threshold_uncertainty_score":0.02431631},"labels":[],"label_agreement":null},{"id":"W2088092680","doi":"10.1016/j.jpdc.2014.07.001","title":"A survey of high level frameworks in block-structured adaptive mesh refinement packages","year":2014,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Guelph","funders":"Lawrence Berkeley National Laboratory; Deutsche Forschungsgemeinschaft; National Energy Research Scientific Computing Center; National Science Foundation; Compute Canada; Office of Science; National Aeronautics and Space Administration; Argonne National Laboratory; National Energy Technology Laboratory; U.S. Department of Energy; Natural Sciences and Engineering Research Council of Canada; National Nuclear Security Administration; Louisiana State University","keywords":"Computer science; Block (permutation group theory); Set (abstract data type); Range (aeronautics); Architecture; Adaptive mesh refinement; Domain (mathematical analysis); Cover (algebra); Programming language; Computational science; Archaeology","score_opus":0.026614568773559888,"score_gpt":0.266046701316634,"score_spread":0.2394321325430741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088092680","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.0026601867,0.044041812,0.9416457,0.00059431075,0.00031805853,0.0001192526,0.00027287437,0.0024719816,0.007875798],"genre_scores_gemma":[0.043955278,0.07349887,0.86908406,0.00071744365,0.00057402387,0.00046261205,0.0016008142,0.0025017804,0.0076051066],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99818134,0.00040645374,0.00015015287,0.00016743959,0.0009737889,0.00012080849],"domain_scores_gemma":[0.9984139,0.0006215625,0.00008325527,0.00031390382,0.00047848458,0.000088776025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002329687,0.0010752585,0.0018738956,0.0018836664,0.00074948644,0.002475597,0.004580856,0.0017565005,0.006439411],"category_scores_gemma":[0.0047810157,0.0013115142,0.0017519998,0.0050575216,0.00093787204,0.002388602,0.0020800994,0.0029877806,0.0046422645],"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.00017184606,0.00018793473,0.0012374355,0.0030371272,0.00016001277,0.00010392696,0.00018862853,0.06661682,0.005199578,0.14408278,0.02301264,0.7560013],"study_design_scores_gemma":[0.0001001373,0.00020615676,0.00095803745,0.00096926495,0.000119081684,0.00050422864,0.00007834685,0.45245412,0.0075495644,0.10772207,0.42921087,0.00012813143],"about_ca_topic_score_codex":0.0021969029,"about_ca_topic_score_gemma":0.0021909687,"teacher_disagreement_score":0.006439411,"about_ca_system_score_codex":0.0007176265,"about_ca_system_score_gemma":0.0018441307,"threshold_uncertainty_score":0.021542013},"labels":[],"label_agreement":null},{"id":"W2090312558","doi":"10.1016/j.jpdc.2010.12.003","title":"TEASE: A novel Tunnel-based sEcure Authentication SchemE to support smooth handoff in IEEE 802.11 wireless networks","year":2010,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Roaming; Handover; Wireless network; Network packet; Authentication (law); Wireless; Computer security; Telecommunications","score_opus":0.008778144782767795,"score_gpt":0.23146340633035561,"score_spread":0.22268526154758783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090312558","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.12508027,0.0019937227,0.8581007,0.0006641054,0.0007210948,0.00038022696,0.00026412559,0.0087176,0.0040780795],"genre_scores_gemma":[0.89309543,0.0008383371,0.095368125,0.00037817637,0.00019179327,0.0001797449,0.00042798842,0.00016887499,0.009351622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906117,0.00018762394,0.000105045336,0.00008039341,0.00035632827,0.0002094518],"domain_scores_gemma":[0.9980445,0.0004457753,0.00021098294,0.0007091405,0.00039809424,0.00019150163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018212578,0.0005407961,0.0007726755,0.00088709855,0.00092004356,0.0010185519,0.0016408087,0.0009566083,0.0030161378],"category_scores_gemma":[0.003176049,0.00040288368,0.00038969133,0.00051009696,0.00095053075,0.004144287,0.004034131,0.0017874382,0.000912615],"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.0058365786,0.0007144734,0.0043424326,0.0007046736,0.0003023748,0.001818673,0.0011172701,0.03990691,0.2603779,0.100269295,0.036021665,0.54858774],"study_design_scores_gemma":[0.00070670835,0.0031022453,0.0027430006,0.00017076412,0.00028242895,0.003259964,0.0005344472,0.7039724,0.16172412,0.04453487,0.0785371,0.0004319799],"about_ca_topic_score_codex":0.000536992,"about_ca_topic_score_gemma":0.0008921649,"teacher_disagreement_score":0.0030161378,"about_ca_system_score_codex":0.00029412817,"about_ca_system_score_gemma":0.00081758486,"threshold_uncertainty_score":0.0100899935},"labels":[],"label_agreement":null},{"id":"W2090342193","doi":"10.1006/jpdc.2001.1772","title":"Data Rearrangement between Radix-k and Lee Distance Gray Codes in k-ary n-cubes","year":2002,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Gray code; Computer science; Routing algorithm; Algorithm; Port (circuit theory); Code (set theory); Path length; Parallel computing; Routing (electronic design automation); Topology (electrical circuits); Combinatorics; Mathematics; Computer network; Routing protocol","score_opus":0.05587485102720893,"score_gpt":0.27069707860352415,"score_spread":0.21482222757631522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090342193","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.64981115,0.0010809628,0.32244268,0.0007430121,0.00027692725,0.00011598504,0.00020579231,0.0010128617,0.024310606],"genre_scores_gemma":[0.9430163,0.00021680073,0.049359214,0.00017825194,0.00003504871,0.00006273245,0.00017018183,0.00015572296,0.0068058292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967384,0.000070860915,0.000026578291,0.000050942865,0.00010776267,0.000070041235],"domain_scores_gemma":[0.99892884,0.0003595891,0.00014757704,0.00032386745,0.0001727616,0.00006737979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034382095,0.00019203057,0.00038891958,0.00047194975,0.0007543406,0.0009149017,0.0008231547,0.0003254653,0.0044579688],"category_scores_gemma":[0.0024153178,0.0001691583,0.00021755001,0.0011231557,0.0008504008,0.00153134,0.0011668747,0.00043499278,0.0004771315],"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.0026351064,0.00014835518,0.0027752938,0.00022344607,0.000047328846,0.0004634789,0.0010684762,0.12994595,0.054236587,0.5658977,0.0072483025,0.23531006],"study_design_scores_gemma":[0.00017135919,0.00064981374,0.002025336,0.000093532886,0.00005402747,0.00064938935,0.0011010226,0.51179224,0.08786439,0.37411118,0.02137424,0.000113324066],"about_ca_topic_score_codex":0.0012897336,"about_ca_topic_score_gemma":0.0023769757,"teacher_disagreement_score":0.0044579688,"about_ca_system_score_codex":0.0007652164,"about_ca_system_score_gemma":0.0006603112,"threshold_uncertainty_score":0.01491344},"labels":[],"label_agreement":null},{"id":"W2093615050","doi":"10.1016/j.jpdc.2010.04.001","title":"Dynamic balancing of communication and computation load for HLA-based simulations on large-scale distributed systems","year":2010,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computation; Distributed computing; Load balancing (electrical power); Scale (ratio); Parallel computing; Algorithm","score_opus":0.012241779020403099,"score_gpt":0.27739002010796554,"score_spread":0.26514824108756246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093615050","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.78135735,0.00022819093,0.20583525,0.0010840376,0.00014011028,0.000083649946,0.00007608936,0.0009833374,0.010212038],"genre_scores_gemma":[0.9920359,0.000020530664,0.0074311243,0.000027844188,0.000008790469,0.000020767047,0.000024448942,0.000041227995,0.0003894594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994998,0.0002378077,0.000026754513,0.000045773344,0.00011562398,0.000074207186],"domain_scores_gemma":[0.9983285,0.0008191266,0.000117784264,0.00024167,0.000274324,0.00021852127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011968297,0.00028738266,0.00055751624,0.00032959104,0.00089738856,0.0011074999,0.00095202215,0.0005470557,0.0020676285],"category_scores_gemma":[0.004631679,0.00031120927,0.00017831297,0.0004161284,0.00060755655,0.0012108041,0.0010609512,0.00072120223,0.0002956238],"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.0008078251,0.0001985344,0.004167204,0.000034790293,0.00003611231,0.00010235504,0.00020680942,0.9462542,0.013431613,0.0065903943,0.0012529799,0.026917158],"study_design_scores_gemma":[0.00002605446,0.000020251333,0.0003180474,0.0000012299529,0.0000033245774,0.000006488902,0.000032248317,0.9974534,0.00089778024,0.0010516234,0.00018605472,0.000003581107],"about_ca_topic_score_codex":0.0027806659,"about_ca_topic_score_gemma":0.0023095566,"teacher_disagreement_score":0.0027806659,"about_ca_system_score_codex":0.0005929419,"about_ca_system_score_gemma":0.00086073374,"threshold_uncertainty_score":0.0069168806},"labels":[],"label_agreement":null},{"id":"W2095930915","doi":"10.1016/j.jpdc.2007.05.015","title":"A high performance algorithm for static task scheduling in heterogeneous distributed computing systems","year":2007,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":235,"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; Dynamic priority scheduling; Algorithm; Scheduling (production processes); Fair-share scheduling; Rate-monotonic scheduling; Distributed computing; Parallel computing; Speedup; Symmetric multiprocessor system; Critical path method; Two-level scheduling; Fixed-priority pre-emptive scheduling; Round-robin scheduling; Schedule; Mathematical optimization","score_opus":0.015045547522518837,"score_gpt":0.2554308832610148,"score_spread":0.240385335738496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095930915","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.017264782,0.00025793948,0.97815347,0.00018422167,0.00015564561,0.00010199821,0.000042567295,0.0017799069,0.0020594567],"genre_scores_gemma":[0.1726642,0.00015571112,0.8231956,0.0001144617,0.00009515615,0.00025048773,0.00020668976,0.00035118833,0.002966621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999268,0.00017838593,0.00004636292,0.00011247892,0.00028228643,0.00011250799],"domain_scores_gemma":[0.9986822,0.0006255645,0.00007722864,0.00017057489,0.00033686718,0.00010741693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001878658,0.00096548395,0.0011502781,0.001220672,0.0017076886,0.001431796,0.0025995057,0.0012124821,0.0042163227],"category_scores_gemma":[0.0043239305,0.0007284734,0.00060831534,0.0014448308,0.00091789314,0.0016887505,0.00182275,0.0013105297,0.001000686],"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.0008203531,0.00025539464,0.0009834826,0.00017389224,0.00009315098,0.00014588083,0.0001681087,0.6083156,0.00908876,0.019276831,0.007778596,0.35290006],"study_design_scores_gemma":[0.00007279497,0.00003818291,0.0000803766,0.000003522981,0.000010640247,0.000017394534,0.000012357354,0.99388653,0.0009601746,0.003985331,0.0009258016,0.000006850207],"about_ca_topic_score_codex":0.0067697675,"about_ca_topic_score_gemma":0.006568919,"teacher_disagreement_score":0.0067697675,"about_ca_system_score_codex":0.0012776538,"about_ca_system_score_gemma":0.0025343625,"threshold_uncertainty_score":0.014104962},"labels":[],"label_agreement":null},{"id":"W2106327684","doi":"10.1016/j.jpdc.2014.08.001","title":"The IceProd framework: Distributed data processing for the IceCube neutrino observatory","year":2014,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Astrophysics and Cosmic Phenomena","field":"Physics and Astronomy","cited_by":15,"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; University of Alberta","funders":"Office of Polar Programs; Japan Society for the Promotion of Science; Science and Technology Facilities Council; Natural Sciences and Engineering Research Council of Canada; Knut och Alice Wallenbergs Stiftelse; National Research Foundation of Korea; Fonds Wetenschappelijk Onderzoek; Marsden Fund; Bundesministerium für Bildung und Forschung; Division of Physics; Helmholtz Alliance for Astroparticle Physics; Ruhr-Universität Bochum; Danmarks Grundforskningsfond; National Science Foundation; Belgian Federal Science Policy Office; Deutsche Forschungsgemeinschaft; National Research Foundation; Australian Research Council; Western Canada Research Grid; University of Oxford; Vlaamse regering; Fonds De La Recherche Scientifique - FNRS; Polarforskningssekretariatet; Compute Canada; U.S. Department of Energy; University of Wisconsin-Madison; Vetenskapsrådet; Wisconsin Alumni Research Foundation; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Python (programming language); Neutrino; Computer science; Plug-in; Detector; Physics; Middleware (distributed applications); XML; Data processing; Database; Grid computing; Dark matter; Operating system; Cosmic ray; Grid; Particle physics; Astronomy","score_opus":0.029109115581880216,"score_gpt":0.27493895508560606,"score_spread":0.24582983950372583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106327684","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016705045,0.0013020766,0.70485127,0.0009530648,0.00072198233,0.00054985104,0.018154608,0.24456379,0.012198281],"genre_scores_gemma":[0.23678431,0.0011607818,0.6452446,0.0010941329,0.00038398406,0.0012642487,0.072832175,0.03150984,0.00972601],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99821764,0.00037647082,0.00009789418,0.0004070692,0.00066696346,0.00023390658],"domain_scores_gemma":[0.9980452,0.000395882,0.000088517394,0.0006508623,0.00048816975,0.00033138687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003584747,0.0025512292,0.0018372192,0.0011710296,0.0011327184,0.003563892,0.0056540826,0.0013037942,0.012397339],"category_scores_gemma":[0.0060484074,0.0012722603,0.0019797687,0.0017715254,0.0014384018,0.003164127,0.0034864482,0.0028792035,0.0049848114],"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.004837675,0.00069246354,0.010318981,0.0012249617,0.0012794284,0.0006785949,0.0010226684,0.18613908,0.02684234,0.05262955,0.44438756,0.2699467],"study_design_scores_gemma":[0.0013286334,0.00017284339,0.0017997618,0.00011494586,0.00013432292,0.00011016989,0.00013492172,0.812232,0.01826528,0.04264001,0.12289518,0.00017194473],"about_ca_topic_score_codex":0.026240354,"about_ca_topic_score_gemma":0.020348055,"teacher_disagreement_score":0.026240354,"about_ca_system_score_codex":0.0018825174,"about_ca_system_score_gemma":0.004303597,"threshold_uncertainty_score":0.052175224},"labels":[],"label_agreement":null},{"id":"W2120196685","doi":"10.1016/j.jpdc.2008.05.005","title":"A new analytical method for parallel, diffusion-type load balancing","year":2008,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada); Simon Fraser University","funders":"","keywords":"Computer science; Mathematical proof; Load balancing (electrical power); Obstacle; Type (biology); Distributed computing; Key (lock); Parallel computing; Diffusion; Algorithm; Theoretical computer science; Mathematics","score_opus":0.02498088714067866,"score_gpt":0.29479851399700296,"score_spread":0.2698176268563243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120196685","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.0012273216,0.00021513917,0.9946774,0.00013789038,0.00032063408,0.00003863403,0.000019144903,0.00028628172,0.0030776102],"genre_scores_gemma":[0.11689644,0.0011330887,0.84902936,0.0004244264,0.00057667616,0.00036000626,0.00011954678,0.0006903174,0.030770168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951446,0.000090437774,0.00002104919,0.000058084268,0.0002829747,0.00003294216],"domain_scores_gemma":[0.9994406,0.00018226498,0.00003905997,0.00006578011,0.00022726851,0.00004489143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081178476,0.000796916,0.00088389235,0.0010592146,0.0010014847,0.0011002057,0.0021066233,0.0011313419,0.005075188],"category_scores_gemma":[0.002497652,0.00045997405,0.0007420873,0.0010671904,0.000884673,0.0016749894,0.001238267,0.0014521077,0.0018158416],"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.0002088649,0.00023031278,0.00059514004,0.0005039894,0.00012173965,0.00024966814,0.00043488885,0.20197023,0.0749736,0.3375267,0.020087073,0.36309776],"study_design_scores_gemma":[0.000025880001,0.000026703046,0.00007581801,0.000016892005,0.00001957654,0.00012146873,0.0000194505,0.9539886,0.00334601,0.02452209,0.017810833,0.000026646523],"about_ca_topic_score_codex":0.0017946435,"about_ca_topic_score_gemma":0.0021374759,"teacher_disagreement_score":0.005075188,"about_ca_system_score_codex":0.00093548297,"about_ca_system_score_gemma":0.0012697714,"threshold_uncertainty_score":0.016978204},"labels":[],"label_agreement":null},{"id":"W2141071417","doi":"10.1016/j.jpdc.2005.05.029","title":"Asserting the utility of using the Cowichan Problem Set","year":2005,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Alberta; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Canada Research Chairs; University of Alberta","keywords":"Computer science; Set (abstract data type); Theoretical computer science; Programming language","score_opus":0.025154598173859424,"score_gpt":0.28250104566475664,"score_spread":0.25734644749089725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141071417","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.03711869,0.0011411455,0.7900246,0.036941834,0.0012056566,0.00014302452,0.00037815952,0.0006967973,0.13235012],"genre_scores_gemma":[0.6687995,0.0014510091,0.29682267,0.0064833793,0.0024284553,0.0005005182,0.00078064995,0.00074150634,0.021992238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98980063,0.0058963164,0.0003813514,0.0011311548,0.002063404,0.0007271663],"domain_scores_gemma":[0.88966143,0.094190635,0.0015524235,0.007898984,0.0050316965,0.0016647339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014737259,0.0012727743,0.0014882832,0.0027090604,0.0046307133,0.005349075,0.0047423807,0.003884436,0.012242208],"category_scores_gemma":[0.09240158,0.0008798036,0.0021578048,0.0027154298,0.0107247,0.019475188,0.010080047,0.010502621,0.0015702919],"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.00009480034,0.000051089664,0.00038555326,0.00008022836,0.000022756332,0.00004579517,0.00017021007,0.009046537,0.0001476832,0.97496915,0.005055661,0.009930445],"study_design_scores_gemma":[0.000019417557,0.000016217957,0.00006344727,0.000027369488,0.000008514698,0.00003567119,0.000062788204,0.0347619,0.00027101688,0.9615869,0.0031350409,0.000011869623],"about_ca_topic_score_codex":0.0034085698,"about_ca_topic_score_gemma":0.0034235676,"teacher_disagreement_score":0.014737259,"about_ca_system_score_codex":0.0025109092,"about_ca_system_score_gemma":0.0031856832,"threshold_uncertainty_score":0.07793903},"labels":[],"label_agreement":null},{"id":"W2148789662","doi":"10.1016/j.jpdc.2007.04.010","title":"Performance of memory reclamation for lockless synchronization","year":2007,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Land reclamation; Priority inversion; Pointer (user interface); Workload; Concurrency; Data structure; Blocking (statistics); Distributed computing; Parallel computing; Computer network; Operating system; Computer hardware; Dynamic priority scheduling; Quality of service","score_opus":0.012272568437825851,"score_gpt":0.2517639469107619,"score_spread":0.23949137847293608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148789662","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.9830578,0.000577347,0.00836391,0.00016552946,0.00011140893,0.000018904517,0.00011002627,0.0042792046,0.0033157053],"genre_scores_gemma":[0.997018,0.000041552692,0.0014640838,0.000026564318,0.000012915091,0.000006930549,0.00010105121,0.00013392128,0.0011949913],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998701,0.00024779848,0.000048082984,0.00022039044,0.00030846725,0.0004741942],"domain_scores_gemma":[0.99434835,0.002907189,0.00038208903,0.0009926928,0.00091035524,0.00045942338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011171475,0.00065013365,0.0007174337,0.0005335784,0.0007277625,0.0010142901,0.0013543094,0.0007044708,0.007082657],"category_scores_gemma":[0.005779389,0.00026941288,0.000168506,0.0006717229,0.000634123,0.0013358804,0.00083649356,0.00069946115,0.0007465435],"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.042206243,0.00180953,0.017207041,0.00075074204,0.00025980917,0.00092479977,0.0014668575,0.13382305,0.50476235,0.008377989,0.014462623,0.273949],"study_design_scores_gemma":[0.0012881836,0.003935694,0.011393701,0.00003288662,0.00023177388,0.0002807768,0.00045306067,0.51516664,0.46139818,0.002235157,0.0034623079,0.000121604586],"about_ca_topic_score_codex":0.00248376,"about_ca_topic_score_gemma":0.0018750911,"teacher_disagreement_score":0.007082657,"about_ca_system_score_codex":0.0006648739,"about_ca_system_score_gemma":0.0011567317,"threshold_uncertainty_score":0.02369392},"labels":[],"label_agreement":null},{"id":"W2164426675","doi":"10.1006/jpdc.2001.1789","title":"A Genetic Algorithm for Finding the Pagenumber of Interconnection Networks","year":2002,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":21,"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; University of Waterloo; Nortel (Canada)","funders":"","keywords":"Computer science; Interconnection; Genetic algorithm; Parallel computing; Algorithm; Computer network; Machine learning","score_opus":0.02333325426687188,"score_gpt":0.24934095488796865,"score_spread":0.22600770062109676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164426675","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.02538932,0.00037227458,0.9695845,0.00024638907,0.000111052126,0.00010699893,0.00008682516,0.0010667655,0.0030358287],"genre_scores_gemma":[0.16261326,0.00019017376,0.83296806,0.00015536354,0.000069693044,0.00026131416,0.0002037251,0.00016808418,0.0033703544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995635,0.00012111199,0.000022295915,0.000096853095,0.00014863398,0.000047659647],"domain_scores_gemma":[0.99800247,0.0014161515,0.00010950169,0.0001081427,0.00030545625,0.000058339785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009833791,0.0010446039,0.0012600176,0.0023979626,0.0010364249,0.0011718192,0.0018110401,0.0027307682,0.0037332787],"category_scores_gemma":[0.0055481885,0.00081813784,0.00093299453,0.0019164736,0.0010432026,0.0014261969,0.00074119755,0.0012302774,0.000622655],"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.00011371877,0.00010754363,0.0009889811,0.00006390657,0.000060568564,0.00009063036,0.00009220018,0.7841596,0.0022583532,0.010660403,0.002522788,0.1988813],"study_design_scores_gemma":[0.000035559206,0.000020897203,0.00012240527,0.000007979893,0.000014049829,0.000023135552,0.000009864542,0.99357575,0.0004425301,0.0053278212,0.00041304887,0.0000069116154],"about_ca_topic_score_codex":0.010154386,"about_ca_topic_score_gemma":0.009191088,"teacher_disagreement_score":0.010154386,"about_ca_system_score_codex":0.0013595251,"about_ca_system_score_gemma":0.0016019654,"threshold_uncertainty_score":0.020190597},"labels":[],"label_agreement":null},{"id":"W2181650317","doi":"10.1016/j.jpdc.2015.10.006","title":"Black hole search in computer networks: State-of-the-art, challenges and future directions","year":2015,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Correctness; Asynchronous communication; Black hole (networking); Node (physics); Focus (optics); TRACE (psycholinguistics); Process (computing); Black box; State (computer science); Distributed computing; Neighbor Discovery Protocol; Computer network; Artificial intelligence; World Wide Web; The Internet; Algorithm","score_opus":0.02582787311008855,"score_gpt":0.24881181979029862,"score_spread":0.22298394668021007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181650317","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.031390317,0.72953504,0.15872253,0.049545243,0.0018885601,0.00009370532,0.00020675822,0.0005110224,0.028106987],"genre_scores_gemma":[0.42816466,0.47794786,0.074501894,0.0042464947,0.0059540193,0.00017921066,0.00038061733,0.00015834135,0.0084670335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99764687,0.0010295338,0.000086579064,0.0003610211,0.00055942393,0.00031649982],"domain_scores_gemma":[0.9790502,0.017230846,0.0006187598,0.0009134644,0.0015304582,0.0006562824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005956089,0.000829524,0.002727194,0.0015318474,0.0012545455,0.006174139,0.0036957348,0.0049585714,0.0064036422],"category_scores_gemma":[0.014338823,0.00062703266,0.0008530034,0.0030106897,0.005899936,0.016815247,0.0032342102,0.0037808463,0.0011706834],"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.00047262525,0.0003829119,0.003278105,0.0034453643,0.00023306777,0.00015294545,0.00043569773,0.06365712,0.0006864925,0.48568323,0.03460219,0.40697017],"study_design_scores_gemma":[0.00005381741,0.00010172749,0.000413071,0.0007062466,0.000045598903,0.00016141272,0.0006264988,0.15090773,0.0004915471,0.81419116,0.032239612,0.00006166049],"about_ca_topic_score_codex":0.00269697,"about_ca_topic_score_gemma":0.0025955688,"teacher_disagreement_score":0.0064036422,"about_ca_system_score_codex":0.0015879793,"about_ca_system_score_gemma":0.0023463368,"threshold_uncertainty_score":0.031499147},"labels":[],"label_agreement":null},{"id":"W2342504663","doi":"10.1016/j.jpdc.2016.04.005","title":"Transforming the multifluid PPM algorithm to run on GPUs","year":2016,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Meteorological Phenomena and Simulations","field":"Earth and Planetary Sciences","cited_by":2,"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":"Los Alamos National Laboratory; National Centre for Supercomputing Applications; Lawrence Livermore National Laboratory; Center for Selective C-H Functionalization, National Science Foundation; Petroleum Research Newfoundland and Labrador; Sandia National Laboratories; U.S. Department of Energy; National Science Foundation","keywords":"Computer science; Thread (computing); Workspace; Parallel computing; Algorithm; Chip; Computation; Computational science","score_opus":0.022318635867517832,"score_gpt":0.24185113148835638,"score_spread":0.21953249562083854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342504663","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.023127357,0.000059715785,0.9659334,0.00027430124,0.00018402636,0.00004799378,0.00012194969,0.0032653688,0.0069858055],"genre_scores_gemma":[0.16498762,0.00006639693,0.82858026,0.00016608236,0.00005652883,0.00011195697,0.00024394537,0.0010413135,0.0047459314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976224,0.000042326934,0.000014305539,0.000037769416,0.000107255226,0.00003605516],"domain_scores_gemma":[0.9994822,0.00014805912,0.000022520657,0.00012983172,0.00018844701,0.00002892217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036811663,0.0003874174,0.00037808728,0.00036198756,0.00048517343,0.0006669435,0.0010444192,0.0007254788,0.008422462],"category_scores_gemma":[0.003542214,0.00030838806,0.00033161166,0.00047986864,0.00030685656,0.0008731938,0.001107337,0.0010312495,0.002210793],"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.0003779405,0.0001982295,0.0030718774,0.00024616855,0.00006540046,0.00030352073,0.00037603074,0.41786906,0.047557317,0.07015754,0.016099475,0.44367746],"study_design_scores_gemma":[0.000030176056,0.000019559922,0.00022135262,0.000008300204,0.0000038603325,0.00004120658,0.000027023496,0.97759163,0.0060832687,0.010404076,0.005561953,0.000007542058],"about_ca_topic_score_codex":0.00489035,"about_ca_topic_score_gemma":0.006215072,"teacher_disagreement_score":0.008422462,"about_ca_system_score_codex":0.00036593713,"about_ca_system_score_gemma":0.001035913,"threshold_uncertainty_score":0.02817595},"labels":[],"label_agreement":null},{"id":"W242727464","doi":"10.1016/j.jpdc.2012.01.003","title":"Parallel Ant Colony Optimization on Graphics Processing Units","year":2012,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Metaheuristic Optimization Algorithms Research","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":"Université du Québec à Chicoutimi","funders":"Agence Nationale de la Recherche","keywords":"Ant colony optimization algorithms; Computer science; Graphics; Graphics processing unit; ANT; Computer graphics (images); Parallel metaheuristic; Parallel computing; Metaheuristic; Artificial intelligence; Operating system; Meta-optimization","score_opus":0.041069458023383416,"score_gpt":0.2981955138576753,"score_spread":0.2571260558342919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W242727464","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.20030348,0.0006137494,0.77171737,0.0006906966,0.0003805777,0.00015090538,0.00008732067,0.001401532,0.02465444],"genre_scores_gemma":[0.77544284,0.0001831307,0.21679558,0.00011584945,0.00004426572,0.00016327857,0.00007682753,0.0001909805,0.006987209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997124,0.000117140655,0.00001003812,0.00003146586,0.000095186646,0.00003368372],"domain_scores_gemma":[0.9995073,0.00021848759,0.000034810568,0.000062213454,0.00014500778,0.000032233038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003024222,0.00043633732,0.0006427238,0.00035507913,0.0005921376,0.00067812874,0.0011652635,0.0008415194,0.003108924],"category_scores_gemma":[0.0015321056,0.00035916505,0.00044879704,0.0007878701,0.0004919012,0.0005427245,0.00070490025,0.0007884244,0.00042107163],"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.00020404233,0.00003441809,0.00035529202,0.000039710187,0.000021362528,0.00007513302,0.000036425557,0.95849127,0.0047456785,0.0055761165,0.0016595938,0.028761055],"study_design_scores_gemma":[0.000010868284,0.000013319757,0.00004700966,8.8083686e-7,0.000002411242,0.0000035469168,0.0000036258252,0.99821544,0.00039268995,0.0010811968,0.00022731767,0.00000178162],"about_ca_topic_score_codex":0.008327765,"about_ca_topic_score_gemma":0.0068706847,"teacher_disagreement_score":0.008327765,"about_ca_system_score_codex":0.00071887125,"about_ca_system_score_gemma":0.00091426214,"threshold_uncertainty_score":0.016558588},"labels":[],"label_agreement":null},{"id":"W2562314876","doi":"10.1016/j.jpdc.2016.12.013","title":"Low latency and division free Gauss–Jordan solver in floating point arithmetic","year":2016,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Numerical Methods and Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Gaussian elimination; Latency (audio); Parallel computing; Division (mathematics); Solver; Floating point; Gauss; Field-programmable gate array; Critical path method; Algorithm; Arithmetic; Gaussian; Computer hardware; Mathematics","score_opus":0.011599648206551433,"score_gpt":0.2535385210227733,"score_spread":0.24193887281622187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562314876","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.08160326,0.0009863133,0.8897858,0.0005958115,0.0003242259,0.0000722992,0.00017988689,0.0022171892,0.024235256],"genre_scores_gemma":[0.60182995,0.00044939615,0.36889243,0.00027333814,0.00017057009,0.00013561074,0.00036581373,0.00046657314,0.02741637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994203,0.00008086915,0.000027304912,0.00005419872,0.00033081052,0.00008657495],"domain_scores_gemma":[0.9993405,0.00020711492,0.00005044594,0.00013581969,0.00022019616,0.000046058536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029914195,0.00058035966,0.0006339868,0.00042159684,0.0008611645,0.0011676636,0.0012006515,0.0005631276,0.006150208],"category_scores_gemma":[0.0019328146,0.000293183,0.00029224835,0.00092057325,0.00048128623,0.0012602307,0.0011277931,0.00088961964,0.0020129594],"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.0021607194,0.0003856778,0.0031349657,0.00062553526,0.00018787447,0.0009419191,0.00064607663,0.24537653,0.09945594,0.1731052,0.025910167,0.44806942],"study_design_scores_gemma":[0.00013110589,0.00015089518,0.0003641641,0.00002585341,0.000031331172,0.000228379,0.000094216855,0.9267669,0.02395018,0.03959907,0.008624846,0.000033104407],"about_ca_topic_score_codex":0.002208704,"about_ca_topic_score_gemma":0.0036852048,"teacher_disagreement_score":0.006150208,"about_ca_system_score_codex":0.00045952687,"about_ca_system_score_gemma":0.0015658679,"threshold_uncertainty_score":0.02057451},"labels":[],"label_agreement":null},{"id":"W2620280838","doi":"10.1016/j.jpdc.2017.04.003","title":"Decidability classes for mobile agents computing","year":2017,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Optimization and Search Problems","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":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université Paris Diderot; Agence Nationale de la Recherche; Université du Québec en Outaouais","keywords":"Decidability; Class (philosophy); Decision problem; Certificate; Computer science; Verifiable secret sharing; Protocol (science); Focus (optics); Reduction (mathematics); Theoretical computer science; Artificial intelligence; Mathematics; Algorithm; Programming language","score_opus":0.04602957870674327,"score_gpt":0.3446050114997421,"score_spread":0.2985754327929988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620280838","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.12536298,0.0020395725,0.7859628,0.015828565,0.00051207136,0.0004402454,0.0022153668,0.0019638157,0.06567457],"genre_scores_gemma":[0.8288357,0.001068181,0.14267927,0.0021267417,0.0008393573,0.0008402624,0.0031009004,0.000678175,0.019831322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953998,0.0011505309,0.00036758013,0.0012007103,0.0010407228,0.00084064296],"domain_scores_gemma":[0.9676403,0.02834628,0.0008093109,0.0016409808,0.0007743321,0.0007887927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044200355,0.0011006865,0.0014276509,0.0017427397,0.0036178832,0.0073470883,0.0038528736,0.003315067,0.010207946],"category_scores_gemma":[0.02197492,0.0013146513,0.0041061956,0.0016546667,0.004557569,0.014791758,0.004826933,0.009271705,0.00078592275],"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.0001203731,0.00014321541,0.000914952,0.00023797466,0.00006994834,0.0001830328,0.00088067725,0.012065284,0.00072437944,0.96318614,0.006152828,0.015321196],"study_design_scores_gemma":[0.00005281669,0.0000099135195,0.00013434568,0.000026410124,0.00003327091,0.000054835153,0.00012521105,0.03846601,0.00054955017,0.95750856,0.0030253031,0.000013829015],"about_ca_topic_score_codex":0.005257046,"about_ca_topic_score_gemma":0.0055090883,"teacher_disagreement_score":0.010207946,"about_ca_system_score_codex":0.0042153075,"about_ca_system_score_gemma":0.0031017426,"threshold_uncertainty_score":0.03414899},"labels":[],"label_agreement":null},{"id":"W2752406850","doi":"10.1016/j.jpdc.2017.08.008","title":"A location Prediction-based routing scheme for opportunistic networks in an IoT scenario","year":2017,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Opportunistic and Delay-Tolerant Networks","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Node (physics); Overhead (engineering); Markov chain; Network packet; Geographic routing; Routing (electronic design automation); Scheme (mathematics); Routing protocol; Reliability (semiconductor); Internet of Things; Distributed computing; Dynamic Source Routing; Computer security","score_opus":0.041851710472918635,"score_gpt":0.2931014631230441,"score_spread":0.25124975265012545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752406850","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.07961163,0.0007658866,0.9127372,0.0005057449,0.0003583591,0.00014781638,0.00020918158,0.0011071891,0.004557003],"genre_scores_gemma":[0.91462153,0.00027214765,0.08262729,0.00010166002,0.000066522676,0.000056656838,0.00018685947,0.00003325009,0.002034078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958926,0.00007399397,0.000031506122,0.00009388927,0.00012288122,0.0000885119],"domain_scores_gemma":[0.99931574,0.00018454398,0.00008200867,0.00015309406,0.00019488385,0.00006980207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000757337,0.00053088187,0.0009195046,0.000660631,0.0011171317,0.00072102697,0.0017453143,0.00071590993,0.0009623647],"category_scores_gemma":[0.0014464097,0.0002963281,0.00033575148,0.0009214336,0.00044035222,0.0012363136,0.0015691791,0.0005850044,0.00026506497],"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.0006808408,0.00033710396,0.0035401804,0.00015520993,0.00011813133,0.000662151,0.00031295643,0.6146309,0.031215468,0.031040736,0.0114954505,0.30581084],"study_design_scores_gemma":[0.000015491396,0.000074092684,0.00027544922,0.000005742733,0.000019927327,0.00014185728,0.000045533565,0.99278885,0.001711628,0.003568658,0.0013330224,0.000019876403],"about_ca_topic_score_codex":0.0053155217,"about_ca_topic_score_gemma":0.009116574,"teacher_disagreement_score":0.0053155217,"about_ca_system_score_codex":0.00072341046,"about_ca_system_score_gemma":0.0010522914,"threshold_uncertainty_score":0.010569155},"labels":[],"label_agreement":null},{"id":"W2778066394","doi":"10.1016/j.jpdc.2017.12.009","title":"A light-weight log-based hybrid storage system","year":2017,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Advanced Data Storage Technologies","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":"St. Francis Xavier University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; File system; Computer data storage; Cloud storage; Flash file system; Operating system; Object storage; Cloud computing; Block (permutation group theory); Flash memory; File system fragmentation; Device file; Embedded system; Database; Computer file; Computer memory; Semiconductor memory","score_opus":0.01692915884015002,"score_gpt":0.2556039834049273,"score_spread":0.2386748245647773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778066394","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.39868727,0.0041753626,0.48634416,0.0020453804,0.0015287151,0.0009003984,0.0045810533,0.07403121,0.027706454],"genre_scores_gemma":[0.8840308,0.0006103349,0.08329629,0.00071389956,0.00033755985,0.0003223821,0.0022507948,0.00049366127,0.02794437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996118,0.000043698376,0.000034061293,0.00007063016,0.0001739308,0.00006581949],"domain_scores_gemma":[0.99914,0.0001288908,0.00005308193,0.00029162923,0.00026543371,0.0001208391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036132283,0.00063961855,0.00089667743,0.0011659281,0.001223468,0.0018585145,0.003120321,0.00062700844,0.016067075],"category_scores_gemma":[0.00078318716,0.00042742197,0.0002533655,0.0014706259,0.00040110364,0.0028639324,0.0022821461,0.0006717498,0.0039734775],"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.009088,0.0020620232,0.0070867226,0.0012049294,0.00024213102,0.0014150754,0.00041161804,0.019670662,0.23017307,0.010560293,0.10209666,0.61598885],"study_design_scores_gemma":[0.0011005901,0.002416273,0.0062988903,0.00012539365,0.00041432874,0.002152764,0.0005434456,0.7494177,0.15693022,0.014584978,0.0656437,0.0003717687],"about_ca_topic_score_codex":0.0016994374,"about_ca_topic_score_gemma":0.0023925037,"teacher_disagreement_score":0.016067075,"about_ca_system_score_codex":0.00046096984,"about_ca_system_score_gemma":0.001197238,"threshold_uncertainty_score":0.05374974},"labels":[],"label_agreement":null},{"id":"W2802337893","doi":"10.1016/j.jpdc.2018.04.004","title":"Response time optimization for cloudlets in Mobile Edge Computing","year":2018,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":54,"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; Enhanced Data Rates for GSM Evolution; Task (project management); Cloudlet; Distributed computing; Edge computing; Mobile device; Edge device; Mobile edge computing; Quality of service; Nash equilibrium; Cloud computing; Response time; Computer network; Operating system; Artificial intelligence","score_opus":0.01399967873238087,"score_gpt":0.26962856404879837,"score_spread":0.2556288853164175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802337893","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.19503051,0.002054226,0.78423154,0.0019958222,0.0005630745,0.0002170474,0.000362715,0.00095535757,0.014589707],"genre_scores_gemma":[0.9503126,0.0002844125,0.044254318,0.00018837822,0.00014196661,0.00005072346,0.000115339586,0.00016142435,0.00449087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892324,0.0002694416,0.000028978806,0.00018370185,0.00018205322,0.00041256123],"domain_scores_gemma":[0.9985141,0.0009059756,0.00009613647,0.00008664523,0.00024329497,0.0001537857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011858767,0.00089396164,0.0015501044,0.00042495164,0.0007691819,0.0013900038,0.0013207147,0.0010178854,0.0041879993],"category_scores_gemma":[0.0025811817,0.00036795507,0.0005503425,0.00069319835,0.00047426482,0.00093286886,0.00077444024,0.0010923264,0.00051665306],"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.0009840307,0.00024203231,0.00056139706,0.0001649453,0.000047919173,0.0000990185,0.000049993458,0.9436364,0.00842467,0.009518961,0.006261526,0.030009082],"study_design_scores_gemma":[0.00000987825,0.0000464478,0.00008270785,0.000002423627,0.0000066073803,0.000010721921,0.000011906733,0.9978871,0.0005095082,0.0012562242,0.00017401711,0.0000024955652],"about_ca_topic_score_codex":0.0046846275,"about_ca_topic_score_gemma":0.0038164677,"teacher_disagreement_score":0.0046846275,"about_ca_system_score_codex":0.0015338623,"about_ca_system_score_gemma":0.0017197742,"threshold_uncertainty_score":0.014010251},"labels":[],"label_agreement":null},{"id":"W2811437435","doi":"10.1016/j.jpdc.2018.06.004","title":"Nontrivial and universal helping for wait-free queues and stacks","year":2018,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"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":"Israel Science Foundation; Ben-Gurion University of the Negev; University of Toronto","keywords":"Computer science; Queue; Implementation; Set (abstract data type); Priority queue; Stack (abstract data type); Theoretical computer science; Distributed computing; Operating system; Programming language","score_opus":0.012429609724443156,"score_gpt":0.25061420682172564,"score_spread":0.23818459709728249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811437435","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.5095374,0.0007133218,0.42707056,0.0037765377,0.0005402487,0.00021348255,0.0005164354,0.0038035884,0.053828545],"genre_scores_gemma":[0.9323542,0.00026278308,0.049329113,0.00059918227,0.00027245388,0.00017195058,0.0002778763,0.00064212043,0.016090304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957729,0.0006872817,0.00030203172,0.0007540018,0.00093887124,0.0015450403],"domain_scores_gemma":[0.9779197,0.01052575,0.0016919518,0.004707312,0.0020631298,0.0030920217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004039144,0.0010984684,0.0021219875,0.0026856994,0.0071957153,0.0067141177,0.003344833,0.0036599005,0.007998612],"category_scores_gemma":[0.028993756,0.001604727,0.0024144459,0.0021134939,0.009620768,0.0140626235,0.011535449,0.0057498976,0.0010254751],"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.00009699534,0.000043155105,0.00047030798,0.000038061808,0.00001124472,0.00007295538,0.0005279128,0.0018277074,0.0006408809,0.9920107,0.0013063368,0.0029538493],"study_design_scores_gemma":[0.000035919365,0.000015304387,0.0001298659,0.000012391519,0.00002681494,0.000059765243,0.00015808592,0.01069208,0.00079769717,0.9865143,0.0015271286,0.000030729847],"about_ca_topic_score_codex":0.0034329044,"about_ca_topic_score_gemma":0.0041877883,"teacher_disagreement_score":0.007998612,"about_ca_system_score_codex":0.0028519253,"about_ca_system_score_gemma":0.0046088393,"threshold_uncertainty_score":0.026758015},"labels":[],"label_agreement":null},{"id":"W2896639624","doi":"10.1016/j.jpdc.2018.10.004","title":"Automatic generation of benchmarks for I/O-intensive parallel applications","year":2018,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Advanced Data Storage Technologies","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":"University of Illinois at Urbana-Champaign; National Natural Science Foundation of China","keywords":"Computer science; Parallel computing; Benchmark (surveying); TRACE (psycholinguistics); Computation; Supercomputer; Overhead (engineering); Parallel I/O; Parallel algorithm; Algorithm; Programming language","score_opus":0.03221570556506162,"score_gpt":0.2941877268886827,"score_spread":0.2619720213236211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896639624","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.42849934,0.0012374286,0.43792915,0.0005769558,0.0007362337,0.0008438917,0.0074956357,0.10687771,0.015803687],"genre_scores_gemma":[0.64896905,0.00029552818,0.31784326,0.00019608624,0.00010835956,0.000860089,0.020743348,0.00775386,0.0032303408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918216,0.00017713652,0.000073814306,0.00017812241,0.00025452158,0.00013415607],"domain_scores_gemma":[0.99696416,0.0011273081,0.00022066022,0.0004280863,0.001093606,0.00016612967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067974115,0.0019755193,0.0007848413,0.0021303298,0.00065276766,0.0010500511,0.0018615988,0.00069918425,0.0061475793],"category_scores_gemma":[0.005402691,0.0006237901,0.00063285726,0.0013715227,0.00036297293,0.0009802259,0.0009975244,0.0009540352,0.001693613],"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.003659729,0.00094642217,0.015284986,0.0014264316,0.00019137826,0.0013904574,0.0005950177,0.09837985,0.21773742,0.011279221,0.076475166,0.57263386],"study_design_scores_gemma":[0.00042952548,0.00049650343,0.005495129,0.000069919246,0.00009697435,0.00024739213,0.00024157397,0.80591476,0.1580795,0.007763588,0.02109885,0.00006625683],"about_ca_topic_score_codex":0.0028139667,"about_ca_topic_score_gemma":0.00358743,"teacher_disagreement_score":0.0061475793,"about_ca_system_score_codex":0.0006021807,"about_ca_system_score_gemma":0.0015565553,"threshold_uncertainty_score":0.020565748},"labels":[],"label_agreement":null},{"id":"W2931065016","doi":"10.1016/j.jpdc.2019.03.013","title":"INRFlow: An interconnection networks research flow-level simulation framework","year":2019,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Engineering and Physical Sciences Research Council; European Commission","keywords":"Computer science; Network topology; Scalability; Distributed computing; Modular design; Interconnection; Variety (cybernetics); Context (archaeology); Network traffic simulation; Bandwidth (computing); Computer network; Network traffic control","score_opus":0.06974009187274968,"score_gpt":0.34891673189469175,"score_spread":0.2791766400219421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2931065016","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.004105262,0.00026820958,0.9773361,0.00028100243,0.00016024096,0.00032028471,0.0010659797,0.0077758743,0.008687132],"genre_scores_gemma":[0.10693106,0.0012148643,0.87490934,0.00040487,0.00016364014,0.002036894,0.004340151,0.002352786,0.0076464503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890697,0.00040849502,0.00007507761,0.00012985307,0.00034647697,0.00013319435],"domain_scores_gemma":[0.99843925,0.00082059915,0.00012760574,0.00019665953,0.0002838378,0.0001320404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003000519,0.0013283956,0.0010956513,0.0012734612,0.0008912906,0.0018573091,0.0038588005,0.0016815204,0.008294124],"category_scores_gemma":[0.0047791577,0.0008493485,0.0020758496,0.0008077464,0.0010479704,0.0022611013,0.0017979625,0.0025596458,0.0016365453],"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.00009506473,0.00010668383,0.0010047192,0.00021153459,0.000086574924,0.000090557456,0.00013736426,0.85969067,0.0025437635,0.09937354,0.011519932,0.02513956],"study_design_scores_gemma":[0.00004310765,0.000026330054,0.00008162728,0.000029435942,0.000014633821,0.000026860584,0.000007993903,0.9630547,0.0010309159,0.013766982,0.021897297,0.000020118221],"about_ca_topic_score_codex":0.012048727,"about_ca_topic_score_gemma":0.00721862,"teacher_disagreement_score":0.012048727,"about_ca_system_score_codex":0.0018456788,"about_ca_system_score_gemma":0.0036360333,"threshold_uncertainty_score":0.027746618},"labels":[],"label_agreement":null},{"id":"W2935850529","doi":"10.1016/j.jpdc.2019.04.008","title":"GPU accelerated t-distributed stochastic neighbor embedding","year":2019,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":82,"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":"Canadian Institute for Advanced Research; Nvidia","keywords":"Computer science; MNIST database; CUDA; Embedding; Dimensionality reduction; Curse of dimensionality; Visualization; Implementation; Parallel computing; Artificial intelligence; Machine learning; Artificial neural network; Theoretical computer science","score_opus":0.021153718403705203,"score_gpt":0.285349262357592,"score_spread":0.2641955439538868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2935850529","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.06646042,0.00027122707,0.91955066,0.00041853072,0.00041129117,0.000074369236,0.0003183956,0.0031320807,0.00936306],"genre_scores_gemma":[0.5419539,0.00012245236,0.44240424,0.00019996979,0.000080253616,0.00010963262,0.00081853307,0.00042905842,0.013881942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997582,0.000042782187,0.00000928966,0.000042966014,0.00011215011,0.00003459113],"domain_scores_gemma":[0.999579,0.00008684681,0.000020651645,0.00008475891,0.00017949693,0.00004935982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026210208,0.00040454185,0.00059866445,0.00030424353,0.00034373705,0.00055663084,0.001204494,0.00076597737,0.007401003],"category_scores_gemma":[0.0012650334,0.0002131205,0.00037600112,0.0005627606,0.00024855952,0.00062945916,0.00095484947,0.00078918395,0.0015028177],"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.00070449174,0.00024454802,0.0016092923,0.00013700813,0.00012634257,0.00028336674,0.00010414583,0.61951196,0.017063081,0.02139374,0.024567634,0.3142544],"study_design_scores_gemma":[0.000016217256,0.00001467382,0.00006665862,0.0000011315689,0.000002737881,0.000021138767,0.0000064864785,0.9968137,0.001016298,0.0014431729,0.0005951434,0.0000026909577],"about_ca_topic_score_codex":0.006849562,"about_ca_topic_score_gemma":0.01578177,"teacher_disagreement_score":0.007401003,"about_ca_system_score_codex":0.00034989713,"about_ca_system_score_gemma":0.0011181441,"threshold_uncertainty_score":0.024758756},"labels":[],"label_agreement":null},{"id":"W2975816306","doi":"10.1016/j.jpdc.2019.09.013","title":"En-ABC: An ensemble artificial bee colony based anomaly detection scheme for cloud environment","year":2019,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":105,"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; École de Technologie Supérieure","funders":"Ministry of Electronics and Information technology","keywords":"Computer science; Anomaly detection; Identification (biology); Cluster analysis; Cloud computing; Data mining; Feature selection; Identification scheme; Artificial intelligence; Artificial bee colony algorithm; Feature (linguistics); Machine learning","score_opus":0.013140667508369655,"score_gpt":0.2340278167369527,"score_spread":0.22088714922858305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975816306","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.10714903,0.0009417655,0.88570446,0.00027698185,0.000282751,0.00011351798,0.00014427025,0.0025291236,0.0028580567],"genre_scores_gemma":[0.7470602,0.00026173965,0.24819638,0.00014753512,0.000050452716,0.00006266458,0.00023856385,0.00006502403,0.0039173937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999539,0.000073319716,0.000032265987,0.00007986418,0.00023144933,0.000044147186],"domain_scores_gemma":[0.99950683,0.000090264235,0.00004261752,0.00007532989,0.00025561053,0.000029389954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041135075,0.00043712792,0.0008727433,0.0006353774,0.00050043315,0.00051084603,0.0012920235,0.0005497173,0.00079349504],"category_scores_gemma":[0.0011320496,0.00016834876,0.0003376881,0.00070228084,0.00022079975,0.00076674053,0.00060336397,0.00073844224,0.00019192166],"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.00048045558,0.00029976357,0.0060762535,0.00008301311,0.0001958706,0.00020781826,0.00007139101,0.21363845,0.03036517,0.0037844263,0.0056913104,0.7391061],"study_design_scores_gemma":[0.000011104358,0.000046411213,0.00069480157,0.0000022420736,0.000014600259,0.00007600554,0.0000066520975,0.99412435,0.0036018977,0.00049499393,0.00091943867,0.0000075119297],"about_ca_topic_score_codex":0.006218999,"about_ca_topic_score_gemma":0.0071517597,"teacher_disagreement_score":0.006218999,"about_ca_system_score_codex":0.00044523965,"about_ca_system_score_gemma":0.00063857157,"threshold_uncertainty_score":0.01236558},"labels":[],"label_agreement":null},{"id":"W3196680848","doi":"10.1016/j.jpdc.2021.08.003","title":"Energy efficient spiking neural network processing using approximate arithmetic units and variable precision weights","year":2021,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Advanced Memory and Neural Computing","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":"University of Saskatchewan","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea","keywords":"Computer science; Variable (mathematics); Field-programmable gate array; Neuromorphic engineering; Double-precision floating-point format; Artificial neural network; Algorithm; Arbitrary-precision arithmetic; Energy (signal processing); Computation; Computer hardware; Efficient energy use; Parallel computing; Artificial intelligence; Mathematics","score_opus":0.018092310941967553,"score_gpt":0.23212678540745604,"score_spread":0.21403447446548848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196680848","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.11864102,0.00039763027,0.8713111,0.00036434137,0.00017106163,0.000032692427,0.00007927432,0.00076572003,0.008237088],"genre_scores_gemma":[0.8512099,0.00016545267,0.14441259,0.0000989251,0.000026762185,0.000033395645,0.00007094402,0.00005763237,0.0039244154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999119,0.000009809584,0.0000069564876,0.000019100873,0.00003916256,0.000013071558],"domain_scores_gemma":[0.999853,0.000042697542,0.000013980432,0.000032662498,0.00004823597,0.000009408181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017907203,0.00023724364,0.00027490957,0.00016334427,0.00024075531,0.00066823914,0.0007240146,0.00037305854,0.0018229401],"category_scores_gemma":[0.0007025787,0.00015639639,0.00021278264,0.00035499415,0.00021403976,0.0008086182,0.00046950293,0.0004631434,0.00025569394],"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.0004555716,0.0001491263,0.0015354508,0.00019416034,0.00015500044,0.00020469962,0.0001441605,0.32748225,0.18196525,0.062401764,0.0033602172,0.42195237],"study_design_scores_gemma":[0.00001016859,0.00004124261,0.00022231764,0.000006358701,0.000015288813,0.000044365217,0.000011308669,0.96903855,0.019269332,0.010099234,0.0012337307,0.000008232859],"about_ca_topic_score_codex":0.0010835242,"about_ca_topic_score_gemma":0.002792424,"teacher_disagreement_score":0.0018229401,"about_ca_system_score_codex":0.00035277527,"about_ca_system_score_gemma":0.0003681475,"threshold_uncertainty_score":0.0060983896},"labels":[],"label_agreement":null},{"id":"W4210651592","doi":"10.1016/j.jpdc.2022.01.011","title":"An efficient heuristic switch migration scheme for software-defined vehicular networks","year":2022,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","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 Ottawa","funders":"","keywords":"Computer science; Scheme (mathematics); Heuristic; Software; Distributed computing; Parallel computing; Computer network; Operating system; Artificial intelligence","score_opus":0.007335743963057301,"score_gpt":0.21693360254734625,"score_spread":0.20959785858428895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210651592","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.21253839,0.0011882426,0.7756516,0.00043490168,0.0007744965,0.0003819099,0.00018493495,0.0023138619,0.0065316963],"genre_scores_gemma":[0.9040071,0.00017528776,0.09372833,0.00007651805,0.000042839394,0.00008195656,0.0001760282,0.000034615136,0.0016773654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995813,0.00009846491,0.000031946216,0.00007393018,0.00009776399,0.00011673209],"domain_scores_gemma":[0.99953234,0.00014305761,0.000047565492,0.000083886975,0.00013198055,0.00006117335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004538043,0.000826134,0.0011509609,0.0007505807,0.0010846509,0.00084426464,0.0015933925,0.00048798713,0.0016931914],"category_scores_gemma":[0.00095087907,0.00025240178,0.0003747236,0.0006856096,0.00032563476,0.00070558104,0.0007989244,0.000520648,0.0002596222],"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.0014325815,0.0005748964,0.0021010565,0.00020383635,0.0001941948,0.00028248262,0.00021193958,0.5318498,0.042186197,0.010816797,0.00971754,0.40042877],"study_design_scores_gemma":[0.000047384437,0.00016158402,0.0003010811,0.0000062198674,0.000029829494,0.000073578965,0.0000652516,0.9937716,0.0026707884,0.001800133,0.0010587836,0.000013810254],"about_ca_topic_score_codex":0.0045649153,"about_ca_topic_score_gemma":0.007928234,"teacher_disagreement_score":0.0045649153,"about_ca_system_score_codex":0.0007932471,"about_ca_system_score_gemma":0.0014304174,"threshold_uncertainty_score":0.009076655},"labels":[],"label_agreement":null},{"id":"W4224096756","doi":"10.1016/j.jpdc.2022.04.012","title":"Coordinate-based efficient indexing mechanism for intelligent IoT systems in heterogeneous edge computing","year":2022,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Caching and Content Delivery","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":"Ontario Tech University","funders":"","keywords":"Computer science; Edge computing; Enhanced Data Rates for GSM Evolution; Computer network; Search engine indexing; Latency (audio); Server; Edge device; Distributed computing; Node (physics); Cloud computing; Operating system","score_opus":0.022555593930466314,"score_gpt":0.24663818719179215,"score_spread":0.22408259326132585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224096756","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.12665388,0.0013242809,0.8453172,0.0003769362,0.0003724176,0.0003218693,0.0006733201,0.010725929,0.014234204],"genre_scores_gemma":[0.8903482,0.00028875793,0.10291201,0.00011212821,0.00012067518,0.00013932706,0.00086883816,0.00021551346,0.004994552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990953,0.0001224362,0.00010766467,0.00018403846,0.00031598812,0.00017458759],"domain_scores_gemma":[0.9982798,0.00021245997,0.00013546764,0.00073295296,0.00050898007,0.00013034407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008896798,0.00061781623,0.0011860325,0.001464154,0.0018747385,0.0033154674,0.0027440654,0.00077938876,0.004293081],"category_scores_gemma":[0.002165459,0.00035637696,0.00040800462,0.0019153438,0.0005935636,0.003461686,0.0020932558,0.00067618047,0.0014583583],"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.0033187058,0.0011411386,0.011429405,0.0005550913,0.0003241786,0.001171036,0.0015598758,0.10605404,0.18489227,0.19091345,0.051671393,0.44696933],"study_design_scores_gemma":[0.00015569861,0.00036420266,0.0020543607,0.000024047336,0.00019587381,0.0005013282,0.00038843314,0.87867785,0.06958387,0.027603956,0.020337915,0.00011255094],"about_ca_topic_score_codex":0.003351191,"about_ca_topic_score_gemma":0.0033205952,"teacher_disagreement_score":0.004293081,"about_ca_system_score_codex":0.0011018073,"about_ca_system_score_gemma":0.0016238666,"threshold_uncertainty_score":0.014361799},"labels":[],"label_agreement":null},{"id":"W4292133298","doi":"10.1016/j.jpdc.2022.08.001","title":"Utilization prediction-based VM consolidation approach","year":2022,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; PlanetLab; CloudSim; Cloud computing; Service-level agreement; Workload; Energy consumption; Consolidation (business); Benchmark (surveying); Distributed computing; Real-time computing; Operating system; The Internet","score_opus":0.0273799438588084,"score_gpt":0.2443415089910739,"score_spread":0.2169615651322655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292133298","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.0648799,0.0015665495,0.92576057,0.00040715028,0.00020957491,0.00013314051,0.0001348288,0.001068328,0.005839909],"genre_scores_gemma":[0.90897703,0.00056637026,0.08726386,0.00014291296,0.000117191405,0.00007602409,0.00018545568,0.000034530036,0.0026366033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959284,0.00007602209,0.000024757514,0.000106402025,0.00013084726,0.00006911032],"domain_scores_gemma":[0.99944764,0.00018143814,0.000054266045,0.000052242518,0.00022466067,0.00003973435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006517575,0.0005544802,0.0010060766,0.0008426937,0.00040007697,0.00080555223,0.0014402891,0.00051899115,0.0017630483],"category_scores_gemma":[0.0013185103,0.00028846174,0.00041702585,0.0009236271,0.0002513389,0.00102404,0.00050428475,0.0006125467,0.00035000674],"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.00029108147,0.00044126136,0.005984338,0.00013979473,0.00017500376,0.00020136952,0.00008360145,0.5803565,0.008046289,0.0068067745,0.0050796475,0.39239427],"study_design_scores_gemma":[0.0000034505679,0.000015602749,0.00023001483,0.0000032923067,0.000011560595,0.00001647908,0.0000064166084,0.9985366,0.00035284687,0.0006685597,0.00015276723,0.0000024411065],"about_ca_topic_score_codex":0.005832397,"about_ca_topic_score_gemma":0.0055164634,"teacher_disagreement_score":0.005832397,"about_ca_system_score_codex":0.00045165495,"about_ca_system_score_gemma":0.0011276266,"threshold_uncertainty_score":0.011596918},"labels":[],"label_agreement":null},{"id":"W4306935880","doi":"10.1016/j.jpdc.2022.09.014","title":"Special issue on Distributed Intelligence at the Edge for the Future Internet of Things","year":2022,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"IoT and Edge/Fog Computing","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":"Brandon University","funders":"","keywords":"Computer science; Exploit; Workload; Distributed computing; Initialization; A priori and a posteriori; Residual; Stream processing; Machine learning; Algorithm; Operating system","score_opus":0.016764861550462272,"score_gpt":0.25552674949517934,"score_spread":0.23876188794471706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306935880","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.00037562556,0.011984889,0.0014602214,0.013994055,0.9377477,0.00015106208,0.0004239795,0.00023884048,0.033623602],"genre_scores_gemma":[0.002088406,0.014705342,0.00067827484,0.006981774,0.8555751,0.00010572923,0.0009731812,0.0002728875,0.11861937],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99826103,0.00016632992,0.00015259071,0.00031072626,0.00087599823,0.00023340134],"domain_scores_gemma":[0.99325436,0.0014246018,0.00051233656,0.00039423595,0.0026617402,0.0017526912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025410203,0.0022116527,0.0030208388,0.0030616291,0.00186469,0.0073423013,0.0023765222,0.005120461,0.10446086],"category_scores_gemma":[0.0037646696,0.0007403021,0.0017543924,0.0019639314,0.0010707118,0.0044467202,0.0021465365,0.0045661875,0.04000079],"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.00006768752,0.000055892364,0.000107704225,0.0004008798,0.000024023513,0.0001132607,0.000011110367,0.00013556513,0.0005047675,0.0018116848,0.9733507,0.023416683],"study_design_scores_gemma":[0.000025681522,0.000108232394,0.00057243474,0.00021486024,0.000029702265,0.00018997207,0.00002152416,0.00043033954,0.0002521319,0.0022954526,0.9958436,0.000016103011],"about_ca_topic_score_codex":0.0007967896,"about_ca_topic_score_gemma":0.0020470298,"teacher_disagreement_score":0.10446086,"about_ca_system_score_codex":0.0014048383,"about_ca_system_score_gemma":0.002240285,"threshold_uncertainty_score":0.34945643},"labels":[],"label_agreement":null},{"id":"W4309261811","doi":"10.1016/j.jpdc.2022.10.012","title":"Performance analysis of DPDK-based applications through tracing","year":2022,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tracing; Parallel computing; Operating system","score_opus":0.014046520982717763,"score_gpt":0.25471872421706054,"score_spread":0.24067220323434277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309261811","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.9071614,0.0005293466,0.07922591,0.00023201585,0.00006170888,0.000074656564,0.00031285617,0.00660385,0.0057981326],"genre_scores_gemma":[0.98417467,0.000071695875,0.014569396,0.00001745361,0.0000051286956,0.000013367581,0.00013580442,0.0001706001,0.00084173714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827147,0.000315497,0.00009638186,0.00025529848,0.0007606346,0.00030063302],"domain_scores_gemma":[0.9938304,0.0029552192,0.00044418723,0.0013984557,0.0011242123,0.00024760282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013142488,0.0007729694,0.0005897729,0.0014390012,0.0007852408,0.0013918352,0.0015053864,0.00063804083,0.0019524866],"category_scores_gemma":[0.007131145,0.0003375822,0.00031556294,0.0015270248,0.0006858311,0.0011205267,0.00088812097,0.0009540701,0.00033746895],"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.0041378713,0.0011121486,0.038705982,0.0005745501,0.00021179546,0.00048262198,0.0009046717,0.5977403,0.12589401,0.017222673,0.004055826,0.20895755],"study_design_scores_gemma":[0.000024726163,0.000118807766,0.0019422167,0.000008072382,0.000023854598,0.000055107295,0.000045639827,0.97606796,0.019949606,0.0011263898,0.0006257572,0.00001195492],"about_ca_topic_score_codex":0.009076378,"about_ca_topic_score_gemma":0.0055334535,"teacher_disagreement_score":0.009076378,"about_ca_system_score_codex":0.0014354748,"about_ca_system_score_gemma":0.0018461926,"threshold_uncertainty_score":0.018047094},"labels":[],"label_agreement":null},{"id":"W4309535831","doi":"10.1016/j.jpdc.2022.11.004","title":"PTTS: Power-aware tensor cores using two-sided sparsity","year":2022,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Exploit; Overhead (engineering); Matrix multiplication; Sparse matrix; Power gating; Power (physics); Gating; Tensor (intrinsic definition); Energy (signal processing); Parallel computing; Algorithm; Physics","score_opus":0.025304855769364153,"score_gpt":0.27650030967810746,"score_spread":0.2511954539087433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309535831","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.033130497,0.0004176489,0.9443693,0.00048449528,0.00038786302,0.00013678413,0.00043053413,0.008148152,0.012494672],"genre_scores_gemma":[0.44614294,0.00033791992,0.53950506,0.00037471717,0.00014346805,0.0002465053,0.0010280835,0.001249734,0.010971648],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999548,0.00009096881,0.00002475206,0.00006802569,0.00018179724,0.000086319225],"domain_scores_gemma":[0.99912566,0.00019406881,0.00006313412,0.00027599555,0.00024770462,0.00009342905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005818218,0.0009336767,0.0006319703,0.0004271998,0.00049640535,0.00089048926,0.0015541945,0.0004816187,0.0074618794],"category_scores_gemma":[0.002419568,0.000355828,0.00052497874,0.00063860416,0.0005744515,0.0016548077,0.0015321143,0.0012137538,0.0015585865],"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.0014516799,0.0004762045,0.0022858295,0.0004802311,0.0001917541,0.00034157906,0.00026383068,0.2506431,0.059000358,0.053878926,0.07555921,0.5554273],"study_design_scores_gemma":[0.000075389114,0.00014155977,0.0001895613,0.0000200767,0.000019736244,0.00007758093,0.00005025102,0.96395296,0.011813977,0.017406125,0.0062289666,0.000023780087],"about_ca_topic_score_codex":0.002534617,"about_ca_topic_score_gemma":0.007741616,"teacher_disagreement_score":0.0074618794,"about_ca_system_score_codex":0.0004233261,"about_ca_system_score_gemma":0.0014064327,"threshold_uncertainty_score":0.024962485},"labels":[],"label_agreement":null},{"id":"W4309763245","doi":"10.1016/j.jpdc.2022.11.009","title":"On the impact of mode transition on phased transactional memory performance","year":2022,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed systems and fault tolerance","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 Alberta; Athabasca University","funders":"Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Transactional memory; Computer science; Implementation; Software transactional memory; Commit; Software; Mode (computer interface); Throughput; Parallel computing; Operating system; Database transaction; Programming language","score_opus":0.01522277391314685,"score_gpt":0.2626178534057679,"score_spread":0.24739507949262102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309763245","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.9883151,0.000668319,0.0047995686,0.00043269937,0.00010095314,0.000012609502,0.00017840178,0.00034985313,0.0051424983],"genre_scores_gemma":[0.99931943,0.000039986287,0.00036455854,0.000020923908,0.000011766882,0.0000031230766,0.000029829793,0.000019124669,0.00019119919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924976,0.00023419199,0.000027455786,0.00009696963,0.00020407741,0.00018754735],"domain_scores_gemma":[0.9791014,0.017754529,0.0005472006,0.0010687253,0.0011343738,0.00039377937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013520528,0.00026559088,0.00031172892,0.00041591108,0.00040197317,0.0010208071,0.0007816561,0.00057710276,0.004716636],"category_scores_gemma":[0.01652761,0.00018246453,0.00015398394,0.0004964967,0.00066416775,0.0019896235,0.0004823775,0.00087364943,0.000479493],"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.021860309,0.0024469325,0.0634272,0.0006179818,0.00022723418,0.0009107321,0.000947764,0.4471935,0.1775769,0.036296893,0.010178929,0.23831554],"study_design_scores_gemma":[0.00024429837,0.0023515366,0.024826627,0.00006474436,0.00019209796,0.00031057917,0.0007473578,0.8749611,0.076068275,0.018455487,0.0016747437,0.00010320872],"about_ca_topic_score_codex":0.00091624295,"about_ca_topic_score_gemma":0.0010492146,"teacher_disagreement_score":0.004716636,"about_ca_system_score_codex":0.00049586076,"about_ca_system_score_gemma":0.00050079083,"threshold_uncertainty_score":0.01577872},"labels":[],"label_agreement":null},{"id":"W4312083945","doi":"10.1016/j.jpdc.2022.12.002","title":"A federated collaborative recommendation model for privacy-preserving distributed recommender applications based on microservice framework","year":2022,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Privacy-Preserving Technologies in Data","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":"University of Waterloo","funders":"Natural Science Foundation of Zhejiang Province; Hangzhou Normal University","keywords":"Computer science; Recommender system; Collaborative filtering; Unavailability; Raw data; Server; Collaborative model; World Wide Web","score_opus":0.03254021263764888,"score_gpt":0.3023896621819635,"score_spread":0.2698494495443146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312083945","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.01982954,0.0002808606,0.9764767,0.000313647,0.00005752927,0.000091082744,0.0001539867,0.0007955072,0.0020010383],"genre_scores_gemma":[0.73654336,0.00033782996,0.25248218,0.00020224103,0.00008847947,0.00019034061,0.00046182712,0.00008751356,0.009606271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977875,0.00055953686,0.00014211812,0.0006414067,0.0005771829,0.00029225502],"domain_scores_gemma":[0.997858,0.00051385845,0.00014204401,0.00066376285,0.00063395925,0.00018849493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023821194,0.00053988805,0.0015232909,0.0008472396,0.001618552,0.0024379592,0.0037144385,0.0016504736,0.002997733],"category_scores_gemma":[0.0034176947,0.00040836592,0.0011895468,0.0017250074,0.00070965727,0.0035288788,0.0021836825,0.0015257463,0.0007910478],"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.00087870174,0.0006464014,0.004011468,0.00016777244,0.00033050124,0.0005939071,0.0004947246,0.6045358,0.007506404,0.1755964,0.010346383,0.1948915],"study_design_scores_gemma":[0.000010560723,0.00003638892,0.000101147256,0.000004070124,0.000020011626,0.00006387459,0.000026480117,0.98644525,0.00051306986,0.01168166,0.0010852914,0.000012160328],"about_ca_topic_score_codex":0.013699248,"about_ca_topic_score_gemma":0.015918138,"teacher_disagreement_score":0.013699248,"about_ca_system_score_codex":0.0012318357,"about_ca_system_score_gemma":0.0024356712,"threshold_uncertainty_score":0.027238965},"labels":[],"label_agreement":null},{"id":"W4380742132","doi":"10.1016/j.jpdc.2023.104729","title":"An efficient GPU-based method to compute high-order Zernike moments","year":2023,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Image Retrieval and Classification Techniques","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 Winnipeg","funders":"","keywords":"Zernike polynomials; Computer science; Velocity Moments; Computation; Method of moments (probability theory); Algorithm; Computational science; Artificial intelligence; Mathematics; Optics; Physics","score_opus":0.0197323477698334,"score_gpt":0.31840712057133147,"score_spread":0.29867477280149807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380742132","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.012734748,0.00035611814,0.9794835,0.00013895478,0.0002141793,0.00006418525,0.00016010247,0.0023495744,0.004498704],"genre_scores_gemma":[0.123143464,0.0002688979,0.8647813,0.00012373297,0.000080879516,0.00011202684,0.00061967515,0.00061079365,0.010259237],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997993,0.000016547177,0.000007687216,0.000021520586,0.00012733896,0.000027737377],"domain_scores_gemma":[0.9997161,0.000061418614,0.000016363612,0.00003957965,0.00013341504,0.000033205768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016088095,0.0006542977,0.0007383705,0.0008130973,0.0006381691,0.00078904675,0.0011917191,0.00072882685,0.007918709],"category_scores_gemma":[0.0008034245,0.00034895155,0.0005522952,0.0010999962,0.00026390198,0.0007292382,0.00081381825,0.0008283004,0.0025330032],"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.0005043613,0.00022401493,0.0011750557,0.0003289288,0.00016504551,0.00034289729,0.00017919057,0.10150183,0.15026972,0.028759139,0.029852001,0.6866979],"study_design_scores_gemma":[0.000044822245,0.000033818415,0.00030007504,0.000009588592,0.000013429129,0.00012728693,0.00001922343,0.9761198,0.0118872905,0.0032744044,0.008148252,0.000021960399],"about_ca_topic_score_codex":0.006272235,"about_ca_topic_score_gemma":0.01498418,"teacher_disagreement_score":0.007918709,"about_ca_system_score_codex":0.00048063407,"about_ca_system_score_gemma":0.0011566635,"threshold_uncertainty_score":0.026490748},"labels":[],"label_agreement":null},{"id":"W4385249512","doi":"10.1016/j.jpdc.2023.104746","title":"Mixed precision support in HPC applications: What about reliability?","year":2023,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":8,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Intel Corporation","keywords":"Computer science; Leverage (statistics); Reliability (semiconductor); Supercomputer; Double-precision floating-point format; Exascale computing; Single-precision floating-point format; Floating point; Computer engineering; Parallel computing; Operating system; Machine learning","score_opus":0.02413579568500913,"score_gpt":0.28514081126150914,"score_spread":0.2610050155765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385249512","genre_codex":"review","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.2617222,0.33059818,0.17929707,0.1640723,0.010609802,0.00010779371,0.00088664127,0.00231335,0.05039265],"genre_scores_gemma":[0.9337089,0.034074184,0.01871374,0.0025984074,0.00501064,0.00008239447,0.00017756774,0.00041387047,0.005220233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770385,0.0005405945,0.00013078048,0.00020497455,0.0011860204,0.00023373491],"domain_scores_gemma":[0.9732649,0.014330542,0.0025866819,0.0024026483,0.0063979644,0.0010173138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045400625,0.0004646367,0.00085859007,0.0008160869,0.00080347125,0.003162452,0.0024312935,0.0024390009,0.0060155904],"category_scores_gemma":[0.043427818,0.0005272095,0.0003134637,0.0009589896,0.0020643815,0.008357893,0.0015260086,0.0021519647,0.001984093],"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.0011471666,0.00034279923,0.03429851,0.0046782657,0.0003735071,0.0007333111,0.0017607777,0.029695597,0.010079692,0.16373941,0.071812205,0.6813387],"study_design_scores_gemma":[0.00026322756,0.0012456339,0.021345485,0.004227081,0.00059851696,0.0026257609,0.0030440309,0.1080354,0.016015206,0.6559788,0.18632449,0.0002964434],"about_ca_topic_score_codex":0.0017596664,"about_ca_topic_score_gemma":0.001899794,"teacher_disagreement_score":0.0060155904,"about_ca_system_score_codex":0.00082465145,"about_ca_system_score_gemma":0.0016141835,"threshold_uncertainty_score":0.02401042},"labels":[],"label_agreement":null},{"id":"W4390116827","doi":"10.1016/j.jpdc.2025.105143","title":"Complexity analysis and scalability of a matrix-free extrapolated geometric multigrid solver for curvilinear coordinates representations from fusion plasma applications","year":2025,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Magnetic confinement fusion research","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Deutsches Zentrum für Luft- und Raumfahrt; Canadian Association of Radiation Oncology; Niedersächsisches Ministerium für Wissenschaft und Kultur; Bundesministerium für Wirtschaft und Klimaschutz","keywords":"Curvilinear coordinates; Multigrid method; Solver; Scalability; Computational science; Matrix (chemical analysis); Fusion; Computer science; Plasma; Mathematics; Geometry; Physics; Mathematical optimization; Mathematical analysis; Materials science","score_opus":0.01709433328998383,"score_gpt":0.3161265021777171,"score_spread":0.29903216888773326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390116827","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.40875748,0.0009278281,0.56846994,0.0015276021,0.00013221276,0.0001836801,0.00054607674,0.0010171061,0.018438028],"genre_scores_gemma":[0.8181778,0.0003237255,0.17725745,0.00013247598,0.000055595898,0.0001737333,0.0007972948,0.0003057693,0.002776049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997509,0.000068619454,0.000014062374,0.000026712456,0.00010216453,0.000037521306],"domain_scores_gemma":[0.9990201,0.0006019663,0.00007131446,0.00008134121,0.00017997697,0.000045300665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040669442,0.0005906108,0.00030222247,0.0003903539,0.00044020452,0.0008163171,0.00078926893,0.0006167276,0.0019446061],"category_scores_gemma":[0.002328107,0.00014231673,0.0004453594,0.00040431033,0.0005437603,0.0005909492,0.00082559657,0.00088488456,0.00021032219],"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.00020555666,0.00009454438,0.002688765,0.00020104498,0.000036072033,0.00020654252,0.00019213234,0.9242327,0.0130739035,0.02282806,0.0018945727,0.034346063],"study_design_scores_gemma":[0.000005168507,0.0000086946775,0.00016964937,0.0000028418808,0.0000017767626,0.000009177553,0.00001058704,0.9972204,0.00082189316,0.0015053764,0.00024232555,0.000001988415],"about_ca_topic_score_codex":0.00512617,"about_ca_topic_score_gemma":0.0043063154,"teacher_disagreement_score":0.00512617,"about_ca_system_score_codex":0.0005317458,"about_ca_system_score_gemma":0.0008183776,"threshold_uncertainty_score":0.010192692},"labels":[],"label_agreement":null},{"id":"W4392135566","doi":"10.1016/j.jpdc.2024.104866","title":"HoneyTwin: Securing smart cities with machine learning-enabled SDN edge and cloud-based honeypots","year":2024,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Network Security and Intrusion Detection","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":"Toronto Metropolitan University","funders":"","keywords":"Honeypot; Computer science; Cloud computing; Enhanced Data Rates for GSM Evolution; Edge computing; Computer security; Computer network; Operating system; Artificial intelligence","score_opus":0.009161460302612013,"score_gpt":0.2130426484286773,"score_spread":0.2038811881260653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392135566","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.50200176,0.0016652875,0.42378408,0.0015823368,0.0015213564,0.0006986077,0.0007672166,0.046277292,0.021702021],"genre_scores_gemma":[0.9648628,0.00013056085,0.031112615,0.00019542038,0.000039599316,0.00006128252,0.00038260175,0.00020471716,0.0030104679],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939525,0.00014231114,0.00004230753,0.00013112917,0.00018200763,0.000106967884],"domain_scores_gemma":[0.99921465,0.00019519334,0.00007076422,0.00028674657,0.00011968181,0.0001129353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080901466,0.0005599719,0.0004943091,0.00048647096,0.00052871014,0.001091503,0.0010713995,0.0006016633,0.0021533074],"category_scores_gemma":[0.0016529071,0.0002443297,0.0002450478,0.00030906973,0.0005568903,0.002592392,0.0019985114,0.0008689898,0.00042312554],"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.004543478,0.0015799839,0.03001602,0.0005769007,0.00073284534,0.002089937,0.0010562679,0.13543591,0.101236604,0.036800623,0.066645026,0.6192865],"study_design_scores_gemma":[0.00019692592,0.0006683943,0.004475346,0.000030705527,0.00008717409,0.00044290526,0.00025737335,0.92834777,0.034270972,0.011501912,0.019669278,0.000051208313],"about_ca_topic_score_codex":0.0006407553,"about_ca_topic_score_gemma":0.001074342,"teacher_disagreement_score":0.0021533074,"about_ca_system_score_codex":0.00027442432,"about_ca_system_score_gemma":0.00034034887,"threshold_uncertainty_score":0.0072035193},"labels":[],"label_agreement":null},{"id":"W4402294425","doi":"10.1016/j.jpdc.2024.104977","title":"Accelerating Fortran codes: A method for integrating Coarray Fortran with CUDA Fortran and OpenMP","year":2024,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alliance de recherche numérique du Canada; Austrian Science Fund; Russian Foundation for Basic Research","keywords":"Fortran; Computer science; Parallel computing; CUDA; Computational science; Programming language","score_opus":0.021641870002693332,"score_gpt":0.30461748124396143,"score_spread":0.2829756112412681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402294425","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.000786438,0.0006275145,0.98016584,0.00037527498,0.0005609367,0.00025287207,0.00026163438,0.010697082,0.006272459],"genre_scores_gemma":[0.009455228,0.00072704983,0.9786695,0.00021190022,0.00020534155,0.00077812496,0.00047527894,0.003850876,0.005626659],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975616,0.00064925465,0.0001765452,0.00026130292,0.0012071686,0.0001441294],"domain_scores_gemma":[0.99731773,0.0007312793,0.0002776108,0.00044585913,0.0010959195,0.00013160423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022584058,0.0018758249,0.001072246,0.0031383215,0.001284255,0.0021990456,0.0032502892,0.0016086057,0.011456013],"category_scores_gemma":[0.008171994,0.0013119158,0.0015682344,0.0029793936,0.001399915,0.0023009202,0.0033004016,0.0036264479,0.0095861],"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.00010640538,0.00013108997,0.0017243805,0.0010840159,0.00034227988,0.0006475554,0.0009288763,0.053827673,0.010201885,0.24704193,0.19711658,0.4868473],"study_design_scores_gemma":[0.00011334098,0.000105495696,0.0008064789,0.00039760047,0.000103538725,0.00089214486,0.00013513323,0.24063188,0.012950031,0.06956196,0.6741046,0.00019779972],"about_ca_topic_score_codex":0.00471441,"about_ca_topic_score_gemma":0.0042993105,"teacher_disagreement_score":0.011456013,"about_ca_system_score_codex":0.00071395416,"about_ca_system_score_gemma":0.0032270974,"threshold_uncertainty_score":0.038324177},"labels":[],"label_agreement":null},{"id":"W4402631819","doi":"10.1016/j.jpdc.2024.104976","title":"Survey of federated learning in intrusion detection","year":2024,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":42,"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":"","keywords":"Computer science; Intrusion detection system; Intrusion; Computer security; Geology","score_opus":0.017165860403275113,"score_gpt":0.2557119318781298,"score_spread":0.23854607147485468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402631819","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.024839344,0.63744724,0.31429327,0.0042639435,0.0011035543,0.00019054899,0.00044954216,0.0009840473,0.01642856],"genre_scores_gemma":[0.36507493,0.4407452,0.17758378,0.002486068,0.003779167,0.00025661857,0.0018634127,0.00016641304,0.008044428],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99501604,0.0013627915,0.000528854,0.0011944682,0.0015959411,0.0003018485],"domain_scores_gemma":[0.9922806,0.004253877,0.00034773984,0.0011416733,0.0017425206,0.00023355236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00535192,0.0011124468,0.0023459587,0.004955699,0.00080314325,0.003785186,0.0028605927,0.0017869165,0.0019382808],"category_scores_gemma":[0.011891098,0.00068199995,0.0011894312,0.0064827357,0.0010744198,0.0057722037,0.001986385,0.0017132562,0.0008184244],"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.00019203067,0.00029136884,0.004507014,0.0015203109,0.0001843048,0.000051568655,0.000065472996,0.015518089,0.00078382815,0.02528296,0.006712607,0.94489056],"study_design_scores_gemma":[0.00010955096,0.0016710971,0.009272498,0.0029249156,0.0005617686,0.0021174648,0.0004839957,0.5333073,0.013029111,0.13116677,0.30515444,0.00020113218],"about_ca_topic_score_codex":0.00222138,"about_ca_topic_score_gemma":0.001339371,"teacher_disagreement_score":0.00535192,"about_ca_system_score_codex":0.0018005745,"about_ca_system_score_gemma":0.002373614,"threshold_uncertainty_score":0.02830398},"labels":[],"label_agreement":null},{"id":"W4402741153","doi":"10.1016/j.jpdc.2024.104990","title":"Robust and Scalable Federated Learning Framework for Client Data Heterogeneity Based on Optimal Clustering","year":2024,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Privacy-Preserving Technologies in Data","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":"Brock University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Scalability; Cluster analysis; Federated learning; Biclustering; Data mining; Distributed computing; Artificial intelligence; Database; Fuzzy clustering; Canopy clustering algorithm","score_opus":0.07238156506958848,"score_gpt":0.3162229305768396,"score_spread":0.2438413655072511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402741153","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.01738586,0.00017517115,0.9795767,0.00017273765,0.00003993829,0.00005268397,0.00009742697,0.0018629667,0.00063650624],"genre_scores_gemma":[0.6919866,0.00013770327,0.30408466,0.00017088065,0.00007072988,0.00011934045,0.00052970217,0.00020446646,0.0026958962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969773,0.0005411924,0.00018207394,0.00090872427,0.0009342758,0.00045639343],"domain_scores_gemma":[0.99696463,0.0006583076,0.00021383546,0.0012567855,0.00068255083,0.00022392672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025992475,0.0008124943,0.002547491,0.0012720355,0.0017085823,0.0023457687,0.0045933053,0.0016983738,0.0017712024],"category_scores_gemma":[0.0055891112,0.00056058547,0.001254919,0.001985199,0.0009903054,0.0042171534,0.0039093643,0.0017844355,0.00061238796],"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.00091739564,0.00053965766,0.0037432008,0.00012224799,0.00024962932,0.00029402302,0.00029395826,0.6528511,0.012088095,0.037061155,0.01066629,0.2811732],"study_design_scores_gemma":[0.00000759809,0.00001613638,0.00009948378,0.00000204255,0.0000075697017,0.000038093887,0.000025776793,0.9907498,0.0011620113,0.0075604357,0.00032282737,0.000008281145],"about_ca_topic_score_codex":0.005648199,"about_ca_topic_score_gemma":0.006777521,"teacher_disagreement_score":0.005648199,"about_ca_system_score_codex":0.0017171109,"about_ca_system_score_gemma":0.0032037452,"threshold_uncertainty_score":0.013746321},"labels":[],"label_agreement":null},{"id":"W4403518132","doi":"10.1016/j.jpdc.2024.104998","title":"Locating a black hole in a dynamic ring","year":2024,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Sapienza Università di Roma; European Commission","keywords":"Computer science; Ring (chemistry); Computer graphics (images); Parallel computing","score_opus":0.010549158179129856,"score_gpt":0.254019713447679,"score_spread":0.24347055526854913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403518132","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.20631856,0.0009103344,0.7787778,0.0011964425,0.000105145955,0.00010420282,0.00011888255,0.0003373664,0.012131242],"genre_scores_gemma":[0.90476525,0.00067102775,0.08929511,0.00017848422,0.000050170427,0.00007928283,0.0000808322,0.00005469422,0.0048251166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989374,0.00037509034,0.00003302185,0.0002949792,0.00017524339,0.00018428544],"domain_scores_gemma":[0.99636036,0.0022722895,0.0006279637,0.00029563127,0.00017437871,0.00026939463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012942639,0.00043850872,0.0007248545,0.0006421415,0.0011499767,0.0012606442,0.0014264338,0.0019848184,0.0026356457],"category_scores_gemma":[0.0072674067,0.00043113393,0.00055102294,0.00047669944,0.002039874,0.0036266996,0.0027649058,0.0011815396,0.0004891887],"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.00044855953,0.00006400162,0.002686244,0.00015289862,0.00005924705,0.0008997645,0.0005840034,0.7370421,0.00946531,0.21886873,0.0023461734,0.027382886],"study_design_scores_gemma":[0.000032731503,0.00015344378,0.0004678504,0.000034486296,0.000027175869,0.00043563242,0.0003282021,0.91605383,0.0031870548,0.07504431,0.004200342,0.000034992016],"about_ca_topic_score_codex":0.0013912858,"about_ca_topic_score_gemma":0.0009199471,"teacher_disagreement_score":0.0026356457,"about_ca_system_score_codex":0.0006908785,"about_ca_system_score_gemma":0.00050360506,"threshold_uncertainty_score":0.008817136},"labels":[],"label_agreement":null},{"id":"W4404261179","doi":"10.1016/j.jpdc.2024.105010","title":"Enabling semi-supervised learning in intrusion detection systems","year":2024,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Intrusion detection system; Artificial intelligence; Machine learning; Supervised learning; Artificial neural network","score_opus":0.012333618428620744,"score_gpt":0.23649412148959287,"score_spread":0.22416050306097213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404261179","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.020692607,0.00021622055,0.97664714,0.00030589613,0.00003116114,0.000080781,0.00007752661,0.001121746,0.0008269537],"genre_scores_gemma":[0.6316012,0.00030748727,0.36563858,0.00027578863,0.00012093519,0.00033359195,0.00048818244,0.00013658816,0.0010976042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934995,0.0037265962,0.00040276226,0.00096415845,0.0011976961,0.00020919277],"domain_scores_gemma":[0.9741554,0.01778217,0.0014630058,0.0033482534,0.002904054,0.00034716277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063096476,0.00063401187,0.0011576628,0.0008106097,0.00064565416,0.0016831493,0.0017606139,0.0012310136,0.0010575942],"category_scores_gemma":[0.019003453,0.0006817066,0.0008506877,0.0006982337,0.0021662258,0.00332305,0.0025580965,0.0020841467,0.0005302777],"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.000490351,0.00057038746,0.0036820262,0.0004666691,0.00016674984,0.00017221246,0.00049945136,0.70517987,0.007929528,0.030688703,0.0028854038,0.24726877],"study_design_scores_gemma":[0.000010301199,0.000045670444,0.00019850276,0.00000978082,0.000005802282,0.00002233727,0.000014622899,0.980755,0.002076953,0.016384376,0.00046782143,0.000008782273],"about_ca_topic_score_codex":0.0020082577,"about_ca_topic_score_gemma":0.0017970983,"teacher_disagreement_score":0.0063096476,"about_ca_system_score_codex":0.0011752492,"about_ca_system_score_gemma":0.0016572681,"threshold_uncertainty_score":0.033369005},"labels":[],"label_agreement":null},{"id":"W4409192285","doi":"10.1016/j.jpdc.2025.105079","title":"STVAI: Exploring spatio-temporal similarity for scalable and efficient intelligent video inference","year":2025,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Advanced Image and Video Retrieval Techniques","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":"York University","funders":"Key Research and Development Program of Hunan Province of China; Key Research and Development Program of Jiangxi Province; National Office for Philosophy and Social Sciences; National Natural Science Foundation of China","keywords":"Computer science; Inference; Scalability; Similarity (geometry); Artificial intelligence; Database; Image (mathematics)","score_opus":0.04530620958525323,"score_gpt":0.3221920908546731,"score_spread":0.2768858812694199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409192285","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.029472984,0.0010022954,0.9575348,0.00019246971,0.00014519387,0.00015471276,0.0010938721,0.008484625,0.0019190777],"genre_scores_gemma":[0.2730481,0.00044753603,0.717222,0.000233571,0.00015094764,0.00017974315,0.0047248737,0.00072927587,0.0032640535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993049,0.000094983836,0.000036497433,0.00025029108,0.00024299796,0.000070403665],"domain_scores_gemma":[0.99893564,0.000463211,0.00008494478,0.00022839117,0.00020817816,0.000079710386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009219812,0.0010908633,0.0018282196,0.002282776,0.0007844567,0.0016765393,0.003038381,0.0013215245,0.0050403685],"category_scores_gemma":[0.004720383,0.000632092,0.001247972,0.0025525254,0.00055490923,0.0030144618,0.002063911,0.0014715911,0.0015147013],"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.0012048442,0.00041385653,0.003968109,0.0003827472,0.00040281017,0.00027189884,0.0002499982,0.121077776,0.030106794,0.019054655,0.021441547,0.80142504],"study_design_scores_gemma":[0.000032053318,0.00006186275,0.00036705428,0.000008039095,0.000021789721,0.000056959503,0.000030192774,0.98263127,0.0038818363,0.011156172,0.0017426915,0.0000101053865],"about_ca_topic_score_codex":0.012150272,"about_ca_topic_score_gemma":0.017068734,"teacher_disagreement_score":0.012150272,"about_ca_system_score_codex":0.0008386236,"about_ca_system_score_gemma":0.001337205,"threshold_uncertainty_score":0.024159074},"labels":[],"label_agreement":null},{"id":"W4409761909","doi":"10.1016/j.jpdc.2025.105090","title":"Experience with adapting to a software framework for a use-case in computational science","year":2025,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":0,"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":"Department of Science and Technology, Ministry of Science and Technology, India; Nova Scotia Museum","keywords":"Computer science; Software; Software engineering; Computational science; Data science; Theoretical computer science; Programming language","score_opus":0.11249134018608298,"score_gpt":0.41682119289777736,"score_spread":0.3043298527116944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409761909","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.37090597,0.0015160788,0.5366409,0.008857041,0.0010216887,0.001275941,0.0009165113,0.025341045,0.05352485],"genre_scores_gemma":[0.34760657,0.0012852268,0.60993785,0.0024837826,0.00016278522,0.0005886692,0.0026658205,0.01120056,0.024068687],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9920962,0.0035071552,0.00050054275,0.00083089684,0.0023794528,0.00068576745],"domain_scores_gemma":[0.98207563,0.00858656,0.00066491665,0.002985072,0.0032861906,0.002401569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015631795,0.00096210715,0.0003837232,0.0009414451,0.0012557242,0.0026648282,0.002919133,0.0020026078,0.0074702217],"category_scores_gemma":[0.044395633,0.00072853174,0.0011146994,0.0008334788,0.0018605262,0.0051178867,0.005539781,0.00390484,0.0038918178],"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.00053286925,0.002975705,0.030855818,0.0014300981,0.00013836578,0.005445664,0.079834536,0.020894194,0.04774923,0.026402038,0.09224718,0.6914943],"study_design_scores_gemma":[0.00022344086,0.0014468457,0.015551256,0.0013152169,0.00015006174,0.0049994374,0.012688731,0.06550198,0.032946553,0.021405201,0.8432929,0.00047850885],"about_ca_topic_score_codex":0.0031996304,"about_ca_topic_score_gemma":0.0072406023,"teacher_disagreement_score":0.015631795,"about_ca_system_score_codex":0.0016351676,"about_ca_system_score_gemma":0.0028995587,"threshold_uncertainty_score":0.082669795},"labels":[],"label_agreement":null},{"id":"W4411371930","doi":"10.1016/j.jpdc.2025.105134","title":"QPOPSS: Query and Parallelism Optimized Space-Saving for finding frequent stream elements","year":2025,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"ASTER","funders":"H2020 Marie Skłodowska-Curie Actions; HORIZON EUROPE Framework Programme; Vetenskapsrådet; Energimyndigheten; European Commission","keywords":"Computer science; Parallel computing; Parallelism (grammar); Space (punctuation); Query optimization; Database; Operating system","score_opus":0.016478283240236122,"score_gpt":0.28756216858391154,"score_spread":0.2710838853436754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411371930","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.068515584,0.0016144053,0.91547346,0.00040869333,0.00025294608,0.0003196291,0.0012567159,0.010044306,0.002114259],"genre_scores_gemma":[0.34598297,0.00066642667,0.64561725,0.00018480145,0.00018311622,0.00032528237,0.003270498,0.00067674933,0.0030929404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983216,0.00024539215,0.00016089188,0.000268041,0.0008346034,0.00016944745],"domain_scores_gemma":[0.9964109,0.0013387402,0.00032318546,0.0011541983,0.00054014585,0.00023289924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016975793,0.0010631786,0.0013587051,0.0014457213,0.00065195194,0.0019528666,0.0031332192,0.00061450567,0.0025307885],"category_scores_gemma":[0.00693492,0.00055664673,0.00078579923,0.0024192412,0.0010410636,0.002531651,0.0027885563,0.0010139878,0.0010649703],"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.001837324,0.0004883691,0.012311078,0.0007417551,0.00028403767,0.0002746306,0.0006538822,0.19976737,0.040795136,0.021537459,0.032006416,0.6893026],"study_design_scores_gemma":[0.00014953414,0.00022892746,0.000938062,0.000018840497,0.000040366114,0.00016181405,0.00011111712,0.9695952,0.011499208,0.01133766,0.0058942265,0.000025086896],"about_ca_topic_score_codex":0.00458013,"about_ca_topic_score_gemma":0.006125977,"teacher_disagreement_score":0.00458013,"about_ca_system_score_codex":0.0008630731,"about_ca_system_score_gemma":0.003140584,"threshold_uncertainty_score":0.009106934},"labels":[],"label_agreement":null},{"id":"W4411488214","doi":"10.1016/j.jpdc.2025.105139","title":"Dispersion of mobile robots on directed anonymous graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Optimization and Search Problems","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 Ottawa","funders":"","keywords":"Computer science; Robot; Theoretical computer science; Artificial intelligence","score_opus":0.010369928098864294,"score_gpt":0.2679163254368854,"score_spread":0.25754639733802115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411488214","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.34911922,0.00017031586,0.64430684,0.00045885405,0.00003138316,0.00015693705,0.00024378109,0.0010785976,0.004434142],"genre_scores_gemma":[0.7885092,0.00016012636,0.20509033,0.0000759451,0.000021580663,0.0001304331,0.00041326467,0.00009184101,0.0055072536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939275,0.00014488473,0.00004091037,0.00017317363,0.00014276073,0.00010556675],"domain_scores_gemma":[0.99731547,0.0015452984,0.00036970113,0.0004163523,0.00021525314,0.0001378193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047666987,0.0005225191,0.00053255836,0.0007044637,0.000874304,0.0008022494,0.001257903,0.00083954993,0.0012114858],"category_scores_gemma":[0.004716829,0.00046851582,0.00053887937,0.0007474056,0.00094653445,0.0015891258,0.0017383149,0.0007778132,0.00026712526],"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.00036149664,0.000058639467,0.002249814,0.00013683402,0.000040796953,0.00034926698,0.00053222175,0.89166903,0.010796111,0.033877462,0.001705602,0.058222882],"study_design_scores_gemma":[0.000040934006,0.00006347031,0.00046829306,0.000012152988,0.0000121573,0.00011150853,0.00021157917,0.94228303,0.005413589,0.048899703,0.002468768,0.000014845799],"about_ca_topic_score_codex":0.0040277485,"about_ca_topic_score_gemma":0.004147413,"teacher_disagreement_score":0.0040277485,"about_ca_system_score_codex":0.0011355554,"about_ca_system_score_gemma":0.00077868346,"threshold_uncertainty_score":0.00823909},"labels":[],"label_agreement":null},{"id":"W4411689634","doi":"10.1016/j.jpdc.2025.105138","title":"Topology-aware GPU job scheduling with deep reinforcement learning and heuristics","year":2025,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); York University","funders":"IBM Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Anesthesiologists' Society","keywords":"Computer science; Heuristics; Reinforcement learning; Scheduling (production processes); Parallel computing; Job shop scheduling; General-purpose computing on graphics processing units; Artificial intelligence; Mathematical optimization; Computer graphics (images); Operating system; Graphics","score_opus":0.009154864165384203,"score_gpt":0.25296267817950746,"score_spread":0.24380781401412327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411689634","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.12059371,0.00086865533,0.8624172,0.0009781533,0.00044964487,0.000159377,0.000264263,0.0037381675,0.010530963],"genre_scores_gemma":[0.8916704,0.00010475597,0.10477432,0.00025574263,0.00007524329,0.00008939998,0.00022251517,0.00025330394,0.002554242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950707,0.00012434841,0.000021278782,0.00011275901,0.0000859882,0.00014848093],"domain_scores_gemma":[0.9980672,0.0010782826,0.00013538997,0.0001729301,0.0002828322,0.00026334912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086604746,0.00085602177,0.0015053414,0.0008232147,0.0007379428,0.0011726805,0.0021991052,0.0012662194,0.004303117],"category_scores_gemma":[0.0039805984,0.00067660044,0.0005702143,0.00073707796,0.000777987,0.0013233538,0.0012107678,0.0017056551,0.0006357836],"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.00020151894,0.000146486,0.0007394746,0.00003847091,0.00002833428,0.000034022672,0.000026832598,0.94998026,0.0009894886,0.002497679,0.0025402743,0.042777147],"study_design_scores_gemma":[0.000007400934,0.000008127367,0.000028857603,0.0000014979119,0.0000019201586,0.0000023196772,0.0000040752934,0.9988148,0.00009665566,0.00096858904,0.000064161475,0.0000016436445],"about_ca_topic_score_codex":0.01398022,"about_ca_topic_score_gemma":0.018845668,"teacher_disagreement_score":0.01398022,"about_ca_system_score_codex":0.0014031129,"about_ca_system_score_gemma":0.003094984,"threshold_uncertainty_score":0.027797699},"labels":[],"label_agreement":null},{"id":"W4413275926","doi":"10.1016/j.jpdc.2025.105170","title":"A scheduler to foster data locality for GPU and out-of-core task-based linear algebra applications","year":2025,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Parallel Computing and Optimization Techniques","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":"École de Technologie Supérieure; Hôpital Notre-Dame","funders":"Conseil National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Computer science; Locality; Parallel computing; Linear algebra; Task (project management); Core (optical fiber); Mathematics","score_opus":0.051742038856388915,"score_gpt":0.3392052337675418,"score_spread":0.2874631949111529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413275926","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.25168616,0.0007700529,0.7234058,0.0009321399,0.0012928325,0.00039933057,0.00026978654,0.008857218,0.012386792],"genre_scores_gemma":[0.77731925,0.00017954964,0.21450013,0.00038073238,0.00021647743,0.00013822789,0.0003087399,0.00055362965,0.0064032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995788,0.000085548556,0.000031558688,0.00006957961,0.00014812863,0.00008635876],"domain_scores_gemma":[0.9983358,0.000265039,0.00008679151,0.0003180644,0.00064200244,0.0003524902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087429065,0.00043052118,0.0005247944,0.00046780004,0.0011417413,0.0010467302,0.0017247496,0.00039162993,0.003057507],"category_scores_gemma":[0.0028807798,0.00033533448,0.00032293334,0.0005983308,0.0004319542,0.00086016476,0.0014577002,0.0009264276,0.0008930341],"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.0034317488,0.0029116848,0.0134192305,0.00038636383,0.00030778826,0.0006994071,0.0009205542,0.18336143,0.27541488,0.06642701,0.06338762,0.38933235],"study_design_scores_gemma":[0.00038646872,0.00038907735,0.0012544129,0.000013136645,0.00007603527,0.0001005043,0.000096060416,0.9449443,0.028223481,0.010310625,0.014163042,0.000042835116],"about_ca_topic_score_codex":0.0033557538,"about_ca_topic_score_gemma":0.009066742,"teacher_disagreement_score":0.0033557538,"about_ca_system_score_codex":0.0007083143,"about_ca_system_score_gemma":0.0037625686,"threshold_uncertainty_score":0.010228395},"labels":[],"label_agreement":null},{"id":"W599153350","doi":"10.1016/j.jpdc.2015.06.004","title":"Tradeoffs between cost and information for rendezvous and treasure hunt","year":2015,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Rendezvous; Treasure; Computer science; Traverse; Advice (programming); Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Node (physics); A priori and a posteriori; Situated; Network topology; Topology (electrical circuits); Combinatorics; Computer network; Mathematics; Telecommunications; Artificial intelligence; Physics","score_opus":0.05024629657989928,"score_gpt":0.28615009572103967,"score_spread":0.2359037991411404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W599153350","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.7097361,0.0040516625,0.2169172,0.003777986,0.00023696003,0.00014844823,0.000567237,0.0011621866,0.06340219],"genre_scores_gemma":[0.9865566,0.00030214572,0.010387985,0.000052992917,0.00004030124,0.000021285761,0.00008202617,0.00011063416,0.0024460019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977731,0.0007340461,0.00009257967,0.00023985439,0.0006162517,0.0005441516],"domain_scores_gemma":[0.9552994,0.03809109,0.001200701,0.0028439732,0.0016002562,0.00096450705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038104213,0.00077943923,0.0017337598,0.0019763985,0.001047005,0.0033341455,0.0023888247,0.0028305356,0.012004069],"category_scores_gemma":[0.04361625,0.0007884552,0.0006367672,0.0015366634,0.0019795718,0.008048253,0.0025412005,0.0015280828,0.0010970519],"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.006876255,0.00042522894,0.006020481,0.00061418687,0.00019020597,0.00056805107,0.00048426056,0.599772,0.017438851,0.21600172,0.004118498,0.14749035],"study_design_scores_gemma":[0.00023105138,0.0006060215,0.003924481,0.000079824094,0.00013743246,0.0006362205,0.0005296423,0.8318446,0.008117717,0.15199201,0.001777464,0.00012359637],"about_ca_topic_score_codex":0.0022520625,"about_ca_topic_score_gemma":0.002809712,"teacher_disagreement_score":0.012004069,"about_ca_system_score_codex":0.0013852504,"about_ca_system_score_gemma":0.0012591645,"threshold_uncertainty_score":0.040157616},"labels":[],"label_agreement":null}]}