{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17600589,0.0013614066,0.8199704,0.0019170237,0.00045021012,0.000080474645,0.000015576055,0.00004637509,0.00015258756],"genre_scores_gemma":[0.969611,0.0001496115,0.029537287,0.00026997694,0.0004019223,3.6922316e-7,0.000008542005,0.0000074644977,0.000013857759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978379,0.00017026,0.0007439771,0.00028391858,0.00047886127,0.00048506318],"domain_scores_gemma":[0.99786407,0.0005985568,0.00067034404,0.000306753,0.0003419763,0.00021832764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007829636,0.00024850218,0.0004203484,0.00009919499,0.0009433927,0.00024076572,0.0012279847,0.000074367505,0.0000029341943],"category_scores_gemma":[0.00015455004,0.00017249043,0.0002205218,0.0005052936,0.00029023457,0.00035986307,0.00063673937,0.00057573395,0.000006070294],"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.00031868697,0.002683881,0.11126527,0.00024593004,0.0019398887,0.0040955585,0.01706921,0.08916217,0.00072297757,0.25251126,0.043102186,0.476883],"study_design_scores_gemma":[0.004481644,0.0011960776,0.18298572,0.00050118583,0.0001528504,0.015083402,0.0019351955,0.72817785,0.0003437955,0.025448756,0.038323477,0.0013700253],"about_ca_topic_score_codex":0.000021539243,"about_ca_topic_score_gemma":0.000001498735,"teacher_disagreement_score":0.7936051,"about_ca_system_score_codex":0.000048277983,"about_ca_system_score_gemma":0.00011229172,"threshold_uncertainty_score":0.72559094},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2107173,0.0006475617,0.7875155,0.00036577485,0.00039461252,0.00007103684,0.000016309308,0.000057699595,0.00021415146],"genre_scores_gemma":[0.97643,0.000076497156,0.023014216,0.000047848138,0.00037040445,4.0779938e-7,0.000042974207,0.0000066578627,0.000010974882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978066,0.00017039652,0.00088989845,0.00039841374,0.00036108718,0.00037359973],"domain_scores_gemma":[0.9983523,0.00019429269,0.0006179647,0.00047383172,0.00020551175,0.0001561139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010235693,0.00019661915,0.00043460296,0.00017771852,0.00024211523,0.00022045271,0.001298363,0.00009024654,0.0000019790455],"category_scores_gemma":[0.00011951459,0.0001726169,0.00006794719,0.0006854771,0.00007619177,0.0009601902,0.0004886104,0.00040598703,0.0000034820332],"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.00027462046,0.0011063867,0.17407791,0.00026379697,0.0003743085,0.0024845244,0.005145523,0.68974906,0.00066756346,0.03971187,0.066695355,0.019449087],"study_design_scores_gemma":[0.0020667631,0.00025948402,0.11070902,0.00024941235,0.000016971488,0.0068565705,0.00046075767,0.86475635,0.000014901607,0.0022193461,0.011932004,0.00045840204],"about_ca_topic_score_codex":0.00005703259,"about_ca_topic_score_gemma":0.000009809695,"teacher_disagreement_score":0.76571274,"about_ca_system_score_codex":0.000052941727,"about_ca_system_score_gemma":0.0002727761,"threshold_uncertainty_score":0.7039113},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25732052,0.000063675696,0.7378883,0.003670483,0.0001489847,0.0002444062,0.000013837507,0.000027924221,0.000621924],"genre_scores_gemma":[0.9890717,0.00001182793,0.010249657,0.00038130488,0.00021878991,0.000006858925,0.0000052797204,0.00000782728,0.000046730045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979113,0.00041918675,0.0004186749,0.00025839196,0.0005823436,0.00041012838],"domain_scores_gemma":[0.9979614,0.00080089003,0.00032653802,0.00030978568,0.00039727037,0.00020409463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001581689,0.00017623871,0.0002599876,0.00016697877,0.00058932666,0.00045290933,0.00069977954,0.00005097314,0.000019631447],"category_scores_gemma":[0.000050003946,0.00009709649,0.00007557279,0.00041013924,0.0001589377,0.00027552282,0.00017767935,0.0007004527,0.00003255485],"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.00029918135,0.0011160932,0.00019531783,0.00005777171,0.000398116,0.00034357075,0.0017689957,0.12396696,0.00021620076,0.7233277,0.014113854,0.13419625],"study_design_scores_gemma":[0.002858912,0.0029290265,0.010940885,0.00049802236,0.000019509149,0.0006368676,0.00076384004,0.88011193,0.0003657548,0.09868682,0.0017450724,0.0004433379],"about_ca_topic_score_codex":0.000016550306,"about_ca_topic_score_gemma":4.795532e-7,"teacher_disagreement_score":0.756145,"about_ca_system_score_codex":0.00005051135,"about_ca_system_score_gemma":0.000056253804,"threshold_uncertainty_score":0.4532684},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40720078,0.00008908363,0.5921039,0.00010501644,0.00008149798,0.000108968234,8.831957e-7,0.00009793911,0.00021189991],"genre_scores_gemma":[0.8089135,0.000012345538,0.19094336,0.00003230052,0.00007426767,0.00000137329,0.0000020424222,0.0000087034505,0.000012089402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797434,0.00014780016,0.0008843451,0.0003106223,0.00033434067,0.00034854817],"domain_scores_gemma":[0.998395,0.00029393737,0.00064998603,0.00017617409,0.0003208756,0.00016401881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010382022,0.00021423715,0.0004418008,0.00025109795,0.0001932626,0.000610378,0.0004651787,0.000058576825,0.0000014288877],"category_scores_gemma":[0.00013223603,0.00019565552,0.000074390926,0.0007599238,0.000047654277,0.0009857361,0.00034139183,0.00032434677,0.0000024098683],"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.00015281374,0.0024963324,0.10986905,0.00006880466,0.00017168686,0.12098155,0.008240925,0.06871217,0.00012004403,0.00032285985,0.0013826482,0.6874811],"study_design_scores_gemma":[0.002230425,0.0007230316,0.0079754675,0.00020215752,0.00002293189,0.08068379,0.0019949207,0.9024494,0.000010893653,0.0032790808,0.00004033453,0.00038756858],"about_ca_topic_score_codex":0.000121186196,"about_ca_topic_score_gemma":0.000008600934,"teacher_disagreement_score":0.83373725,"about_ca_system_score_codex":0.000083766994,"about_ca_system_score_gemma":0.00009791791,"threshold_uncertainty_score":0.7978601},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53880465,0.00062531745,0.46020263,0.00003071115,0.0001420529,0.000041750085,0.000046799072,0.00003591487,0.000070172166],"genre_scores_gemma":[0.99711436,0.00007292089,0.0026035132,0.000021946653,0.00015829413,0.000001644774,0.0000046896607,0.00001584464,0.0000067664723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928206,0.000012465464,0.00030922244,0.000107058535,0.00008356678,0.00020565343],"domain_scores_gemma":[0.9995523,0.000033097727,0.00014257508,0.00006457278,0.00011323843,0.00009419819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015698861,0.00014376001,0.00022902574,0.00015206255,0.00008607994,0.00004051184,0.0000868734,0.000047328656,0.000007945272],"category_scores_gemma":[0.000006323604,0.00012459542,0.00013304687,0.00017578938,0.000020263895,0.000064347754,0.000010590724,0.00016956682,5.9527827e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007685428,0.00040525084,0.022999315,0.0014267894,0.0013353777,0.000060574697,0.003267925,0.48498973,0.14184803,0.000021228363,0.005029052,0.3378482],"study_design_scores_gemma":[0.006333392,0.0007120465,0.11669078,0.0010997776,0.000940458,0.0010081822,0.0009543939,0.6756899,0.19259335,0.00073214073,0.0017467813,0.0014988072],"about_ca_topic_score_codex":0.000014282715,"about_ca_topic_score_gemma":0.000004721685,"teacher_disagreement_score":0.4583097,"about_ca_system_score_codex":0.00003115007,"about_ca_system_score_gemma":0.000009513156,"threshold_uncertainty_score":0.50808537},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12923503,0.0006470672,0.86719686,0.0018400445,0.0006371796,0.00018431114,0.000052262734,0.000108576096,0.00009869662],"genre_scores_gemma":[0.8750891,0.00001870732,0.123896934,0.0003015024,0.0006259604,0.0000019844797,0.000016290987,0.00001508855,0.000034438886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682814,0.00034365346,0.0010825177,0.00049449934,0.0005709741,0.0006802192],"domain_scores_gemma":[0.99737996,0.00062664005,0.0006644305,0.0004753774,0.00025199918,0.00060157315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006538989,0.00038358208,0.000678226,0.00022210066,0.00030709358,0.00048057135,0.0013934686,0.00012084308,0.000027532435],"category_scores_gemma":[0.00015994537,0.00032525143,0.00023402233,0.00053934177,0.000054911623,0.00031623765,0.0004442952,0.00048215236,0.00004421582],"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.00013329642,0.00050782145,0.009746325,0.000060590115,0.0005104457,0.00086203526,0.009377114,0.8239865,0.00040351786,0.0028334502,0.035798233,0.11578072],"study_design_scores_gemma":[0.0029782613,0.00090810837,0.023888735,0.0005518707,0.00006936504,0.0015021606,0.00047970522,0.95718056,0.000059435675,0.004018176,0.007351439,0.0010121975],"about_ca_topic_score_codex":0.00008897502,"about_ca_topic_score_gemma":0.0000028427905,"teacher_disagreement_score":0.7458541,"about_ca_system_score_codex":0.0000725827,"about_ca_system_score_gemma":0.000046435467,"threshold_uncertainty_score":0.99991995},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0990031,0.0021979753,0.8973122,0.00089837966,0.0001623793,0.000056007702,6.208879e-7,0.00006446309,0.0003048788],"genre_scores_gemma":[0.9760683,0.0003592889,0.023382835,0.0001295872,0.000047816855,8.58958e-7,0.0000015552597,0.0000052974856,0.0000044228173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998615,0.000091184265,0.0006032268,0.00020211528,0.00017286533,0.0003155736],"domain_scores_gemma":[0.99869037,0.00020563946,0.0004735489,0.00039093528,0.00013549007,0.000103997554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007881259,0.00014089212,0.00029580062,0.00019006777,0.00015374321,0.00040624358,0.0016126196,0.0001092616,0.0000015180258],"category_scores_gemma":[0.00022738181,0.00012328113,0.00006482068,0.0006765755,0.00005488676,0.00065879064,0.0005999504,0.0005499849,0.0000010477136],"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.000039516894,0.00020379435,0.2536806,0.000051406136,0.00007160819,0.00013511325,0.00038152948,0.54698175,0.000037257338,0.07252942,0.0009286665,0.124959335],"study_design_scores_gemma":[0.0016378367,0.000139621,0.08629903,0.0003060436,0.000011828033,0.0002203141,0.00019907087,0.8938397,0.00016608839,0.013924771,0.002890468,0.00036517877],"about_ca_topic_score_codex":0.000013121589,"about_ca_topic_score_gemma":0.0000056545423,"teacher_disagreement_score":0.87706524,"about_ca_system_score_codex":0.00004292524,"about_ca_system_score_gemma":0.000060284132,"threshold_uncertainty_score":0.50272584},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3139744,0.0021185505,0.6833919,0.00016818725,0.000119037584,0.0001138788,0.000068602196,0.000038846716,0.0000065730655],"genre_scores_gemma":[0.9466567,0.000021069533,0.0530792,0.00003303553,0.00017779825,0.0000018332069,0.00001644531,0.000009674945,0.0000042132397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980928,0.000061295985,0.00079578743,0.00030772857,0.00027440803,0.00046802836],"domain_scores_gemma":[0.9982563,0.00012853155,0.0008959101,0.00010919755,0.00043828425,0.00017175592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006173514,0.00022602608,0.0004445755,0.000099393554,0.0006952356,0.0005098975,0.00025053276,0.00009449454,0.0000025110678],"category_scores_gemma":[0.00013962273,0.00019625947,0.00010135327,0.00039716958,0.000051765295,0.0003224391,0.00014656372,0.00020776517,3.9113633e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041675533,0.0019625316,0.05394758,0.0025673434,0.0007449185,0.00023617852,0.007772049,0.6641773,0.01210862,0.047996055,0.0058671273,0.20220354],"study_design_scores_gemma":[0.0012808988,0.00011939237,0.0022875639,0.00036812483,0.000030062216,0.0004560223,0.0002862251,0.99213904,0.00008757447,0.00023099937,0.0024821584,0.00023193585],"about_ca_topic_score_codex":0.000004564746,"about_ca_topic_score_gemma":0.0000012003251,"teacher_disagreement_score":0.6326823,"about_ca_system_score_codex":0.000060381382,"about_ca_system_score_gemma":0.00004224638,"threshold_uncertainty_score":0.8003229},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057151336,0.0062240767,0.935268,0.00010714615,0.0002442123,0.00019866845,0.000011843512,0.000014601569,0.0007801174],"genre_scores_gemma":[0.99580246,0.00080734584,0.0031768102,0.000044756474,0.0001516827,0.0000014262758,0.0000034252057,0.0000073294473,0.0000047568656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792355,0.0002567256,0.00088735676,0.00022569584,0.00031649604,0.00039016866],"domain_scores_gemma":[0.9966237,0.00092256494,0.0012838022,0.00047292162,0.00056508865,0.00013190306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010638753,0.00022529186,0.00051370065,0.00003141285,0.0003741409,0.0000775542,0.0009298768,0.00009969736,0.000008982513],"category_scores_gemma":[0.000028620832,0.00011650887,0.00035254945,0.00036794582,0.00038388753,0.0001710663,0.00027664698,0.0005235734,3.1683393e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010059967,0.00076366717,0.004988843,0.000016482032,0.00065129646,0.00005553961,0.004691676,0.8655102,0.000008078161,0.025597945,0.005066852,0.0916434],"study_design_scores_gemma":[0.00068664254,0.0012878199,0.026095735,0.00008458348,0.00003936332,0.00011466539,0.0012278872,0.9623998,0.0000022441066,0.007772815,0.00014982627,0.00013866629],"about_ca_topic_score_codex":0.00006476166,"about_ca_topic_score_gemma":0.000003368611,"teacher_disagreement_score":0.93865114,"about_ca_system_score_codex":0.00006981795,"about_ca_system_score_gemma":0.00012147713,"threshold_uncertainty_score":0.4751094},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37489268,0.0007928156,0.62323374,0.0006858132,0.00024713733,0.00011401028,0.0000042429724,0.000020124895,0.000009447082],"genre_scores_gemma":[0.85674727,0.00017165432,0.14268875,0.00013922619,0.00023232817,0.0000011588095,0.00001078371,0.000007113658,0.0000017162944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998723,0.00008190459,0.0005134833,0.00019785711,0.00018576877,0.0002980228],"domain_scores_gemma":[0.9983224,0.0003872187,0.00055097655,0.00031975892,0.00023961632,0.00018001448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058466796,0.00016477673,0.0002905271,0.000057925165,0.0002947976,0.00027307245,0.0005133917,0.00012521897,0.0000015605691],"category_scores_gemma":[0.0000701927,0.00014619726,0.00008373503,0.00012938802,0.00007782899,0.00018833535,0.00030262079,0.0004793937,3.6987512e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029097515,0.00044728594,0.018245263,0.00017429395,0.0005218991,0.0001537561,0.0036780122,0.7822843,0.0018867394,0.08718082,0.0028628171,0.102273814],"study_design_scores_gemma":[0.0011099541,0.00015930367,0.0035557887,0.00007439002,0.000026314901,0.0007214984,0.000051782594,0.9884292,0.000057129084,0.0028668887,0.0027515416,0.00019623637],"about_ca_topic_score_codex":0.0000038815506,"about_ca_topic_score_gemma":0.000008716466,"teacher_disagreement_score":0.4818546,"about_ca_system_score_codex":0.000018675557,"about_ca_system_score_gemma":0.000020004118,"threshold_uncertainty_score":0.5961751},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1403915,0.001209963,0.8573217,0.00036239153,0.0005525448,0.000087166634,0.000007044263,0.000037758207,0.000029931734],"genre_scores_gemma":[0.8458434,0.00008621977,0.15327752,0.00011857288,0.00063521165,2.1123925e-7,0.000020669144,0.000010963802,0.0000072428275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981505,0.000058551435,0.00068848085,0.00036864186,0.00024786885,0.0004859125],"domain_scores_gemma":[0.9977518,0.00078337255,0.0005974443,0.00040688796,0.0002175729,0.00024294165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018396715,0.0001864834,0.00035944761,0.00010379166,0.00031133028,0.00023679835,0.0008000258,0.00011776762,3.6801168e-7],"category_scores_gemma":[0.000112762595,0.00016232299,0.0000611591,0.00028301516,0.00007055777,0.00036183494,0.0006020639,0.00032816216,1.9300083e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015326124,0.000113307055,0.007838865,0.00005171219,0.00013212726,0.0002193809,0.00030101082,0.8728165,0.00019878602,0.010423569,0.002452682,0.10529879],"study_design_scores_gemma":[0.0010536242,0.0001096041,0.004133154,0.00012091883,0.000026723457,0.0005108977,0.00014627338,0.99205536,0.000017315313,0.00011077829,0.0015168785,0.00019849052],"about_ca_topic_score_codex":0.0000047206245,"about_ca_topic_score_gemma":0.0000035615483,"teacher_disagreement_score":0.7054519,"about_ca_system_score_codex":0.00003034657,"about_ca_system_score_gemma":0.000033596138,"threshold_uncertainty_score":0.66193396},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010207497,0.00053267105,0.9881862,0.00052405166,0.00023293053,0.00018199866,0.000030060886,0.000010728265,0.000093891016],"genre_scores_gemma":[0.5826786,0.0000037054056,0.4171761,0.000056657176,0.000057555037,9.4225163e-7,0.0000010833373,0.000005350791,0.000020002375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844384,0.00022538302,0.0005418055,0.00017605949,0.00032972495,0.00028317046],"domain_scores_gemma":[0.99853754,0.00044020166,0.00044870802,0.00017858042,0.00029892082,0.00009604975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011632325,0.00016717499,0.00036505007,0.00006119658,0.00020974282,0.00008032378,0.0004761545,0.000059433554,0.0000011360431],"category_scores_gemma":[0.00028635087,0.0001035696,0.00026286856,0.00026472265,0.00009714447,0.00010546338,0.000062493134,0.00025901155,1.2836934e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005375696,0.00035577183,0.00040382036,0.00015105067,0.0005230145,0.00009808999,0.0076238774,0.043954324,0.0054000816,0.019520897,0.0014984484,0.9199331],"study_design_scores_gemma":[0.0105644,0.0012990031,0.006768205,0.0005181364,0.00017101507,0.0011981792,0.0005005734,0.84392375,0.029215919,0.101746604,0.0034291279,0.0006651134],"about_ca_topic_score_codex":0.000012508612,"about_ca_topic_score_gemma":0.0000039139168,"teacher_disagreement_score":0.91926795,"about_ca_system_score_codex":0.0000356085,"about_ca_system_score_gemma":0.00016384055,"threshold_uncertainty_score":0.42234457},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9551834,0.0005505108,0.042535584,0.00014499652,0.00023502298,0.000059504317,0.000004708201,0.00008255093,0.0012037294],"genre_scores_gemma":[0.99843276,0.000033818626,0.0010349774,0.000022273092,0.00044844815,1.8766127e-7,0.0000035921857,0.000011471925,0.000012451788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893165,0.000041900894,0.0005689037,0.0000836776,0.00014147647,0.00023236782],"domain_scores_gemma":[0.9995477,0.00008928883,0.00014301778,0.00006181417,0.00004656195,0.00011159231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032220857,0.00012490674,0.00029600435,0.00010692703,0.00006210772,0.00006691002,0.00009942176,0.000067323985,0.000009984167],"category_scores_gemma":[0.00002635114,0.00011487492,0.000067031586,0.00017627543,0.000016299951,0.00011412663,0.00002317223,0.0002577503,0.00001192047],"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.000030250034,0.0000266195,0.004904778,0.000024403409,0.000041320407,0.000041412113,0.00027184738,0.9682626,0.0013894341,0.00007429624,0.0008106665,0.024122348],"study_design_scores_gemma":[0.0012174927,0.000045454366,0.02299151,0.00009929093,0.000008874485,0.00019038492,0.00015296688,0.9722387,0.000025334835,0.000022692753,0.0028764457,0.00013081009],"about_ca_topic_score_codex":0.000021858239,"about_ca_topic_score_gemma":0.000010506645,"teacher_disagreement_score":0.043249387,"about_ca_system_score_codex":0.00008449148,"about_ca_system_score_gemma":0.000015849891,"threshold_uncertainty_score":0.46844634},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45459232,0.0003540563,0.544457,0.00014617227,0.00018513476,0.00011281417,0.000056911707,0.00005129361,0.00004425633],"genre_scores_gemma":[0.9777554,0.000019500085,0.021713614,0.00012823306,0.00026051197,0.0000010726465,0.00010000079,0.000011934342,0.000009726937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776375,0.00003940405,0.0009633718,0.00037317694,0.000345894,0.00051438826],"domain_scores_gemma":[0.9976888,0.0005346602,0.00072244223,0.0002252958,0.00032275383,0.000506093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010139456,0.00028566577,0.00055146345,0.00019180172,0.00033969583,0.0006416949,0.0006965281,0.00012613654,0.0000020162008],"category_scores_gemma":[0.000054363205,0.00022565534,0.00010237844,0.00033746223,0.000067776775,0.00037155475,0.0002964688,0.00021659622,0.0000014828661],"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.007194062,0.0028106263,0.23903896,0.0036775975,0.006491753,0.0030931188,0.07841684,0.13735771,0.018317057,0.2307065,0.01254114,0.26035464],"study_design_scores_gemma":[0.007334117,0.0018504722,0.30458143,0.0015837145,0.00027225836,0.00073801656,0.008777523,0.6281265,0.00017360131,0.030276028,0.014788122,0.0014982178],"about_ca_topic_score_codex":0.00009057842,"about_ca_topic_score_gemma":0.000015171264,"teacher_disagreement_score":0.5231631,"about_ca_system_score_codex":0.000033614026,"about_ca_system_score_gemma":0.00006771524,"threshold_uncertainty_score":0.9201958},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04280391,0.00027628455,0.9548511,0.0009720759,0.000563374,0.0002467744,0.00017318495,0.00010176357,0.000011512257],"genre_scores_gemma":[0.52119833,0.0000038662765,0.47817335,0.0003779367,0.00018476135,0.0000013451173,0.000041980988,0.000009025127,0.000009390133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979222,0.0000339077,0.000684349,0.00047692284,0.00033411616,0.00054849556],"domain_scores_gemma":[0.9980436,0.00020263603,0.00043527284,0.00067441835,0.0003242925,0.00031975913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007464035,0.00025622643,0.00047471223,0.00018067884,0.0002033511,0.00014733955,0.0021182182,0.00015258612,0.0000040715827],"category_scores_gemma":[0.00026787497,0.00021163985,0.00009296674,0.0004744799,0.000048781614,0.0004127347,0.0017006692,0.000362569,0.0000016779536],"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.0012040492,0.0011185473,0.027203,0.00013405342,0.0008219357,0.0006425334,0.0022346156,0.3759366,0.0018882721,0.010107114,0.22254175,0.35616755],"study_design_scores_gemma":[0.0026653036,0.0007514565,0.046811894,0.00015894974,0.00005522134,0.00071047875,0.0000939672,0.94268423,0.000068401045,0.0010942187,0.0044095567,0.0004963422],"about_ca_topic_score_codex":0.000016668531,"about_ca_topic_score_gemma":0.0000372806,"teacher_disagreement_score":0.5667476,"about_ca_system_score_codex":0.00004761132,"about_ca_system_score_gemma":0.00010640198,"threshold_uncertainty_score":0.86304224},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31857923,0.00041556882,0.6803451,0.00032888132,0.00020112554,0.000068963316,0.0000021949936,0.00004000754,0.000018899787],"genre_scores_gemma":[0.8109796,0.000007867981,0.18861166,0.00012681623,0.00025326165,0.0000011876703,0.000010334448,0.000008490538,7.939129e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836457,0.000103004924,0.0005677573,0.00029606404,0.0003121809,0.00035642763],"domain_scores_gemma":[0.99806845,0.00029004132,0.00059413887,0.00023720838,0.00056202133,0.0002481359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075041666,0.00018351775,0.00031312605,0.00007256275,0.0002533123,0.0003240441,0.00042819345,0.00009144342,3.1412893e-7],"category_scores_gemma":[0.00022609813,0.00016999886,0.000060587874,0.00030376107,0.000050767303,0.0004172041,0.000148108,0.00019579942,2.1772314e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009152592,0.00020909646,0.00086218293,0.000042228938,0.000043286145,0.000015344243,0.0028213114,0.95626086,0.0012920483,0.022098703,0.00014813342,0.016115258],"study_design_scores_gemma":[0.0017145529,0.00024935306,0.00080543995,0.00015569066,0.000015604155,0.00006677244,0.0003258314,0.99365294,0.00082479644,0.0017898376,0.0001990414,0.0002001255],"about_ca_topic_score_codex":0.000016805181,"about_ca_topic_score_gemma":0.0000016690459,"teacher_disagreement_score":0.49240035,"about_ca_system_score_codex":0.00008795041,"about_ca_system_score_gemma":0.0001358341,"threshold_uncertainty_score":0.6932353},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008967653,0.0004627799,0.9877056,0.0019687186,0.00057483505,0.00014892548,0.0000082501465,0.000023303726,0.00013995568],"genre_scores_gemma":[0.95938975,0.00003838552,0.039708387,0.00037508228,0.00044080385,0.0000031525578,0.0000028880318,0.000005877851,0.000035670982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988597,0.00010557338,0.00046876597,0.00015066634,0.00019987959,0.00021543878],"domain_scores_gemma":[0.99873775,0.00040427662,0.00042727136,0.00014873936,0.00020161674,0.00008036027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006396088,0.00012552275,0.00021851667,0.00008032686,0.00028266245,0.00022535789,0.00035479912,0.000053554177,0.000008357305],"category_scores_gemma":[0.00004649418,0.0000788988,0.00015873427,0.00019411699,0.000026399823,0.00019259742,0.000055405686,0.00020162901,0.0000028887496],"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.00022970277,0.0007971413,0.001422921,0.00010171277,0.0007950503,0.0001220553,0.007572672,0.06151022,0.00015287031,0.26184937,0.17746341,0.48798287],"study_design_scores_gemma":[0.00070064794,0.00034126625,0.0004988569,0.00009304513,0.000009997541,0.00013212908,0.00019902365,0.9902954,0.000002906065,0.0029356023,0.0046877675,0.00010333126],"about_ca_topic_score_codex":0.0000064020896,"about_ca_topic_score_gemma":0.0000018940464,"teacher_disagreement_score":0.9504221,"about_ca_system_score_codex":0.000024501589,"about_ca_system_score_gemma":0.000008573087,"threshold_uncertainty_score":0.32174},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4929255,0.0002920275,0.50602186,0.00018598922,0.00016151514,0.000026126672,9.2811854e-7,0.00001411841,0.00037192705],"genre_scores_gemma":[0.9866602,0.000024577806,0.012980976,0.000055394106,0.00023188638,2.6100918e-7,0.0000011941149,0.0000032969692,0.000042240074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987813,0.000088387525,0.00058079476,0.00014597207,0.0001682406,0.000235299],"domain_scores_gemma":[0.99937433,0.0001155325,0.00023661111,0.000097911055,0.00008281781,0.00009282263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054696924,0.000105797066,0.00025427615,0.000083584164,0.00010716982,0.00017708131,0.00029021356,0.00005143077,0.000016663716],"category_scores_gemma":[0.000029857621,0.000086589396,0.00007596153,0.00025932086,0.000019100533,0.00029891558,0.000057341273,0.00023374075,0.000003354453],"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.000047321326,0.000078230034,0.008669943,0.000011472928,0.000028491577,0.00019960958,0.0009466439,0.8666677,0.000047929814,0.001679875,0.0010212928,0.12060153],"study_design_scores_gemma":[0.0009010473,0.00014254947,0.020815097,0.00016810557,0.0000038696403,0.00090200664,0.00018947507,0.97367996,0.0000074899044,0.00022611694,0.0028313878,0.00013292121],"about_ca_topic_score_codex":0.000026217778,"about_ca_topic_score_gemma":0.0000063214175,"teacher_disagreement_score":0.4937347,"about_ca_system_score_codex":0.000033576536,"about_ca_system_score_gemma":0.00002776053,"threshold_uncertainty_score":0.3531013},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4218197,0.000098559634,0.5773066,0.00027666916,0.00037342007,0.000066190405,0.00000956228,0.000040027015,0.000009233968],"genre_scores_gemma":[0.9526663,0.00005192133,0.046646737,0.00007053216,0.00047456732,0.0000025750792,0.00006518118,0.000017959454,0.0000042348174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971849,0.00020632402,0.0009888432,0.00043945946,0.0003926045,0.00078787905],"domain_scores_gemma":[0.9974071,0.0011242171,0.0005813589,0.00027918484,0.00031249234,0.0002956634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011777102,0.00029034188,0.0005892122,0.0002162755,0.00032424935,0.00031382137,0.0006647501,0.00024378602,0.000002138462],"category_scores_gemma":[0.0001255979,0.00026603616,0.00016842797,0.0005283541,0.00013878616,0.0002894571,0.00028075898,0.0009774974,3.545095e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001288416,0.00012415298,0.030237462,0.000015843258,0.000041240768,0.000091580754,0.00014512209,0.9281407,0.0021458117,0.020193158,0.00008303046,0.018653044],"study_design_scores_gemma":[0.0019698152,0.00012117795,0.034724455,0.00018140025,0.000013706857,0.0002537684,0.00006158851,0.961892,0.00023864665,0.00013945064,0.00012254785,0.0002814373],"about_ca_topic_score_codex":0.00002689361,"about_ca_topic_score_gemma":0.000034396762,"teacher_disagreement_score":0.5308466,"about_ca_system_score_codex":0.00007248791,"about_ca_system_score_gemma":0.00008482998,"threshold_uncertainty_score":0.9999792},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16339105,0.0009754736,0.8342703,0.0010319926,0.00020401497,0.00006378018,5.6278867e-7,0.000033974888,0.000028826744],"genre_scores_gemma":[0.97014517,0.000048577647,0.02906817,0.0005088703,0.00021439441,3.250479e-7,0.000002204886,0.0000042738584,0.000007999564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853456,0.00007759541,0.00065772695,0.00020016142,0.00018968452,0.00034029028],"domain_scores_gemma":[0.9991778,0.00013363095,0.00030264677,0.00012658737,0.000110809255,0.00014849365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066271046,0.00015467181,0.00033256385,0.00010471361,0.000114181385,0.000099262725,0.00036298696,0.00008341925,0.0000014645764],"category_scores_gemma":[0.000024503654,0.00013319665,0.000103352635,0.00030126428,0.000020153204,0.00031725207,0.00003601866,0.0003976003,7.6005153e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048817063,0.000097345954,0.014211243,0.000004213377,0.000019547051,0.00014685115,0.00028904088,0.80875486,0.000017356253,0.0012428403,0.0001166467,0.17505123],"study_design_scores_gemma":[0.0020487013,0.00009938618,0.0701139,0.00012021818,0.000011274319,0.00015145367,0.000042524585,0.9267864,0.0000014622792,0.0002568762,0.00021941726,0.00014834745],"about_ca_topic_score_codex":0.0000034403295,"about_ca_topic_score_gemma":0.000005775774,"teacher_disagreement_score":0.8067541,"about_ca_system_score_codex":0.00003155921,"about_ca_system_score_gemma":0.00004593747,"threshold_uncertainty_score":0.54316014},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057949718,0.0005352573,0.9399476,0.00044278085,0.0004759361,0.000076041055,0.0000037139484,0.00006442799,0.00050450955],"genre_scores_gemma":[0.8827621,0.000008862528,0.11655163,0.00013544214,0.0005051295,5.1932966e-7,0.00000833266,0.000010484195,0.000017496328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785554,0.00014658304,0.0007236489,0.00031207272,0.00040377185,0.00055838696],"domain_scores_gemma":[0.99819416,0.00030082153,0.00060968474,0.00029585345,0.0003251173,0.00027435122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012582042,0.0002443277,0.00053106283,0.00006962659,0.00036325736,0.00040158676,0.0006690679,0.000087433895,0.000002227085],"category_scores_gemma":[0.000075591925,0.00018212666,0.00010402847,0.0005977304,0.00006443983,0.00043779347,0.00019552873,0.00037074575,0.0000034634172],"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.000043463504,0.000058169007,0.037309766,0.000037996884,0.00008264702,0.00006219443,0.00014348012,0.9308196,0.000011265572,0.011248738,0.007073595,0.013109095],"study_design_scores_gemma":[0.002067305,0.00045375357,0.026872898,0.0008024723,0.00003430948,0.00097089185,0.00021713835,0.9528161,0.000007170383,0.0011879584,0.014131372,0.00043860846],"about_ca_topic_score_codex":0.00002840117,"about_ca_topic_score_gemma":0.0000036588444,"teacher_disagreement_score":0.8248124,"about_ca_system_score_codex":0.000043090575,"about_ca_system_score_gemma":0.00008461127,"threshold_uncertainty_score":0.742691},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3139211,0.0007821116,0.68470836,0.00034096435,0.00010135725,0.00004008602,0.0000051017273,0.000009778904,0.000091148104],"genre_scores_gemma":[0.9239333,0.00006190805,0.075796254,0.00005504771,0.00013634021,4.0343727e-7,0.0000042572315,0.0000041541794,0.000008297518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837816,0.000053892192,0.00074631034,0.0002061734,0.00032130626,0.0002941781],"domain_scores_gemma":[0.99913764,0.00010553503,0.00040830157,0.00016805752,0.0000485819,0.00013189121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055127405,0.00015413131,0.00032775736,0.00010664833,0.00009012285,0.0002447558,0.00047535158,0.000067662964,0.0000038104424],"category_scores_gemma":[0.000035148147,0.00012804382,0.00007439637,0.00024674783,0.000034304438,0.00077134516,0.0001661065,0.00024405557,0.0000060157727],"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.0000897108,0.00034819674,0.007518177,0.000020684616,0.000044096567,0.00025156964,0.0005941401,0.862415,0.0005924062,0.013218085,0.00149313,0.11341481],"study_design_scores_gemma":[0.0038233334,0.00025492787,0.11195929,0.0003569096,0.000011917818,0.0007152393,0.00042511598,0.844773,0.00008803469,0.0008919255,0.03630224,0.0003980442],"about_ca_topic_score_codex":0.000008742017,"about_ca_topic_score_gemma":0.000003256695,"teacher_disagreement_score":0.61001223,"about_ca_system_score_codex":0.000038801532,"about_ca_system_score_gemma":0.000052967785,"threshold_uncertainty_score":0.52214754},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43237534,0.0007158813,0.5666316,0.0000647716,0.000072629584,0.00002635888,9.417316e-7,0.000011159661,0.00010130079],"genre_scores_gemma":[0.9650194,0.000071445465,0.034822606,0.000043846965,0.0000380128,2.1969386e-7,0.0000015363519,0.0000026205882,2.8816532e-7],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99896944,0.00008058579,0.00041592508,0.00016892202,0.00013693572,0.00022817824],"domain_scores_gemma":[0.99932116,0.000104156155,0.00030787912,0.000095003656,0.00006803332,0.00010376388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066441117,0.0001038744,0.00020551989,0.00013913718,0.00014173395,0.00015989984,0.00015331099,0.000048977025,0.0000013031407],"category_scores_gemma":[0.00012188796,0.00009426636,0.000044132415,0.00036165724,0.000032570155,0.00038887438,0.000078727586,0.00024867852,2.9015715e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001099008,0.0005882754,0.4648393,0.00015908873,0.0001230958,0.0005387138,0.0036184944,0.009731133,0.0019390326,0.39754665,0.0005046113,0.12030171],"study_design_scores_gemma":[0.007919031,0.0012541374,0.5390974,0.00050646375,0.00006329024,0.0072644553,0.0012983965,0.2680357,0.0010443544,0.16892856,0.0033826178,0.0012055639],"about_ca_topic_score_codex":0.000019850466,"about_ca_topic_score_gemma":0.00000921263,"teacher_disagreement_score":0.5326441,"about_ca_system_score_codex":0.00002473824,"about_ca_system_score_gemma":0.000042666714,"threshold_uncertainty_score":0.38440704},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57485884,0.0008517716,0.42402726,0.00013975966,0.000037792073,0.000038000053,0.000001733987,0.00002493928,0.000019914647],"genre_scores_gemma":[0.9448172,0.00026150394,0.05484807,0.000011850567,0.000051385956,3.4165643e-7,0.0000016624564,0.000007560255,4.1594637e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991592,0.000024691772,0.0004098956,0.00008369672,0.00010861915,0.00021386806],"domain_scores_gemma":[0.9993093,0.0004092694,0.0001028826,0.0000853461,0.000037475784,0.000055703582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022595437,0.00011863665,0.0003027015,0.00005282626,0.00007886317,0.000011925103,0.00012142425,0.00008155732,0.0000012001415],"category_scores_gemma":[0.00009845962,0.00008480813,0.000043287502,0.00018417911,0.0002969222,0.00005338582,0.000057936995,0.00045760095,1.1838536e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020696627,0.000025047675,0.00035489144,0.000011202329,0.000023733492,0.00006299676,0.000046363082,0.97200316,0.000018223614,0.0046031238,0.00011962927,0.022710918],"study_design_scores_gemma":[0.0004948087,0.00009696268,0.011657806,0.0001228389,0.000008604036,0.00023215379,0.00014421373,0.9830379,0.000015018976,0.0040718955,0.000024307967,0.00009347797],"about_ca_topic_score_codex":7.8498863e-7,"about_ca_topic_score_gemma":0.00000115695,"teacher_disagreement_score":0.36995837,"about_ca_system_score_codex":0.000027939948,"about_ca_system_score_gemma":0.000005807473,"threshold_uncertainty_score":0.34583753},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4756667,0.0002001487,0.52369326,0.00009088354,0.00008274624,0.00024680205,9.514501e-7,0.0000106194175,0.000007903812],"genre_scores_gemma":[0.96363103,0.000047274974,0.036007237,0.00017184736,0.00011930425,0.0000060248317,0.000004667051,0.000008252945,0.000004370396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985233,0.00011519644,0.00055098295,0.0002420959,0.0001675188,0.0004008915],"domain_scores_gemma":[0.99894035,0.0002624546,0.00034376298,0.00015403636,0.00013141274,0.00016800458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006398534,0.00015502721,0.00029662356,0.00015507422,0.00012760563,0.00033871114,0.00034561602,0.00005019148,0.0000040996147],"category_scores_gemma":[0.000044102253,0.00013847281,0.000068286696,0.0002870073,0.00004536262,0.0004110783,0.00040939677,0.00023819401,7.4511985e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017867666,0.00005200321,0.0044410173,0.000040776365,0.000042087915,0.000032711938,0.00037954454,0.96624774,0.000045008936,0.0004959102,0.00069060613,0.027514733],"study_design_scores_gemma":[0.0011994609,0.00017235332,0.010141997,0.00018802326,0.000012699971,0.000029216946,0.00023776897,0.9869956,0.0000051211982,0.0006125872,0.00026397945,0.00014122171],"about_ca_topic_score_codex":0.00005992212,"about_ca_topic_score_gemma":0.0000057139805,"teacher_disagreement_score":0.4879643,"about_ca_system_score_codex":0.00008602865,"about_ca_system_score_gemma":0.000031755986,"threshold_uncertainty_score":0.56467575},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011449442,0.00044723216,0.9867349,0.0006650407,0.00009309819,0.00015325293,0.0000026505213,0.000095668634,0.0003586726],"genre_scores_gemma":[0.7603792,0.000059230886,0.23924804,0.000167022,0.00011035845,0.000004149372,0.000009250511,0.000006734517,0.000016050446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815065,0.00016435258,0.0007743952,0.00028391377,0.00030069333,0.00032597498],"domain_scores_gemma":[0.99858457,0.00020297607,0.0005581328,0.0002967539,0.00018789437,0.00016968687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010301957,0.00018915659,0.00037062346,0.00022394604,0.00017337891,0.00017870429,0.0006906918,0.000058589394,0.0000027953586],"category_scores_gemma":[0.000076227676,0.00017239597,0.00009302495,0.0003265735,0.000049249225,0.00024920513,0.00025813203,0.00028319412,0.000004450199],"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.00004206783,0.00031170115,0.00460522,0.000050270028,0.000053244534,0.00004329904,0.0003102172,0.8990212,0.000099384524,0.049880523,0.0047363164,0.040846538],"study_design_scores_gemma":[0.0013837036,0.00018996852,0.004965505,0.00010456602,0.000011915403,0.00025129959,0.00003338341,0.9672162,0.00005444798,0.013538163,0.011969476,0.00028136006],"about_ca_topic_score_codex":0.0000056413123,"about_ca_topic_score_gemma":6.065672e-7,"teacher_disagreement_score":0.74892974,"about_ca_system_score_codex":0.000060842583,"about_ca_system_score_gemma":0.00006198596,"threshold_uncertainty_score":0.7030104},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07909353,0.00032876185,0.9196832,0.00034946259,0.00014887289,0.00033261068,0.0000064389415,0.000055251432,0.0000018655905],"genre_scores_gemma":[0.5307455,0.000007219791,0.46909606,0.000026287193,0.000084735206,0.000005247166,0.000024359852,0.000008731256,0.0000018340396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789286,0.00024982446,0.0006196103,0.00026116296,0.00049614324,0.0004804282],"domain_scores_gemma":[0.99768376,0.00058299646,0.00073117315,0.00011668082,0.0005811511,0.00030424376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010554466,0.00021810435,0.0004054512,0.00019261896,0.00053294573,0.000323982,0.00020450643,0.00008407801,0.0000042207703],"category_scores_gemma":[0.0002101163,0.00017610715,0.000075391086,0.00024667513,0.00005541711,0.0005608697,0.00008604939,0.0002771474,2.8980332e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012995444,0.00011270779,0.0041302294,0.000048879298,0.00010744001,0.0000037443524,0.00012103921,0.9928495,0.00017429056,0.0014305352,0.000028275845,0.0008633879],"study_design_scores_gemma":[0.00523739,0.00035814018,0.0035601673,0.00010894685,0.00008210996,0.00011023459,0.000027434691,0.9901486,0.000023812217,0.00011786294,0.000012787967,0.0002124827],"about_ca_topic_score_codex":0.000016578786,"about_ca_topic_score_gemma":4.0388434e-7,"teacher_disagreement_score":0.451652,"about_ca_system_score_codex":0.000099827346,"about_ca_system_score_gemma":0.00013280251,"threshold_uncertainty_score":0.7181441},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2006788,0.0004462223,0.79720896,0.0003428379,0.00041804218,0.00021817502,0.000013808394,0.0000632979,0.0006098403],"genre_scores_gemma":[0.9819694,0.000013823297,0.01754404,0.00020843501,0.00021060203,0.0000015373746,0.000023523466,0.000010237643,0.000018397977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680835,0.000035551602,0.0013485469,0.00034516418,0.0006455796,0.00081679365],"domain_scores_gemma":[0.9973203,0.00016063947,0.0012199196,0.0002564319,0.00070383167,0.00033888762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023056723,0.00027710467,0.00051109976,0.00014176281,0.00046810642,0.00043118544,0.0005844677,0.00009854801,0.0000027537478],"category_scores_gemma":[0.00011048025,0.00021364837,0.00020808836,0.0004139479,0.000078882345,0.00037295933,0.00025967718,0.00036381418,0.000004239326],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076859654,0.00215157,0.06505278,0.00077433477,0.001289133,0.0030754746,0.0031730486,0.012580845,0.0016366664,0.25040576,0.003689926,0.6554019],"study_design_scores_gemma":[0.040084854,0.011278723,0.181104,0.008248261,0.00064431946,0.020612558,0.013866061,0.43263415,0.003972,0.019372327,0.2616098,0.0065729576],"about_ca_topic_score_codex":0.0000120766545,"about_ca_topic_score_gemma":0.0000134344455,"teacher_disagreement_score":0.7812906,"about_ca_system_score_codex":0.00010187579,"about_ca_system_score_gemma":0.00012264766,"threshold_uncertainty_score":0.87123275},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14893883,0.00024580496,0.8502659,0.00025275076,0.00014083098,0.000067650704,0.000014271103,0.000034407625,0.000039506605],"genre_scores_gemma":[0.8016086,0.00003359308,0.19822091,0.000073177864,0.00004471106,4.565537e-7,0.000008936224,0.0000058007067,0.0000038287303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978347,0.00038962564,0.0009058207,0.00025060045,0.00033973632,0.0002795304],"domain_scores_gemma":[0.9976834,0.0005089406,0.0009330242,0.0002577279,0.0004972261,0.00011967801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016162624,0.00019647778,0.00055640476,0.00022006052,0.00009255742,0.000086219625,0.0006070362,0.00017853771,0.0000022688757],"category_scores_gemma":[0.00044330012,0.00016704388,0.000077251316,0.00055163057,0.00006235387,0.00015354344,0.00027628083,0.0005292589,4.014693e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002749989,0.0004390362,0.06700125,0.00008514509,0.00022072473,0.000057915124,0.0012995168,0.81975055,0.00016618296,0.033776157,0.0036412561,0.073287256],"study_design_scores_gemma":[0.0011913306,0.00036652453,0.4283053,0.00023577863,0.000010880451,0.00005375504,0.000031708954,0.56371933,0.00018913305,0.005625192,0.000050383685,0.0002206781],"about_ca_topic_score_codex":0.00017202208,"about_ca_topic_score_gemma":0.000026626298,"teacher_disagreement_score":0.6526698,"about_ca_system_score_codex":0.000043227326,"about_ca_system_score_gemma":0.00007910935,"threshold_uncertainty_score":0.6811852},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59848833,0.000106599626,0.40040615,0.00007549717,0.0006936608,0.000146418,0.000021966305,0.00004718537,0.000014198877],"genre_scores_gemma":[0.99456286,0.000009209493,0.004661261,0.00007732401,0.00059952546,0.000004503382,0.00005163864,0.000030244728,0.000003423833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981089,0.000042755204,0.00080477964,0.00024032133,0.00028865592,0.0005145709],"domain_scores_gemma":[0.9988292,0.00016326694,0.00025204438,0.00023953029,0.000191399,0.00032455396],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086338824,0.00027778215,0.00047825827,0.00015619918,0.000105350744,0.00012602074,0.0002635046,0.00022580706,0.000018838386],"category_scores_gemma":[0.00007647325,0.00027197402,0.00012356004,0.0004157275,0.00005737927,0.00016503921,0.000058599708,0.0009113912,0.0000024045207],"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.00020970729,0.00036474492,0.048507314,0.00014240686,0.00007009102,0.00006934642,0.00049905747,0.93687767,0.008088709,0.00025994904,0.0015385465,0.0033724762],"study_design_scores_gemma":[0.0028565251,0.00010308049,0.0551722,0.00018852578,0.000042366355,0.0000698399,0.00006743209,0.9402083,0.00019103363,0.00008366666,0.0006913143,0.00032570522],"about_ca_topic_score_codex":0.000020670715,"about_ca_topic_score_gemma":0.0001803058,"teacher_disagreement_score":0.39607453,"about_ca_system_score_codex":0.00010052671,"about_ca_system_score_gemma":0.00007896496,"threshold_uncertainty_score":0.99997324},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.151435,0.0036606463,0.84325683,0.0010990041,0.0003163145,0.00006891126,0.000032131244,0.00001734673,0.00011382994],"genre_scores_gemma":[0.994077,0.00019225272,0.0053374814,0.000046782938,0.00031193433,3.4751793e-7,0.000011325459,0.0000041275985,0.000018710782],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986132,0.000120798344,0.00058729877,0.00024376783,0.00020575787,0.00022921953],"domain_scores_gemma":[0.999011,0.00019645956,0.00031789296,0.00026584713,0.0000703546,0.00013847738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008093539,0.00012667547,0.00033352897,0.00008620736,0.00013866123,0.00022439973,0.0005398532,0.00004925408,0.000004342726],"category_scores_gemma":[0.000058383066,0.00010218283,0.000034981073,0.00020983709,0.00004311308,0.0004525094,0.00029889995,0.00022457614,0.0000010963126],"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.00012196829,0.0005442335,0.6162103,0.00041273946,0.0005679972,0.00068934733,0.005391991,0.03289097,0.00023778829,0.02294535,0.102122165,0.21786517],"study_design_scores_gemma":[0.0012714952,0.00016464732,0.05590341,0.00037467328,0.0000182172,0.00029578942,0.00025066463,0.92485446,0.0000039726683,0.0009532548,0.015681485,0.00022793813],"about_ca_topic_score_codex":0.00002378366,"about_ca_topic_score_gemma":0.000016695383,"teacher_disagreement_score":0.8919635,"about_ca_system_score_codex":0.000031582196,"about_ca_system_score_gemma":0.000012269588,"threshold_uncertainty_score":0.4166895},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31659022,0.0002883577,0.68193924,0.00027322205,0.00035572262,0.00023203567,0.00026381086,0.000041460356,0.00001592268],"genre_scores_gemma":[0.96117306,0.0000070224905,0.038428437,0.000033819746,0.00006613058,0.000002414919,0.00027382435,0.000012167842,0.000003144374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767464,0.00018011857,0.0010724996,0.00030029868,0.00042375267,0.00034871235],"domain_scores_gemma":[0.99603915,0.0011896933,0.0013168092,0.0003608753,0.00090561993,0.00018782778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013597291,0.0002477332,0.0005718446,0.00016132383,0.00044200895,0.000259735,0.0005238409,0.00015240772,7.5600104e-7],"category_scores_gemma":[0.0002625142,0.00022547893,0.00013342485,0.0003813151,0.000108133856,0.00025421483,0.00014289704,0.00040153574,5.3829535e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008779512,0.00024180448,0.004711484,0.00017616004,0.00007261022,0.0000045017346,0.000509638,0.9858772,0.0008451218,0.005451835,0.00039951975,0.0016222899],"study_design_scores_gemma":[0.002378106,0.00027471263,0.012067086,0.0003389393,0.000038843158,0.00007241827,0.00020538598,0.98269236,0.000025726751,0.0009191569,0.0007678026,0.00021947824],"about_ca_topic_score_codex":0.000023048719,"about_ca_topic_score_gemma":0.000017248218,"teacher_disagreement_score":0.6445828,"about_ca_system_score_codex":0.00007489861,"about_ca_system_score_gemma":0.0001798782,"threshold_uncertainty_score":0.9194764},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37857354,0.0008477124,0.61907214,0.00009700183,0.00094833894,0.00030263394,0.000074894306,0.000076905635,0.000006829184],"genre_scores_gemma":[0.8699252,0.000027020855,0.1293434,0.00006706779,0.0004924811,0.0000024006054,0.000113370836,0.000024471772,0.0000046077334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99504954,0.00020450378,0.0023083787,0.00059881667,0.0006514078,0.001187366],"domain_scores_gemma":[0.99586916,0.0010378904,0.0016433292,0.0003893452,0.00064866216,0.00041161373],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037685495,0.0004973466,0.0010903736,0.00040463536,0.00044844,0.000540087,0.0011031548,0.00021306424,7.090088e-7],"category_scores_gemma":[0.00018602352,0.0004604747,0.00022172966,0.0009753243,0.000104054634,0.00047772276,0.0003452289,0.0006016714,0.0000028710017],"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.00008058799,0.00019809186,0.003959384,0.00024946398,0.00013761398,0.00026362092,0.00062461715,0.9494122,0.000081801,0.0013994054,0.00018069125,0.04341248],"study_design_scores_gemma":[0.0031001181,0.0004922814,0.0067124236,0.00076738966,0.000035071054,0.0012305385,0.00037839968,0.9856984,0.00004950679,0.0003205758,0.00070425094,0.00051101705],"about_ca_topic_score_codex":0.00006785812,"about_ca_topic_score_gemma":0.0000033901438,"teacher_disagreement_score":0.49135163,"about_ca_system_score_codex":0.00029123016,"about_ca_system_score_gemma":0.0001841358,"threshold_uncertainty_score":0.9997847},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0419992,0.0008734021,0.9550574,0.0014003452,0.00022565652,0.00016234706,0.00019943989,0.000010871731,0.0000713629],"genre_scores_gemma":[0.9952427,0.000014069184,0.0029526777,0.000089755435,0.0015467993,0.0000041115877,0.00012721113,0.0000142520985,0.000008428412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860084,0.000064276544,0.0005225265,0.00022200299,0.00021382,0.00037653057],"domain_scores_gemma":[0.9975829,0.0008998539,0.0007179471,0.00044179335,0.00024424022,0.00011322737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008471307,0.0001859105,0.00027841213,0.0000135101845,0.001067505,0.0003383702,0.0008796315,0.000033583023,0.0000025596762],"category_scores_gemma":[0.000064833606,0.00010555473,0.00011364125,0.0001565734,0.000111747584,0.00019653275,0.00032689353,0.00041034608,8.673928e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003260306,0.0003099866,0.026733944,0.00007297495,0.0006528637,0.0000024220442,0.00042600874,0.025407782,0.00011889575,0.117683865,0.009039772,0.81922543],"study_design_scores_gemma":[0.0026112301,0.00027668898,0.048917104,0.00026426438,0.00041758013,0.000015833897,0.0032613631,0.7232138,0.000028841354,0.103616446,0.11684046,0.00053640234],"about_ca_topic_score_codex":0.000012135551,"about_ca_topic_score_gemma":4.7612627e-7,"teacher_disagreement_score":0.9532435,"about_ca_system_score_codex":0.000017971286,"about_ca_system_score_gemma":0.00009849907,"threshold_uncertainty_score":0.82104933},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017245231,0.0017403718,0.97925436,0.0009005207,0.0005322771,0.00015048099,0.000014323051,0.000048751994,0.00011366932],"genre_scores_gemma":[0.5245716,0.000091051144,0.47450176,0.00020039071,0.00048659748,9.4706246e-7,0.000011127965,0.0000110558285,0.00012549423],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976434,0.00009924088,0.00091951725,0.00034538945,0.0005134129,0.00047902693],"domain_scores_gemma":[0.9976551,0.00041075837,0.0006168391,0.00027398716,0.0006036208,0.00043967812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085818063,0.00024782916,0.00065675116,0.000091411,0.00036484006,0.00017015396,0.00064216263,0.00012095068,0.0000051835473],"category_scores_gemma":[0.00030282512,0.00020008453,0.00023224813,0.00049185485,0.00003820311,0.00035288162,0.0001952567,0.0002941743,0.000003701013],"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.0016811884,0.001209066,0.051951475,0.0004926681,0.0013736535,0.0022534668,0.0059884894,0.19480166,0.0021953618,0.12267003,0.34103987,0.27434307],"study_design_scores_gemma":[0.003323717,0.00043603804,0.011836374,0.00017952593,0.000045190453,0.0023543572,0.000096801356,0.94236714,0.000016625228,0.0022856507,0.036681596,0.00037701093],"about_ca_topic_score_codex":0.000048290385,"about_ca_topic_score_gemma":0.000002970527,"teacher_disagreement_score":0.74756545,"about_ca_system_score_codex":0.000096291704,"about_ca_system_score_gemma":0.00045329117,"threshold_uncertainty_score":0.815921},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89646155,0.0013989768,0.10138167,0.00054097583,0.00004171844,0.000088849694,0.000010036949,0.0000019147067,0.00007428376],"genre_scores_gemma":[0.9938332,0.00003974648,0.005777784,0.000051058985,0.00027473544,2.8598862e-7,0.00001062206,0.0000053758877,0.000007190412],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991099,0.00009235603,0.0003919446,0.000094350224,0.00014732836,0.00016412228],"domain_scores_gemma":[0.99917585,0.000034318313,0.00045329388,0.00013121136,0.00016269682,0.00004264773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000800398,0.00009177842,0.00014505246,0.000015898946,0.00015916734,0.000029218532,0.00020036263,0.000046735946,0.0000046139116],"category_scores_gemma":[0.000056607303,0.00005208,0.000088086475,0.00008188698,0.00007242059,0.0000051863362,0.00012419472,0.00013529437,1.8573743e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066324306,0.0005995117,0.20692599,0.00029629862,0.001741277,0.000026061827,0.0035944846,0.18081301,0.5053639,0.0003660611,0.0074106143,0.09219955],"study_design_scores_gemma":[0.005925846,0.0010440288,0.15257396,0.00038466766,0.0006053648,0.0015421537,0.008940895,0.74799824,0.036461,0.0011269645,0.04247615,0.00092075847],"about_ca_topic_score_codex":0.000008817338,"about_ca_topic_score_gemma":0.000004550962,"teacher_disagreement_score":0.56718516,"about_ca_system_score_codex":0.000008210258,"about_ca_system_score_gemma":0.00004656092,"threshold_uncertainty_score":0.21237607},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32495755,0.00026685983,0.6743159,0.00007325821,0.0002231581,0.00008081628,0.0000076210395,0.000011076545,0.00006376127],"genre_scores_gemma":[0.972165,0.00002176528,0.027623935,0.00001867052,0.00014352099,4.7129518e-7,0.000014212284,0.0000041747703,0.000008263003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986486,0.00002768647,0.000756179,0.00012885785,0.00023297612,0.00020574089],"domain_scores_gemma":[0.9982255,0.00015447594,0.0008545712,0.00013186276,0.000549487,0.00008411688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012244339,0.00010350096,0.00027518233,0.00009195692,0.00012399234,0.00005594218,0.00029634213,0.00006446159,6.7528566e-7],"category_scores_gemma":[0.00007591651,0.000089404726,0.00007336124,0.0002884739,0.00003095875,0.00036246463,0.0000547315,0.00009759998,3.74681e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058257615,0.0004827842,0.04239114,0.0013949288,0.0002490953,0.000042548323,0.0022432688,0.2983942,0.0043498776,0.02521218,0.0031254862,0.6215319],"study_design_scores_gemma":[0.001546231,0.0003687663,0.030477677,0.00034108263,0.00002015245,0.00017629885,0.00020884216,0.9645787,0.0010804656,0.0003184807,0.00070981425,0.00017350916],"about_ca_topic_score_codex":0.0000033310582,"about_ca_topic_score_gemma":8.526167e-7,"teacher_disagreement_score":0.6661845,"about_ca_system_score_codex":0.000044418714,"about_ca_system_score_gemma":0.000060740404,"threshold_uncertainty_score":0.36458188},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015508839,0.0013765503,0.9824103,0.00021699874,0.0003708484,0.00008244055,0.000008604964,0.000010568806,0.0000148280715],"genre_scores_gemma":[0.79007983,0.00010433341,0.20944843,0.00004988927,0.00030200716,9.740902e-7,0.000002760513,0.000004350151,0.0000073919964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990433,0.000056534183,0.00044183715,0.00012841847,0.00015058545,0.00017936331],"domain_scores_gemma":[0.9988633,0.00027925888,0.00048163277,0.00015551296,0.00015556243,0.00006474811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035388142,0.000097493474,0.00020077011,0.000047159763,0.0001975023,0.0001027741,0.0003927638,0.00004670647,0.0000048227885],"category_scores_gemma":[0.000042941545,0.00006338784,0.00010032132,0.00017575992,0.000033366883,0.0002007278,0.0001809002,0.00015775627,4.1170264e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000128011625,0.00009503181,0.0008655517,0.0000191993,0.00008044251,0.00001822678,0.0005139001,0.06513293,0.000055271586,0.0008222091,0.00559288,0.92679155],"study_design_scores_gemma":[0.00054556265,0.00014106739,0.003489695,0.000075839,0.000017158007,0.00023315848,0.00007112854,0.99346614,0.000017457065,0.000636865,0.0012301217,0.0000757981],"about_ca_topic_score_codex":0.0000063239695,"about_ca_topic_score_gemma":3.9463427e-7,"teacher_disagreement_score":0.9283332,"about_ca_system_score_codex":0.00001657911,"about_ca_system_score_gemma":0.000009820652,"threshold_uncertainty_score":0.25848812},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13558586,0.008670942,0.85225743,0.002630867,0.000583772,0.00016443632,0.0000021639964,0.000019001467,0.00008551846],"genre_scores_gemma":[0.98281574,0.0025435453,0.014042755,0.00010881076,0.00046592337,0.0000010410869,0.0000021871022,0.000007562499,0.000012448277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848187,0.00023049873,0.00048218094,0.00020949334,0.0003143458,0.00028163387],"domain_scores_gemma":[0.9989873,0.00012800825,0.0003140128,0.0002288484,0.00016688419,0.00017494657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009906336,0.00013990703,0.0002870791,0.00011096114,0.000078964236,0.000094406,0.00042749784,0.000043332177,6.6507346e-7],"category_scores_gemma":[0.000012053116,0.000104679835,0.00006476309,0.00036555144,0.00008315567,0.00021054057,0.00052603666,0.00030651255,8.0164006e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023301585,0.00008003811,0.0019103702,0.000029912731,0.000043156524,0.00003947339,0.001157811,0.77130294,9.4878453e-7,0.0012115717,0.0021419842,0.22205848],"study_design_scores_gemma":[0.0010880673,0.00019517876,0.039114434,0.00012753544,0.000012020451,0.000045047313,0.00022056603,0.94873744,0.00000313689,0.0007155972,0.009611505,0.00012947051],"about_ca_topic_score_codex":0.0000078327075,"about_ca_topic_score_gemma":0.000017763708,"teacher_disagreement_score":0.84722984,"about_ca_system_score_codex":0.0000637883,"about_ca_system_score_gemma":0.00006325911,"threshold_uncertainty_score":0.426872},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67229486,0.00019888235,0.32468662,0.002161942,0.00016389065,0.00007699211,0.00005407339,0.0000082018605,0.00035455593],"genre_scores_gemma":[0.99604446,0.000023255685,0.003373373,0.00034050355,0.0001922002,9.025927e-8,0.0000052319956,0.0000012887637,0.000019598976],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991427,0.00006613339,0.00030648866,0.00009752813,0.00018562032,0.00020152623],"domain_scores_gemma":[0.9989962,0.00060855335,0.00010965987,0.00006469298,0.000053591564,0.00016730517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043030817,0.000088216926,0.00015787844,0.000040528925,0.00024590964,0.00004388867,0.0001499616,0.000032319313,0.00012993051],"category_scores_gemma":[0.00009923052,0.00003756585,0.00006362732,0.000113572234,0.000038039096,0.000080558915,0.000008204749,0.00010879915,0.000020238607],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015048713,0.00003309089,0.031467743,0.0000039650317,0.000044192784,0.000033365348,0.00029748207,0.10996737,0.00025931248,0.00036302168,0.00047029715,0.8569097],"study_design_scores_gemma":[0.0028799644,0.0019129139,0.8096233,0.00017572632,0.00006143046,0.00017804546,0.00049949804,0.15188016,0.00010739924,0.007690206,0.024576852,0.00041450784],"about_ca_topic_score_codex":0.000022005313,"about_ca_topic_score_gemma":0.000008402906,"teacher_disagreement_score":0.85649514,"about_ca_system_score_codex":0.000004661491,"about_ca_system_score_gemma":0.000015378913,"threshold_uncertainty_score":0.18913631},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005648012,0.00077292154,0.9923618,0.00062994735,0.00026533645,0.00010912624,0.000004944571,0.000040519615,0.0001674376],"genre_scores_gemma":[0.6469975,0.00013250993,0.35243723,0.00016789489,0.00022377727,9.63972e-7,0.000012607973,0.000009792268,0.000017712506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979373,0.00020810342,0.00061212876,0.00018476637,0.0006122412,0.00044544775],"domain_scores_gemma":[0.99781203,0.00025931478,0.0005976562,0.0001857815,0.0007884862,0.00035671677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001246106,0.00017494852,0.00030365196,0.00025618717,0.00032165903,0.00029895076,0.00048379044,0.00008493361,0.000007727928],"category_scores_gemma":[0.0005135697,0.0001443318,0.000054851775,0.0010517471,0.00006444302,0.0006531487,0.00018568756,0.00037597227,0.0000029671435],"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.00004566716,0.00020706789,0.003018905,0.00003683046,0.000040187857,0.000030293202,0.00043030188,0.97344923,0.0000082155,0.0112820305,0.0010051026,0.010446147],"study_design_scores_gemma":[0.00086612144,0.00017830404,0.0043746484,0.00008765088,0.00001546543,0.00020588512,0.000071945295,0.99299455,0.000010560575,0.00023818463,0.0007903611,0.00016633817],"about_ca_topic_score_codex":0.0000030375825,"about_ca_topic_score_gemma":1.4066072e-7,"teacher_disagreement_score":0.6413495,"about_ca_system_score_codex":0.000055049928,"about_ca_system_score_gemma":0.0001679038,"threshold_uncertainty_score":0.58856803},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22858447,0.0003190575,0.769368,0.001495038,0.00015457741,0.000039595223,0.0000030492315,0.000013176626,0.000023075138],"genre_scores_gemma":[0.7029152,0.000059046524,0.2968844,0.0000579474,0.00007422804,1.8305357e-7,2.9302166e-7,0.0000042718734,0.0000044494805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984985,0.00014111144,0.000571688,0.0002349998,0.0002445228,0.00030916874],"domain_scores_gemma":[0.9987195,0.00046502944,0.0003482642,0.0001785716,0.00010081699,0.00018780955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009386275,0.00014749069,0.00033305975,0.00011214463,0.00011396595,0.00013234079,0.00038161498,0.00005304658,0.0000031657787],"category_scores_gemma":[0.00038265804,0.0000904714,0.000064654814,0.00026148444,0.000054652068,0.0003851009,0.00043995702,0.0002076633,9.739639e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027114982,0.00018117648,0.027403815,0.000043542528,0.000034089753,0.00024934267,0.00044502213,0.00074056134,0.002985252,0.006356044,0.00016391497,0.9613701],"study_design_scores_gemma":[0.00733666,0.0010365006,0.3736542,0.0019184091,0.000028460268,0.00073099555,0.00025436975,0.43855593,0.00088506076,0.17440422,0.0004023493,0.00079287397],"about_ca_topic_score_codex":0.000016790336,"about_ca_topic_score_gemma":9.3901673e-7,"teacher_disagreement_score":0.96057725,"about_ca_system_score_codex":0.000033023596,"about_ca_system_score_gemma":0.00003184224,"threshold_uncertainty_score":0.36893168},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10251006,0.00012112835,0.8961725,0.00051483605,0.0003024569,0.00019627358,0.0000074317304,0.000025162019,0.00015015971],"genre_scores_gemma":[0.8541865,0.000022814875,0.14556369,0.00007657005,0.0001275419,0.0000012451623,0.000003941841,0.000004673352,0.000013064747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864966,0.00006764729,0.00052661076,0.00021273598,0.00024465148,0.000298673],"domain_scores_gemma":[0.99792486,0.00029821313,0.0007871013,0.00033126902,0.00046259764,0.00019596072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010437563,0.00012523627,0.00028837548,0.000060027138,0.0008938965,0.00078873103,0.00090487703,0.000057665045,0.000003426196],"category_scores_gemma":[0.0004386511,0.00010487665,0.00012241722,0.000075486176,0.00008047037,0.0005216682,0.00040828704,0.00017760576,0.0000011914437],"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.00018091656,0.00080897915,0.13197091,0.00032720462,0.00031079797,0.00009845785,0.002030284,0.5418686,0.00027612358,0.031295616,0.009666591,0.2811655],"study_design_scores_gemma":[0.0015155266,0.00026032553,0.057287253,0.000079961574,0.000011075918,0.00006569723,0.000089677225,0.9339402,0.00003410964,0.0032732454,0.0032863433,0.0001566267],"about_ca_topic_score_codex":0.000006163147,"about_ca_topic_score_gemma":0.0000014153507,"teacher_disagreement_score":0.7516764,"about_ca_system_score_codex":0.00003864613,"about_ca_system_score_gemma":0.00009368485,"threshold_uncertainty_score":0.7605752},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036014553,0.000119136515,0.96269614,0.00048188315,0.00045744944,0.00015026136,0.0000093102635,0.000029095643,0.000042202326],"genre_scores_gemma":[0.9508238,0.000008253768,0.048589773,0.000118871736,0.0004096436,0.000002136479,0.000032912758,0.000008518687,0.000006080709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983316,0.00006259016,0.00074522675,0.0002705293,0.00022298191,0.00036704892],"domain_scores_gemma":[0.99768245,0.00023828528,0.0010417139,0.0003771818,0.00039542463,0.00026494477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010471294,0.00017250942,0.00034786618,0.000094901865,0.00065137143,0.00059445144,0.0006764018,0.000120513796,0.000001400908],"category_scores_gemma":[0.000098012606,0.00015917177,0.00007953937,0.00012369022,0.000076059114,0.00039805137,0.00012375052,0.00030781573,2.5957246e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003648776,0.0005078294,0.21279387,0.00012903825,0.000086641274,0.00031127894,0.00038220224,0.59528875,0.000041202442,0.017819127,0.0009856109,0.17128956],"study_design_scores_gemma":[0.0016475561,0.00024377559,0.023735013,0.0003024899,0.000019134566,0.00006422049,0.000048723286,0.9729051,9.97284e-7,0.00079450407,0.00008222775,0.0001562783],"about_ca_topic_score_codex":0.000018883962,"about_ca_topic_score_gemma":0.000009608882,"teacher_disagreement_score":0.9148093,"about_ca_system_score_codex":0.000064230786,"about_ca_system_score_gemma":0.00029405285,"threshold_uncertainty_score":0.6490836},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049980115,0.0006248227,0.9469855,0.0014099074,0.00058064697,0.00007225862,0.000019047426,0.00017960525,0.00014810705],"genre_scores_gemma":[0.9066963,0.000007855735,0.09310632,0.000041584954,0.00013165912,7.1995976e-7,0.000003818291,0.0000074275135,0.0000043020545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984738,0.000053592074,0.0005263257,0.0002802001,0.0003251449,0.00034093022],"domain_scores_gemma":[0.9973313,0.00011720163,0.0013132598,0.0008686769,0.00021798897,0.00015152333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048698022,0.00020307655,0.0004166545,0.00013239669,0.0006967376,0.0005232425,0.001972311,0.00007009174,8.1522114e-7],"category_scores_gemma":[0.00028916268,0.00016284465,0.00010828472,0.000101679034,0.00009028728,0.0008477165,0.00070777937,0.00035319652,0.0000046993855],"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.0005967992,0.0014087174,0.03874642,0.001321769,0.00095476996,0.028095877,0.0008740882,0.15632856,0.007740182,0.46732634,0.04594114,0.25066534],"study_design_scores_gemma":[0.004204314,0.00070698094,0.016091753,0.0009020922,0.00007355982,0.0027892566,0.0002788355,0.9492268,0.0032378142,0.00924964,0.012357007,0.0008819475],"about_ca_topic_score_codex":0.0000044943604,"about_ca_topic_score_gemma":6.658975e-7,"teacher_disagreement_score":0.8567162,"about_ca_system_score_codex":0.00011087571,"about_ca_system_score_gemma":0.00008985167,"threshold_uncertainty_score":0.6640612},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3154847,0.00023746012,0.6823442,0.00028257715,0.0014280701,0.00014417554,0.0000010262858,0.00003840688,0.00003936722],"genre_scores_gemma":[0.7945796,0.0000067301376,0.20337509,0.00014198077,0.0018602248,0.0000010005128,0.0000075169887,0.000013454314,0.000014362195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793106,0.00021452326,0.00084063486,0.0003004959,0.00023410736,0.00047918482],"domain_scores_gemma":[0.997827,0.0007453802,0.0006174355,0.00019907598,0.0004558746,0.00015521927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022975202,0.00020227864,0.00041473305,0.0002517514,0.00034344188,0.00024541043,0.00056357315,0.00010276542,0.0000022272397],"category_scores_gemma":[0.00030589462,0.00018847827,0.00011705355,0.00053465564,0.00007705181,0.00033403473,0.00032200624,0.00023068443,0.000005540754],"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.0020479243,0.00059573905,0.00712518,0.00013736398,0.00016210313,0.00019832396,0.0075622993,0.80881625,0.0021690533,0.0009894228,0.023878986,0.14631736],"study_design_scores_gemma":[0.0017161829,0.0006319939,0.002834413,0.00018405735,0.00001000247,0.00019574011,0.000061284605,0.9898552,0.00010947268,0.00044926725,0.0037271434,0.00022527011],"about_ca_topic_score_codex":0.0000027501922,"about_ca_topic_score_gemma":2.1835305e-7,"teacher_disagreement_score":0.47909495,"about_ca_system_score_codex":0.00009392035,"about_ca_system_score_gemma":0.0001334287,"threshold_uncertainty_score":0.76859206},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1953654,0.00096246833,0.80245584,0.0006844204,0.0002859677,0.00010140645,0.00005026073,0.000023905424,0.000070334645],"genre_scores_gemma":[0.974778,0.000053776876,0.024596548,0.00007887272,0.0004646775,5.457494e-7,0.0000049796295,0.000006039354,0.000016570057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987639,0.000052402564,0.0004449493,0.00024592946,0.00018895742,0.0003038719],"domain_scores_gemma":[0.99868155,0.00019058833,0.00039638337,0.00017868027,0.0003508747,0.00020192904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005615097,0.00016093142,0.00035316515,0.00007787572,0.00033873113,0.0003229668,0.00038019416,0.000076889555,7.838517e-7],"category_scores_gemma":[0.00013422093,0.00013630715,0.000058428184,0.00015360121,0.00013016575,0.00042630613,0.00031129672,0.00014364476,3.4781758e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021283338,0.0007928656,0.058816165,0.0012476416,0.0014985569,0.00071432383,0.014243083,0.004323242,0.005121209,0.41447064,0.05848247,0.43816146],"study_design_scores_gemma":[0.01177899,0.0021580153,0.036563765,0.00079924386,0.000105023326,0.0015373093,0.0013018358,0.8942156,0.00021820377,0.013837441,0.036606207,0.0008783714],"about_ca_topic_score_codex":0.000023974422,"about_ca_topic_score_gemma":0.000009576118,"teacher_disagreement_score":0.88989234,"about_ca_system_score_codex":0.0000293009,"about_ca_system_score_gemma":0.000061748826,"threshold_uncertainty_score":0.5558444},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032084037,0.00033745985,0.96662927,0.00053438806,0.00012698962,0.00019472497,0.000026548398,0.00004511036,0.000021500671],"genre_scores_gemma":[0.5817568,0.000015101227,0.41802445,0.0000491834,0.00012332526,0.0000039252773,0.000023017528,0.0000028227519,0.0000013657767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989025,0.000024482322,0.00055376923,0.00017594437,0.00015893359,0.00018439481],"domain_scores_gemma":[0.99778175,0.00018068419,0.00075617636,0.00026964105,0.00095129607,0.00006046978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028323493,0.00011381818,0.00027520093,0.00010916914,0.00017054645,0.000056094064,0.00051747664,0.000064917054,0.0000026965179],"category_scores_gemma":[0.0002971505,0.000096168005,0.00007105752,0.00024894997,0.0001425324,0.0003355372,0.000204824,0.00011262922,8.191698e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010747792,0.0003932307,0.0023323128,0.0002937404,0.00041814838,0.00003305284,0.0017914512,0.033511434,0.012156267,0.33074424,0.03187299,0.5863457],"study_design_scores_gemma":[0.0009511253,0.00051338883,0.0013577812,0.000069902024,0.000032471555,0.00016830635,0.00035657056,0.96672887,0.0012076214,0.026201772,0.00223151,0.00018068275],"about_ca_topic_score_codex":0.000001986298,"about_ca_topic_score_gemma":0.0000014226453,"teacher_disagreement_score":0.9332174,"about_ca_system_score_codex":0.000033618864,"about_ca_system_score_gemma":0.000057977097,"threshold_uncertainty_score":0.39216173},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19534478,0.00020567088,0.8024333,0.00017453285,0.0016082922,0.000109160515,0.0000015843772,0.0000331619,0.000089536086],"genre_scores_gemma":[0.9788825,0.000015938153,0.020063477,0.00008395545,0.00091358786,7.015437e-7,0.0000064930296,0.000009227991,0.000024116258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777246,0.000444767,0.0006912658,0.0002877771,0.00042928004,0.0003744809],"domain_scores_gemma":[0.9976347,0.00076977676,0.00038853465,0.00029558613,0.0007281846,0.00018322465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024519723,0.00014923043,0.00032224169,0.00021650693,0.00028073712,0.0004683185,0.00049342227,0.00018145745,0.000015232812],"category_scores_gemma":[0.00017231026,0.00012626074,0.00010522559,0.00054084655,0.000031795204,0.0007957501,0.00020197222,0.0008064832,0.0000104697465],"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.00004286193,0.000052067826,0.0029957257,0.00001235344,0.000032420397,0.000012309199,0.00057627977,0.9680263,0.00001812791,0.008890839,0.00031462742,0.019026093],"study_design_scores_gemma":[0.00046533853,0.000452772,0.00485075,0.00024811132,0.0000049856303,0.00014190288,0.00037962478,0.9884006,0.0000039038564,0.003927017,0.000981045,0.00014397464],"about_ca_topic_score_codex":0.000019262958,"about_ca_topic_score_gemma":0.000004733872,"teacher_disagreement_score":0.78353775,"about_ca_system_score_codex":0.00009406353,"about_ca_system_score_gemma":0.00004918901,"threshold_uncertainty_score":0.5148763},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15706222,0.00033423307,0.8414325,0.0006101173,0.0002681525,0.00015414343,0.000016496624,0.00007443764,0.000047690595],"genre_scores_gemma":[0.96282834,0.000015881631,0.0368064,0.0001324481,0.0001625658,0.0000014224735,0.000027426653,0.0000109089015,0.000014622646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820375,0.000066366454,0.0006852734,0.00031671743,0.0003121097,0.0004157657],"domain_scores_gemma":[0.99804354,0.0003565998,0.0007176395,0.00031697133,0.00032913082,0.00023609246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028781622,0.00021836007,0.00040383657,0.00010868866,0.00021374063,0.00022468592,0.0007279668,0.00007871974,0.000012296055],"category_scores_gemma":[0.000083849234,0.0001904314,0.00010666884,0.00071564893,0.000039849532,0.00056287134,0.00031974431,0.00040609136,0.000019019988],"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.000051629322,0.00009821923,0.001594729,0.000021596017,0.00007281969,0.000042015756,0.00013410169,0.9717996,0.0015742315,0.013657966,0.001369659,0.00958341],"study_design_scores_gemma":[0.0013323886,0.00016547821,0.0079006795,0.00010323812,0.000021204436,0.00040869936,0.00007978139,0.9844843,0.00007090926,0.0042016143,0.0009497439,0.00028197624],"about_ca_topic_score_codex":0.0000021702488,"about_ca_topic_score_gemma":3.1996152e-7,"teacher_disagreement_score":0.8057661,"about_ca_system_score_codex":0.00007423122,"about_ca_system_score_gemma":0.0000782247,"threshold_uncertainty_score":0.77655673},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4552539,0.00006241435,0.54400915,0.00018265603,0.00036064698,0.0001020597,0.000002658518,0.00001753731,0.000008965036],"genre_scores_gemma":[0.96486956,0.000010699902,0.034504656,0.00011493523,0.00047992248,0.0000015866851,0.0000058503483,0.0000064818632,0.0000063134266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986983,0.00011604297,0.00046355123,0.00023909356,0.00023157673,0.00025144476],"domain_scores_gemma":[0.99901813,0.0001828347,0.00041507874,0.0001490132,0.000098888115,0.00013604872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007487616,0.00013567605,0.00024189902,0.00008971042,0.00025315135,0.00015632511,0.00026582993,0.00010808022,0.000010951238],"category_scores_gemma":[0.000035552242,0.00012684877,0.00011070254,0.00014660037,0.000024322475,0.00036207645,0.00008277272,0.00023026764,0.0000070310493],"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.0021930912,0.0013388682,0.005576112,0.00020431234,0.00023817758,0.0000673505,0.0013094816,0.43327692,0.21805054,0.017264366,0.0015178483,0.31896296],"study_design_scores_gemma":[0.0010537814,0.0013858087,0.0031441292,0.00003731469,0.000016421714,0.00008059484,0.00005800369,0.9814364,0.0048202714,0.0025594763,0.0052249413,0.0001828844],"about_ca_topic_score_codex":0.0000073936,"about_ca_topic_score_gemma":0.000005234577,"teacher_disagreement_score":0.5481595,"about_ca_system_score_codex":0.000074990676,"about_ca_system_score_gemma":0.000046775098,"threshold_uncertainty_score":0.51727426},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4777273,0.0043797567,0.51760656,0.000008524409,0.00019676001,0.000021948092,0.0000017114021,0.00003161023,0.000025836689],"genre_scores_gemma":[0.9580295,0.00007302976,0.04146815,0.000028340635,0.00037051033,2.0021288e-7,0.0000072929442,0.000019895371,0.00000309936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863005,0.00007043996,0.00054121326,0.00019076835,0.00018733078,0.0003802116],"domain_scores_gemma":[0.9991185,0.00017443081,0.00024412734,0.000082715706,0.00022454625,0.00015565302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028884594,0.00020647659,0.00037032185,0.0000663004,0.00036495173,0.00015261852,0.00008831122,0.00007163955,0.0000017849558],"category_scores_gemma":[0.000057407455,0.00018548695,0.00004207889,0.00053959497,0.000032983226,0.00016407833,0.00013083176,0.00031829078,5.5228305e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020483169,0.000014695046,0.00022291597,0.000099051074,0.000023342633,0.00011907203,0.00008451657,0.9766819,0.004122246,0.00025605466,0.000010201636,0.018345537],"study_design_scores_gemma":[0.00055571884,0.000035754136,0.0003293846,0.00061323826,0.000049369773,0.0014140477,0.00011612238,0.9944009,0.0011023829,0.0010212444,0.00015790117,0.00020392961],"about_ca_topic_score_codex":0.0000016216609,"about_ca_topic_score_gemma":3.8050956e-7,"teacher_disagreement_score":0.48030218,"about_ca_system_score_codex":0.000042852582,"about_ca_system_score_gemma":0.000046716337,"threshold_uncertainty_score":0.75639385},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4255646,0.001710072,0.5722142,0.000048046375,0.00027530163,0.00010655086,0.000017643948,0.00006148107,0.0000021545204],"genre_scores_gemma":[0.9805141,0.000022597158,0.018853333,0.00004175952,0.00036455903,0.0000070923215,0.00016410433,0.000030514986,0.000001946962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985784,0.00007178947,0.00054426474,0.0001602773,0.0002728098,0.00037242315],"domain_scores_gemma":[0.99916285,0.00016341759,0.00022905871,0.00014178747,0.00012625438,0.00017663764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006476916,0.00018484815,0.00032244256,0.00007951912,0.00034703207,0.00008518664,0.0001973234,0.00006316789,0.000008799582],"category_scores_gemma":[0.00006021612,0.00018531058,0.00013175838,0.00022572314,0.000018882381,0.000069054586,0.000061661725,0.0004284569,4.450759e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006072137,0.000064734835,0.0012647853,0.000031059106,0.00007508052,0.000038295922,0.00007365978,0.99468136,0.0001584171,0.000098800985,0.0016062675,0.001846836],"study_design_scores_gemma":[0.0010469002,0.00024097969,0.0024449108,0.000033503395,0.0000570943,0.00023188323,0.00010386077,0.9934165,0.0000084932635,0.00011974352,0.0020954066,0.00020075728],"about_ca_topic_score_codex":0.0000038060055,"about_ca_topic_score_gemma":0.0000023313382,"teacher_disagreement_score":0.5549495,"about_ca_system_score_codex":0.00012799478,"about_ca_system_score_gemma":0.000033131168,"threshold_uncertainty_score":0.7556746},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41480717,0.00062192825,0.58353204,0.00018686037,0.0006618521,0.0001479103,0.000011043529,0.000026955437,0.000004238907],"genre_scores_gemma":[0.9960357,0.00000223874,0.00364008,0.00018673782,0.00010812985,0.0000044316935,0.000007613234,0.000011222986,0.0000038355215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977759,0.00022904576,0.0008480903,0.00031112353,0.00041128354,0.00042455326],"domain_scores_gemma":[0.99838537,0.00040545338,0.00065305596,0.00018413963,0.0002303012,0.00014167558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014803892,0.00019843948,0.00043741977,0.00029050626,0.0005120431,0.0002282041,0.000639241,0.000047635618,0.0000010113819],"category_scores_gemma":[0.00008042267,0.00019258256,0.00018404167,0.00036771444,0.00002191002,0.000038744754,0.00043791346,0.00043439047,4.0393843e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067421184,0.00015059792,0.0006693049,0.00004423006,0.000033477143,0.00013238967,0.0002820451,0.9879963,0.00025484018,0.006597165,0.00005836213,0.003713909],"study_design_scores_gemma":[0.0014577502,0.00037279545,0.000173283,0.00013700321,0.000014994455,0.00042694178,0.00048209022,0.9960353,0.00007588971,0.00046322218,0.00015001139,0.00021075424],"about_ca_topic_score_codex":0.00006406073,"about_ca_topic_score_gemma":0.0000016054687,"teacher_disagreement_score":0.58122855,"about_ca_system_score_codex":0.00026130487,"about_ca_system_score_gemma":0.00012273536,"threshold_uncertainty_score":0.7853289},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089481995,0.0002501176,0.9089776,0.00053584337,0.00029704845,0.00008244094,0.0000075542616,0.00006022292,0.0003071737],"genre_scores_gemma":[0.97554153,0.0000023713317,0.024124505,0.00016983344,0.0001141845,0.0000016279918,0.000024333502,0.00000485338,0.00001676571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985572,0.00018238484,0.00045575443,0.00019508024,0.0004250573,0.00018449579],"domain_scores_gemma":[0.9990325,0.00011032881,0.00047970703,0.00016509726,0.00012387807,0.00008848167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081284944,0.00010816982,0.00018063228,0.00015632651,0.00055828085,0.00013678445,0.00042431167,0.000024596471,0.0000053169856],"category_scores_gemma":[0.000041470266,0.00009969245,0.00007946515,0.00044462288,0.000027878123,0.000039755094,0.0003401701,0.00024610723,4.882297e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016697335,0.00014221527,0.0026866428,0.00001755367,0.000029468067,0.000013920179,0.00026412786,0.9779579,0.000012136207,0.0037923479,0.001440678,0.013626297],"study_design_scores_gemma":[0.0008588426,0.00017776265,0.005613197,0.000015891634,0.000016982945,0.00013817179,0.00033149705,0.9881969,0.00000893722,0.00044626798,0.0040976927,0.00009781859],"about_ca_topic_score_codex":0.000004614916,"about_ca_topic_score_gemma":6.79417e-8,"teacher_disagreement_score":0.8860595,"about_ca_system_score_codex":0.00007817213,"about_ca_system_score_gemma":0.00007224287,"threshold_uncertainty_score":0.42939016},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023057764,0.0009992862,0.95646054,0.006519256,0.012486323,0.00024893423,0.000016048958,0.000024235698,0.00018758948],"genre_scores_gemma":[0.9456829,0.00008655969,0.009448281,0.0013566494,0.043069,0.000008778739,0.000060246097,0.000027600187,0.00026000311],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980613,0.0001624217,0.0007113991,0.0002421823,0.0004718203,0.00035087953],"domain_scores_gemma":[0.99742126,0.0010998133,0.0008700534,0.00030253,0.00021953031,0.00008680759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014385128,0.00019624777,0.00033209022,0.00007023291,0.0009428308,0.00016181386,0.0015399593,0.000046736463,0.000018695795],"category_scores_gemma":[0.00011811534,0.00011701,0.00023368867,0.00042912117,0.000105363535,0.00015786267,0.0012021606,0.00057288306,0.000002249945],"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.00062944944,0.0002924399,0.0011918007,0.00007324633,0.00030054804,0.000060449423,0.0088625355,0.056056254,0.000066403685,0.0125268875,0.5748773,0.34506267],"study_design_scores_gemma":[0.0008216743,0.000802642,0.0026539904,0.00007947484,0.000057404104,0.00043138853,0.0014082576,0.38887143,0.00026709092,0.002733677,0.6015995,0.00027348063],"about_ca_topic_score_codex":0.0000114324275,"about_ca_topic_score_gemma":9.2434516e-7,"teacher_disagreement_score":0.9470123,"about_ca_system_score_codex":0.00012554992,"about_ca_system_score_gemma":0.00007835934,"threshold_uncertainty_score":0.7251588},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39795047,0.00023836293,0.6015116,0.00011543984,0.00006859867,0.00005532721,0.000010232118,0.000015233509,0.000034722358],"genre_scores_gemma":[0.9806939,0.000014569596,0.019178744,0.000054342298,0.000037396545,0.0000042502634,0.000011744739,0.0000027949845,0.0000023065256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854475,0.000088047396,0.000661391,0.00016581998,0.0003696525,0.00017031291],"domain_scores_gemma":[0.9986046,0.00017785147,0.0007127835,0.0002523221,0.00019340767,0.000059037462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000794446,0.000098124205,0.00037785087,0.00018997674,0.0003746013,0.000036218455,0.00049359346,0.000027484033,0.000007922338],"category_scores_gemma":[0.000019164403,0.00008250657,0.00019155767,0.0014891744,0.000041958814,0.00023575712,0.00017012162,0.00021754902,3.5671587e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021989015,0.00012507873,0.11526176,0.000065023276,0.0002103605,0.0000037583948,0.0004988752,0.8749413,0.000046253648,0.00043128745,0.00006681767,0.008327478],"study_design_scores_gemma":[0.00053080363,0.0001930875,0.095914245,0.000025391735,0.0001769576,0.000046034704,0.00021941226,0.9017235,0.000062151164,0.00015602811,0.0008321825,0.00012022511],"about_ca_topic_score_codex":0.000012059636,"about_ca_topic_score_gemma":4.8983316e-7,"teacher_disagreement_score":0.58274335,"about_ca_system_score_codex":0.00006111863,"about_ca_system_score_gemma":0.00010944173,"threshold_uncertainty_score":0.33645204},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19756685,0.00040183775,0.80110073,0.00033526003,0.00029965944,0.00008036081,0.000012890658,0.0001242943,0.00007810394],"genre_scores_gemma":[0.8747309,0.000013559195,0.12490731,0.00023513705,0.0000841491,6.2105033e-7,0.000007896877,0.000009209756,0.000011226599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978714,0.00027253287,0.0006883426,0.0002967189,0.0005042031,0.0003668179],"domain_scores_gemma":[0.9981631,0.00022083556,0.0008587445,0.00027013887,0.0003023594,0.00018479515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009172851,0.00020716818,0.00041396412,0.00022371896,0.0008559518,0.00021901318,0.00087890925,0.000043520766,0.000018109295],"category_scores_gemma":[0.000110606394,0.00019777345,0.00015092829,0.0005573958,0.00005571077,0.00030203917,0.00096350804,0.00048623633,0.0000010734501],"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.000060992126,0.00016775724,0.008920866,0.000012932966,0.00007519979,0.00023911476,0.00052442774,0.9805678,0.0001903534,0.0038043405,0.0030699123,0.0023663149],"study_design_scores_gemma":[0.0012123937,0.00032801583,0.0044782753,0.00006547122,0.00002437446,0.0014478453,0.0002840366,0.9881962,0.00006845596,0.0026470327,0.0009380446,0.0003098578],"about_ca_topic_score_codex":0.000025876378,"about_ca_topic_score_gemma":4.479257e-7,"teacher_disagreement_score":0.677164,"about_ca_system_score_codex":0.00013413683,"about_ca_system_score_gemma":0.00015356221,"threshold_uncertainty_score":0.80649674},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5262954,0.00006938584,0.47286358,0.00038687824,0.00011773194,0.000060701048,0.00008572841,0.000008696225,0.00011189221],"genre_scores_gemma":[0.99946994,0.0000073145266,0.0003533365,0.00008545567,0.000060253376,0.0000021482042,0.000012025047,0.0000044091744,0.0000050978915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985212,0.00016007705,0.00048809117,0.00014974487,0.0004901167,0.00019078267],"domain_scores_gemma":[0.9989517,0.0002226218,0.00045940347,0.0001682901,0.00011993611,0.000078093115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063056045,0.0001372486,0.00026440452,0.000085785745,0.00039107847,0.00005333108,0.00042865757,0.000027756005,0.000022645227],"category_scores_gemma":[0.000014893377,0.00009046271,0.00021441365,0.00030534595,0.00003604027,0.00016984665,0.000022913533,0.00038635347,7.085715e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027059426,0.000267458,0.000070092,0.000012931683,0.000072390896,0.000013597807,0.00056440255,0.98894054,0.0006398736,0.0028125418,0.0009935301,0.0053420393],"study_design_scores_gemma":[0.0018093456,0.0017311781,0.007084151,0.00010173126,0.000014219137,0.00032362668,0.0002319122,0.9872569,0.00025428046,0.0008858984,0.00014711144,0.0001596475],"about_ca_topic_score_codex":0.000019322079,"about_ca_topic_score_gemma":1.7824492e-7,"teacher_disagreement_score":0.47317457,"about_ca_system_score_codex":0.00009909139,"about_ca_system_score_gemma":0.00010597466,"threshold_uncertainty_score":0.36889622},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020754815,0.00013205326,0.94871205,0.04696729,0.00019693382,0.00057851657,0.00111826,0.00019151719,0.000027922724],"genre_scores_gemma":[0.4986761,0.00001642067,0.49975997,0.00082209037,0.000053629712,0.000073533214,0.0005797283,0.000016204012,0.0000023150083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975057,0.00026217176,0.00085378805,0.000526573,0.00038830095,0.00046346986],"domain_scores_gemma":[0.995373,0.0012854428,0.0011350686,0.0014363434,0.00061906537,0.0001510596],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0012823999,0.0002826146,0.00043276444,0.00023808778,0.0013839118,0.00043337574,0.006916051,0.00012974007,0.000014122061],"category_scores_gemma":[0.0043427604,0.00028436672,0.000117143856,0.0013190266,0.000046088047,0.0004693278,0.015001418,0.0008307288,8.1180127e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065004,0.0011116078,0.0012032186,0.00016126824,0.0002679491,0.000021616432,0.00048443073,0.6760937,0.00041528646,0.0052639362,0.28246352,0.031863406],"study_design_scores_gemma":[0.0012811366,0.000264562,0.00017337433,0.0000638619,0.000023425906,0.000028665168,0.0003121339,0.9158582,0.000067715824,0.07558605,0.00606968,0.00027115727],"about_ca_topic_score_codex":0.0000053662097,"about_ca_topic_score_gemma":0.0000014648135,"teacher_disagreement_score":0.49660063,"about_ca_system_score_codex":0.00035230827,"about_ca_system_score_gemma":0.0002863397,"threshold_uncertainty_score":0.99996084},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038635015,0.000046171866,0.95865124,0.0020635796,0.00022271433,0.0001246188,0.000012305439,0.00022717066,0.000017159944],"genre_scores_gemma":[0.61989725,0.000004270722,0.3796902,0.00028776572,0.00008423229,0.0000013347257,0.000014839003,0.0000073998763,0.000012731979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811107,0.00018962883,0.00057393813,0.00030274803,0.00047530353,0.00034733294],"domain_scores_gemma":[0.99836147,0.00018971901,0.00038240955,0.00028523649,0.00046643536,0.00031471348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012415068,0.00017708671,0.00032301925,0.00028911562,0.00022978563,0.00027857153,0.000737943,0.000065697444,0.0000032803646],"category_scores_gemma":[0.00006379147,0.00014653387,0.00008519645,0.001326482,0.000028137885,0.00017544265,0.00020902786,0.00020937494,0.000015569283],"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.00010009118,0.0006191414,0.0014711134,0.00007504477,0.00011194102,0.00023135445,0.0007156869,0.7712951,0.010772973,0.015936915,0.004435181,0.1942355],"study_design_scores_gemma":[0.00070072495,0.00035484662,0.018459938,0.00006634067,0.000013305395,0.00004411009,0.00006009661,0.9747068,0.0025376067,0.00095340156,0.0018893844,0.00021342456],"about_ca_topic_score_codex":0.000010623034,"about_ca_topic_score_gemma":1.8268975e-7,"teacher_disagreement_score":0.58126223,"about_ca_system_score_codex":0.000059500842,"about_ca_system_score_gemma":0.0001001762,"threshold_uncertainty_score":0.5975478},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08895513,0.0006884092,0.90872085,0.0011082971,0.00019710073,0.0001404581,0.000008369398,0.00016633247,0.0000150858705],"genre_scores_gemma":[0.8715416,0.001006662,0.127287,0.000053720254,0.00005820543,0.000006654092,0.000029558052,0.0000067232445,0.0000098662695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984525,0.000055998884,0.000646881,0.00027913155,0.0002794518,0.00028605768],"domain_scores_gemma":[0.9985804,0.00037449235,0.0004028774,0.0004091602,0.00015096065,0.00008211504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009519918,0.00012846572,0.00027881545,0.00025790388,0.000111443966,0.00022800156,0.0008324738,0.00008369361,0.000001487151],"category_scores_gemma":[0.00033045374,0.000110427405,0.000057682966,0.0010736784,0.0000689125,0.0013540329,0.0006429369,0.00030331945,0.000013796161],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050074537,0.00018732499,0.008561038,0.000080186386,0.000024539837,0.00031685177,0.0005552919,0.09979893,0.00037063527,0.01806971,0.004788557,0.86719686],"study_design_scores_gemma":[0.004296354,0.0007640109,0.13018452,0.0009023106,0.00003136165,0.0008695432,0.0041999253,0.5282002,0.0006687999,0.26864144,0.060165796,0.0010756875],"about_ca_topic_score_codex":0.0000022495308,"about_ca_topic_score_gemma":0.0000015722923,"teacher_disagreement_score":0.8661212,"about_ca_system_score_codex":0.00007268965,"about_ca_system_score_gemma":0.00005837633,"threshold_uncertainty_score":0.45030987},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50177234,0.0001606575,0.4968319,0.00039585982,0.000015575582,0.00023644802,0.00046089283,0.0000041477697,0.00012216107],"genre_scores_gemma":[0.98101866,0.0000139915755,0.018627983,0.0000040272444,0.00004516825,0.000008126944,0.00023399644,0.0000026479765,0.000045400833],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99878526,0.000062649575,0.00063652697,0.00019305103,0.00016980326,0.00015268355],"domain_scores_gemma":[0.9979424,0.0008806004,0.00039511893,0.00020485964,0.00048458652,0.00009245259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036831637,0.000106988984,0.00037319388,0.00034931488,0.00020238053,0.000057604393,0.00018677674,0.00003547418,0.0006000878],"category_scores_gemma":[0.00011297815,0.00009444108,0.00015816167,0.0011457357,0.000112525486,0.0000287757,0.00020650895,0.00014349927,1.7521322e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027288837,0.00062311086,0.8849771,0.00011747956,0.0012724532,8.1708913e-7,0.00010424297,0.003973837,0.0030566636,0.0028195125,0.0018658831,0.100916],"study_design_scores_gemma":[0.0030333963,0.00007681288,0.5652648,0.000039525046,0.0005865216,5.531895e-7,0.00070381584,0.4242316,0.0004596011,0.004383241,0.0011035816,0.00011652769],"about_ca_topic_score_codex":0.0011745173,"about_ca_topic_score_gemma":0.000043836993,"teacher_disagreement_score":0.47924632,"about_ca_system_score_codex":0.00000824652,"about_ca_system_score_gemma":0.00005861872,"threshold_uncertainty_score":0.65705407},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37199047,0.0039554937,0.62252086,0.0007440652,0.00056386646,0.000055089222,0.000003343585,0.00009491961,0.00007191694],"genre_scores_gemma":[0.992953,0.00014683971,0.0062751207,0.000097533775,0.00048572815,7.278736e-7,0.000005050279,0.000010596317,0.000025427924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986439,0.00011810986,0.0003992156,0.00026439078,0.00028632983,0.0002880712],"domain_scores_gemma":[0.9991128,0.00023781144,0.00022736195,0.000114651004,0.00013092949,0.00017645855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059296755,0.00019311387,0.0003001253,0.00017705747,0.00035996333,0.0006047774,0.00021883308,0.000074020674,0.000006746012],"category_scores_gemma":[0.00004175727,0.00014684103,0.000073091,0.00042792503,0.00007409117,0.0004252411,0.00016106154,0.00060505903,0.0000019244562],"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.0021297687,0.0007190575,0.05634314,0.0027730518,0.0015729961,0.0052216863,0.014090561,0.6243496,0.0024894434,0.06579155,0.015776046,0.20874308],"study_design_scores_gemma":[0.0011055479,0.00069044624,0.0032238215,0.00060213445,0.000038889186,0.0009925099,0.00010688388,0.9813199,0.00020232315,0.001446707,0.010008024,0.0002628068],"about_ca_topic_score_codex":0.000022032948,"about_ca_topic_score_gemma":0.0000072462303,"teacher_disagreement_score":0.6209625,"about_ca_system_score_codex":0.000038595084,"about_ca_system_score_gemma":0.00009244766,"threshold_uncertainty_score":0.59880036},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022377497,0.0013191283,0.9743615,0.0013328354,0.00010514394,0.00029512768,0.000040546285,0.00006562873,0.00010260187],"genre_scores_gemma":[0.4845158,0.00003350836,0.5152246,0.000051485582,0.00013462197,0.000007148615,0.0000141468345,0.000009270416,0.000009477386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846697,0.000049754668,0.0006116489,0.00033865738,0.0002153072,0.0003176716],"domain_scores_gemma":[0.99864745,0.00054864597,0.00026893787,0.00014087616,0.00021148114,0.00018258874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084876514,0.00020951037,0.00035958725,0.00010705645,0.0005527797,0.0006512369,0.0003225896,0.000065208216,0.0000015795339],"category_scores_gemma":[0.00003199426,0.00015273872,0.000110004104,0.00034277036,0.00005551801,0.00066026166,0.0000692055,0.0003175412,2.2376801e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017101842,0.000315789,0.0035831654,0.0008057361,0.0007449901,0.00018797783,0.0066715563,0.036813695,0.0028440827,0.51489234,0.0021253293,0.4308443],"study_design_scores_gemma":[0.00096190727,0.00041311843,0.0011588049,0.0004181301,0.00006318027,0.0010661919,0.000704525,0.98409474,0.00008952094,0.00759483,0.0031993212,0.00023574973],"about_ca_topic_score_codex":0.000028201715,"about_ca_topic_score_gemma":0.000026366375,"teacher_disagreement_score":0.947281,"about_ca_system_score_codex":0.000036214406,"about_ca_system_score_gemma":0.00017905755,"threshold_uncertainty_score":0.6279893},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4586594,0.0009071599,0.54000634,0.00006370958,0.00030215768,0.00002225349,6.9551953e-7,0.00002179859,0.000016478776],"genre_scores_gemma":[0.9988079,0.00012764732,0.00097622524,0.0000103727025,0.000067669804,1.5654554e-7,0.0000031841578,0.0000035245146,0.0000033014041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987952,0.0002366108,0.000511674,0.00013851737,0.00017852357,0.00013943898],"domain_scores_gemma":[0.99922615,0.00025941848,0.00023319435,0.000052330262,0.00017471978,0.0000541975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012917783,0.00008512377,0.00020700636,0.00020517834,0.00010625777,0.00016983064,0.00013785747,0.00006908543,0.000003003028],"category_scores_gemma":[0.00017126152,0.00007304874,0.000046587862,0.0008054707,0.000021019738,0.0003231518,0.00011057678,0.0004207523,0.0000010362153],"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.00016445872,0.00010659614,0.013685356,0.00012625295,0.00006254063,0.00013348054,0.00092338165,0.12567559,0.004681165,0.0010834741,0.00020562217,0.8531521],"study_design_scores_gemma":[0.00029965688,0.00023933563,0.088630304,0.00022955309,0.0000041795497,0.00013100648,0.000033956327,0.90900636,0.0004995793,0.0005369937,0.0003111378,0.00007796805],"about_ca_topic_score_codex":0.0001277558,"about_ca_topic_score_gemma":0.00007380072,"teacher_disagreement_score":0.85307413,"about_ca_system_score_codex":0.000041269148,"about_ca_system_score_gemma":0.00005551088,"threshold_uncertainty_score":0.2978841},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047656402,0.00093079644,0.9459872,0.0047097295,0.00034372424,0.000107206455,0.00005628388,0.00019811551,0.000010496735],"genre_scores_gemma":[0.5229208,0.000035044653,0.47687384,0.000053929823,0.00007168953,7.639698e-7,0.000035380628,0.00000771294,8.5234984e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983549,0.0000818534,0.0004609901,0.0004972721,0.0002533956,0.00035158586],"domain_scores_gemma":[0.99750555,0.00085343845,0.00024141594,0.0011773532,0.00010036081,0.00012187759],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011918667,0.0001868155,0.00029164422,0.00013724832,0.00037470623,0.0010595503,0.0041362857,0.0001293207,0.0000011569705],"category_scores_gemma":[0.0052432534,0.0001592581,0.000053707994,0.00030772915,0.0000610657,0.00052275596,0.01464882,0.00063621905,8.1760453e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017630769,0.0001382857,0.0035808943,0.00037353538,0.00019029793,0.00028808104,0.00006834519,0.8897634,0.000119222714,0.0021422654,0.018607475,0.08455187],"study_design_scores_gemma":[0.00042523773,0.0002831315,0.0005652169,0.0005847165,0.000019929355,0.00014773717,0.00003830579,0.99226147,0.00006763587,0.0045231334,0.00091449893,0.00016897921],"about_ca_topic_score_codex":0.0000034464779,"about_ca_topic_score_gemma":0.0000010786337,"teacher_disagreement_score":0.47526437,"about_ca_system_score_codex":0.00005800982,"about_ca_system_score_gemma":0.00007579565,"threshold_uncertainty_score":0.99997747},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19317734,0.0018057561,0.8039605,0.000558541,0.00023669511,0.00007350381,0.0000010240336,0.000045750727,0.00014088952],"genre_scores_gemma":[0.9798038,0.00005200567,0.01994585,0.00008106438,0.000092729315,9.205851e-7,0.0000022864137,0.000007272859,0.000014065782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985834,0.00007438981,0.00055360905,0.00024155033,0.00024267253,0.0003044304],"domain_scores_gemma":[0.9993194,0.00017094871,0.00019414292,0.00016288001,0.000051203016,0.00010143838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008348695,0.00013605724,0.00022517407,0.00021604921,0.00006750501,0.00037583613,0.0004242086,0.00003641698,0.0000026336231],"category_scores_gemma":[0.000035154117,0.00012026729,0.000077342425,0.000633778,0.000031151354,0.0003152009,0.00032171188,0.00031882248,0.0000065840995],"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.000009493448,0.000046044053,0.0010105035,0.00015974382,0.00004838717,0.0008770469,0.0006415359,0.8994688,0.000078244935,0.007698878,0.0005346793,0.08942669],"study_design_scores_gemma":[0.0004073588,0.00007046686,0.003619392,0.0004650131,0.000011390228,0.000065411325,0.00013912962,0.993132,0.0000061622936,0.001236643,0.0007215343,0.00012550424],"about_ca_topic_score_codex":0.0000110963865,"about_ca_topic_score_gemma":0.0000062280346,"teacher_disagreement_score":0.78662646,"about_ca_system_score_codex":0.00015386625,"about_ca_system_score_gemma":0.00007442703,"threshold_uncertainty_score":0.49043575},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33380616,0.0035157509,0.6614881,0.00014622975,0.0008952524,0.00004579262,3.640586e-7,0.00006921106,0.000033156288],"genre_scores_gemma":[0.9980394,0.0003142754,0.001221143,0.00001983669,0.00038822193,6.4345824e-7,0.0000016670997,0.000006055608,0.000008726281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861634,0.00016445077,0.00054905587,0.00020576364,0.00024138544,0.00022302673],"domain_scores_gemma":[0.99933934,0.00019640241,0.00018634123,0.00008384497,0.00010285273,0.00009118718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010010728,0.00012090304,0.00022590626,0.0002947724,0.0001869179,0.0005114616,0.0002044777,0.00009355954,0.0000024086853],"category_scores_gemma":[0.00008454981,0.00010386529,0.00007241068,0.0007088356,0.00001686165,0.0005889891,0.00014662395,0.00063074095,0.000003102118],"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.00006882584,0.000059433845,0.001195424,0.00022168763,0.000051977036,0.00034538753,0.0017267752,0.58057284,0.0058509763,0.0039643166,0.00016734622,0.40577504],"study_design_scores_gemma":[0.00035411073,0.0001721668,0.0009085283,0.00052712415,0.000007689262,0.0005548082,0.00022739105,0.9924208,0.00015984241,0.00068590604,0.003863499,0.0001181368],"about_ca_topic_score_codex":0.00003345401,"about_ca_topic_score_gemma":0.000004596469,"teacher_disagreement_score":0.66423327,"about_ca_system_score_codex":0.000090673646,"about_ca_system_score_gemma":0.00004770339,"threshold_uncertainty_score":0.49320355},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07686342,0.0012359624,0.9209804,0.0005113243,0.0001739724,0.00015147576,0.0000062823524,0.000049024115,0.000028143915],"genre_scores_gemma":[0.8542657,0.00020985185,0.14536047,0.0000981893,0.00004644356,0.0000031211111,0.000003878889,0.0000035770122,0.0000087956005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876577,0.00004375255,0.0005339248,0.00023413828,0.00016999467,0.00025244686],"domain_scores_gemma":[0.9986646,0.0004110783,0.00031052687,0.00015682449,0.00034085376,0.00011608179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006264617,0.00015069725,0.00031096116,0.0001406801,0.00023616287,0.00022307623,0.00031870164,0.000049958253,8.4752037e-7],"category_scores_gemma":[0.0004034059,0.0001285119,0.00007538375,0.00032623197,0.000057148358,0.00039048173,0.0002651675,0.00021374821,2.0427402e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005494894,0.0006062194,0.057492863,0.0006990898,0.00026016595,0.00010201325,0.001470057,0.066971794,0.00097214786,0.103597544,0.002819722,0.7644589],"study_design_scores_gemma":[0.0020245598,0.00077061105,0.017486788,0.0010068426,0.000056426692,0.00008399015,0.00036530677,0.8987454,0.01441644,0.047862854,0.016637297,0.0005434451],"about_ca_topic_score_codex":0.000008917798,"about_ca_topic_score_gemma":0.0000013474465,"teacher_disagreement_score":0.83177364,"about_ca_system_score_codex":0.000053345473,"about_ca_system_score_gemma":0.000085288775,"threshold_uncertainty_score":0.5240563},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4183521,0.000029769451,0.5808819,0.0004004665,0.00019393767,0.00010987492,0.000012186463,0.000008488138,0.0000113163305],"genre_scores_gemma":[0.630752,2.524457e-7,0.36903417,0.00017189451,0.000025774185,0.0000014477328,0.0000014489599,0.0000020532045,0.000010923101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735326,0.00006619944,0.0008837846,0.00049816916,0.0008619808,0.00033663673],"domain_scores_gemma":[0.99477196,0.0034668334,0.00043890913,0.00029375262,0.0008555328,0.00017303137],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0047001983,0.00012576577,0.00030152118,0.00071739504,0.0005202101,0.0011399243,0.0006708664,0.000030878793,0.000004268842],"category_scores_gemma":[0.00919124,0.000090133566,0.000055619075,0.0027219893,0.0001825154,0.00046406526,0.0004477004,0.00016931488,0.0000011678633],"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.00026284583,0.000109848486,0.07739461,0.000015946589,0.000019498968,0.00031163733,0.0018142009,0.8258448,0.000008240802,0.01827886,0.002121216,0.073818274],"study_design_scores_gemma":[0.0016812673,0.00029301687,0.09489736,0.0008441681,0.00002246068,0.0007753703,0.011995081,0.8353026,0.0000090660105,0.051458433,0.0024172051,0.00030399725],"about_ca_topic_score_codex":0.000018850176,"about_ca_topic_score_gemma":0.00001208563,"teacher_disagreement_score":0.21239994,"about_ca_system_score_codex":0.00006249384,"about_ca_system_score_gemma":0.00022285797,"threshold_uncertainty_score":0.999897},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050190795,0.001958008,0.9463953,0.000739762,0.00038011433,0.00019360006,0.00004154348,0.00003198674,0.000068903915],"genre_scores_gemma":[0.4619942,0.00017360998,0.53752154,0.000111854795,0.00011929514,0.00000426822,0.000020811585,0.0000065443483,0.000047870737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839914,0.00006572871,0.0007421528,0.0002745747,0.00018342806,0.00033495994],"domain_scores_gemma":[0.9985537,0.00034206806,0.00058917084,0.0001922748,0.00018847435,0.0001342984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000663111,0.00019669815,0.00044579682,0.00014661314,0.0003510571,0.00017667495,0.0002491586,0.00006232268,0.0000011681925],"category_scores_gemma":[0.00019216875,0.0001648648,0.0000985892,0.00019828527,0.000047010344,0.0005151992,0.00030399047,0.00018268966,2.2658827e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005737613,0.00040297132,0.031325117,0.0009674205,0.0010193696,0.0002624877,0.0019370007,0.09239131,0.0026872957,0.7225447,0.011100014,0.13478851],"study_design_scores_gemma":[0.01988947,0.00094055076,0.022826873,0.0037679034,0.00026800265,0.0006381492,0.0033055253,0.835794,0.00066048425,0.027636835,0.08272254,0.0015496687],"about_ca_topic_score_codex":0.000022257303,"about_ca_topic_score_gemma":0.0000034415139,"teacher_disagreement_score":0.74340266,"about_ca_system_score_codex":0.000057496913,"about_ca_system_score_gemma":0.00009106255,"threshold_uncertainty_score":0.67229915},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08941647,0.00050158,0.9087526,0.00042706923,0.00020168432,0.00009609937,0.0000041650073,0.000036571124,0.00056373415],"genre_scores_gemma":[0.9738385,0.00011323737,0.025892137,0.0000894736,0.000015936464,5.607747e-7,0.0000047214508,0.0000026173589,0.00004282666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892896,0.00009068264,0.0004466373,0.00014012589,0.00022604608,0.00016753376],"domain_scores_gemma":[0.9990286,0.00016577236,0.00030316677,0.00014322287,0.00026882268,0.00009039167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034370582,0.000097340875,0.00025236054,0.00020351262,0.00012049597,0.00007520959,0.00033904854,0.000046892674,0.0000041678272],"category_scores_gemma":[0.0000722433,0.000076884055,0.00008813433,0.00057038036,0.00004178807,0.00014752755,0.00014294116,0.00017292125,6.929517e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013611885,0.0005454704,0.010509767,0.00010878891,0.00014315317,0.000046567166,0.00057145546,0.8732581,0.0011840113,0.043562427,0.004911554,0.065022565],"study_design_scores_gemma":[0.0020954378,0.0006887275,0.020128958,0.0004435297,0.000021463733,0.000043910848,0.00014182438,0.970473,0.00044597234,0.00426903,0.001060715,0.00018746554],"about_ca_topic_score_codex":0.00000566783,"about_ca_topic_score_gemma":5.2974514e-7,"teacher_disagreement_score":0.884422,"about_ca_system_score_codex":0.00002332656,"about_ca_system_score_gemma":0.000070328,"threshold_uncertainty_score":0.31352407},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06896501,0.0014924434,0.9278748,0.00076163805,0.00031188453,0.000097369615,0.0000013843367,0.00006669213,0.00042877067],"genre_scores_gemma":[0.97294486,0.0000740616,0.026633358,0.00011657557,0.00014671157,7.822813e-7,0.000009737694,0.0000070055244,0.0000668994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980808,0.0001456695,0.00074936287,0.0003156159,0.00029132172,0.00041724788],"domain_scores_gemma":[0.99832934,0.0003329817,0.0006010459,0.00018455183,0.00036344558,0.00018863381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069846626,0.00025467874,0.0005051593,0.00018287195,0.0004769038,0.00034719106,0.00044787466,0.000107135005,0.000001934229],"category_scores_gemma":[0.00010982718,0.00020458663,0.000075331445,0.00045070963,0.00012800921,0.00021368607,0.00038102578,0.0005283427,0.0000011393066],"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.000121757635,0.000069701964,0.05507837,0.00022799357,0.00032170076,0.00024008192,0.0008668828,0.89860874,0.00004325789,0.03002679,0.0005734976,0.013821244],"study_design_scores_gemma":[0.0019961738,0.00047235953,0.008181538,0.0006096387,0.000065899,0.00071696815,0.0007999075,0.9814429,0.000013308282,0.0013464242,0.004028522,0.00032635243],"about_ca_topic_score_codex":0.000015304158,"about_ca_topic_score_gemma":0.0000019117565,"teacher_disagreement_score":0.90397984,"about_ca_system_score_codex":0.000056476514,"about_ca_system_score_gemma":0.00013882807,"threshold_uncertainty_score":0.8342801},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043623853,0.00041787483,0.9924429,0.0022343942,0.00010344752,0.0002962353,0.000055144723,0.000055334287,0.00003229649],"genre_scores_gemma":[0.4609942,0.000010611775,0.5383369,0.0005507372,0.000058369696,0.0000040543996,0.000034282086,0.000004186242,0.000006652419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986592,0.00005047335,0.00062058883,0.00031380873,0.00015733269,0.00019858556],"domain_scores_gemma":[0.9982719,0.0003309677,0.0003902839,0.0004663135,0.00041135697,0.00012918387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078677444,0.00014236209,0.00033509897,0.00015957447,0.00017785215,0.00010849936,0.0008155884,0.000072392424,5.3682373e-7],"category_scores_gemma":[0.00017685835,0.00012532505,0.00006130814,0.00035860031,0.000056973044,0.00016863685,0.0005826362,0.00015029637,4.4886215e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006968416,0.0014475819,0.025800388,0.0014302635,0.0007268631,0.000025655248,0.0013986655,0.48780325,0.0013735763,0.08292246,0.06628309,0.33009136],"study_design_scores_gemma":[0.0009265158,0.0001425023,0.0013023291,0.00018997674,0.000036288122,0.000008916893,0.000031907646,0.98292476,0.0002021171,0.004605932,0.009473001,0.00015575215],"about_ca_topic_score_codex":0.0000026078162,"about_ca_topic_score_gemma":0.000001022371,"teacher_disagreement_score":0.4951215,"about_ca_system_score_codex":0.000020989404,"about_ca_system_score_gemma":0.0001477502,"threshold_uncertainty_score":0.5110607},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027319679,0.00031125153,0.97034305,0.0017310057,0.00005947629,0.00013333831,0.000016815104,0.000016600507,0.00006875261],"genre_scores_gemma":[0.94701725,0.000060006416,0.052718308,0.00009849979,0.00007877878,9.3691585e-7,0.00001857701,0.000002531637,0.000005081752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991841,0.000045144116,0.00034735355,0.00008434092,0.00018079703,0.00015826846],"domain_scores_gemma":[0.9990462,0.00012422881,0.00025446332,0.00006124535,0.0002536393,0.00026018708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007047827,0.000082862185,0.00018549467,0.000081386,0.00012221298,0.0002845067,0.00012729748,0.000047608402,2.5600235e-7],"category_scores_gemma":[0.0001353079,0.00006676247,0.000025278805,0.00011914925,0.000032610897,0.0009089229,0.00008071877,0.00011645041,2.5351537e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024502346,0.00014682923,0.06971235,0.00026958392,0.00024248206,0.000023253191,0.010280971,0.064135395,0.00003536775,0.037246294,0.011050473,0.80661196],"study_design_scores_gemma":[0.005919785,0.00082162966,0.05121543,0.000107023,0.000038637132,0.0003618968,0.00062603585,0.9134972,0.000017486756,0.005004328,0.022108132,0.0002824115],"about_ca_topic_score_codex":0.000004639114,"about_ca_topic_score_gemma":6.378404e-7,"teacher_disagreement_score":0.9196976,"about_ca_system_score_codex":0.00002174884,"about_ca_system_score_gemma":0.000067060886,"threshold_uncertainty_score":0.27435046},"labels":[],"label_agreement":null}]}