{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Cosmin E. Oancea","is_ca":true},{"name":"Jason W. A. Selby","is_ca":true},{"name":"Mark Giesbrecht","is_ca":true},{"name":"Stephen M. Watt","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002079794,0.0004678052,0.0005490245,0.0003319156,0.0008284982,0.001854267,0.001616618,0.001190982,0.00377153],"category_scores_gemma":[0.006250851,0.0004331875,0.0004924996,0.0004664257,0.001679135,0.002744266,0.001355706,0.00173437,0.0004583208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001494102,"about_ca_system_score_gemma":0.001459882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002289947,"about_ca_topic_score_gemma":0.0018749,"domain_scores_codex":[0.9986026,0.0005877346,0.00005996482,0.0001971454,0.0004059847,0.0001466784],"domain_scores_gemma":[0.9943575,0.002944622,0.0004558678,0.001408143,0.0006111446,0.0002226803],"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.0005367832,0.0002066362,0.003758756,0.0001206221,0.00007922417,0.0005724235,0.0004491911,0.6702146,0.009760295,0.2824743,0.003312166,0.02851504],"study_design_scores_gemma":[0.00004381074,0.00005156921,0.0001120449,0.000006368679,0.00001475169,0.00005139119,0.00001982499,0.951659,0.001407991,0.04441385,0.002212333,0.000007072933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.138598,0.00111575,0.8411887,0.001379077,0.0003145217,0.0001321683,0.0001203463,0.001431503,0.01571986],"genre_scores_gemma":[0.936344,0.0002442183,0.05843344,0.0001212898,0.00009826462,0.0001478552,0.00006544312,0.00007444694,0.004471115],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00377153,"threshold_uncertainty_score":0.01261705,"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","authors":[{"name":"Serguei A. Mokhov","is_ca":false},{"name":"Lee Wei Huynh","is_ca":false},{"name":"Jian Li","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002052819,0.0006751997,0.0006467717,0.0006528862,0.001404112,0.001880209,0.003522516,0.001201187,0.008655913],"category_scores_gemma":[0.006244839,0.0003903321,0.0003948091,0.0006628462,0.0004184277,0.003055438,0.00208632,0.0009241381,0.002984134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000817352,"about_ca_system_score_gemma":0.001640365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004489043,"about_ca_topic_score_gemma":0.005917519,"domain_scores_codex":[0.9987967,0.0002842591,0.00006718878,0.0001560765,0.0004501373,0.0002455525],"domain_scores_gemma":[0.9975005,0.0005968558,0.0001380367,0.0008657696,0.0006448701,0.0002540132],"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.002145973,0.0005045505,0.01081792,0.0008000919,0.000260966,0.001182349,0.0008849106,0.1412311,0.02825792,0.08396533,0.1443169,0.585632],"study_design_scores_gemma":[0.0002761811,0.000455649,0.002031635,0.0001178215,0.00009617321,0.0006534481,0.000339453,0.758296,0.02605016,0.04093146,0.1706431,0.0001089385],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1595672,0.003205581,0.7375104,0.002411856,0.001381027,0.0008976407,0.001567283,0.02809888,0.06536013],"genre_scores_gemma":[0.5391613,0.000810362,0.4294383,0.000282687,0.0002913216,0.0004588984,0.002381962,0.0008876292,0.02628755],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008655913,"threshold_uncertainty_score":0.02895689,"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","authors":[{"name":"Amir Hossein Pourteymour","is_ca":false},{"name":"Emil Vassev","is_ca":true},{"name":"Joey Paquet","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006483792,0.0003662015,0.0002545083,0.0002751721,0.0003809653,0.001083506,0.001757266,0.0006028558,0.00509702],"category_scores_gemma":[0.00135173,0.0003096584,0.0002915902,0.0002245142,0.0003098427,0.0006738565,0.0007243718,0.0006471672,0.001642723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000615747,"about_ca_system_score_gemma":0.001151557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002268214,"about_ca_topic_score_gemma":0.003669689,"domain_scores_codex":[0.9996209,0.0001142138,0.00002360159,0.00005835364,0.0001099518,0.00007287523],"domain_scores_gemma":[0.9995999,0.00008188864,0.00003217834,0.0001208259,0.0001253906,0.00003993972],"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.002158516,0.0008908007,0.01192776,0.00146795,0.0003166172,0.001308432,0.001577512,0.2132693,0.2790648,0.0789253,0.0479025,0.3611906],"study_design_scores_gemma":[0.0005760317,0.001104355,0.004497183,0.0001193526,0.0002087114,0.0004977853,0.0003568219,0.6872355,0.169122,0.0160193,0.1201939,0.00006896041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1420552,0.0005556028,0.8038209,0.0007446062,0.0002432807,0.001073795,0.0005836571,0.01568677,0.03523626],"genre_scores_gemma":[0.5883893,0.0003371272,0.3912935,0.0003686318,0.00004369065,0.0006880164,0.001343726,0.0009688495,0.01656711],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00509702,"threshold_uncertainty_score":0.01705128,"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","authors":[{"name":"Hovhannes A. Harutyunyan","is_ca":true},{"name":"Edward Maraachlian","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007376876,0.0006132331,0.0007282523,0.0008787108,0.0009479175,0.001361338,0.001808225,0.0009725402,0.01226526],"category_scores_gemma":[0.005239257,0.0003713269,0.0003718419,0.001365148,0.0009248362,0.002539576,0.001912363,0.001373638,0.003295239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001761558,"about_ca_system_score_gemma":0.002777423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008624855,"about_ca_topic_score_gemma":0.01313272,"domain_scores_codex":[0.9992282,0.0002496609,0.00003630267,0.0001343035,0.0001731879,0.0001782696],"domain_scores_gemma":[0.9983031,0.001040652,0.00009903205,0.0002309943,0.0002437881,0.0000824699],"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.001430961,0.0004809754,0.001012134,0.0006921712,0.0001463192,0.0001217571,0.0005930762,0.2681045,0.005771358,0.1804196,0.05322827,0.4879989],"study_design_scores_gemma":[0.0004905476,0.0002156558,0.0002439288,0.00005145594,0.00004939954,0.00009575857,0.0001669739,0.8492265,0.003258561,0.1361596,0.01001088,0.00003074691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02421618,0.001065241,0.9487448,0.001173842,0.0001406877,0.0002295512,0.0005281312,0.002646351,0.02125519],"genre_scores_gemma":[0.3237367,0.0008169927,0.6447072,0.0006279196,0.0001836729,0.0008501709,0.001480198,0.0003868457,0.0272103],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01226526,"threshold_uncertainty_score":0.04103142,"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","authors":[{"name":"Andrew Stevenson","is_ca":false},{"name":"Steve MacDonald","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002016444,0.0006597281,0.0005230638,0.0004261451,0.0006073163,0.001470753,0.001738269,0.000855654,0.001955143],"category_scores_gemma":[0.004221862,0.0005508176,0.0005248924,0.0007167468,0.0007583455,0.002072147,0.001097298,0.001872441,0.001397252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005794764,"about_ca_system_score_gemma":0.0008956651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002155452,"about_ca_topic_score_gemma":0.00204117,"domain_scores_codex":[0.9984747,0.0003533936,0.00008537994,0.0001473256,0.0007785206,0.000160759],"domain_scores_gemma":[0.9981142,0.0006902813,0.0003086352,0.0005442291,0.0002472303,0.00009541616],"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.001771929,0.001417312,0.007604346,0.001081648,0.0002495994,0.001533118,0.001672839,0.1257585,0.1813021,0.1275125,0.03705302,0.5130431],"study_design_scores_gemma":[0.0004535267,0.0003855446,0.004406031,0.0001015357,0.0001886875,0.001391665,0.0001238424,0.6648619,0.1025465,0.02808472,0.1972892,0.0001667277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06374808,0.00142596,0.8640015,0.0005748547,0.000267145,0.0005915018,0.0002846549,0.03328961,0.03581678],"genre_scores_gemma":[0.3238251,0.0008646242,0.6573661,0.0004634302,0.0001187423,0.0005724461,0.0008925915,0.003943233,0.01195372],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002155452,"threshold_uncertainty_score":0.01066411,"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","authors":[{"name":"Ben Huang","is_ca":true},{"name":"Michael Bauer","is_ca":true},{"name":"Michael Katchabaw","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00170097,0.0004032591,0.0002398224,0.0007165953,0.0008592027,0.001110943,0.0006478979,0.0004154132,0.001637774],"category_scores_gemma":[0.007762887,0.0001489748,0.00015805,0.001640189,0.0005505334,0.00184653,0.0007728026,0.0004288183,0.0005206182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001344475,"about_ca_system_score_gemma":0.0007193715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006366957,"about_ca_topic_score_gemma":0.002683561,"domain_scores_codex":[0.9983318,0.0004122093,0.0000559946,0.0002330242,0.0007830358,0.0001837774],"domain_scores_gemma":[0.9974542,0.001049207,0.0003276513,0.0002923422,0.0006803281,0.0001961375],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001309754,0.0003942952,0.1381291,0.0007091622,0.0002014413,0.00128518,0.002148869,0.5822344,0.04533723,0.03872182,0.02139674,0.1681321],"study_design_scores_gemma":[0.00009063308,0.001108803,0.1147382,0.0001187767,0.0001259825,0.001314426,0.001575712,0.7600614,0.05196623,0.03153021,0.03723009,0.0001395229],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9381044,0.003620831,0.03082964,0.0007813816,0.000267188,0.00005080374,0.0005483414,0.001675032,0.02412236],"genre_scores_gemma":[0.9956285,0.0004052774,0.002458579,0.000020993,0.00001984348,0.00001742083,0.0003903284,0.00006710135,0.0009920035],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006366957,"threshold_uncertainty_score":0.01265979,"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","authors":[{"name":"Tony White","is_ca":true},{"name":"B. Pagurek","is_ca":true},{"name":"Dwight Deugo","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001891706,0.0005647654,0.0007536559,0.0006853431,0.0009628067,0.002635576,0.002177884,0.001594871,0.0009883723],"category_scores_gemma":[0.01050624,0.0004705792,0.0004962679,0.0006218553,0.004019673,0.004539873,0.002433878,0.002892454,0.0003403962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008153524,"about_ca_system_score_gemma":0.001209553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001481604,"about_ca_topic_score_gemma":0.002112389,"domain_scores_codex":[0.9990703,0.0004578578,0.00004442184,0.0001173313,0.0002504833,0.00005958078],"domain_scores_gemma":[0.9950735,0.003171647,0.0004781506,0.0004789322,0.0004634607,0.0003342966],"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.00009541937,0.0001630169,0.002248548,0.0004246432,0.0001026309,0.0001907953,0.001532365,0.3292644,0.001753683,0.4378992,0.005950032,0.2203752],"study_design_scores_gemma":[0.00004776411,0.00006523726,0.0002540637,0.00007141737,0.00002243335,0.0001006213,0.0002211731,0.560158,0.001028899,0.4189378,0.0190659,0.00002660962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0258938,0.004462875,0.9506761,0.005461741,0.0002009512,0.0001001986,0.00001699825,0.0004067135,0.01278065],"genre_scores_gemma":[0.453528,0.006277609,0.5322688,0.0005636356,0.0004402309,0.0002658464,0.0000473326,0.0001393804,0.006469218],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002635576,"threshold_uncertainty_score":0.0100044,"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","authors":[{"name":"Hovhannes A. Harutyunyan","is_ca":true},{"name":"Edward Maraachlian","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004080785,0.000167023,0.0003950941,0.0005184831,0.0009620907,0.0006750379,0.000838867,0.0004109862,0.002605058],"category_scores_gemma":[0.001578541,0.0001838845,0.0001558548,0.0008234582,0.0003340336,0.001024326,0.000570948,0.0003613616,0.0007781208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001072366,"about_ca_system_score_gemma":0.0008672953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008050746,"about_ca_topic_score_gemma":0.008330104,"domain_scores_codex":[0.9996244,0.0001209866,0.00001419942,0.00005764167,0.0001133469,0.00006942867],"domain_scores_gemma":[0.9992672,0.0002488975,0.00006125897,0.0001037292,0.0002306921,0.00008819576],"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.001367248,0.0002299457,0.005628174,0.0008717497,0.0001380561,0.0009102624,0.001323452,0.2900151,0.05646218,0.2258053,0.07464073,0.3426079],"study_design_scores_gemma":[0.0001059206,0.0001928113,0.002093339,0.00004376833,0.00009617815,0.0003478649,0.0004302625,0.8944646,0.01212109,0.05823569,0.03183176,0.00003669789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2116984,0.004779122,0.7219884,0.001633513,0.0004882802,0.0002826909,0.0009709936,0.00344399,0.05471461],"genre_scores_gemma":[0.8757274,0.001593151,0.103436,0.0001571641,0.0001379819,0.000154201,0.0007430001,0.0001506506,0.01790042],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008050746,"threshold_uncertainty_score":0.01600778,"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","authors":[{"name":"Dulcenéia Becker","is_ca":false},{"name":"João Barbosa","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001392424,0.001875853,0.002199916,0.001614207,0.0007163013,0.001873921,0.00299404,0.001179313,0.1395703],"category_scores_gemma":[0.00382629,0.001003151,0.001234974,0.00188968,0.0006367566,0.002110498,0.002794746,0.004396467,0.08523193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006903053,"about_ca_system_score_gemma":0.002091352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002018925,"about_ca_topic_score_gemma":0.001778646,"domain_scores_codex":[0.9989354,0.0002465261,0.00007161339,0.00008964377,0.0005530812,0.0001037552],"domain_scores_gemma":[0.9984589,0.0004465581,0.00009667716,0.0003813376,0.0004700635,0.0001465928],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000126012,0.0001169229,0.0003743598,0.0007748706,0.0001410121,0.0002344544,0.000170156,0.01213925,0.004434389,0.09294976,0.7027135,0.1858252],"study_design_scores_gemma":[0.0003335339,0.00006238413,0.000594402,0.000178591,0.00005478465,0.0003335404,0.00002621756,0.06649722,0.003992916,0.04761226,0.8802484,0.00006570498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001284683,0.002357414,0.8429294,0.001145047,0.001523518,0.0007764188,0.02102493,0.06664103,0.0623174],"genre_scores_gemma":[0.01419586,0.002740967,0.8356581,0.0008947735,0.0006259994,0.003884288,0.04479266,0.02402252,0.07318494],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1395703,"threshold_uncertainty_score":0.4669091,"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","authors":[{"name":"Layali Rashid","is_ca":true},{"name":"Wessam Hassanein","is_ca":true},{"name":"Moustafa A. Hammad","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006456687,0.0005166144,0.0003597679,0.000743141,0.0005364558,0.001468816,0.0007688997,0.0004487633,0.003141657],"category_scores_gemma":[0.003223616,0.0002612982,0.0003561518,0.001368328,0.0007498661,0.003255586,0.0005003409,0.0006952527,0.0008122757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006068092,"about_ca_system_score_gemma":0.0008406234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001299207,"about_ca_topic_score_gemma":0.001480674,"domain_scores_codex":[0.9992492,0.00008535528,0.0000431246,0.0001122097,0.0003749688,0.0001350962],"domain_scores_gemma":[0.9984627,0.0005703325,0.0002300669,0.0003131212,0.0003663771,0.00005745598],"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.001194581,0.0002555014,0.02036699,0.001143813,0.0002005694,0.0004983486,0.0007502249,0.183941,0.2141463,0.2596609,0.01390368,0.3039381],"study_design_scores_gemma":[0.00008544856,0.0004188312,0.007242746,0.00006833042,0.0001201606,0.000889796,0.0003314408,0.598561,0.1960791,0.1364679,0.05965482,0.00008035613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.311022,0.00326963,0.6604277,0.0004341444,0.0003115883,0.0002216424,0.0006848939,0.002867473,0.02076089],"genre_scores_gemma":[0.8295493,0.001756824,0.1585234,0.000179333,0.000105802,0.0002076843,0.001152018,0.0005605604,0.007964981],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003141657,"threshold_uncertainty_score":0.01050991,"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","authors":[{"name":"Stefan Dobrev","is_ca":true},{"name":"Andrzej Pelc","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00242355,0.0004893027,0.0009000406,0.0004093565,0.001579426,0.001426523,0.001579999,0.001217929,0.00211796],"category_scores_gemma":[0.005653482,0.0004126646,0.000525763,0.0006872686,0.001111688,0.00403853,0.001639713,0.00112317,0.0008535246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005510988,"about_ca_system_score_gemma":0.0005218216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004521195,"about_ca_topic_score_gemma":0.0006161354,"domain_scores_codex":[0.9983323,0.0007150046,0.00005991978,0.0003103747,0.0002725066,0.0003099334],"domain_scores_gemma":[0.9947149,0.003574553,0.0007186601,0.0004612494,0.0002709568,0.0002596125],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001478937,0.0003569558,0.003079234,0.0008005651,0.000124087,0.001120341,0.001076359,0.4563,0.02288829,0.3597689,0.01062733,0.142379],"study_design_scores_gemma":[0.0002706054,0.0003283909,0.0004997042,0.00002908877,0.00005426087,0.0003701673,0.0003171208,0.7856112,0.009967062,0.1898243,0.01268816,0.00004006008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08772923,0.001438136,0.9008036,0.001176972,0.0002098237,0.0001687303,0.00010425,0.0005225299,0.007846798],"genre_scores_gemma":[0.606451,0.001166619,0.3803362,0.0002107822,0.0002898305,0.0003105521,0.0002506615,0.00008789592,0.01089641],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00242355,"threshold_uncertainty_score":0.01281714,"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","authors":[{"name":"Farzad Amirjavid","is_ca":true},{"name":"Hamid Mcheick","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002713479,0.001386941,0.001267641,0.001462276,0.002423706,0.005968524,0.003932959,0.004418949,0.01144913],"category_scores_gemma":[0.004249047,0.0005687681,0.001790163,0.002139881,0.003787157,0.006695534,0.004569733,0.004225083,0.005383858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003744373,"about_ca_system_score_gemma":0.003303631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004112637,"about_ca_topic_score_gemma":0.003353968,"domain_scores_codex":[0.995136,0.001462894,0.0004445888,0.001093562,0.001497187,0.0003657189],"domain_scores_gemma":[0.9979864,0.0005465591,0.0001762882,0.000655472,0.0003836202,0.000251561],"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.00001171323,0.00001732041,0.00006420563,0.00008527486,0.00001936714,0.0001414784,0.0001447816,0.004288437,0.0002869495,0.9811072,0.00558881,0.008244454],"study_design_scores_gemma":[0.00006096061,0.00003579536,0.0000843674,0.00009745613,0.00003907634,0.0004310847,0.00008678582,0.04791272,0.0004268604,0.7456533,0.2051383,0.00003328863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001783352,0.005724485,0.871416,0.005750556,0.001850764,0.0005421309,0.0004517252,0.0007932391,0.1116878],"genre_scores_gemma":[0.24271,0.01019823,0.6148845,0.004204411,0.002842398,0.003796504,0.001810267,0.0004557977,0.1190979],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01144913,"threshold_uncertainty_score":0.03830117,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}