{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14249982,0.00041663242,0.8416028,0.0006626103,0.00018764703,0.0001527337,0.00007162725,0.0011655854,0.013240451],"genre_scores_gemma":[0.64799905,0.00037435463,0.34759435,0.00013008772,0.000060967282,0.00025730475,0.00013936692,0.000281101,0.0031634571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995371,0.00021990683,0.000015803134,0.000050004808,0.00012879429,0.000048388403],"domain_scores_gemma":[0.9991406,0.00038301662,0.000049124686,0.00019649931,0.000118849835,0.00011193951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007965758,0.0004008787,0.0006737615,0.00027616686,0.00088709046,0.00097510876,0.0010650408,0.0010046312,0.0010617827],"category_scores_gemma":[0.0023250554,0.0002869742,0.00062841555,0.0006234263,0.00088385696,0.00090798305,0.00096606096,0.0011446347,0.00026270104],"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.00031801785,0.0001917497,0.0029235913,0.00016032522,0.000089984394,0.00051529944,0.00043421524,0.8371934,0.017390579,0.099951304,0.004212849,0.036618672],"study_design_scores_gemma":[0.00005234175,0.0000594627,0.00032276922,0.0000073475417,0.000008817042,0.00007516997,0.000036841175,0.97793067,0.0031894532,0.014773867,0.0035293472,0.00001391148],"about_ca_topic_score_codex":0.0025091376,"about_ca_topic_score_gemma":0.0019386653,"teacher_disagreement_score":0.0025091376,"about_ca_system_score_codex":0.00050729193,"about_ca_system_score_gemma":0.00091610424,"threshold_uncertainty_score":0.004989028},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26282635,0.0030265893,0.70963174,0.000952414,0.0003438173,0.00029146578,0.00020665672,0.0051826243,0.017538294],"genre_scores_gemma":[0.9206915,0.0011270379,0.07360919,0.00012564655,0.00014028508,0.00022815814,0.00031107993,0.00026063784,0.0035064514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890363,0.00029630365,0.00005508273,0.00011344433,0.0004981612,0.00013331058],"domain_scores_gemma":[0.9969201,0.001730518,0.00018497414,0.00051530445,0.00054271217,0.00010646887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018963758,0.0005448763,0.0007830044,0.0007066564,0.0007305521,0.0012810437,0.0012230148,0.0006619936,0.00243234],"category_scores_gemma":[0.0055567636,0.00034765937,0.00024110058,0.0009716049,0.0008900423,0.0046621365,0.0020738787,0.00090337277,0.0007052308],"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.0014319702,0.00039088065,0.00345196,0.00090335455,0.00009612363,0.0007286056,0.00082773826,0.39260748,0.12406297,0.05451854,0.015277514,0.4057029],"study_design_scores_gemma":[0.00007251167,0.00026341187,0.00055096176,0.000039518018,0.000030515846,0.0001540682,0.0002211478,0.93561333,0.024879057,0.030696688,0.007449434,0.000029431023],"about_ca_topic_score_codex":0.0010442238,"about_ca_topic_score_gemma":0.0006491288,"teacher_disagreement_score":0.00243234,"about_ca_system_score_codex":0.00059284945,"about_ca_system_score_gemma":0.0005435067,"threshold_uncertainty_score":0.010029137},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11078304,0.0012502125,0.8742279,0.0008228124,0.00025731933,0.00013789466,0.00008506996,0.0042800754,0.008155804],"genre_scores_gemma":[0.8430627,0.00034057396,0.15445112,0.000111749636,0.000099918616,0.00010454507,0.0001015528,0.00018342545,0.0015444021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986889,0.00050515577,0.000073008094,0.00013675058,0.000444053,0.00015213538],"domain_scores_gemma":[0.99841213,0.00043404993,0.0001981618,0.00056892436,0.00024461502,0.00014217643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023022648,0.00048093012,0.00083795586,0.0006648394,0.00067858264,0.0019451493,0.0015826283,0.0007224831,0.00092756876],"category_scores_gemma":[0.0031949314,0.00041293644,0.0005615261,0.0011354868,0.00071647443,0.0015231096,0.001409312,0.0011019002,0.0003200495],"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.0009515299,0.0002168371,0.004331447,0.00016248015,0.00025194237,0.00022538913,0.00034506494,0.67834216,0.027459057,0.06477658,0.006347623,0.21658978],"study_design_scores_gemma":[0.000056653273,0.00007695496,0.00044497507,0.000009344523,0.000032840537,0.00005207818,0.000025615387,0.97630036,0.003598578,0.015324609,0.004058776,0.00001934248],"about_ca_topic_score_codex":0.003962797,"about_ca_topic_score_gemma":0.003654566,"teacher_disagreement_score":0.003962797,"about_ca_system_score_codex":0.0010945831,"about_ca_system_score_gemma":0.0014172872,"threshold_uncertainty_score":0.012175679},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062144395,0.00064022717,0.92267805,0.00087463844,0.00009312644,0.00011309479,0.0001500559,0.000860784,0.012445561],"genre_scores_gemma":[0.8152711,0.0011757577,0.17674175,0.00023301446,0.00017265129,0.0005753353,0.00040946377,0.00053887145,0.0048821718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850994,0.00037360704,0.000070282615,0.00015516544,0.00073910726,0.00015196153],"domain_scores_gemma":[0.99574226,0.002584356,0.00036945322,0.0003992609,0.00078724965,0.000117459866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002104294,0.0007584998,0.0006881728,0.00075525587,0.00077847316,0.0010298883,0.0013579167,0.0007066615,0.0021406636],"category_scores_gemma":[0.009945575,0.00041256833,0.0007998556,0.00064870453,0.0011890285,0.002042995,0.0013757002,0.00091807544,0.00034464712],"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.000064260814,0.000047825586,0.0020140058,0.000112881215,0.00004115603,0.00015831219,0.00009158108,0.9119501,0.0034129347,0.068104066,0.0013509383,0.012651823],"study_design_scores_gemma":[0.000005502539,0.000005713033,0.000093307804,0.000002932796,0.0000041427857,0.000013029957,0.000006385791,0.99318093,0.0005140914,0.005671879,0.00049947103,0.000002639422],"about_ca_topic_score_codex":0.004820659,"about_ca_topic_score_gemma":0.0022588377,"teacher_disagreement_score":0.004820659,"about_ca_system_score_codex":0.001225016,"about_ca_system_score_gemma":0.0016271803,"threshold_uncertainty_score":0.011128724},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014856991,0.083174534,0.18127616,0.014735981,0.14104503,0.0019143404,0.020291556,0.06675971,0.48931694],"genre_scores_gemma":[0.020080691,0.090045884,0.094035566,0.014055006,0.069192685,0.0033292286,0.047585297,0.026687304,0.63498837],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99675876,0.0007439304,0.00037415055,0.0005280171,0.001330537,0.00026459235],"domain_scores_gemma":[0.99487996,0.0016307984,0.00040303124,0.001093457,0.0013805255,0.00061230717],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018698046,0.003929425,0.0029910877,0.004584206,0.0010067223,0.010325965,0.0035902816,0.003660897,0.41900426],"category_scores_gemma":[0.011619674,0.001171134,0.002048207,0.0063548903,0.0013320189,0.004472881,0.00464035,0.004251602,0.28588074],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040935705,0.000030890344,0.00010548283,0.0010029565,0.00004794946,0.00007587239,0.000048603124,0.0007764173,0.001212686,0.013729822,0.8466778,0.13625059],"study_design_scores_gemma":[0.000014805196,0.000021548172,0.0001258917,0.00013944857,0.000011440089,0.00010671652,0.000017516451,0.0009892941,0.00023513542,0.006490713,0.99183077,0.00001669918],"about_ca_topic_score_codex":0.000626484,"about_ca_topic_score_gemma":0.0005533031,"teacher_disagreement_score":0.41900426,"about_ca_system_score_codex":0.0010386707,"about_ca_system_score_gemma":0.0012028196,"threshold_uncertainty_score":0.8287199},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080588296,0.00012063261,0.90772784,0.00032492238,0.00003423865,0.0001287059,0.000053704513,0.0027583602,0.008263336],"genre_scores_gemma":[0.42945597,0.00015862714,0.56683487,0.000049428087,0.00002984031,0.00018465058,0.00015511844,0.00035091722,0.0027804933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991891,0.00023371037,0.000029598508,0.00007673697,0.00037533155,0.00009557814],"domain_scores_gemma":[0.9977906,0.0011876505,0.00014591412,0.000483573,0.00032696605,0.00006527439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010487995,0.00069996127,0.00062843534,0.00041830374,0.00073652994,0.0006388111,0.0011081684,0.00081213634,0.0024035126],"category_scores_gemma":[0.005778145,0.00033382126,0.00035040002,0.0005111273,0.00084109773,0.00096065627,0.00094062026,0.00076351344,0.00063357333],"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.00048352513,0.00034146715,0.0026924137,0.00027633674,0.000056935754,0.0004493017,0.0005267678,0.6102651,0.04503473,0.044257835,0.004679383,0.29093617],"study_design_scores_gemma":[0.000080100086,0.000118615775,0.0002653316,0.0000103978045,0.000012406411,0.000101402205,0.0000470881,0.9586243,0.027117651,0.0090990765,0.0045106737,0.000012928658],"about_ca_topic_score_codex":0.0034047945,"about_ca_topic_score_gemma":0.0037493154,"teacher_disagreement_score":0.0034047945,"about_ca_system_score_codex":0.0005260219,"about_ca_system_score_gemma":0.0011132933,"threshold_uncertainty_score":0.008040607},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3539545,0.00070802704,0.35115653,0.0021506834,0.0007073292,0.001371659,0.043620147,0.024033176,0.22229807],"genre_scores_gemma":[0.7212834,0.0005561603,0.20653214,0.00039634522,0.00012683736,0.0015359394,0.04571094,0.0022236155,0.02163467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996997,0.000050537754,0.000020205744,0.00005395495,0.00012089757,0.000054706445],"domain_scores_gemma":[0.9995096,0.000089116016,0.00002484419,0.00010545592,0.00022774396,0.00004326763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040751894,0.000755878,0.00062213413,0.0005324322,0.000742452,0.001065467,0.0022555895,0.0007793913,0.0056252885],"category_scores_gemma":[0.0016371554,0.00037075594,0.00077715784,0.0010574688,0.0004359868,0.0007216632,0.0012950433,0.0011917305,0.0015148838],"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.00010003575,0.000059956543,0.002747225,0.000057140485,0.000033681812,0.00015421533,0.000055237822,0.9523457,0.0033536188,0.012299018,0.014354189,0.014439879],"study_design_scores_gemma":[0.000052471893,0.00001577472,0.0005350469,0.0000060416814,0.0000067048504,0.000015007321,0.000014346796,0.9887432,0.0011480874,0.0019120692,0.007540728,0.000010565013],"about_ca_topic_score_codex":0.05335249,"about_ca_topic_score_gemma":0.026370304,"teacher_disagreement_score":0.05335249,"about_ca_system_score_codex":0.0013903792,"about_ca_system_score_gemma":0.0031654024,"threshold_uncertainty_score":0.10608387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0113139665,0.00019579024,0.9819702,0.00013283367,0.000060105787,0.000057554647,0.000055521483,0.0013655862,0.0048485035],"genre_scores_gemma":[0.176445,0.0003916167,0.81949514,0.00011033191,0.000040208964,0.00013181596,0.00023474032,0.00042590627,0.0027252608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974066,0.0000684752,0.000013241068,0.000036713845,0.00012048825,0.000020438092],"domain_scores_gemma":[0.9997553,0.000090656904,0.000023137061,0.0000775545,0.000043024527,0.000010285119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003501826,0.0003843454,0.0004002318,0.00026800894,0.00037803518,0.00065875833,0.00075699674,0.00043126094,0.002746308],"category_scores_gemma":[0.0014755946,0.00026417008,0.00048662262,0.0003576872,0.00035847165,0.00050078414,0.0010161938,0.0006308345,0.0012809547],"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.00024795692,0.00007588555,0.001513884,0.0005182662,0.00006982943,0.0003631837,0.00042428865,0.2940264,0.083468854,0.058869723,0.006147748,0.5542739],"study_design_scores_gemma":[0.000034289696,0.00010319044,0.0006407323,0.000024309657,0.000016452861,0.0003157904,0.00006196137,0.9189931,0.031629764,0.013421522,0.034740288,0.00001852214],"about_ca_topic_score_codex":0.0013345153,"about_ca_topic_score_gemma":0.0016104402,"teacher_disagreement_score":0.002746308,"about_ca_system_score_codex":0.00018887974,"about_ca_system_score_gemma":0.00045062133,"threshold_uncertainty_score":0.009187341},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006086895,0.00017301874,0.8601936,0.00041307954,0.00022265934,0.00044216172,0.0064589833,0.10392128,0.022088341],"genre_scores_gemma":[0.057230595,0.0003999998,0.8583235,0.00085241295,0.0001704616,0.0020408551,0.024009427,0.036710326,0.020262392],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889946,0.00019939849,0.00013822393,0.00018374041,0.00046296854,0.000116204785],"domain_scores_gemma":[0.99774265,0.00071246945,0.00013620898,0.0005010579,0.0007422711,0.00016533158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026186386,0.0014761566,0.00094560697,0.0011400866,0.00095556705,0.0019477672,0.004068186,0.0016046958,0.036420368],"category_scores_gemma":[0.0069289627,0.0011965323,0.0016411782,0.001496392,0.0007869221,0.0036821072,0.002986318,0.0039704647,0.011498861],"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.0007176975,0.00070149236,0.008391676,0.0009160771,0.0003276304,0.000576795,0.0010819766,0.13780697,0.01666659,0.1441673,0.44037008,0.24827565],"study_design_scores_gemma":[0.00050654623,0.00007757329,0.00079900905,0.00010219081,0.000043914722,0.00018498702,0.0000760504,0.5654585,0.011296497,0.035359517,0.38599533,0.000099966564],"about_ca_topic_score_codex":0.006091098,"about_ca_topic_score_gemma":0.0080267005,"teacher_disagreement_score":0.036420368,"about_ca_system_score_codex":0.001348594,"about_ca_system_score_gemma":0.003734395,"threshold_uncertainty_score":0.12183827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2569033,0.005937001,0.51792294,0.06320636,0.001357633,0.0005218762,0.00027200824,0.0074982336,0.14638077],"genre_scores_gemma":[0.66179484,0.005600367,0.28987768,0.0031437047,0.0006970843,0.00032995705,0.0010042428,0.0020656073,0.035486534],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979996,0.00039683311,0.000060898125,0.00008403228,0.0011117419,0.00034676064],"domain_scores_gemma":[0.9980642,0.00031433662,0.00008790681,0.00022896516,0.0008440804,0.00046046084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073859207,0.00040680284,0.0002293258,0.00045721786,0.0013713979,0.004135545,0.0017023247,0.0014706664,0.0025730089],"category_scores_gemma":[0.004628527,0.00025122557,0.00043730356,0.0009728734,0.0013971606,0.004580173,0.0023181536,0.0030690182,0.0010973288],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006835873,0.0012126844,0.025111662,0.0006210336,0.000038114238,0.002746156,0.015066386,0.0071965656,0.039200805,0.37356335,0.095225446,0.43933412],"study_design_scores_gemma":[0.00012455606,0.0010023171,0.0107342405,0.00051920733,0.00005374457,0.002324157,0.0085873185,0.06145399,0.03485282,0.068614215,0.8115623,0.00017111603],"about_ca_topic_score_codex":0.002031773,"about_ca_topic_score_gemma":0.001933948,"teacher_disagreement_score":0.0073859207,"about_ca_system_score_codex":0.00084341754,"about_ca_system_score_gemma":0.0022041774,"threshold_uncertainty_score":0.03906095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065966364,0.00008567988,0.9968346,0.00003186153,0.00002831897,0.000029106302,0.00004372325,0.0012730764,0.0010139977],"genre_scores_gemma":[0.032240655,0.00031237004,0.9635611,0.00006386764,0.000030968757,0.0001817429,0.00026078496,0.00075388193,0.0025945841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995295,0.000050099457,0.000023243463,0.00004626462,0.0003169761,0.000034003053],"domain_scores_gemma":[0.9997273,0.000056657544,0.000021713971,0.000068314155,0.000092450115,0.00003347817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056493585,0.0007737211,0.0008348185,0.0010520903,0.00067047385,0.0009912107,0.0027489264,0.0012561608,0.004656153],"category_scores_gemma":[0.0011552888,0.0006735107,0.0016765808,0.00093334354,0.0005653298,0.0010237888,0.0016240869,0.0016161298,0.0020012464],"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.000088412446,0.00010166529,0.00071552297,0.00023611776,0.00015040438,0.00050098664,0.00023235858,0.5631523,0.039973684,0.16773719,0.010398692,0.2167126],"study_design_scores_gemma":[0.000020729156,0.00001846272,0.00008922494,0.000018024131,0.000011173553,0.0001364662,0.000010450177,0.96035117,0.0044143004,0.011720432,0.023187215,0.000022258339],"about_ca_topic_score_codex":0.005893373,"about_ca_topic_score_gemma":0.004985171,"teacher_disagreement_score":0.005893373,"about_ca_system_score_codex":0.00069042534,"about_ca_system_score_gemma":0.0010621875,"threshold_uncertainty_score":0.015576422},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06943727,0.00017438132,0.9065441,0.00043581636,0.00038770813,0.00014215145,0.00034520953,0.0049010785,0.017632348],"genre_scores_gemma":[0.5734753,0.0003389425,0.40928352,0.0001165505,0.00008439103,0.0002159265,0.00066368934,0.00062488334,0.015196827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998172,0.000043013977,0.000014411727,0.000040685376,0.00006920657,0.000015498757],"domain_scores_gemma":[0.99940526,0.00022255965,0.000032439464,0.00016187945,0.00013768187,0.00004022764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036190078,0.0003998825,0.00044944737,0.00025568006,0.0005083525,0.00084018137,0.0011320977,0.00061082427,0.0060148146],"category_scores_gemma":[0.0012751664,0.00018796958,0.00056224933,0.00031150164,0.00043114668,0.000539212,0.0004236911,0.00048246302,0.0010355272],"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.00022079554,0.00010414445,0.0020844587,0.00012693364,0.00006815657,0.0003999013,0.00014261654,0.8836165,0.016540863,0.023266442,0.00532372,0.068105526],"study_design_scores_gemma":[0.000017882789,0.000022097947,0.00008101623,0.0000041235,0.000009449441,0.00003922942,0.0000076117467,0.9873777,0.005616545,0.0023585525,0.0044600065,0.000005817824],"about_ca_topic_score_codex":0.0037659502,"about_ca_topic_score_gemma":0.002906847,"teacher_disagreement_score":0.0060148146,"about_ca_system_score_codex":0.00048483242,"about_ca_system_score_gemma":0.0007682816,"threshold_uncertainty_score":0.020121574},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30475068,0.0008764974,0.46440336,0.0005158294,0.0002851547,0.0008633564,0.0034549918,0.19814663,0.026703509],"genre_scores_gemma":[0.45765042,0.0004242929,0.5204799,0.00026046613,0.00005162674,0.0006124893,0.0067090713,0.009038732,0.004772904],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99686277,0.00082647026,0.00014637428,0.00047732383,0.0012812627,0.0004058092],"domain_scores_gemma":[0.9937263,0.0030625723,0.0002709799,0.0016802395,0.0009580758,0.00030191042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027057687,0.002103402,0.00088973955,0.0015332674,0.0010548386,0.0010602484,0.0052141966,0.0014086745,0.006173452],"category_scores_gemma":[0.008839506,0.00096403214,0.00085724785,0.0024598762,0.0013239647,0.0027561097,0.0018647547,0.0016548746,0.0019064087],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028760836,0.002308366,0.011119112,0.0017549176,0.0003945805,0.0004726444,0.00093429856,0.36152965,0.023509683,0.018611213,0.07433199,0.50215745],"study_design_scores_gemma":[0.0006321999,0.0007124921,0.0034543357,0.00006490449,0.00008139022,0.00013488442,0.00021721369,0.9089527,0.05968039,0.005725567,0.020270115,0.00007382526],"about_ca_topic_score_codex":0.021394132,"about_ca_topic_score_gemma":0.012660008,"teacher_disagreement_score":0.021394132,"about_ca_system_score_codex":0.0016643007,"about_ca_system_score_gemma":0.0025241012,"threshold_uncertainty_score":0.04253924},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13603567,0.00040510637,0.85065204,0.00047654597,0.00008012151,0.000117087846,0.00013340035,0.0007602169,0.011339771],"genre_scores_gemma":[0.79001355,0.00024107413,0.20643859,0.0000966773,0.000040341238,0.00022721213,0.0001703036,0.0003561615,0.0024160775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967325,0.000082342456,0.000011788347,0.00002962152,0.0001490125,0.00005409283],"domain_scores_gemma":[0.9993864,0.00028990654,0.00005958702,0.00006809369,0.00016664469,0.000029257055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052576046,0.00049360236,0.0003947041,0.0003699968,0.0005935483,0.0005348338,0.00075276726,0.00050923735,0.0019794323],"category_scores_gemma":[0.0017805456,0.00023903143,0.00048026492,0.00038880613,0.0004542003,0.0006846465,0.00060546515,0.0006603414,0.00024188713],"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.00009899316,0.00006950189,0.0014005253,0.00006861092,0.000014734563,0.00005753881,0.00007743986,0.95056295,0.008225039,0.010096286,0.00080213987,0.02852616],"study_design_scores_gemma":[0.0000041697167,0.0000050482404,0.00006578583,0.0000012068875,8.877551e-7,0.0000021478443,0.0000035348125,0.9985044,0.00074572593,0.00049103354,0.00017466515,0.0000013538831],"about_ca_topic_score_codex":0.005041375,"about_ca_topic_score_gemma":0.0031932693,"teacher_disagreement_score":0.005041375,"about_ca_system_score_codex":0.00071230036,"about_ca_system_score_gemma":0.0011403837,"threshold_uncertainty_score":0.010024011},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9653627,0.0003699406,0.019472511,0.0003465616,0.000068471294,0.00011260031,0.0008567566,0.001743124,0.011667305],"genre_scores_gemma":[0.97393596,0.00015409733,0.022647236,0.00007938683,0.000015808078,0.000074225245,0.0012183832,0.0002789629,0.0015959002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995049,0.0001411112,0.000048233524,0.000061820945,0.0001538036,0.00009006225],"domain_scores_gemma":[0.99767715,0.0012100673,0.00016281636,0.00024011578,0.00053362316,0.0001761778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010713597,0.0010218151,0.0009397419,0.0005314367,0.0007772338,0.001386658,0.0016160535,0.0012733248,0.0021584374],"category_scores_gemma":[0.0037582426,0.00045111234,0.00089385017,0.00064350007,0.000774569,0.0011300844,0.0010065472,0.000981429,0.00039475432],"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.0006787822,0.00043143347,0.014353438,0.00029298314,0.00017251914,0.00020824315,0.0002895963,0.94252306,0.015379869,0.0034881565,0.0015142116,0.02066776],"study_design_scores_gemma":[0.00003830006,0.00010086421,0.0012397557,0.0000121685935,0.000011953528,0.000010475716,0.000051762134,0.9954111,0.0024733967,0.00025550046,0.00037915015,0.00001558316],"about_ca_topic_score_codex":0.02537874,"about_ca_topic_score_gemma":0.019753404,"teacher_disagreement_score":0.02537874,"about_ca_system_score_codex":0.00070644094,"about_ca_system_score_gemma":0.0018159836,"threshold_uncertainty_score":0.050462008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008800978,0.0005469406,0.9836669,0.00024436938,0.00012628507,0.0001609991,0.00017465773,0.0017143553,0.004564591],"genre_scores_gemma":[0.05230112,0.00023370226,0.9438682,0.00011711471,0.000073925126,0.00026263477,0.00044877382,0.00023490957,0.0024595996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992969,0.00012677902,0.000052245054,0.00016188971,0.00028958658,0.0000724821],"domain_scores_gemma":[0.99915326,0.00025330877,0.000094823714,0.00020237162,0.00023129028,0.00006491613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079253153,0.0010927332,0.0008504535,0.0017198346,0.0010035426,0.0010605872,0.0018463993,0.0011402967,0.004290758],"category_scores_gemma":[0.0038984115,0.0006267829,0.00091438676,0.0023191154,0.00058465294,0.0023367873,0.0017918864,0.0017644118,0.0014512546],"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.00025894097,0.0002622785,0.0010120898,0.0005050385,0.000089790046,0.00018599752,0.00023926552,0.2613067,0.012966303,0.1200013,0.023358837,0.5798134],"study_design_scores_gemma":[0.000073401854,0.000058856156,0.00020295761,0.000023019295,0.000023682987,0.00012231771,0.00003810018,0.9271622,0.0035095064,0.058641452,0.010126496,0.000018145984],"about_ca_topic_score_codex":0.0029167095,"about_ca_topic_score_gemma":0.0047066207,"teacher_disagreement_score":0.004290758,"about_ca_system_score_codex":0.0015229298,"about_ca_system_score_gemma":0.0017797642,"threshold_uncertainty_score":0.01435405},"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":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3050157,0.0017723644,0.680971,0.001214142,0.00029097334,0.0015074027,0.0010190837,0.0027906082,0.005418621],"genre_scores_gemma":[0.8789014,0.00052641873,0.11607866,0.000280641,0.000045844412,0.0014061166,0.0008954855,0.00042530347,0.0014400398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99156815,0.004450053,0.000563558,0.0010718518,0.0019323513,0.00041398237],"domain_scores_gemma":[0.9037262,0.0792367,0.005936974,0.005249169,0.005268583,0.00058251445],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.018532062,0.0015354691,0.00087774254,0.0021257377,0.00067482336,0.0021085767,0.001937306,0.0018205729,0.0021960742],"category_scores_gemma":[0.11079706,0.0006277125,0.0017861273,0.0010390957,0.0023353635,0.0022667192,0.002244184,0.0029702445,0.0005047572],"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.0017441071,0.00029846068,0.013910999,0.00080537284,0.00046593582,0.00023084288,0.0005578131,0.89869547,0.006392904,0.031175757,0.0023200081,0.04340226],"study_design_scores_gemma":[0.000054060594,0.00042292016,0.0030749661,0.00010603575,0.00010039655,0.00006668395,0.0001240387,0.97555417,0.004315705,0.0149178505,0.0012103728,0.0000526976],"about_ca_topic_score_codex":0.007161076,"about_ca_topic_score_gemma":0.0033765563,"teacher_disagreement_score":0.98146796,"about_ca_system_score_codex":0.0025174064,"about_ca_system_score_gemma":0.002239229,"threshold_uncertainty_score":0.098008096},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12098668,0.0012843235,0.8667652,0.00042357604,0.00018648991,0.00008401856,0.00012524222,0.0026680934,0.007476476],"genre_scores_gemma":[0.54811025,0.0004981608,0.44800445,0.00016880083,0.00004665309,0.00012304964,0.0003532305,0.0009330174,0.0017624032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995413,0.00015228585,0.000031325926,0.000053908752,0.00016083947,0.000060360548],"domain_scores_gemma":[0.9984125,0.0009182183,0.000097686745,0.00028848002,0.00022170378,0.00006138277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011027635,0.00072017167,0.0007324196,0.0008136519,0.00051116775,0.0008860387,0.0010338633,0.0009270841,0.0022220989],"category_scores_gemma":[0.00484701,0.0004267671,0.0007713256,0.00062965625,0.000645628,0.001155489,0.0013905659,0.0012128431,0.0007100659],"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.00034606602,0.00016305555,0.0036022912,0.0004640168,0.00012590108,0.00015902703,0.0004647657,0.8223225,0.044384133,0.034670833,0.003319075,0.08997832],"study_design_scores_gemma":[0.000027069402,0.000052858635,0.00031491643,0.00002217723,0.000012851045,0.000020934656,0.000025646717,0.98567224,0.007143144,0.004936635,0.0017606042,0.000011013927],"about_ca_topic_score_codex":0.002081142,"about_ca_topic_score_gemma":0.0030447792,"teacher_disagreement_score":0.0022220989,"about_ca_system_score_codex":0.0004575102,"about_ca_system_score_gemma":0.00067060516,"threshold_uncertainty_score":0.007433653},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056094754,0.0011937397,0.60905033,0.00512442,0.0032377772,0.0019233203,0.012772757,0.24632058,0.06428241],"genre_scores_gemma":[0.17497772,0.0012779895,0.63586354,0.0014860092,0.0014289084,0.0023788968,0.054081388,0.06406218,0.06444339],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790514,0.00024250442,0.00012079822,0.00017392937,0.0012405847,0.00031709118],"domain_scores_gemma":[0.99443865,0.00031650963,0.00023071562,0.0009770227,0.003331036,0.0007060854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035070877,0.0009700301,0.00064764946,0.0013341334,0.0012716552,0.0025847147,0.0023658944,0.0006303252,0.018742913],"category_scores_gemma":[0.007950655,0.00089948677,0.0007098943,0.0014705565,0.0004757613,0.0027176347,0.0026294596,0.0030920592,0.016657392],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009307204,0.00022310126,0.0052570794,0.00036663577,0.00005742695,0.00063349586,0.0007317888,0.021884331,0.03864806,0.030167619,0.67596555,0.2251343],"study_design_scores_gemma":[0.00034358923,0.0005419737,0.010134728,0.00027844557,0.000071759074,0.0005772257,0.00026651332,0.11982414,0.05837097,0.016432488,0.7928915,0.00026663102],"about_ca_topic_score_codex":0.0038269004,"about_ca_topic_score_gemma":0.002807315,"teacher_disagreement_score":0.018742913,"about_ca_system_score_codex":0.0013812365,"about_ca_system_score_gemma":0.0035218734,"threshold_uncertainty_score":0.062701285},"labels":[],"label_agreement":null}]}