{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":19,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":19,"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":"34e36ea59bca","filters":{"venue":"The International Journal of High Performance Computing Applications"}},"results":[{"id":"W2057980100","doi":"10.1177/109434200101500106","title":"Parallel Implementation and Practical Use of Sparse Approximate Inverse Preconditioners with a Priori Sparsity Patterns","year":2001,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Lawrence Livermore National Laboratory; University of Waterloo; Microsoft; U.S. Department of Energy","keywords":"Inverse; Sparse matrix; Computation; Computer science; Minification; Matrix (chemical analysis); Norm (philosophy); Algorithm; Numbering; A priori and a posteriori; Mathematical optimization; Code (set theory); Parallel computing; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03075754452208893,"gpt":0.2976504321479393,"spread":0.2668928876258504,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004876882,0.00009322752,0.0001287404,0.0001141798,0.0001484014,0.0001237667,0.0004746529,0.00002165847,0.00001297323],"category_scores_gemma":[0.00001116777,0.00006561981,0.00003301504,0.0001572961,0.00008535865,0.000809568,0.0001625036,0.0001703508,0.000002662454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003991795,"about_ca_system_score_gemma":0.00008044783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003859011,"about_ca_topic_score_gemma":0.000009410358,"domain_scores_codex":[0.9989467,0.00005257258,0.0003807762,0.0001334703,0.0003652035,0.0001212633],"domain_scores_gemma":[0.9985538,0.0001958955,0.0006321345,0.000199756,0.0003646961,0.00005371061],"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.0009214086,0.001273941,0.1854016,0.0001599672,0.001244204,0.0001159787,0.007074826,0.08934039,0.001244647,0.3995731,0.00181526,0.3118347],"study_design_scores_gemma":[0.005543462,0.001021146,0.265097,0.0004404903,0.0002310744,0.009079608,0.001465816,0.6795664,0.006895291,0.01578177,0.01408714,0.0007908121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.526292,0.000005451791,0.4721849,0.001317783,0.0000605428,0.0001100371,0.00000437812,0.00001077625,0.00001417826],"genre_scores_gemma":[0.9033016,0.0001229956,0.09625329,0.0001673754,0.0001229659,0.00000660424,0.000006087572,0.000004646716,0.00001443862],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5902261,"threshold_uncertainty_score":0.2675898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063730975","doi":"10.1177/1094342007083804","title":"Parallelization of the Fvcom Coastal Ocean Model","year":2008,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Oceanographic and Atmospheric Processes","field":"Earth and Planetary Sciences","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"National Oceanic and Atmospheric Administration; Princeton University; National Aeronautics and Space Administration","keywords":"Computer science; Parallel computing; Grid; Message Passing Interface; SPMD; Overhead (engineering); Stencil; Interface (matter); Domain (mathematical analysis); Software; Computational science; Porting; Programming language; Message passing","retraction":null,"screen_n_in":null,"score":{"opus":0.01185029140664399,"gpt":0.2063928893201952,"spread":0.1945425979135512,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002016619,0.00006418218,0.00009047981,0.00002275613,0.0002762944,0.00001692326,0.0008591502,0.00001958835,0.00002345436],"category_scores_gemma":[0.00001473287,0.00003540424,0.00006010013,0.000214396,0.0001706103,0.0001386378,0.00003337826,0.0001370125,0.000004000441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000394014,"about_ca_system_score_gemma":0.0001179088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005997478,"about_ca_topic_score_gemma":0.00001361251,"domain_scores_codex":[0.9990994,0.00001665067,0.0003240392,0.00006252425,0.0004123157,0.00008512268],"domain_scores_gemma":[0.9990217,0.00008185869,0.0004262152,0.0001161515,0.0003282895,0.00002579031],"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.00002161867,0.00002856186,0.284894,0.000006212536,0.00003713973,4.454385e-7,0.0002617738,0.7036265,0.00001992204,0.0004551268,0.0006213863,0.01002735],"study_design_scores_gemma":[0.0002478306,0.00003804926,0.418515,0.00004271261,0.00001733861,0.0002015606,0.00008088347,0.5776891,0.0004684568,0.001617636,0.00101157,0.000069902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9622043,0.0001546035,0.03611263,0.000825459,0.0001832022,0.00006909959,0.00001243042,0.000008489315,0.0004297754],"genre_scores_gemma":[0.9966748,0.0003086456,0.00256652,0.000181441,0.000196921,1.87252e-7,0.00000768585,0.000002237447,0.00006156623],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.133621,"threshold_uncertainty_score":0.2125061,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169658931","doi":"10.1177/1094342005051196","title":"CGMGRAPH/CGMLIB: Implementing and Testing CGM Graph Algorithms on PC Clusters and Shared Memory Machines","year":2005,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Scalability; Gigabit Ethernet; Speedup; Graph; Algorithm; Ethernet; Theoretical computer science; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01468599920268331,"gpt":0.2610724801576682,"spread":0.2463864809549849,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001204402,0.0001616339,0.0001652865,0.0002854354,0.0006553417,0.0003562495,0.001208013,0.00003016519,0.000003529558],"category_scores_gemma":[0.0000347268,0.0001196108,0.00005751693,0.000325945,0.0001155543,0.000504097,0.0004439182,0.0003121477,0.00000397663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003107019,"about_ca_system_score_gemma":0.00003239798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001432061,"about_ca_topic_score_gemma":0.000001983793,"domain_scores_codex":[0.9985406,0.00005165444,0.0004983817,0.0002362799,0.0004181704,0.0002548826],"domain_scores_gemma":[0.9984188,0.0004528151,0.000493651,0.0002348859,0.0003178765,0.00008196477],"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.00001672607,0.00007673151,0.002073643,0.00001153433,0.000111048,0.00000350654,0.001044175,0.007770769,0.0005376131,0.01852851,0.0001129202,0.9697128],"study_design_scores_gemma":[0.001569374,0.0002466298,0.03881506,0.0002778139,0.00004642579,0.001197564,0.0002257318,0.9331126,0.002461475,0.01879658,0.002840133,0.0004105808],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7909834,0.000229478,0.2037431,0.004327819,0.000251922,0.0001592409,0.000006339007,0.00006274497,0.000235971],"genre_scores_gemma":[0.9395378,0.00007410849,0.0591522,0.0006374752,0.0005580941,0.000008235816,0.000002530159,0.00001048987,0.00001911219],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9693022,"threshold_uncertainty_score":0.5040424,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020027705","doi":"10.1177/1094342003173006","title":"Quality of Service on the Grid Via Metascheduling with Resource Co-Scheduling and Co-Reservation","year":2003,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada","funders":"","keywords":"Reservation; Computer science; Architecture; Scheduling (production processes); Grid; Distributed computing; Grid computing; Quality of service; Computer network; Engineering; Operations management","retraction":null,"screen_n_in":null,"score":{"opus":0.03328211042214087,"gpt":0.2965294496184481,"spread":0.2632473391963073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002740344,0.000129276,0.0002056284,0.00009261467,0.0003400011,0.0001512874,0.001494124,0.00003214095,0.000002798914],"category_scores_gemma":[0.0000678755,0.00007543487,0.0000503991,0.0003585934,0.00007473901,0.0001897808,0.00008539904,0.0003092499,0.000006126207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004417547,"about_ca_system_score_gemma":0.00009303468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003919946,"about_ca_topic_score_gemma":0.000002718355,"domain_scores_codex":[0.998121,0.000209411,0.0006393487,0.000169722,0.000712774,0.0001477388],"domain_scores_gemma":[0.9969183,0.0009426462,0.001007667,0.0003825871,0.0007032833,0.0000455328],"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.000160409,0.0002873221,0.01373182,0.0001012457,0.0005469232,0.000002635365,0.002330005,0.6567762,0.002777925,0.3081121,0.0004934448,0.01467987],"study_design_scores_gemma":[0.002915827,0.0005435891,0.08309356,0.0009299325,0.00008110065,0.0009505832,0.0008246998,0.8462983,0.02489524,0.008881146,0.02985136,0.0007346774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5547149,0.0000568717,0.4418369,0.00277544,0.00009601797,0.0001219829,0.000003952498,0.00001569245,0.0003783115],"genre_scores_gemma":[0.9837351,0.00001162937,0.01534662,0.0006624183,0.0002152301,0.000006133069,0.000007256308,0.000007359557,0.000008215797],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4290203,"threshold_uncertainty_score":0.3076145,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981345850","doi":"10.1177/1094342010372928","title":"High-performance Physics Simulations Using Multi-core CPUs and GPGPUs in a Volunteer Computing Context","year":2010,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Context (archaeology); CUDA; Parallel computing; Computer science; Core (optical fiber); Computational science; Supercomputer; Many core; Computer architecture; Physics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02860229824957818,"gpt":0.2979959695505607,"spread":0.2693936713009826,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005071452,0.0002028701,0.000259943,0.0002631399,0.0003856751,0.0001814908,0.002106011,0.00007892303,0.00000242391],"category_scores_gemma":[0.00009079192,0.0001666523,0.000043435,0.0005155907,0.000248313,0.0009519524,0.0007836602,0.0008666096,0.000006951491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001328306,"about_ca_system_score_gemma":0.0001108492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008216676,"about_ca_topic_score_gemma":0.00003406443,"domain_scores_codex":[0.9982645,0.0000228405,0.0006929073,0.0002849475,0.0004570194,0.0002778058],"domain_scores_gemma":[0.9977237,0.0003561497,0.0007422476,0.0005330422,0.000590738,0.00005412009],"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.00003025019,0.0002768985,0.03716865,0.00002755678,0.00009690121,0.00001133701,0.00126972,0.4740629,0.01428895,0.0415728,0.00004132343,0.4311527],"study_design_scores_gemma":[0.0007957934,0.0000411119,0.02789537,0.0001054988,0.00001135079,0.0002736014,0.00007104001,0.9640198,0.004092372,0.0020975,0.0004040272,0.0001925706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5616871,0.00004727515,0.4372829,0.000370159,0.0004108079,0.0001336822,0.000006895837,0.00005715428,0.000004053265],"genre_scores_gemma":[0.8082569,0.00003365418,0.1912232,0.0001479931,0.0003102671,0.000003794622,0.000005353845,0.00001359124,0.000005275993],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4899569,"threshold_uncertainty_score":0.6795886,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074326665","doi":"10.1177/1094342011435159","title":"A modern solver interface to manage solution algorithms in the Community Earth System Model","year":2012,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Cryospheric studies and observations","field":"Earth and Planetary Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; Environment and Climate Change Canada","funders":"Sandia National Laboratories; Oak Ridge National Laboratory","keywords":"Computer science; Solver; Interface (matter); Software; Distributed computing; Algorithm; Set (abstract data type); Computational science; User interface; Parallel computing; Theoretical computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.03529664305961611,"gpt":0.2622344497180172,"spread":0.2269378066584011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001359852,0.00008868418,0.0001124547,0.00005835705,0.0004934829,0.00007073255,0.001031986,0.00002219749,0.00001180272],"category_scores_gemma":[0.00001584984,0.00005351422,0.00004635118,0.000237355,0.00004636679,0.0002274774,0.00007632971,0.0003555421,0.00003709692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003290517,"about_ca_system_score_gemma":0.00002121033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007841827,"about_ca_topic_score_gemma":0.000303212,"domain_scores_codex":[0.9989154,0.00008117637,0.000357306,0.00006285444,0.0003885227,0.0001946918],"domain_scores_gemma":[0.9991286,0.0002446391,0.0002093039,0.0002026457,0.0001701072,0.00004463532],"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.00003312997,0.00008795538,0.02563802,0.00001285494,0.00005491407,5.10597e-7,0.008068567,0.8878636,0.00003421758,0.0007873829,0.0005139892,0.07690484],"study_design_scores_gemma":[0.0001393264,0.00002957028,0.2804488,0.00004336903,0.00001328062,0.00005239805,0.001581486,0.7154477,0.00002082233,0.0001601849,0.002000321,0.00006273849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7711738,0.0002396756,0.2261854,0.001512143,0.0002688309,0.0001694144,0.00001222208,0.00001212612,0.0004263288],"genre_scores_gemma":[0.9924447,0.00004099697,0.006617099,0.0004711255,0.000380786,0.000004974859,0.000008721809,0.000003131213,0.0000284594],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2548108,"threshold_uncertainty_score":0.3795521,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131213031","doi":"10.1177/1094342007074873","title":"Regular Paper: Parallel Implementation of a Cellular Automaton Modeling the Growth of Three-Dimensional Tissues","year":2007,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Rice University; Simon Fraser University; University of Houston; National Science Foundation","keywords":"Computer science; Correctness; Cellular automaton; Process (computing); Domain (mathematical analysis); Parallel computing; Distributed computing; Population; Algorithm; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01373978444299139,"gpt":0.2743899145485825,"spread":0.2606501301055911,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001454211,0.0001252548,0.0001926953,0.0001591826,0.0002436919,0.00005289019,0.002148636,0.00003776666,0.00001131321],"category_scores_gemma":[0.00001191782,0.00008324784,0.0001201454,0.0003765296,0.0001114696,0.0003029043,0.0002993249,0.0001974213,0.000005490763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000556321,"about_ca_system_score_gemma":0.000129867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000178738,"about_ca_topic_score_gemma":0.00002150673,"domain_scores_codex":[0.9978672,0.00003295696,0.0009655429,0.0001592167,0.0007992423,0.0001758645],"domain_scores_gemma":[0.9973784,0.0002455969,0.0009514195,0.0004434067,0.0009376607,0.00004351707],"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.000066683,0.0004510668,0.004189073,0.00007242674,0.0005136977,0.000005760176,0.002242495,0.1660905,0.07310528,0.6163275,0.000595702,0.1363398],"study_design_scores_gemma":[0.0006871095,0.00009314104,0.0122329,0.0001009069,0.00005876691,0.0001713471,0.0001982285,0.8898828,0.07696044,0.01863443,0.0008084941,0.0001714164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4547237,0.0001870956,0.5432959,0.001492264,0.00009454089,0.0001544286,0.000002948276,0.00001889573,0.00003022798],"genre_scores_gemma":[0.9612241,0.0000384124,0.03843295,0.0001048154,0.0001648419,0.000009496149,0.00000962514,0.000009377833,0.000006420926],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7237923,"threshold_uncertainty_score":0.3992735,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2597280094","doi":"10.1177/1094342017694426","title":"Communication analysis and optimization of 3D front tracking method for multiphase flow simulations","year":2017,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Fluid Dynamics and Heat Transfer","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Koç Üniversitesi; Partnership for Advanced Computing in Europe AISBL; Ryerson University","keywords":"Eulerian path; Computer science; Scalability; Parallel computing; Speedup; Grid; Scaling; Computational science; Lagrangian; Applied mathematics; Mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.0152603325188059,"gpt":0.2998580077152,"spread":0.2845976751963942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004107611,0.00007478458,0.0001644068,0.0001645258,0.000348745,0.00009618336,0.000555511,0.00003290979,0.000007421026],"category_scores_gemma":[0.00002747644,0.00006245469,0.00006851686,0.00006369562,0.0000520715,0.0001988611,0.00003806625,0.0001151374,2.844031e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004046445,"about_ca_system_score_gemma":0.00001626472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003368945,"about_ca_topic_score_gemma":0.0000334056,"domain_scores_codex":[0.9992831,0.00001409445,0.0004063711,0.00006535187,0.0001584865,0.00007261315],"domain_scores_gemma":[0.9987131,0.0002514478,0.0002180457,0.0002738583,0.0005184833,0.00002503349],"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.00001314484,0.00002449611,0.0009410573,0.00001337642,0.0003147066,4.624961e-8,0.0002182938,0.961606,0.0006346077,0.0005140845,0.000009527923,0.03571066],"study_design_scores_gemma":[0.0004366982,0.00001468363,0.009701173,0.00003609803,0.0002087414,0.000005284823,0.00001545988,0.9884834,0.0007319125,0.0001842742,0.0001232608,0.0000590526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1481494,0.0001122578,0.8511133,0.0003175845,0.00007974442,0.0001400321,0.00004002432,0.00001211885,0.00003552009],"genre_scores_gemma":[0.6434159,0.0001753649,0.3562912,0.00001086118,0.00006743859,0.0000052645,0.00002331516,0.000007375323,0.000003270575],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4952665,"threshold_uncertainty_score":0.26823,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019339271","doi":"10.1177/1094342003173005","title":"Scalable Bulk Data Transfer in Wide Area Networks","year":2003,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Toronto; Western Michigan University; Huazhong University of Science and Technology; University of Bahrain; National Science Foundation","keywords":"Computer science; Scalability; Distributed computing; Bandwidth (computing); Wide area network; Computer network; Interface (matter); Network interface; Network architecture; Flexibility (engineering); Network traffic control; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02637830791314835,"gpt":0.2605884293560753,"spread":0.2342101214429269,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001651339,0.0001269754,0.0001893429,0.0001386412,0.0001685185,0.0002227722,0.00445065,0.0000434434,0.0000071699],"category_scores_gemma":[0.00004735493,0.00009545023,0.00004874275,0.0004559176,0.00004906506,0.0004242986,0.0002613561,0.0003650561,0.00001510229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007979361,"about_ca_system_score_gemma":0.0001435222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000321492,"about_ca_topic_score_gemma":0.000006270659,"domain_scores_codex":[0.9983191,0.0000863782,0.0006520022,0.0002321323,0.0004757662,0.0002345943],"domain_scores_gemma":[0.998316,0.0003636941,0.0002446209,0.0006887635,0.0003286161,0.00005833812],"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.0000166777,0.0002010796,0.01045519,0.00001054945,0.0001015213,0.00001159289,0.0003157766,0.9197052,0.00004796707,0.0456721,0.002819306,0.02064309],"study_design_scores_gemma":[0.0006271359,0.00003812848,0.007586043,0.0001509154,0.000009856063,0.0003826207,0.00002510598,0.9500717,0.000160941,0.001119633,0.03966462,0.0001632975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1569597,0.0002469926,0.8402341,0.001169129,0.0006671827,0.0001252205,0.000004315168,0.00003013687,0.0005632415],"genre_scores_gemma":[0.9919879,0.00007867297,0.007356469,0.0002862255,0.0002247453,0.000004580946,0.0000152218,0.000007716319,0.00003848899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8350282,"threshold_uncertainty_score":0.827049,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2770790588","doi":"10.1177/1094342017736373","title":"Performance analysis of fully explicit and fully implicit solvers within a spectral element shallow-water atmosphere model","year":2017,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Climate variability and models","field":"Environmental Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Sandia National Laboratories; Lawrence Livermore National Laboratory; Oak Ridge National Laboratory; Biological and Environmental Research; U.S. Department of Energy; Advanced Scientific Computing Research; Division of Mathematical Sciences; Office of Science; Southern Methodist University; UT-Battelle; Battelle; York University","keywords":"Preconditioner; Solver; Computer science; Shallow water equations; Parallel computing; Computational science; Graphics processing unit; Applied mathematics; Mathematical optimization; Algorithm; Iterative method; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0158174159195144,"gpt":0.2580294640505487,"spread":0.2422120481310343,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00099859,0.00013929,0.0002603996,0.00004646886,0.0005730243,0.0001062713,0.001249167,0.00004085887,0.0001365531],"category_scores_gemma":[0.00001382817,0.00009384609,0.0001163112,0.00009906835,0.0002171666,0.0003780058,0.0004910827,0.0002348291,0.00001142271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001523011,"about_ca_system_score_gemma":0.0000278443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001805794,"about_ca_topic_score_gemma":0.00008755876,"domain_scores_codex":[0.9984251,0.00001972066,0.0006195017,0.0002038576,0.0005248141,0.0002069764],"domain_scores_gemma":[0.9986185,0.00005918269,0.0006919013,0.0004404288,0.0001217579,0.0000682558],"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.00007171588,0.00009513387,0.08224776,0.00001101516,0.0003527824,7.46723e-7,0.001268962,0.9044275,0.006299187,0.001076483,0.00003541343,0.004113324],"study_design_scores_gemma":[0.0003250442,0.00006215541,0.128674,0.00002704041,0.0002090541,0.00002711232,0.00008224693,0.8672106,0.002478933,0.0006838933,0.0001125495,0.0001073199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9808443,0.000007809796,0.01694817,0.001040737,0.00008177608,0.0001613317,0.00001321724,0.000009409891,0.0008932652],"genre_scores_gemma":[0.9945127,0.00009631637,0.005118276,0.0001120932,0.00008538413,0.00001057764,0.0000074011,0.000009063714,0.00004813339],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04642629,"threshold_uncertainty_score":0.4407297,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070041137","doi":"10.1177/1094342003017001006","title":"Applying Parmetis to Structured Remeshing for Industrial CFD Applications","year":2003,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Compute Canada; Polytechnique Montréal","funders":"Centres de Recerca de Catalunya; Polytechnique Montréal; Université Laval","keywords":"Computer science; Smoothing; Domain decomposition methods; Adaptation (eye); Context (archaeology); Parallel computing; Computational fluid dynamics; Computational science; Domain (mathematical analysis); Computation; Class (philosophy); Algorithm; Finite element method; Mathematics; Artificial intelligence; Aerospace engineering; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03887194357379667,"gpt":0.3222519569918497,"spread":0.2833800134180531,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007351086,0.0001620928,0.000226943,0.0001782324,0.000243889,0.00008682568,0.0008731816,0.00005742268,0.000009712325],"category_scores_gemma":[0.0002376984,0.0001344065,0.00008863858,0.0003856931,0.00004348216,0.0001357969,0.00005737757,0.0003347148,0.00001089482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000188696,"about_ca_system_score_gemma":0.00005975684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.545571e-7,"about_ca_topic_score_gemma":3.969408e-7,"domain_scores_codex":[0.998469,0.00003553243,0.0007015101,0.0001434892,0.0004419745,0.0002085077],"domain_scores_gemma":[0.9977599,0.001057657,0.0003154653,0.0002292918,0.0005472014,0.00009049827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001682843,0.00003102811,0.0001043898,0.0000255263,0.0001170233,3.404769e-7,0.0001365416,0.7331872,0.001156137,0.02377239,0.0005697059,0.2408829],"study_design_scores_gemma":[0.002026787,0.0001818512,0.0006495661,0.0002889557,0.0001563804,0.0004778287,0.0004263382,0.2393995,0.02736039,0.1664067,0.5618264,0.0007992986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03487805,0.00009092161,0.9625911,0.0003279746,0.0007074646,0.001064603,0.00001595618,0.00007834481,0.0002456314],"genre_scores_gemma":[0.5903149,0.00001932909,0.4083983,0.0001424759,0.000720657,0.0003624612,0.000004851284,0.00002677049,0.00001025745],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5612567,"threshold_uncertainty_score":0.5480936,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4409624861","doi":"10.1177/10943420251334456","title":"Preparing the TAU performance system for exascale and beyond","year":2025,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada); École de Technologie Supérieure","funders":"Office of Science; National Aeronautics and Space Administration","keywords":"Exascale computing; Computer science; Parallel computing; Supercomputer","retraction":null,"screen_n_in":null,"score":{"opus":0.008627947745729165,"gpt":0.2642782563427847,"spread":0.2556503085970556,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00104075,0.0001048803,0.0001392877,0.0001397016,0.0005967891,0.0002514783,0.002041938,0.00003296993,3.180919e-7],"category_scores_gemma":[0.00002524575,0.00006622895,0.00005605487,0.0002577245,0.00008290409,0.0002640999,0.000386546,0.0001885532,0.000001614802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008681524,"about_ca_system_score_gemma":0.00009839956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005977323,"about_ca_topic_score_gemma":6.701035e-7,"domain_scores_codex":[0.9989389,0.00003423313,0.0004525368,0.0001602345,0.0002688997,0.0001452004],"domain_scores_gemma":[0.9983108,0.0003792009,0.0004025443,0.0003262325,0.0005538174,0.00002738164],"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.00006939966,0.0001080484,0.002611084,0.0001553064,0.0002902769,6.721797e-7,0.00111732,0.1890132,0.00032103,0.2621371,0.008480323,0.5356962],"study_design_scores_gemma":[0.0004031423,0.00005989729,0.005024109,0.0001837514,0.00002407371,0.0001398547,0.00007267015,0.9761593,0.004056651,0.001584586,0.01218708,0.0001048569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1281304,0.0002426034,0.8668197,0.003007712,0.0004447374,0.0002717949,0.000001279944,0.00009187563,0.0009899159],"genre_scores_gemma":[0.9418595,0.0001130293,0.05730502,0.0003529104,0.0002257752,0.00003410654,0.000001421109,0.000005341873,0.0001028639],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8137292,"threshold_uncertainty_score":0.459008,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027923939","doi":"10.1177/1094342006064571","title":"Scalability Modeling For Deterministic Particle Transport Solvers","year":2006,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Nuclear reactor physics and engineering","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Solver; Neutron transport; Scalability; Parallel computing; Computation; Computational science; Code (set theory); Algorithm; Neutron; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.008819408599540089,"gpt":0.2145998579679493,"spread":0.2057804493684093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001675891,0.00006808571,0.00008731261,0.00002843938,0.00007507361,0.00002716789,0.0003075665,0.00001666879,0.000002348554],"category_scores_gemma":[0.000002835644,0.0000556476,0.00005514488,0.00006278841,0.00001917808,0.00008990237,0.00001158232,0.0001035517,0.000002912944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006183131,"about_ca_system_score_gemma":0.00001443394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001151323,"about_ca_topic_score_gemma":0.000001561184,"domain_scores_codex":[0.9993938,0.000002185089,0.000289509,0.00005311371,0.0001525198,0.0001089149],"domain_scores_gemma":[0.9996149,0.00005420561,0.00005810889,0.00009320665,0.000156803,0.00002276693],"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.0000069329,0.00002002309,0.0002733054,0.00001434329,0.00002739165,3.058205e-7,0.00004041881,0.9862421,0.002618349,0.00243317,0.00004825815,0.008275413],"study_design_scores_gemma":[0.0001902808,0.00001259896,0.002186472,0.00002116168,0.0000166654,0.00001931867,0.00001295034,0.9929426,0.001438241,0.001021747,0.002073824,0.00006419093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6799088,0.00002617603,0.3196265,0.00006452633,0.0001534135,0.00006480813,0.00000370743,0.00003397228,0.0001180999],"genre_scores_gemma":[0.9972241,0.00001302471,0.002176612,0.00001212238,0.0005397829,0.000008144313,0.000005329599,0.00001639748,0.00000446715],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3174499,"threshold_uncertainty_score":0.2269243,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109711595","doi":"10.1177/1094342011428144","title":"A framework for GPU accelerated deformable object modeling","year":2011,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"3D Shape Modeling and Analysis","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Nvidia","keywords":"Computer science; CUDA; Multi-core processor; Computation; Computational science; Object (grammar); General-purpose computing on graphics processing units; Animation; Parallel computing; Matching (statistics); Set (abstract data type); Implementation; Computer graphics (images); Graphics; Algorithm; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.04742452505667533,"gpt":0.2750817371509177,"spread":0.2276572120942423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003535294,0.0001029803,0.0001420952,0.0001307294,0.0001662759,0.00005640765,0.0007040461,0.00004370057,0.00001807255],"category_scores_gemma":[0.00001550879,0.0000768046,0.0001007101,0.0001547757,0.00001859082,0.000165825,0.00003903609,0.0002473451,0.00001385753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007296898,"about_ca_system_score_gemma":0.00003313309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001341749,"about_ca_topic_score_gemma":0.000001609548,"domain_scores_codex":[0.9991055,0.000006704334,0.0004404221,0.00007698681,0.0002164213,0.0001540093],"domain_scores_gemma":[0.9991138,0.00007333006,0.0001490142,0.0001478021,0.0004773808,0.00003866187],"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.00001690385,0.00002240251,0.00007327143,0.000008549559,0.0001570652,2.063707e-7,0.0004186323,0.9738145,0.0001042998,0.001410586,0.00005722957,0.02391633],"study_design_scores_gemma":[0.0001739322,0.00001963902,0.00007415332,0.00006563091,0.00004391585,0.00002983281,0.00006863666,0.9935382,0.001681383,0.003923884,0.0002914914,0.00008931131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3702809,0.0001250968,0.6290093,0.0001012225,0.0001730727,0.00006441346,0.000003319563,0.00004739101,0.0001952741],"genre_scores_gemma":[0.9234611,0.0001618827,0.07558016,0.00008002235,0.0006618265,0.00001691211,0.000005679396,0.00001913229,0.00001321972],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5534291,"threshold_uncertainty_score":0.3132001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079253715","doi":"10.1177/1094342014548864","title":"Extreme-scale computing services over MPI: Experiences, observations and features proposal for next-generation message passing interface","year":2014,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Advanced Scientific Computing Research; Division of Mathematical Sciences; Argonne National Laboratory; Natural Sciences and Engineering Research Council of Canada; Office of Science","keywords":"Computer science; Message Passing Interface; Software portability; Message passing; Implementation; Workaround; Interface (matter); Supercomputer; Distributed computing; Scale (ratio); Programming paradigm; Operating system; Software engineering; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.03491654217823178,"gpt":0.2863399186556468,"spread":0.251423376477415,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007818369,0.0001673065,0.0001909968,0.0001544829,0.0006121501,0.0005440084,0.002093001,0.00005769834,0.000001773149],"category_scores_gemma":[0.00006483341,0.0001267373,0.00005109377,0.0002434534,0.0001505733,0.00126136,0.0005735056,0.0002597047,0.000001358734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001123555,"about_ca_system_score_gemma":0.00009087552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001597248,"about_ca_topic_score_gemma":0.00001923415,"domain_scores_codex":[0.9984329,0.00004299537,0.0005249556,0.0002830657,0.0005087607,0.0002073385],"domain_scores_gemma":[0.9978873,0.0003100003,0.0007023962,0.0003895909,0.0006643802,0.00004638348],"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.00005478362,0.0002321379,0.002596148,0.0001209994,0.0001810445,0.000001824741,0.01088934,0.06372809,0.04175813,0.1830744,0.002561001,0.6948022],"study_design_scores_gemma":[0.0005921302,0.0001299523,0.005971508,0.0001849948,0.00002259762,0.0001721391,0.001028625,0.9581447,0.01630841,0.008385953,0.008796322,0.0002627145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.396562,0.0001852015,0.6005813,0.00206802,0.0003313737,0.0001742445,0.000004540551,0.00007737341,0.00001595285],"genre_scores_gemma":[0.7066469,0.00003561627,0.292619,0.0002127043,0.000431347,0.00002341954,0.000009953665,0.00000913767,0.00001190087],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8944166,"threshold_uncertainty_score":0.5245885,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2980640139","doi":"10.1177/1094342020926237","title":"Comparing perturbation models for evaluating stability of neuroimaging pipelines","year":2020,"lang":"en","type":"preprint","venue":"The International Journal of High Performance Computing Applications","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Computer science; Human Connectome Project; Neuroimaging; Implementation; Normalization (sociology); Perturbation (astronomy); Pipeline (software); Stability (learning theory); Software; Data mining; Machine learning; Artificial intelligence; Algorithm; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.3437047302170523,"gpt":0.4402400844986833,"spread":0.09653535428163101,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01005983,0.0002105921,0.000521572,0.0003663437,0.0003195362,0.0005859923,0.004804615,0.00005279672,0.00001187497],"category_scores_gemma":[0.001924009,0.0001496477,0.0002817677,0.0004107992,0.0001505256,0.0003032157,0.00227286,0.0005301218,0.000006551306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001289203,"about_ca_system_score_gemma":0.0002982703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003619507,"about_ca_topic_score_gemma":0.000002965521,"domain_scores_codex":[0.994327,0.0001762799,0.002265063,0.0005814834,0.002456938,0.0001932409],"domain_scores_gemma":[0.988463,0.002531721,0.003452216,0.000953463,0.00452836,0.00007119513],"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.0001291405,0.00009142468,0.001562536,0.00006799155,0.0001057719,3.28344e-7,0.001115625,0.9100184,0.0003749282,0.003412097,0.001788503,0.08133329],"study_design_scores_gemma":[0.0003311621,0.00005541759,0.002757502,0.0001664509,0.00006420918,0.00001065562,0.0003146769,0.9259794,0.0005950539,0.06878357,0.0008211557,0.0001207763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.444976,0.00009612872,0.549263,0.003612058,0.001433047,0.0004076099,0.00003920483,0.00002060179,0.0001523184],"genre_scores_gemma":[0.9665446,0.0000229436,0.03225884,0.0001684859,0.0008964263,0.00001943551,0.00004663011,0.00001534107,0.0000272628],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5215686,"threshold_uncertainty_score":0.892825,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4399828530","doi":"10.1177/10943420241261989","title":"Exploiting mesh structure to improve multigrid performance for saddle-point problems","year":2024,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Advanced Numerical Methods in Computational Mathematics","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":"Memorial University of Newfoundland","funders":"National Science Foundation","keywords":"Multigrid method; Saddle point; Saddle; Computer science; Computational science; Mathematical optimization; Algorithm; Geometry; Mathematics; Mathematical analysis; Partial differential equation","retraction":null,"screen_n_in":null,"score":{"opus":0.01803356805126258,"gpt":0.2990073578521079,"spread":0.2809737898008453,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005187914,0.0001828961,0.0002107855,0.0001886736,0.0001610509,0.000143351,0.0008236858,0.00004353692,0.00001111759],"category_scores_gemma":[0.00008441997,0.0001373426,0.00009257891,0.0002530418,0.00004327181,0.000280394,0.0001027673,0.0003788116,0.00001888997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002103712,"about_ca_system_score_gemma":0.00004883634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.286058e-7,"about_ca_topic_score_gemma":3.248099e-7,"domain_scores_codex":[0.9984839,0.00001488351,0.0006863032,0.0001687436,0.0004254236,0.0002207493],"domain_scores_gemma":[0.9981854,0.0008797639,0.0001780094,0.0001850588,0.0004979275,0.00007386738],"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.00001266279,0.00001531864,0.00002142263,0.0002159712,0.0001158597,6.012488e-7,0.0004855458,0.7509325,0.005693066,0.002694881,0.0003352827,0.2394769],"study_design_scores_gemma":[0.0002184691,0.00009592695,0.0002405161,0.0004145853,0.00003138207,0.0001320118,0.00007254056,0.9645521,0.01412395,0.01046238,0.009465423,0.0001907343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2899024,0.0001823064,0.7074904,0.0005745653,0.001252944,0.0003899376,0.00002945691,0.0001258811,0.00005216199],"genre_scores_gemma":[0.7160202,0.00005637065,0.2825435,0.0001042133,0.001155109,0.00006024549,0.000006428386,0.00003728885,0.00001664206],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4261178,"threshold_uncertainty_score":0.560067,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030017732","doi":"10.1177/1094342012448133","title":"Graphical processing units and scientific applications","year":2012,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science; Grid; Leverage (statistics); Computer graphics (images); Ray tracing (physics); Parallel computing; Initialization; Computational science; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02274150673088886,"gpt":0.3030656903793919,"spread":0.280324183648503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018719,0.000104051,0.0001149201,0.0003194927,0.0005617451,0.0004891471,0.001606366,0.00003522514,0.000001689083],"category_scores_gemma":[0.00001332138,0.00007777302,0.0000367138,0.0009484629,0.0001739384,0.000676191,0.0003887775,0.0002209304,0.00000399778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003292166,"about_ca_system_score_gemma":0.0001019428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003574167,"about_ca_topic_score_gemma":4.822024e-7,"domain_scores_codex":[0.9987298,0.00003428475,0.0004180286,0.0001522265,0.0004817163,0.0001838928],"domain_scores_gemma":[0.9980245,0.000114145,0.0004102953,0.0002822781,0.001072478,0.00009636145],"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.000003458397,0.0001244151,0.005256985,0.00001499941,0.00003419378,2.922596e-7,0.0007337665,0.00009978077,0.0003099821,0.7423996,0.0003864352,0.2506361],"study_design_scores_gemma":[0.001108233,0.0002011888,0.09018201,0.0003418025,0.00008558723,0.001682582,0.0002193048,0.5166726,0.008952158,0.05071296,0.3290042,0.0008374262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1229985,0.0007117674,0.8747756,0.0009487288,0.0002644165,0.0001665809,0.000001489288,0.00007328491,0.00005960441],"genre_scores_gemma":[0.9784595,0.0001164566,0.02066952,0.0001889559,0.0005117732,0.0000246208,0.000004101685,0.000007400643,0.00001764021],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8554611,"threshold_uncertainty_score":0.4716857,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2896168333","doi":"10.1177/1094342018803672","title":"New BSP/CGM algorithms for spanning trees","year":2018,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Spanning tree; Parallel algorithm; Algorithm; Graph; Computation; Bulk synchronous parallel; Ranking (information retrieval); Theoretical computer science; Parallel computing; Mathematics; Artificial intelligence; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.03186813572026007,"gpt":0.3448644533184474,"spread":0.3129963175981873,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009285019,0.0001141717,0.0001440239,0.000220175,0.0004117261,0.0002007586,0.003421845,0.00003119605,0.00001103859],"category_scores_gemma":[0.00005991341,0.00008382603,0.00009138182,0.000362689,0.0001324533,0.000465299,0.0003568137,0.0002335863,0.00003351202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008462205,"about_ca_system_score_gemma":0.0001910238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001173722,"about_ca_topic_score_gemma":0.000002768692,"domain_scores_codex":[0.9985205,0.00002977353,0.0004355005,0.0001924272,0.0005759906,0.0002458344],"domain_scores_gemma":[0.9975363,0.0004232937,0.0004245191,0.0003817427,0.00114233,0.0000917877],"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.00005858077,0.0000494954,0.0002811592,0.000004656501,0.0001117709,0.000001363661,0.0006213803,0.005496781,0.001305275,0.1304573,0.00268129,0.8589309],"study_design_scores_gemma":[0.001968588,0.0007222862,0.008638011,0.0001904805,0.0000317973,0.0006179435,0.0001349756,0.6624801,0.02719714,0.1844334,0.1131746,0.0004106542],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03882689,0.0001047273,0.9552642,0.004684955,0.0006345201,0.000199534,0.000002789367,0.0000465482,0.0002358517],"genre_scores_gemma":[0.696815,0.00003059708,0.300749,0.0002303417,0.001960282,0.00001040708,0.000001756171,0.000009958095,0.0001927119],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8585203,"threshold_uncertainty_score":0.6358696,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}