{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":17,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":17,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"0e3d1d99c5d6","filters":{"venue":"Parallel Computing"}},"results":[{"id":"W2044596392","doi":"10.1016/s0167-8191(01)00103-x","title":"A dynamic model and parallel tabu search heuristic for real-time ambulance relocation","year":2001,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":448,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université de Montréal","funders":"","keywords":"Tabu search; Relocation; Heuristic; Computer science; Humanities; Operations research; Algorithm; Engineering; Artificial intelligence; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.03028316466685818,"gpt":0.2720958466523946,"spread":0.2418126819855364,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006151335,0.0002020579,0.0002226324,0.0001709366,0.0003909376,0.0001871259,0.000218975,0.00005307114,0.00004539514],"category_scores_gemma":[0.00008871558,0.0002150364,0.00006052158,0.0003083761,0.00004718026,0.0003720146,0.0001899386,0.00009442491,0.0002407929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004973667,"about_ca_system_score_gemma":0.00001833846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006127539,"about_ca_topic_score_gemma":0.0001521587,"domain_scores_codex":[0.9984885,0.00001401154,0.000381285,0.0004603633,0.0002307593,0.0004250471],"domain_scores_gemma":[0.9993791,0.00004572948,0.0000882089,0.000276449,0.0001854042,0.00002509908],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001101371,0.00009258297,0.002136465,0.0004351547,0.00003275235,0.000002584641,0.0001978886,0.9676148,0.0001801039,0.0166167,0.002803548,0.009777328],"study_design_scores_gemma":[0.0006078483,0.000009497257,0.009826218,0.00003744987,0.00002691451,0.000001335018,0.0001050264,0.9840817,2.446033e-7,0.002602071,0.002454589,0.0002471048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4509986,0.0001245654,0.5377969,0.002155775,0.000156713,0.0008211658,0.000002345525,0.0003126152,0.007631388],"genre_scores_gemma":[0.9784579,0.0001456814,0.01821441,0.0006077128,0.0001799443,0.00003914623,0.0001136324,0.00003042609,0.002211155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5274593,"threshold_uncertainty_score":0.876893,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980816411","doi":"10.1016/j.parco.2010.10.004","title":"Scheduling of tasks in the parareal algorithm","year":2010,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Atlantic Canada Opportunities Agency","keywords":"Computer science; Scheduling (production processes); Parallel computing; Algorithm; Scaling; Rate of convergence; Execution time; Convergence (economics); Domain decomposition methods; Distributed computing; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06867852865311079,"gpt":0.3808681107767238,"spread":0.312189582123613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001066124,0.0001047194,0.0002227217,0.00006419899,0.00008427838,0.00002344654,0.0003305376,0.00006317584,0.00002780879],"category_scores_gemma":[0.0009107132,0.00007607093,0.0000781528,0.0002553824,0.00006289816,0.00003771893,0.00007540496,0.0003849411,0.000006439047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007503522,"about_ca_system_score_gemma":0.00002084877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006194445,"about_ca_topic_score_gemma":0.00003415376,"domain_scores_codex":[0.9988111,0.0001986614,0.000393266,0.0001507591,0.0002237979,0.0002224378],"domain_scores_gemma":[0.9976957,0.001759027,0.0001750844,0.00029234,0.00004506224,0.0000327925],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001649776,0.0007229013,0.005414313,0.0001402518,0.00006770194,0.00001321073,0.007515172,0.001713774,0.006140653,0.26698,0.00008049381,0.7111951],"study_design_scores_gemma":[0.0005237914,0.00004109567,0.006977546,0.00005087772,0.00002909576,0.0000144925,0.000458277,0.2671726,0.0003877784,0.7239931,0.0001602789,0.0001911402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.32534,0.00001040644,0.6732562,0.0001299401,0.0001636625,0.0001473271,0.000001499202,0.00002840256,0.0009225461],"genre_scores_gemma":[0.4728379,4.407306e-7,0.5270488,0.00002351266,0.00007142634,0.000003438627,0.000001486261,0.000007471352,0.00000548971],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7110039,"threshold_uncertainty_score":0.3102082,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2618636670","doi":"10.1016/j.parco.2017.05.003","title":"Proteus: Exploiting precision variability in deep neural networks","year":2017,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Memory footprint; Inference; Convolutional neural network; Artificial neural network; Proteus; Efficient energy use; Floating point; Computer engineering; Real-time computing; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02995690329559604,"gpt":0.3004231432261359,"spread":0.2704662399305399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001253781,0.0002129411,0.0002622346,0.00006114909,0.0009771599,0.0004446374,0.00228705,0.00008247695,0.000003215833],"category_scores_gemma":[0.0005449416,0.0002148033,0.00007160731,0.0002429896,0.00007780045,0.000881516,0.001584884,0.0004514928,0.00001410296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007537979,"about_ca_system_score_gemma":0.00001544993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002969976,"about_ca_topic_score_gemma":0.00002366463,"domain_scores_codex":[0.997655,0.000226919,0.0004944468,0.000788102,0.0002358576,0.0005996415],"domain_scores_gemma":[0.9970263,0.0006651729,0.0004220852,0.00169787,0.00007401592,0.0001145064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000650558,0.00004481781,0.01214735,0.000007192277,0.000002914838,0.0000108333,0.0002070186,0.6139846,0.00003838084,0.008765785,0.00001582962,0.3647687],"study_design_scores_gemma":[0.0002950244,0.00001737163,0.0337975,0.00003404182,0.00000144417,0.00001151938,0.000007593023,0.9537714,0.00002299795,0.01173148,0.00009534624,0.0002142788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04162401,0.00006128688,0.9550346,0.0006898587,0.0002848627,0.0006270588,1.743464e-7,0.0002496583,0.001428556],"genre_scores_gemma":[0.7886671,0.000004903802,0.2109418,0.0001085762,0.0002081453,0.00004557548,0.000001384501,0.0000131706,0.000009336859],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7470431,"threshold_uncertainty_score":0.8759425,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019783787","doi":"10.1016/s0167-8191(03)00022-x","title":"The maximum flow problem: a real-time approach","year":2003,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Flow (mathematics); Computer science; Mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0190484485478017,"gpt":0.2464133393650204,"spread":0.2273648908172187,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001376631,0.0001602463,0.0001566124,0.00005578987,0.0007800288,0.0005294561,0.0009516916,0.00005182517,0.00001466321],"category_scores_gemma":[0.00007787036,0.0001158451,0.000072485,0.0004940503,0.00006149858,0.0002036286,0.0002594127,0.0002014002,0.0002083814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003874092,"about_ca_system_score_gemma":0.0001003558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001379126,"about_ca_topic_score_gemma":0.000001072816,"domain_scores_codex":[0.9980055,0.0003413473,0.0003119646,0.0004178919,0.0003501714,0.0005731177],"domain_scores_gemma":[0.9988549,0.0002235508,0.0001081459,0.0005705832,0.0001127578,0.0001300859],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006282436,0.0001495522,0.0002243337,0.00003448401,0.00004636015,0.000008350929,0.002243483,0.5859849,0.0001500224,0.3619142,0.006561696,0.04267636],"study_design_scores_gemma":[0.0003028931,0.00002923156,0.00005629411,0.000009674127,0.000001733781,0.00002444112,0.00003040328,0.9802024,0.00001368992,0.008826457,0.01033771,0.000165029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001505775,0.00007564414,0.8349217,0.0004731685,0.00009963611,0.0003152537,2.098393e-7,0.0002795001,0.1636843],"genre_scores_gemma":[0.03147786,0.00005393109,0.9663239,0.0001759373,0.00004627435,0.0000181657,0.000003381214,0.00001708291,0.001883454],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3942175,"threshold_uncertainty_score":0.5999429,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966773917","doi":"10.1016/j.parco.2005.02.008","title":"Interactive parallel visualization of large particle datasets","year":2005,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"McMaster University","keywords":"Rendering (computer graphics); Visualization; Computer science; Volume rendering; Interactive visualization; Computer graphics (images); Scientific visualization; Frame rate; Data visualization; Computational science; Data mining; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02303529292556327,"gpt":0.3434211950819711,"spread":0.3203859021564078,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005245121,0.0001712619,0.0002380988,0.0001480452,0.0001577858,0.0001292337,0.0007822776,0.00005525183,0.00001771319],"category_scores_gemma":[0.00004557676,0.0001749299,0.00008511836,0.0005944907,0.00003195561,0.0006661509,0.0006533999,0.000105827,0.00002232379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003047537,"about_ca_system_score_gemma":0.0000340927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001701597,"about_ca_topic_score_gemma":0.00001084585,"domain_scores_codex":[0.9982962,0.000135538,0.00052549,0.0004104209,0.0002934731,0.0003388568],"domain_scores_gemma":[0.9987754,0.0001385527,0.0003074056,0.0005318537,0.0001564495,0.00009030445],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001111597,0.0003608339,0.003477229,0.00002608117,0.00003485153,0.000003257119,0.002117087,0.002935462,0.0002214897,0.9709296,0.002755498,0.01712753],"study_design_scores_gemma":[0.0004789452,0.00007794829,0.002550485,0.00005056246,0.000005233876,0.000006987964,0.00002381145,0.983658,0.003120244,0.002065825,0.007754862,0.0002071052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01697464,0.0001382976,0.9816846,0.0001989912,0.0001151101,0.0001892396,0.000008512752,0.0003651927,0.0003253933],"genre_scores_gemma":[0.8925535,0.00002350104,0.1068138,0.0004419013,0.00008716444,0.000005205425,0.00004819872,0.00001203681,0.00001468459],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9807225,"threshold_uncertainty_score":0.7133434,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994064073","doi":"10.1016/j.parco.2006.08.007","title":"Quasi-atomic recovery for distributed agents","year":2006,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Correctness; Distributed computing; Asynchronous communication; Protocol (science); Overhead (engineering); Two-phase commit protocol; Simple (philosophy); Locality; Computer network; Algorithm; Operating system; Distributed transaction; Transaction processing; Database transaction; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01765791351258682,"gpt":0.2589437906140779,"spread":0.2412858771014911,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003770552,0.0002029666,0.0002912481,0.0000586641,0.0002917218,0.0002919519,0.0007891442,0.00008019467,0.000002632253],"category_scores_gemma":[0.00003775909,0.0002036857,0.0001632594,0.0003185539,0.00002256492,0.0002637028,0.0001757305,0.0001032051,0.00005171145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008439652,"about_ca_system_score_gemma":0.00003736286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001285169,"about_ca_topic_score_gemma":0.00001111113,"domain_scores_codex":[0.998193,0.0000571452,0.0004783078,0.0005129747,0.0002204704,0.0005381492],"domain_scores_gemma":[0.998955,0.0001680335,0.0002245283,0.0004620058,0.0001127059,0.00007775579],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001709731,0.001729061,0.01433414,0.0004957834,0.0001959656,0.00009323308,0.000513608,0.2270794,0.000725831,0.2537564,0.357627,0.1432786],"study_design_scores_gemma":[0.001068276,0.0001174915,0.008652646,0.00005851294,0.000006614216,0.00002067388,0.00001108315,0.9288746,0.00008663593,0.006651141,0.05408894,0.0003634021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03296838,0.0002156236,0.9638891,0.0004139568,0.001016484,0.0003548172,0.00006068176,0.00031226,0.000768666],"genre_scores_gemma":[0.9482287,0.000001738734,0.05089821,0.0002083155,0.000314346,0.00002020024,0.0001421163,0.00001430372,0.0001720204],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9152604,"threshold_uncertainty_score":0.8306062,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3033979988","doi":"10.1016/j.parco.2020.102663","title":"AIR: Iterative refinement acceleration using arbitrary dynamic precision","year":2020,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Queen's University; Queen's University Belfast; European Commission","keywords":"Iterative refinement; Computer science; Algorithm; Granularity; Iterative method; Acceleration; Double-precision floating-point format; Arbitrary-precision arithmetic; Floating point","retraction":null,"screen_n_in":null,"score":{"opus":0.05825726204588218,"gpt":0.3299951338883736,"spread":0.2717378718424915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000307445,0.0001710388,0.0002415995,0.00004635781,0.0002496178,0.0001919829,0.0005071154,0.00004238816,0.00001106392],"category_scores_gemma":[0.00008916687,0.0001533154,0.00008653392,0.0004426425,0.0000187002,0.0003782039,0.0004407524,0.0002123433,0.00002727184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005145352,"about_ca_system_score_gemma":0.00004028184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009266889,"about_ca_topic_score_gemma":3.045621e-7,"domain_scores_codex":[0.9983465,0.0002148759,0.0003642903,0.0005112402,0.0002792458,0.0002838526],"domain_scores_gemma":[0.9992176,0.0001882722,0.0001556845,0.000228802,0.00006717674,0.000142462],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002456705,0.0001048649,0.0002424114,0.00004345367,0.00004643252,0.00004556455,0.003552162,0.09817974,0.01082295,0.00868116,0.000198351,0.8780584],"study_design_scores_gemma":[0.0002477607,0.0001083908,0.0007889515,0.00003572605,0.000004298508,0.000006593259,0.00002442686,0.9953042,0.0004308766,0.002224756,0.0006326674,0.0001913375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02138542,0.0001639905,0.9751123,0.002204661,0.0002611851,0.0001784558,8.128262e-7,0.0002036567,0.0004895409],"genre_scores_gemma":[0.3392729,0.000003658221,0.6592104,0.001373944,0.000120142,0.000001548576,0.000002224989,0.000007703953,0.000007424302],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8971245,"threshold_uncertainty_score":0.6252022,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011629644","doi":"10.1016/s0167-8191(02)00109-6","title":"Parallel codebook design for vector quantization on a message passing MIMD architecture","year":2002,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Scheme for Promotion of Academic and Research Collaboration","keywords":"Codebook; MIMD; Vector quantization; Linde–Buzo–Gray algorithm; Computer science; Pipeline (software); Computation; Image compression; Quantization (signal processing); Parallel computing; Algorithm; Data compression; Computer engineering; Image (mathematics); Artificial intelligence; Image processing; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05951995360818504,"gpt":0.2954016781205356,"spread":0.2358817245123505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004378784,0.0003570274,0.0003689015,0.0002087694,0.0005291933,0.0002797619,0.00127385,0.0001226044,0.00001712045],"category_scores_gemma":[0.0002183074,0.0003293169,0.0001296892,0.0003308776,0.00005610792,0.0003765094,0.0002951544,0.0003051217,0.00004290431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007883965,"about_ca_system_score_gemma":0.00002448271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003499308,"about_ca_topic_score_gemma":9.797142e-7,"domain_scores_codex":[0.9973947,0.0002589719,0.0004858574,0.0008454921,0.0003953357,0.0006196396],"domain_scores_gemma":[0.997519,0.001004889,0.0003281725,0.0009006449,0.0001069981,0.000140268],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001415175,0.0004173426,0.00007661615,0.0001446098,0.00006762214,0.00004843968,0.002748362,0.5793704,0.005461941,0.1300335,0.03439051,0.2470992],"study_design_scores_gemma":[0.000704589,0.0002229235,0.00007965916,0.0002051617,0.000007317268,0.00001930819,0.000008031398,0.9723363,0.003015046,0.01576043,0.007198012,0.0004432134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002187541,0.0002811606,0.9950325,0.001068217,0.0002332078,0.0009388028,0.000005892955,0.001182112,0.001039309],"genre_scores_gemma":[0.309211,0.00001436344,0.6898407,0.0005820025,0.0001195543,0.00005842763,0.00001069715,0.00003407811,0.0001291095],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3929659,"threshold_uncertainty_score":0.9999159,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964212654","doi":"10.1016/j.parco.2015.03.009","title":"Scalable connectionless RDMA over unreliable datagrams","year":2015,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Advanced Scientific Computing Research; National Science Foundation of Sri Lanka; Office of Science; Natural Sciences and Engineering Research Council of Canada; Savannah River Operations Office, U.S. Department of Energy; Ontario Innovation Trust; U.S. Department of Energy","keywords":"Remote direct memory access; InfiniBand; Datagram; Computer science; Connectionless communication; Scalability; Operating system; Computer network; The Internet; Network packet","retraction":null,"screen_n_in":null,"score":{"opus":0.04617615889508019,"gpt":0.291365737088616,"spread":0.2451895781935358,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005090534,0.0002101406,0.0002504549,0.0001241601,0.0002270773,0.0002675197,0.00176661,0.00009518159,0.000007776088],"category_scores_gemma":[0.0003732002,0.0002046391,0.00004167659,0.0007041806,0.00009477613,0.001165097,0.001828644,0.0002693671,0.0002910965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001320502,"about_ca_system_score_gemma":0.00008273298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001256089,"about_ca_topic_score_gemma":0.00001038907,"domain_scores_codex":[0.9981046,0.00005248568,0.0002989897,0.0006348265,0.0003641185,0.0005449795],"domain_scores_gemma":[0.9981461,0.000174098,0.0001622019,0.001236837,0.0001307166,0.0001500744],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003059306,0.0002650162,0.006910679,0.00005373619,0.00007642418,0.0001752344,0.0009913227,0.206983,0.000455072,0.5429732,0.1031416,0.1379442],"study_design_scores_gemma":[0.001068023,0.0001102723,0.0005128049,0.00005194997,0.00000632313,0.00008227063,0.0002322367,0.8737125,0.0006591465,0.03986403,0.08314854,0.000551928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01168365,0.0003487127,0.9810965,0.0003904897,0.0009094187,0.0001574933,0.000004304672,0.001747751,0.003661665],"genre_scores_gemma":[0.5278034,0.000008074553,0.4715101,0.0002767501,0.000096221,0.000006084448,0.00001874351,0.0000159006,0.0002647622],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6667295,"threshold_uncertainty_score":0.8344942,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2971516936","doi":"10.1016/j.parco.2019.102547","title":"A dynamic, unified design for dedicated message matching engines for collective and point-to-point communications","year":2019,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Nuclear Security Administration; Government of Ontario; University of Toronto; Canada Foundation for Innovation; Ontario Research Foundation; U.S. Department of Energy","keywords":"Message queue; Computer science; Queue; Point-to-point; Message passing; Message Passing Interface; Scalability; Speedup; Computer network; Distributed computing; Matching (statistics); Priority queue; Queueing theory; Point (geometry); Parallel computing; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02755589818956545,"gpt":0.2919306506323945,"spread":0.264374752442829,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001370613,0.0002636118,0.0003909249,0.0002743854,0.000591434,0.0002792506,0.001318698,0.0001104682,0.000001839727],"category_scores_gemma":[0.0002444894,0.000273028,0.00008825918,0.0006020355,0.00004392894,0.0002466933,0.0007342109,0.0001854362,0.00001294314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000113817,"about_ca_system_score_gemma":0.0001566908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001302662,"about_ca_topic_score_gemma":0.000003776088,"domain_scores_codex":[0.9980984,0.0001843702,0.0004602506,0.000613923,0.0001699324,0.0004731013],"domain_scores_gemma":[0.9964911,0.001849044,0.0002372992,0.0008642004,0.0004136731,0.0001447299],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002175275,0.0002652678,0.0002671575,0.0002851695,0.0002429412,0.000002225087,0.01258854,0.8712105,0.002272655,0.08667764,0.006065622,0.01990474],"study_design_scores_gemma":[0.000929239,0.0002227359,0.0002008919,0.0001094207,0.00001294961,0.00001091751,0.00008686326,0.9820887,0.0002306956,0.01504205,0.0007252913,0.0003402755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003123746,0.0002102196,0.9907514,0.002037231,0.0001511905,0.002421171,0.00000646643,0.0007942066,0.0005043608],"genre_scores_gemma":[0.3417169,0.00001517121,0.6574879,0.0003668644,0.00001481199,0.0001023983,0.00001492342,0.00002420455,0.0002568158],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3385932,"threshold_uncertainty_score":0.9999722,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043803280","doi":"10.1016/s0167-8191(03)00041-3","title":"Parallel computing in logistics","year":2003,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Intuitionistic Fuzzy Systems Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Representation (politics); Relevance (law); Space (punctuation); Theoretical computer science; Information exchange; Mechanism (biology); Complex system; Distributed computing; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.029854203686776,"gpt":0.2766728664270141,"spread":0.2468186627402381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009292358,0.000261585,0.0003496681,0.0001852783,0.0004007354,0.0002803251,0.001000323,0.0001120968,0.00001066779],"category_scores_gemma":[0.0003276136,0.0002870664,0.0000831884,0.0007970523,0.00008132117,0.0001625521,0.0002892138,0.0003570926,0.0002914737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001779862,"about_ca_system_score_gemma":0.0001407039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001253626,"about_ca_topic_score_gemma":0.0000293918,"domain_scores_codex":[0.9972293,0.0002666366,0.0007546448,0.0006862072,0.0003566057,0.0007066319],"domain_scores_gemma":[0.9981163,0.000538059,0.0002641934,0.0008081856,0.0001395132,0.0001338049],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001362752,0.00008753671,0.003478392,0.00002835095,0.000009912661,0.00002834315,0.0005778258,0.1279115,0.00003680946,0.8653671,0.0006144596,0.001858418],"study_design_scores_gemma":[0.0008474921,0.00004034488,0.005713239,0.00009805648,0.000005227746,0.0001216749,0.000163069,0.9525855,0.00003342568,0.03499426,0.004872187,0.0005255062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004403088,0.0001543323,0.9637559,0.0002813737,0.0004608547,0.0003752888,0.000001178286,0.0003063735,0.03026162],"genre_scores_gemma":[0.6520416,0.000002632589,0.347555,0.0002210331,0.0000820639,0.000009618129,0.000003693124,0.00001412593,0.00007023908],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8303729,"threshold_uncertainty_score":0.9999582,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4308487050","doi":"10.1016/j.parco.2022.102984","title":"Efficient parallel branch-and-bound approaches for exact graph edit distance problem","year":2022,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Direction Générale de la Recherche Scientifique et du Développement Technologique","keywords":"Computer science; Speedup; Search tree; Pruning; Branch and bound; Theoretical computer science; Graph; Parallel computing; Algorithm; Search algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02693764481373495,"gpt":0.2351926344659796,"spread":0.2082549896522446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001298777,0.0002741078,0.0003169224,0.0001420212,0.001518219,0.0002457045,0.00104839,0.00004060306,0.000007460611],"category_scores_gemma":[0.00002235006,0.0002731057,0.0001767037,0.0005364846,0.0001179723,0.0001156084,0.0008135734,0.0003093539,0.000004379294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004607937,"about_ca_system_score_gemma":0.00004560364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007725949,"about_ca_topic_score_gemma":0.000001445104,"domain_scores_codex":[0.9975506,0.0002073223,0.0003914862,0.0008139585,0.0003897739,0.0006468395],"domain_scores_gemma":[0.9987456,0.0003804785,0.0002200729,0.0004763651,0.00004198747,0.000135545],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004435974,0.000194061,0.0002886851,0.00008220553,0.00004851992,0.000007740065,0.00260727,0.5333433,0.00003003437,0.4344092,0.000352142,0.02859255],"study_design_scores_gemma":[0.0009636956,0.0001567916,0.0006711162,0.00001977857,0.00001129504,0.00004473568,0.0001860765,0.8936511,0.00001489101,0.1006583,0.00321908,0.0004031776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0367769,0.0008940365,0.9594344,0.0005560673,0.0005853324,0.0006832092,0.00001090179,0.0002625579,0.0007965475],"genre_scores_gemma":[0.8554273,0.000003248697,0.1439116,0.0001980455,0.0001595746,0.0001390767,0.00001103254,0.00002069508,0.0001293917],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8186504,"threshold_uncertainty_score":0.9999721,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4367397470","doi":"10.1016/j.parco.2023.103024","title":"A lightweight semi-centralized strategy for the massive parallelization of branching algorithms","year":2023,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Computer science; Programmer; Vertex cover; Bounded function; Algorithm; Branching (polymer chemistry); Parallel computing; Vertex (graph theory); Theoretical computer science; Graph; Approximation algorithm; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.05154537697838242,"gpt":0.3049463212381897,"spread":0.2534009442598072,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007429719,0.0002156723,0.0003100193,0.0001627717,0.0005834657,0.0001968218,0.001237905,0.00007298361,0.000008065853],"category_scores_gemma":[0.00009143633,0.0001674269,0.0002211177,0.001142966,0.00008412222,0.0002550636,0.0003822713,0.0001762888,0.00001606316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002413939,"about_ca_system_score_gemma":0.00007067649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003840293,"about_ca_topic_score_gemma":0.000006268788,"domain_scores_codex":[0.997997,0.0001151862,0.0005135353,0.0004581005,0.0003620221,0.0005541475],"domain_scores_gemma":[0.997798,0.001140564,0.0002940293,0.0005267913,0.0001647582,0.00007586124],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003128326,0.0001024341,0.0004182245,0.0001469444,0.0001946387,0.00001398532,0.003795342,0.5200233,0.0003555551,0.3121414,0.003277483,0.1594994],"study_design_scores_gemma":[0.0008136015,0.00006376104,0.001940054,0.00006244666,0.00001472347,0.000006441315,0.0001251617,0.9692965,0.0002790794,0.02476111,0.002428042,0.0002090653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00487021,0.0004253955,0.9915201,0.00122162,0.000673504,0.0005657363,0.000007870176,0.0003858766,0.0003296559],"genre_scores_gemma":[0.8575309,0.0001448476,0.1415324,0.0001821086,0.0003395474,0.00004128615,0.00003056111,0.00002623199,0.0001720855],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8526607,"threshold_uncertainty_score":0.6827471,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029783178","doi":"10.1016/j.parco.2012.03.002","title":"Criticality guided energy aware speculation for speculative multithreaded processors","year":2012,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Criticality; Computer science; Thread (computing); Energy consumption; Speculative execution; Computation; Embedded system; Execution model; Architecture; Efficient energy use; Speculation; Parallel computing; Computer architecture; Distributed computing; Operating system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.05511939389700363,"gpt":0.332821304914333,"spread":0.2777019110173294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007671259,0.0002857106,0.000332128,0.0001476794,0.0004226714,0.0001785894,0.0006762597,0.0001258655,0.000008598758],"category_scores_gemma":[0.0002103302,0.0002862763,0.0001539735,0.0004329268,0.00006064801,0.0006049773,0.0003085959,0.0001318243,0.00001755875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000106782,"about_ca_system_score_gemma":0.00005602776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003264958,"about_ca_topic_score_gemma":0.000001529079,"domain_scores_codex":[0.9976773,0.0001585764,0.0005588515,0.0005321454,0.0003259003,0.0007472751],"domain_scores_gemma":[0.9983093,0.00036062,0.0002456107,0.0004800635,0.0003902908,0.0002140738],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004833857,0.0007013424,0.01060517,0.0002248203,0.000141342,0.000005868387,0.004733941,0.1702692,0.0004017503,0.7656099,0.00889927,0.03835903],"study_design_scores_gemma":[0.0005243667,0.00004123599,0.002443351,0.00004886337,0.00001125905,0.00001524401,0.00002984352,0.9828248,0.002345055,0.009084678,0.002218519,0.000412792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002769232,0.0001800986,0.9923728,0.0005074986,0.0003401776,0.0003476223,0.000002404609,0.0009940041,0.002486125],"genre_scores_gemma":[0.5671785,0.00000336257,0.4321183,0.0003019415,0.0002564559,0.0000182396,0.00001709043,0.00001561771,0.0000904437],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8125556,"threshold_uncertainty_score":0.9999589,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4416746178","doi":"10.1016/j.parco.2025.103165","title":"Butterfly factorization for vision transformers on multi-IPU systems","year":2025,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Butterfly; Memory footprint; Transformer; Factorization; Computation","retraction":null,"screen_n_in":null,"score":{"opus":0.02213822854525998,"gpt":0.2953664193748585,"spread":0.2732281908295985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001299105,0.0001818024,0.000202341,0.0001080613,0.0002179698,0.00004948065,0.0001123159,0.000068849,9.263134e-7],"category_scores_gemma":[0.00002001305,0.000181982,0.00007329116,0.0001724072,0.00001098158,0.00009654484,0.0000156563,0.0001548021,0.000007539858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007123905,"about_ca_system_score_gemma":0.000009202425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002432566,"about_ca_topic_score_gemma":8.337827e-7,"domain_scores_codex":[0.9990768,0.00002273429,0.0002911288,0.000226673,0.00008344954,0.0002991876],"domain_scores_gemma":[0.9995359,0.000241289,0.00003743449,0.0001078632,0.00003587177,0.00004162121],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002230683,0.00001211829,0.00006249137,0.0002468197,0.00002611559,9.906117e-7,0.0001654164,0.9733028,0.01042202,0.0006837048,0.0001389833,0.01491617],"study_design_scores_gemma":[0.000779792,0.00006057231,0.0004424994,0.000277533,0.00001305063,0.000001362164,0.0000848399,0.9890133,0.006896189,0.0000746138,0.002157745,0.0001984623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1088395,0.0002034833,0.8877846,0.00003089748,0.001322174,0.0004380475,0.000003608596,0.0004389746,0.000938706],"genre_scores_gemma":[0.9952077,0.00001177275,0.004345286,0.0000686771,0.0001306005,0.00001064348,0.00001752892,0.00002663275,0.00018115],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8863682,"threshold_uncertainty_score":0.7421012,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4411297543","doi":"10.1016/j.parco.2025.103146","title":"Using Java to create and analyze models of parallel computing systems","year":2025,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Java; Parallel computing; Programming language; Distributed computing","retraction":null,"screen_n_in":null,"score":{"opus":0.0431495276323931,"gpt":0.3005110870569721,"spread":0.257361559424579,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001529956,0.0005183403,0.001071321,0.0005808597,0.000538443,0.0005261758,0.001562663,0.0001794867,0.000001124247],"category_scores_gemma":[0.00009331098,0.0005290983,0.0001911618,0.001633445,0.0001159816,0.0003566065,0.001545639,0.000318685,0.00001100161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001343525,"about_ca_system_score_gemma":0.0001920892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008415426,"about_ca_topic_score_gemma":0.000006415564,"domain_scores_codex":[0.9956146,0.0004047884,0.00138166,0.001130861,0.0005297572,0.0009383561],"domain_scores_gemma":[0.9972074,0.0005453135,0.000562249,0.001006869,0.0003861922,0.0002919704],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001780728,0.00005944648,0.003128165,0.0002706148,0.0001356018,0.00001585027,0.001425236,0.9107932,0.0001796373,0.08081853,0.0005262865,0.002629553],"study_design_scores_gemma":[0.000752525,0.00006744963,0.001506521,0.0009670252,0.00003826088,0.00005543614,0.0002313759,0.9934151,0.00002596085,0.001794898,0.0006585617,0.0004868423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1255164,0.001590598,0.8660958,0.0002116164,0.0008655164,0.0005839742,0.000007225281,0.0003372894,0.004791507],"genre_scores_gemma":[0.8433312,0.000008585223,0.1561363,0.000209938,0.0001281264,0.000003581668,0.000006789697,0.00002266117,0.0001528357],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7178147,"threshold_uncertainty_score":0.999716,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030615194","doi":"10.1016/j.parco.2009.04.001","title":"A distributed Key Message algorithm to optimize the communication in clusters","year":2009,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge; University of Alberta","funders":"","keywords":"Computer science; Key (lock); Distributed computing; Message passing; Algorithm; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01488383577701372,"gpt":0.2570849466904719,"spread":0.2422011109134582,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009808691,0.0001242848,0.0001785537,0.00007750981,0.0002637901,0.000275045,0.001172542,0.00004771194,0.000002904278],"category_scores_gemma":[0.00003579267,0.00009613561,0.00005902047,0.0005877792,0.00001557556,0.0001652429,0.0002820607,0.000224029,0.00002608852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000795972,"about_ca_system_score_gemma":0.00001662673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001260053,"about_ca_topic_score_gemma":0.00003515472,"domain_scores_codex":[0.9985844,0.000301428,0.0003629226,0.0002648911,0.0001787348,0.000307604],"domain_scores_gemma":[0.9988965,0.0002166745,0.0001093297,0.0006492874,0.00006473721,0.00006352006],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001101535,0.00007204667,0.0001420896,0.000003876215,0.00001449024,0.00001128375,0.007064181,0.821399,0.000009864484,0.0158892,0.006955778,0.1484272],"study_design_scores_gemma":[0.0002957939,0.00004073385,0.00241475,0.00006983858,0.000001314985,0.000018092,0.0001836993,0.9937931,0.000004263964,0.0006386588,0.002412417,0.0001273777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003249921,0.000140839,0.9872807,0.006752133,0.0002461121,0.0002831848,8.293762e-7,0.0001208889,0.001925423],"genre_scores_gemma":[0.8716911,0.000005597126,0.1266665,0.001491314,0.00006944427,0.000006821571,0.000005314276,0.000004307763,0.000059569],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8684412,"threshold_uncertainty_score":0.3920296,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}