{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":12,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":12,"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":"2a00556b0200","filters":{"venue":"Parallel and Distributed Processing Techniques and Applications"}},"results":[{"id":"W17338413","doi":"","title":"Distributed Models of Thread Level Speculation.","year":2005,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Western University","funders":"","keywords":"Speculation; Computer science; Speculative multithreading; Thread (computing); Parallel computing; Exploit; Multithreading; Distributed computing; Task parallelism; Operating system; Parallelism (grammar); Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.03433359730238873,"gpt":0.283452634085353,"spread":0.2491190367829643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001712878,0.0001713786,0.0002129948,0.00008701266,0.0002835663,0.0001373884,0.0003385191,0.0001016821,0.000001598095],"category_scores_gemma":[0.000007909859,0.0001599246,0.00003611729,0.0004151928,0.000126595,0.000456253,0.000195313,0.0001066599,7.670741e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002126883,"about_ca_system_score_gemma":0.00004502451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001617903,"about_ca_topic_score_gemma":0.000001527935,"domain_scores_codex":[0.9988987,0.00002192661,0.0003597411,0.0003776197,0.0001460321,0.0001959829],"domain_scores_gemma":[0.9991476,0.00003687627,0.0002079662,0.0003151963,0.0001931606,0.00009917961],"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.00001343891,0.0002472865,0.0005026492,0.000121741,0.0000172561,0.000001049053,0.0001905106,0.01289871,0.0001948741,0.5882388,0.001313164,0.3962605],"study_design_scores_gemma":[0.0003656909,0.00005836946,0.0006541007,0.00009602228,0.0000236532,0.0000570395,0.00002171386,0.7689244,0.003159457,0.194929,0.03126926,0.0004413205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003123923,0.001481755,0.9951115,0.0009390841,0.000003255076,0.0003226265,0.0001161837,0.0007256673,0.0009875874],"genre_scores_gemma":[0.5023344,0.0003941393,0.4968941,0.00004561157,0.00003544613,0.0001317733,0.0001288913,0.000006639145,0.0000290355],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7560257,"threshold_uncertainty_score":0.6521537,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W172647862","doi":"","title":"Managing Distributed MARF's Nodes with SNMP.","year":2008,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Simple Network Management Protocol; Computer network; Distributed computing; Network management","retraction":null,"screen_n_in":null,"score":{"opus":0.06243017987076573,"gpt":0.3352453648993419,"spread":0.2728151850285762,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006858304,0.0001783078,0.0002200669,0.0001355628,0.001124452,0.000526576,0.0004176396,0.00005125414,0.00001457482],"category_scores_gemma":[0.00005627288,0.0001254253,0.00002860282,0.0009511245,0.0003824629,0.0002769969,0.0003077066,0.0001139847,0.00000888986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001625079,"about_ca_system_score_gemma":0.00003639749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000341782,"about_ca_topic_score_gemma":0.000004529997,"domain_scores_codex":[0.9981174,0.00003335153,0.0003735455,0.0007511301,0.0004568722,0.0002676627],"domain_scores_gemma":[0.9987723,0.0001355074,0.0001896905,0.0005515739,0.0002000905,0.0001508214],"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.0001238086,0.0002858377,0.02037702,0.00009847655,0.00003226613,0.0000496915,0.0002998967,0.0003666354,0.00007043568,0.01634873,0.03342147,0.9285257],"study_design_scores_gemma":[0.0007122706,0.0001213108,0.01719559,0.0001233214,0.00006322193,0.0004840855,0.0009880501,0.02779632,0.0002300614,0.08712397,0.8644238,0.0007379644],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008435456,0.0007271934,0.9855947,0.001799821,0.00001030161,0.0003622635,0.0002488674,0.0003801901,0.002441203],"genre_scores_gemma":[0.9631757,0.00029693,0.03524776,0.0001001618,0.00006070759,0.0002365661,0.0004055286,0.00001094548,0.0004657699],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9547402,"threshold_uncertainty_score":0.8648487,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W203320341","doi":"","title":"Design and Implementation of Demand Migration Systems in GIPSY.","year":2008,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02253096523881279,"gpt":0.2836064526009799,"spread":0.2610754873621672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002728638,0.0001221954,0.0001889118,0.00008472083,0.0002182978,0.0001024025,0.0001380918,0.00006646573,2.823532e-7],"category_scores_gemma":[0.000003146706,0.0001133255,0.00001198101,0.0003161198,0.00008302655,0.0002325293,0.00007046337,0.00006533963,2.133547e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001281257,"about_ca_system_score_gemma":0.00004661162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002018961,"about_ca_topic_score_gemma":0.000005900327,"domain_scores_codex":[0.9990624,0.00005502582,0.0003362957,0.0002933592,0.0001023031,0.0001506055],"domain_scores_gemma":[0.9994878,0.00005179768,0.0001746735,0.0001457532,0.00007808181,0.00006192944],"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.0001276148,0.0008577643,0.1520852,0.003266288,0.0001085039,0.00005007699,0.01022904,0.008657579,0.006959056,0.2279626,0.003997147,0.5856991],"study_design_scores_gemma":[0.003552004,0.0007090783,0.07051664,0.000860605,0.00008063082,0.001693609,0.001540849,0.8373769,0.004619038,0.02523132,0.05203186,0.001787476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02421382,0.003739939,0.9710567,0.0001928811,0.000006492328,0.0005971238,0.00001992937,0.000129693,0.00004342327],"genre_scores_gemma":[0.9586077,0.0008408368,0.04014982,0.00001022606,0.00001953508,0.0003014592,0.00005889354,0.00000458133,0.000006986236],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9343938,"threshold_uncertainty_score":0.4621279,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W61637013","doi":"","title":"Linear Algorithm for Broadcasting in Networks With No Intersecting Cycles.","year":2009,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Broadcasting (networking); Computer science; Algorithm; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.008955295327775486,"gpt":0.252350391834217,"spread":0.2433950965064415,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005679304,0.0001341633,0.0001455836,0.00004150096,0.0001253997,0.00004433666,0.00007133401,0.00009514879,3.578293e-7],"category_scores_gemma":[0.000008368316,0.0001183994,0.00001181662,0.0002262342,0.00006630812,0.000101492,0.00002198842,0.000175034,1.433677e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002080976,"about_ca_system_score_gemma":0.000004355083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001517445,"about_ca_topic_score_gemma":0.000001558662,"domain_scores_codex":[0.9993798,0.000002412429,0.0001666775,0.0001943081,0.00003416136,0.0002227108],"domain_scores_gemma":[0.9997541,0.00004082002,0.00003465552,0.00008646448,0.00004272124,0.00004124106],"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.000008205206,0.00001758636,0.0001055146,0.00004070975,0.000003052782,0.000001120197,0.00001174648,0.01222038,0.00004312718,0.0005618177,0.00003654891,0.9869502],"study_design_scores_gemma":[0.0002370601,0.00007941712,0.0001375681,0.0001589667,0.000009965774,0.00002141784,0.00007994301,0.9895067,0.0001219724,0.004485122,0.004943224,0.000218707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008359294,0.001290006,0.996043,0.00007884714,0.000003097758,0.0004058122,0.0000148112,0.0009935998,0.0003349411],"genre_scores_gemma":[0.3146128,0.0003715616,0.6844615,0.00002002429,0.0000693225,0.0003933713,0.0000523434,0.00001395279,0.000005071998],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9867315,"threshold_uncertainty_score":0.4828188,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W56413504","doi":"","title":"Dynamic Aspect-Oriented Load Balancing in Java RMI.","year":2008,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Advanced Software Engineering Methodologies","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 Waterloo","funders":"","keywords":"Computer science; Java; Load balancing (electrical power); Distributed computing; Remote procedure call; Server; Operating system; Overhead (engineering); Distributed object; Process (computing); Round-robin DNS; Common Object Request Broker Architecture; The Internet; Grid","retraction":null,"screen_n_in":null,"score":{"opus":0.01759150799010206,"gpt":0.2850240331736653,"spread":0.2674325251835633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001644508,0.0001330904,0.0001608501,0.00006540413,0.0002239591,0.00004351427,0.0002051735,0.00006866173,4.071041e-7],"category_scores_gemma":[0.00005358347,0.0001270195,0.00001531381,0.0004481244,0.0001008104,0.0002507265,0.0001454877,0.0001472337,7.158131e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005678304,"about_ca_system_score_gemma":0.00005314387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001429906,"about_ca_topic_score_gemma":0.000003042953,"domain_scores_codex":[0.9991346,0.00001955799,0.0001900577,0.0003485958,0.0001001913,0.0002069779],"domain_scores_gemma":[0.9994987,0.00008833629,0.00006609316,0.0002216253,0.00006328644,0.00006197301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003291228,0.0003077339,0.008172218,0.0003475347,0.00001981837,0.00009093802,0.001496618,0.005160642,0.00288265,0.07194182,0.0003401152,0.909207],"study_design_scores_gemma":[0.002639805,0.0003584851,0.05732785,0.0006897829,0.00003641487,0.002136484,0.0004531221,0.3311697,0.005792431,0.4469624,0.1492128,0.003220795],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002423397,0.002655664,0.9934443,0.0002363415,0.000007874167,0.0002220178,0.00000998402,0.0008485907,0.0001518766],"genre_scores_gemma":[0.3320298,0.0008268494,0.6668043,0.00002395704,0.00001058406,0.0002588583,0.00001707174,0.000006566332,0.00002206518],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9059862,"threshold_uncertainty_score":0.5179704,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W110399080","doi":"","title":"Network Performance in High Performance Linux Clusters.","year":2005,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Interconnection Networks and Systems","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":"Western University","funders":"","keywords":"Myrinet; Gigabit Ethernet; Computer science; Operating system; Supercomputer; Gigabit; Network interface controller; Ethernet; Network performance; Process (computing); Computer network; Local area network; Embedded system; Distributed computing; Message passing; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01163872139182601,"gpt":0.2378320049602438,"spread":0.2261932835684178,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002190672,0.0001282868,0.0001513321,0.00004949249,0.0003275489,0.0001790572,0.0002256606,0.00008536939,0.000001582074],"category_scores_gemma":[0.000001502075,0.0001139482,0.0000133262,0.0003538694,0.00005249763,0.0004306624,0.0001154134,0.0001478591,0.000002946865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002745352,"about_ca_system_score_gemma":0.00002235811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001252489,"about_ca_topic_score_gemma":0.000007710743,"domain_scores_codex":[0.9990844,0.00001705494,0.0002665266,0.0003068317,0.00008114416,0.0002440169],"domain_scores_gemma":[0.9995762,0.0000198266,0.00009169523,0.0001946228,0.00005463288,0.00006298273],"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.00001874629,0.00008292767,0.008968472,0.0001589625,0.000005168675,0.000001099735,0.0001887713,0.007291048,0.00001220244,0.02941077,0.001180369,0.9526815],"study_design_scores_gemma":[0.0003741886,0.00009150223,0.007977078,0.0002268317,0.000006499736,0.0001015634,0.00002672256,0.8061855,0.0001166586,0.00278598,0.1817458,0.0003616624],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03096723,0.001328768,0.9642467,0.001350814,0.000019989,0.0003580334,0.00000482644,0.0003234554,0.001400221],"genre_scores_gemma":[0.9627839,0.0006566416,0.03559339,0.0001877278,0.0002481466,0.0004098572,0.00002079199,0.000006111733,0.00009337097],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9523198,"threshold_uncertainty_score":0.4646674,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1554697736","doi":"","title":"Management of Mobile Agent Systems: Learning from the Ants","year":2002,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mobile agent; Upgrade; Computer science; Server; Distributed computing; Software agent; Multi-agent system; Intelligent agent; Mobile computing; Computer security; Computer network; Artificial intelligence; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02033534194746937,"gpt":0.2443844161280668,"spread":0.2240490741805974,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001487794,0.0001152215,0.0001283191,0.00002352873,0.0003159594,0.0001748911,0.0003607467,0.00003453523,0.000005085999],"category_scores_gemma":[0.000001124591,0.0000862569,0.00002126032,0.000280864,0.00007041864,0.0001115135,0.000281445,0.00008491526,0.000002513319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001789599,"about_ca_system_score_gemma":0.000004216931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003754115,"about_ca_topic_score_gemma":4.966372e-7,"domain_scores_codex":[0.9991292,0.00003446958,0.0002320045,0.0003108343,0.0001387594,0.0001547695],"domain_scores_gemma":[0.9993914,0.00004138397,0.0001543051,0.0003215991,0.00003950029,0.00005177396],"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.000003666702,0.0001370187,0.0007538127,0.000247482,0.00004962018,0.000008069876,0.0002254146,0.002171206,0.00002413294,0.04346853,0.002642532,0.9502685],"study_design_scores_gemma":[0.0004689805,0.0001175914,0.001340474,0.0004396702,0.0001039095,0.0000150776,0.000712632,0.4010557,0.0001740515,0.006446964,0.5886856,0.0004393567],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001089172,0.01025813,0.9863374,0.0002433825,0.000008562372,0.0007864098,0.00001747671,0.0002418096,0.00101763],"genre_scores_gemma":[0.9642698,0.004488218,0.02905584,0.00004251116,0.00003900094,0.001911348,0.0000464631,0.000007435061,0.0001393846],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9631806,"threshold_uncertainty_score":0.3517454,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W75423781","doi":"","title":"Broadcasting in Hierarchical Tree Cluster Network.","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Broadcasting (networking); Computer science; Cluster (spacecraft); Tree (set theory); Computer network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01123685611483752,"gpt":0.2642936891171779,"spread":0.2530568330023404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002512089,0.0001492772,0.000162944,0.00009141461,0.000262016,0.0002467787,0.0004830105,0.0001437165,7.524355e-7],"category_scores_gemma":[0.00002767584,0.0001360637,0.00001711671,0.0006840008,0.0001304641,0.0001999899,0.0004952546,0.0003878127,0.000001554415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001117129,"about_ca_system_score_gemma":0.00002998295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001480531,"about_ca_topic_score_gemma":0.00005194162,"domain_scores_codex":[0.9988755,0.00001468429,0.0002316334,0.0004412819,0.0001016763,0.000335225],"domain_scores_gemma":[0.9993756,0.00006862974,0.00006633264,0.0003282539,0.00004877181,0.0001123825],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006346316,0.00004581411,0.002717774,0.00002322651,0.000002135248,0.000003266888,0.0000571429,0.00008289614,0.0003179051,0.05228656,0.001225644,0.9432313],"study_design_scores_gemma":[0.0007345901,0.0001419477,0.01594481,0.0002039323,0.00001741535,0.0003064958,0.00005072795,0.1826691,0.0007476742,0.4014305,0.3967085,0.001044316],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006860202,0.000344916,0.9851933,0.005221012,0.00001200566,0.0004013275,0.0000086326,0.0008903464,0.00106828],"genre_scores_gemma":[0.5675704,0.00005140809,0.4315164,0.0001841547,0.00008692225,0.0005402233,0.00001779147,0.000007073547,0.00002556566],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.942187,"threshold_uncertainty_score":0.5548517,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W118959728","doi":"","title":"Parallel Unstructured Grids Package for the solution of CFD problems on parallel computers","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science; Polygon mesh; Grid; Computational science; Parallel computing; Set (abstract data type); Fortran; Hexahedron; Node (physics); Mesh generation; Computational fluid dynamics; Construct (python library); Unstructured grid; Finite element method; Programming language; Computer graphics (images); Engineering; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01501437951705009,"gpt":0.2657034489336531,"spread":0.250689069416603,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003588191,0.0002602219,0.0002733075,0.00009582068,0.0007522185,0.0002487405,0.0006810491,0.0001761611,0.000001125221],"category_scores_gemma":[0.00002572044,0.0001920756,0.00007484357,0.0003673617,0.0003036937,0.0002096323,0.0001969811,0.0002840852,4.983243e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001322553,"about_ca_system_score_gemma":0.0000608613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002362571,"about_ca_topic_score_gemma":0.000005316549,"domain_scores_codex":[0.998538,0.00003189586,0.0004196139,0.0005236853,0.0001809354,0.0003058963],"domain_scores_gemma":[0.9985965,0.0002079705,0.0003242286,0.0005427604,0.0002180937,0.0001104364],"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.00009697615,0.000382489,0.0004800578,0.0004462784,0.00006896771,0.000001203583,0.0004863628,0.005661103,0.003036664,0.4669664,0.0069698,0.5154037],"study_design_scores_gemma":[0.001595467,0.0004962725,0.001905603,0.000227447,0.00009149768,0.000116577,0.00005794881,0.7114491,0.00428192,0.1735888,0.1051567,0.001032516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000280631,0.000548352,0.9947003,0.002234271,0.00003810459,0.001237667,0.00006517937,0.000671282,0.0002242613],"genre_scores_gemma":[0.4433223,0.0003670627,0.5550108,0.000144807,0.00008945564,0.0009168879,0.0001058819,0.0000148265,0.00002803137],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7057881,"threshold_uncertainty_score":0.7832614,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W52060701","doi":"","title":"Characterizing the Sort Operation on Multithreaded Architectures.","year":2008,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; University of British Columbia","funders":"","keywords":"Multithreading; Computer science; sort; Parallel computing; Simultaneous multithreading; Parallelism (grammar); Computer architecture; Thread (computing); Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02230463384452337,"gpt":0.2670060467738838,"spread":0.2447014129293605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001446378,0.0001530419,0.0001285956,0.0000591886,0.001075031,0.0001920364,0.0003191323,0.00006830213,9.82302e-7],"category_scores_gemma":[0.000009392123,0.0001078938,0.00002475722,0.0002253209,0.0001500591,0.00012247,0.0001283265,0.0001694944,0.000001676275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001253845,"about_ca_system_score_gemma":0.00003475407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001249122,"about_ca_topic_score_gemma":6.450863e-7,"domain_scores_codex":[0.9991205,0.00003323485,0.0001986475,0.0003505562,0.0001230087,0.0001739961],"domain_scores_gemma":[0.9994275,0.00004755071,0.0001022346,0.0002904522,0.00006400741,0.00006824786],"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.00005429798,0.0004337242,0.001635487,0.0001285968,0.00003473868,0.00001592101,0.002230881,0.002186421,0.00243186,0.1340741,0.002810077,0.8539639],"study_design_scores_gemma":[0.001336655,0.0004817171,0.01306745,0.0003112069,0.00004807033,0.001333646,0.0001206529,0.6105688,0.02778359,0.05112123,0.2919558,0.001871144],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002667437,0.0004394374,0.992436,0.002397239,0.000006166624,0.0004218788,0.00001233358,0.0008634544,0.0007560606],"genre_scores_gemma":[0.8560821,0.0005136852,0.1421599,0.0005559032,0.00007606969,0.0004865392,0.00006069325,0.000009324782,0.00005569404],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8534147,"threshold_uncertainty_score":0.8268375,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1517869332","doi":"","title":"Leader Election in Rings with Nonunique Labels.","year":2003,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Distributed systems and fault tolerance","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":"Université du Québec en Outaouais; University of Ottawa","funders":"","keywords":"Asynchronous communication; Leader election; Upper and lower bounds; Ring (chemistry); Computer science; Node (physics); Combinatorics; Time complexity; Binary logarithm; Identifier; Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.009252120761576041,"gpt":0.2432098328081127,"spread":0.2339577120465366,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001641126,0.0001391876,0.0001534988,0.000060942,0.0002177651,0.0002008468,0.0001470128,0.00008008637,9.494253e-7],"category_scores_gemma":[0.000005116702,0.0001157674,0.00001184006,0.0005645222,0.00007087612,0.0003111789,0.00003156051,0.0001388389,8.655689e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002264101,"about_ca_system_score_gemma":0.00004689355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000438586,"about_ca_topic_score_gemma":0.00001647549,"domain_scores_codex":[0.9991149,0.00002518964,0.0001908143,0.0003654321,0.00009054884,0.0002131573],"domain_scores_gemma":[0.9995553,0.00001609767,0.00008518361,0.0001897215,0.00007773502,0.00007588439],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000300805,0.000430813,0.01329832,0.000375267,0.00001876793,0.00001902647,0.0004774528,0.0001034364,0.001170435,0.7037564,0.0007405314,0.2795795],"study_design_scores_gemma":[0.002242504,0.0003646218,0.009304209,0.000661566,0.00003504623,0.0009931707,0.0004139607,0.02222006,0.009437228,0.07212755,0.8805265,0.001673629],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002422123,0.001048041,0.9932577,0.0004695971,0.00000376186,0.0003638763,0.00001395336,0.0002676055,0.002153343],"genre_scores_gemma":[0.9410978,0.0001918281,0.05780415,0.00007560683,0.00001553603,0.0006986622,0.00002837818,0.000007921276,0.0000801446],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9386756,"threshold_uncertainty_score":0.472086,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W194313425","doi":"","title":"Distributed Model for Collaborative Computing.","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","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":"Université du Québec à Chicoutimi; Université du Québec","funders":"","keywords":"Computer science; Distributed computing; Architecture; Mobile computing; Mobile device; Autonomic computing; Utility computing; Computer network; Cloud computing; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01802702160212004,"gpt":0.2832215838097701,"spread":0.2651945622076501,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003201219,0.0002659264,0.0002950705,0.00006665204,0.0008251011,0.0005500494,0.0005145452,0.0001766291,6.329176e-7],"category_scores_gemma":[0.00002622556,0.0002448762,0.00004934514,0.0005167668,0.0001761196,0.0002696602,0.0002306278,0.0002423739,0.000001180599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001495976,"about_ca_system_score_gemma":0.0001269046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008291211,"about_ca_topic_score_gemma":0.000004804721,"domain_scores_codex":[0.9984553,0.00002225875,0.0003754323,0.00063105,0.0001426127,0.0003733285],"domain_scores_gemma":[0.9987003,0.0001130443,0.0002282498,0.0003899818,0.0003624648,0.0002059453],"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.00004631466,0.0003644041,0.0007505263,0.0004251498,0.00004838844,0.000003539212,0.000711583,0.00252484,0.001406966,0.7206442,0.007407354,0.2656668],"study_design_scores_gemma":[0.0004276315,0.00005106659,0.0001457312,0.0000396943,0.00001977578,0.00005400892,0.00004601881,0.8547674,0.0001771987,0.03729246,0.1065947,0.0003842255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001025585,0.0005059271,0.9944617,0.001029046,0.00002957755,0.0009577606,0.0007713704,0.0008368971,0.0003821343],"genre_scores_gemma":[0.7440716,0.00004449768,0.2545587,0.00007656152,0.0001113747,0.0005122694,0.0005681862,0.00001297589,0.00004386773],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8522426,"threshold_uncertainty_score":0.9985762,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}