{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007942927,0.000189627,0.0002287947,0.0002408057,0.000120285,0.0001948416,0.002005831,0.00009252974,0.00001378321],"category_scores_gemma":[0.0001559124,0.0001465289,0.0001101462,0.0005298175,0.0001297671,0.0004742094,0.0001823396,0.0001729654,0.000002208926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006313666,"about_ca_system_score_gemma":0.0001652521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009060111,"about_ca_topic_score_gemma":0.000001717611,"domain_scores_codex":[0.997971,0.00001020896,0.0006439909,0.0003354272,0.0007991167,0.0002402352],"domain_scores_gemma":[0.9976166,0.00004614146,0.0008974285,0.0001742715,0.001208793,0.00005677051],"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.0001982236,0.001125576,0.01307483,0.0006592541,0.00009390747,0.000001956318,0.00211116,0.01047776,0.02008108,0.6093707,0.0007713171,0.3420342],"study_design_scores_gemma":[0.0004670081,0.000143371,0.002089283,0.0007917974,0.00001006954,0.000006903928,0.00008942277,0.9432609,0.0390136,0.01374106,0.0001725967,0.0002139709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0895616,0.00006191189,0.8806256,0.00221025,0.0002086041,0.0004146843,0.000001142153,0.000371987,0.0265442],"genre_scores_gemma":[0.8314986,0.000007054255,0.1681788,0.0001292591,0.00002738205,0.00001306474,0.000001886147,0.0000104831,0.0001334411],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9327832,"threshold_uncertainty_score":0.5975274,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000739259,0.0003080185,0.0002549502,0.0002759921,0.0003150476,0.0003497939,0.001784477,0.0001351036,0.00001434967],"category_scores_gemma":[0.0001485507,0.0002422152,0.00009659,0.0002626953,0.0001625698,0.0004682678,0.0004553322,0.0003484244,0.000004292526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001027412,"about_ca_system_score_gemma":0.0001318076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002519157,"about_ca_topic_score_gemma":0.00000750123,"domain_scores_codex":[0.9977808,0.00001191617,0.0005173426,0.0006240718,0.0007081843,0.0003576989],"domain_scores_gemma":[0.9982526,0.00005219305,0.0006014246,0.0001982149,0.0007808451,0.0001146629],"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.00336712,0.009162043,0.06309866,0.001895119,0.001039891,0.00007339993,0.02862435,0.09061722,0.06535273,0.3298874,0.01396143,0.3929206],"study_design_scores_gemma":[0.001173219,0.0001957619,0.003089829,0.0006414742,0.00001177785,0.00001512123,0.0001420626,0.9804213,0.01203199,0.001282999,0.0006143642,0.0003800938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0670969,0.00007038655,0.9127992,0.005771354,0.0003663313,0.0004908832,0.00000494812,0.0004887149,0.01291124],"genre_scores_gemma":[0.8649492,0.00001482729,0.1325277,0.001537267,0.00004496099,0.00001663823,0.000002732744,0.00002088827,0.0008857662],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8898041,"threshold_uncertainty_score":0.9877249,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002157506,0.0001538517,0.0001672671,0.0001183441,0.0001889307,0.0005950534,0.00294328,0.00004792201,7.748286e-7],"category_scores_gemma":[0.0001969244,0.000102429,0.00003783095,0.0003202351,0.00007333527,0.0006641462,0.0004278634,0.0002084733,8.995872e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003385421,"about_ca_system_score_gemma":0.00008313839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001976311,"about_ca_topic_score_gemma":0.000007868605,"domain_scores_codex":[0.9983413,0.00001199581,0.0004476415,0.0004458887,0.0005111489,0.0002420448],"domain_scores_gemma":[0.9987627,0.0001785787,0.0004060201,0.0001821031,0.0004330936,0.00003748325],"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.0005518443,0.0009467333,0.005852627,0.0005318982,0.0001190415,0.000007282513,0.008643639,0.01554673,0.005087398,0.585291,0.001800323,0.3756214],"study_design_scores_gemma":[0.001194072,0.00006404694,0.0006790768,0.0004232404,0.000006864313,0.00002757216,0.0005901317,0.9817833,0.000168305,0.01449775,0.0004243657,0.0001412281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09775902,0.0001368,0.8913465,0.004603787,0.0005586756,0.0005279178,0.00002099266,0.00005613803,0.004990171],"genre_scores_gemma":[0.9241877,0.000005602008,0.07529517,0.0002571201,0.0001914874,0.00001311237,0.00001838355,0.000006742429,0.00002472753],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9662366,"threshold_uncertainty_score":0.5738114,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003024434,0.0003311227,0.000362375,0.00009617349,0.00027774,0.0007569363,0.002157965,0.0001530924,0.000007997984],"category_scores_gemma":[0.00004507806,0.0002476127,0.0001158465,0.0002129241,0.000168768,0.000728578,0.0005486824,0.0003170262,0.000001941999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001025095,"about_ca_system_score_gemma":0.0001680951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001387869,"about_ca_topic_score_gemma":0.00001576727,"domain_scores_codex":[0.9979172,0.00001030958,0.0005234109,0.0006652597,0.0004798594,0.0004039236],"domain_scores_gemma":[0.9982134,0.00005302601,0.0005930408,0.0002045425,0.0008337593,0.0001023099],"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.001948806,0.000884835,0.002111258,0.001435828,0.0002987782,0.000008593564,0.003316526,0.0469174,0.008627143,0.5547658,0.000819542,0.3788655],"study_design_scores_gemma":[0.004891643,0.001098549,0.0005943347,0.00572577,0.00002909887,0.00008767446,0.0002291897,0.8606548,0.01884234,0.1050135,0.001841823,0.0009912569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08029732,0.0002368887,0.8706204,0.01098141,0.0006610288,0.03528422,0.0000378108,0.0003619521,0.00151895],"genre_scores_gemma":[0.9676181,0.00005895888,0.01834359,0.0004062489,0.0001541961,0.01325185,0.000003868726,0.00002722179,0.0001359406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8873208,"threshold_uncertainty_score":0.9999976,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001531774,0.0002304832,0.000218385,0.00009366481,0.000129546,0.0001211098,0.0008605091,0.0001447223,0.000005593968],"category_scores_gemma":[0.0002932776,0.0001873052,0.00009893192,0.0002330724,0.0001356779,0.0002831168,0.0000992265,0.0003577796,0.000002071579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001722369,"about_ca_system_score_gemma":0.00004717668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001752038,"about_ca_topic_score_gemma":0.000001540596,"domain_scores_codex":[0.9986948,0.000001242499,0.0003748502,0.0002722726,0.0003185692,0.0003382775],"domain_scores_gemma":[0.9991381,0.00004940839,0.0001937398,0.00009984515,0.0004764646,0.00004249312],"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.0001912351,0.00008131885,0.0003692133,0.0002533576,0.000074518,5.791979e-7,0.0001264578,0.7550928,0.01382927,0.2042594,0.0001501526,0.02557169],"study_design_scores_gemma":[0.0007992615,0.00004868485,0.0001251955,0.0006851074,0.00001247515,0.000002905845,0.0001453935,0.9339875,0.007013388,0.05676615,0.0001784879,0.0002354445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3625395,0.000254712,0.6038535,0.007786602,0.0007485747,0.001126855,0.00001725494,0.00175746,0.0219155],"genre_scores_gemma":[0.8721164,0.0000231696,0.1274447,0.0001598779,0.00009548856,0.0000854505,0.000003619915,0.00003741241,0.00003387813],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5095769,"threshold_uncertainty_score":0.7638084,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104657,0.0001521368,0.0001581768,0.00009839333,0.00004442808,0.00008475057,0.0004430692,0.0001199171,0.000003134327],"category_scores_gemma":[0.0001006912,0.0001214381,0.00002678428,0.0002286361,0.000163587,0.000304278,0.00007979613,0.0003588457,0.000001201019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001243537,"about_ca_system_score_gemma":0.00002117859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001029325,"about_ca_topic_score_gemma":0.00000454956,"domain_scores_codex":[0.9990726,0.000001368659,0.0002818689,0.0002117678,0.0002333418,0.0001990805],"domain_scores_gemma":[0.9996471,0.0000224907,0.00008325408,0.00005903026,0.0001560577,0.00003210365],"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.00008637986,0.00008849811,0.001169644,0.0001119871,0.00002473105,0.0000011383,0.0002707775,0.5357879,0.005523373,0.3654485,0.00002061256,0.09146645],"study_design_scores_gemma":[0.0005090546,0.00002816717,0.007094228,0.0004716627,0.000006324202,0.000008312604,0.0004610512,0.9660092,0.000807303,0.02441097,0.00001997387,0.0001737277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9763131,0.0001093926,0.01163669,0.001998791,0.0001303051,0.0002045326,0.000001141141,0.0002597654,0.009346345],"genre_scores_gemma":[0.9881121,0.0001704899,0.0115862,0.00003109007,0.00003382976,0.00003006528,0.000001403035,0.00001784008,0.00001697506],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4302213,"threshold_uncertainty_score":0.4952102,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002494456,0.0001534709,0.0001823753,0.0001393718,0.0001604722,0.0001648461,0.0007055011,0.00005410098,0.000001588733],"category_scores_gemma":[0.0001285199,0.0001174597,0.00003852617,0.0001642943,0.000107596,0.0003767152,0.0002379512,0.0001204565,1.193529e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002951895,"about_ca_system_score_gemma":0.00009043007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001878438,"about_ca_topic_score_gemma":0.00000162232,"domain_scores_codex":[0.998893,0.000005704594,0.0003296377,0.0003238688,0.000296187,0.0001515554],"domain_scores_gemma":[0.9985918,0.0000334908,0.0004988097,0.00007251494,0.0007650859,0.0000383144],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004653596,0.0003848772,0.009725885,0.002404291,0.0001555194,5.601563e-7,0.01080838,0.005531649,0.05057145,0.5645659,0.00008974761,0.3552964],"study_design_scores_gemma":[0.005741871,0.0008855831,0.01521234,0.003537463,0.00005020251,0.00007254737,0.001010739,0.2115321,0.1660598,0.5946451,0.0003485597,0.0009036834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2094699,0.0002240709,0.7840136,0.004346507,0.00007741837,0.001150393,0.000009810586,0.0001556208,0.0005526849],"genre_scores_gemma":[0.7384673,0.00004338517,0.261262,0.000129672,0.00001680733,0.00006168287,0.000002214553,0.000006976195,0.000009995842],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5289974,"threshold_uncertainty_score":0.4789866,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006181274,0.0003361965,0.0003405189,0.0001485189,0.0002773851,0.001059733,0.007583485,0.0001095433,0.00001310037],"category_scores_gemma":[0.0001927915,0.0002545518,0.0001176066,0.000498137,0.0001462413,0.001392183,0.001592241,0.0003992121,0.00003426013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001361789,"about_ca_system_score_gemma":0.0003112938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007631152,"about_ca_topic_score_gemma":0.000008755272,"domain_scores_codex":[0.9970059,0.00001373309,0.0006715989,0.0008493448,0.001004595,0.0004548578],"domain_scores_gemma":[0.9977823,0.00003732921,0.0007549098,0.0005323463,0.0007792884,0.0001137763],"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.0002976178,0.001148915,0.002653521,0.0005872787,0.0003189118,0.00001061223,0.005347964,0.03913612,0.01084252,0.8620535,0.005489225,0.0721138],"study_design_scores_gemma":[0.004446948,0.0005464607,0.001360107,0.003795693,0.00007400951,0.0002682414,0.001524515,0.7842931,0.007717051,0.1504617,0.04375418,0.001757986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07564195,0.0003878689,0.855669,0.0159954,0.001386133,0.001062008,0.00005781898,0.0007093689,0.04909042],"genre_scores_gemma":[0.9587193,0.00001462977,0.04042643,0.0002243316,0.0001472547,0.00002726026,0.00001902654,0.00002061206,0.0004012053],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8830773,"threshold_uncertainty_score":0.9999906,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005101283,0.0001595938,0.0001635165,0.0001487989,0.0002415445,0.0004019504,0.003521841,0.00006219529,0.000003959412],"category_scores_gemma":[0.0004443786,0.0001278368,0.00006140018,0.0002860229,0.00006855254,0.001816357,0.00066438,0.0001605621,0.000003912657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001044443,"about_ca_system_score_gemma":0.0002493147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007588671,"about_ca_topic_score_gemma":0.000001514271,"domain_scores_codex":[0.9984487,0.00000581322,0.0004001133,0.0004618908,0.0004947058,0.0001888191],"domain_scores_gemma":[0.9981706,0.00004355309,0.0006018002,0.0002745277,0.0008699556,0.00003962457],"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.00003035188,0.0001614854,0.0003461466,0.0001485331,0.00007392422,2.675881e-7,0.001018916,0.002891547,0.005764115,0.9747513,0.0009043518,0.01390908],"study_design_scores_gemma":[0.0004308451,0.00004317337,0.0002658862,0.0006036629,0.0000105467,0.000008058552,0.00005303429,0.8221791,0.004344054,0.1717458,0.0001612381,0.0001545572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006354707,0.00004952206,0.9762646,0.008127755,0.0001793518,0.0003703494,0.000008071167,0.0003339417,0.008311682],"genre_scores_gemma":[0.6115233,0.000008620003,0.3880532,0.0001886488,0.00003507512,0.00003156126,0.00000706685,0.000008467307,0.0001440721],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8192876,"threshold_uncertainty_score":0.6544515,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000308462,0.0002456441,0.0002113271,0.0001326132,0.0001996875,0.0005867511,0.003305426,0.000101267,0.00002881125],"category_scores_gemma":[0.00006727187,0.0001849645,0.0001043378,0.0003431275,0.0001117959,0.001095611,0.0007578997,0.0003125875,0.000008179672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002066958,"about_ca_system_score_gemma":0.0003079895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004440533,"about_ca_topic_score_gemma":0.000007281776,"domain_scores_codex":[0.997593,0.00000697001,0.0004711111,0.0005316556,0.001077175,0.0003200732],"domain_scores_gemma":[0.9982866,0.00002078949,0.0005929775,0.0002031642,0.0008140899,0.00008237955],"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.00005287371,0.0002571178,0.0002667948,0.00007937535,0.00004646666,0.000003159038,0.0007641027,0.00242895,0.00572141,0.8485935,0.000306525,0.1414797],"study_design_scores_gemma":[0.00327568,0.0003542216,0.001329205,0.002658861,0.00001837301,0.0001303889,0.0004185793,0.4791051,0.04051899,0.4653656,0.005892228,0.0009328008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003468342,0.00003607919,0.8567079,0.008949354,0.0008070961,0.01243212,0.000004622359,0.0004223472,0.1171722],"genre_scores_gemma":[0.9290944,0.000006056661,0.06096547,0.0006404454,0.0001845729,0.008502313,8.176806e-7,0.000021569,0.0005843631],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.925626,"threshold_uncertainty_score":0.7542633,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002633178,0.0001417643,0.0001486154,0.00007710756,0.0002137948,0.0002931978,0.00161796,0.00006252699,0.000007174282],"category_scores_gemma":[0.0001629111,0.0001120869,0.00008166401,0.0001694697,0.000123179,0.0005961273,0.0001495142,0.00013826,0.000003293458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008744013,"about_ca_system_score_gemma":0.000169262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004735801,"about_ca_topic_score_gemma":0.000004265957,"domain_scores_codex":[0.9988486,0.000006278851,0.0003414233,0.0002779886,0.0003576165,0.0001680588],"domain_scores_gemma":[0.9982855,0.00005610017,0.0004372531,0.0001414058,0.001034201,0.00004554068],"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.00008626055,0.0001054591,0.000110712,0.00003023885,0.00002360701,8.814315e-8,0.0005534829,0.005481913,0.00189562,0.9220199,0.0001880456,0.06950466],"study_design_scores_gemma":[0.002763325,0.00009867981,0.0003767417,0.0006329954,0.00001810272,0.0000140616,0.0003531119,0.8782299,0.003566054,0.1129457,0.0007449607,0.0002563993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02266933,0.00009170917,0.919745,0.0386262,0.000436747,0.001266496,0.000009993729,0.0002101977,0.01694426],"genre_scores_gemma":[0.9464017,0.0000225799,0.05269276,0.0005116895,0.00005550987,0.0001506223,0.000005263789,0.000008640421,0.0001512357],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9237323,"threshold_uncertainty_score":0.457077,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002396183,0.0002634411,0.0002566578,0.00006018136,0.0001668076,0.0005795222,0.0005181108,0.0001938043,0.000002638317],"category_scores_gemma":[0.0002504779,0.0002180065,0.00007657365,0.0001803822,0.0002102097,0.0004774415,0.0001484631,0.0003828781,9.569731e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001231913,"about_ca_system_score_gemma":0.00004389195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001405015,"about_ca_topic_score_gemma":0.000002883659,"domain_scores_codex":[0.9984528,0.000002782382,0.0004582511,0.000339315,0.0003276815,0.0004191788],"domain_scores_gemma":[0.9992876,0.00006254663,0.0001555368,0.00008539175,0.0003281584,0.00008076372],"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.0002802118,0.0003117822,0.003081514,0.0005264597,0.0003101029,0.00000240526,0.0002174741,0.2858316,0.08889512,0.5038593,0.0004609856,0.1162231],"study_design_scores_gemma":[0.0006808754,0.0001396694,0.0002543036,0.0005892515,0.00004263148,0.00001796627,0.0002162147,0.9804695,0.004999543,0.01224333,0.00008241058,0.0002643016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9433993,0.0002647787,0.04652157,0.002472901,0.0004949048,0.001067145,0.000004127953,0.0007010094,0.005074255],"genre_scores_gemma":[0.8523591,0.0000583503,0.1469429,0.00009428083,0.0003440896,0.0001533766,0.000007133199,0.00003406636,0.000006706804],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6946379,"threshold_uncertainty_score":0.8890047,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003767753,0.0003051325,0.0002786685,0.00009015638,0.000126811,0.0001635766,0.001020058,0.0001068614,0.0000247962],"category_scores_gemma":[0.00003553276,0.0002288325,0.0001036188,0.0002183179,0.0002939253,0.0004094943,0.0002091543,0.0005030795,0.000005049303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003808595,"about_ca_system_score_gemma":0.0000927728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001402273,"about_ca_topic_score_gemma":0.00002001069,"domain_scores_codex":[0.9979972,0.000005808764,0.0004447751,0.0004790125,0.0007223159,0.0003508442],"domain_scores_gemma":[0.9990603,0.00001724787,0.0001631957,0.0002055213,0.0004660785,0.00008766034],"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.001959498,0.001819621,0.009010123,0.003542895,0.0005281172,0.000006492814,0.004390532,0.7263923,0.02636753,0.2155678,0.0004667954,0.009948221],"study_design_scores_gemma":[0.003205415,0.0001645558,0.007286702,0.001536383,0.0001257299,0.0000353743,0.0006068381,0.7678954,0.02066753,0.1974335,0.0001783561,0.0008642557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9426484,0.00006810446,0.01074054,0.001185654,0.0002672937,0.0006561149,0.00001644478,0.0002301177,0.04418732],"genre_scores_gemma":[0.9875596,0.0000271398,0.01192509,0.0001184929,0.00008655529,0.0001015893,0.000003426881,0.00003220627,0.0001458601],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04491122,"threshold_uncertainty_score":0.933152,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009537655,0.0001467295,0.0001393011,0.00006788698,0.00004272609,0.00005233662,0.0008905128,0.00007005953,0.00003684431],"category_scores_gemma":[0.0001974843,0.00009155278,0.00004946545,0.0001890895,0.0001431788,0.0002113044,0.0001181452,0.0002359466,0.000004897472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006957349,"about_ca_system_score_gemma":0.00001804567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004387496,"about_ca_topic_score_gemma":0.000001913714,"domain_scores_codex":[0.9991023,0.00000179861,0.000277095,0.0001510877,0.0003315779,0.0001361597],"domain_scores_gemma":[0.9993197,0.00004847706,0.0001753914,0.00008885955,0.0003500528,0.00001749649],"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.00004531009,0.00003756462,0.00007936027,0.00007091466,0.00002513777,1.203545e-7,0.0001755647,0.7305443,0.004176205,0.2633562,0.00007891821,0.001410347],"study_design_scores_gemma":[0.0004451286,0.00007387588,0.0002226452,0.001312972,0.00001330786,0.00000396782,0.0005079381,0.8632002,0.04198612,0.09199838,0.00004710037,0.0001883947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7939138,0.0001771177,0.1041569,0.01050853,0.0005517905,0.000682702,0.00001254354,0.0005654367,0.0894312],"genre_scores_gemma":[0.9754872,0.00005214192,0.02421473,0.0001113493,0.00002290839,0.00002319725,0.000001139257,0.00001847535,0.00006882133],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1815734,"threshold_uncertainty_score":0.3733414,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003056432,0.0001637917,0.0002034942,0.0001241174,0.0001422254,0.0002217456,0.002258969,0.00006165337,0.00002950322],"category_scores_gemma":[0.0002243236,0.0001288255,0.00004457877,0.0002147919,0.00007548354,0.0006807251,0.0004138787,0.00009837947,9.889861e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005024065,"about_ca_system_score_gemma":0.0002517294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002525938,"about_ca_topic_score_gemma":0.000007048282,"domain_scores_codex":[0.9977837,0.00001881415,0.0005941658,0.0004477849,0.0009370236,0.0002185405],"domain_scores_gemma":[0.9967152,0.0001751064,0.0008097576,0.0002333999,0.002017191,0.00004928315],"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.0006356926,0.0005425359,0.003838354,0.0008768063,0.0004206427,7.654533e-7,0.006580659,0.00634393,0.02393797,0.474352,0.03889883,0.4435718],"study_design_scores_gemma":[0.001627939,0.0001378231,0.00510951,0.0005200178,0.00005362345,0.00001572579,0.0009538297,0.9503126,0.006022311,0.03388919,0.001085853,0.0002715908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02820153,0.0001447158,0.9638709,0.001829872,0.0003429237,0.0009364531,0.0002201966,0.00004967351,0.004403751],"genre_scores_gemma":[0.9369923,0.000008959307,0.06264072,0.00007630439,0.00007213787,0.00003236138,0.00006778687,0.000008623595,0.000100788],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9439687,"threshold_uncertainty_score":0.525335,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005059696,0.0002264888,0.0003017896,0.00005091704,0.0003095289,0.0004323148,0.002540889,0.00009237647,0.000006383218],"category_scores_gemma":[0.0001827845,0.0001792015,0.0001602615,0.000721028,0.0001552729,0.0005644347,0.0004813964,0.0002801411,0.000005999199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001214824,"about_ca_system_score_gemma":0.000227096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003748897,"about_ca_topic_score_gemma":0.000005913077,"domain_scores_codex":[0.9977736,0.00001119787,0.0006445562,0.0004241905,0.0007427928,0.0004036234],"domain_scores_gemma":[0.9976007,0.00006118436,0.0009359068,0.0001925636,0.001136615,0.0000730432],"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.000119856,0.0003699482,0.01229021,0.0002276657,0.0001505436,0.000002703387,0.005795979,0.134728,0.003026859,0.8165575,0.0009739304,0.02575687],"study_design_scores_gemma":[0.00449781,0.0004422929,0.02528784,0.01291482,0.00007377971,0.0001202489,0.002235807,0.4906118,0.009565913,0.4498975,0.002795249,0.001556942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3784402,0.0002273477,0.5868745,0.007409965,0.001139307,0.0005438712,0.00005794679,0.000255855,0.02505101],"genre_scores_gemma":[0.9773843,0.00001374186,0.0221567,0.0001007133,0.0001266645,0.0000169723,0.000007281363,0.00001145637,0.00018213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5989442,"threshold_uncertainty_score":0.7307624,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}