{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":9,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":9,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"c437a189e439","filters":{"venue":"IEEE International Conference on High Performance Computing, Data, and Analytics"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1048569147200194,"gpt":0.3082539207271124,"spread":0.203397006007093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002211911,0.0001408669,0.0001280601,0.0002173214,0.00007015102,0.00006961343,0.0004138173,0.0000602754,0.00002927253],"category_scores_gemma":[0.00001979889,0.0001190445,0.00001246211,0.0001528941,0.00006102954,0.0003483862,0.00004695214,0.0001597359,0.00003250602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003174546,"about_ca_system_score_gemma":0.00004468676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005353217,"about_ca_topic_score_gemma":0.00003294787,"domain_scores_codex":[0.9990199,0.00001544267,0.0002669414,0.0002618083,0.000227602,0.0002083619],"domain_scores_gemma":[0.9994374,0.00008989178,0.00007481983,0.0002890889,0.00006192343,0.0000468742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005793974,0.0001723646,0.01659062,0.0002226234,0.0002161854,0.000007390899,0.0003575676,0.6001501,0.004125757,0.2556435,0.003502631,0.1189533],"study_design_scores_gemma":[0.0003729285,0.00003877873,0.002133445,0.0001414116,0.000007436684,0.000003714509,0.00002424488,0.9941291,0.0005071586,0.001177082,0.001296597,0.0001680821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4268859,0.00002786664,0.5678183,0.0006274731,0.0006173949,0.0002644997,0.0001162985,0.0001751035,0.003467062],"genre_scores_gemma":[0.998741,0.0004143797,0.000414081,0.00004892874,0.000191981,0.000009244998,0.0000900094,0.00001652781,0.00007382561],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5718551,"threshold_uncertainty_score":0.4854494,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07823982118592901,"gpt":0.3075588994016018,"spread":0.2293190782156728,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004433877,0.0002892892,0.0002501376,0.0001898666,0.0002707903,0.0004139676,0.002555766,0.00005486175,0.00002210107],"category_scores_gemma":[0.00003031315,0.0001948571,0.00003660333,0.000118288,0.0001981848,0.0001817714,0.001189517,0.0001537379,0.00002315284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000749848,"about_ca_system_score_gemma":0.00005714352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001144312,"about_ca_topic_score_gemma":0.00001097864,"domain_scores_codex":[0.9977043,0.00002328591,0.0003936897,0.0009766404,0.0004824215,0.0004196985],"domain_scores_gemma":[0.9982621,0.0001392585,0.000260423,0.0009998529,0.0002047772,0.0001336005],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005957061,0.001375649,0.07151416,0.0004372141,0.001614208,0.00009296302,0.001723796,0.05024317,0.001127086,0.1347969,0.01817558,0.7183036],"study_design_scores_gemma":[0.001903006,0.0002555041,0.002499582,0.000558664,0.0000219224,0.00001793063,0.00008015028,0.9855165,0.0002711152,0.00006916811,0.008468282,0.0003381426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2788342,0.000007745623,0.7178754,0.001672567,0.0004768655,0.0002313994,0.0001446083,0.0001263696,0.0006309239],"genre_scores_gemma":[0.9778349,0.00003962588,0.02021258,0.000465525,0.0002608995,0.000006139929,0.00007738438,0.00001644208,0.001086496],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9352733,"threshold_uncertainty_score":0.7946044,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04851792831641229,"gpt":0.3048825053703614,"spread":0.2563645770539492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005409557,0.0002902587,0.0002842676,0.0003048372,0.000368869,0.0004406309,0.001762939,0.00009023428,0.000004382456],"category_scores_gemma":[0.00003568243,0.0002146839,0.00005524104,0.0002372561,0.0001419524,0.0007168491,0.0002683389,0.0001878609,0.00001627728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005918276,"about_ca_system_score_gemma":0.00009710981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009170894,"about_ca_topic_score_gemma":0.000004281925,"domain_scores_codex":[0.997905,0.00004446353,0.000429174,0.000773822,0.0004468158,0.000400745],"domain_scores_gemma":[0.9984172,0.0001727126,0.0003321064,0.0005790865,0.0003714672,0.0001274162],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000227558,0.0005582728,0.001345668,0.0004042615,0.0003039122,0.00003135826,0.0005547653,0.006601034,0.0005513425,0.8002327,0.000671441,0.1885177],"study_design_scores_gemma":[0.0009424219,0.0005394284,0.0007001087,0.001017058,0.00001883282,0.00002255434,0.00005490122,0.9778014,0.0001839738,0.01761322,0.0007372345,0.0003688943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2084652,0.00006026714,0.7876717,0.001374854,0.001020906,0.0003294307,0.0004444847,0.0001694756,0.000463648],"genre_scores_gemma":[0.996608,0.0003446845,0.002425956,0.0001161335,0.0001577528,0.00001819997,0.0001340403,0.00001526308,0.0001799853],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9712003,"threshold_uncertainty_score":0.8754554,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05831802717286136,"gpt":0.318046247010309,"spread":0.2597282198374476,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007036895,0.0002818113,0.000258552,0.0004396059,0.000489908,0.0005380134,0.0022541,0.00008170519,0.00003208546],"category_scores_gemma":[0.00004390645,0.0002640417,0.00004625765,0.0004536668,0.0001521639,0.001019549,0.0007616042,0.0002980916,0.0001036072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004438142,"about_ca_system_score_gemma":0.00008162529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004673491,"about_ca_topic_score_gemma":0.00002197202,"domain_scores_codex":[0.9977278,0.00006673767,0.0004478296,0.0008044383,0.0005400658,0.0004131068],"domain_scores_gemma":[0.9982398,0.0001009825,0.0002341761,0.0008248612,0.0004119268,0.0001882576],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001725925,0.0005574165,0.008314844,0.0001316402,0.0003558977,0.00004367579,0.007745785,0.004102055,0.002830085,0.2481984,0.004032644,0.723515],"study_design_scores_gemma":[0.0004254369,0.0003474499,0.004272202,0.000351332,0.00001542181,0.00002346536,0.00007417329,0.9852967,0.001062045,0.006800067,0.0009593025,0.0003723864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4500639,0.000008844511,0.5467289,0.0006810978,0.001509227,0.0001241723,0.00005388258,0.0001083209,0.0007215908],"genre_scores_gemma":[0.9890086,0.0001017394,0.009506607,0.0006112669,0.0005257843,0.000003972368,0.00007533524,0.00001382932,0.0001528476],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9811947,"threshold_uncertainty_score":0.9999812,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07337362606211412,"gpt":0.3017577557706038,"spread":0.2283841297084896,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003419141,0.0002318399,0.0002713235,0.0001513906,0.0002377983,0.000629252,0.001540083,0.00008738486,0.00005964193],"category_scores_gemma":[0.00004038464,0.0002206926,0.00004332612,0.0002212695,0.00006468259,0.0006469018,0.0006217092,0.0002967578,0.00006232033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000448372,"about_ca_system_score_gemma":0.0001244858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002688839,"about_ca_topic_score_gemma":0.00001715595,"domain_scores_codex":[0.99799,0.00005824768,0.0004288865,0.0007226433,0.000485251,0.0003149931],"domain_scores_gemma":[0.9982399,0.000100433,0.0002097707,0.0008377279,0.0004911541,0.00012104],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001281615,0.0009181733,0.001950168,0.000290821,0.0008874261,0.0003078878,0.0033012,0.2454422,0.001618443,0.5913942,0.03649042,0.117271],"study_design_scores_gemma":[0.0003525811,0.00007890339,0.0004406137,0.0002544657,0.00001013609,0.00008914239,0.0001016968,0.9955325,0.0003608881,0.0005044753,0.002010068,0.0002645775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1661326,0.00006064136,0.8254407,0.0009474391,0.004603575,0.00008888239,0.00007402882,0.0001230566,0.002529025],"genre_scores_gemma":[0.9958854,0.0001696007,0.001498955,0.0005277505,0.0007787693,0.000002953204,0.0001308523,0.00001192987,0.0009937919],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8297527,"threshold_uncertainty_score":0.8999584,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05559194547291946,"gpt":0.293917855258952,"spread":0.2383259097860326,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002368828,0.0001841255,0.0001777925,0.0001730656,0.0001811103,0.0001592682,0.000642881,0.00006147162,0.0002713531],"category_scores_gemma":[0.00006110273,0.0001279196,0.00002170165,0.0001138131,0.0001690872,0.000364751,0.00006518428,0.0001395314,0.0001657099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001281362,"about_ca_system_score_gemma":0.00005827839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003306451,"about_ca_topic_score_gemma":0.00002155141,"domain_scores_codex":[0.9986523,0.00003869405,0.0002940919,0.0004175763,0.0003615813,0.0002357235],"domain_scores_gemma":[0.999065,0.0002257982,0.0001765323,0.0002669676,0.0001708856,0.00009474999],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006796593,0.00005088923,0.1705824,0.00003285528,0.00006706833,0.00001105845,0.0001240514,0.003014582,0.0001795256,0.000582018,0.0128358,0.8124518],"study_design_scores_gemma":[0.000294782,0.0001156884,0.07462093,0.0002291574,0.00001013325,0.000009400348,0.00003020596,0.9222786,0.0003965659,0.0003942816,0.001425638,0.0001945532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.940571,0.00002017448,0.05247307,0.001627055,0.001152738,0.00009594691,0.0006061812,0.0004189874,0.003034899],"genre_scores_gemma":[0.9958353,0.0005124234,0.001901465,0.0007847559,0.0001848595,2.819875e-7,0.0003984508,0.000004692228,0.0003777817],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9192641,"threshold_uncertainty_score":0.5216412,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06866675451301421,"gpt":0.2857024906318621,"spread":0.2170357361188479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004014198,0.0001604587,0.0002254181,0.00004057527,0.0001960304,0.00003505695,0.0005271407,0.00004612449,0.0003309691],"category_scores_gemma":[0.000004941583,0.0001041947,0.00002962715,0.0000709079,0.0003848135,0.0003663319,0.0004051676,0.0001382403,0.00001150934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002688252,"about_ca_system_score_gemma":0.00001522432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003538996,"about_ca_topic_score_gemma":0.00009628492,"domain_scores_codex":[0.9984933,0.00003385647,0.0004390912,0.0003303184,0.0005204797,0.0001829676],"domain_scores_gemma":[0.9993489,0.0000482162,0.000164172,0.0003275064,0.00007138437,0.00003976665],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002446856,0.000288772,0.6644487,0.0001426528,0.0002091839,0.000001728005,0.001760576,0.1239092,0.002120401,0.003065678,0.0006826747,0.2031257],"study_design_scores_gemma":[0.0003181427,0.000069218,0.3046618,0.00008844625,0.00001681832,0.000003223992,0.00003075299,0.6934828,0.0006880605,0.0002227444,0.00029295,0.0001250426],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.995854,0.00001216816,0.002071391,0.0001781838,0.0001752586,0.00008545462,0.00006330742,0.000008703539,0.001551579],"genre_scores_gemma":[0.9983923,0.0002379607,0.0005184209,0.0001361359,0.00004772412,0.000001597462,0.00004572424,0.000005840108,0.0006143088],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5695736,"threshold_uncertainty_score":0.4248937,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.04648544347538451,"gpt":0.3033016478421278,"spread":0.2568162043667432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005459592,0.0002665884,0.0002227721,0.0001822889,0.0002288197,0.0003404404,0.001605936,0.00007730335,0.00003494578],"category_scores_gemma":[0.00001511514,0.0002114305,0.00002752495,0.0002097466,0.0001013572,0.001111329,0.0003521208,0.0002920027,0.0001058078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005149357,"about_ca_system_score_gemma":0.00005756598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001421428,"about_ca_topic_score_gemma":0.000003225721,"domain_scores_codex":[0.9981827,0.00004248619,0.0003282315,0.0005503059,0.0005261968,0.000370125],"domain_scores_gemma":[0.9985187,0.000105384,0.0001950913,0.0008309766,0.0001851488,0.0001647111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002757311,0.0009020963,0.03898507,0.0001358332,0.0003189044,0.00001335445,0.001275011,0.009599943,0.0002407989,0.7696976,0.003900873,0.1746548],"study_design_scores_gemma":[0.0005708677,0.000219329,0.004958105,0.0001336478,0.00001739176,0.00002583024,0.00003076085,0.9855015,0.001270217,0.0005390448,0.006381723,0.0003516401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5879974,0.00001657697,0.4071265,0.000594389,0.0009162066,0.0001858595,0.00005948203,0.000118032,0.00298555],"genre_scores_gemma":[0.9937736,0.0001124111,0.004319118,0.000788097,0.000612772,0.000006247013,0.0001316665,0.00001386536,0.0002422039],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9759015,"threshold_uncertainty_score":0.8621888,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1020864138176995,"gpt":0.3307956684489076,"spread":0.2287092546312081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004311313,0.0002875573,0.0003329667,0.0002435361,0.0004497423,0.000182544,0.003016802,0.0001074872,0.00001529194],"category_scores_gemma":[0.00004466991,0.000289313,0.00004726305,0.0003560824,0.0002921633,0.0006984991,0.0007638112,0.000414579,0.00002118835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001171711,"about_ca_system_score_gemma":0.0001716407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006474158,"about_ca_topic_score_gemma":0.00005112216,"domain_scores_codex":[0.9977419,0.00005686572,0.0006062491,0.000705152,0.0004696765,0.0004201832],"domain_scores_gemma":[0.9976296,0.0002882633,0.0002762518,0.001268832,0.0004208158,0.0001162312],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003496186,0.002820736,0.2012612,0.0002140807,0.0006807423,0.0001212944,0.002663775,0.08618891,0.0002315171,0.02723532,0.007275771,0.670957],"study_design_scores_gemma":[0.001093085,0.0001555385,0.0379708,0.0001870183,0.00001151373,0.00008289288,0.00002027033,0.9588652,0.0001016593,0.00007600365,0.0011242,0.0003118241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3608004,0.00004771646,0.6363673,0.0005764746,0.0008728795,0.0003651929,0.0004024534,0.0001231424,0.0004444832],"genre_scores_gemma":[0.9566343,0.00125148,0.04058064,0.0002105698,0.0002315419,0.00002568506,0.0009476668,0.00001504613,0.0001030827],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8726763,"threshold_uncertainty_score":0.9999559,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}