{"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":"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.58799744,0.00001657697,0.40712646,0.00059438904,0.0009162066,0.00018585952,0.000059482034,0.00011803203,0.0029855499],"genre_scores_gemma":[0.99377364,0.00011241106,0.0043191183,0.000788097,0.00061277195,0.000006247013,0.00013166646,0.000013865361,0.00024220385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818265,0.00004248619,0.00032823154,0.00055030594,0.0005261968,0.00037012497],"domain_scores_gemma":[0.9985187,0.000105384046,0.00019509133,0.00083097664,0.00018514879,0.00016471106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005459592,0.00026658835,0.00022277211,0.00018228895,0.00022881971,0.00034044037,0.0016059362,0.000077303346,0.00003494578],"category_scores_gemma":[0.00001511514,0.00021143054,0.00002752495,0.00020974659,0.00010135718,0.0011113287,0.00035212084,0.00029200275,0.00010580782],"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.00027573114,0.0009020963,0.03898507,0.0001358332,0.00031890438,0.000013354448,0.0012750105,0.009599943,0.0002407989,0.7696976,0.0039008735,0.17465478],"study_design_scores_gemma":[0.00057086773,0.00021932898,0.0049581053,0.00013364783,0.000017391762,0.000025830237,0.000030760846,0.98550147,0.0012702174,0.00053904485,0.0063817226,0.00035164013],"about_ca_topic_score_codex":0.00001421428,"about_ca_topic_score_gemma":0.0000032257208,"teacher_disagreement_score":0.9759015,"about_ca_system_score_codex":0.00005149357,"about_ca_system_score_gemma":0.00005756598,"threshold_uncertainty_score":0.86218876},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36080036,0.00004771646,0.6363673,0.00057647465,0.00087287946,0.00036519291,0.00040245336,0.00012314237,0.0004444832],"genre_scores_gemma":[0.9566343,0.0012514798,0.040580638,0.00021056976,0.00023154185,0.000025685062,0.0009476668,0.000015046134,0.00010308271],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977419,0.000056865723,0.0006062491,0.000705152,0.00046967645,0.00042018318],"domain_scores_gemma":[0.9976296,0.00028826328,0.00027625184,0.001268832,0.00042081578,0.00011623117],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043113128,0.0002875573,0.0003329667,0.0002435361,0.00044974228,0.00018254398,0.0030168025,0.00010748724,0.000015291938],"category_scores_gemma":[0.00004466991,0.000289313,0.00004726305,0.00035608243,0.00029216325,0.00069849915,0.00076381123,0.000414579,0.00002118835],"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.0003496186,0.0028207363,0.2012612,0.00021408068,0.00068074226,0.000121294375,0.002663775,0.08618891,0.00023151712,0.027235324,0.0072757713,0.670957],"study_design_scores_gemma":[0.0010930846,0.00015553854,0.037970796,0.00018701829,0.000011513733,0.000082892875,0.000020270329,0.9588652,0.00010165933,0.00007600365,0.0011242004,0.00031182414],"about_ca_topic_score_codex":0.00006474158,"about_ca_topic_score_gemma":0.000051122162,"teacher_disagreement_score":0.8726763,"about_ca_system_score_codex":0.00011717109,"about_ca_system_score_gemma":0.00017164073,"threshold_uncertainty_score":0.9999559},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99585396,0.000012168155,0.002071391,0.00017818381,0.00017525861,0.00008545462,0.00006330742,0.000008703539,0.0015515785],"genre_scores_gemma":[0.9983923,0.00023796072,0.00051842094,0.0001361359,0.000047724116,0.000001597462,0.000045724242,0.0000058401083,0.00061430875],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984933,0.000033856468,0.00043909118,0.00033031843,0.00052047975,0.00018296765],"domain_scores_gemma":[0.99934894,0.000048216196,0.00016417197,0.00032750636,0.00007138437,0.00003976665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040141985,0.0001604587,0.00022541812,0.000040575273,0.0001960304,0.00003505695,0.00052714074,0.000046124493,0.00033096914],"category_scores_gemma":[0.000004941583,0.00010419471,0.000029627152,0.000070907896,0.00038481352,0.0003663319,0.00040516764,0.0001382403,0.000011509337],"study_design_candidate":"observational","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.00024468557,0.00028877205,0.66444874,0.00014265282,0.00020918387,0.000001728005,0.0017605759,0.12390923,0.0021204015,0.0030656783,0.0006826747,0.20312567],"study_design_scores_gemma":[0.00031814267,0.000069218,0.30466178,0.00008844625,0.00001681832,0.0000032239916,0.00003075299,0.6934828,0.00068806054,0.00022274438,0.00029295005,0.00012504264],"about_ca_topic_score_codex":0.00035389955,"about_ca_topic_score_gemma":0.000096284915,"teacher_disagreement_score":0.5695736,"about_ca_system_score_codex":0.000026882515,"about_ca_system_score_gemma":0.00001522432,"threshold_uncertainty_score":0.4248937},"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":"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.27883416,0.000007745623,0.71787536,0.0016725671,0.0004768655,0.00023139938,0.00014460833,0.0001263696,0.0006309239],"genre_scores_gemma":[0.97783494,0.00003962588,0.020212576,0.00046552502,0.0002608995,0.000006139929,0.00007738438,0.000016442078,0.001086496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770427,0.000023285911,0.00039368973,0.0009766404,0.0004824215,0.00041969845],"domain_scores_gemma":[0.9982621,0.00013925845,0.00026042302,0.0009998529,0.00020477723,0.00013360048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044338766,0.00028928922,0.0002501376,0.00018986664,0.00027079027,0.0004139676,0.0025557657,0.000054861754,0.000022101067],"category_scores_gemma":[0.000030313155,0.00019485714,0.000036603335,0.00011828796,0.00019818479,0.00018177142,0.0011895165,0.00015373791,0.000023152836],"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.0005957061,0.001375649,0.07151416,0.00043721413,0.001614208,0.00009296302,0.0017237957,0.05024317,0.0011270859,0.13479692,0.01817558,0.71830356],"study_design_scores_gemma":[0.0019030065,0.00025550407,0.0024995825,0.000558664,0.000021922398,0.000017930633,0.000080150276,0.98551655,0.00027111516,0.00006916811,0.008468282,0.00033814256],"about_ca_topic_score_codex":0.000011443123,"about_ca_topic_score_gemma":0.00001097864,"teacher_disagreement_score":0.93527335,"about_ca_system_score_codex":0.000074984804,"about_ca_system_score_gemma":0.000057143523,"threshold_uncertainty_score":0.79460436},"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":"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.42688593,0.000027866645,0.56781834,0.0006274731,0.0006173949,0.00026449974,0.00011629851,0.00017510349,0.0034670623],"genre_scores_gemma":[0.99874103,0.00041437967,0.000414081,0.00004892874,0.00019198102,0.000009244998,0.0000900094,0.000016527807,0.000073825606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901986,0.000015442667,0.00026694135,0.00026180834,0.000227602,0.00020836195],"domain_scores_gemma":[0.9994374,0.00008989178,0.00007481983,0.00028908887,0.00006192343,0.000046874196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022119115,0.00014086688,0.00012806006,0.00021732136,0.00007015102,0.00006961343,0.0004138173,0.000060275397,0.000029272534],"category_scores_gemma":[0.000019798892,0.000119044504,0.000012462113,0.00015289412,0.000061029536,0.0003483862,0.00004695214,0.0001597359,0.00003250602],"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.00005793974,0.00017236458,0.016590616,0.0002226234,0.00021618544,0.000007390899,0.00035756762,0.6001501,0.004125757,0.25564355,0.0035026306,0.11895328],"study_design_scores_gemma":[0.0003729285,0.000038778733,0.0021334449,0.00014141155,0.0000074366844,0.0000037145087,0.000024244882,0.9941291,0.00050715863,0.0011770822,0.0012965972,0.00016808206],"about_ca_topic_score_codex":0.0000053532167,"about_ca_topic_score_gemma":0.00003294787,"teacher_disagreement_score":0.57185507,"about_ca_system_score_codex":0.00031745457,"about_ca_system_score_gemma":0.00004468676,"threshold_uncertainty_score":0.4854494},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20846517,0.00006026714,0.78767174,0.001374854,0.0010209056,0.0003294307,0.00044448473,0.00016947558,0.00046364803],"genre_scores_gemma":[0.99660796,0.0003446845,0.0024259558,0.00011613352,0.0001577528,0.000018199975,0.00013404034,0.000015263082,0.00017998528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790496,0.000044463526,0.00042917396,0.00077382196,0.0004468158,0.00040074502],"domain_scores_gemma":[0.9984172,0.00017271258,0.0003321064,0.0005790865,0.00037146718,0.00012741625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054095575,0.00029025867,0.00028426756,0.00030483716,0.00036886902,0.00044063086,0.0017629394,0.00009023428,0.000004382456],"category_scores_gemma":[0.000035682435,0.00021468385,0.00005524104,0.00023725607,0.00014195236,0.0007168491,0.00026833886,0.00018786086,0.000016277281],"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.00022755805,0.00055827276,0.0013456675,0.0004042615,0.00030391218,0.000031358257,0.00055476534,0.0066010337,0.0005513425,0.8002327,0.000671441,0.18851769],"study_design_scores_gemma":[0.0009424219,0.0005394284,0.0007001087,0.0010170578,0.000018832825,0.000022554339,0.000054901222,0.9778014,0.00018397381,0.017613221,0.0007372345,0.00036889425],"about_ca_topic_score_codex":0.000009170894,"about_ca_topic_score_gemma":0.0000042819247,"teacher_disagreement_score":0.97120035,"about_ca_system_score_codex":0.000059182756,"about_ca_system_score_gemma":0.00009710981,"threshold_uncertainty_score":0.8754554},"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":"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.45006394,0.000008844511,0.5467289,0.0006810978,0.0015092267,0.00012417231,0.000053882584,0.00010832087,0.00072159077],"genre_scores_gemma":[0.9890086,0.000101739446,0.009506607,0.00061126694,0.00052578433,0.0000039723677,0.00007533524,0.000013829319,0.00015284761],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977278,0.00006673767,0.0004478296,0.0008044383,0.00054006575,0.00041310675],"domain_scores_gemma":[0.9982398,0.00010098249,0.00023417607,0.00082486117,0.0004119268,0.0001882576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007036895,0.0002818113,0.000258552,0.00043960594,0.000489908,0.0005380134,0.0022541,0.00008170519,0.000032085456],"category_scores_gemma":[0.000043906453,0.00026404168,0.00004625765,0.00045366675,0.00015216388,0.0010195486,0.0007616042,0.00029809156,0.000103607235],"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.00017259251,0.00055741647,0.008314844,0.00013164019,0.0003558977,0.000043675795,0.0077457847,0.0041020545,0.0028300846,0.24819836,0.0040326444,0.72351503],"study_design_scores_gemma":[0.00042543694,0.00034744985,0.0042722016,0.000351332,0.000015421809,0.000023465363,0.00007417329,0.9852967,0.0010620451,0.006800067,0.00095930253,0.00037238636],"about_ca_topic_score_codex":0.00004673491,"about_ca_topic_score_gemma":0.000021972019,"teacher_disagreement_score":0.9811947,"about_ca_system_score_codex":0.00004438142,"about_ca_system_score_gemma":0.00008162529,"threshold_uncertainty_score":0.99998116},"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":"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.94057095,0.000020174477,0.05247307,0.0016270551,0.0011527381,0.00009594691,0.0006061812,0.00041898742,0.0030348992],"genre_scores_gemma":[0.9958353,0.0005124234,0.0019014649,0.0007847559,0.00018485953,2.819875e-7,0.0003984508,0.0000046922282,0.00037778172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865234,0.000038694052,0.00029409188,0.0004175763,0.0003615813,0.00023572349],"domain_scores_gemma":[0.99906504,0.00022579815,0.00017653228,0.00026696757,0.0001708856,0.000094749994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023688277,0.00018412546,0.0001777925,0.00017306556,0.00018111034,0.00015926821,0.00064288103,0.00006147162,0.00027135314],"category_scores_gemma":[0.00006110273,0.00012791964,0.000021701646,0.00011381306,0.00016908723,0.00036475097,0.00006518428,0.0001395314,0.00016570989],"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.00006796593,0.00005088923,0.17058238,0.000032855278,0.00006706833,0.000011058454,0.00012405137,0.0030145822,0.00017952561,0.000582018,0.012835796,0.8124518],"study_design_scores_gemma":[0.000294782,0.00011568836,0.07462093,0.00022915745,0.000010133245,0.000009400348,0.00003020596,0.92227864,0.0003965659,0.0003942816,0.0014256375,0.00019455315],"about_ca_topic_score_codex":0.00033064507,"about_ca_topic_score_gemma":0.000021551412,"teacher_disagreement_score":0.9192641,"about_ca_system_score_codex":0.000012813622,"about_ca_system_score_gemma":0.000058278387,"threshold_uncertainty_score":0.5216412},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16613264,0.000060641356,0.8254407,0.00094743905,0.0046035754,0.000088882385,0.000074028816,0.00012305658,0.0025290253],"genre_scores_gemma":[0.9958854,0.0001696007,0.0014989551,0.0005277505,0.00077876926,0.000002953204,0.0001308523,0.000011929868,0.0009937919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798995,0.000058247675,0.0004288865,0.0007226433,0.00048525105,0.00031499309],"domain_scores_gemma":[0.9982399,0.000100433004,0.00020977075,0.0008377279,0.0004911541,0.00012103999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034191413,0.00023183989,0.0002713235,0.00015139057,0.00023779829,0.000629252,0.0015400826,0.00008738486,0.00005964193],"category_scores_gemma":[0.000040384642,0.00022069261,0.000043326123,0.00022126948,0.000064682594,0.00064690184,0.0006217092,0.00029675782,0.00006232033],"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.0001281615,0.00091817335,0.0019501683,0.000290821,0.0008874261,0.0003078878,0.0033012002,0.24544217,0.001618443,0.5913942,0.036490418,0.11727097],"study_design_scores_gemma":[0.00035258115,0.000078903395,0.0004406137,0.00025446567,0.000010136093,0.00008914239,0.00010169676,0.99553245,0.0003608881,0.0005044753,0.0020100684,0.00026457754],"about_ca_topic_score_codex":0.000026888389,"about_ca_topic_score_gemma":0.000017155953,"teacher_disagreement_score":0.82975274,"about_ca_system_score_codex":0.000044837205,"about_ca_system_score_gemma":0.00012448581,"threshold_uncertainty_score":0.8999584},"labels":[],"label_agreement":null}]}