{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":17,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":17,"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":"69ae6be6d940","filters":{"venue":"Parallel and Distributed Computing and Networks"}},"results":[{"id":"W2332854854","doi":"10.2316/p.2010.676-024","title":"A Proactive Fault Tolerance Framework for High-Performance Computing","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Oak Ridge National Laboratory; UT-Battelle; Battelle; Advanced Scientific Computing Research; U.S. Department of Energy","keywords":"Computer science; Fault tolerance; Distributed computing; Software fault tolerance","retraction":null,"screen_n_in":null,"score":{"opus":0.01066412900163553,"gpt":0.2445597651064829,"spread":0.2338956361048474,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007215222,0.0004432928,0.0005620768,0.00007196546,0.001001198,0.0005950683,0.0006841382,0.0003303125,0.000001419917],"category_scores_gemma":[0.0001062391,0.0004108737,0.00008128429,0.0004642304,0.0001613877,0.0002577361,0.0004428079,0.0008100568,0.000003205554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000192753,"about_ca_system_score_gemma":0.00004888036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003532126,"about_ca_topic_score_gemma":0.000003326102,"domain_scores_codex":[0.9972702,0.00008876851,0.0005627336,0.0009544438,0.0002353036,0.0008885196],"domain_scores_gemma":[0.9977854,0.000859888,0.0003303981,0.0005219943,0.0001990194,0.0003032734],"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.0001798508,0.0002488748,0.01245172,0.0002656202,0.0002189651,0.00001767559,0.001298064,0.4719961,0.00008599427,0.2881135,0.001650033,0.2234737],"study_design_scores_gemma":[0.001000596,0.0001693156,0.01679434,0.000179202,0.0000210241,0.00009329116,0.00003724106,0.9741933,0.00002917731,0.005365695,0.001569223,0.0005476465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.332213,0.0003723451,0.6654634,0.0002482191,0.0009137989,0.0003674054,0.00002420969,0.0003214447,0.00007609992],"genre_scores_gemma":[0.8892601,0.0000429051,0.1095945,0.0002048246,0.0007319748,0.00001916254,0.0001083897,0.00002126137,0.00001692272],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.557047,"threshold_uncertainty_score":0.9998343,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W126718644","doi":"10.2316/p.2010.676-050","title":"An Experimental Model of Relay Deployment Planning Tool for a Wireless Sensor Network System to Monitor Civil Engineering Structures","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Software deployment; Default gateway; Wireless sensor network; Computer science; Relay; Reliability (semiconductor); Wireless; Key distribution in wireless sensor networks; Wireless network; Computer network; Distributed computing; Real-time computing; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.009502822532146127,"gpt":0.2383923022812917,"spread":0.2288894797491455,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003294457,0.0003242499,0.0004250956,0.00006402987,0.0003476359,0.0002020844,0.0004002211,0.000196468,2.53314e-7],"category_scores_gemma":[0.00001159498,0.0003105615,0.00006702245,0.0002337183,0.00004595218,0.0001191908,0.0002585907,0.0002953317,1.126667e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002754167,"about_ca_system_score_gemma":0.00001508609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001233184,"about_ca_topic_score_gemma":0.000002691181,"domain_scores_codex":[0.9980397,0.00004692755,0.000444427,0.0006255311,0.0002022136,0.0006412604],"domain_scores_gemma":[0.998784,0.0002560368,0.0001713517,0.000414794,0.00008330291,0.0002904932],"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.0000594089,0.0000374287,0.0006898016,0.0000376027,0.00002892386,0.000004699103,0.0002928729,0.9842431,0.001864352,0.01104902,0.0001439106,0.001548863],"study_design_scores_gemma":[0.0005766411,0.0001463809,0.0006570861,0.000156357,0.00001593551,0.00002949953,0.00008235118,0.9975065,0.0004133342,0.0000219294,0.00002858224,0.0003653762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4658169,0.000264471,0.5331986,0.00001661622,0.0003413257,0.0001822549,0.000008631851,0.0001671355,0.00000401751],"genre_scores_gemma":[0.8663031,0.000005125085,0.1331451,0.00004431323,0.0004186709,0.00002389168,0.00003101036,0.00002632614,0.00000241128],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4004862,"threshold_uncertainty_score":0.9999347,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2331476467","doi":"10.2316/journal.211.2013.3.211-1053","title":"A GPGPU PROGRAMMING FRAMEWORK BASED ON A SHARED-MEMORY MODEL","year":2013,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Japan Society for the Promotion of Science","keywords":"Computer science; General-purpose computing on graphics processing units; Parallel computing; Programming paradigm; Shared memory; CUDA; Computer architecture; Programming language; Computer graphics (images); Graphics","retraction":null,"screen_n_in":null,"score":{"opus":0.01196231576734502,"gpt":0.2428184954972875,"spread":0.2308561797299425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003061979,0.0003082787,0.000309287,0.00009956618,0.000502856,0.0007008709,0.0004355535,0.0002044158,0.000004615524],"category_scores_gemma":[0.00006256646,0.0002783451,0.00006860102,0.0003900481,0.00008602597,0.0001996148,0.0003209843,0.0004179248,0.000005873511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002299281,"about_ca_system_score_gemma":0.00003385486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002911074,"about_ca_topic_score_gemma":4.405824e-7,"domain_scores_codex":[0.9981285,0.00009261072,0.0003381409,0.0006652254,0.0002108649,0.0005646961],"domain_scores_gemma":[0.9986972,0.0003325282,0.0001523661,0.0004399877,0.0001079763,0.0002699464],"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.000009529984,0.00007280015,0.0004987508,0.00001569666,0.00001082082,0.000004115781,0.0001255596,0.9205458,7.874513e-7,0.004668409,0.002201975,0.07184581],"study_design_scores_gemma":[0.0003774815,0.0001148356,0.001093086,0.0001789298,0.000007051566,0.00001051212,0.00001414672,0.9931528,0.000002568515,0.004547216,0.0001558913,0.0003454885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003674595,0.000544205,0.9932184,0.000784816,0.00008614238,0.0003369165,0.000003789448,0.000931937,0.0004191574],"genre_scores_gemma":[0.6522454,0.00003502172,0.346828,0.000734344,0.0000675115,0.000026557,0.00003078435,0.00001152146,0.00002082902],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6485708,"threshold_uncertainty_score":0.9999669,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2327189209","doi":"10.2316/p.2010.676-066","title":"Stream Experiments: Toward Latency Hiding in GPGPU","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science; General-purpose computing on graphics processing units; Latency (audio); Parallel computing; Computer graphics (images); Graphics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01393464008127159,"gpt":0.2579701827529109,"spread":0.2440355426716393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002209738,0.0001723107,0.0002041167,0.00004991011,0.0002121094,0.000233683,0.0003047978,0.0001138378,0.000004310853],"category_scores_gemma":[0.00001682945,0.0001477966,0.00002532192,0.0002081582,0.00004987424,0.0002482898,0.000550048,0.0003447497,0.000001568102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008491398,"about_ca_system_score_gemma":0.0000140203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001027366,"about_ca_topic_score_gemma":0.000006915507,"domain_scores_codex":[0.9988016,0.00003946517,0.0002419706,0.0004396353,0.0001122509,0.0003650649],"domain_scores_gemma":[0.9993795,0.0001026153,0.0000757423,0.0002588065,0.00002611677,0.0001572554],"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.00008886149,0.0005529944,0.09674122,0.0000666852,0.00006679758,0.0002007891,0.002594433,0.03421814,0.0008534468,0.05859043,0.004226164,0.8018],"study_design_scores_gemma":[0.0006177013,0.00004009727,0.02176353,0.00005410809,0.000002933345,0.00003081759,0.00005835799,0.9749356,0.00002299364,0.001255702,0.0009985085,0.0002196759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2240607,0.001179647,0.7738616,0.0001804094,0.0003516907,0.00008200549,0.000005995185,0.0001086558,0.0001693367],"genre_scores_gemma":[0.9794577,0.0001674592,0.02009748,0.00007293373,0.0001352121,0.00000403809,0.00005166672,0.000005775161,0.000007768284],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9407175,"threshold_uncertainty_score":0.6026972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1455550877","doi":"10.2316/p.2010.676-052","title":"A Wait-Free Dynamic Storage Allocator by Adopting the Helping Queue Pattern","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science; Allocator; Queue; Operating system; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.004837392620360122,"gpt":0.214605707560737,"spread":0.2097683149403769,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006587763,0.0003058585,0.0003252897,0.00002863644,0.0008046454,0.0006456614,0.0009439855,0.0001746647,0.000002225373],"category_scores_gemma":[0.00005500623,0.0002298859,0.00006733748,0.0002954275,0.0001392733,0.0001898557,0.0006899344,0.0006784143,0.000002753671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001773509,"about_ca_system_score_gemma":0.00002638561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001657333,"about_ca_topic_score_gemma":0.00006573414,"domain_scores_codex":[0.9980263,0.0001086487,0.0004056908,0.0006176276,0.0002217358,0.0006200031],"domain_scores_gemma":[0.998498,0.0002633077,0.0002153856,0.0007190534,0.00007508085,0.0002291603],"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.00006387165,0.0003602849,0.01785162,0.0002457813,0.0003419218,0.0001405985,0.002400604,0.08351307,0.0008692216,0.01921313,0.05396853,0.8210313],"study_design_scores_gemma":[0.0006318312,0.00003628757,0.005317559,0.00008322212,0.00001220049,0.00009591012,0.0000969871,0.984755,0.000002552974,0.0002012195,0.0084378,0.0003293667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1138444,0.002510766,0.8813001,0.001277843,0.0005411459,0.0001859496,0.00006304017,0.0002061103,0.00007065054],"genre_scores_gemma":[0.9970773,0.00009514728,0.00208554,0.0003936104,0.0001881209,0.00001247517,0.0001001471,0.00001482743,0.00003283993],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.901242,"threshold_uncertainty_score":0.9374476,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2316020023","doi":"10.2316/journal.211.2012.1.211-1047","title":"MARKET-BASED DISTRIBUTED OPTIMIZATION APPROACHES FOR THREE CLASSES OF RESOURCE ALLOCATION PROBLEMS","year":2012,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Advanced Research in Systems and Signal Processing","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science; Resource allocation; Resource (disambiguation); Distributed computing; Operations research; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.03251243420129896,"gpt":0.2440339825687248,"spread":0.2115215483674259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004171975,0.0001441027,0.0002112334,0.00003275012,0.0001774299,0.00004669296,0.00006012127,0.0001030699,0.000001501735],"category_scores_gemma":[0.00003908694,0.0001280115,0.00003141012,0.0001581783,0.00006601147,0.00009974822,0.00002810556,0.0001159578,5.194576e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001943423,"about_ca_system_score_gemma":0.000008486148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003343507,"about_ca_topic_score_gemma":0.000001142491,"domain_scores_codex":[0.9991111,0.00003541104,0.0002670436,0.0001482241,0.0000974906,0.0003407207],"domain_scores_gemma":[0.9994004,0.0002545383,0.00008311067,0.00008809022,0.00005514191,0.0001187628],"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.00003596343,0.00002374737,0.002687996,0.0003613681,0.00002600231,9.264451e-8,0.00003101849,0.9818501,0.00001169988,0.0001937007,0.0004164402,0.01436188],"study_design_scores_gemma":[0.0004776086,0.00003353345,0.0015714,0.0001507101,0.00001747021,0.000002757158,0.00006755507,0.9964901,0.00001613492,0.0001012819,0.0009237654,0.0001476541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005505172,0.005492193,0.9883298,0.00003443845,0.00004829239,0.000295407,0.00004457928,0.0001013165,0.0001487452],"genre_scores_gemma":[0.9897227,0.00005233196,0.009514332,0.000004656833,0.0001457088,0.00002622768,0.0005122033,0.00001766215,0.000004183835],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9842175,"threshold_uncertainty_score":0.5220156,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2323848889","doi":"10.2316/p.2010.676-079","title":"Agglomeration of Dependent Tasks for Efficient Scheduling in Grid Environment","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science; Grid; Scheduling (production processes); Economies of agglomeration; Distributed computing; Grid computing; Parallel computing; Mathematical optimization; Chemical engineering; Geology","retraction":null,"screen_n_in":null,"score":{"opus":0.00901608136508937,"gpt":0.2286705307972333,"spread":0.2196544494321439,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007581792,0.0002018429,0.0003218433,0.00007432992,0.0002017776,0.0001343008,0.0002755602,0.0001406923,0.000001113884],"category_scores_gemma":[0.00003697736,0.0001911018,0.00005507833,0.0001759547,0.00006931569,0.00006266135,0.0002270897,0.0002690178,7.804356e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001608511,"about_ca_system_score_gemma":0.00002291203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004007589,"about_ca_topic_score_gemma":0.000008346332,"domain_scores_codex":[0.9984078,0.00006439477,0.0004855167,0.0004832648,0.0001658526,0.0003931579],"domain_scores_gemma":[0.9990584,0.0002787112,0.0002143133,0.0002724483,0.00004573396,0.000130423],"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.00002462116,0.00009649088,0.005213727,0.00004316691,0.00001708645,0.00000329317,0.0002015936,0.974398,0.0002031191,0.008472252,0.00007262001,0.01125408],"study_design_scores_gemma":[0.001011881,0.00007749799,0.01005556,0.000065199,0.000008610957,0.00002442324,0.00003226701,0.987641,0.00003288129,0.0003348158,0.0005039069,0.0002119667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3321705,0.000553737,0.6664184,0.00009623597,0.0004588892,0.0002137786,0.0000196769,0.00004208736,0.00002672193],"genre_scores_gemma":[0.9795605,0.00004273349,0.02000222,0.00002799463,0.0002296081,0.00001216499,0.000112811,0.000007438779,0.000004545301],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.64739,"threshold_uncertainty_score":0.7792906,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2334476329","doi":"10.2316/p.2010.676-062","title":"Effect of Atmospheric Turbulent Channel on Bit-Error-Rate of Optical Wireless Link","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science; Bit error rate; Channel (broadcasting); Bit (key); Link (geometry); Wireless; Optical wireless; Optical link; Computer network; Telecommunications; Optical fiber","retraction":null,"screen_n_in":null,"score":{"opus":0.00624956024363951,"gpt":0.2249653852044506,"spread":0.2187158249608111,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002541203,0.000169822,0.00033927,0.00001416362,0.00006179643,0.00001755765,0.0001681419,0.0002029599,0.000001782224],"category_scores_gemma":[0.00005083497,0.0001405221,0.00004231756,0.0001711641,0.0001983932,0.0000213143,0.0001181943,0.0004507902,7.948522e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005843802,"about_ca_system_score_gemma":0.000003092064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006785139,"about_ca_topic_score_gemma":0.000001299714,"domain_scores_codex":[0.9992583,0.00004008077,0.000266325,0.0001521077,0.00006343004,0.000219746],"domain_scores_gemma":[0.9989753,0.0005771505,0.0000642485,0.0002759258,0.00003335774,0.00007398127],"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.0001611605,0.00008209082,0.0019055,0.0003167573,0.0001161463,0.000004985573,0.00007992913,0.8077295,0.001176139,0.009954478,0.0001739369,0.1782993],"study_design_scores_gemma":[0.0004677954,0.0002565715,0.003843103,0.00009778072,0.00001713035,0.000005160111,0.00001531978,0.9932049,0.001701327,0.0002054041,0.00004376201,0.0001417745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9289415,0.000950754,0.06940119,0.0001508892,0.00009324496,0.0001091523,0.000005283518,0.0002171876,0.0001308405],"genre_scores_gemma":[0.9979572,0.0004763293,0.001472329,0.000008529364,0.00003858572,0.000005655942,0.00002599955,0.00001393517,0.00000143879],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1854753,"threshold_uncertainty_score":0.5730326,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2316535507","doi":"10.2316/p.2010.676-055","title":"Is Iterative Deepening Search a Complete and Optimal Algorithm for Java PathFinder?","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Pathfinder; Computer science; Java; Algorithm; Iterative method; Parallel computing; Operating system; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.02417702476867913,"gpt":0.2810436833405228,"spread":0.2568666585718437,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005132113,0.0002265773,0.0002762622,0.00005788328,0.0006581091,0.0004960364,0.0002379812,0.0001372798,0.000001085319],"category_scores_gemma":[0.0000560124,0.0002068968,0.00004192225,0.0001723503,0.0001437136,0.0001330051,0.0004205121,0.0003872918,4.394646e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006902997,"about_ca_system_score_gemma":0.00002203484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004624312,"about_ca_topic_score_gemma":0.000001881256,"domain_scores_codex":[0.9985558,0.00005330287,0.0002338987,0.0005743551,0.0001249533,0.0004576795],"domain_scores_gemma":[0.9985671,0.0007914157,0.00008493703,0.0002343898,0.0001202846,0.0002018537],"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.00003503551,0.0000723333,0.009849011,0.00005295321,0.00007638052,0.00002858613,0.002291855,0.002494281,0.00005823696,0.004834369,0.005841255,0.9743657],"study_design_scores_gemma":[0.0005855559,0.0001496501,0.00407693,0.00005941346,0.0000107809,0.0001420092,0.00001875419,0.9891248,0.00001404884,0.005192135,0.0003580936,0.0002678256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04993993,0.0005913546,0.9477091,0.0002962685,0.0001168218,0.0002043341,0.00003336759,0.001088131,0.00002072314],"genre_scores_gemma":[0.5734983,0.00002417791,0.4261276,0.0001889072,0.000105162,0.000009232112,0.00003228191,0.000007986165,0.000006310936],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9866305,"threshold_uncertainty_score":0.8437006,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2320450249","doi":"10.2316/p.2010.676-037","title":"Low-Complex Task Scheduling Algorithms for Hierarchical Embedded Many-Core Architectures and Dynamic Applications","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science; Parallel computing; Processor scheduling; Dynamic priority scheduling; Many core; Scheduling (production processes); Distributed computing; Multi-core processor; Fair-share scheduling; Task (project management); Algorithm; Computer network; Mathematical optimization; Resource (disambiguation)","retraction":null,"screen_n_in":null,"score":{"opus":0.01415919459102929,"gpt":0.2812737539031707,"spread":0.2671145593121414,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003682824,0.000283482,0.0003257248,0.0000987507,0.0007894644,0.0003485487,0.0003850958,0.0001858655,9.866123e-7],"category_scores_gemma":[0.00004277186,0.0002630692,0.00006094234,0.0002555415,0.0002154836,0.00006503156,0.0003979916,0.0004945494,4.569823e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008769684,"about_ca_system_score_gemma":0.00002644638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007634304,"about_ca_topic_score_gemma":0.000004305914,"domain_scores_codex":[0.9982827,0.00004744781,0.0003518092,0.0007074583,0.000126945,0.0004836],"domain_scores_gemma":[0.9987271,0.0004236235,0.0001488611,0.0003477508,0.00009145032,0.0002611448],"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.00007363057,0.0001994268,0.001290864,0.0001617478,0.0001010095,0.000008057174,0.0006251482,0.3938214,0.0006573056,0.05681634,0.0006092904,0.5456358],"study_design_scores_gemma":[0.0006013003,0.00006921264,0.003265689,0.00003592694,0.0000145069,0.00007753453,0.00001446621,0.9819328,0.0000115011,0.01299983,0.0006544339,0.0003227855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04338349,0.0005721395,0.9544961,0.0004280384,0.0001002557,0.0004516088,0.0000244659,0.0004982049,0.00004562752],"genre_scores_gemma":[0.6239935,0.00007399805,0.3754853,0.0001528577,0.0001261604,0.00003532456,0.0001129177,0.00001132321,0.000008674465],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5881114,"threshold_uncertainty_score":0.9999822,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2326867708","doi":"10.2316/journal.211.2011.1.211-1009","title":"HIGH THROUGHPUT – SYSTEM-ORIENTED SCHEDULER FOR AVOIDING HASTE PROBLEM IN COMPUTATIONAL GRIDS","year":2011,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science; Throughput; Distributed computing; Parallel computing; Operating system; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.0131905867208862,"gpt":0.2081030909296765,"spread":0.1949125042087903,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001604861,0.0001596499,0.0002040438,0.00004251137,0.0001875507,0.00003224134,0.00004390647,0.00009079582,0.000001018518],"category_scores_gemma":[0.00001231493,0.0001574734,0.00002121261,0.00009946885,0.00003833154,0.00006272111,0.00003537117,0.0001680583,3.934959e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000318434,"about_ca_system_score_gemma":0.000004836504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002158253,"about_ca_topic_score_gemma":0.000002785615,"domain_scores_codex":[0.9991873,0.00002262103,0.0002515491,0.0002151059,0.00005276511,0.0002706403],"domain_scores_gemma":[0.999651,0.0001285877,0.00005057756,0.00006548951,0.00003812657,0.0000662352],"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.00002959137,0.00001402734,0.0006034055,0.0001111736,0.00002057756,0.000002119109,0.0001516083,0.9785109,5.470577e-7,0.01917605,0.00006935537,0.001310684],"study_design_scores_gemma":[0.0008483663,0.00003453269,0.002516921,0.0001265652,0.00001480593,0.000009506351,0.0001403582,0.9932696,0.000006979639,0.00278842,0.000058608,0.000185359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02977557,0.000507248,0.9689115,0.00001090356,0.0001965584,0.0001998385,0.00002616909,0.0002372477,0.0001349771],"genre_scores_gemma":[0.8603111,0.00004422347,0.1392527,0.000008717836,0.00007953943,0.00001387417,0.0002709123,0.00001547988,0.00000344556],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8305355,"threshold_uncertainty_score":0.6421581,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2326709443","doi":"10.2316/journal.211.2014.4.211-1012","title":"FAST PARALLEL ALGORITHM FOR DISCRETE FOURIER TRANSFORM IN MULTI-MESH NETWORK","year":2014,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Advanced Algorithms and Applications","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"University of Kalyani; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Computer science; Discrete Fourier transform (general); Algorithm; Fourier transform; Parallel computing; Fast Fourier transform; Computational science; Fourier analysis; Short-time Fourier transform; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.008951030432034537,"gpt":0.237610531212899,"spread":0.2286595007808645,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001867964,0.0002303952,0.0003080847,0.00002504733,0.0002301145,0.00005852022,0.00008623453,0.0001230322,0.000001459846],"category_scores_gemma":[0.000005657178,0.0002182827,0.00005402753,0.0001626276,0.00005732464,0.00006471285,0.00003176101,0.0002161913,6.639969e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000153014,"about_ca_system_score_gemma":0.000003745235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000112501,"about_ca_topic_score_gemma":0.00002343629,"domain_scores_codex":[0.9988273,0.00001677233,0.000296989,0.0002881944,0.0000590265,0.0005116991],"domain_scores_gemma":[0.9994946,0.000166666,0.00003892731,0.0001303895,0.00002081705,0.0001486101],"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.000006115838,0.00001221249,0.0002743105,0.00001507247,0.00001552905,5.467871e-7,0.00003808034,0.6878484,6.038051e-7,0.000671042,0.0002999337,0.3108181],"study_design_scores_gemma":[0.001392464,0.00003495114,0.002519638,0.00005296072,0.00001670778,0.000006013754,0.00004218006,0.9869109,7.712588e-7,0.001766684,0.006968221,0.0002884957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001796411,0.001417204,0.9959123,0.00009298892,0.0001176227,0.000339491,0.00005554292,0.0001705787,0.00009785459],"genre_scores_gemma":[0.7170922,0.0006864176,0.2811489,0.00006662838,0.0004607743,0.00009363037,0.0003769132,0.00003796366,0.00003650052],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7152958,"threshold_uncertainty_score":0.8901312,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111977021","doi":"10.2316/p.2010.676-039","title":"Task Execution Availability Prediction in the Enterprise Desktop Grid","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science; Distributed computing; Grid; Grid computing; Bayesian network; Task (project management); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.007695744150670312,"gpt":0.2224664986846411,"spread":0.2147707545339708,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001489712,0.0002463757,0.0002647441,0.00005788103,0.0004364601,0.0004499731,0.0005647778,0.000178425,0.000002639795],"category_scores_gemma":[0.00006820748,0.0001865198,0.00006039949,0.0004498635,0.0001340068,0.0001973282,0.0002684249,0.0006504665,0.000004811575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001791452,"about_ca_system_score_gemma":0.00002698048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001064158,"about_ca_topic_score_gemma":0.00002902173,"domain_scores_codex":[0.9979495,0.0002760467,0.0004685992,0.00060176,0.0002237895,0.0004803044],"domain_scores_gemma":[0.9988248,0.0003110711,0.0001562402,0.0005034076,0.00006408521,0.0001403917],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002589858,0.001051807,0.5862787,0.0002206544,0.00013142,0.0001326447,0.006154748,0.1994186,0.0002707544,0.04163298,0.03444349,0.1300052],"study_design_scores_gemma":[0.0005873077,0.00007979872,0.155264,0.0000470651,0.000009516373,0.0001416904,0.00007241983,0.8377471,0.000001119227,0.00103724,0.004810021,0.0002026842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3225861,0.0004591766,0.6751459,0.0003755273,0.0007637667,0.0002205482,0.00002658444,0.0001554487,0.0002669515],"genre_scores_gemma":[0.9977467,0.00004673051,0.001460596,0.0001618115,0.0003900735,0.00001211973,0.000164805,0.000006077763,0.00001109931],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6751605,"threshold_uncertainty_score":0.7606058,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2319792364","doi":"10.2316/p.2010.676-054","title":"Constructing Non-Dominated <em>m</em>-Group Coteries for Group Mutual Exclusion","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Group (periodic table); Mutual exclusion; Computer science; Physics; Mathematics; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.008023754977007557,"gpt":0.2282313920283012,"spread":0.2202076370512936,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009322646,0.0005050887,0.0007038831,0.00008534094,0.001135783,0.0008671766,0.000604206,0.0003778412,0.00000506148],"category_scores_gemma":[0.00006673186,0.0004641304,0.0001396451,0.0004689743,0.0002492993,0.0003745564,0.0006477597,0.0005278066,0.00000342381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000325631,"about_ca_system_score_gemma":0.0000347113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002744032,"about_ca_topic_score_gemma":0.0001264278,"domain_scores_codex":[0.9969183,0.0001019751,0.0007388643,0.0009946513,0.0003060839,0.0009401324],"domain_scores_gemma":[0.9979992,0.0004835789,0.0004055339,0.0005106842,0.0002207534,0.0003802491],"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.0007548152,0.0005586398,0.01005123,0.0005195321,0.0003671566,0.0001541947,0.002930404,0.008670057,0.006295787,0.1922081,0.01713026,0.7603598],"study_design_scores_gemma":[0.002728304,0.0002302314,0.005306326,0.000230195,0.00003425806,0.0002472124,0.000336007,0.9763285,0.00002630654,0.0008586351,0.01297218,0.0007018303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2852876,0.000864076,0.7116942,0.0001144263,0.001159393,0.0003937405,0.0001286013,0.0002166622,0.000141301],"genre_scores_gemma":[0.9733056,0.00007626999,0.02524683,0.0001194125,0.000559982,0.00003284118,0.0005950108,0.00002620244,0.00003778365],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9676585,"threshold_uncertainty_score":0.999781,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2328826103","doi":"10.2316/journal.211.2012.1.211-1056","title":"APPROXIMATION ALGORITHMS FOR SP-MULTICAST TREES IN 2D GRIDS1","year":2012,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Multicast; Computer science; Protocol Independent Multicast; Algorithm; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01964743289847732,"gpt":0.2591272715088043,"spread":0.239479838610327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005927866,0.000165881,0.0002122587,0.00005931545,0.0002360352,0.0001315557,0.0001751718,0.0000918271,7.176467e-7],"category_scores_gemma":[0.00002527149,0.0001466643,0.0000431218,0.0002488181,0.00006170095,0.0002654096,0.000142063,0.0001414211,9.241062e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000105981,"about_ca_system_score_gemma":0.000006227357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000087415,"about_ca_topic_score_gemma":0.000001640626,"domain_scores_codex":[0.9988267,0.00007267828,0.0002399732,0.0002935783,0.00008126372,0.0004858096],"domain_scores_gemma":[0.9992962,0.0002810075,0.00007895034,0.0001557671,0.00003048076,0.0001575509],"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.0001015214,0.0004896495,0.03401022,0.00007748226,0.00006926255,0.000007607108,0.002452574,0.09385393,0.00004365431,0.1823576,0.0005787169,0.6859577],"study_design_scores_gemma":[0.0008216468,0.00004961191,0.03504132,0.00003621389,0.000008059695,0.00002178038,0.00008529424,0.9582262,0.000008486313,0.005256353,0.0002469186,0.0001980943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06758527,0.001583349,0.9301059,0.0001416513,0.0002499785,0.0001908319,0.00001041266,0.00008683449,0.0000457995],"genre_scores_gemma":[0.9578514,0.00005812932,0.04169135,0.00007020936,0.0002346173,0.00001484949,0.00006505593,0.000006158417,0.000008217389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8902661,"threshold_uncertainty_score":0.5980796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2334768140","doi":"10.2316/p.2010.676-042","title":"On the Parallelization of Meshless Methods for the Solution of the Diffusion Equation","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Numerical methods in engineering","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science; Diffusion; Computational science; Diffusion equation; Parallel computing; Mathematical optimization; Mathematics; Thermodynamics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01859003992244724,"gpt":0.2847812047903561,"spread":0.2661911648679088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006956635,0.00009683749,0.0001340813,0.00001256513,0.0001715011,0.00001547284,0.00012148,0.00007453756,0.000001352044],"category_scores_gemma":[0.000260624,0.0000499311,0.00004401011,0.0001498193,0.00007934799,0.00001700169,0.00005444127,0.0002035028,3.208845e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005546281,"about_ca_system_score_gemma":0.000003266509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007460838,"about_ca_topic_score_gemma":0.000001335699,"domain_scores_codex":[0.9994208,0.00008562519,0.0002027317,0.00009261513,0.00006652572,0.0001317426],"domain_scores_gemma":[0.997578,0.00211455,0.00007886811,0.0001694342,0.00003715881,0.00002196593],"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.00001249246,0.000008028328,0.0001630292,0.0000279302,0.00002078255,1.112778e-8,0.00007746177,0.9044319,0.002168817,0.01006035,0.00007967804,0.08294946],"study_design_scores_gemma":[0.0001670241,0.00001765994,0.004601703,0.00003755242,0.00002639745,0.000001078944,0.00002559643,0.991217,0.0004273654,0.003219551,0.0001984045,0.00006068214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06181988,0.0005751859,0.9367473,0.0001576206,0.0004188789,0.0002169603,0.000004860885,0.00003325498,0.00002602507],"genre_scores_gemma":[0.9660562,0.0001132918,0.03371073,0.00001655257,0.00007232746,0.0000115668,0.00000811168,0.000009438594,0.000001820552],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9042363,"threshold_uncertainty_score":0.2036131,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2318920610","doi":"10.2316/p.2010.676-028","title":"Development of a Network on Chip for Parallel Processing Systems","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science; System on a chip; Computer architecture; Parallel computing; Parallel processing; Chip; Embedded system; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01733670780103963,"gpt":0.2481187648224218,"spread":0.2307820570213822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007647131,0.0002259183,0.0003795901,0.00004426139,0.0005773568,0.0002602788,0.0002671505,0.0001640967,5.824983e-7],"category_scores_gemma":[0.00001967842,0.0001888405,0.00005495984,0.0002117519,0.00005541658,0.00009215264,0.0001398548,0.000265371,5.925172e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001088312,"about_ca_system_score_gemma":0.00004419092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008224669,"about_ca_topic_score_gemma":0.00001261295,"domain_scores_codex":[0.9983534,0.00005100094,0.0005377589,0.0004493126,0.0001453978,0.0004631972],"domain_scores_gemma":[0.9989777,0.0002385943,0.0002857719,0.0002266153,0.0001200223,0.0001512686],"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.0001557887,0.0001274909,0.002171739,0.0002611346,0.0001051772,0.000004139444,0.0009362822,0.7669791,0.0000490199,0.1030914,0.003186119,0.1229326],"study_design_scores_gemma":[0.0006381591,0.00008747668,0.001824991,0.0002343058,0.000008203177,0.0000342308,0.00006305135,0.9896735,0.000003393403,0.0003989078,0.006794101,0.0002396952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05312501,0.0009813405,0.9442346,0.00007075567,0.0009440525,0.0003289015,0.000003307468,0.0001100918,0.00020192],"genre_scores_gemma":[0.9530163,0.00001650679,0.04624107,0.00006480868,0.0005637857,0.0000324133,0.00002560529,0.00001110177,0.0000284305],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8998913,"threshold_uncertainty_score":0.7700694,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}