{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":22,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":22,"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":"0cbaf240d14f","filters":{"venue":"International Journal of High Performance Computing and Networking"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01254569396171001,"gpt":0.2259239866208807,"spread":0.2133782926591707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002563864,0.0001458206,0.0002077425,0.0001027058,0.0001538472,0.0001207272,0.0002078891,0.00002757874,0.000003136443],"category_scores_gemma":[0.000005617445,0.0001063907,0.00006112944,0.00005651153,0.0000305455,0.0001498889,0.00005183353,0.0002719938,4.911398e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008035086,"about_ca_system_score_gemma":0.00002164884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003792073,"about_ca_topic_score_gemma":0.000002942535,"domain_scores_codex":[0.9990407,0.000017124,0.0004129336,0.00009492647,0.0002413507,0.0001930226],"domain_scores_gemma":[0.999451,0.0001189001,0.0002364956,0.00006189884,0.00009470874,0.000036946],"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.000007345027,0.000005480188,0.0001190628,0.000009681521,0.0001912242,0.00001819754,0.0000507468,0.9483694,0.00001779044,0.0000435805,0.0001255785,0.05104192],"study_design_scores_gemma":[0.0002625797,0.00002124502,0.0004279447,0.0001600007,0.0001371373,0.0005707428,0.000008791049,0.9960294,0.0001637924,0.001257987,0.0008389003,0.0001214432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1540541,0.002429516,0.8418009,0.00005167508,0.001485846,0.00004403179,0.000003622197,0.00005125114,0.00007908943],"genre_scores_gemma":[0.9281296,0.0004303812,0.06994703,0.00002462864,0.001420534,3.50559e-7,0.000008816479,0.0000198993,0.00001875647],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7740756,"threshold_uncertainty_score":0.4338488,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02553075317867747,"gpt":0.2953977628151206,"spread":0.2698670096364432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006227313,0.0001437708,0.0002834251,0.000198705,0.0001447364,0.00008630046,0.000190492,0.00003433815,0.000004669429],"category_scores_gemma":[0.00005940393,0.000114862,0.00007234066,0.0001644769,0.0000505444,0.0001632991,0.00007482751,0.0002261485,0.000002720487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007803173,"about_ca_system_score_gemma":0.00002549034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005230153,"about_ca_topic_score_gemma":0.00000522929,"domain_scores_codex":[0.9984511,0.00005028229,0.0006776957,0.0001466563,0.0004869478,0.0001873491],"domain_scores_gemma":[0.9986769,0.000257472,0.000521694,0.0000806918,0.0003881713,0.00007508648],"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.0006854746,0.002592193,0.0176784,0.0002532089,0.0006178634,0.00003566016,0.005315448,0.1946038,0.0006996707,0.5317365,0.008461348,0.2373205],"study_design_scores_gemma":[0.0007651194,0.0002129346,0.007277969,0.0006100496,0.00003497676,0.000327038,0.0002412105,0.9783869,0.0001029609,0.0104046,0.001397094,0.0002391068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7343357,0.00006548016,0.2641763,0.0002914011,0.00035616,0.00008460015,8.517208e-7,0.00002553234,0.0006639092],"genre_scores_gemma":[0.7213241,0.00002888336,0.2776273,0.000107103,0.0008477223,0.000001926102,0.000002136697,0.00001102296,0.00004981449],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7837831,"threshold_uncertainty_score":0.4683936,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008696791933068668,"gpt":0.2612928837494678,"spread":0.2525960918163991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009246384,0.0002168485,0.0002977285,0.000204299,0.0002265586,0.0003291889,0.001050031,0.0001186767,0.000002831513],"category_scores_gemma":[0.000006810255,0.0001960117,0.0001131263,0.000204454,0.00004564339,0.000491483,0.0003820193,0.0003456153,3.112121e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001288749,"about_ca_system_score_gemma":0.00006907596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007753789,"about_ca_topic_score_gemma":0.000009019705,"domain_scores_codex":[0.997981,0.00006004066,0.0007968034,0.0002976313,0.0004712936,0.0003932709],"domain_scores_gemma":[0.9981467,0.0002957323,0.0008501295,0.0001866614,0.0004420052,0.00007883165],"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.0001259776,0.00008662893,0.003032523,0.00002272848,0.00006696794,0.00003210344,0.00006173157,0.2604121,0.0002165033,0.002182071,0.0006651505,0.7330955],"study_design_scores_gemma":[0.001472776,0.0005128442,0.002581836,0.0008242805,0.00001153219,0.0007700545,0.000006566728,0.918712,0.000797649,0.001241385,0.07276066,0.0003083929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0211268,0.001276544,0.9717099,0.00007255374,0.001780342,0.003865135,4.366161e-7,0.00005061948,0.0001176654],"genre_scores_gemma":[0.9548093,0.0002562285,0.03899953,0.0001290242,0.003460651,0.002280156,0.000002982506,0.00002241624,0.00003972611],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9336825,"threshold_uncertainty_score":0.7993124,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06125931175195404,"gpt":0.3097343786552617,"spread":0.2484750669033077,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00180639,0.000152918,0.00024825,0.0003495841,0.0002500401,0.000135613,0.0007971711,0.00004747249,0.000009597028],"category_scores_gemma":[0.00004138106,0.000140728,0.00005441226,0.0002540704,0.0001248939,0.0006605773,0.0002334246,0.0002270692,0.000002581806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000880719,"about_ca_system_score_gemma":0.0001177128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004690631,"about_ca_topic_score_gemma":3.588352e-7,"domain_scores_codex":[0.9979389,0.0001177773,0.0006651676,0.0002110764,0.0008652516,0.0002017703],"domain_scores_gemma":[0.9972853,0.0001593508,0.0007526261,0.0001869057,0.001551912,0.00006389473],"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.00007179487,0.00006536778,0.01829948,0.00001041016,0.0001065696,0.000002933972,0.000911367,0.4386483,0.00007873903,0.001288522,0.0002716692,0.5402449],"study_design_scores_gemma":[0.0007325653,0.0003845661,0.01577964,0.0007132684,0.00001514341,0.0001121468,0.00001999066,0.9773563,0.004137785,0.0002102431,0.0003895604,0.0001488274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8260785,0.0001477742,0.1699599,0.00012953,0.002504362,0.00007759008,6.176409e-7,0.00004897925,0.001052648],"genre_scores_gemma":[0.9043679,0.0003407368,0.09413649,0.00009686729,0.001040433,0.000001738627,0.000002297387,0.00000890804,0.000004635556],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.540096,"threshold_uncertainty_score":0.5738721,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008127605547879013,"gpt":0.2166094162329801,"spread":0.208481810685101,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005477399,0.0001470727,0.0002222534,0.0001553162,0.0001639317,0.0003489255,0.0008413055,0.00003874504,0.000001589253],"category_scores_gemma":[0.000003228699,0.0001181678,0.0000439656,0.0001997779,0.00003945486,0.0004084148,0.0002428134,0.00023274,0.000005094184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005707834,"about_ca_system_score_gemma":0.000046395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004402802,"about_ca_topic_score_gemma":0.00000169006,"domain_scores_codex":[0.9986417,0.00003327991,0.0004098165,0.0002115183,0.000461174,0.0002425264],"domain_scores_gemma":[0.9988478,0.0001079804,0.0005195137,0.0001247502,0.0003435038,0.00005647696],"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.0002094292,0.0001266517,0.09122217,0.00002983573,0.0003279925,0.0003100253,0.0006916944,0.6865752,0.0001423463,0.01242429,0.001862207,0.2060782],"study_design_scores_gemma":[0.0007665666,0.0002419013,0.01996393,0.0009767787,0.000009924291,0.001153853,0.00001006589,0.9735839,0.0000993858,0.0004927884,0.00249638,0.0002045365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6273997,0.0004715047,0.3698485,0.0002112016,0.001098403,0.00003372697,4.457898e-7,0.00004808906,0.0008884222],"genre_scores_gemma":[0.9831446,0.00003161008,0.01474464,0.00005316868,0.00192952,2.687872e-7,0.000002023802,0.000009029259,0.00008515733],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3557448,"threshold_uncertainty_score":0.4818745,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Audit; Computer security; Feature (linguistics); Data mining; Attack model","retraction":null,"screen_n_in":null,"score":{"opus":0.03453044453066623,"gpt":0.3034008261695685,"spread":0.2688703816389023,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009216134,0.0001127182,0.000192072,0.0002249867,0.0001351894,0.0001188144,0.0006362926,0.00008529123,0.000005451513],"category_scores_gemma":[0.00002199595,0.0001039352,0.00006675605,0.000177552,0.00005749789,0.0004760447,0.0002547084,0.0005770474,6.392543e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000225081,"about_ca_system_score_gemma":0.00004173541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002216701,"about_ca_topic_score_gemma":0.000009491287,"domain_scores_codex":[0.9987671,0.00002633363,0.0005410822,0.0001570963,0.0003417451,0.0001666247],"domain_scores_gemma":[0.9985976,0.0001055079,0.0006840993,0.0001258952,0.0004265917,0.00006028693],"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.00009891416,0.0002666327,0.029363,0.00003702958,0.0001066713,0.00003689506,0.00104014,0.008723479,0.04921999,0.001069854,0.00009472134,0.9099427],"study_design_scores_gemma":[0.001199679,0.0002937877,0.02678528,0.0008953378,0.00001533168,0.001680152,0.00002372703,0.9390281,0.02654489,0.0001311229,0.003134496,0.000268118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6051158,0.00007455186,0.3918357,0.00007149927,0.002811569,0.0000374392,5.396346e-7,0.00001831171,0.00003448129],"genre_scores_gemma":[0.8814951,0.000160136,0.1173408,0.00006031021,0.0009240703,5.528971e-7,6.192747e-7,0.000006963386,0.00001147553],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9303046,"threshold_uncertainty_score":0.4238356,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03691834865257854,"gpt":0.230033555095796,"spread":0.1931152064432174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004065952,0.00007591925,0.0001573534,0.0001442743,0.0001123372,0.00004743025,0.0001824657,0.00003495328,0.000004189245],"category_scores_gemma":[0.000008724722,0.00007053945,0.00002711728,0.0001063301,0.00003856819,0.0001922498,0.0000384788,0.0001248242,0.000005963182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003697459,"about_ca_system_score_gemma":0.00001339928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008371405,"about_ca_topic_score_gemma":0.000003329002,"domain_scores_codex":[0.999257,0.000003183143,0.0004270024,0.0001223424,0.00007763469,0.0001128453],"domain_scores_gemma":[0.9990823,0.00002971352,0.000636611,0.00005563159,0.0001603298,0.00003539413],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0004854202,0.0001579355,0.1908935,0.00003350963,0.0002357583,0.00001607085,0.004884873,0.003955744,0.00001952593,0.561417,0.0000555643,0.2378451],"study_design_scores_gemma":[0.001643345,0.0006873722,0.7100934,0.0005290849,0.00003201468,0.000371101,0.0001634446,0.07429359,0.00008455983,0.2070483,0.004664944,0.0003888785],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7101571,0.0005459788,0.2865554,0.00007846137,0.000796425,0.00003392815,0.000002469102,0.00001031209,0.001819864],"genre_scores_gemma":[0.989959,0.0006299954,0.007792119,0.00004949645,0.001547369,0.00000141902,0.000002969087,0.000008448927,0.000009187444],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5191998,"threshold_uncertainty_score":0.2876515,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0422950986400276,"gpt":0.2618850722666185,"spread":0.2195899736265909,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008883728,0.0001792345,0.0003067243,0.0002216286,0.0002038095,0.0002095895,0.0008989574,0.00006205603,0.000002735057],"category_scores_gemma":[0.00001995965,0.000149657,0.00005430222,0.0001640715,0.00004067668,0.0007348758,0.0003648499,0.0002821304,0.000006260945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001099572,"about_ca_system_score_gemma":0.00006536229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000109242,"about_ca_topic_score_gemma":6.49229e-7,"domain_scores_codex":[0.9980599,0.00006849843,0.0006903571,0.000268335,0.0005884224,0.0003245215],"domain_scores_gemma":[0.9985233,0.0001898098,0.000390354,0.0001820022,0.0005472298,0.0001672831],"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.0002785354,0.0001549226,0.1062209,0.0001263523,0.0003324117,0.000206945,0.01034732,0.1713637,0.00003725093,0.004603803,0.0007968295,0.705531],"study_design_scores_gemma":[0.0005952042,0.0003303582,0.03950341,0.0007892017,0.00001477949,0.0006428412,0.0001778035,0.9554172,0.0001417447,0.001474916,0.0006108872,0.0003016982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.454536,0.0002663142,0.5422682,0.00002895431,0.002751607,0.00005714246,0.000001306357,0.00004303056,0.00004745611],"genre_scores_gemma":[0.9379307,0.0001175657,0.06060906,0.0001081996,0.001208887,0.000001858718,0.000001089279,0.00001217019,0.00001043959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7840534,"threshold_uncertainty_score":0.6102834,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01449026102868657,"gpt":0.2480292480325546,"spread":0.233538987003868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007892972,0.0001703911,0.000204076,0.0002178938,0.0002256249,0.0002875701,0.0009374783,0.00003763964,0.000001380799],"category_scores_gemma":[0.000009671747,0.0001222021,0.0000472479,0.0001445319,0.00006195335,0.0001202344,0.0009408491,0.0001702173,0.000002123256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007662331,"about_ca_system_score_gemma":0.00001748323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003900569,"about_ca_topic_score_gemma":1.961022e-7,"domain_scores_codex":[0.9983625,0.00005831619,0.000456351,0.0002936072,0.0005350109,0.0002942413],"domain_scores_gemma":[0.998955,0.0001815662,0.0004013017,0.0002158416,0.0001385645,0.0001077943],"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.00006812974,0.00004256413,0.03748003,0.00004163792,0.0001759818,0.0001377954,0.000200953,0.007946439,0.00006850922,0.001429947,0.0006438753,0.9517641],"study_design_scores_gemma":[0.005828814,0.0004116242,0.06465638,0.008782764,0.0000635645,0.0007112729,0.0001680331,0.7863595,0.001199713,0.0004087627,0.1305826,0.0008269129],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8959705,0.0008570469,0.09860387,0.001877173,0.002274983,0.00006798358,4.541579e-7,0.00005502464,0.0002929185],"genre_scores_gemma":[0.9744537,0.0005558741,0.02289689,0.000156186,0.001836792,4.771823e-7,4.364011e-7,0.00001114883,0.00008846205],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9509372,"threshold_uncertainty_score":0.4983256,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009274216943470406,"gpt":0.2574695263585593,"spread":0.2481953094150889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006363309,0.0001785978,0.000274386,0.0002460704,0.0002301915,0.0002858026,0.000790085,0.00005759754,0.000002988417],"category_scores_gemma":[0.00001065506,0.0001664501,0.0001059418,0.0001640545,0.00005501483,0.0005590365,0.0001951281,0.0001694823,0.000002603414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005624732,"about_ca_system_score_gemma":0.00006325168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002034887,"about_ca_topic_score_gemma":6.264889e-7,"domain_scores_codex":[0.9984494,0.00004708535,0.0006130756,0.0002326327,0.0003755073,0.0002822652],"domain_scores_gemma":[0.9985427,0.0002022599,0.0005894246,0.0001385518,0.000464965,0.00006210901],"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.000751591,0.0003009773,0.01274177,0.00007386773,0.0003516869,0.0001920819,0.0006177413,0.6738321,0.001743914,0.02683954,0.02342222,0.2591325],"study_design_scores_gemma":[0.001243533,0.0002878081,0.002904482,0.0003195088,0.00001384949,0.0007926403,0.000003121183,0.9872196,0.0004609587,0.004026367,0.002492316,0.0002357974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4443451,0.0002233926,0.5525613,0.0003097222,0.001715957,0.00008624403,0.000001346897,0.0001148357,0.0006420986],"genre_scores_gemma":[0.8323559,0.0002554423,0.166065,0.00009627452,0.00104654,0.000001370979,0.000006382683,0.00001210651,0.0001609861],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3880107,"threshold_uncertainty_score":0.6787639,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01739200277958856,"gpt":0.2529183118943525,"spread":0.235526309114764,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001836461,0.0001153456,0.0001876567,0.0001046564,0.0001975186,0.0001249614,0.0007717306,0.00005440875,0.000003203566],"category_scores_gemma":[0.00001243488,0.00008234842,0.00008821094,0.0002048038,0.00005054594,0.0003865788,0.0002015055,0.0002388148,8.168163e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009735435,"about_ca_system_score_gemma":0.00007626451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003840775,"about_ca_topic_score_gemma":0.000005449929,"domain_scores_codex":[0.9980312,0.0001255349,0.0006641691,0.0001422052,0.0008634669,0.000173432],"domain_scores_gemma":[0.9980085,0.0001096697,0.0008215475,0.0001587705,0.0008736223,0.00002790651],"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.00002579919,0.00002423131,0.04306426,0.00001462676,0.00005889988,0.000002093689,0.0003103496,0.4002216,0.00004547242,0.0004449605,0.0004277412,0.5553599],"study_design_scores_gemma":[0.0005577308,0.00007385603,0.06694045,0.0006448338,0.00001585858,0.0002593546,0.0000143355,0.9300678,0.0002669716,0.000136108,0.000935971,0.00008666932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9771906,0.0006848407,0.01358725,0.0005013468,0.00738593,0.00007410144,2.919689e-7,0.00001382841,0.0005618819],"genre_scores_gemma":[0.9961612,0.0001440854,0.0007474804,0.00008958044,0.002817303,7.776673e-7,7.968128e-7,0.000006578655,0.00003224656],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5552732,"threshold_uncertainty_score":0.3358071,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01663277146289238,"gpt":0.2880028915173296,"spread":0.2713701200544372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007934095,0.0001400505,0.0001841225,0.0002141439,0.0001906768,0.0002581608,0.0007086503,0.00003269718,0.000005743555],"category_scores_gemma":[0.000003679957,0.0001342183,0.00006075464,0.0001727648,0.00001994517,0.0006607305,0.0003772807,0.0001855187,0.000002805921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003625309,"about_ca_system_score_gemma":0.00005243995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002092292,"about_ca_topic_score_gemma":0.000003892062,"domain_scores_codex":[0.9983187,0.00006749398,0.0005924203,0.0001993676,0.0005670899,0.0002549634],"domain_scores_gemma":[0.9988184,0.00006870663,0.0006473311,0.0001382675,0.0002489485,0.0000783353],"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.0000237416,0.00003035596,0.01817415,0.00003580048,0.0001497989,0.00005636794,0.0005765174,0.229231,0.00001515992,0.0009281769,0.0005717197,0.7502072],"study_design_scores_gemma":[0.0007548137,0.00007089066,0.004469622,0.0004580822,0.00001915532,0.0003492187,0.00007312049,0.9891387,0.0001582495,0.00005584436,0.004306719,0.0001456196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6616629,0.000336193,0.33577,0.0001283049,0.001960676,0.00006490586,4.810698e-7,0.00004313673,0.00003339451],"genre_scores_gemma":[0.9616989,0.0001627611,0.03545059,0.0002561354,0.002415798,7.988519e-7,0.00000218284,0.000009510067,0.000003307087],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7599076,"threshold_uncertainty_score":0.5473262,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.03970748224866133,"gpt":0.3243428409415965,"spread":0.2846353586929352,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00176864,0.0002588101,0.0004120454,0.0002744014,0.0008506185,0.001972372,0.00271642,0.0001056104,0.000002008069],"category_scores_gemma":[0.00004468355,0.0002382202,0.000105877,0.00009218474,0.00009850053,0.00166076,0.0005763923,0.0004697326,0.000001508183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001328725,"about_ca_system_score_gemma":0.0001735651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006773765,"about_ca_topic_score_gemma":0.000003540787,"domain_scores_codex":[0.9974877,0.000154207,0.0008452561,0.0003608417,0.0007686173,0.0003833334],"domain_scores_gemma":[0.9969933,0.0001078142,0.001528784,0.000503375,0.0006972327,0.0001694684],"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.00006049606,0.00007401754,0.02185932,0.00003196985,0.0001044332,0.000223073,0.0007853371,0.01231715,0.0007745889,0.001274101,0.0002603555,0.9622352],"study_design_scores_gemma":[0.0009505798,0.0003189337,0.02334143,0.001287529,0.00001445586,0.0006087882,0.00002175976,0.9631339,0.008033859,0.0003846996,0.001532036,0.0003720816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6294427,0.0002920084,0.366909,0.0002693239,0.002811863,0.00006801562,8.974621e-7,0.00009157888,0.0001146489],"genre_scores_gemma":[0.9174426,0.00008888865,0.07855761,0.0003191211,0.003554943,7.835158e-7,0.000002637574,0.00002152052,0.00001190522],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9618631,"threshold_uncertainty_score":0.9990637,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01976199835953035,"gpt":0.2508301788918436,"spread":0.2310681805323132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008380619,0.0001180903,0.0002150595,0.000110847,0.0001626945,0.0001592687,0.0006184753,0.00004561812,0.000001005106],"category_scores_gemma":[0.00001189402,0.0001041692,0.00007350533,0.0001197858,0.00002489571,0.0005553906,0.0001425853,0.0001648605,7.277465e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005556178,"about_ca_system_score_gemma":0.00004528581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001020582,"about_ca_topic_score_gemma":7.912481e-7,"domain_scores_codex":[0.9988714,0.00003451397,0.0004350221,0.0001809806,0.000262228,0.0002158652],"domain_scores_gemma":[0.9987649,0.0001451892,0.0004503645,0.0001094329,0.0004626582,0.00006747435],"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.00002319971,0.00007177222,0.004164067,0.00001959711,0.0001061946,0.00001888299,0.001609967,0.000329117,0.00001511254,0.001221139,0.00008670683,0.9923342],"study_design_scores_gemma":[0.0008302776,0.0001905066,0.007547934,0.0003343148,0.00001083594,0.0004737354,0.00003668272,0.9842066,0.000350253,0.0006232268,0.005233225,0.0001623744],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3151107,0.000426125,0.6810264,0.0000519747,0.003135005,0.00005656993,0.000001520462,0.00003641874,0.0001552505],"genre_scores_gemma":[0.8394988,0.00009777262,0.1591869,0.00006234527,0.001141755,0.000001031162,7.945267e-7,0.000006325556,0.000004315901],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9921719,"threshold_uncertainty_score":0.4247896,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.03320092829098779,"gpt":0.3159443608018204,"spread":0.2827434325108326,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001293711,0.0002573278,0.0003779052,0.0002775939,0.001084869,0.001931335,0.002461592,0.00009838554,0.000002458363],"category_scores_gemma":[0.00005130757,0.0002406065,0.0001041699,0.0001077716,0.000104928,0.001316355,0.0006300614,0.0004393962,0.000001327311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009190961,"about_ca_system_score_gemma":0.0001703241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004594905,"about_ca_topic_score_gemma":0.000001924657,"domain_scores_codex":[0.9977335,0.0001193208,0.0007581587,0.0003668087,0.0006470488,0.0003751998],"domain_scores_gemma":[0.9972135,0.00009414852,0.001348996,0.0004513045,0.0007190552,0.0001730039],"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.00005507845,0.00007893518,0.01419409,0.0000160695,0.00007494219,0.00009533857,0.0004612305,0.1501853,0.00009839571,0.0007903374,0.0002268512,0.8337234],"study_design_scores_gemma":[0.0008574692,0.0002147117,0.02114333,0.0005698348,0.0000113541,0.000243451,0.00001051143,0.9728253,0.002136653,0.0002438305,0.001449106,0.0002944454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5159402,0.0002353291,0.4810774,0.0003745682,0.002103554,0.00004625163,7.658282e-7,0.0001012835,0.0001206833],"genre_scores_gemma":[0.8504056,0.0001659729,0.1465868,0.0004220692,0.002382944,4.562203e-7,0.000004453806,0.00001778488,0.00001396553],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8334289,"threshold_uncertainty_score":0.9991047,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02346415298483754,"gpt":0.2765684088121497,"spread":0.2531042558273121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001159483,0.0001957724,0.0003068194,0.000315889,0.0000925251,0.0003083957,0.0006858693,0.00008930475,0.000006322171],"category_scores_gemma":[0.00001413539,0.0001842941,0.00008544432,0.0002386465,0.00002705898,0.0006159546,0.0002535881,0.0004281548,0.000005026082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002765909,"about_ca_system_score_gemma":0.00003752931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000217939,"about_ca_topic_score_gemma":0.00003644222,"domain_scores_codex":[0.9980924,0.00005566932,0.0007482934,0.000265326,0.0004284143,0.0004099181],"domain_scores_gemma":[0.9990226,0.000174206,0.0002905463,0.0001236107,0.0002454802,0.0001435292],"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.0001204334,0.00008087783,0.002443428,0.00001529948,0.0001299728,0.00004733253,0.003226187,0.7471809,0.0001872498,0.001292799,0.0009284432,0.244347],"study_design_scores_gemma":[0.001067116,0.0002025183,0.003871906,0.0006329712,0.000007169204,0.0008126472,0.00005363941,0.9697834,0.00007391804,0.00002238813,0.02325935,0.0002129709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6144162,0.0004314531,0.3796476,0.001008135,0.004181665,0.0000747647,4.940922e-7,0.00003663014,0.000203088],"genre_scores_gemma":[0.9497287,0.0002098698,0.04351764,0.001076936,0.005411803,0.000002434728,0.000001829347,0.00001476997,0.00003601049],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3361299,"threshold_uncertainty_score":0.7515297,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01105582788439223,"gpt":0.2352849991125603,"spread":0.2242291712281681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003698423,0.0001097248,0.0001420933,0.0001030396,0.00008947261,0.00004533125,0.0001191437,0.00003800238,9.995272e-7],"category_scores_gemma":[0.000001127682,0.0001117757,0.00004097539,0.0000774154,0.00001334105,0.0002611317,0.00001146296,0.0001331907,2.359422e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001106422,"about_ca_system_score_gemma":0.00001523793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001056001,"about_ca_topic_score_gemma":8.918533e-7,"domain_scores_codex":[0.9991596,0.00000595424,0.0003396637,0.00008367502,0.0002551313,0.0001559311],"domain_scores_gemma":[0.9995623,0.00003151297,0.000144584,0.00004913093,0.0001863344,0.00002617762],"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.0000142045,0.000007756583,0.004278507,0.00002830048,0.00003175272,5.545114e-7,0.00004427703,0.802931,0.005670473,0.00004524271,0.00001305793,0.1869349],"study_design_scores_gemma":[0.0004584902,0.00002523039,0.03401249,0.0002423979,0.00003238599,0.00003858691,0.000007858577,0.9631336,0.0007020425,0.00003840946,0.001193827,0.0001146657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9474344,0.0003508604,0.05060177,0.00001132707,0.001281248,0.00007900953,0.000001114455,0.00003664021,0.0002036549],"genre_scores_gemma":[0.9951077,0.0001373492,0.00245444,0.000006630157,0.002251236,0.000001620328,0.00001179883,0.00002765497,0.000001537977],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1868202,"threshold_uncertainty_score":0.4558083,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01671953947951334,"gpt":0.278292704617197,"spread":0.2615731651376837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001410618,0.0002008305,0.0003745121,0.0002972583,0.000171396,0.0002304536,0.0007568006,0.00008486543,0.00000304166],"category_scores_gemma":[0.00002123904,0.0001689754,0.000153398,0.0001353233,0.0000546176,0.0005287566,0.0002216855,0.0003057207,0.000001199569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001306598,"about_ca_system_score_gemma":0.00005519196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001534924,"about_ca_topic_score_gemma":0.000004471407,"domain_scores_codex":[0.9977153,0.00008586818,0.001043671,0.0002639246,0.0005840252,0.0003071912],"domain_scores_gemma":[0.9978242,0.0004502356,0.0008550752,0.0001702323,0.0006359136,0.00006435426],"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.0006456924,0.0003501074,0.1024862,0.0002750611,0.0005641368,0.0000324224,0.000775194,0.5594316,0.0003286153,0.01174068,0.008076813,0.3152936],"study_design_scores_gemma":[0.00159286,0.0005746795,0.02263503,0.001309993,0.00001611507,0.0003813641,0.00001823287,0.9708861,0.0003408034,0.0002816949,0.001773995,0.0001891584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6078762,0.00006180698,0.3860312,0.0003892384,0.005256476,0.0001002691,8.22203e-7,0.0000174305,0.000266586],"genre_scores_gemma":[0.9839533,0.00008184552,0.01267712,0.0003568773,0.00284074,0.000003009876,0.000002617911,0.0000157344,0.00006873658],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4114546,"threshold_uncertainty_score":0.6890616,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01486184162275694,"gpt":0.3065057005190688,"spread":0.2916438588963118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006941775,0.0001030624,0.0001719233,0.0002288315,0.0001363806,0.00009095839,0.0005595807,0.00003198643,0.00000341881],"category_scores_gemma":[0.00001309822,0.00008947385,0.00004363419,0.0001833111,0.00005536832,0.0001219948,0.0002021479,0.0001434352,0.00000133474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006015433,"about_ca_system_score_gemma":0.0000510499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000238446,"about_ca_topic_score_gemma":0.00000128919,"domain_scores_codex":[0.9988013,0.00006147104,0.0004533053,0.0001552301,0.0003787534,0.0001499377],"domain_scores_gemma":[0.9985469,0.0001328506,0.0006082415,0.0001063004,0.0005622064,0.00004351321],"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.00009240693,0.00008618272,0.01317163,0.00001007936,0.0001310317,0.00001055973,0.002296288,0.1340633,0.0001916008,0.002666976,0.0005026988,0.8467773],"study_design_scores_gemma":[0.0007410528,0.000662863,0.02655577,0.0004372138,0.000009126647,0.0001098925,0.00005169529,0.9572979,0.01304689,0.0002500699,0.0006867768,0.0001507266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7066374,0.0001252607,0.291261,0.0001508971,0.001397615,0.00004244601,4.344613e-7,0.00002951951,0.0003554714],"genre_scores_gemma":[0.9707931,0.0001089403,0.02810394,0.0001337936,0.0008467684,4.028308e-7,7.867632e-7,0.000005793418,0.000006430525],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8466265,"threshold_uncertainty_score":0.3648638,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0147683961793474,"gpt":0.2491589364692765,"spread":0.2343905402899291,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001307554,0.0002278123,0.0003850165,0.0003282273,0.0001919488,0.0003332285,0.000918643,0.00008557055,3.663337e-7],"category_scores_gemma":[0.00001310099,0.0001915454,0.00006247044,0.0002953275,0.00004078084,0.0005101473,0.0001398536,0.0003448654,8.48505e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00016887,"about_ca_system_score_gemma":0.0001079668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002092423,"about_ca_topic_score_gemma":0.00000421887,"domain_scores_codex":[0.9979887,0.00008564494,0.0007677399,0.0002930542,0.0004877871,0.0003770961],"domain_scores_gemma":[0.9982721,0.0002792849,0.0007523238,0.0001883157,0.0004228204,0.00008521112],"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.0002220692,0.00008943518,0.07557613,0.0001001348,0.00008451911,0.00002347045,0.0001597909,0.8525592,0.0001711818,0.0003396071,0.00004849437,0.07062597],"study_design_scores_gemma":[0.001599743,0.0004533663,0.03593016,0.002388053,0.000009984771,0.0005428733,0.00000710866,0.9555218,0.0007997365,0.000008012676,0.002489156,0.0002500119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5576737,0.0003678998,0.440645,0.0001464001,0.0009590727,0.0001478093,0.000001721945,0.00003474273,0.00002364493],"genre_scores_gemma":[0.9726463,0.00008867057,0.02561692,0.0001305789,0.001479259,0.00000845226,0.000007351971,0.00001640339,0.000006083826],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4150281,"threshold_uncertainty_score":0.7810994,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005598487294784071,"gpt":0.2172723026352232,"spread":0.2116738153404391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036671,0.00008476225,0.0001624195,0.00009531852,0.00004938235,0.00002674121,0.0001596075,0.00003810802,0.000006153555],"category_scores_gemma":[0.000003902259,0.00007725294,0.00004949451,0.0000580441,0.00002877402,0.00008829812,0.00004584558,0.0001719722,4.09896e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003747059,"about_ca_system_score_gemma":0.000009378942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001669095,"about_ca_topic_score_gemma":0.000008369273,"domain_scores_codex":[0.999162,0.00001234537,0.0004133703,0.00006341522,0.0002165121,0.0001323315],"domain_scores_gemma":[0.9995712,0.00006330502,0.0001409749,0.00005055196,0.0001492508,0.00002472438],"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.00003287665,0.00004560021,0.08531282,0.00005404529,0.00008295907,0.00001091215,0.00009893161,0.8355335,0.0003594554,0.0003714457,0.0002833243,0.07781411],"study_design_scores_gemma":[0.0004545999,0.00003049685,0.05874454,0.0002677594,0.00000929407,0.00006450029,0.000006902036,0.9388027,0.0003207015,0.0001537044,0.001067926,0.00007683254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9894839,0.001476681,0.00701273,0.00003644595,0.001530506,0.0000218692,0.000004076546,0.00002155767,0.0004122348],"genre_scores_gemma":[0.9974537,0.000360501,0.001088437,0.00001218509,0.001061374,1.570306e-7,0.000003478289,0.00001029923,0.000009864765],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1032692,"threshold_uncertainty_score":0.3150283,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01486184162275694,"gpt":0.3065057005190688,"spread":0.2916438588963118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006941775,0.0001030624,0.0001719233,0.0002288315,0.0001363806,0.00009095839,0.0005595807,0.00003198643,0.00000341881],"category_scores_gemma":[0.00001309822,0.00008947385,0.00004363419,0.0001833111,0.00005536832,0.0001219948,0.0002021479,0.0001434352,0.00000133474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006015433,"about_ca_system_score_gemma":0.0000510499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000238446,"about_ca_topic_score_gemma":0.00000128919,"domain_scores_codex":[0.9988013,0.00006147104,0.0004533053,0.0001552301,0.0003787534,0.0001499377],"domain_scores_gemma":[0.9985469,0.0001328506,0.0006082415,0.0001063004,0.0005622064,0.00004351321],"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.00009240693,0.00008618272,0.01317163,0.00001007936,0.0001310317,0.00001055973,0.002296288,0.1340633,0.0001916008,0.002666976,0.0005026988,0.8467773],"study_design_scores_gemma":[0.0007410528,0.000662863,0.02655577,0.0004372138,0.000009126647,0.0001098925,0.00005169529,0.9572979,0.01304689,0.0002500699,0.0006867768,0.0001507266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7066374,0.0001252607,0.291261,0.0001508971,0.001397615,0.00004244601,4.344613e-7,0.00002951951,0.0003554714],"genre_scores_gemma":[0.9707931,0.0001089403,0.02810394,0.0001337936,0.0008467684,4.028308e-7,7.867632e-7,0.000005793418,0.000006430525],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8466265,"threshold_uncertainty_score":0.3648638,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}