{"meta":{"query_hash":"34e36ea59bca","filters":{"venue":"The International Journal of High Performance Computing Applications"},"cohort_total":19,"direct_labels_cover":0,"predictions_cover":19,"exported":19,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/34e36ea59bca","api":"https://metacan.xera.ac/api/v1/cohort?venue=The+International+Journal+of+High+Performance+Computing+Applications"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028602298249578183,"score_gpt":0.29799596955056074,"score_spread":0.2693936713009826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981345850","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5616871,0.000047275153,0.43728286,0.00037015902,0.0004108079,0.00013368219,0.000006895837,0.000057154277,0.0000040532655],"genre_scores_gemma":[0.80825686,0.000033654178,0.1912232,0.00014799311,0.0003102671,0.000003794622,0.000005353845,0.000013591239,0.000005275993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982645,0.000022840497,0.0006929073,0.0002849475,0.0004570194,0.00027780578],"domain_scores_gemma":[0.9977237,0.00035614966,0.00074224756,0.0005330422,0.00059073797,0.000054120086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050714525,0.00020287008,0.00025994296,0.00026313993,0.00038567508,0.00018149079,0.002106011,0.00007892303,0.0000024239105],"category_scores_gemma":[0.000090791924,0.00016665235,0.000043435004,0.00051559065,0.00024831295,0.00095195236,0.0007836602,0.00086660957,0.0000069514913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003025019,0.00027689847,0.03716865,0.000027556782,0.00009690121,0.000011337005,0.0012697201,0.4740629,0.014288945,0.041572798,0.000041323427,0.43115273],"study_design_scores_gemma":[0.0007957934,0.000041111896,0.02789537,0.00010549875,0.000011350795,0.00027360138,0.00007104001,0.9640198,0.0040923725,0.0020975005,0.00040402717,0.0001925706],"about_ca_topic_score_codex":0.00008216676,"about_ca_topic_score_gemma":0.000034064433,"teacher_disagreement_score":0.4899569,"about_ca_system_score_codex":0.00013283057,"about_ca_system_score_gemma":0.00011084924,"threshold_uncertainty_score":0.67958856},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02637830791314835,"score_gpt":0.2605884293560753,"score_spread":0.23421012144292694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019339271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15695968,0.0002469926,0.8402341,0.0011691286,0.0006671827,0.00012522051,0.000004315168,0.000030136875,0.00056324154],"genre_scores_gemma":[0.9919879,0.00007867297,0.007356469,0.00028622546,0.00022474534,0.000004580946,0.000015221799,0.000007716319,0.000038488994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831915,0.000086378204,0.00065200217,0.0002321323,0.0004757662,0.0002345943],"domain_scores_gemma":[0.998316,0.00036369413,0.00024462087,0.00068876345,0.00032861612,0.000058338115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016513389,0.0001269754,0.00018934289,0.00013864117,0.00016851851,0.0002227722,0.0044506504,0.000043443397,0.0000071699],"category_scores_gemma":[0.000047354926,0.00009545023,0.000048742746,0.00045591756,0.000049065064,0.0004242986,0.0002613561,0.00036505613,0.000015102287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000166777,0.00020107957,0.010455195,0.000010549446,0.00010152129,0.000011592888,0.00031577656,0.91970515,0.000047967074,0.0456721,0.0028193062,0.02064309],"study_design_scores_gemma":[0.00062713586,0.000038128484,0.0075860433,0.00015091541,0.000009856063,0.00038262072,0.000025105977,0.9500717,0.00016094101,0.0011196329,0.03966462,0.00016329746],"about_ca_topic_score_codex":0.000032149197,"about_ca_topic_score_gemma":0.000006270659,"teacher_disagreement_score":0.83502823,"about_ca_system_score_codex":0.00007979361,"about_ca_system_score_gemma":0.00014352216,"threshold_uncertainty_score":0.827049},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03328211042214087,"score_gpt":0.2965294496184481,"score_spread":0.2632473391963073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020027705","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55471486,0.0000568717,0.44183686,0.0027754398,0.00009601797,0.00012198293,0.000003952498,0.000015692449,0.00037831152],"genre_scores_gemma":[0.98373514,0.000011629367,0.015346618,0.0006624183,0.00021523013,0.0000061330693,0.0000072563084,0.0000073595575,0.000008215797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998121,0.000209411,0.0006393487,0.00016972196,0.000712774,0.0001477388],"domain_scores_gemma":[0.99691826,0.0009426462,0.0010076668,0.00038258705,0.0007032833,0.0000455328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027403438,0.000129276,0.00020562838,0.000092614675,0.00034000113,0.00015128736,0.0014941241,0.000032140946,0.0000027989136],"category_scores_gemma":[0.0000678755,0.000075434866,0.000050399096,0.00035859345,0.000074739015,0.00018978081,0.00008539904,0.0003092499,0.000006126207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016040898,0.0002873221,0.013731819,0.00010124572,0.0005469232,0.0000026353655,0.0023300047,0.65677625,0.0027779252,0.30811214,0.0004934448,0.01467987],"study_design_scores_gemma":[0.0029158266,0.00054358906,0.08309356,0.00092993246,0.000081100654,0.0009505832,0.00082469976,0.8462983,0.02489524,0.008881146,0.02985136,0.00073467736],"about_ca_topic_score_codex":0.000039199458,"about_ca_topic_score_gemma":0.0000027183553,"teacher_disagreement_score":0.4290203,"about_ca_system_score_codex":0.00004417547,"about_ca_system_score_gemma":0.00009303468,"threshold_uncertainty_score":0.30761448},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Solver; Neutron transport; Scalability; Parallel computing; Computation; Computational science; Code (set theory); Algorithm; Neutron; Physics","score_opus":0.008819408599540089,"score_gpt":0.21459985796794934,"score_spread":0.20578044936840925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027923939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6799088,0.000026176032,0.31962648,0.00006452633,0.00015341354,0.000064808126,0.0000037074303,0.000033972276,0.00011809987],"genre_scores_gemma":[0.9972241,0.000013024711,0.0021766124,0.000012122382,0.0005397829,0.000008144313,0.0000053295994,0.000016397478,0.0000044671497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939376,0.0000021850894,0.00028950901,0.000053113712,0.0001525198,0.000108914865],"domain_scores_gemma":[0.9996149,0.000054205608,0.00005810889,0.000093206654,0.00015680303,0.000022766933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016758913,0.00006808571,0.00008731261,0.000028439375,0.00007507361,0.000027167887,0.00030756654,0.000016668791,0.0000023485536],"category_scores_gemma":[0.000002835644,0.0000556476,0.000055144883,0.00006278841,0.000019178082,0.00008990237,0.000011582324,0.00010355174,0.0000029129437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069329,0.000020023092,0.00027330537,0.000014343289,0.00002739165,3.058205e-7,0.000040418807,0.9862421,0.0026183487,0.0024331703,0.000048258153,0.008275413],"study_design_scores_gemma":[0.00019028077,0.000012598961,0.0021864723,0.000021161679,0.000016665399,0.000019318666,0.000012950336,0.9929426,0.0014382408,0.0010217469,0.0020738244,0.00006419093],"about_ca_topic_score_codex":0.000011513233,"about_ca_topic_score_gemma":0.0000015611841,"teacher_disagreement_score":0.31744987,"about_ca_system_score_codex":0.00006183131,"about_ca_system_score_gemma":0.000014433936,"threshold_uncertainty_score":0.22692433},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022741506730888858,"score_gpt":0.3030656903793919,"score_spread":0.28032418364850303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030017732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12299849,0.0007117674,0.87477565,0.0009487288,0.00026441654,0.00016658092,0.0000014892876,0.000073284915,0.00005960441],"genre_scores_gemma":[0.97845954,0.00011645664,0.020669516,0.00018895594,0.00051177316,0.000024620796,0.000004101685,0.0000074006434,0.000017640212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987298,0.000034284752,0.00041802862,0.00015222645,0.00048171627,0.00018389279],"domain_scores_gemma":[0.99802446,0.00011414505,0.00041029527,0.00028227808,0.0010724777,0.00009636145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010187189,0.00010405103,0.00011492009,0.00031949268,0.0005617451,0.00048914715,0.0016063655,0.000035225145,0.0000016890825],"category_scores_gemma":[0.0000133213825,0.00007777302,0.000036713802,0.00094846287,0.0001739384,0.000676191,0.00038877747,0.00022093044,0.0000039977804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003458397,0.0001244151,0.005256985,0.00001499941,0.000034193785,2.9225959e-7,0.0007337665,0.000099780766,0.00030998208,0.74239963,0.00038643516,0.25063607],"study_design_scores_gemma":[0.0011082325,0.0002011888,0.09018201,0.00034180246,0.000085587235,0.0016825821,0.00021930478,0.51667255,0.008952158,0.05071296,0.3290042,0.00083742617],"about_ca_topic_score_codex":0.0000035741673,"about_ca_topic_score_gemma":4.822024e-7,"teacher_disagreement_score":0.85546106,"about_ca_system_score_codex":0.00003292166,"about_ca_system_score_gemma":0.00010194277,"threshold_uncertainty_score":0.47168574},"labels":[],"label_agreement":null},{"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.030757544522088925,"score_gpt":0.2976504321479393,"score_spread":0.2668928876258504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057980100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52629197,0.0000054517914,0.47218487,0.0013177827,0.000060542803,0.0001100371,0.00000437812,0.00001077625,0.000014178264],"genre_scores_gemma":[0.9033016,0.00012299558,0.09625329,0.00016737536,0.00012296592,0.00000660424,0.0000060875723,0.000004646716,0.000014438621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989467,0.00005257258,0.00038077618,0.00013347034,0.0003652035,0.00012126326],"domain_scores_gemma":[0.9985538,0.00019589547,0.0006321345,0.00019975603,0.0003646961,0.000053710606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004876882,0.00009322752,0.00012874044,0.000114179835,0.00014840139,0.00012376675,0.0004746529,0.000021658467,0.00001297323],"category_scores_gemma":[0.000011167768,0.00006561981,0.00003301504,0.0001572961,0.000085358646,0.000809568,0.00016250357,0.00017035077,0.0000026624543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009214086,0.0012739407,0.18540159,0.00015996718,0.0012442039,0.00011597868,0.007074826,0.08934039,0.0012446472,0.39957306,0.0018152598,0.31183472],"study_design_scores_gemma":[0.0055434615,0.0010211458,0.26509696,0.00044049026,0.00023107443,0.009079608,0.0014658164,0.67956644,0.0068952907,0.01578177,0.014087141,0.00079081213],"about_ca_topic_score_codex":0.000038590108,"about_ca_topic_score_gemma":0.000009410358,"teacher_disagreement_score":0.59022605,"about_ca_system_score_codex":0.00003991795,"about_ca_system_score_gemma":0.000080447826,"threshold_uncertainty_score":0.2675898},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011850291406643993,"score_gpt":0.20639288932019523,"score_spread":0.19454259791355125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063730975","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96220434,0.0001546035,0.036112625,0.000825459,0.00018320218,0.000069099595,0.000012430421,0.000008489315,0.00042977545],"genre_scores_gemma":[0.9966748,0.00030864557,0.0025665201,0.000181441,0.00019692101,1.8725197e-7,0.00000768585,0.000002237447,0.00006156623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990994,0.000016650669,0.0003240392,0.00006252425,0.00041231565,0.00008512268],"domain_scores_gemma":[0.9990217,0.00008185869,0.0004262152,0.000116151474,0.0003282895,0.00002579031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020166193,0.00006418218,0.00009047981,0.00002275613,0.0002762944,0.000016923263,0.0008591502,0.00001958835,0.000023454362],"category_scores_gemma":[0.000014732875,0.000035404242,0.000060100134,0.00021439602,0.0001706103,0.00013863777,0.00003337826,0.00013701247,0.0000040004406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021618667,0.000028561855,0.284894,0.0000062125364,0.000037139725,4.4543853e-7,0.00026177382,0.7036265,0.000019922045,0.00045512678,0.00062138634,0.010027346],"study_design_scores_gemma":[0.00024783055,0.000038049264,0.41851497,0.000042712614,0.000017338612,0.00020156063,0.000080883474,0.5776891,0.00046845683,0.0016176363,0.0010115696,0.000069902],"about_ca_topic_score_codex":0.000059974776,"about_ca_topic_score_gemma":0.000013612511,"teacher_disagreement_score":0.13362099,"about_ca_system_score_codex":0.00000394014,"about_ca_system_score_gemma":0.000117908836,"threshold_uncertainty_score":0.2125061},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03887194357379667,"score_gpt":0.3222519569918497,"score_spread":0.2833800134180531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070041137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03487805,0.00009092161,0.96259105,0.00032797462,0.00070746464,0.0010646028,0.000015956175,0.00007834481,0.00024563144],"genre_scores_gemma":[0.5903149,0.000019329085,0.4083983,0.00014247587,0.000720657,0.00036246123,0.0000048512843,0.000026770495,0.000010257447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.998469,0.000035532434,0.00070151006,0.00014348923,0.0004419745,0.00020850766],"domain_scores_gemma":[0.9977599,0.0010576566,0.00031546527,0.00022929178,0.0005472014,0.00009049827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073510857,0.00016209282,0.00022694297,0.00017823243,0.000243889,0.000086825676,0.0008731816,0.00005742268,0.000009712325],"category_scores_gemma":[0.00023769839,0.00013440645,0.00008863858,0.00038569307,0.000043482156,0.00013579687,0.000057377572,0.0003347148,0.000010894823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016828428,0.00003102811,0.00010438982,0.000025526297,0.00011702334,3.4047693e-7,0.00013654162,0.7331872,0.0011561373,0.023772387,0.0005697059,0.24088289],"study_design_scores_gemma":[0.0020267873,0.00018185121,0.0006495661,0.00028895566,0.00015638043,0.00047782873,0.00042633823,0.2393995,0.027360395,0.16640672,0.5618264,0.00079929864],"about_ca_topic_score_codex":8.5455713e-7,"about_ca_topic_score_gemma":3.9694078e-7,"teacher_disagreement_score":0.5612567,"about_ca_system_score_codex":0.00018869604,"about_ca_system_score_gemma":0.000059756836,"threshold_uncertainty_score":0.54809356},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03529664305961611,"score_gpt":0.2622344497180172,"score_spread":0.22693780665840108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074326665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77117383,0.0002396756,0.2261854,0.0015121433,0.00026883092,0.00016941439,0.0000122220845,0.000012126119,0.0004263288],"genre_scores_gemma":[0.9924447,0.000040996965,0.0066170986,0.0004711255,0.00038078605,0.000004974859,0.000008721809,0.0000031312131,0.000028459395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891543,0.00008117637,0.00035730595,0.000062854444,0.00038852275,0.00019469183],"domain_scores_gemma":[0.99912864,0.00024463906,0.0002093039,0.00020264572,0.00017010719,0.000044635322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013598523,0.00008868418,0.000112454734,0.000058357047,0.0004934829,0.00007073255,0.0010319863,0.00002219749,0.000011802724],"category_scores_gemma":[0.000015849839,0.000053514224,0.000046351175,0.000237355,0.000046366793,0.00022747743,0.00007632971,0.00035554208,0.000037096925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033129974,0.000087955385,0.025638016,0.000012854943,0.00005491407,5.1059703e-7,0.008068567,0.88786364,0.000034217584,0.00078738295,0.0005139892,0.07690484],"study_design_scores_gemma":[0.0001393264,0.000029570278,0.28044882,0.000043369026,0.00001328062,0.000052398053,0.0015814858,0.71544766,0.000020822326,0.00016018494,0.0020003214,0.00006273849],"about_ca_topic_score_codex":0.00078418275,"about_ca_topic_score_gemma":0.000303212,"teacher_disagreement_score":0.2548108,"about_ca_system_score_codex":0.00003290517,"about_ca_system_score_gemma":0.000021210333,"threshold_uncertainty_score":0.37955213},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03491654217823178,"score_gpt":0.2863399186556468,"score_spread":0.25142337647741503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079253715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39656204,0.00018520147,0.6005813,0.00206802,0.00033137374,0.00017424452,0.000004540551,0.00007737341,0.000015952852],"genre_scores_gemma":[0.7066469,0.000035616267,0.29261902,0.00021270425,0.00043134697,0.000023419538,0.000009953665,0.00000913767,0.000011900868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984329,0.000042995365,0.0005249556,0.00028306572,0.0005087607,0.00020733845],"domain_scores_gemma":[0.99788725,0.0003100003,0.0007023962,0.00038959086,0.0006643802,0.000046383484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078183686,0.00016730647,0.00019099684,0.00015448287,0.0006121501,0.0005440084,0.0020930008,0.000057698344,0.0000017731487],"category_scores_gemma":[0.00006483341,0.0001267373,0.00005109377,0.00024345343,0.00015057327,0.0012613605,0.0005735056,0.00025970468,0.0000013587337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054783617,0.00023213794,0.0025961476,0.00012099944,0.00018104445,0.0000018247414,0.010889342,0.06372809,0.041758128,0.18307437,0.0025610009,0.69480217],"study_design_scores_gemma":[0.0005921302,0.0001299523,0.0059715076,0.00018499476,0.000022597622,0.00017213907,0.0010286251,0.95814466,0.016308414,0.0083859535,0.008796322,0.00026271454],"about_ca_topic_score_codex":0.00001597248,"about_ca_topic_score_gemma":0.000019234154,"teacher_disagreement_score":0.8944166,"about_ca_system_score_codex":0.00011235554,"about_ca_system_score_gemma":0.000090875525,"threshold_uncertainty_score":0.5245885},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04742452505667533,"score_gpt":0.27508173715091766,"score_spread":0.22765721209424233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109711595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37028092,0.00012509678,0.6290093,0.00010122253,0.0001730727,0.000064413456,0.0000033195627,0.000047391008,0.00019527413],"genre_scores_gemma":[0.92346114,0.00016188271,0.075580165,0.00008002235,0.0006618265,0.00001691211,0.0000056793956,0.000019132292,0.000013219722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910545,0.0000067043343,0.00044042207,0.000076986806,0.00021642131,0.00015400929],"domain_scores_gemma":[0.9991138,0.00007333006,0.00014901416,0.0001478021,0.00047738085,0.000038661874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035352944,0.000102980295,0.00014209516,0.00013072939,0.00016627587,0.00005640765,0.0007040461,0.000043700566,0.000018072555],"category_scores_gemma":[0.000015508795,0.0000768046,0.00010071005,0.00015477568,0.000018590816,0.00016582497,0.000039036087,0.0002473451,0.000013857526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016903852,0.000022402513,0.000073271425,0.0000085495585,0.00015706515,2.0637067e-7,0.0004186323,0.97381455,0.00010429978,0.0014105861,0.000057229572,0.023916334],"study_design_scores_gemma":[0.00017393222,0.000019639017,0.00007415332,0.00006563091,0.000043915854,0.000029832809,0.00006863666,0.9935382,0.0016813835,0.003923884,0.0002914914,0.00008931131],"about_ca_topic_score_codex":0.000013417494,"about_ca_topic_score_gemma":0.0000016095481,"teacher_disagreement_score":0.5534291,"about_ca_system_score_codex":0.00007296898,"about_ca_system_score_gemma":0.00003313309,"threshold_uncertainty_score":0.3132001},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013739784442991395,"score_gpt":0.2743899145485825,"score_spread":0.2606501301055911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131213031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45472372,0.00018709563,0.54329586,0.0014922637,0.00009454089,0.0001544286,0.0000029482762,0.000018895733,0.000030227975],"genre_scores_gemma":[0.9612241,0.000038412396,0.038432952,0.000104815364,0.00016484193,0.000009496149,0.00000962514,0.000009377833,0.000006420926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786717,0.00003295696,0.0009655429,0.00015921668,0.00079924235,0.00017586445],"domain_scores_gemma":[0.9973784,0.0002455969,0.00095141947,0.00044340666,0.0009376607,0.00004351707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014542106,0.00012525481,0.0001926953,0.00015918264,0.00024369193,0.00005289019,0.0021486357,0.00003776666,0.00001131321],"category_scores_gemma":[0.000011917823,0.00008324784,0.00012014542,0.00037652956,0.00011146956,0.00030290431,0.00029932486,0.00019742125,0.0000054907628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066683,0.0004510668,0.0041890726,0.000072426745,0.00051369774,0.0000057601765,0.0022424953,0.16609053,0.07310528,0.61632746,0.00059570203,0.13633981],"study_design_scores_gemma":[0.0006871095,0.00009314104,0.0122329015,0.000100906946,0.000058766913,0.00017134708,0.00019822846,0.8898828,0.07696044,0.018634433,0.0008084941,0.00017141641],"about_ca_topic_score_codex":0.000178738,"about_ca_topic_score_gemma":0.00002150673,"teacher_disagreement_score":0.72379225,"about_ca_system_score_codex":0.000055632103,"about_ca_system_score_gemma":0.000129867,"threshold_uncertainty_score":0.39927354},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014685999202683315,"score_gpt":0.2610724801576682,"score_spread":0.2463864809549849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169658931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7909834,0.000229478,0.20374312,0.004327819,0.00025192197,0.00015924088,0.000006339007,0.00006274497,0.000235971],"genre_scores_gemma":[0.93953776,0.00007410849,0.0591522,0.0006374752,0.0005580941,0.000008235816,0.0000025301588,0.000010489871,0.000019112194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854064,0.000051654435,0.00049838173,0.0002362799,0.00041817038,0.0002548826],"domain_scores_gemma":[0.9984188,0.0004528151,0.00049365096,0.00023488593,0.00031787655,0.00008196477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012044016,0.00016163394,0.00016528653,0.00028543544,0.00065534166,0.00035624948,0.0012080129,0.000030165189,0.0000035295584],"category_scores_gemma":[0.000034726796,0.0001196108,0.00005751693,0.00032594497,0.000115554285,0.00050409697,0.00044391816,0.00031214766,0.0000039766296],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016726068,0.000076731514,0.0020736433,0.000011534335,0.00011104798,0.0000035065398,0.0010441751,0.0077707693,0.00053761306,0.018528512,0.00011292017,0.9697128],"study_design_scores_gemma":[0.0015693742,0.0002466298,0.038815055,0.00027781393,0.000046425794,0.0011975644,0.00022573184,0.9331126,0.0024614746,0.01879658,0.002840133,0.00041058077],"about_ca_topic_score_codex":0.000014320611,"about_ca_topic_score_gemma":0.0000019837928,"teacher_disagreement_score":0.96930224,"about_ca_system_score_codex":0.00003107019,"about_ca_system_score_gemma":0.000032397977,"threshold_uncertainty_score":0.50404245},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.015260332518805896,"score_gpt":0.29985800771520005,"score_spread":0.2845976751963942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597280094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14814943,0.000112257796,0.8511133,0.0003175845,0.000079744415,0.00014003212,0.00004002432,0.000012118845,0.000035520094],"genre_scores_gemma":[0.6434159,0.00017536488,0.35629117,0.000010861177,0.00006743859,0.0000052645005,0.000023315157,0.0000073753226,0.0000032705748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992831,0.000014094453,0.00040637114,0.000065351865,0.00015848648,0.000072613155],"domain_scores_gemma":[0.99871314,0.0002514478,0.0002180457,0.00027385834,0.0005184833,0.000025033494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041076107,0.000074784584,0.0001644068,0.00016452585,0.00034874497,0.00009618336,0.00055551104,0.00003290979,0.0000074210257],"category_scores_gemma":[0.000027476439,0.00006245469,0.000068516856,0.000063695625,0.000052071497,0.00019886109,0.000038066246,0.00011513743,2.8440311e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013144838,0.000024496107,0.0009410573,0.000013376418,0.00031470665,4.624961e-8,0.00021829379,0.961606,0.0006346077,0.00051408453,0.000009527923,0.035710655],"study_design_scores_gemma":[0.0004366982,0.000014683635,0.009701173,0.00003609803,0.00020874139,0.0000052848227,0.000015459884,0.98848337,0.0007319125,0.00018427418,0.0001232608,0.000059052603],"about_ca_topic_score_codex":0.00003368945,"about_ca_topic_score_gemma":0.000033405602,"teacher_disagreement_score":0.4952665,"about_ca_system_score_codex":0.00004046445,"about_ca_system_score_gemma":0.000016264717,"threshold_uncertainty_score":0.26822996},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.015817415919514403,"score_gpt":0.25802946405054866,"score_spread":0.24221204813103425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770790588","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98084426,0.0000078097955,0.016948173,0.0010407369,0.00008177608,0.0001613317,0.000013217236,0.000009409891,0.0008932652],"genre_scores_gemma":[0.99451274,0.00009631637,0.005118276,0.0001120932,0.000085384134,0.000010577635,0.0000074011,0.000009063714,0.000048133392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984251,0.00001972066,0.0006195017,0.0002038576,0.00052481407,0.00020697637],"domain_scores_gemma":[0.9986185,0.000059182687,0.00069190125,0.00044042882,0.00012175793,0.0000682558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00099859,0.00013928997,0.00026039963,0.000046468856,0.00057302427,0.000106271276,0.0012491674,0.00004085887,0.0001365531],"category_scores_gemma":[0.000013828168,0.000093846094,0.00011631125,0.000099068355,0.00021716661,0.00037800585,0.0004910827,0.0002348291,0.000011422706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007171588,0.000095133866,0.082247764,0.000011015164,0.00035278243,7.46723e-7,0.0012689618,0.90442747,0.0062991874,0.0010764828,0.00003541343,0.0041133235],"study_design_scores_gemma":[0.00032504418,0.00006215541,0.12867405,0.000027040413,0.0002090541,0.000027112317,0.00008224693,0.8672106,0.0024789327,0.0006838933,0.0001125495,0.0001073199],"about_ca_topic_score_codex":0.00018057943,"about_ca_topic_score_gemma":0.00008755876,"teacher_disagreement_score":0.04642629,"about_ca_system_score_codex":0.0001523011,"about_ca_system_score_gemma":0.0000278443,"threshold_uncertainty_score":0.44072974},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03186813572026007,"score_gpt":0.3448644533184474,"score_spread":0.3129963175981873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896168333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038826894,0.00010472728,0.95526415,0.0046849553,0.00063452014,0.000199534,0.0000027893673,0.000046548197,0.00023585166],"genre_scores_gemma":[0.69681495,0.000030597083,0.30074897,0.00023034167,0.0019602824,0.000010407075,0.0000017561711,0.000009958095,0.00019271192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985205,0.000029773528,0.0004355005,0.00019242724,0.0005759906,0.00024583444],"domain_scores_gemma":[0.9975363,0.00042329368,0.00042451906,0.00038174266,0.0011423295,0.0000917877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092850195,0.00011417167,0.00014402387,0.00022017505,0.00041172607,0.00020075862,0.003421845,0.00003119605,0.000011038588],"category_scores_gemma":[0.00005991341,0.00008382603,0.00009138182,0.000362689,0.00013245326,0.00046529897,0.00035681375,0.00023358632,0.000033512017],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005858077,0.000049495404,0.00028115924,0.0000046565006,0.00011177094,0.000001363661,0.0006213803,0.0054967813,0.0013052749,0.1304573,0.0026812903,0.85893095],"study_design_scores_gemma":[0.0019685877,0.0007222862,0.008638011,0.00019048054,0.0000317973,0.00061794353,0.00013497559,0.66248006,0.02719714,0.18443343,0.11317461,0.00041065417],"about_ca_topic_score_codex":0.000011737218,"about_ca_topic_score_gemma":0.0000027686922,"teacher_disagreement_score":0.85852027,"about_ca_system_score_codex":0.00008462205,"about_ca_system_score_gemma":0.00019102379,"threshold_uncertainty_score":0.6358696},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.34370473021705233,"score_gpt":0.44024008449868335,"score_spread":0.09653535428163101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980640139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44497603,0.000096128715,0.549263,0.0036120582,0.0014330471,0.00040760986,0.000039204828,0.000020601794,0.0001523184],"genre_scores_gemma":[0.9665446,0.000022943605,0.032258842,0.0001684859,0.00089642627,0.000019435505,0.00004663011,0.000015341073,0.000027262804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994327,0.00017627988,0.0022650633,0.00058148336,0.002456938,0.00019324094],"domain_scores_gemma":[0.98846304,0.0025317215,0.0034522163,0.00095346296,0.0045283595,0.00007119513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010059834,0.0002105921,0.00052157196,0.00036634374,0.00031953622,0.0005859923,0.004804615,0.000052796724,0.000011874968],"category_scores_gemma":[0.001924009,0.00014964768,0.00028176766,0.00041079917,0.00015052564,0.00030321567,0.0022728601,0.0005301218,0.000006551306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001291405,0.000091424685,0.0015625365,0.000067991554,0.000105771935,3.28344e-7,0.0011156249,0.9100184,0.00037492818,0.0034120965,0.0017885031,0.08133329],"study_design_scores_gemma":[0.00033116207,0.00005541759,0.0027575016,0.00016645095,0.000064209176,0.000010655624,0.0003146769,0.9259794,0.00059505395,0.06878357,0.0008211557,0.00012077634],"about_ca_topic_score_codex":0.00003619507,"about_ca_topic_score_gemma":0.0000029655207,"teacher_disagreement_score":0.5215686,"about_ca_system_score_codex":0.00012892032,"about_ca_system_score_gemma":0.00029827026,"threshold_uncertainty_score":0.892825},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018033568051262584,"score_gpt":0.29900735785210786,"score_spread":0.28097378980084525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399828530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28990236,0.00018230644,0.7074904,0.00057456526,0.0012529435,0.00038993763,0.000029456909,0.00012588107,0.00005216199],"genre_scores_gemma":[0.71602017,0.00005637065,0.28254354,0.00010421333,0.0011551087,0.000060245486,0.000006428386,0.00003728885,0.00001664206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984839,0.000014883505,0.00068630325,0.00016874363,0.00042542364,0.00022074931],"domain_scores_gemma":[0.9981854,0.00087976386,0.00017800945,0.00018505883,0.0004979275,0.000073867384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051879144,0.00018289607,0.00021078551,0.00018867361,0.0001610509,0.000143351,0.00082368584,0.000043536922,0.00001111759],"category_scores_gemma":[0.00008441997,0.00013734263,0.000092578906,0.00025304177,0.00004327181,0.00028039396,0.00010276735,0.0003788116,0.000018889967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012662795,0.000015318637,0.000021422627,0.00021597125,0.00011585966,6.0124876e-7,0.0004855458,0.7509325,0.005693066,0.0026948806,0.0003352827,0.23947689],"study_design_scores_gemma":[0.00021846913,0.000095926946,0.00024051614,0.0004145853,0.00003138207,0.00013201182,0.000072540555,0.9645521,0.01412395,0.010462382,0.009465423,0.00019073432],"about_ca_topic_score_codex":9.286058e-7,"about_ca_topic_score_gemma":3.248099e-7,"teacher_disagreement_score":0.4261178,"about_ca_system_score_codex":0.00021037122,"about_ca_system_score_gemma":0.000048836344,"threshold_uncertainty_score":0.560067},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008627947745729165,"score_gpt":0.26427825634278473,"score_spread":0.25565030859705556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409624861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12813038,0.00024260342,0.8668197,0.003007712,0.00044473735,0.00027179494,0.0000012799436,0.000091875634,0.0009899159],"genre_scores_gemma":[0.94185954,0.00011302927,0.057305023,0.00035291037,0.00022577525,0.00003410654,0.0000014211087,0.0000053418726,0.00010286388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989389,0.00003423313,0.0004525368,0.00016023453,0.00026889972,0.00014520042],"domain_scores_gemma":[0.9983108,0.00037920094,0.00040254433,0.00032623255,0.0005538174,0.000027381642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010407498,0.00010488028,0.00013928769,0.00013970156,0.0005967891,0.00025147834,0.0020419376,0.000032969925,3.180919e-7],"category_scores_gemma":[0.00002524575,0.000066228946,0.00005605487,0.0002577245,0.000082904095,0.00026409994,0.000386546,0.00018855317,0.0000016148022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006939966,0.00010804838,0.0026110844,0.00015530638,0.00029027686,6.721797e-7,0.0011173198,0.18901321,0.00032103003,0.2621371,0.0084803235,0.5356962],"study_design_scores_gemma":[0.00040314233,0.000059897295,0.005024109,0.00018375141,0.000024073712,0.00013985475,0.00007267015,0.97615933,0.004056651,0.001584586,0.012187082,0.00010485692],"about_ca_topic_score_codex":0.0000059773233,"about_ca_topic_score_gemma":6.701035e-7,"teacher_disagreement_score":0.81372917,"about_ca_system_score_codex":0.00008681524,"about_ca_system_score_gemma":0.00009839956,"threshold_uncertainty_score":0.45900798},"labels":[],"label_agreement":null}]}