{"meta":{"query_hash":"c437a189e439","filters":{"venue":"IEEE International Conference on High Performance Computing, Data, and Analytics"},"cohort_total":9,"direct_labels_cover":0,"predictions_cover":9,"exported":9,"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/c437a189e439","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+International+Conference+on+High+Performance+Computing%2C+Data%2C+and+Analytics"},"results":[{"id":"W1827514603","doi":"10.5555/2346696.2346726","title":"C-DAC's efforts: application kernels on HPC cluster with GPU accelerators","year":2012,"lang":"en","type":"article","venue":"IEEE International Conference on High Performance Computing, Data, and Analytics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"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":"Parallel computing; Computer science; CUDA; GPU cluster; Speedup; Computational science; Scalability; Finite element method; Supercomputer; Computation; General-purpose computing on graphics processing units; Sparse matrix; Algorithm; Graphics; Physics; Computer graphics (images)","score_opus":0.04648544347538451,"score_gpt":0.30330164784212776,"score_spread":0.25681620436674324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1827514603","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.14546476,0.0023036748,0.6455391,0.0015774975,0.00093656714,0.00055882917,0.0025239564,0.05307194,0.14802375],"genre_scores_gemma":[0.51979756,0.0010266193,0.43893132,0.00036466113,0.00018890102,0.00027942186,0.004571416,0.0026361933,0.032203924],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992712,0.00010246103,0.00003238396,0.000092342576,0.0003736527,0.00012793773],"domain_scores_gemma":[0.9991209,0.00008181803,0.000030837175,0.00028004628,0.00036301318,0.00012337387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074875157,0.0007333667,0.0005118135,0.0007123706,0.0009046368,0.0012190447,0.001509443,0.000551206,0.00861778],"category_scores_gemma":[0.0017266825,0.00024458117,0.00033489233,0.0016444628,0.0003485097,0.0009258665,0.0010906393,0.0007222187,0.0039647343],"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.0008412343,0.0005463793,0.011129637,0.0007157433,0.00012852215,0.0012063319,0.00047707168,0.12078518,0.060720343,0.07829781,0.17156596,0.55358577],"study_design_scores_gemma":[0.000076857825,0.00019631124,0.0031799327,0.0000502123,0.00003362765,0.0006028651,0.0001436022,0.7412297,0.06617022,0.011743536,0.17652507,0.00004797793],"about_ca_topic_score_codex":0.00419243,"about_ca_topic_score_gemma":0.0032561691,"teacher_disagreement_score":0.00861778,"about_ca_system_score_codex":0.0008517977,"about_ca_system_score_gemma":0.0014104504,"threshold_uncertainty_score":0.028829396},"labels":[],"label_agreement":null},{"id":"W1989143253","doi":"10.5555/1791889.1791935","title":"A performance guaranteed distributed multicast algorithm for long-lived directional communications in WANETs","year":2008,"lang":"en","type":"article","venue":"IEEE International Conference on High Performance Computing, Data, and Analytics","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer science; Node (physics); Bounded function; Upper and lower bounds; Wireless ad hoc network; Distributed computing; Computer network; Algorithm; Mathematical optimization; Mathematics; Telecommunications; Wireless; Engineering","score_opus":0.10208641381769945,"score_gpt":0.33079566844890756,"score_spread":0.22870925463120811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989143253","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.08226491,0.0005750068,0.9130797,0.0003829011,0.000135405,0.00014329333,0.00009826491,0.001406224,0.0019143767],"genre_scores_gemma":[0.6820167,0.00017826342,0.31502715,0.00011373345,0.00008844444,0.00016629054,0.0002089155,0.00013561784,0.002064867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892384,0.00029547466,0.00007626637,0.00014315991,0.0004051502,0.00015620497],"domain_scores_gemma":[0.99688846,0.0014886428,0.00023211127,0.0005196025,0.00065653597,0.00021458004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024342996,0.0007162143,0.001557734,0.0009463996,0.0015166714,0.0011086114,0.002963525,0.0012163445,0.0015460668],"category_scores_gemma":[0.006074415,0.0004372285,0.00036013778,0.0008857239,0.0006291308,0.001793051,0.0021712407,0.0012960309,0.0003367391],"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.002889603,0.0004626408,0.0019239894,0.00025000883,0.00017612021,0.00020190107,0.00048008998,0.57039976,0.030849267,0.032357723,0.008579417,0.3514295],"study_design_scores_gemma":[0.00011761791,0.00014997834,0.00014504077,0.0000069986972,0.000020614305,0.000051677678,0.000040920353,0.98963124,0.0024887878,0.0065151914,0.00081930315,0.000012739796],"about_ca_topic_score_codex":0.0019185827,"about_ca_topic_score_gemma":0.0026048883,"teacher_disagreement_score":0.002963525,"about_ca_system_score_codex":0.0015926249,"about_ca_system_score_gemma":0.001384548,"threshold_uncertainty_score":0.012873948},"labels":[],"label_agreement":null},{"id":"W24483185","doi":"10.2495/hpc000281","title":"Parallel Performance And Benchmarking Of The CE-QUAL-ICMFamily Of Three-dimensional Water Quality Models","year":2000,"lang":"en","type":"article","venue":"IEEE International Conference on High Performance Computing, Data, and Analytics","topic":"Groundwater flow and contamination studies","field":"Environmental 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":"SPMD; Computer science; Scalability; Message Passing Interface; Benchmarking; Grid; Domain decomposition methods; Supercomputer; Parallel computing; IBM; Message passing; Database","score_opus":0.06866675451301421,"score_gpt":0.2857024906318621,"score_spread":0.21703573611884788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24483185","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.9603394,0.00017903314,0.016265858,0.0003278952,0.000096917356,0.00020430985,0.0031913219,0.0051579797,0.014237198],"genre_scores_gemma":[0.96314037,0.00010982603,0.02852583,0.00009227427,0.000014621199,0.0001881623,0.006167278,0.00046356022,0.0012981311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990564,0.00023769379,0.00007863174,0.00014969659,0.00030613772,0.00017153277],"domain_scores_gemma":[0.9976083,0.0006983425,0.00010531105,0.0004945128,0.0008316918,0.00026188293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021247843,0.0012460967,0.00073011534,0.0009080964,0.00083779264,0.00094728044,0.0024086826,0.0008890286,0.0023929714],"category_scores_gemma":[0.0036107546,0.00041912118,0.0008374227,0.0014878624,0.0010307403,0.0009541579,0.0009412437,0.0011632794,0.0005056939],"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.0011705509,0.0010484748,0.0123878,0.0001555515,0.00013071383,0.00020603572,0.00019441101,0.9324618,0.0108651295,0.0042960905,0.006721427,0.030362014],"study_design_scores_gemma":[0.00013905021,0.00015512735,0.0026634433,0.0000045597635,0.000009900838,0.000013771409,0.00003647764,0.9886975,0.0067835627,0.00038244665,0.0010975761,0.000016589009],"about_ca_topic_score_codex":0.047311988,"about_ca_topic_score_gemma":0.025359616,"teacher_disagreement_score":0.047311988,"about_ca_system_score_codex":0.0020642537,"about_ca_system_score_gemma":0.0021010912,"threshold_uncertainty_score":0.094073236},"labels":[],"label_agreement":null},{"id":"W2561820301","doi":"10.5555/3014904.3015020","title":"Multi-resource fair sharing for datacenter jobs with placement constraints","year":2016,"lang":"en","type":"article","venue":"IEEE International Conference on High Performance Computing, Data, and Analytics","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Shared resource; Distributed computing; Task (project management); Software; Quality of service; Node (physics); Resource (disambiguation); Service (business); Computer network; Operating system","score_opus":0.07823982118592901,"score_gpt":0.3075588994016018,"score_spread":0.2293190782156728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561820301","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.26159066,0.00030389265,0.7335988,0.00036025973,0.00019777456,0.00017714841,0.00011782546,0.0007837143,0.0028698973],"genre_scores_gemma":[0.96300596,0.000039372924,0.03615665,0.000052112526,0.000033959717,0.000046581063,0.00003819683,0.000043875025,0.0005832815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972711,0.0008165363,0.0001574721,0.00043227113,0.00067800644,0.000644554],"domain_scores_gemma":[0.992964,0.0029656258,0.0006315128,0.0019014427,0.0008875589,0.000649772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056411144,0.00065861206,0.0010159895,0.0005931324,0.0016354852,0.001724061,0.002044638,0.0007108262,0.0010397013],"category_scores_gemma":[0.0114819035,0.00040969066,0.0005260296,0.0007433773,0.0013427377,0.0019070548,0.001433109,0.0008627656,0.00016143308],"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.001057034,0.00025737443,0.004484749,0.00010302446,0.000082284954,0.00031775772,0.00042831767,0.88733417,0.01616808,0.04140784,0.0023256578,0.04603369],"study_design_scores_gemma":[0.000026673039,0.00004322135,0.00029312083,0.0000032439268,0.0000067216683,0.000020816135,0.00003292842,0.98394763,0.0026504986,0.012385658,0.0005758924,0.0000136431745],"about_ca_topic_score_codex":0.0063965195,"about_ca_topic_score_gemma":0.0049121627,"teacher_disagreement_score":0.0063965195,"about_ca_system_score_codex":0.0020938963,"about_ca_system_score_gemma":0.003091233,"threshold_uncertainty_score":0.029833436},"labels":[],"label_agreement":null},{"id":"W2562388813","doi":"10.5555/3014904.3014932","title":"Understanding error propagation in GPGPU applications","year":2016,"lang":"en","type":"article","venue":"IEEE International Conference on High Performance Computing, Data, and Analytics","topic":"Radiation Effects in Electronics","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Propagation of uncertainty; General-purpose computing on graphics processing units; Compiler; Parallel computing; Error detection and correction; CUDA; Soft error; Fault tolerance; Reliability (semiconductor); Supercomputer; Computational science; Computer engineering; Algorithm; Graphics; Electronic engineering; Distributed computing; Computer graphics (images); Programming language","score_opus":0.10485691472001943,"score_gpt":0.3082539207271124,"score_spread":0.20339700600709296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562388813","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.76199937,0.0023079107,0.22672242,0.00078282284,0.00008164205,0.0001287822,0.00032353803,0.0022491792,0.0054043033],"genre_scores_gemma":[0.97139794,0.00036337186,0.027003441,0.00009909234,0.00002090618,0.00004947164,0.00022116449,0.00025162115,0.00059288373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829036,0.00036083214,0.00011182825,0.00024935094,0.0008350227,0.00015249538],"domain_scores_gemma":[0.9839094,0.009331768,0.0023542317,0.0015992394,0.0026289439,0.00017639503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016671822,0.0006459105,0.00044465665,0.00199318,0.0005400978,0.0011296307,0.0012917215,0.00096527336,0.0008025955],"category_scores_gemma":[0.027162775,0.00041729969,0.0002993682,0.0014879182,0.0009204184,0.0022376475,0.0010721199,0.0011154499,0.00021933934],"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.0003421057,0.0003601453,0.10693087,0.0006476454,0.00009844729,0.0007652353,0.0017940148,0.68050253,0.028464885,0.01748625,0.0031599468,0.15944797],"study_design_scores_gemma":[0.0000107901005,0.00013164994,0.01614729,0.00006576282,0.000033082004,0.00031561428,0.0002282887,0.9528333,0.015759222,0.012336999,0.002107093,0.000030861942],"about_ca_topic_score_codex":0.0053189215,"about_ca_topic_score_gemma":0.0031810831,"teacher_disagreement_score":0.0053189215,"about_ca_system_score_codex":0.0009139281,"about_ca_system_score_gemma":0.0009167102,"threshold_uncertainty_score":0.010575891},"labels":[],"label_agreement":null},{"id":"W2563324989","doi":"10.5555/3014904.3014945","title":"Graph colouring as a challenge problem for dynamic graph processing on distributed systems","year":2016,"lang":"en","type":"article","venue":"IEEE International Conference on High Performance Computing, Data, and Analytics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Granularity; Graph; Analytics; Distributed computing; Graph database; Theoretical computer science; Data mining","score_opus":0.048517928316412294,"score_gpt":0.30488250537036143,"score_spread":0.25636457705394916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563324989","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.07148866,0.00022601562,0.9196251,0.0022957178,0.00013448599,0.00019407397,0.00026285715,0.0015223362,0.004250713],"genre_scores_gemma":[0.5174899,0.00029117355,0.47513068,0.00045285898,0.00013155227,0.0001697117,0.0007677245,0.0006378538,0.004928509],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977581,0.00070733513,0.00008053426,0.00072070025,0.0004371093,0.00029625188],"domain_scores_gemma":[0.9904281,0.00615716,0.00049506,0.001661326,0.0006788797,0.00057946314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025670058,0.00082623557,0.00087568886,0.00085432606,0.001894596,0.0031166761,0.0020554878,0.0021555054,0.004406976],"category_scores_gemma":[0.014567743,0.00071484776,0.0013060401,0.0013261542,0.0024647755,0.006018579,0.0029342864,0.0028098046,0.0005702263],"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.00035840948,0.00024792037,0.003874695,0.00035561193,0.00009807494,0.0004750373,0.00080563035,0.71458167,0.010618137,0.17761843,0.012648034,0.07831829],"study_design_scores_gemma":[0.000033885994,0.00003631618,0.0004901397,0.000011669193,0.000015104198,0.00012422662,0.00017876491,0.811642,0.0028972167,0.17977585,0.0047766278,0.000018142866],"about_ca_topic_score_codex":0.006541527,"about_ca_topic_score_gemma":0.0069535677,"teacher_disagreement_score":0.006541527,"about_ca_system_score_codex":0.0021403295,"about_ca_system_score_gemma":0.0017377539,"threshold_uncertainty_score":0.015529215},"labels":[],"label_agreement":null},{"id":"W2903551170","doi":"10.5555/3291656.3291684","title":"PruneJuice: pruning trillion-edge graphs to a precise pattern-matching solution","year":2018,"lang":"en","type":"article","venue":"IEEE International Conference on High Performance Computing, Data, and Analytics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Scalability; Computer science; Pruning; Pipeline (software); Matching (statistics); Scaling; Enhanced Data Rates for GSM Evolution; Pattern matching; Analytics; Set (abstract data type); Focus (optics); Graph; Theoretical computer science; Data mining; Algorithm; Artificial intelligence; Mathematics; Database","score_opus":0.05831802717286136,"score_gpt":0.31804624701030904,"score_spread":0.25972821983744765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903551170","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.0439357,0.0005700364,0.94248855,0.00079175463,0.00020361807,0.0004242458,0.00082351954,0.007216991,0.003545572],"genre_scores_gemma":[0.10546883,0.00019587956,0.8862645,0.00038589572,0.000046308123,0.0002585233,0.0027572138,0.001035067,0.0035877214],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99833125,0.00033578064,0.00011758952,0.0005071878,0.0005053352,0.00020287056],"domain_scores_gemma":[0.9956542,0.0018253048,0.0003488569,0.001419445,0.00053707074,0.00021509224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001669146,0.0016559047,0.0014989811,0.0033135172,0.0015369019,0.0018011163,0.0030577339,0.0017571277,0.0075575234],"category_scores_gemma":[0.01214654,0.000829996,0.0016361863,0.0031244755,0.0012312979,0.0034260938,0.0026753754,0.0020799134,0.0025724862],"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.0006380033,0.00072347035,0.0092471475,0.00095299486,0.00026490146,0.0006658603,0.0008002178,0.15257093,0.023937386,0.04168345,0.04530552,0.7232101],"study_design_scores_gemma":[0.00012648008,0.00020211343,0.00081394025,0.00009875345,0.000084755164,0.00042120504,0.00042393612,0.8896874,0.012977995,0.07728876,0.017845599,0.000029036588],"about_ca_topic_score_codex":0.0047091497,"about_ca_topic_score_gemma":0.013252745,"teacher_disagreement_score":0.0075575234,"about_ca_system_score_codex":0.0008504409,"about_ca_system_score_gemma":0.0026644964,"threshold_uncertainty_score":0.025282383},"labels":[],"label_agreement":null},{"id":"W2963616548","doi":"10.5555/3019129.3019131","title":"Devito: automated fast finite difference computation","year":2016,"lang":"en","type":"article","venue":"IEEE International Conference on High Performance Computing, Data, and Analytics","topic":"Seismic Imaging and Inversion Techniques","field":"Earth and Planetary Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Domain-specific language; Abstraction; Domain (mathematical analysis); Stencil; Theoretical computer science; Programming language; Code (set theory); Computation; Variety (cybernetics); Finite difference; Algorithm; Computational science; Artificial intelligence; Mathematics","score_opus":0.05559194547291946,"score_gpt":0.29391785525895203,"score_spread":0.23832590978603257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963616548","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.003977109,0.0001411684,0.9668309,0.00015167794,0.00010967408,0.000058631293,0.00067129725,0.022225827,0.005833714],"genre_scores_gemma":[0.09278991,0.00022036534,0.88998055,0.0003441708,0.000067403336,0.0004036236,0.0021865878,0.0057192333,0.0082881125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994418,0.00010669502,0.00004514263,0.00008669133,0.00026587574,0.000053675525],"domain_scores_gemma":[0.99911934,0.00045004569,0.000050857005,0.0001426724,0.0001978839,0.00003923181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007037759,0.0007613385,0.0006115122,0.000497055,0.0004711164,0.0012904328,0.0016905505,0.0007641245,0.014168662],"category_scores_gemma":[0.003651182,0.0004430917,0.00088116486,0.00034925976,0.000616067,0.0010310394,0.0017129186,0.0018269044,0.0044996548],"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.00048951793,0.00020954311,0.0031359547,0.001014538,0.00016226864,0.0006920039,0.0005843892,0.17441925,0.06634285,0.25663704,0.09970195,0.3966108],"study_design_scores_gemma":[0.00014250052,0.000060525825,0.00029615685,0.00008941129,0.000017286615,0.00024217674,0.000049978422,0.8193067,0.026288433,0.05437376,0.09908552,0.00004762534],"about_ca_topic_score_codex":0.001324671,"about_ca_topic_score_gemma":0.002347248,"teacher_disagreement_score":0.014168662,"about_ca_system_score_codex":0.00049375655,"about_ca_system_score_gemma":0.0014237697,"threshold_uncertainty_score":0.047398865},"labels":[],"label_agreement":null},{"id":"W3209605964","doi":"10.1145/3458817.3476140","title":"SEEC: stochastic escape express channel","year":2021,"lang":"en","type":"article","venue":"IEEE International Conference on High Performance Computing, Data, and Analytics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Network packet; Router; Deadlock; Throughput; Traverse; Distributed computing; Operating system; Wireless","score_opus":0.07337362606211412,"score_gpt":0.30175775577060376,"score_spread":0.22838412970848965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209605964","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.115571946,0.0008621716,0.8010527,0.00086131203,0.0009170131,0.00057794986,0.0018022178,0.02987535,0.048479263],"genre_scores_gemma":[0.81564057,0.000530486,0.14654762,0.0009968682,0.00018967698,0.0006521282,0.0024544,0.00149143,0.031496827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992094,0.00008711933,0.00003205675,0.00009669486,0.0003494153,0.00022536132],"domain_scores_gemma":[0.99885285,0.00026511739,0.00011244935,0.00024517011,0.00038408063,0.00014034616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059498526,0.0005691447,0.00039762817,0.0005510647,0.00062904623,0.001205639,0.0016184427,0.00055506814,0.008161207],"category_scores_gemma":[0.0013720779,0.00022736656,0.00032455652,0.00047280735,0.0007929633,0.001032776,0.0014305143,0.0012209057,0.001529484],"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.0021044316,0.0008022616,0.0059557846,0.0005764735,0.00012561181,0.0009823381,0.0003493682,0.28498217,0.13905676,0.1430387,0.12449184,0.29753423],"study_design_scores_gemma":[0.00024319837,0.0005816332,0.0006866555,0.00005040833,0.000044083146,0.00046618955,0.00006257417,0.830868,0.06834567,0.014715144,0.08380902,0.0001273766],"about_ca_topic_score_codex":0.003281451,"about_ca_topic_score_gemma":0.0059164483,"teacher_disagreement_score":0.008161207,"about_ca_system_score_codex":0.00088908407,"about_ca_system_score_gemma":0.0022942044,"threshold_uncertainty_score":0.027301967},"labels":[],"label_agreement":null}]}