{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"А О Литвинова","is_ca":false},{"name":"Christian Engelmann","is_ca":false},{"name":"Stephen L. Scott","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001948051,0.0009701982,0.0007253689,0.0007206721,0.001371834,0.002417593,0.003605871,0.001501354,0.001937705],"category_scores_gemma":[0.001976399,0.0004443998,0.001217685,0.0005805289,0.001447858,0.002108072,0.00195812,0.002184472,0.000705766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001279743,"about_ca_system_score_gemma":0.002952912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006682661,"about_ca_topic_score_gemma":0.008445419,"domain_scores_codex":[0.9987422,0.0002227801,0.00006535969,0.0001619082,0.0006770066,0.0001308681],"domain_scores_gemma":[0.9990386,0.0002200054,0.00008960157,0.0002360883,0.0002750894,0.0001406325],"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.0002038574,0.0002715043,0.001159586,0.0004682502,0.0001689726,0.000479595,0.0006325392,0.313239,0.01763061,0.4366211,0.02105022,0.2080748],"study_design_scores_gemma":[0.00005461387,0.000154099,0.0003990208,0.00006533289,0.0001050603,0.000294865,0.00008290258,0.833335,0.009277878,0.09583966,0.06030406,0.00008751133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00262784,0.0005972307,0.9902733,0.0004302395,0.0001217989,0.00009938029,0.00005486349,0.003486848,0.002308412],"genre_scores_gemma":[0.1603992,0.0008377753,0.8303807,0.0003772582,0.0002121853,0.0003693981,0.0002830673,0.0004086156,0.006731704],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006682661,"threshold_uncertainty_score":0.01328754,"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","authors":[{"name":"C. Hirai","is_ca":false},{"name":"Kenichi Soga","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007394549,0.0007646853,0.0004215355,0.0004136661,0.0006373479,0.001193485,0.002308936,0.001141087,0.01016317],"category_scores_gemma":[0.001823138,0.0003922577,0.0004702409,0.0003922487,0.001305921,0.001749104,0.00085993,0.0009917119,0.0006808479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001498671,"about_ca_system_score_gemma":0.00149434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006713224,"about_ca_topic_score_gemma":0.005177307,"domain_scores_codex":[0.9994133,0.0001507548,0.00003804103,0.0001579752,0.0001696754,0.00007037055],"domain_scores_gemma":[0.9988613,0.0005983025,0.00009390083,0.0002007701,0.000176428,0.00006917761],"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.0002334225,0.0001801474,0.0006437233,0.0001186176,0.00001865871,0.0002618802,0.0001359703,0.9297226,0.009856126,0.04836704,0.0009734649,0.009488225],"study_design_scores_gemma":[0.00005438069,0.0001049226,0.0001125131,0.000007046696,0.000009505498,0.00002103953,0.00001911784,0.9911924,0.002637881,0.004163358,0.00166907,0.000008824404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1348537,0.0001518776,0.8352628,0.001033902,0.0001258848,0.0006556693,0.001044794,0.003262257,0.02360912],"genre_scores_gemma":[0.8312144,0.0002012057,0.1571594,0.00009412308,0.00002748314,0.0009963647,0.000485503,0.0001322443,0.009689358],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01016317,"threshold_uncertainty_score":0.03399915,"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","authors":[{"name":"Kazuhiko Ohno","is_ca":false},{"name":"Dai Michiura","is_ca":false},{"name":"Masaki Matsumoto","is_ca":false},{"name":"Takahiro Sasaki","is_ca":false},{"name":"Toshio Kondo","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003360014,0.0005549314,0.0009668146,0.0004383528,0.0008941832,0.001330932,0.002518368,0.0009188859,0.005043126],"category_scores_gemma":[0.001031947,0.0004415719,0.0008867465,0.001206192,0.000541302,0.0012848,0.001573622,0.001999232,0.002474442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000504775,"about_ca_system_score_gemma":0.001476272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006157376,"about_ca_topic_score_gemma":0.00546725,"domain_scores_codex":[0.9996612,0.00008446119,0.00001780752,0.00005357744,0.0001343167,0.00004871364],"domain_scores_gemma":[0.9997581,0.00004574711,0.00001361254,0.00006331086,0.00008268838,0.00003660596],"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.0002930408,0.000266375,0.001390844,0.0004615088,0.0002495879,0.0005171508,0.0004770072,0.3855821,0.01508229,0.3186444,0.05301492,0.2240208],"study_design_scores_gemma":[0.00006540673,0.00006349076,0.0001740225,0.00003165582,0.00003139836,0.0001320407,0.00002901006,0.915156,0.00300935,0.03813047,0.04314172,0.00003538754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006721701,0.0004298614,0.9775953,0.0002815241,0.0001697822,0.0001223377,0.0002243447,0.004366338,0.01008889],"genre_scores_gemma":[0.1090395,0.0008158508,0.8740029,0.0002540832,0.0001206445,0.0007518931,0.000905616,0.001852871,0.01225674],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006157376,"threshold_uncertainty_score":0.01687092,"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","authors":[{"name":"Supada Laosooksathit","is_ca":false},{"name":"C. Leangsuksun","is_ca":false},{"name":"Abdelkader Baggag","is_ca":false},{"name":"Charles F. Chandler","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001480506,0.0006996061,0.0006543162,0.0004485561,0.0006759008,0.001146129,0.001800784,0.0008492963,0.004482891],"category_scores_gemma":[0.008186021,0.0003341215,0.0002936073,0.0009821067,0.001376986,0.003021247,0.001535827,0.001845258,0.0006679224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005516456,"about_ca_system_score_gemma":0.001099836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001778969,"about_ca_topic_score_gemma":0.001448165,"domain_scores_codex":[0.9988307,0.0004002774,0.00003475411,0.0001279733,0.0004551119,0.0001511788],"domain_scores_gemma":[0.9968027,0.001285551,0.0001358189,0.001151337,0.0004689867,0.0001555811],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.008557761,0.001994775,0.008777489,0.0007312971,0.0003464664,0.0003871671,0.0009796051,0.2508703,0.1163402,0.1731492,0.04461449,0.3932512],"study_design_scores_gemma":[0.0003728116,0.0007018129,0.0007896382,0.0000339397,0.00006241972,0.00007350501,0.0001584855,0.7890685,0.1272815,0.07356885,0.007843792,0.00004483362],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4980036,0.001347685,0.4643185,0.002554891,0.001009144,0.000253495,0.0009629723,0.01226888,0.01928087],"genre_scores_gemma":[0.8535646,0.0004520436,0.138632,0.000539546,0.0001477894,0.0001916542,0.0005492418,0.0009061691,0.005017002],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004482891,"threshold_uncertainty_score":0.01499677,"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","authors":[{"name":"Philippe Stellwag","is_ca":false},{"name":"Jakob Krainz","is_ca":false},{"name":"Wolfgang Schröder‐Preikschat","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001141144,0.0004875052,0.0005161114,0.0008357135,0.0009410434,0.001513096,0.003483716,0.0007574366,0.0046484],"category_scores_gemma":[0.002309369,0.0004569882,0.0004970147,0.0008983322,0.0009501259,0.001914794,0.001869826,0.001006497,0.001969281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008189237,"about_ca_system_score_gemma":0.002430528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002920468,"about_ca_topic_score_gemma":0.004119199,"domain_scores_codex":[0.9992983,0.00009390232,0.00009424441,0.0001671965,0.0002226503,0.0001236407],"domain_scores_gemma":[0.998613,0.000187475,0.0001116621,0.0005385145,0.0004105134,0.0001388766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001517949,0.0004551114,0.00496933,0.000708071,0.0001591747,0.0004290844,0.001173699,0.04197043,0.1827524,0.2133545,0.02698172,0.5255286],"study_design_scores_gemma":[0.0007056689,0.0008605622,0.001429489,0.0001157018,0.000262998,0.0009818879,0.0002359639,0.6176804,0.1470836,0.06675783,0.1636621,0.0002239107],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0217352,0.000280764,0.9661651,0.0002880005,0.0002094361,0.000234842,0.0001529385,0.006822353,0.004111336],"genre_scores_gemma":[0.2118521,0.0001924334,0.7747242,0.0003621864,0.00008903457,0.0004188379,0.0002960026,0.0007858719,0.01127934],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0046484,"threshold_uncertainty_score":0.01555043,"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","authors":[{"name":"Baisravan HomChaudhuri","is_ca":false},{"name":"Manish Kumar","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003658861,0.001486017,0.002248554,0.00113456,0.0009570929,0.002725786,0.004470918,0.003059116,0.007743638],"category_scores_gemma":[0.006249398,0.00081786,0.001789452,0.001966717,0.001601335,0.003398089,0.002829898,0.002381229,0.0005612634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00169227,"about_ca_system_score_gemma":0.001621809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002488864,"about_ca_topic_score_gemma":0.003075828,"domain_scores_codex":[0.9986283,0.0005624742,0.00006170008,0.0001945742,0.0003706283,0.0001824863],"domain_scores_gemma":[0.9973518,0.001920725,0.0001601622,0.0001532371,0.0002851989,0.0001289277],"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.0001000799,0.0001679392,0.0002394167,0.0002276665,0.0001197127,0.0001045054,0.0001094045,0.6224495,0.0006336357,0.3426301,0.004063766,0.02915421],"study_design_scores_gemma":[0.00003955387,0.00002354648,0.0000667822,0.00001061818,0.00001801549,0.00002235392,0.00001767769,0.9384092,0.000100189,0.06028381,0.0009996846,0.000008514958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006988123,0.0006956336,0.98115,0.0006847645,0.0001070159,0.0000990784,0.0000579575,0.00008069003,0.01013665],"genre_scores_gemma":[0.5928339,0.002255067,0.3724229,0.0005946872,0.0007670493,0.001041386,0.0002758228,0.0003080502,0.02950108],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007743638,"threshold_uncertainty_score":0.02590501,"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","authors":[{"name":"Moumita Chakraborty","is_ca":false},{"name":"Sarbani Roy","is_ca":false},{"name":"Nilanjan Mukherjee","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006171968,0.0005544738,0.0009810855,0.0006099644,0.002256495,0.0006622978,0.001712067,0.0004906555,0.003132594],"category_scores_gemma":[0.001571343,0.0005340119,0.0007650684,0.001194589,0.0005307412,0.0008079573,0.001556566,0.0008824811,0.0009461418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006263852,"about_ca_system_score_gemma":0.001317687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006875128,"about_ca_topic_score_gemma":0.01440123,"domain_scores_codex":[0.999516,0.0001286042,0.0000321052,0.00008868996,0.000121233,0.0001134209],"domain_scores_gemma":[0.9990215,0.0002588448,0.00007972826,0.000322841,0.0001919474,0.000125143],"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.001410912,0.0004850222,0.003726347,0.0002978689,0.0001955189,0.0005096838,0.0009403271,0.7368634,0.05405702,0.03315803,0.01179019,0.1565657],"study_design_scores_gemma":[0.00008176173,0.0001283037,0.001224273,0.000007280349,0.00004486715,0.00008916323,0.000172189,0.9663776,0.0102415,0.01615865,0.005452252,0.00002216958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1670531,0.0002162445,0.8262071,0.000241339,0.00009815577,0.0001628805,0.0001280433,0.001337579,0.004555624],"genre_scores_gemma":[0.5672496,0.0001437502,0.4249583,0.00007488828,0.00004670586,0.000229884,0.0005388826,0.000422103,0.006335879],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006875128,"threshold_uncertainty_score":0.01367021,"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","authors":[{"name":"Aleš Prokeš","is_ca":false},{"name":"Otakar Wilfert","is_ca":false},{"name":"Milan Sigmund","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006626062,0.0004321676,0.0004241711,0.0004589654,0.0008047819,0.0006023604,0.0003250579,0.0006900803,0.002333537],"category_scores_gemma":[0.00434872,0.000272641,0.000296144,0.0005472591,0.0007187202,0.000891816,0.000389768,0.0006361899,0.0002490468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005149642,"about_ca_system_score_gemma":0.000513514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005005746,"about_ca_topic_score_gemma":0.003513408,"domain_scores_codex":[0.9992292,0.0001395158,0.00002422873,0.00008700963,0.0001579598,0.0003621441],"domain_scores_gemma":[0.9913645,0.006771858,0.0003772825,0.0002199165,0.001011624,0.0002548715],"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.01354708,0.0008850336,0.08202545,0.0007892986,0.0003754757,0.003035601,0.0006639788,0.5295885,0.3267482,0.004492553,0.003764123,0.03408462],"study_design_scores_gemma":[0.0001766748,0.001093217,0.1028446,0.00008120668,0.0003725773,0.0006334886,0.0005445726,0.6903369,0.2017747,0.0009866231,0.0009346448,0.0002208821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9923379,0.0004893638,0.004688786,0.0001625302,0.0001046861,0.000009054766,0.0002167843,0.0001818725,0.001808994],"genre_scores_gemma":[0.9993733,0.0001154162,0.0001906672,0.00002168572,0.00001054672,0.000001819736,0.00005792627,0.00001547513,0.0002131254],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005005746,"threshold_uncertainty_score":0.009953201,"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","authors":[{"name":"Nimish Shah","is_ca":false},{"name":"R. Iranmanesh","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001964128,0.0008246023,0.001491132,0.001127708,0.000865416,0.001575937,0.002821939,0.001778031,0.007878045],"category_scores_gemma":[0.01165373,0.0007057422,0.001052501,0.001261353,0.001404909,0.004860973,0.002023322,0.001719572,0.001683978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008069167,"about_ca_system_score_gemma":0.002503057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003964883,"about_ca_topic_score_gemma":0.005992915,"domain_scores_codex":[0.9980755,0.0005417669,0.0001301681,0.0005064189,0.0004479813,0.0002982256],"domain_scores_gemma":[0.9963547,0.001730038,0.0002045654,0.001127795,0.0004768047,0.0001061728],"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.0007326109,0.0002187503,0.002117642,0.0003125789,0.0001364377,0.00007634694,0.0002256813,0.1002277,0.008054541,0.06434811,0.01117369,0.8123759],"study_design_scores_gemma":[0.0001675687,0.0001313123,0.0006609448,0.00005833282,0.00008478436,0.0001600816,0.0001525241,0.7948532,0.00939113,0.1864553,0.00782878,0.00005605957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01669259,0.0002332041,0.9770525,0.0004604245,0.00005078597,0.00004789869,0.0001082441,0.003027364,0.00232707],"genre_scores_gemma":[0.1471528,0.0001372406,0.848783,0.0002252415,0.00003872718,0.0001096747,0.0003282656,0.0008189664,0.002406134],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007878045,"threshold_uncertainty_score":0.02635467,"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)","authors":[{"name":"Alexandre Guerre","is_ca":false},{"name":"Nicolas Ventroux","is_ca":false},{"name":"Raphaël David","is_ca":false},{"name":"A. Mérigot","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007610933,0.0005932378,0.0006601372,0.0004281519,0.0006295876,0.0007681037,0.001119573,0.0005602901,0.003528468],"category_scores_gemma":[0.003433469,0.0003274216,0.0003066243,0.0006475763,0.0004397696,0.000950331,0.0007917834,0.0009049351,0.0004896592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007231671,"about_ca_system_score_gemma":0.001559782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004525926,"about_ca_topic_score_gemma":0.01081018,"domain_scores_codex":[0.999772,0.00006777942,0.0000146431,0.00003511036,0.00007280087,0.0000376413],"domain_scores_gemma":[0.9990162,0.0005862305,0.00008747659,0.00009135708,0.0001564304,0.00006216367],"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.0001692192,0.00007907119,0.0003980766,0.00009090776,0.00002065882,0.00002874251,0.00007715006,0.9007294,0.003323814,0.01404674,0.002342555,0.07869364],"study_design_scores_gemma":[0.00001658537,0.00001358761,0.00004894588,0.000001647458,0.000002709034,0.000003626284,0.000008051257,0.9951498,0.0002778566,0.004198834,0.0002764183,0.000002073204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04989044,0.0004564015,0.9448183,0.0002737266,0.0001021174,0.00007291546,0.00005395541,0.0004241604,0.003907999],"genre_scores_gemma":[0.4977235,0.0003077401,0.4957212,0.0001435751,0.00008821698,0.0001855788,0.0001579131,0.0002392509,0.005433045],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004525926,"threshold_uncertainty_score":0.01180393,"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","authors":[{"name":"Ahmed I. Saleh","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009204251,0.0004362207,0.0007035278,0.000413977,0.001193895,0.001026778,0.00174242,0.0005384748,0.003013919],"category_scores_gemma":[0.002444745,0.0002937081,0.0003885516,0.0005968824,0.0004811537,0.000989149,0.001136966,0.001021981,0.0005958558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007259996,"about_ca_system_score_gemma":0.002277107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003344728,"about_ca_topic_score_gemma":0.004354978,"domain_scores_codex":[0.999458,0.0001728108,0.00002814048,0.00006195544,0.0001612641,0.0001178277],"domain_scores_gemma":[0.9990196,0.0002364754,0.00005341239,0.0002507624,0.000303371,0.0001364477],"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.001687541,0.0004360566,0.003687886,0.0003474137,0.0002456035,0.0004270271,0.0003239822,0.6978232,0.0446913,0.07371126,0.0239418,0.1526769],"study_design_scores_gemma":[0.00005778431,0.0000649386,0.000239122,0.000003062059,0.00001751739,0.00003419767,0.00002054633,0.9839442,0.004586322,0.009046494,0.001976264,0.000009593245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09485946,0.0006124038,0.893991,0.0005457247,0.0005270842,0.0001653352,0.0001298593,0.003273919,0.005895154],"genre_scores_gemma":[0.8239583,0.0002067927,0.1710201,0.0001785736,0.0001596356,0.0001234711,0.0002601741,0.000270563,0.003822507],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003344728,"threshold_uncertainty_score":0.01008254,"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","authors":[{"name":"Somen De","is_ca":false},{"name":"Amit Datta","is_ca":false},{"name":"Asit Baran Bhattacharya","is_ca":false},{"name":"Mallika De","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005337269,0.0005616947,0.0006334184,0.0009171139,0.0006367426,0.0007900309,0.001203662,0.0008141866,0.004431047],"category_scores_gemma":[0.001482715,0.0002659386,0.0005861784,0.0009516576,0.0005083139,0.001869645,0.001012578,0.0007915704,0.001488944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006879518,"about_ca_system_score_gemma":0.0008530514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003094698,"about_ca_topic_score_gemma":0.003096195,"domain_scores_codex":[0.9995515,0.00008051452,0.0000260202,0.00007930119,0.0002040689,0.00005854038],"domain_scores_gemma":[0.9995896,0.0001698446,0.00003036543,0.00006837598,0.0001242912,0.00001745455],"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.0004072076,0.00009554771,0.001118371,0.0002627363,0.000084625,0.0003529482,0.0002504545,0.3364222,0.01975174,0.05531137,0.006708781,0.579234],"study_design_scores_gemma":[0.00003307101,0.0000345658,0.00009895284,0.00000806317,0.00000685694,0.0001014005,0.000033552,0.9832205,0.00402984,0.009382599,0.003042993,0.000007616189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004170141,0.0001139059,0.9942939,0.00008400618,0.00004403198,0.00002401642,0.00002189671,0.000402388,0.0008457353],"genre_scores_gemma":[0.1067482,0.0002619066,0.8890731,0.00005296032,0.00006970831,0.0001674945,0.0001935513,0.0001261311,0.003306925],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004431047,"threshold_uncertainty_score":0.01482332,"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","authors":[{"name":"Toktam Ghafarian","is_ca":false},{"name":"Hossein Deldari","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007055054,0.0003350472,0.0004446238,0.0005449301,0.0003349121,0.0004965104,0.0004921363,0.000381025,0.0005770354],"category_scores_gemma":[0.003282186,0.0001967443,0.0002366147,0.0007789521,0.000264473,0.0006401745,0.0004073047,0.00037524,0.0001718687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007726037,"about_ca_system_score_gemma":0.0007486009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03271765,"about_ca_topic_score_gemma":0.01505359,"domain_scores_codex":[0.9995585,0.0001003303,0.00002722657,0.0001187117,0.0001271987,0.0000681579],"domain_scores_gemma":[0.9984329,0.0007560145,0.0001646988,0.0001853508,0.0003378096,0.0001232171],"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.0006485139,0.0001224903,0.05378362,0.00004620472,0.00004494286,0.0002912857,0.000150996,0.8752536,0.006144801,0.001360204,0.001258297,0.06089509],"study_design_scores_gemma":[0.00000422101,0.000018363,0.004429016,0.000001232936,0.000004169213,0.00001504801,0.00002091127,0.9935737,0.001363984,0.0004416946,0.0001229106,0.000004630972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9245554,0.0001294873,0.07190374,0.0001352704,0.00002212656,0.00002460467,0.0002414856,0.001015297,0.00197263],"genre_scores_gemma":[0.9919985,0.00003535433,0.007441251,0.000006686738,0.000002584072,0.000008159531,0.0001345717,0.00001355163,0.0003593794],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03271765,"threshold_uncertainty_score":0.06505442,"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","authors":[{"name":"Takashi Harada","is_ca":false},{"name":"Masafumi Yamashita","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00198344,0.0008132352,0.0009349403,0.001173632,0.001764245,0.00135672,0.001985044,0.000981349,0.005981048],"category_scores_gemma":[0.006294899,0.0006152499,0.001109824,0.0009099693,0.001581799,0.001567613,0.005166488,0.0016994,0.001109472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001204082,"about_ca_system_score_gemma":0.001281435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002107813,"about_ca_topic_score_gemma":0.004064851,"domain_scores_codex":[0.9987902,0.0004024389,0.00006589151,0.0002137103,0.0003106521,0.0002172162],"domain_scores_gemma":[0.9963472,0.001395991,0.0003115124,0.0007156275,0.000566834,0.0006628165],"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.000664352,0.0003774772,0.003350721,0.0002127986,0.00007945079,0.0003352393,0.0008351728,0.09188961,0.01943417,0.7631584,0.007816652,0.111846],"study_design_scores_gemma":[0.0000961668,0.0002346979,0.0005713276,0.00004492331,0.00004522115,0.0001348078,0.0002131342,0.6210365,0.009924985,0.3545657,0.01309,0.00004253461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06838174,0.00008057036,0.9201005,0.0001653554,0.00007633954,0.000151089,0.00006734268,0.0005020663,0.0104751],"genre_scores_gemma":[0.4756781,0.0001263496,0.5033303,0.00029081,0.00006640184,0.0003663643,0.0003466337,0.0003939508,0.01940115],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005981048,"threshold_uncertainty_score":0.02000862,"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","authors":[{"name":"Teofilo F. Gonzalez","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001630463,0.001165872,0.001878957,0.001480153,0.001506778,0.002262847,0.003672706,0.002462802,0.006967018],"category_scores_gemma":[0.008753208,0.0008475609,0.00129085,0.003528634,0.000913408,0.004774257,0.00323966,0.002600866,0.001458608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002315421,"about_ca_system_score_gemma":0.001648222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004789002,"about_ca_topic_score_gemma":0.007471689,"domain_scores_codex":[0.9987056,0.0003922205,0.0000676702,0.000230081,0.0003467952,0.0002576514],"domain_scores_gemma":[0.9961495,0.002189582,0.0002272478,0.0008419359,0.0003608851,0.000230798],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001011129,0.0003720434,0.002206963,0.0005593703,0.0001382742,0.0001383674,0.0004104583,0.6863518,0.003821132,0.09728877,0.02485664,0.1828449],"study_design_scores_gemma":[0.00004687402,0.00003649488,0.0001326099,0.00001249353,0.00001285286,0.00004352844,0.00005093759,0.9457624,0.0005494889,0.05198561,0.001361013,0.000005802747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06927115,0.001214556,0.9159271,0.001543863,0.0002093373,0.0001921397,0.0007123345,0.001626425,0.009303055],"genre_scores_gemma":[0.3680326,0.0007836243,0.6218795,0.0003284472,0.0002366309,0.0003186992,0.001835245,0.0004163884,0.006168764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006967018,"threshold_uncertainty_score":0.02330697,"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","authors":[{"name":"Roman Trobec","is_ca":false},{"name":"Marjan Šterk","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001781091,0.0007566481,0.0008726843,0.00064588,0.0008095603,0.0009208872,0.001450898,0.0009156693,0.002348619],"category_scores_gemma":[0.008741317,0.0003389596,0.0007365232,0.0007760536,0.00187345,0.001923842,0.001678822,0.002220911,0.0005327965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005949547,"about_ca_system_score_gemma":0.000789539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002799988,"about_ca_topic_score_gemma":0.002165956,"domain_scores_codex":[0.9990312,0.0003956697,0.00004931931,0.00007091727,0.0003879746,0.00006488642],"domain_scores_gemma":[0.9976912,0.001423273,0.0001056302,0.0002981912,0.0003958076,0.00008603456],"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.0006812654,0.0001896558,0.0008051019,0.0004120231,0.0001091301,0.0001856148,0.0003594869,0.3971595,0.01664994,0.3582078,0.01416048,0.2110801],"study_design_scores_gemma":[0.00004989725,0.00003816884,0.0001088874,0.00001301548,0.00001304819,0.0000225641,0.00001486944,0.9249333,0.002259698,0.06707085,0.005466166,0.000009576088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01530255,0.001198442,0.9749268,0.0008237876,0.0004656276,0.00005532442,0.00003034137,0.0003216649,0.006875531],"genre_scores_gemma":[0.3504086,0.002950724,0.6249209,0.0007153634,0.0006412158,0.0003064996,0.0002477753,0.0008798343,0.01892916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002799988,"threshold_uncertainty_score":0.009419441,"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","authors":[{"name":"K. Tanaka","is_ca":false},{"name":"S. Iwanami","is_ca":false},{"name":"Tadashi Ohashi","is_ca":false},{"name":"T. Yamakawa","is_ca":false},{"name":"C. Fukunaga","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001022053,0.0005128024,0.0003716433,0.0006938213,0.0005642333,0.0009639574,0.001450344,0.0008229234,0.003578826],"category_scores_gemma":[0.001726162,0.0003381814,0.0004020291,0.0005112952,0.0004401015,0.001522959,0.001119517,0.001132637,0.001672158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001054198,"about_ca_system_score_gemma":0.003128765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002494513,"about_ca_topic_score_gemma":0.003299156,"domain_scores_codex":[0.9992611,0.0001223476,0.00003681938,0.00009418671,0.0003941357,0.00009141208],"domain_scores_gemma":[0.9987974,0.0001051383,0.00003427046,0.0001340515,0.0007918928,0.0001371609],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002643222,0.0004123734,0.002796929,0.001028017,0.0001274691,0.0003811651,0.0003925987,0.0696338,0.108544,0.2078111,0.03280247,0.5758057],"study_design_scores_gemma":[0.0001046234,0.001288468,0.002057235,0.0003433221,0.0001580049,0.0006135515,0.0001707499,0.2247674,0.1105676,0.02535269,0.6344751,0.0001012803],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04489461,0.004388325,0.8907402,0.002154296,0.001440246,0.0007552964,0.0002381372,0.002725133,0.05266371],"genre_scores_gemma":[0.1367653,0.004084809,0.835358,0.0005660257,0.0002041947,0.0005547322,0.0006165011,0.0003210517,0.02152943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003578826,"threshold_uncertainty_score":0.01197231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}