{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":16,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":16,"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":"cc7a4a629a76","filters":{"venue":"Proceedings of the International Conference on Parallel Processing"}},"results":[{"id":"W2098010876","doi":"10.1109/icpp.2007.21","title":"Automatic Trace-Based Parallelization of Java Programs","year":2007,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Automatic parallelization; Java; TRACE (psycholinguistics); Parallel computing; Suite; Benchmark (surveying); Parallelism (grammar); Programming language; Compiler","authors":[{"name":"Borys J. Bradel","is_ca":true},{"name":"Tarek S. Abdelrahman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.041380483445933,"gpt":0.2954646394018596,"spread":0.2540841559559266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001436818,0.001231992,0.0007155931,0.001069514,0.0005727867,0.001095298,0.002112093,0.0005230697,0.002128895],"category_scores_gemma":[0.007778254,0.0005500664,0.0005315786,0.0007405116,0.0007521255,0.001696607,0.001131255,0.001181927,0.0007493283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006797619,"about_ca_system_score_gemma":0.001823529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004061048,"about_ca_topic_score_gemma":0.003980175,"domain_scores_codex":[0.9980906,0.0004813012,0.0001407917,0.000377653,0.000753957,0.0001557439],"domain_scores_gemma":[0.9945236,0.001886722,0.0004288933,0.001640932,0.001347693,0.0001720463],"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.0009965806,0.0007558304,0.005248914,0.0003665439,0.0001181242,0.0002565506,0.0007024705,0.1225866,0.1329928,0.01025756,0.007749965,0.717968],"study_design_scores_gemma":[0.00009235062,0.0001409162,0.0007563912,0.00001478274,0.00002193264,0.00008153023,0.00006708821,0.8733715,0.1128725,0.008419332,0.004126419,0.00003517477],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04961057,0.00006814481,0.9147135,0.0001225955,0.00003702581,0.0001786354,0.0001416446,0.033724,0.001403832],"genre_scores_gemma":[0.4059158,0.0001096911,0.5879166,0.00009728648,0.00003226934,0.0003052857,0.0009510496,0.002651951,0.002020081],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004061048,"threshold_uncertainty_score":0.00807482,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121207198","doi":"10.1109/icpp.2007.69","title":"RDMA-based and SMP-aware Multi-port All-Gather on Multi-rail QsNet^II SMP Clusters","year":2007,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Remote direct memory access; Computer science; Data striping; Boosting (machine learning); Port (circuit theory); Parallel computing; Operating system; Computer network; Artificial intelligence","authors":[{"name":"Ying Qian","is_ca":true},{"name":"Ahmad Afsahi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06271917173527262,"gpt":0.3180136848290217,"spread":0.2552945130937491,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006505251,0.0005299688,0.0004279616,0.0004521068,0.0006821729,0.0007837823,0.00144199,0.0004781976,0.002156181],"category_scores_gemma":[0.001232312,0.0003144011,0.0002676305,0.0005270555,0.0004446581,0.001113835,0.0007556461,0.0005057785,0.0004843862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008054747,"about_ca_system_score_gemma":0.0009848131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004765447,"about_ca_topic_score_gemma":0.009700581,"domain_scores_codex":[0.9994443,0.000137363,0.00002656145,0.0001012408,0.0002086728,0.00008185263],"domain_scores_gemma":[0.9991118,0.0002201292,0.00007318668,0.0002798662,0.000253962,0.00006110593],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002973,0.0007406981,0.01096704,0.0004937426,0.0002094783,0.000395344,0.0009974309,0.3719491,0.2487633,0.01403424,0.01122409,0.3372526],"study_design_scores_gemma":[0.00008890085,0.0002716638,0.001140971,0.00000845999,0.00002730254,0.00006093586,0.00009554658,0.9068109,0.08668999,0.001046256,0.003732095,0.00002697077],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4905514,0.0002844725,0.4819066,0.0003048421,0.0000796112,0.0001697172,0.0001978195,0.01556884,0.01093684],"genre_scores_gemma":[0.7460977,0.00009481285,0.2466891,0.00007736495,0.00001688838,0.00008856901,0.0003748905,0.0002643273,0.006296267],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004765447,"threshold_uncertainty_score":0.00947541,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097637319","doi":"10.1109/icpp.2007.83","title":"Two-Phase Computation and Data Scheduling Algorithms for Workflows in the Grid","year":2007,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Workflow; Grid; Distributed computing; Grid computing; Scheduling (production processes); Algorithm; Job shop scheduling; Workflow management system; Schedule; Database; Mathematical optimization; Mathematics; Operating system","authors":[{"name":"Fangpeng Dong","is_ca":true},{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1156556512808666,"gpt":0.3874293614310843,"spread":0.2717737101502177,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002157879,0.001133338,0.00100889,0.000846331,0.001146643,0.001351185,0.001792676,0.0009324045,0.003091868],"category_scores_gemma":[0.003142825,0.0006128629,0.001188851,0.001522403,0.0009563518,0.001888143,0.001764277,0.001352117,0.001058993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0013711,"about_ca_system_score_gemma":0.00288975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004412633,"about_ca_topic_score_gemma":0.003491239,"domain_scores_codex":[0.9985183,0.0005139661,0.0001131812,0.0002302481,0.0004820813,0.0001422392],"domain_scores_gemma":[0.998606,0.0007262397,0.00009138745,0.0002405411,0.0002661349,0.00006962781],"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.0006075943,0.0002730316,0.0007908657,0.0004492186,0.00009039108,0.0002053942,0.0003445153,0.5150895,0.01027066,0.2024431,0.007610931,0.2618247],"study_design_scores_gemma":[0.0001446831,0.00005142454,0.00008364063,0.00001000992,0.00001141534,0.00004351983,0.00002913261,0.9424729,0.002538525,0.0501205,0.004477183,0.00001719063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001996855,0.00007330015,0.9967604,0.0001043477,0.00003572551,0.00007526625,0.00002990015,0.0003034066,0.0006207384],"genre_scores_gemma":[0.06621351,0.0001780871,0.9310393,0.00008827342,0.00003706527,0.0004101568,0.0002093129,0.0001226934,0.001701642],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004412633,"threshold_uncertainty_score":0.01141208,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1516596781","doi":"10.1109/icppw.2004.46","title":"High-throughput interference-aware MAC protocols for heterogeneous ad hoc networks and multihop wireless LANs","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Computer science; Multiple Access with Collision Avoidance for Wireless; Wireless ad hoc network; Throughput; Interference (communication); Power control; Wireless; Access control; Collision problem; Collision; Hidden node problem; Wireless network; Vehicular ad hoc network; Wi-Fi array; Power (physics); Telecommunications; Computer security","authors":[{"name":"Chi‐Hsiang Yeh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04607121612235224,"gpt":0.3054085193355731,"spread":0.2593373032132208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002678285,0.0009038372,0.0009546962,0.001024448,0.00109237,0.001895077,0.002276555,0.000847897,0.001268603],"category_scores_gemma":[0.004652744,0.0005372136,0.000446386,0.000861297,0.0008197301,0.00302918,0.001617527,0.001860346,0.0005262152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007561359,"about_ca_system_score_gemma":0.0006853326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005021653,"about_ca_topic_score_gemma":0.0007665908,"domain_scores_codex":[0.9984308,0.0004573261,0.0001058093,0.0001626937,0.0007151045,0.0001283079],"domain_scores_gemma":[0.9972255,0.001087322,0.0002900322,0.0006240938,0.0006504412,0.000122615],"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.0003271058,0.0003990747,0.001619012,0.0009562241,0.00043089,0.0009785111,0.0009474987,0.2308894,0.09933656,0.2733503,0.012784,0.3779813],"study_design_scores_gemma":[0.00006055069,0.0002039768,0.0004634189,0.00006831883,0.0001653941,0.0004454325,0.0001566032,0.8877776,0.02595982,0.0555205,0.0290958,0.00008255353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007379827,0.002420817,0.985684,0.0002399388,0.0001816422,0.0001252306,0.00002006623,0.001188979,0.002759398],"genre_scores_gemma":[0.4181948,0.003116135,0.571088,0.0003933924,0.0005366724,0.0006871609,0.0002002635,0.000207875,0.005575627],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002678285,"threshold_uncertainty_score":0.01416433,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1597189333","doi":"10.1109/icppw.2004.7","title":"A cycle-based rerouting scheme for wavelength-routed WDM networks","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada); University of Ottawa; Communications Research Centre Canada","funders":"","keywords":"Wavelength-division multiplexing; Computer science; Scalability; Computer network; Scheme (mathematics); Upper and lower bounds; Optical mesh network; Set (abstract data type); Distributed computing; Mesh networking; Wavelength; Telecommunications; Wireless mesh network; Mathematics; Optics; Physics","authors":[{"name":"Hanxi Zhang","is_ca":true},{"name":"Ou Yang","is_ca":true},{"name":"Jing Wu","is_ca":true},{"name":"J.M. Savoie","is_ca":true},{"name":"Tong Shan","is_ca":true},{"name":"Guoqiang Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02707819586340818,"gpt":0.261417903230544,"spread":0.2343397073671358,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002707712,0.0003378131,0.0003113419,0.0006364869,0.0005099698,0.0002862165,0.00100501,0.0003896523,0.001103639],"category_scores_gemma":[0.0004980742,0.0001490899,0.0002680595,0.0004144327,0.0003692577,0.0008098045,0.0005184238,0.0004257695,0.000209556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004345099,"about_ca_system_score_gemma":0.0004779367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009814089,"about_ca_topic_score_gemma":0.00136141,"domain_scores_codex":[0.999805,0.00003911966,0.00001372403,0.00003801481,0.00007254221,0.00003161111],"domain_scores_gemma":[0.9997023,0.00005295098,0.00004068288,0.00009200723,0.00008150558,0.00003062735],"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.0004426803,0.000197379,0.0009271379,0.0003545741,0.00008445503,0.000293529,0.0002333812,0.1358901,0.17354,0.08003575,0.004777443,0.6032237],"study_design_scores_gemma":[0.0001021945,0.0008581941,0.0008188027,0.00005016506,0.00008969274,0.000785773,0.00006547377,0.8673139,0.06251306,0.02827815,0.03900884,0.0001157713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08891413,0.001436682,0.9038684,0.0002834807,0.0002338804,0.0001925299,0.00008414122,0.001140403,0.00384637],"genre_scores_gemma":[0.6953793,0.000772625,0.2995766,0.0001979534,0.00008291384,0.0001323305,0.0001689846,0.00006448217,0.003624764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001103639,"threshold_uncertainty_score":0.003692031,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1490328206","doi":"10.1109/icppw.2004.81","title":"Traffic classification and fairness in wavelength routed optical networks","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Reservation; Routing and wavelength assignment; Computer science; Computer network; Hop (telecommunications); Blocking (statistics); Wavelength; Routing (electronic design automation); Distributed computing; Constraint (computer-aided design); Wavelength-division multiplexing; Mathematics; Physics; Optics","authors":[{"name":"S Pramod","is_ca":true},{"name":"Hussein T. Mouftah","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02761335397933089,"gpt":0.2524202767797459,"spread":0.224806922800415,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009454818,0.0004502475,0.0009106927,0.001700463,0.001926962,0.003156298,0.001617355,0.001441388,0.001023159],"category_scores_gemma":[0.03902381,0.0004669827,0.0003141659,0.001500535,0.002337966,0.003658098,0.001159602,0.0008941065,0.000238199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003912339,"about_ca_system_score_gemma":0.001969422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00532809,"about_ca_topic_score_gemma":0.003228496,"domain_scores_codex":[0.9946837,0.002511353,0.0002436193,0.0005096996,0.001297371,0.0007542696],"domain_scores_gemma":[0.9585977,0.03148978,0.003739918,0.001710319,0.003433313,0.001028834],"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.002079439,0.0005091892,0.03875103,0.0001195746,0.00008003107,0.0003504594,0.000826742,0.5523553,0.006820151,0.2841627,0.002867365,0.111078],"study_design_scores_gemma":[0.00002232406,0.00004296277,0.00235325,0.00001007216,0.00001057798,0.00006493263,0.00006747812,0.9030054,0.001115259,0.09272044,0.0005647455,0.00002253128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6313796,0.002026038,0.3549829,0.002043017,0.0003216225,0.0001249554,0.0001797072,0.0003692685,0.008572814],"genre_scores_gemma":[0.9846669,0.0002140289,0.01336991,0.00008465673,0.0001658404,0.00003771362,0.00004893887,0.00003259994,0.001379374],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009454818,"threshold_uncertainty_score":0.05000246,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159462167","doi":"10.1109/icpp.2004.22","title":"Architecture and implementation of chip multiprocessors: custom logic components and software for rapid prototyping","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Embedded system; Computer architecture; Executable; Programmable Array Logic; Rapid prototyping; Software prototyping; Software; Simple programmable logic device; Logic synthesis; Computer hardware; Logic family; Operating system; Logic gate; Software development; Engineering","authors":[{"name":"Naraig Manjikian","is_ca":true},{"name":"Jin Huang","is_ca":true},{"name":"J. Reed","is_ca":true},{"name":"N. Cordeiro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04113826213252978,"gpt":0.3106224465497966,"spread":0.2694841844172668,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009675933,0.0006260575,0.0003421438,0.0006211951,0.0003295512,0.00120145,0.001875736,0.0006115267,0.004071286],"category_scores_gemma":[0.002605075,0.0005488566,0.0004832388,0.0004576352,0.0004932085,0.001210581,0.0007048871,0.001100288,0.001431797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005367748,"about_ca_system_score_gemma":0.0008810288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000761979,"about_ca_topic_score_gemma":0.0008029684,"domain_scores_codex":[0.9990433,0.0001869733,0.00006884899,0.00008983361,0.0005319758,0.00007904981],"domain_scores_gemma":[0.9987413,0.0002810388,0.0000946652,0.0004707896,0.0003550123,0.00005714323],"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.0002758641,0.0002296374,0.001585688,0.0008675184,0.0001148638,0.0005837349,0.0006202849,0.0810217,0.220125,0.1173578,0.01393457,0.5632835],"study_design_scores_gemma":[0.0002152882,0.0007351442,0.002158976,0.0001858256,0.0001440367,0.001443051,0.0001004588,0.431091,0.2609394,0.02944439,0.2734116,0.0001309673],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009929917,0.0003272948,0.9764454,0.00009468888,0.00006596161,0.000210055,0.00005054169,0.005655094,0.007221059],"genre_scores_gemma":[0.1221892,0.0005811932,0.8697301,0.0001180039,0.00003212962,0.0003975114,0.000340771,0.0009522641,0.005658958],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004071286,"threshold_uncertainty_score":0.01361984,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1533415957","doi":"10.1109/icppw.2004.83","title":"Trellis-SDP: A simple data-parallel programming interface","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Trellis (graph); Computer science; Simple (philosophy); Parallel computing; Interface (matter); Distributed computing; Theoretical computer science; Computer engineering; Algorithm","authors":[{"name":"Meng Ding","is_ca":true},{"name":"P. Lu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06920772850758442,"gpt":0.3156083300929859,"spread":0.2464006015854015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003396861,0.00211563,0.001172308,0.0009199055,0.0007387204,0.002708932,0.004685543,0.001829152,0.04143386],"category_scores_gemma":[0.009239641,0.001484094,0.001651728,0.00106201,0.001302589,0.003834062,0.003163622,0.004401575,0.02092449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001376116,"about_ca_system_score_gemma":0.002079678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003227073,"about_ca_topic_score_gemma":0.003123234,"domain_scores_codex":[0.9976891,0.0004331418,0.0003145275,0.000476359,0.0007982847,0.0002885128],"domain_scores_gemma":[0.996005,0.001815039,0.0002310786,0.0007230268,0.0008587224,0.0003671644],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.004484888,0.0006311155,0.003642518,0.001509859,0.0003772567,0.001065227,0.001266112,0.02554305,0.04483017,0.06636346,0.4690053,0.3812809],"study_design_scores_gemma":[0.00161446,0.0004843012,0.001659968,0.0002056936,0.0001051898,0.0009978573,0.0001012648,0.4485422,0.1114969,0.05433746,0.3800817,0.0003730602],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002492866,0.0001189379,0.7694215,0.0001911299,0.0001028901,0.0004813598,0.001960702,0.2176483,0.007582179],"genre_scores_gemma":[0.06943878,0.0003699381,0.8284396,0.00119394,0.0001811367,0.002541616,0.01075063,0.06178228,0.02530202],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04143386,"threshold_uncertainty_score":0.13861,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1575688676","doi":"10.1109/icppw.2004.8","title":"A data identi .cation scheme for automatic relative debugging","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Debugging; Computer science; Scheme (mathematics); Code (set theory); Algorithmic program debugging; Programming language; Identification (biology); Parallel computing; Mathematics","authors":[{"name":"Gang Liu","is_ca":true},{"name":"Hartmut Schmider","is_ca":false},{"name":"Kenneth E. Edgecombe","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08693031224175103,"gpt":0.3385768329552807,"spread":0.2516465207135297,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009803663,0.001467921,0.001644703,0.004913799,0.002235151,0.005276669,0.004909019,0.002842556,0.0140637],"category_scores_gemma":[0.02528315,0.001309164,0.001399588,0.00347302,0.002726853,0.01066308,0.007277373,0.004511064,0.007342687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001858575,"about_ca_system_score_gemma":0.002998064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001632299,"about_ca_topic_score_gemma":0.001324101,"domain_scores_codex":[0.9904703,0.002393032,0.001594841,0.001961693,0.002868574,0.000711542],"domain_scores_gemma":[0.9766183,0.004773141,0.001398721,0.01198125,0.004640806,0.0005878232],"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.001152774,0.0002673131,0.002544501,0.0007192007,0.0000837965,0.0005241528,0.001863202,0.008847944,0.05371142,0.3032676,0.03741012,0.589608],"study_design_scores_gemma":[0.0002739202,0.0005034337,0.001009843,0.0004337372,0.0001976197,0.001664074,0.0006072473,0.1647256,0.2487489,0.2479571,0.3333411,0.0005374447],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001729917,0.0000736628,0.987978,0.000167971,0.0001014024,0.0001292551,0.0002516505,0.008450981,0.001117099],"genre_scores_gemma":[0.04352701,0.0001204638,0.9478019,0.0003042253,0.00008194831,0.0003824015,0.0009837098,0.002415295,0.004383071],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0140637,"threshold_uncertainty_score":0.0518474,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1574747178","doi":"10.1109/icppw.2004.72","title":"PIES: Protocol independent energy saving algorithm","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Routing protocol; Distributed computing; Protocol (science); Node (physics); Energy (signal processing); Energy conservation; Set (abstract data type); Routing (electronic design automation); Engineering; Mathematics","authors":[{"name":"Yasser Gadallah","is_ca":true},{"name":"Thomas Kunz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02704097689361715,"gpt":0.2806057106653417,"spread":0.2535647337717246,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007217829,0.0007518923,0.0005405845,0.0009484744,0.0007485838,0.001415994,0.002214548,0.0009328257,0.01406221],"category_scores_gemma":[0.002402526,0.0002873572,0.0005114653,0.0009552162,0.0005684502,0.001901205,0.002009256,0.001393869,0.00369268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000637105,"about_ca_system_score_gemma":0.001673638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007555363,"about_ca_topic_score_gemma":0.00108708,"domain_scores_codex":[0.9995246,0.00008228672,0.00002797044,0.00008839357,0.0001767439,0.0001000373],"domain_scores_gemma":[0.9994981,0.0001351726,0.00003577267,0.0001416386,0.0001449155,0.00004446926],"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.0006148807,0.0001975318,0.00131779,0.0003147559,0.00007036776,0.0002008477,0.0001125822,0.2256255,0.009443739,0.09566625,0.07492646,0.5915093],"study_design_scores_gemma":[0.0001878521,0.0002181763,0.0003865757,0.00005799894,0.00003659252,0.0004096963,0.00007450074,0.8533095,0.01221564,0.05096957,0.08209309,0.00004073421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01258299,0.0008351887,0.9407813,0.0008585615,0.0005087789,0.0003871793,0.0005722942,0.006360319,0.03711341],"genre_scores_gemma":[0.3749519,0.0009911719,0.5680646,0.001066113,0.0002005224,0.0009066247,0.003058277,0.0009092127,0.04985156],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01406221,"threshold_uncertainty_score":0.04704285,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1572240008","doi":"10.1109/icppw.2004.35","title":"Constrained cost minimization for multipoint communication groups","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Minification; Span (engineering); Routing (electronic design automation); Distributed computing; Range (aeronautics); Path (computing); Quality of service; Mathematical optimization; Core (optical fiber); Computer network; Mathematics; Telecommunications; Engineering","authors":[{"name":"A. Karaman","is_ca":true},{"name":"Hossam Hassanein","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03771328992926238,"gpt":0.2766058736599391,"spread":0.2388925837306767,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001033877,0.000950966,0.0006727694,0.0006916078,0.0004504942,0.0007621719,0.0009627994,0.001020148,0.002288753],"category_scores_gemma":[0.002651607,0.0003226311,0.0005245521,0.00100899,0.0007349437,0.001776744,0.001354235,0.000801852,0.0002531706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001226022,"about_ca_system_score_gemma":0.0008084363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002398266,"about_ca_topic_score_gemma":0.001684759,"domain_scores_codex":[0.9992269,0.0002926392,0.00002162107,0.0001060012,0.000265647,0.00008706529],"domain_scores_gemma":[0.9992342,0.0004618607,0.00008004682,0.00006066998,0.0001094052,0.0000538701],"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.00004357372,0.00003418999,0.0001966984,0.0000586518,0.00002080082,0.00003834221,0.00004607269,0.9337497,0.001040106,0.03994739,0.001183731,0.02364076],"study_design_scores_gemma":[0.000009038893,0.00003397972,0.00008509514,0.00000620614,0.000005543764,0.00001593055,0.00001694983,0.9731416,0.0004354452,0.02538091,0.0008649,0.000004484333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0277307,0.0004586766,0.9678386,0.0003662446,0.00003061157,0.00005297074,0.00004940643,0.00007106944,0.003401728],"genre_scores_gemma":[0.7361188,0.0007108087,0.2538429,0.0001233409,0.00007771418,0.0003517021,0.0001812131,0.0001394483,0.008454045],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002398266,"threshold_uncertainty_score":0.008895457,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1551153256","doi":"10.1109/icppw.2004.26","title":"All-optical network demonstrator program centered around a testbed for verifying and validating next generation optical networks","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Testbed; Computer science; Scalability; Network management; Network architecture; Network monitoring; Computer network; Network management station; Optical Transport Network; Key (lock); Distributed computing; Passive optical network; Embedded system; Computer architecture; Wavelength-division multiplexing; Operating system","authors":[{"name":"Alex Vukovic","is_ca":true},{"name":"Jing Wu","is_ca":true},{"name":"Michel Savoie","is_ca":true},{"name":"Scott Campbell","is_ca":true},{"name":"Hanxi Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08766292975426034,"gpt":0.2962825547145076,"spread":0.2086196249602473,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003527952,0.0004705974,0.000445803,0.0003797741,0.001092559,0.000869645,0.001130865,0.0007857363,0.006481289],"category_scores_gemma":[0.001681122,0.0001963597,0.0002575932,0.0002244039,0.0009624669,0.001449156,0.001221402,0.001293969,0.001152385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009901815,"about_ca_system_score_gemma":0.001771008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006110333,"about_ca_topic_score_gemma":0.001095979,"domain_scores_codex":[0.9988506,0.0002697575,0.00003371957,0.0001505892,0.0005597,0.0001355466],"domain_scores_gemma":[0.9971299,0.000377902,0.000185,0.0006327053,0.001099639,0.0005749764],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002643755,0.003266056,0.006427677,0.000539266,0.0001016221,0.001538011,0.0007584792,0.04159557,0.6691065,0.08437669,0.04681231,0.1428342],"study_design_scores_gemma":[0.0009899713,0.01370262,0.003414097,0.00006160096,0.00003689702,0.0007232901,0.000287342,0.06983956,0.7696782,0.005455113,0.1357411,0.00007024164],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5518948,0.0003696507,0.3610981,0.002649692,0.0008305141,0.004354715,0.002373483,0.007699434,0.06872954],"genre_scores_gemma":[0.7581719,0.0003157193,0.1847331,0.0003116188,0.0001302683,0.001772736,0.002449847,0.0005463643,0.0515686],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006481289,"threshold_uncertainty_score":0.02168208,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148245055","doi":"10.1109/icppw.2004.11","title":"A hierarchical micro-mobility management model with QoS capability","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Handover; Computer science; Quality of service; Computer network; Mobility management; Scalability; Mobile QoS; Robustness (evolution); Distributed computing; Wireless; Load balancing (electrical power); Wireless network; Mobility model; Service (business); Service provider; Telecommunications","authors":[{"name":"Jing Li","is_ca":true},{"name":"Srinivas Sampalli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01994072269848017,"gpt":0.2425628830601635,"spread":0.2226221603616834,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004675965,0.0003535407,0.0002908485,0.0003381767,0.0004692707,0.0009784548,0.001286407,0.0007335778,0.002334318],"category_scores_gemma":[0.0007532786,0.0002406752,0.0004701015,0.0004778336,0.0005574615,0.001818295,0.0007053242,0.000809253,0.0007847194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001075877,"about_ca_system_score_gemma":0.001027601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004676413,"about_ca_topic_score_gemma":0.004185337,"domain_scores_codex":[0.9996582,0.00007963601,0.00002196498,0.0000685324,0.0001109012,0.00006072943],"domain_scores_gemma":[0.9996347,0.00009848623,0.00006261999,0.00005854028,0.00008939805,0.00005632783],"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.00007226742,0.00009964604,0.001019486,0.0001019278,0.00003543748,0.0002097972,0.0002855761,0.5289044,0.008013958,0.4242193,0.00449349,0.03254471],"study_design_scores_gemma":[0.00001484098,0.00004075947,0.0001746642,0.000008142197,0.00001360535,0.00005184677,0.00002673188,0.9623348,0.0004103295,0.03113018,0.005780529,0.00001354525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04285036,0.000903715,0.9328357,0.001330207,0.000153134,0.0001244492,0.0003006507,0.0005540903,0.02094762],"genre_scores_gemma":[0.8193081,0.001315871,0.1587993,0.0002944656,0.0001727413,0.000436289,0.0003745969,0.00007708402,0.01922147],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004676413,"threshold_uncertainty_score":0.009298384,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147664610","doi":"10.1109/icppw.2004.65","title":"On the optimization of multiservice internet backbones","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; The Internet; Linear programming; Mathematical optimization; Artificial neural network; Network planning and design; Service (business); Optimization problem; Backbone network; Network service; Hopfield network; Computer network; Distributed computing; Artificial intelligence; Algorithm; Mathematics","authors":[{"name":"Luis Orozco–Barbosa","is_ca":false},{"name":"Pedro Cuenca","is_ca":false},{"name":"Francisco J. Quiles","is_ca":false},{"name":"Qilong Jia","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02675950795821332,"gpt":0.2474337372597315,"spread":0.2206742293015182,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009878366,0.0009709533,0.0007392488,0.0007454246,0.0004139401,0.0008490041,0.0006567382,0.0009293367,0.003321187],"category_scores_gemma":[0.001644707,0.0003849451,0.0004690948,0.000901272,0.0007993482,0.001252363,0.0007977213,0.0007371655,0.0003534238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001117506,"about_ca_system_score_gemma":0.001112048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001804205,"about_ca_topic_score_gemma":0.001836001,"domain_scores_codex":[0.9996824,0.000132882,0.00000765814,0.0000450248,0.00009973643,0.00003236082],"domain_scores_gemma":[0.9996285,0.0002285731,0.00004282464,0.00001868538,0.0000585898,0.00002272171],"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.00001484208,0.00001930115,0.00009039648,0.00005395792,0.00001022812,0.00002535008,0.00001201806,0.9494119,0.0008708109,0.03586278,0.0004196774,0.01320867],"study_design_scores_gemma":[0.000005760421,0.00001592455,0.00003417149,0.000005974834,0.000002677642,0.000008477888,0.000005419435,0.9850956,0.0002241621,0.01382164,0.0007778942,0.00000241112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01497508,0.0009023146,0.9757953,0.0003283119,0.00004207017,0.00004824638,0.00004455377,0.00007377907,0.007790338],"genre_scores_gemma":[0.576397,0.003476993,0.4088364,0.000189413,0.0001321403,0.0003113925,0.0001457846,0.0001572877,0.01035365],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003321187,"threshold_uncertainty_score":0.01111054,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149265311","doi":"10.1109/icpp.2007.33","title":"Design, Implementation, and Evaluation of Trellis-SDP for File-Level Data Parallelism","year":2007,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Trellis (graph); Parallel computing; Parallelism (grammar); Data parallelism; Simple (philosophy); Programming paradigm; Overlay; Software; Programming language; Theoretical computer science; Distributed computing; Algorithm","authors":[{"name":"Meng Ding","is_ca":true},{"name":"Paul Lu","is_ca":true},{"name":"Juefu Wang","is_ca":true},{"name":"Mauricio D. Sacchi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2670058010561064,"gpt":0.3966202846173962,"spread":0.1296144835612899,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003459402,0.0009331302,0.0006674821,0.0006910273,0.0007484359,0.00179161,0.005223304,0.0009607176,0.005186553],"category_scores_gemma":[0.007906387,0.0008718872,0.00082969,0.00104629,0.001292015,0.002544258,0.001550438,0.002577461,0.001969776],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001602653,"about_ca_system_score_gemma":0.003197048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004712483,"about_ca_topic_score_gemma":0.003328468,"domain_scores_codex":[0.9964823,0.0005997327,0.0002842834,0.0004479038,0.001741875,0.0004440471],"domain_scores_gemma":[0.9938898,0.001417168,0.0003211321,0.00136513,0.002399055,0.0006078205],"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.004197148,0.002335054,0.01240097,0.001862109,0.0004781279,0.00210669,0.001962958,0.08222102,0.2026505,0.05011418,0.08096362,0.5587077],"study_design_scores_gemma":[0.001207993,0.001576174,0.003265941,0.0001091612,0.0001534125,0.0006739766,0.0002295102,0.5967027,0.3107902,0.007593221,0.07751539,0.000182237],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07993019,0.0004027613,0.8293193,0.0005841784,0.0002919624,0.001807938,0.0006059082,0.07192371,0.01513405],"genre_scores_gemma":[0.2698897,0.0002905034,0.7092908,0.0004101117,0.00007587367,0.001094894,0.00182335,0.006796397,0.01032839],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005223304,"threshold_uncertainty_score":0.01829535,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1487427737","doi":"10.1109/icppw.2004.82","title":"Trellis driver: distributing a java workflow across a network of workstations","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Java; Workflow; Operating system; Server; Trellis (graph); Workload; Executable; Scripting language; Throughput; Real time Java; Distributed computing; Programming language; Database","authors":[{"name":"Nicholas Lamb","is_ca":true},{"name":"P. Lu","is_ca":true},{"name":"Alona Fyshe","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03183861602333515,"gpt":0.2860854374893343,"spread":0.2542468214659991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001808491,0.001211094,0.0006124589,0.000708911,0.0006128571,0.001458659,0.003583604,0.0005606918,0.009758413],"category_scores_gemma":[0.002810169,0.00100369,0.0007893802,0.0004728321,0.0005104503,0.001780518,0.001423089,0.001428693,0.006821515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001126247,"about_ca_system_score_gemma":0.002171181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008988631,"about_ca_topic_score_gemma":0.008631043,"domain_scores_codex":[0.9990326,0.00007418226,0.00007328844,0.0002988944,0.0003599651,0.0001610879],"domain_scores_gemma":[0.998059,0.0003636213,0.0001485221,0.0005919393,0.0004862779,0.0003507533],"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.002605166,0.001360045,0.007474182,0.0007650168,0.0003152768,0.0009906173,0.001161166,0.01938569,0.2512665,0.01199533,0.2236622,0.4790187],"study_design_scores_gemma":[0.0013811,0.0009229615,0.01024918,0.0001012321,0.0001453671,0.001113475,0.0003391931,0.3132654,0.3235523,0.006354342,0.3421279,0.0004475027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03831423,0.0001947976,0.565075,0.0002786318,0.0002759417,0.001305587,0.002447732,0.3748023,0.01730579],"genre_scores_gemma":[0.2459574,0.0006881178,0.6148055,0.000748957,0.0001680066,0.001544931,0.01562375,0.04814607,0.07231723],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009758413,"threshold_uncertainty_score":0.03264517,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}