{"meta":{"query_hash":"0cbaf240d14f","filters":{"venue":"International Journal of High Performance Computing and Networking"},"cohort_total":22,"direct_labels_cover":0,"predictions_cover":22,"exported":22,"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/0cbaf240d14f","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+High+Performance+Computing+and+Networking"},"results":[{"id":"W1973814258","doi":"10.1504/ijhpcn.2006.013490","title":"Real-time minimum vertex cover for two-terminal series-parallel graphs","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Vertex cover; Vertex (graph theory); Cardinality (data modeling); Terminal (telecommunication); Algorithm; Edge cover; Parallel algorithm; Series and parallel circuits; Series (stratigraphy); Graph; Time complexity; Theoretical computer science","score_opus":0.009274216943470406,"score_gpt":0.2574695263585593,"score_spread":0.24819530941508888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973814258","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.44434515,0.0002233926,0.5525613,0.00030972224,0.0017159571,0.00008624403,0.0000013468971,0.00011483569,0.0006420986],"genre_scores_gemma":[0.83235586,0.00025544228,0.16606504,0.00009627452,0.0010465396,0.0000013709786,0.000006382683,0.000012106515,0.00016098614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844944,0.000047085352,0.00061307556,0.00023263272,0.00037550728,0.00028226525],"domain_scores_gemma":[0.99854267,0.00020225991,0.00058942457,0.00013855184,0.00046496498,0.00006210901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063633086,0.00017859782,0.00027438597,0.0002460704,0.00023019151,0.00028580258,0.000790085,0.000057597543,0.0000029884175],"category_scores_gemma":[0.000010655056,0.00016645012,0.00010594178,0.0001640545,0.000055014832,0.0005590365,0.00019512807,0.00016948231,0.000002603414],"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.000751591,0.00030097726,0.012741769,0.00007386773,0.00035168693,0.00019208189,0.0006177413,0.6738321,0.0017439136,0.026839536,0.023422224,0.25913247],"study_design_scores_gemma":[0.0012435335,0.00028780807,0.0029044817,0.0003195088,0.000013849488,0.00079264026,0.0000031211825,0.98721963,0.00046095875,0.004026367,0.0024923163,0.00023579742],"about_ca_topic_score_codex":0.000020348865,"about_ca_topic_score_gemma":6.264889e-7,"teacher_disagreement_score":0.38801074,"about_ca_system_score_codex":0.00005624732,"about_ca_system_score_gemma":0.00006325168,"threshold_uncertainty_score":0.6787639},"labels":[],"label_agreement":null},{"id":"W1986921363","doi":"10.1504/ijhpcn.2005.007863","title":"Optimal all-to-all personalised exchange in a novel optical multistage interconnection network","year":2005,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Interconnection Networks and Systems","field":"Computer Science","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":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Computer network; Gigabit; Node (physics); Interconnection; Low latency (capital markets); Bandwidth (computing); Multistage interconnection networks; Distributed computing; Latency (audio); Transmission (telecommunications); Telecommunications","score_opus":0.023464152984837536,"score_gpt":0.27656840881214967,"score_spread":0.2531042558273121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986921363","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.6144162,0.00043145308,0.37964758,0.0010081352,0.004181665,0.0000747647,4.940922e-7,0.000036630143,0.00020308797],"genre_scores_gemma":[0.9497287,0.0002098698,0.043517638,0.0010769365,0.005411803,0.000002434728,0.0000018293468,0.000014769966,0.00003601049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809235,0.000055669323,0.00074829336,0.00026532603,0.00042841432,0.00040991814],"domain_scores_gemma":[0.9990226,0.00017420595,0.0002905463,0.00012361072,0.00024548022,0.00014352922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011594828,0.00019577245,0.00030681936,0.00031588905,0.0000925251,0.00030839565,0.0006858693,0.000089304755,0.0000063221714],"category_scores_gemma":[0.00001413539,0.00018429414,0.00008544432,0.0002386465,0.000027058975,0.0006159546,0.0002535881,0.00042815483,0.0000050260824],"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.00012043337,0.00008087783,0.002443428,0.000015299478,0.00012997277,0.000047332534,0.0032261868,0.74718094,0.00018724981,0.0012927993,0.0009284432,0.24434702],"study_design_scores_gemma":[0.0010671162,0.00020251829,0.0038719056,0.0006329712,0.0000071692043,0.00081264717,0.00005363941,0.9697834,0.00007391804,0.000022388134,0.023259353,0.0002129709],"about_ca_topic_score_codex":0.0000217939,"about_ca_topic_score_gemma":0.000036442216,"teacher_disagreement_score":0.33612993,"about_ca_system_score_codex":0.00027659093,"about_ca_system_score_gemma":0.000037529306,"threshold_uncertainty_score":0.7515297},"labels":[],"label_agreement":null},{"id":"W1999537538","doi":"10.1504/ijhpcn.2006.013482","title":"Performance assessment of four cluster interconnects on identical hardware: hints for cluster builders","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Myrinet; Computer science; Gigabit Ethernet; Cluster (spacecraft); Popularity; Gigabit; Ethernet; Computer cluster; Computer architecture; Embedded system; Computer network; Distributed computing; Telecommunications; Message passing","score_opus":0.016719539479513337,"score_gpt":0.278292704617197,"score_spread":0.2615731651376837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999537538","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.6078762,0.00006180698,0.3860312,0.00038923844,0.0052564763,0.00010026909,8.2220305e-7,0.000017430504,0.00026658602],"genre_scores_gemma":[0.9839533,0.00008184552,0.012677124,0.00035687725,0.0028407397,0.0000030098763,0.0000026179112,0.000015734404,0.00006873658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977153,0.00008586818,0.0010436708,0.00026392456,0.00058402517,0.00030719116],"domain_scores_gemma":[0.9978242,0.00045023556,0.0008550752,0.0001702323,0.0006359136,0.00006435426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014106181,0.00020083052,0.00037451208,0.00029725835,0.00017139602,0.00023045356,0.00075680064,0.00008486543,0.0000030416597],"category_scores_gemma":[0.000021239042,0.0001689754,0.00015339801,0.00013532328,0.0000546176,0.00052875665,0.00022168549,0.00030572072,0.000001199569],"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.0006456924,0.0003501074,0.1024862,0.00027506106,0.00056413683,0.000032422402,0.000775194,0.55943155,0.00032861528,0.0117406845,0.008076813,0.31529355],"study_design_scores_gemma":[0.0015928604,0.0005746795,0.022635031,0.0013099929,0.000016115073,0.00038136405,0.000018232873,0.97088605,0.00034080338,0.00028169487,0.0017739945,0.00018915841],"about_ca_topic_score_codex":0.000015349242,"about_ca_topic_score_gemma":0.0000044714066,"teacher_disagreement_score":0.41145456,"about_ca_system_score_codex":0.00013065977,"about_ca_system_score_gemma":0.00005519196,"threshold_uncertainty_score":0.68906164},"labels":[],"label_agreement":null},{"id":"W2035538419","doi":"10.1504/ijhpcn.2011.038708","title":"Leveraging many simple statistical models to adaptively monitor software systems","year":2011,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":7,"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 Waterloo","funders":"","keywords":"Computer science; System monitoring; Context (archaeology); Software; Component (thermodynamics); Continuous monitoring; Fault detection and isolation; Data mining; Reliability engineering; Simple (philosophy); Real-time computing; Artificial intelligence","score_opus":0.0422950986400276,"score_gpt":0.2618850722666185,"score_spread":0.2195899736265909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035538419","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.45453602,0.00026631416,0.54226816,0.000028954315,0.0027516065,0.000057142457,0.000001306357,0.00004303056,0.00004745611],"genre_scores_gemma":[0.9379307,0.000117565716,0.06060906,0.00010819959,0.0012088872,0.0000018587183,0.0000010892794,0.000012170187,0.000010439588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805987,0.000068498426,0.0006903571,0.00026833505,0.00058842235,0.0003245215],"domain_scores_gemma":[0.9985233,0.00018980977,0.00039035396,0.00018200223,0.0005472298,0.00016728307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008883728,0.00017923448,0.00030672428,0.00022162864,0.00020380954,0.00020958952,0.00089895737,0.00006205603,0.0000027350568],"category_scores_gemma":[0.000019959647,0.00014965697,0.00005430222,0.00016407155,0.000040676685,0.0007348758,0.00036484987,0.00028213044,0.0000062609447],"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.00027853536,0.00015492261,0.10622089,0.0001263523,0.0003324117,0.00020694501,0.0103473235,0.17136373,0.000037250935,0.0046038027,0.00079682947,0.705531],"study_design_scores_gemma":[0.0005952042,0.0003303582,0.03950341,0.0007892017,0.00001477949,0.00064284116,0.00017780354,0.95541716,0.00014174468,0.0014749161,0.00061088725,0.0003016982],"about_ca_topic_score_codex":0.00010924197,"about_ca_topic_score_gemma":6.49229e-7,"teacher_disagreement_score":0.78405344,"about_ca_system_score_codex":0.000109957226,"about_ca_system_score_gemma":0.00006536229,"threshold_uncertainty_score":0.61028343},"labels":[],"label_agreement":null},{"id":"W2044923352","doi":"10.1504/ijhpcn.2005.009424","title":"A security system implementation using software agents","year":2005,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Computer science; Guard (computer science); Implementation; Computer security; Architecture; Service (business); Encryption; Interface (matter); Operating system; Software engineering; Business","score_opus":0.016632771462892378,"score_gpt":0.28800289151732955,"score_spread":0.27137012005443717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044923352","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.66166294,0.000336193,0.33576998,0.00012830489,0.0019606757,0.000064905864,4.810698e-7,0.000043136726,0.000033394506],"genre_scores_gemma":[0.9616989,0.00016276108,0.035450593,0.00025613545,0.0024157981,7.988519e-7,0.0000021828396,0.000009510067,0.0000033070867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983187,0.00006749398,0.0005924203,0.00019936755,0.00056708994,0.00025496335],"domain_scores_gemma":[0.9988184,0.000068706635,0.0006473311,0.0001382675,0.00024894855,0.000078335295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007934095,0.00014005051,0.00018412249,0.00021414389,0.00019067683,0.00025816084,0.00070865033,0.000032697182,0.000005743555],"category_scores_gemma":[0.0000036799572,0.00013421827,0.000060754643,0.00017276476,0.000019945168,0.00066073047,0.00037728067,0.00018551871,0.0000028059212],"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.000023741604,0.000030355955,0.018174147,0.000035800484,0.00014979891,0.00005636794,0.00057651737,0.22923103,0.000015159919,0.0009281769,0.00057171966,0.7502072],"study_design_scores_gemma":[0.0007548137,0.00007089066,0.0044696224,0.00045808216,0.00001915532,0.00034921867,0.000073120485,0.98913866,0.00015824946,0.000055844364,0.004306719,0.00014561962],"about_ca_topic_score_codex":0.000020922917,"about_ca_topic_score_gemma":0.000003892062,"teacher_disagreement_score":0.7599076,"about_ca_system_score_codex":0.00036253087,"about_ca_system_score_gemma":0.000052439955,"threshold_uncertainty_score":0.5473262},"labels":[],"label_agreement":null},{"id":"W2063877455","doi":"10.1504/ijhpcn.2006.013487","title":"A parallel quasi-Monte Carlo approach to pricing multidimensional American options","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Mathematical Approximation and Integration","field":"Mathematics","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":"Actua; University of Waterloo","funders":"","keywords":"Computer science; Speedup; Scalability; Monte Carlo method; Parallel computing; Monte Carlo methods for option pricing; Recursion (computer science); Parallel algorithm; Mathematical optimization; Quasi-Monte Carlo method; Markov chain Monte Carlo; Algorithm; Hybrid Monte Carlo; Mathematics; Artificial intelligence","score_opus":0.02553075317867747,"score_gpt":0.29539776281512065,"score_spread":0.26986700963644317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063877455","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.7343357,0.000065480155,0.26417634,0.0002914011,0.00035615996,0.00008460015,8.517208e-7,0.000025532341,0.0006639092],"genre_scores_gemma":[0.72132415,0.000028883363,0.27762726,0.00010710297,0.00084772235,0.0000019261015,0.000002136697,0.00001102296,0.000049814495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845105,0.000050282295,0.0006776957,0.00014665628,0.00048694777,0.00018734914],"domain_scores_gemma":[0.9986769,0.00025747198,0.00052169396,0.000080691796,0.00038817132,0.00007508648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062273134,0.00014377081,0.0002834251,0.00019870502,0.00014473642,0.00008630046,0.000190492,0.000034338147,0.0000046694286],"category_scores_gemma":[0.000059403934,0.000114861985,0.000072340656,0.00016447688,0.0000505444,0.00016329906,0.00007482751,0.00022614846,0.0000027204867],"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.0006854746,0.0025921934,0.017678404,0.0002532089,0.0006178634,0.00003566016,0.0053154477,0.1946038,0.0006996707,0.5317365,0.008461348,0.23732047],"study_design_scores_gemma":[0.0007651194,0.00021293461,0.007277969,0.0006100496,0.000034976758,0.00032703797,0.00024121054,0.97838694,0.00010296087,0.0104046,0.0013970938,0.00023910678],"about_ca_topic_score_codex":0.00005230153,"about_ca_topic_score_gemma":0.0000052292903,"teacher_disagreement_score":0.78378314,"about_ca_system_score_codex":0.00007803173,"about_ca_system_score_gemma":0.000025490343,"threshold_uncertainty_score":0.46839356},"labels":[],"label_agreement":null},{"id":"W2068518386","doi":"10.1504/ijhpcn.2010.037791","title":"A novel technique of recognising multi-stage attack behaviour","year":2010,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":8,"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 New Brunswick","funders":"","keywords":"Computer science; Audit; Computer security; Feature (linguistics); Data mining; Attack model","score_opus":0.034530444530666234,"score_gpt":0.3034008261695685,"score_spread":0.26887038163890226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068518386","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.60511583,0.00007455186,0.39183575,0.00007149927,0.002811569,0.0000374392,5.396346e-7,0.000018311706,0.000034481287],"genre_scores_gemma":[0.88149506,0.00016013597,0.11734084,0.00006031021,0.0009240703,5.528971e-7,6.1927466e-7,0.0000069633857,0.0000114755285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876714,0.00002633363,0.0005410822,0.0001570963,0.0003417451,0.00016662473],"domain_scores_gemma":[0.9985976,0.00010550789,0.0006840993,0.00012589518,0.00042659172,0.000060286926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092161336,0.00011271816,0.00019207198,0.00022498672,0.00013518936,0.00011881442,0.0006362926,0.00008529123,0.0000054515126],"category_scores_gemma":[0.000021995946,0.000103935236,0.000066756045,0.00017755202,0.000057497895,0.00047604472,0.00025470843,0.0005770474,6.392543e-7],"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.000098914155,0.00026663268,0.029362995,0.00003702958,0.00010667131,0.000036895064,0.0010401402,0.008723479,0.04921999,0.0010698539,0.00009472134,0.9099427],"study_design_scores_gemma":[0.0011996786,0.0002937877,0.026785284,0.0008953378,0.000015331676,0.001680152,0.000023727034,0.9390281,0.02654489,0.00013112287,0.0031344963,0.000268118],"about_ca_topic_score_codex":0.00002216701,"about_ca_topic_score_gemma":0.000009491287,"teacher_disagreement_score":0.9303046,"about_ca_system_score_codex":0.0000225081,"about_ca_system_score_gemma":0.000041735406,"threshold_uncertainty_score":0.42383558},"labels":[],"label_agreement":null},{"id":"W2084175966","doi":"10.1504/ijhpcn.2011.038709","title":"A self-stabilising algorithm for 3-edge-connectivity","year":2011,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Distributed systems and fault tolerance","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":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Asynchronous communication; Enhanced Data Rates for GSM Evolution; Computation; Spanning tree; Distributed algorithm; Algorithm; Fault tolerance; Self-stabilization; Distributed minimum spanning tree; Minimum spanning tree; Tree (set theory); Distributed computing; Parallel computing; Mathematics; Discrete mathematics; Combinatorics; Computer network","score_opus":0.019761998359530346,"score_gpt":0.25083017889184356,"score_spread":0.2310681805323132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084175966","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.31511074,0.00042612496,0.6810264,0.000051974705,0.0031350048,0.000056569934,0.0000015204624,0.00003641874,0.00015525053],"genre_scores_gemma":[0.83949876,0.00009777262,0.15918688,0.00006234527,0.001141755,0.0000010311621,7.9452667e-7,0.0000063255557,0.000004315901],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988714,0.000034513974,0.00043502208,0.00018098061,0.00026222804,0.00021586522],"domain_scores_gemma":[0.9987649,0.00014518923,0.00045036446,0.00010943289,0.00046265824,0.00006747435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008380619,0.00011809026,0.0002150595,0.00011084702,0.00016269452,0.00015926867,0.0006184753,0.00004561812,0.0000010051065],"category_scores_gemma":[0.000011894017,0.00010416918,0.000073505325,0.00011978581,0.000024895706,0.0005553906,0.00014258534,0.00016486047,7.277465e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023199715,0.00007177222,0.004164067,0.000019597108,0.00010619463,0.000018882987,0.0016099671,0.00032911703,0.0000151125405,0.0012211388,0.00008670683,0.99233425],"study_design_scores_gemma":[0.0008302776,0.00019050656,0.007547934,0.00033431483,0.000010835942,0.0004737354,0.000036682723,0.9842066,0.000350253,0.0006232268,0.005233225,0.00016237442],"about_ca_topic_score_codex":0.000010205818,"about_ca_topic_score_gemma":7.9124806e-7,"teacher_disagreement_score":0.9921719,"about_ca_system_score_codex":0.000055561777,"about_ca_system_score_gemma":0.00004528581,"threshold_uncertainty_score":0.42478958},"labels":[],"label_agreement":null},{"id":"W209015621","doi":"10.1504/ijhpcn.2006.013484","title":"MPI scalability of a large memory LES code","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Fluid Dynamics and Turbulent Flows","field":"Engineering","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":"Queen's University","funders":"","keywords":"Scalability; Parallel computing; Turbulence; Computer science; Computational science; Code (set theory); Finite volume method; Grid; Large eddy simulation; Reynolds number; Jet (fluid); Flow (mathematics); Visualization; Detached eddy simulation; Mechanics; Reynolds-averaged Navier–Stokes equations; Physics; Operating system; Geometry; Mathematics","score_opus":0.005598487294784071,"score_gpt":0.21727230263522315,"score_spread":0.21167381534043908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W209015621","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.9894839,0.0014766809,0.0070127305,0.000036445952,0.0015305057,0.000021869198,0.0000040765462,0.00002155767,0.0004122348],"genre_scores_gemma":[0.9974537,0.000360501,0.0010884369,0.000012185093,0.0010613744,1.5703063e-7,0.0000034782895,0.000010299226,0.000009864765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999162,0.0000123453665,0.00041337032,0.000063415224,0.00021651214,0.00013233152],"domain_scores_gemma":[0.9995712,0.00006330502,0.00014097488,0.000050551957,0.00014925082,0.000024724382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036671,0.00008476225,0.00016241946,0.00009531852,0.00004938235,0.000026741205,0.00015960746,0.00003810802,0.0000061535548],"category_scores_gemma":[0.0000039022593,0.00007725294,0.00004949451,0.000058044097,0.000028774019,0.00008829812,0.000045845576,0.00017197225,4.0989605e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032876647,0.000045600205,0.08531282,0.000054045286,0.00008295907,0.000010912154,0.00009893161,0.8355335,0.00035945536,0.00037144567,0.0002833243,0.07781411],"study_design_scores_gemma":[0.0004545999,0.00003049685,0.05874454,0.00026775937,0.00000929407,0.00006450029,0.0000069020357,0.9388027,0.0003207015,0.00015370436,0.0010679256,0.00007683254],"about_ca_topic_score_codex":0.000016690952,"about_ca_topic_score_gemma":0.000008369273,"teacher_disagreement_score":0.10326923,"about_ca_system_score_codex":0.000037470592,"about_ca_system_score_gemma":0.000009378942,"threshold_uncertainty_score":0.31502834},"labels":[],"label_agreement":null},{"id":"W2102000944","doi":"10.1504/ijhpcn.2006.010202","title":"A protocol independent energy saving technique for mobile ad hoc networks","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"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; Computer network; Mobile ad hoc network; Routing protocol; Node (physics); Protocol (science); Distributed computing; Optimized Link State Routing Protocol; Wireless ad hoc network; Energy (signal processing); Routing (electronic design automation); Telecommunications; Wireless","score_opus":0.008696791933068668,"score_gpt":0.2612928837494678,"score_spread":0.25259609181639914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102000944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021126796,0.0012765442,0.9717099,0.00007255374,0.0017803418,0.0038651347,4.366161e-7,0.000050619477,0.00011766536],"genre_scores_gemma":[0.9548093,0.0002562285,0.03899953,0.0001290242,0.0034606515,0.002280156,0.0000029825062,0.000022416238,0.000039726114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798095,0.00006004066,0.00079680345,0.00029763134,0.00047129358,0.0003932709],"domain_scores_gemma":[0.99814665,0.0002957323,0.0008501295,0.00018666145,0.0004420052,0.000078831654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009246384,0.00021684852,0.0002977285,0.00020429904,0.00022655864,0.00032918894,0.0010500306,0.000118676675,0.0000028315126],"category_scores_gemma":[0.0000068102554,0.00019601168,0.000113126276,0.00020445403,0.000045643388,0.00049148296,0.00038201932,0.00034561532,3.112121e-7],"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.0001259776,0.00008662893,0.0030325234,0.000022728484,0.000066967936,0.000032103442,0.00006173157,0.2604121,0.0002165033,0.0021820706,0.00066515047,0.7330955],"study_design_scores_gemma":[0.0014727756,0.0005128442,0.0025818362,0.00082428055,0.000011532195,0.0007700545,0.000006566728,0.918712,0.000797649,0.0012413848,0.07276066,0.00030839292],"about_ca_topic_score_codex":0.000007753789,"about_ca_topic_score_gemma":0.000009019705,"teacher_disagreement_score":0.9336825,"about_ca_system_score_codex":0.00012887495,"about_ca_system_score_gemma":0.000069075955,"threshold_uncertainty_score":0.7993124},"labels":[],"label_agreement":null},{"id":"W2103988755","doi":"10.1504/ijhpcn.2005.008033","title":"Flyover: a technique for achieving high performance in CORBA-based systems with limited heterogeneity","year":2005,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"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":"Common Object Request Broker Architecture; Computer science; Middleware (distributed applications); Workload; Distributed computing; Operability; Exploit; Operating system; Software engineering","score_opus":0.014768396179347396,"score_gpt":0.2491589364692765,"score_spread":0.23439054028992912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103988755","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.5576737,0.00036789983,0.440645,0.00014640008,0.0009590727,0.00014780929,0.0000017219452,0.000034742734,0.000023644929],"genre_scores_gemma":[0.9726463,0.00008867057,0.025616918,0.0001305789,0.001479259,0.00000845226,0.0000073519714,0.000016403394,0.000006083826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979887,0.00008564494,0.0007677399,0.0002930542,0.00048778713,0.00037709606],"domain_scores_gemma":[0.99827206,0.00027928487,0.00075232383,0.00018831568,0.0004228204,0.00008521112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013075543,0.00022781231,0.00038501646,0.0003282273,0.00019194875,0.00033322847,0.00091864297,0.00008557055,3.663337e-7],"category_scores_gemma":[0.000013100993,0.00019154538,0.00006247044,0.0002953275,0.00004078084,0.0005101473,0.00013985358,0.00034486543,8.4850495e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022206918,0.00008943518,0.075576134,0.00010013477,0.00008451911,0.000023470455,0.00015979087,0.8525592,0.00017118183,0.00033960713,0.000048494374,0.07062597],"study_design_scores_gemma":[0.0015997428,0.00045336626,0.035930157,0.0023880533,0.000009984771,0.00054287334,0.00000710866,0.9555218,0.00079973653,0.000008012676,0.0024891556,0.00025001192],"about_ca_topic_score_codex":0.000020924226,"about_ca_topic_score_gemma":0.0000042188703,"teacher_disagreement_score":0.4150281,"about_ca_system_score_codex":0.00016887003,"about_ca_system_score_gemma":0.000107966756,"threshold_uncertainty_score":0.7810994},"labels":[],"label_agreement":null},{"id":"W2143374468","doi":"10.1504/ijhpcn.2006.013483","title":"Solving the Dynamic Plant Layout Problem using a new hybrid meta-heuristic algorithm","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","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 New Brunswick","funders":"","keywords":"Mathematical optimization; Heuristic; Computer science; Quadratic assignment problem; Meta heuristic; Remainder; Quadratic equation; Algorithm; Optimization problem; Mathematics; Arithmetic","score_opus":0.012545693961710014,"score_gpt":0.22592398662088073,"score_spread":0.21337829265917072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143374468","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.15405406,0.0024295156,0.8418009,0.00005167508,0.0014858458,0.000044031785,0.000003622197,0.00005125114,0.00007908943],"genre_scores_gemma":[0.9281296,0.00043038122,0.06994703,0.000024628644,0.0014205335,3.5055902e-7,0.000008816479,0.000019899298,0.00001875647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904066,0.000017123995,0.0004129336,0.00009492647,0.00024135073,0.00019302256],"domain_scores_gemma":[0.99945104,0.00011890012,0.00023649556,0.00006189884,0.00009470874,0.000036945996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025638638,0.00014582058,0.00020774255,0.00010270576,0.0001538472,0.000120727185,0.00020788914,0.000027578739,0.0000031364425],"category_scores_gemma":[0.000005617445,0.00010639073,0.00006112944,0.00005651153,0.000030545496,0.00014988893,0.000051833526,0.00027199383,4.9113976e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073450274,0.0000054801876,0.00011906284,0.000009681521,0.0001912242,0.000018197541,0.000050746803,0.9483694,0.00001779044,0.000043580498,0.00012557855,0.051041916],"study_design_scores_gemma":[0.0002625797,0.000021245018,0.00042794467,0.00016000065,0.00013713731,0.00057074276,0.000008791049,0.99602944,0.00016379241,0.0012579868,0.00083890033,0.00012144323],"about_ca_topic_score_codex":0.000037920727,"about_ca_topic_score_gemma":0.0000029425346,"teacher_disagreement_score":0.77407557,"about_ca_system_score_codex":0.00008035086,"about_ca_system_score_gemma":0.000021648835,"threshold_uncertainty_score":0.43384883},"labels":[],"label_agreement":null},{"id":"W2165358822","doi":"10.1504/ijhpcn.2011.038704","title":"Grid resources valuation with fuzzy real option","year":2011,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":7,"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 Manitoba","funders":"","keywords":"Computer science; Grid; Valuation (finance); Fuzzy logic; Quality of service; Grid computing; Operations research; Mathematical optimization; Finance; Computer network; Economics; Artificial intelligence","score_opus":0.03691834865257854,"score_gpt":0.23003355509579598,"score_spread":0.19311520644321745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165358822","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.7101571,0.00054597884,0.28655544,0.00007846137,0.000796425,0.000033928147,0.0000024691017,0.000010312093,0.0018198644],"genre_scores_gemma":[0.989959,0.00062999537,0.0077921194,0.00004949645,0.0015473691,0.0000014190201,0.000002969087,0.000008448927,0.000009187444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99925697,0.0000031831428,0.00042700244,0.00012234238,0.00007763469,0.00011284533],"domain_scores_gemma":[0.9990823,0.000029713516,0.000636611,0.000055631594,0.00016032976,0.000035394125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040659524,0.00007591925,0.00015735341,0.00014427427,0.000112337206,0.00004743025,0.00018246574,0.00003495328,0.000004189245],"category_scores_gemma":[0.000008724722,0.00007053945,0.000027117283,0.000106330124,0.00003856819,0.00019224978,0.0000384788,0.0001248242,0.000005963182],"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.00048542017,0.00015793552,0.19089353,0.000033509627,0.00023575829,0.000016070846,0.0048848726,0.003955744,0.000019525934,0.561417,0.000055564302,0.23784506],"study_design_scores_gemma":[0.0016433452,0.0006873722,0.7100934,0.00052908494,0.000032014683,0.000371101,0.00016344461,0.07429359,0.000084559826,0.2070483,0.004664944,0.00038887848],"about_ca_topic_score_codex":0.00008371405,"about_ca_topic_score_gemma":0.0000033290016,"teacher_disagreement_score":0.51919985,"about_ca_system_score_codex":0.000036974594,"about_ca_system_score_gemma":0.000013399277,"threshold_uncertainty_score":0.28765154},"labels":[],"label_agreement":null},{"id":"W2293138419","doi":"10.1504/ijhpcn.2016.074656","title":"OCReM: OpenStack-based cloud datacentre resource monitoring and management scheme","year":2016,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Cloud computing; Computer science; Operating system; Virtual machine; Resource (disambiguation); Resource management (computing); Task (project management); Scheme (mathematics); Interface (matter); Open source; Distributed computing; Software; Database; Computer network; Systems engineering; Engineering","score_opus":0.014490261028686566,"score_gpt":0.2480292480325546,"score_spread":0.23353898700386805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293138419","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.8959705,0.00085704686,0.09860387,0.0018771725,0.0022749826,0.00006798358,4.541579e-7,0.000055024644,0.00029291847],"genre_scores_gemma":[0.97445375,0.0005558741,0.022896891,0.00015618601,0.0018367921,4.771823e-7,4.3640105e-7,0.000011148825,0.000088462046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983625,0.00005831619,0.000456351,0.00029360718,0.0005350109,0.0002942413],"domain_scores_gemma":[0.99895495,0.00018156615,0.00040130175,0.00021584165,0.00013856453,0.00010779431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007892972,0.00017039107,0.00020407603,0.0002178938,0.00022562488,0.00028757015,0.00093747827,0.000037639642,0.0000013807994],"category_scores_gemma":[0.000009671747,0.00012220207,0.000047247897,0.0001445319,0.00006195335,0.00012023443,0.0009408491,0.00017021726,0.0000021232559],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006812974,0.000042564134,0.037480034,0.000041637923,0.0001759818,0.00013779539,0.00020095296,0.007946439,0.000068509224,0.0014299467,0.00064387533,0.9517641],"study_design_scores_gemma":[0.0058288136,0.00041162423,0.06465638,0.008782764,0.0000635645,0.0007112729,0.00016803309,0.78635955,0.0011997125,0.00040876266,0.13058259,0.0008269129],"about_ca_topic_score_codex":0.0000039005695,"about_ca_topic_score_gemma":1.9610222e-7,"teacher_disagreement_score":0.9509372,"about_ca_system_score_codex":0.000076623306,"about_ca_system_score_gemma":0.000017483226,"threshold_uncertainty_score":0.49832556},"labels":[],"label_agreement":null},{"id":"W230790256","doi":"10.1504/ijhpcn.2006.013476","title":"Performance evaluation of the Sun Fire Link SMP clusters","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Interconnection; Latency (audio); Link (geometry); Node (physics); Bandwidth (computing); Software; Remote direct memory access; Cluster (spacecraft); Computer network; Computer architecture; Operating system; Engineering; Telecommunications","score_opus":0.017392002779588564,"score_gpt":0.25291831189435254,"score_spread":0.23552630911476397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W230790256","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.97719055,0.0006848407,0.013587247,0.0005013468,0.00738593,0.000074101445,2.919689e-7,0.000013828409,0.0005618819],"genre_scores_gemma":[0.99616116,0.00014408542,0.00074748043,0.00008958044,0.0028173032,7.7766725e-7,7.968128e-7,0.0000065786553,0.00003224656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980312,0.00012553486,0.0006641691,0.00014220519,0.0008634669,0.00017343195],"domain_scores_gemma":[0.9980085,0.00010966965,0.00082154747,0.00015877046,0.00087362225,0.000027906508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018364612,0.00011534555,0.00018765668,0.00010465638,0.00019751862,0.00012496137,0.0007717306,0.000054408752,0.0000032035664],"category_scores_gemma":[0.000012434884,0.000082348415,0.00008821094,0.00020480384,0.000050545936,0.00038657882,0.00020150549,0.00023881477,8.168163e-7],"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.000025799192,0.00002423131,0.043064255,0.000014626764,0.000058899877,0.000002093689,0.0003103496,0.40022165,0.000045472418,0.00044496052,0.0004277412,0.5553599],"study_design_scores_gemma":[0.00055773085,0.00007385603,0.06694045,0.00064483384,0.000015858575,0.0002593546,0.000014335503,0.93006784,0.0002669716,0.00013610799,0.00093597104,0.00008666932],"about_ca_topic_score_codex":0.00003840775,"about_ca_topic_score_gemma":0.0000054499287,"teacher_disagreement_score":0.55527323,"about_ca_system_score_codex":0.00009735435,"about_ca_system_score_gemma":0.000076264514,"threshold_uncertainty_score":0.33580709},"labels":[],"label_agreement":null},{"id":"W234760897","doi":"10.1504/ijhpcn.2006.013478","title":"Performance evaluation for neutron transport application using message passing","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Nuclear reactor physics and engineering","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":"Polytechnique Montréal","funders":"","keywords":"Solver; Computer science; Neutron transport; Message passing; Scalar (mathematics); Neutron; Iterative method; Software; Computational science; Parallel computing; Context (archaeology); Mathematical optimization; Distributed computing; Algorithm; Nuclear physics; Physics; Mathematics; Operating system; Geometry","score_opus":0.011055827884392227,"score_gpt":0.23528499911256034,"score_spread":0.22422917122816813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W234760897","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.94743437,0.00035086035,0.050601766,0.000011327065,0.0012812482,0.00007900953,0.0000011144549,0.000036640213,0.00020365488],"genre_scores_gemma":[0.9951077,0.0001373492,0.0024544396,0.0000066301573,0.0022512365,0.0000016203276,0.000011798834,0.00002765497,0.0000015379774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915963,0.00000595424,0.00033966373,0.00008367502,0.00025513134,0.00015593113],"domain_scores_gemma":[0.99956226,0.00003151297,0.00014458399,0.00004913093,0.00018633436,0.00002617762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036984225,0.00010972482,0.00014209331,0.00010303961,0.00008947261,0.000045331253,0.000119143675,0.00003800238,9.995272e-7],"category_scores_gemma":[0.0000011276824,0.00011177574,0.000040975392,0.000077415396,0.000013341047,0.0002611317,0.000011462961,0.0001331907,2.3594221e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014204504,0.000007756583,0.0042785066,0.000028300476,0.000031752716,5.5451136e-7,0.000044277025,0.802931,0.005670473,0.000045242712,0.000013057932,0.18693486],"study_design_scores_gemma":[0.0004584902,0.000025230385,0.034012493,0.00024239787,0.000032385986,0.000038586906,0.000007858577,0.96313363,0.00070204254,0.00003840946,0.0011938273,0.00011466573],"about_ca_topic_score_codex":0.000010560013,"about_ca_topic_score_gemma":8.918533e-7,"teacher_disagreement_score":0.1868202,"about_ca_system_score_codex":0.00011064222,"about_ca_system_score_gemma":0.000015237927,"threshold_uncertainty_score":0.45580825},"labels":[],"label_agreement":null},{"id":"W2615460309","doi":"10.1504/ijhpcn.2017.10005140","title":"pvFPGA: paravirtualising an FPGA-based hardware accelerator towards general purpose computing","year":2017,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","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":"University of Ottawa","funders":"","keywords":"Computer science; Field-programmable gate array; Pipeline (software); Embedded system; Hardware acceleration; FPGA prototype; Direct memory access; Computer hardware; Context (archaeology); Operating system; Transfer (computing)","score_opus":0.033200928290987794,"score_gpt":0.31594436080182037,"score_spread":0.28274343251083256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615460309","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.5159402,0.00023532906,0.4810774,0.00037456816,0.0021035536,0.00004625163,7.658282e-7,0.000101283455,0.000120683275],"genre_scores_gemma":[0.8504056,0.00016597287,0.14658676,0.0004220692,0.0023829436,4.5622028e-7,0.0000044538065,0.000017784876,0.000013965529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977335,0.00011932082,0.0007581587,0.0003668087,0.00064704876,0.00037519983],"domain_scores_gemma":[0.9972135,0.00009414852,0.0013489963,0.00045130448,0.00071905524,0.00017300388],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012937111,0.00025732783,0.00037790523,0.0002775939,0.0010848691,0.001931335,0.002461592,0.00009838554,0.0000024583628],"category_scores_gemma":[0.000051307572,0.0002406065,0.00010416993,0.00010777162,0.000104928,0.0013163547,0.00063006143,0.00043939624,0.0000013273115],"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.000055078446,0.00007893518,0.014194088,0.000016069496,0.00007494219,0.00009533857,0.00046123055,0.15018535,0.00009839571,0.0007903374,0.00022685122,0.83372337],"study_design_scores_gemma":[0.0008574692,0.00021471166,0.021143332,0.00056983484,0.000011354101,0.00024345104,0.000010511427,0.9728253,0.0021366533,0.00024383045,0.001449106,0.00029444537],"about_ca_topic_score_codex":0.00004594905,"about_ca_topic_score_gemma":0.0000019246572,"teacher_disagreement_score":0.8334289,"about_ca_system_score_codex":0.000091909606,"about_ca_system_score_gemma":0.00017032407,"threshold_uncertainty_score":0.99910474},"labels":[],"label_agreement":null},{"id":"W2888279336","doi":"10.1504/ijhpcn.2019.097051","title":"Performance evaluation of OpenMP's target construct on GPUs - exploring compiler optimisations","year":2018,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Compiler; CUDA; Parallel computing; Fortran; Programming language; Programming paradigm; Implementation; Construct (python library); Set (abstract data type); IBM; Supercomputer","score_opus":0.06125931175195404,"score_gpt":0.3097343786552617,"score_spread":0.24847506690330767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888279336","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.82607853,0.00014777418,0.16995995,0.00012953,0.002504362,0.00007759008,6.176409e-7,0.000048979247,0.001052648],"genre_scores_gemma":[0.90436786,0.00034073676,0.09413649,0.00009686729,0.0010404327,0.0000017386274,0.000002297387,0.00000890804,0.000004635556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793893,0.000117777294,0.0006651676,0.00021107643,0.00086525164,0.0002017703],"domain_scores_gemma":[0.9972853,0.0001593508,0.0007526261,0.00018690566,0.0015519119,0.00006389473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018063905,0.00015291804,0.00024825003,0.0003495841,0.0002500401,0.00013561301,0.00079717115,0.00004747249,0.000009597028],"category_scores_gemma":[0.000041381063,0.000140728,0.000054412263,0.00025407036,0.00012489394,0.0006605773,0.00023342457,0.00022706922,0.0000025818065],"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.00007179487,0.00006536778,0.018299479,0.000010410158,0.000106569605,0.0000029339717,0.00091136695,0.43864828,0.00007873903,0.0012885219,0.00027166918,0.5402449],"study_design_scores_gemma":[0.0007325653,0.00038456605,0.015779642,0.00071326835,0.000015143412,0.00011214679,0.000019990657,0.97735626,0.004137785,0.00021024312,0.0003895604,0.00014882744],"about_ca_topic_score_codex":0.000004690631,"about_ca_topic_score_gemma":3.5883517e-7,"teacher_disagreement_score":0.54009604,"about_ca_system_score_codex":0.0000880719,"about_ca_system_score_gemma":0.000117712756,"threshold_uncertainty_score":0.57387215},"labels":[],"label_agreement":null},{"id":"W2904066832","doi":"10.1504/ijhpcn.2019.10018085","title":"Efficient implementation of OpenACC cache directive on NVIDIA GPUs","year":2018,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Parallel Computing and Optimization Techniques","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":"University of Victoria","funders":"","keywords":"Computer science; CUDA; Cache; Parallel computing; Compiler; Smart Cache; Cache algorithms; Operating system; Cache pollution; CPU cache","score_opus":0.01486184162275694,"score_gpt":0.3065057005190688,"score_spread":0.29164385889631184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904066832","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.7066374,0.00012526075,0.29126096,0.00015089707,0.0013976147,0.00004244601,4.3446133e-7,0.00002951951,0.00035547136],"genre_scores_gemma":[0.9707931,0.0001089403,0.028103942,0.0001337936,0.00084676844,4.0283075e-7,7.867632e-7,0.000005793418,0.0000064305254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988013,0.000061471044,0.00045330529,0.00015523013,0.00037875344,0.00014993767],"domain_scores_gemma":[0.9985469,0.0001328506,0.00060824153,0.000106300366,0.0005622064,0.00004351321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006941775,0.00010306245,0.00017192325,0.00022883149,0.00013638058,0.00009095839,0.00055958075,0.000031986427,0.0000034188104],"category_scores_gemma":[0.000013098215,0.00008947385,0.000043634187,0.00018331107,0.000055368317,0.00012199482,0.0002021479,0.00014343525,0.0000013347399],"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.00009240693,0.00008618272,0.013171628,0.000010079363,0.00013103175,0.000010559735,0.0022962878,0.13406332,0.00019160082,0.002666976,0.00050269876,0.84677726],"study_design_scores_gemma":[0.0007410528,0.00066286296,0.026555767,0.00043721384,0.0000091266475,0.00010989251,0.000051695293,0.9572979,0.01304689,0.00025006995,0.0006867768,0.00015072663],"about_ca_topic_score_codex":0.000023844601,"about_ca_topic_score_gemma":0.0000012891899,"teacher_disagreement_score":0.8466265,"about_ca_system_score_codex":0.000060154332,"about_ca_system_score_gemma":0.000051049898,"threshold_uncertainty_score":0.36486375},"labels":[],"label_agreement":null},{"id":"W321534596","doi":"10.1504/ijhpcn.2006.013481","title":"Adaptive time/space sharing with SCOJO","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":8,"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 Windsor","funders":"","keywords":"Computer science; Computer multitasking; Distributed computing; Scheduling (production processes); Job scheduler; Flexibility (engineering); Shared resource; Time-sharing; Fragmentation (computing); Response time; Load sharing; Job shop scheduling; Parallel computing; Mathematical optimization; Operating system","score_opus":0.008127605547879013,"score_gpt":0.21660941623298005,"score_spread":0.20848181068510105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W321534596","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.62739974,0.00047150473,0.36984846,0.00021120158,0.0010984025,0.00003372697,4.457898e-7,0.000048089056,0.0008884222],"genre_scores_gemma":[0.9831446,0.00003161008,0.014744638,0.000053168682,0.0019295203,2.6878718e-7,0.0000020238022,0.000009029259,0.00008515733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864167,0.000033279906,0.00040981648,0.00021151826,0.00046117403,0.00024252644],"domain_scores_gemma":[0.9988478,0.000107980384,0.0005195137,0.00012475022,0.00034350375,0.000056476958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005477399,0.00014707266,0.0002222534,0.00015531624,0.00016393173,0.00034892553,0.0008413055,0.000038745042,0.0000015892531],"category_scores_gemma":[0.0000032286994,0.000118167845,0.000043965603,0.00019977787,0.00003945486,0.00040841484,0.00024281339,0.00023274,0.0000050941844],"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.00020942916,0.00012665168,0.09122217,0.00002983573,0.00032799254,0.0003100253,0.0006916944,0.6865752,0.00014234628,0.012424293,0.0018622071,0.20607817],"study_design_scores_gemma":[0.0007665666,0.00024190129,0.019963926,0.0009767787,0.000009924291,0.0011538528,0.000010065887,0.9735839,0.0000993858,0.0004927884,0.0024963804,0.00020453647],"about_ca_topic_score_codex":0.000044028024,"about_ca_topic_score_gemma":0.0000016900605,"teacher_disagreement_score":0.35574484,"about_ca_system_score_codex":0.000057078338,"about_ca_system_score_gemma":0.000046395002,"threshold_uncertainty_score":0.4818745},"labels":[],"label_agreement":null},{"id":"W4231214464","doi":"10.1504/ijhpcn.2019.097047","title":"Efficient implementation of OpenACC cache directive on NVIDIA GPUs","year":2018,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Parallel Computing and Optimization Techniques","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":"University of Victoria","funders":"","keywords":"Computer science; CUDA; Parallel computing; Cache; Compiler; Smart Cache; Cache algorithms; Operating system; Cache pollution; CPU cache","score_opus":0.01486184162275694,"score_gpt":0.3065057005190688,"score_spread":0.29164385889631184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231214464","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.7066374,0.00012526075,0.29126096,0.00015089707,0.0013976147,0.00004244601,4.3446133e-7,0.00002951951,0.00035547136],"genre_scores_gemma":[0.9707931,0.0001089403,0.028103942,0.0001337936,0.00084676844,4.0283075e-7,7.867632e-7,0.000005793418,0.0000064305254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988013,0.000061471044,0.00045330529,0.00015523013,0.00037875344,0.00014993767],"domain_scores_gemma":[0.9985469,0.0001328506,0.00060824153,0.000106300366,0.0005622064,0.00004351321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006941775,0.00010306245,0.00017192325,0.00022883149,0.00013638058,0.00009095839,0.00055958075,0.000031986427,0.0000034188104],"category_scores_gemma":[0.000013098215,0.00008947385,0.000043634187,0.00018331107,0.000055368317,0.00012199482,0.0002021479,0.00014343525,0.0000013347399],"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.00009240693,0.00008618272,0.013171628,0.000010079363,0.00013103175,0.000010559735,0.0022962878,0.13406332,0.00019160082,0.002666976,0.00050269876,0.84677726],"study_design_scores_gemma":[0.0007410528,0.00066286296,0.026555767,0.00043721384,0.0000091266475,0.00010989251,0.000051695293,0.9572979,0.01304689,0.00025006995,0.0006867768,0.00015072663],"about_ca_topic_score_codex":0.000023844601,"about_ca_topic_score_gemma":0.0000012891899,"teacher_disagreement_score":0.8466265,"about_ca_system_score_codex":0.000060154332,"about_ca_system_score_gemma":0.000051049898,"threshold_uncertainty_score":0.36486375},"labels":[],"label_agreement":null},{"id":"W4253159728","doi":"10.1504/ijhpcn.2017.084246","title":"pvFPGA: paravirtualising an FPGA-based hardware accelerator towards general purpose computing","year":2017,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":2,"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 Ottawa","funders":"","keywords":"Computer science; Field-programmable gate array; Pipeline (software); Embedded system; Hardware acceleration; FPGA prototype; Direct memory access; Context (archaeology); Computer hardware; Operating system; Transfer (computing)","score_opus":0.03970748224866133,"score_gpt":0.3243428409415965,"score_spread":0.28463535869293516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253159728","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.6294427,0.00029200836,0.36690897,0.00026932394,0.0028118629,0.00006801562,8.9746214e-7,0.000091578884,0.00011464894],"genre_scores_gemma":[0.91744256,0.00008888865,0.07855761,0.0003191211,0.0035549428,7.835158e-7,0.000002637574,0.000021520522,0.000011905219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974877,0.00015420704,0.00084525615,0.0003608417,0.0007686173,0.0003833334],"domain_scores_gemma":[0.9969933,0.00010781419,0.0015287838,0.000503375,0.0006972327,0.00016946839],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017686404,0.00025881015,0.00041204537,0.00027440145,0.0008506185,0.001972372,0.00271642,0.00010561041,0.0000020080686],"category_scores_gemma":[0.00004468355,0.00023822016,0.000105877,0.00009218474,0.00009850053,0.0016607599,0.00057639234,0.00046973262,0.0000015081832],"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.000060496062,0.00007401754,0.021859324,0.000031969852,0.00010443317,0.00022307296,0.0007853371,0.012317147,0.0007745889,0.0012741013,0.0002603555,0.96223515],"study_design_scores_gemma":[0.0009505798,0.00031893366,0.023341432,0.0012875295,0.000014455855,0.00060878816,0.00002175976,0.9631339,0.008033859,0.00038469955,0.0015320363,0.0003720816],"about_ca_topic_score_codex":0.00006773765,"about_ca_topic_score_gemma":0.000003540787,"teacher_disagreement_score":0.9618631,"about_ca_system_score_codex":0.00013287249,"about_ca_system_score_gemma":0.00017356506,"threshold_uncertainty_score":0.9990637},"labels":[],"label_agreement":null}]}