{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":54,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":54,"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":"1657edd551df","filters":{"venue":"Parallel Processing Letters"}},"results":[{"id":"W1985919329","doi":"10.1142/s012962640600271x","title":"THREE COUNTEREXAMPLES TO DISPEL THE MYTH OF THE UNIVERSAL COMPUTER","year":2006,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Computability, Logic, AI Algorithms","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":"Queen's University","funders":"","keywords":"Turing machine; Counterexample; Computer science; Universal Turing machine; Computable function; Computation; Function (biology); Turing; Theoretical computer science; Discrete mathematics; Algorithm; Mathematics; Programming language","authors":[{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01298269266566102,"gpt":0.2118979385103161,"spread":0.1989152458446551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00526376,0.0008614049,0.0009085446,0.001747531,0.003624539,0.005785346,0.002488379,0.005612186,0.006496001],"category_scores_gemma":[0.02039795,0.0005645849,0.001392717,0.0007706386,0.03612125,0.01234255,0.006950262,0.007977565,0.001309642],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002459275,"about_ca_system_score_gemma":0.001092645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001256207,"about_ca_topic_score_gemma":0.0008036543,"domain_scores_codex":[0.995414,0.001936781,0.0001936042,0.0008472754,0.001025303,0.0005830076],"domain_scores_gemma":[0.9868109,0.008148219,0.0005215863,0.002957162,0.0009654822,0.0005967165],"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.00002006922,0.00001027036,0.00008176547,0.00002536445,0.000005956725,0.00005651233,0.0002046728,0.0004628726,0.00007012826,0.9942848,0.00323605,0.00154144],"study_design_scores_gemma":[0.00001742391,0.000009854982,0.00007621563,0.00003441036,0.000003994209,0.0001071429,0.0001062127,0.001680834,0.0002596686,0.9859464,0.01174498,0.00001291205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.09178342,0.01098717,0.2595125,0.2341972,0.005326627,0.000194045,0.000395332,0.001876833,0.3957268],"genre_scores_gemma":[0.9030404,0.003322673,0.04857644,0.0219712,0.002336477,0.0004754339,0.0001967842,0.0003597761,0.01972072],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006496001,"threshold_uncertainty_score":0.02783775,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964204686","doi":"10.1142/s0129626417400035","title":"A Comparison of Big Data Frameworks on a Layered Dataflow Model","year":2017,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"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 à Montréal","funders":"","keywords":"Dataflow; Computer science; SPARK (programming language); Abstraction; Big data; Semantics (computer science); Programming paradigm; Analytics; Programming language; Data modeling; Execution model; Theoretical computer science; Software engineering; Data science; Data mining","authors":[{"name":"Claudia Misale","is_ca":false},{"name":"Maurizio Drocco","is_ca":false},{"name":"Marco Aldinucci","is_ca":false},{"name":"Guy Tremblay","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1504414372039285,"gpt":0.3750884397476739,"spread":0.2246470025437454,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006702161,0.0008732728,0.0008649687,0.00161065,0.001351426,0.005973743,0.003215521,0.001657885,0.002649171],"category_scores_gemma":[0.01191977,0.0007960849,0.00231178,0.002054364,0.002581168,0.007771891,0.004355818,0.00297969,0.0005333617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00275503,"about_ca_system_score_gemma":0.004836983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01056042,"about_ca_topic_score_gemma":0.006109865,"domain_scores_codex":[0.9951303,0.001203122,0.000326201,0.0004541919,0.002119834,0.0007663608],"domain_scores_gemma":[0.9927938,0.002281358,0.0003589742,0.002343548,0.001259967,0.0009624656],"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.0006830432,0.0003002487,0.004257258,0.0003649145,0.0001535896,0.0003281609,0.00116818,0.1259095,0.004110515,0.802927,0.005844811,0.05395282],"study_design_scores_gemma":[0.0001371418,0.0002796912,0.002362282,0.0002929111,0.0001286019,0.0003293928,0.0007126798,0.7004786,0.005409493,0.2441483,0.04554745,0.0001734223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1207305,0.003086976,0.8379721,0.002496892,0.000325433,0.0003653722,0.0005190773,0.005255705,0.02924801],"genre_scores_gemma":[0.6266447,0.002402418,0.3619505,0.000665132,0.0001259725,0.0004053365,0.001096486,0.001189601,0.005519826],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01056042,"threshold_uncertainty_score":0.0354448,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1658056400","doi":"10.1142/s0129626412500089","title":"DETERMINISTIC SAMPLE SORT FOR GPUS","year":2012,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"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":"Merge sort; sort; Computer science; Sorting algorithm; Parallel computing; Sorting; Sample (material); Algorithm","authors":[{"name":"Frank Dehne","is_ca":true},{"name":"Hamidreza Zaboli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03016900520291681,"gpt":0.2870489943193223,"spread":0.2568799891164055,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008071439,0.0005526746,0.0007612703,0.0005154234,0.0009315978,0.002135631,0.001707626,0.0007351748,0.009191922],"category_scores_gemma":[0.005219056,0.000363868,0.0006127727,0.001453209,0.0009047083,0.002592745,0.001903902,0.001419209,0.00176894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001684906,"about_ca_system_score_gemma":0.002980045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006479319,"about_ca_topic_score_gemma":0.009156344,"domain_scores_codex":[0.9978914,0.0003115124,0.0001354502,0.000347123,0.00100836,0.0003060705],"domain_scores_gemma":[0.9973597,0.0006678452,0.0001703896,0.00108918,0.0006016362,0.0001113064],"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.001477926,0.0001955248,0.003305377,0.000519671,0.0001438873,0.0001888954,0.0002245804,0.2019381,0.03194714,0.3708692,0.04429526,0.3448944],"study_design_scores_gemma":[0.0001532328,0.0001300993,0.0005235864,0.00002813784,0.00003674713,0.0001454861,0.00005665534,0.8016429,0.02955446,0.1301644,0.03752044,0.00004374751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03097401,0.0004754303,0.9528952,0.0006051285,0.0002775259,0.0000881975,0.0005137905,0.005577154,0.008593625],"genre_scores_gemma":[0.4150953,0.0003711059,0.5735593,0.000562239,0.0001158646,0.0002521319,0.001109875,0.0008182109,0.008115897],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009191922,"threshold_uncertainty_score":0.0307501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016502207","doi":"10.1142/s0129626409000079","title":"TOWARDS A FRAMEWORK FOR INTUITIVE PROGRAMMING OF CELLULAR AUTOMATA","year":2009,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":17,"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":"Cellular automaton; Computer science; Asynchronous cellular automaton; Theoretical computer science; Mobile automaton; Automaton; Simple (philosophy); Computation; Genetic programming; Programmer; Distributed computing; Automata theory; Programming language; Algorithm; Artificial intelligence","authors":[{"name":"Sami Torbey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01949142500402901,"gpt":0.2830307755182556,"spread":0.2635393505142266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003122563,0.001147791,0.001057105,0.001164782,0.001318771,0.00405641,0.00364438,0.001993045,0.003480606],"category_scores_gemma":[0.004796601,0.001091207,0.002791109,0.001115951,0.0044208,0.004059527,0.003053258,0.005131674,0.001309878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001430687,"about_ca_system_score_gemma":0.002046824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001991789,"about_ca_topic_score_gemma":0.002499336,"domain_scores_codex":[0.9980806,0.0007213671,0.0001757998,0.000329335,0.0005486893,0.0001441135],"domain_scores_gemma":[0.9983323,0.0007074662,0.0001262037,0.0004014819,0.0003273174,0.0001052622],"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.00001090121,0.00001871065,0.00008636557,0.00007645693,0.00001039585,0.00007893594,0.0002729492,0.01848904,0.001588598,0.9671103,0.0008662545,0.01139106],"study_design_scores_gemma":[0.00003052083,0.00003922317,0.00005206722,0.00008253664,0.00002290705,0.00008988245,0.00009719065,0.1573682,0.001852714,0.8054662,0.0348715,0.00002711588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001015991,0.0001276379,0.9961348,0.0002562403,0.00003218579,0.00004809546,0.00002958546,0.0003982426,0.001957391],"genre_scores_gemma":[0.04642646,0.0004398602,0.9502318,0.0002231338,0.00007738379,0.0004151496,0.0001055851,0.0002470837,0.001833573],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00405641,"threshold_uncertainty_score":0.01651394,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2002346262","doi":"10.1142/s0129626410000223","title":"ON THE IMPORTANCE OF BEING QUANTUM","year":2010,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"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":"Champion; Tournament; Computer chess; Computer science; Quantum; Artificial intelligence; Center (category theory); Quantum computer; Natural (archaeology); Mathematics; Political science; Law; History; Quantum mechanics; Physics","authors":[{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009436269288148325,"gpt":0.2320773198067812,"spread":0.2226410505186329,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003160386,0.0003455198,0.0005958686,0.0006341941,0.006743655,0.007635143,0.0009494813,0.003460873,0.008912373],"category_scores_gemma":[0.007511726,0.0003189563,0.0003530949,0.0005207806,0.03651498,0.01009932,0.004715703,0.00457543,0.00116577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00205494,"about_ca_system_score_gemma":0.001650521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003904141,"about_ca_topic_score_gemma":0.003280031,"domain_scores_codex":[0.9979776,0.0008656775,0.00005703401,0.0003393215,0.0004101708,0.0003502861],"domain_scores_gemma":[0.9953434,0.002577708,0.0002453784,0.0006823298,0.0007019747,0.0004491723],"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.000009261664,0.000003372302,0.0000769473,0.00001065831,0.000001782404,0.00003262357,0.0008295766,0.00009865277,0.00007279445,0.9937174,0.001582688,0.003564283],"study_design_scores_gemma":[0.0000083701,0.00001709684,0.0003532926,0.00004703772,0.000005704908,0.00009051923,0.0008853871,0.0004518147,0.0001500214,0.9538871,0.04408737,0.00001637024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.05260286,0.00808519,0.04945748,0.1063853,0.003157124,0.00004978054,0.00009388828,0.0001112309,0.7800571],"genre_scores_gemma":[0.9570851,0.004964771,0.008109408,0.009931033,0.001378893,0.00007557415,0.00004371169,0.00008969562,0.01832174],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008912373,"threshold_uncertainty_score":0.0298149,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163564159","doi":"10.1142/s0129626407003058","title":"AUTHENTICATED QUANTUM KEY DISTRIBUTION WITHOUT CLASSICAL COMMUNICATION","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum key distribution; Computer science; Key (lock); Quantum; Channel (broadcasting); Quantum channel; Quantum cryptography; Theoretical computer science; Quantum capacity; Computer security; Computer network; Quantum network; Quantum computer; Quantum information; Quantum mechanics; Physics","authors":[{"name":"Naya Nagy","is_ca":true},{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01621309582930528,"gpt":0.2759224845860343,"spread":0.259709388756729,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003094403,0.0005705394,0.001008501,0.0007515649,0.001403634,0.003346825,0.002371398,0.002610123,0.00773339],"category_scores_gemma":[0.009366035,0.0004733225,0.0006224657,0.001228594,0.003541499,0.008027395,0.003625661,0.002786318,0.003478312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001201344,"about_ca_system_score_gemma":0.001783094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003071071,"about_ca_topic_score_gemma":0.0001920229,"domain_scores_codex":[0.9928637,0.002108673,0.0003761812,0.001209733,0.0029031,0.0005386468],"domain_scores_gemma":[0.9946238,0.001413726,0.0003764716,0.002448369,0.0009687571,0.0001689774],"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.0002365756,0.00004735596,0.00009706042,0.0001131903,0.00002852817,0.00009956029,0.0001536156,0.004914007,0.005888571,0.9441835,0.002488095,0.04174988],"study_design_scores_gemma":[0.0001648296,0.0002053741,0.0001097809,0.00008171873,0.00004628033,0.0004334409,0.0000802926,0.1322201,0.02317225,0.7902473,0.0531458,0.00009271406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009940786,0.0006964906,0.9648367,0.001251449,0.0004637164,0.0001641147,0.0001079825,0.0004860689,0.02205265],"genre_scores_gemma":[0.539329,0.001275951,0.4257263,0.001273675,0.0006714842,0.0005139985,0.0002856592,0.0002504354,0.03067359],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00773339,"threshold_uncertainty_score":0.02587074,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986045283","doi":"10.1142/s0129626409000031","title":"A short note on the surface area of star graphs","year":2009,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Star (game theory); Surface (topology); Mathematics; Computer science; Function (biology); Combinatorics; Discrete mathematics; Geometry; Mathematical analysis","authors":[{"name":"Eddie Cheng","is_ca":false},{"name":"Ke Qiu","is_ca":true},{"name":"Zhizhang Shen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04862565962892929,"gpt":0.3028729877952868,"spread":0.2542473281663575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007715042,0.001074325,0.0009618124,0.001800076,0.001170531,0.001747434,0.001321319,0.001178799,0.007304943],"category_scores_gemma":[0.002706014,0.0003986649,0.001190068,0.001643721,0.001576064,0.004895641,0.001567368,0.003423442,0.00284503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005937076,"about_ca_system_score_gemma":0.0002493079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005064539,"about_ca_topic_score_gemma":0.0004580779,"domain_scores_codex":[0.9995797,0.00008224215,0.00003157196,0.0001033178,0.0001588141,0.00004425205],"domain_scores_gemma":[0.9989098,0.0006438777,0.00005995867,0.0001127587,0.0001874047,0.00008605704],"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.00004249535,0.000031164,0.0003389887,0.000265522,0.00002984742,0.0005617134,0.0001990414,0.003521986,0.007002792,0.8846226,0.04096535,0.0624184],"study_design_scores_gemma":[0.000007379183,0.00006688242,0.0004738646,0.00004249242,0.00002196518,0.000507345,0.00005002106,0.01177272,0.002550132,0.9086248,0.07584305,0.00003937244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0623946,0.03286927,0.6469955,0.02065311,0.04717878,0.00008395594,0.0008686639,0.002001132,0.186955],"genre_scores_gemma":[0.6122507,0.03181632,0.1720927,0.007608309,0.06427248,0.0001989639,0.001001681,0.003520649,0.1072382],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007304943,"threshold_uncertainty_score":0.02443743,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010477552","doi":"10.1142/s0129626407003009","title":"PARALLELISM IN QUANTUM INFORMATION PROCESSING DEFEATS THE UNIVERSAL COMPUTER","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"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; Parallelism (grammar); Quantum computer; Perspective (graphical); Information processing; Theoretical computer science; Quantum; Universal Turing machine; Parallel computing; Turing machine; Algorithm; Artificial intelligence; Computation","authors":[{"name":"Marius Nagy","is_ca":true},{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00850951637500192,"gpt":0.2249564432800873,"spread":0.2164469269050854,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002650624,0.0003635733,0.0008891938,0.0008117367,0.002089692,0.002929948,0.001520558,0.002149086,0.002230574],"category_scores_gemma":[0.006773173,0.0004522423,0.0005756428,0.0005292282,0.01158462,0.008468406,0.00320268,0.004111796,0.0004803455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001284273,"about_ca_system_score_gemma":0.001416278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006017361,"about_ca_topic_score_gemma":0.0005152777,"domain_scores_codex":[0.9981635,0.0005584827,0.00008286326,0.0003039824,0.0006580623,0.0002332163],"domain_scores_gemma":[0.9957936,0.002302099,0.0001921224,0.001222029,0.0002753704,0.0002148689],"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.00001933767,0.0000083299,0.00005783967,0.00002292144,0.000004280356,0.00002182196,0.0001131275,0.001393932,0.0007445437,0.9941187,0.0003208839,0.003174347],"study_design_scores_gemma":[0.00001324749,0.00002316674,0.00003496646,0.00001398518,0.000003615169,0.00002979282,0.00002886482,0.008612823,0.0008589663,0.987542,0.002829506,0.000009034005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2438921,0.00452138,0.5836279,0.02287715,0.001025886,0.0001335576,0.0001539652,0.001102094,0.142666],"genre_scores_gemma":[0.9597458,0.00106172,0.03435532,0.0007276443,0.0003202528,0.00008605607,0.00003014771,0.000101628,0.003571508],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002929948,"threshold_uncertainty_score":0.014018,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040195773","doi":"10.1142/s0129626406002472","title":"A PARALLEL PROBABILISTIC SYSTEM-LEVEL FAULT DIAGNOSIS APPROACH FOR LARGE MULTIPROCESSOR SYSTEMS","year":2006,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":11,"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; Probabilistic logic; A priori and a posteriori; Multiprocessing; Parallel algorithm; Identification (biology); Fault (geology); Node (physics); Parallel computing; Evolutionary algorithm; Computation; Algorithm; Artificial intelligence","authors":[{"name":"Mourad Elhadef","is_ca":true},{"name":"Kaouther Abrougui","is_ca":true},{"name":"Shantanu Das","is_ca":true},{"name":"Amiya Nayak","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03660718432135544,"gpt":0.2467189114810148,"spread":0.2101117271596594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005060555,0.0004050943,0.0004212573,0.0005278999,0.0004561561,0.00042469,0.0008466512,0.0007081804,0.001054],"category_scores_gemma":[0.001568023,0.000238501,0.0004762504,0.0003462736,0.0005219755,0.0006859874,0.0004962991,0.000600912,0.0002005596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006426135,"about_ca_system_score_gemma":0.0008414452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002488616,"about_ca_topic_score_gemma":0.002763515,"domain_scores_codex":[0.9996612,0.00006615924,0.00001434205,0.0000696956,0.0001606985,0.00002805243],"domain_scores_gemma":[0.9995579,0.0002144481,0.00005183012,0.00006221019,0.00009596047,0.00001764672],"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.00004537028,0.00004020534,0.000998548,0.00005175803,0.00003362036,0.0001380575,0.0000487732,0.8715819,0.009075021,0.01282222,0.0003462782,0.1048183],"study_design_scores_gemma":[0.000007920936,0.00001867443,0.0001553932,0.000002624447,0.000008324456,0.00007959923,0.000004650203,0.9902603,0.001882066,0.006928321,0.0006480834,0.000003949242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01157706,0.00007867838,0.9870712,0.000111216,0.00001017549,0.00002385038,0.00001044501,0.0003056528,0.0008116587],"genre_scores_gemma":[0.4081593,0.0001497531,0.5897423,0.00009142297,0.00002091111,0.0000891299,0.00005508247,0.00004854465,0.001643549],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002488616,"threshold_uncertainty_score":0.004948258,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150687976","doi":"10.1142/s0129626407003149","title":"A TAXONOMY OF TASK SCHEDULING ALGORITHMS IN THE GRID","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":10,"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; Distributed computing; Fair-share scheduling; Scheduling (production processes); Two-level scheduling; Grid; Grid computing; Dynamic priority scheduling; Architecture; Fixed-priority pre-emptive scheduling; Rate-monotonic scheduling; Algorithm; Mathematical optimization; Mathematics; Computer network; Quality of service","authors":[{"name":"Fangpeng Dong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0292541471935389,"gpt":0.2572351209769245,"spread":0.2279809737833856,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001527579,0.0009551916,0.0009861012,0.002078299,0.001480456,0.00302078,0.001964228,0.001820386,0.002280406],"category_scores_gemma":[0.003851477,0.0006352291,0.001094016,0.005333445,0.001023134,0.003638883,0.001001848,0.00216245,0.00189643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009926765,"about_ca_system_score_gemma":0.00170434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002598569,"about_ca_topic_score_gemma":0.001265192,"domain_scores_codex":[0.9985412,0.000309786,0.000251418,0.0002097665,0.0005553254,0.0001324662],"domain_scores_gemma":[0.9988936,0.0003626206,0.00007692674,0.0002459422,0.0003527312,0.00006830192],"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.00009884489,0.0001477497,0.001107882,0.00104789,0.00004582166,0.0002512632,0.0004497977,0.06016318,0.004474442,0.6382102,0.01771847,0.2762844],"study_design_scores_gemma":[0.00005980241,0.0001449066,0.000805854,0.0003076998,0.00003340077,0.0007606697,0.0002212707,0.2213006,0.002372774,0.5268307,0.2470818,0.00008053888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.006011646,0.0108646,0.9629441,0.001384494,0.0005114847,0.0004319529,0.0003679016,0.001266805,0.01621688],"genre_scores_gemma":[0.04181231,0.01729251,0.9326466,0.0004254133,0.0004220472,0.0006910139,0.0009633767,0.0002166202,0.005530129],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.00302078,"threshold_uncertainty_score":0.008078694,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066040291","doi":"10.1142/s0129626410000193","title":"KEY DISTRIBUTION VERSUS KEY ENHANCEMENT IN QUANTUM CRYPTOGRAPHY","year":2010,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"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":"Quantum cryptography; Quantum key distribution; Computer science; Cryptography; Key distribution; Key (lock); ID-based cryptography; Public-key cryptography; Theoretical computer science; Financial cryptography; Shared secret; Lattice-based cryptography; PKCS #1; Quantum information; Computer security; Quantum; Encryption; Quantum mechanics; Physics; Cryptosystem","authors":[{"name":"Naya Nagy","is_ca":true},{"name":"Marius Nagy","is_ca":true},{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0100230100663497,"gpt":0.2420302842438384,"spread":0.2320072741774887,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004356789,0.0006744245,0.001218923,0.000948061,0.001655902,0.002747036,0.001804373,0.003022689,0.004618619],"category_scores_gemma":[0.006627782,0.0004721232,0.0007587261,0.00153336,0.01350531,0.01543096,0.00346506,0.005294552,0.001327041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002244219,"about_ca_system_score_gemma":0.0008506585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002358291,"about_ca_topic_score_gemma":0.0001056286,"domain_scores_codex":[0.996466,0.001539796,0.0001515562,0.0005172035,0.0008871135,0.0004383145],"domain_scores_gemma":[0.9956601,0.002776622,0.0002970746,0.0009563829,0.0002047385,0.0001049711],"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.00002766589,0.000008701449,0.00001453626,0.00005326081,0.000001912126,0.00001700846,0.00005577434,0.0005517385,0.000441558,0.9947405,0.0002871758,0.00380024],"study_design_scores_gemma":[0.00003106455,0.00006051536,0.00002518502,0.00004828572,0.000006993574,0.0001173466,0.00003371845,0.0049651,0.001788495,0.9821445,0.0107646,0.00001419901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03120186,0.02499224,0.7506998,0.0201461,0.002142228,0.0002560813,0.00008932548,0.000327424,0.170145],"genre_scores_gemma":[0.8541387,0.01559888,0.1032603,0.003594691,0.003016653,0.0003487014,0.00004209692,0.0002100597,0.01978992],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004618619,"threshold_uncertainty_score":0.02304119,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996861426","doi":"10.1142/s0129626410000181","title":"ENTANGLEMENT VERIFICATION WITH AN APPLICATION TO QUANTUM KEY DISTRIBUTION PROTOCOLS","year":2010,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Information and Cryptography","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":"Quantum entanglement; Quantum key distribution; Computer science; Qubit; Quantum cryptography; Theoretical computer science; Protocol (science); Quantum teleportation; Bell state; Cryptography; Quantum network; Quantum; Quantum mechanics; Quantum information; Algorithm; Physics","authors":[{"name":"Marius Nagy","is_ca":true},{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01136226672523888,"gpt":0.2682450890524754,"spread":0.2568828223272365,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002735097,0.0005526322,0.0006468873,0.0009925531,0.0009733453,0.001451577,0.00120158,0.00156115,0.003286569],"category_scores_gemma":[0.008977471,0.0004153724,0.0006233215,0.001183852,0.003423784,0.002560697,0.00340248,0.002660312,0.0005880239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008000157,"about_ca_system_score_gemma":0.001136371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005346941,"about_ca_topic_score_gemma":0.000382816,"domain_scores_codex":[0.9976435,0.0009126689,0.0001117214,0.0002414298,0.0008897759,0.0002008978],"domain_scores_gemma":[0.9954967,0.002987102,0.0002064764,0.0008178995,0.0003592238,0.0001325613],"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.0001047948,0.0001211773,0.0003769969,0.0001243404,0.00002413335,0.0003528631,0.0002543728,0.04303482,0.01354189,0.8664346,0.001135658,0.07449444],"study_design_scores_gemma":[0.00006757786,0.0001334314,0.0001840718,0.00004088513,0.0000241125,0.0002797575,0.00002878105,0.5415895,0.02153834,0.4268007,0.00926211,0.00005072849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01649329,0.0002612014,0.9764157,0.0006205285,0.00008402422,0.0001327893,0.00002541774,0.0002563478,0.005710741],"genre_scores_gemma":[0.5748156,0.000604718,0.4185698,0.0002065802,0.0001996061,0.0003403508,0.00005523883,0.0001369035,0.005071145],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003286569,"threshold_uncertainty_score":0.01446474,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977041333","doi":"10.1142/s0129626411000072","title":"ON THE SURFACE AREAS AND AVERAGE DISTANCES OF MESHES AND TORI","year":2011,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Interconnection Networks and 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":"Brock University","funders":"","keywords":"Polygon mesh; Lemma (botany); Torus; Surface (topology); Graph; Mathematics; Product (mathematics); Computer science; Geometry; Combinatorics","authors":[{"name":"Eddie Cheng","is_ca":false},{"name":"Ke Qiu","is_ca":true},{"name":"Zhizhang Shen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02520157010959262,"gpt":0.2110040528763369,"spread":0.1858024827667443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006285512,0.0006556447,0.0005568553,0.002565417,0.0006440062,0.001509386,0.0008217264,0.0007024277,0.004985978],"category_scores_gemma":[0.005367757,0.0003135725,0.000433893,0.00146086,0.001858351,0.004304486,0.001331491,0.0008204769,0.0007630716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006097156,"about_ca_system_score_gemma":0.0001545416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005242562,"about_ca_topic_score_gemma":0.0003433273,"domain_scores_codex":[0.9995931,0.00009946443,0.0000191153,0.0001034003,0.0001233683,0.00006166411],"domain_scores_gemma":[0.9970432,0.001881046,0.0003082394,0.0002561658,0.0003111859,0.0002002399],"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.00004860936,0.00001898841,0.001368804,0.00007565227,0.0000170592,0.00009256107,0.0001915925,0.02928503,0.004487403,0.9392175,0.001290939,0.02390585],"study_design_scores_gemma":[0.00001039357,0.00005672874,0.002285404,0.00002195558,0.00001733434,0.000313756,0.0001334145,0.1363695,0.002252884,0.8532261,0.005289125,0.00002327481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4340695,0.004207899,0.4898304,0.0009137775,0.0001808959,0.00005174883,0.0005777727,0.0003994333,0.06976862],"genre_scores_gemma":[0.953388,0.002097052,0.0357684,0.00009795971,0.0004667708,0.0001038753,0.000488321,0.0002891163,0.007300602],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004985978,"threshold_uncertainty_score":0.01667976,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071889691","doi":"10.1142/s012962640700296x","title":"ASPECTS OF BIOMOLECULAR COMPUTING","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Membrane computing; DNA computing; Natural computing; Computer science; Unconventional computing; Field (mathematics); Computation; Process (computing); Theoretical computer science; Supercomputer; Distributed computing; Computational science; Parallel computing; Algorithm; Mathematics","authors":[{"name":"Naya Nagy","is_ca":true},{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01302765596491974,"gpt":0.2657766849819022,"spread":0.2527490290169824,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009877435,0.0007634909,0.000758046,0.00149973,0.001628361,0.004962681,0.001184342,0.002202514,0.009186395],"category_scores_gemma":[0.002933777,0.0003877579,0.0007085348,0.002270066,0.006582643,0.006594587,0.002239005,0.002916419,0.00310261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001765808,"about_ca_system_score_gemma":0.001055815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009608338,"about_ca_topic_score_gemma":0.0005191675,"domain_scores_codex":[0.9986494,0.0003873827,0.00007813582,0.0002301857,0.0005489903,0.0001060042],"domain_scores_gemma":[0.998767,0.0006134519,0.00006262222,0.0003206091,0.0001626093,0.00007373363],"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.000003682468,0.000005578968,0.00004402005,0.00008625862,0.000005004237,0.00002750528,0.00006585167,0.0006014151,0.0001389093,0.9864733,0.003832466,0.00871612],"study_design_scores_gemma":[0.000002786981,0.000004789306,0.00004544097,0.00004261731,0.000002195657,0.00007691993,0.00002575316,0.001122954,0.00008161905,0.9324106,0.06618095,0.000003422984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.007315665,0.1785073,0.2189694,0.03500422,0.004462095,0.0001302037,0.000395903,0.0005408478,0.5546745],"genre_scores_gemma":[0.5227773,0.2125811,0.1283377,0.01345669,0.02101851,0.0007161587,0.0008890379,0.0004793887,0.09974416],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009186395,"threshold_uncertainty_score":0.0307315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075815517","doi":"10.1142/s0129626401000506","title":"DYNAMIC LOAD BALANCERS FOR A MULTITHREADED MULTIPROCESSOR SYSTEM","year":2001,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"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; Parallel computing; Load balancing (electrical power); Multiprocessing; Synchronization (alternating current); Compiler; Compile time; Distributed computing; Runtime system; Operating system; Grid; Computer network","authors":[{"name":"Prasad Kakulavarapu","is_ca":false},{"name":"Olivier Maquelin","is_ca":false},{"name":"José Nelson Amaral","is_ca":true},{"name":"Guang R. Gao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01630186903638296,"gpt":0.2668241556119236,"spread":0.2505222865755406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000916998,0.0004165177,0.0005181306,0.000490392,0.0008343553,0.001205992,0.001202407,0.0003977692,0.001949301],"category_scores_gemma":[0.002611168,0.0003400472,0.000279522,0.0004557647,0.0005154172,0.001280494,0.0005838851,0.0006840256,0.0004477279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007040791,"about_ca_system_score_gemma":0.0007329062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001308637,"about_ca_topic_score_gemma":0.001783466,"domain_scores_codex":[0.9993545,0.0001386294,0.00005425494,0.0001233167,0.0002406613,0.00008863809],"domain_scores_gemma":[0.9990178,0.000360642,0.0001339444,0.0002380467,0.0001639674,0.00008553343],"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.00120941,0.0004540342,0.005109118,0.0002334386,0.0001197266,0.0003427374,0.0004045052,0.4503616,0.1750957,0.02582241,0.005060608,0.3357866],"study_design_scores_gemma":[0.0001383466,0.0001681579,0.0007810147,0.000005807646,0.0000346767,0.00005542215,0.00002921439,0.9718788,0.01733573,0.005908515,0.00364736,0.00001685744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3222292,0.0009474591,0.6650636,0.0003942566,0.0001112948,0.0001896773,0.00007867528,0.006377528,0.004608355],"genre_scores_gemma":[0.8328748,0.0002168902,0.16382,0.00006278689,0.00006302096,0.0001350912,0.0001368921,0.0002329961,0.002457511],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001949301,"threshold_uncertainty_score":0.006521106,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W199059760","doi":"10.1142/s0129626401000646","title":"ON THE NECESSITY OF FORMAL MODELS FOR REAL-TIME PARALLEL COMPUTATIONS","year":2001,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"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":"Turing machine; Computer science; Computation; Universal Turing machine; Super-recursive algorithm; Model of computation; Time hierarchy theorem; Turing machine examples; Probabilistic Turing machine; Theoretical computer science; Hierarchy; NSPACE; Description number; Real number; Time complexity; Theory of computation; Formal proof; Turing; Algorithm; Discrete mathematics; Mathematics; Programming language","authors":[{"name":"Stefan D. Bruda","is_ca":true},{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02905549084550148,"gpt":0.269250657233118,"spread":0.2401951663876165,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007323104,0.0009151633,0.001202209,0.001190669,0.002442155,0.005684533,0.00253356,0.00235086,0.004459222],"category_scores_gemma":[0.02722998,0.001063666,0.002440345,0.0009608874,0.009985324,0.01842737,0.004505999,0.005851758,0.0009536544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002891101,"about_ca_system_score_gemma":0.002108727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001255902,"about_ca_topic_score_gemma":0.001119625,"domain_scores_codex":[0.994134,0.002237781,0.0004997014,0.0008206049,0.001685652,0.000622165],"domain_scores_gemma":[0.9640697,0.02339249,0.002588522,0.005935797,0.002581523,0.001432085],"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.0000174483,0.00001755944,0.00008490735,0.00004076694,0.000004582997,0.00005271108,0.0001797492,0.004235007,0.0003260321,0.993468,0.0003141918,0.001259028],"study_design_scores_gemma":[0.00002036789,0.00001857272,0.00003977573,0.00002327544,0.000006187048,0.00006327295,0.0000721867,0.02923504,0.0004903399,0.9670415,0.002975984,0.00001358499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.05361316,0.0009227653,0.9136171,0.009638255,0.000253927,0.000128063,0.0001828159,0.0007214572,0.02092236],"genre_scores_gemma":[0.7785933,0.001008039,0.21136,0.001494625,0.0005277729,0.0006554808,0.0004164134,0.0003360049,0.00560833],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.007323104,"threshold_uncertainty_score":0.03872871,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102904242","doi":"10.1142/s012962640300115x","title":"PARALLEL REAL-TIME COMPUTATION OF NONLINEAR FEEDBACK FUNCTIONS","year":2003,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":6,"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":"Speedup; Computer science; Computation; Parallelism (grammar); Parallel computing; Parallel algorithm; Function (biology); Nonlinear system; Parallel processing; Algorithm","authors":[{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02030898719799678,"gpt":0.2619376575746751,"spread":0.2416286703766783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000795407,0.0005294974,0.00057493,0.0002840155,0.0004328295,0.0006116944,0.0005763953,0.0004984102,0.00256383],"category_scores_gemma":[0.003093337,0.000258972,0.0003376352,0.0003313747,0.0008715048,0.001121274,0.0008559492,0.0006608231,0.0003363508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005877272,"about_ca_system_score_gemma":0.0006075346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001456605,"about_ca_topic_score_gemma":0.00178507,"domain_scores_codex":[0.9997041,0.0000713362,0.00001390539,0.00004594471,0.0001136708,0.00005103875],"domain_scores_gemma":[0.9989985,0.0006223521,0.00009277552,0.0001213922,0.0001237662,0.00004132872],"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.0005388655,0.0000724012,0.0007980125,0.0001532722,0.00003799871,0.0001925914,0.0001697196,0.8679781,0.02143526,0.04564195,0.0009172703,0.06206463],"study_design_scores_gemma":[0.00003362018,0.00003012159,0.00007498461,0.000003641935,0.000004845969,0.00002174584,0.00001346462,0.975602,0.005168316,0.01855819,0.0004854447,0.000003623711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1974203,0.00044296,0.7899612,0.0004833687,0.00008337335,0.00003545899,0.00003890719,0.0009835317,0.01055105],"genre_scores_gemma":[0.8546681,0.0001811361,0.1419967,0.00004647387,0.00003384359,0.00005350895,0.00004179278,0.00009650819,0.002881963],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00256383,"threshold_uncertainty_score":0.00857687,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035452705","doi":"10.1142/s012962641000020x","title":"A QUANTUM CRYPTOGRAPHIC SOLUTION TO THE PROBLEM OF ACCESS CONTROL IN A HIERARCHY","year":2010,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"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":"Hierarchy; Computer science; Access control; Cryptography; Collusion; Scheme (mathematics); Theoretical computer science; Computer security; Identity (music); Computer access control; Key (lock); Mathematics","authors":[{"name":"Naya Nagy","is_ca":true},{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01207755686588752,"gpt":0.2503412591788391,"spread":0.2382637023129516,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002259575,0.000341168,0.0006894998,0.0008317802,0.002438406,0.002173838,0.001709671,0.002094642,0.005548125],"category_scores_gemma":[0.005126491,0.0004367399,0.00101672,0.001117755,0.004073075,0.005690665,0.004894336,0.003198268,0.001097751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001642825,"about_ca_system_score_gemma":0.002508444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009715391,"about_ca_topic_score_gemma":0.0007553649,"domain_scores_codex":[0.9975454,0.0005668157,0.0001335752,0.0003115244,0.001058063,0.0003845368],"domain_scores_gemma":[0.9979414,0.0006500413,0.0002001178,0.0006914215,0.0003528756,0.0001641794],"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.00004012041,0.00001831934,0.00006928193,0.00003232204,0.00001015671,0.00005650529,0.000159251,0.002827173,0.002176617,0.9802127,0.002656249,0.01174128],"study_design_scores_gemma":[0.000100096,0.00008771755,0.0001539222,0.00003711539,0.00002297472,0.0002621251,0.00009044454,0.07898984,0.00305535,0.8923182,0.02482925,0.00005292651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01828199,0.0005035779,0.9542949,0.004020983,0.0002835199,0.0001676891,0.0001041865,0.0002144061,0.02212884],"genre_scores_gemma":[0.5746583,0.001018779,0.3990339,0.001408454,0.0007189536,0.0003218999,0.0001343559,0.00009664162,0.02260885],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005548125,"threshold_uncertainty_score":0.01856029,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086944191","doi":"10.1142/s0129626414400040","title":"Evolutionary Design of Gene Networks: Forced Evolution by Genomic Parasites","year":2014,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Evolution and Genetic Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"British Columbia Institute of Technology","funders":"National Institute of General Medical Sciences; National Institutes of Health; Russian Foundation for Basic Research","keywords":"Biology; Evolutionary biology; Gene; Computer science; Computational biology; Genetics","authors":[{"name":"Alexander V. Spirov","is_ca":false},{"name":"E. A. Zagriychuk","is_ca":false},{"name":"David M. Holloway","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006163644749219112,"gpt":0.2158754724599694,"spread":0.2097118277107503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003525203,0.000123913,0.0002623649,0.0002975094,0.000428672,0.000895424,0.0006148747,0.0005753732,0.001610719],"category_scores_gemma":[0.002267429,0.0002699647,0.0002810833,0.0001764555,0.001242997,0.00113905,0.0005901502,0.0005125888,0.0001717973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008487307,"about_ca_system_score_gemma":0.0003642468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006076327,"about_ca_topic_score_gemma":0.000699977,"domain_scores_codex":[0.9998487,0.00005354765,0.000005655238,0.00004361941,0.00002561181,0.00002286489],"domain_scores_gemma":[0.9994813,0.0002345147,0.00007538782,0.00007684202,0.0000428298,0.00008923162],"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.0001719151,0.00008053308,0.006001669,0.0001380163,0.00008375201,0.0006050065,0.0004083256,0.4470482,0.1334476,0.3876323,0.001139181,0.02324357],"study_design_scores_gemma":[0.00002939295,0.00004707091,0.001272207,0.00000643073,0.00001337841,0.0001404577,0.00006770607,0.8650826,0.006251305,0.1251837,0.001887667,0.00001826094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7792738,0.0003497112,0.2110644,0.001188138,0.0000728187,0.00003433442,0.00006277639,0.0003287426,0.007625369],"genre_scores_gemma":[0.9825415,0.0001244952,0.01621391,0.00008115731,0.00001028228,0.00003693677,0.00001895863,0.00003424855,0.0009383995],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001610719,"threshold_uncertainty_score":0.006157935,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007363986","doi":"10.1142/s0129626407003137","title":"ON A UNIFIED NEIGHBOURHOOD BROADCASTING SCHEME FOR INTERCONNECTION NETWORKS","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Interconnection Networks and Systems","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":"Brock University","funders":"","keywords":"Neighbourhood (mathematics); Interconnection; Hypercube; Computer science; Broadcasting (networking); Star (game theory); Computer network; Algorithm; Topology (electrical circuits); Theoretical computer science; Mathematics; Parallel computing; Combinatorics","authors":[{"name":"Ke Qiu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01993086839023469,"gpt":0.2607221117937441,"spread":0.2407912434035094,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001120102,0.000425955,0.0008407977,0.0008108882,0.001080443,0.001100398,0.001620915,0.001085581,0.003468473],"category_scores_gemma":[0.004703653,0.0003455265,0.0005697933,0.001409703,0.001326949,0.00306656,0.002121816,0.001372475,0.0008997927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00145417,"about_ca_system_score_gemma":0.0008855825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002257467,"about_ca_topic_score_gemma":0.0026675,"domain_scores_codex":[0.9991972,0.0002448821,0.00004316378,0.0001295223,0.0002946993,0.00009064414],"domain_scores_gemma":[0.9986849,0.0005736097,0.00008364983,0.000373054,0.0002190755,0.00006568123],"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.0002110141,0.00005862182,0.0002378121,0.0001692694,0.00002104214,0.00007907152,0.0005201338,0.2131431,0.01700357,0.6497725,0.005234419,0.1135494],"study_design_scores_gemma":[0.00008404221,0.0001407537,0.0001380396,0.00003538634,0.00002336391,0.0001229561,0.00006232556,0.7653248,0.00515912,0.2130189,0.01585361,0.00003673251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01689883,0.0003941176,0.9727033,0.000212356,0.00005749384,0.00007615041,0.00006180991,0.0003459966,0.00924992],"genre_scores_gemma":[0.3416731,0.001052849,0.6446263,0.00018742,0.0001490589,0.0003965025,0.0002954091,0.0002910165,0.01132831],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003468473,"threshold_uncertainty_score":0.01160324,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2325643405","doi":"10.1142/s0129626416500055","title":"On the Conditional Diagnosability of Hyper-Buttery Graphs and Related Networks","year":2016,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Interconnection Networks and Systems","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":"Brock University","funders":"","keywords":"Hypercube; Interconnection; Scheme (mathematics); Reliability (semiconductor); Measure (data warehouse); Graph; Computer science; Mathematics; Theoretical computer science; Discrete mathematics; Computer network; Data mining","authors":[{"name":"Eddie Cheng","is_ca":false},{"name":"Ke Qiu","is_ca":true},{"name":"Zhizhang Shen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01152204975426397,"gpt":0.2096169302629729,"spread":0.1980948805087089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001426011,0.0005464955,0.0004446215,0.00106624,0.0006022184,0.0009817455,0.0009786848,0.0008136491,0.002419625],"category_scores_gemma":[0.01192682,0.0002751838,0.0006693202,0.001006603,0.002845364,0.003034406,0.001616144,0.001917512,0.0001473678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001232191,"about_ca_system_score_gemma":0.0008327243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002900589,"about_ca_topic_score_gemma":0.001839023,"domain_scores_codex":[0.9992673,0.0002505623,0.00003414646,0.0001476582,0.0001799959,0.0001203686],"domain_scores_gemma":[0.9904627,0.007657461,0.0006567954,0.000399709,0.0005388797,0.0002844528],"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.00008596767,0.00003152583,0.001079918,0.0001272312,0.00002885522,0.0002158656,0.0002391129,0.2471242,0.002048585,0.7317459,0.00194767,0.01532511],"study_design_scores_gemma":[0.00001513859,0.0000253151,0.0004823862,0.00002543416,0.00001197329,0.00007576342,0.00005677644,0.4224109,0.0005940977,0.5752137,0.001074572,0.00001401169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1708242,0.001423982,0.8107436,0.001700739,0.0001204053,0.00005735215,0.0002901369,0.0002827604,0.0145568],"genre_scores_gemma":[0.9514922,0.001531636,0.04192672,0.0002629229,0.0002552413,0.0001408512,0.0003905355,0.00008545321,0.003914513],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002900589,"threshold_uncertainty_score":0.00894022,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964127017","doi":"10.1142/s0129626406002447","title":"INHERENTLY PARALLEL GEOMETRIC COMPUTATIONS","year":2006,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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":"Speedup; Computation; Computer science; Polygon (computer graphics); Property (philosophy); Object (grammar); Set (abstract data type); Transformation (genetics); Algorithm; Convex polygon; Regular polygon; Mathematics; Theoretical computer science; Parallel computing; Geometry; Artificial intelligence","authors":[{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0172983829960362,"gpt":0.2448015836913764,"spread":0.2275032006953402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000345559,0.0006772772,0.0005384507,0.0005576368,0.0006856926,0.001417494,0.001102158,0.0006378131,0.006829095],"category_scores_gemma":[0.001506286,0.0003468488,0.0007015169,0.0009250516,0.001329179,0.002704455,0.00219091,0.001222506,0.001611307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006089096,"about_ca_system_score_gemma":0.0006230806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006088243,"about_ca_topic_score_gemma":0.0009909199,"domain_scores_codex":[0.999482,0.00007902345,0.00002386289,0.00009472095,0.0002640765,0.00005648219],"domain_scores_gemma":[0.9995359,0.0001232098,0.00003229119,0.0002161457,0.00006791629,0.00002449872],"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.00008739826,0.00004118633,0.000389673,0.0001837473,0.0000306044,0.0001808816,0.0001933981,0.09631146,0.01446451,0.7910293,0.005292651,0.09179518],"study_design_scores_gemma":[0.00003962203,0.00004082794,0.0002031987,0.00001836044,0.00001805785,0.0002738579,0.00004775124,0.3385654,0.005560868,0.6129195,0.04229885,0.00001375304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02101457,0.000572899,0.9380253,0.0004583979,0.0001786595,0.00007292566,0.0001148192,0.0008460938,0.03871638],"genre_scores_gemma":[0.3254348,0.001377954,0.6546081,0.0002120208,0.000241073,0.0002409544,0.0003609217,0.0003417479,0.01718234],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006829095,"threshold_uncertainty_score":0.02284557,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W253312643","doi":"10.1142/s0129626409000055","title":"LOCATING THE MEDIAN OF A TREE IN REAL TIME","year":2009,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Data Mining Algorithms and Applications","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":"Tree (set theory); Computer science; Mathematics; Combinatorics","authors":[{"name":"Marius Nagy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01485244151785528,"gpt":0.2575654061639926,"spread":0.2427129646461373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001724631,0.0004102053,0.0008618836,0.0007037061,0.0006522565,0.001553558,0.0009272423,0.0010575,0.001502407],"category_scores_gemma":[0.00826533,0.0004154193,0.0003241384,0.0008254286,0.0009999379,0.002287673,0.0009473383,0.0006593965,0.0003469909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009627219,"about_ca_system_score_gemma":0.001130858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001934296,"about_ca_topic_score_gemma":0.001815368,"domain_scores_codex":[0.9992628,0.0002030395,0.00003088821,0.0002111444,0.0001562066,0.0001360509],"domain_scores_gemma":[0.9968239,0.001953063,0.0004885583,0.0002816409,0.000289075,0.0001637983],"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.0004261172,0.00004343019,0.002634991,0.00003720244,0.00002281373,0.0001427893,0.0001515208,0.9402652,0.007065242,0.01642261,0.0005865101,0.03220164],"study_design_scores_gemma":[0.000007805945,0.00004271723,0.0002812441,0.000002811516,0.00000357524,0.00004353911,0.00005392234,0.9855384,0.002048313,0.01166036,0.0003100393,0.000007296948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.181518,0.0001569351,0.8163413,0.0001859591,0.00002489462,0.00002189025,0.00006155446,0.0003583409,0.001331011],"genre_scores_gemma":[0.8565512,0.00009297347,0.1421767,0.00002989324,0.0000141695,0.0000321472,0.00008841759,0.00006036287,0.0009541688],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001934296,"threshold_uncertainty_score":0.009120822,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2913550238","doi":"10.1142/s0129626418500111","title":"Using Convolution and Deep Learning in Gomoku Game Artificial Intelligence","year":2018,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Artificial Intelligence in Games","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":"Algoma University; Lakehead University","funders":"","keywords":"Computer science; Artificial intelligence; Artificial neural network; Deep learning; Convolutional neural network; Game tree; Machine learning; Tree (set theory); Convolution (computer science); Sequential game; Game theory; Mathematics","authors":[{"name":"Peizhi Yan","is_ca":true},{"name":"Yi Feng","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06885911131113163,"gpt":0.3210850951968252,"spread":0.2522259838856935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064671,0.000622887,0.0004744498,0.0004919291,0.0003149351,0.0008828049,0.000652208,0.000781464,0.000826525],"category_scores_gemma":[0.001945553,0.0003208007,0.0003851163,0.0005792395,0.0006409232,0.001619853,0.0008632923,0.00104809,0.0001884124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001008312,"about_ca_system_score_gemma":0.0007532473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01089555,"about_ca_topic_score_gemma":0.01026973,"domain_scores_codex":[0.9996954,0.00008016339,0.00001702066,0.00006706447,0.00007209466,0.00006823],"domain_scores_gemma":[0.9996858,0.0001448678,0.00002997047,0.00004066765,0.00006883113,0.00002997424],"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.0003207431,0.000237734,0.005676117,0.0001127144,0.0001249371,0.0002531278,0.00018506,0.6034319,0.02129797,0.01808459,0.001717999,0.3485571],"study_design_scores_gemma":[0.00000293045,0.0000192405,0.0006236683,0.000004409956,0.000007198612,0.00001316208,0.00000868498,0.9931837,0.002385622,0.003426073,0.000319332,0.000005994606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3440039,0.001268671,0.6429642,0.0009997995,0.0001643168,0.00007028698,0.00009865032,0.001951803,0.008478317],"genre_scores_gemma":[0.9344673,0.0002182838,0.06316952,0.0001632451,0.00001907741,0.00002468066,0.00007471196,0.00003190037,0.001831326],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01089555,"threshold_uncertainty_score":0.02166426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2414459484","doi":"10.1142/s0129626416500092","title":"On Optimal Scheduling Algorithms for Well-Structured Workflows in the Cloud with Budget and Deadline Constraints","year":2016,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; Ontario Tech University","funders":"Atlantic Canada Opportunities Agency","keywords":"Computer science; Cloud computing; Knapsack problem; Scheduling (production processes); Computation; Algorithm; Provisioning; Mathematical optimization; Parallel computing; Mathematics","authors":[{"name":"Yang Wang","is_ca":false},{"name":"Kenneth B. Kent","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01511263069793686,"gpt":0.2470564242794591,"spread":0.2319437935815223,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003080874,0.002090623,0.001729726,0.001127218,0.001191753,0.002200529,0.001765028,0.002099434,0.003400112],"category_scores_gemma":[0.00893464,0.001038795,0.001270095,0.002515698,0.001779717,0.004261583,0.001867882,0.002467301,0.000936849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002482438,"about_ca_system_score_gemma":0.003923418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004419274,"about_ca_topic_score_gemma":0.004436319,"domain_scores_codex":[0.998441,0.0006074866,0.0000833974,0.0003058742,0.0002964705,0.0002656744],"domain_scores_gemma":[0.9957848,0.003240899,0.0003072778,0.0002462563,0.000273624,0.0001470535],"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.0001860738,0.0001747277,0.0003364593,0.0002055203,0.0000433285,0.00004567407,0.0001014188,0.8976986,0.001341582,0.05805611,0.002538148,0.03927233],"study_design_scores_gemma":[0.00005643355,0.00004442055,0.00006751101,0.00002406335,0.0000104095,0.00001765544,0.00003798422,0.9326167,0.000479426,0.06564778,0.0009885919,0.000009087315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01335391,0.0008730767,0.9812355,0.0005583262,0.00009089945,0.0001342702,0.0001229323,0.0002305031,0.003400452],"genre_scores_gemma":[0.2046317,0.001805237,0.7890227,0.0003241654,0.0002007394,0.0003997916,0.0004306356,0.0002684687,0.002916664],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004419274,"threshold_uncertainty_score":0.01801145,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4392191621","doi":"10.1142/s0129626423400170","title":"A Note to Non-adaptive Broadcasting","year":2024,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"ICT Impact and Policies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Broadcasting (networking); Computer science; Theoretical computer science; Mathematics; Parallel computing; Algorithm; Computer network","authors":[{"name":"Saber Gholami","is_ca":true},{"name":"Hovhannes A. Harutyunyan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01446355080981523,"gpt":0.2600133300125373,"spread":0.2455497792027221,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002943441,0.0005187663,0.0007776316,0.000639178,0.001316672,0.002165974,0.002667208,0.001688164,0.006628485],"category_scores_gemma":[0.01667001,0.0003723538,0.0007492654,0.001749192,0.002751003,0.007353508,0.002028344,0.006808363,0.00135498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002108323,"about_ca_system_score_gemma":0.00142681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002997552,"about_ca_topic_score_gemma":0.002979511,"domain_scores_codex":[0.9970745,0.001009933,0.00009392129,0.0005818726,0.0009032138,0.0003366362],"domain_scores_gemma":[0.9826556,0.01294858,0.000485398,0.002109076,0.00134373,0.0004575513],"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.000162579,0.00008374031,0.0008106438,0.0003543326,0.0000335753,0.0003370647,0.000327357,0.02211948,0.003195725,0.853936,0.0416847,0.07695487],"study_design_scores_gemma":[0.00004259494,0.0001906128,0.0007989828,0.0001293718,0.00004983634,0.0005219779,0.0002503155,0.1341519,0.002340354,0.7435261,0.1179415,0.00005632708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02140025,0.01927924,0.8222149,0.04161531,0.006259332,0.0001493999,0.0002117665,0.0006808042,0.0881889],"genre_scores_gemma":[0.6476898,0.02587461,0.2487681,0.01454038,0.01016893,0.0004607238,0.0003054638,0.0006738453,0.05151815],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006628485,"threshold_uncertainty_score":0.02217448,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1607694089","doi":"10.1142/s012962641000017x","title":"COPING WITH DECOHERENCE: PARALLELIZING THE QUANTUM FOURIER TRANSFORM","year":2010,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Computing Algorithms and Architecture","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":"Quantum decoherence; Computer science; Quantum computer; Scalability; Computation; Computational complexity theory; Fourier transform; Theoretical computer science; Quantum; Quantum Fourier transform; Fast Fourier transform; Algorithm; Computational science; Quantum error correction; Quantum mechanics; Physics","authors":[{"name":"Marius Nagy","is_ca":true},{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008926463917114678,"gpt":0.2295030830160912,"spread":0.2205766190989766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001248925,0.000499277,0.0006329085,0.0003417692,0.0007417515,0.001127093,0.001156842,0.0007743543,0.001471751],"category_scores_gemma":[0.004097418,0.0002472817,0.0003868581,0.0005768968,0.001946162,0.002510407,0.001576711,0.001349392,0.0003939532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000504549,"about_ca_system_score_gemma":0.001087425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001201764,"about_ca_topic_score_gemma":0.001526575,"domain_scores_codex":[0.9994686,0.0001523057,0.00002403758,0.00007434959,0.0001917839,0.00008885218],"domain_scores_gemma":[0.9987431,0.0005424691,0.00008220992,0.0004713705,0.0001137833,0.00004712224],"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.0004540652,0.0001594925,0.001151786,0.0001192681,0.00005341267,0.0003462121,0.0005760379,0.356564,0.03364668,0.4556158,0.002841206,0.148472],"study_design_scores_gemma":[0.00005115535,0.00008110444,0.0001680635,0.00001068846,0.00001363005,0.0000952008,0.00005958462,0.7861168,0.009571579,0.1998114,0.004002313,0.0000183558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06239592,0.0002599423,0.9257278,0.0008693305,0.00007119201,0.000082661,0.00003109805,0.000667691,0.009894445],"genre_scores_gemma":[0.6330227,0.0004456766,0.3630448,0.0001266597,0.0001456714,0.0001131822,0.00005574962,0.0001709849,0.002874587],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001471751,"threshold_uncertainty_score":0.006605029,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973439009","doi":"10.1142/s0129626412500090","title":"BLOCK-PARALLEL SYSTOLIC-ARRAY ARCHITECTURE FOR 2-D NTT-BASED FRAGILE WATERMARK EMBEDDING","year":2012,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Digital Filter Design and Implementation","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":"University of Calgary","funders":"Department of Foreign Affairs and Trade, Australian Government","keywords":"Digital watermarking; Computer science; Field-programmable gate array; Block (permutation group theory); Authentication (law); Watermark; Adder; Computer hardware; Throughput; Embedding; Computer security; Image (mathematics); Telecommunications; Artificial intelligence; Wireless; Mathematics","authors":[{"name":"Arjuna Madanayake","is_ca":false},{"name":"Renato J. Cintra","is_ca":false},{"name":"Vassil S. Dimitrov","is_ca":true},{"name":"L.T. Bruton","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02575098785740574,"gpt":0.2831230029306629,"spread":0.2573720150732572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002663323,0.0003969008,0.0002391135,0.0003870584,0.0002431116,0.0004157222,0.0006366218,0.0003668962,0.003688677],"category_scores_gemma":[0.0004285954,0.0001534437,0.0002576094,0.0005118637,0.0002148636,0.0005975697,0.0002095569,0.0003320245,0.001212406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003874768,"about_ca_system_score_gemma":0.0005718869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008172464,"about_ca_topic_score_gemma":0.001815252,"domain_scores_codex":[0.9998641,0.00003099313,0.00001207377,0.00002523783,0.00005442816,0.00001308572],"domain_scores_gemma":[0.9997724,0.00005876091,0.00003301832,0.00003882615,0.00008387279,0.00001314649],"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.0009092709,0.0002052055,0.001277086,0.0003570096,0.00009016663,0.0003671806,0.0001775574,0.08716655,0.4140456,0.02245427,0.00470168,0.4682484],"study_design_scores_gemma":[0.0001662442,0.001612484,0.001529494,0.00004481257,0.00007414403,0.0006673714,0.00004068217,0.8001286,0.1647872,0.006552474,0.02434234,0.00005401181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0639163,0.0005438292,0.9266825,0.0001390942,0.0001447495,0.0001100043,0.0001009156,0.002293631,0.006069028],"genre_scores_gemma":[0.4930048,0.0004932326,0.4979612,0.0001416611,0.00008443866,0.0001890338,0.0003805145,0.00006910703,0.007676],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003688677,"threshold_uncertainty_score":0.01233983,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3097870658","doi":"10.1142/s0129626420400095","title":"A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks","year":2020,"lang":"en","type":"article","venue":"Parallel Processing Letters","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":"Brock University","funders":"","keywords":"Interconnection; Computer science; Perspective (graphical); Resilience (materials science); Vulnerability (computing); Development (topology); Graph theory; Distributed computing; Theoretical computer science; Computer network; Artificial intelligence; Mathematics; Computer security","authors":[{"name":"Eddie Cheng","is_ca":false},{"name":"Ke Qiu","is_ca":true},{"name":"Zhizhang Shen","is_ca":false},{"name":"Weihua Yang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07882330602952328,"gpt":0.2734465681261355,"spread":0.1946232620966122,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003048322,0.001480481,0.001047075,0.002693074,0.00243712,0.004479498,0.002607264,0.005877262,0.01010898],"category_scores_gemma":[0.009331363,0.0004958712,0.001448348,0.003671333,0.00357809,0.006877088,0.001260103,0.009908181,0.004436559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003809735,"about_ca_system_score_gemma":0.00224587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004684507,"about_ca_topic_score_gemma":0.007260262,"domain_scores_codex":[0.9981218,0.0005600671,0.0002227158,0.0003444911,0.0005901379,0.000160758],"domain_scores_gemma":[0.9927758,0.004983658,0.0003730927,0.0001994232,0.001464676,0.0002033402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008918064,0.00002408643,0.0002504911,0.00137399,0.00004869362,0.0005405237,0.0003812679,0.001548113,0.001615365,0.245341,0.7077885,0.04099873],"study_design_scores_gemma":[0.000007250867,0.00003915716,0.000311952,0.0006129667,0.00002020168,0.0003282689,0.0001323141,0.0008235796,0.0002420846,0.07871988,0.9187323,0.00002999568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.001477798,0.3515712,0.03232463,0.2899004,0.2730657,0.0001047391,0.001049256,0.0003233314,0.05018296],"genre_scores_gemma":[0.03316526,0.3866428,0.01884293,0.1791935,0.3017823,0.0002986576,0.0007740248,0.0005197414,0.07878064],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.01010898,"threshold_uncertainty_score":0.03381789,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076702673","doi":"10.1142/s0129626410000211","title":"ONE-TIME PADS WITHOUT PRIOR ENCOUNTER","year":2010,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Information and Cryptography","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":"Secrecy; Encryption; Computer science; Cryptography; Key (lock); Value (mathematics); Transmission (telecommunications); Computer network; Computer security; Algorithm; Theoretical computer science; Telecommunications","authors":[{"name":"Naya Nagy","is_ca":true},{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009509417698472166,"gpt":0.2331768288686649,"spread":0.2236674111701928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008951869,0.0008080682,0.0009763532,0.000472758,0.00123427,0.003281019,0.001822472,0.001789859,0.02358147],"category_scores_gemma":[0.004704653,0.0006598932,0.0006947023,0.0005507242,0.002459559,0.007340467,0.004287275,0.002474683,0.01243885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006689866,"about_ca_system_score_gemma":0.0008673291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001367038,"about_ca_topic_score_gemma":0.000136769,"domain_scores_codex":[0.9977548,0.0003187229,0.0001543685,0.0005406492,0.0008560792,0.0003754526],"domain_scores_gemma":[0.9947118,0.0008204509,0.000439438,0.003454823,0.0004004687,0.0001730843],"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.0005595498,0.0002063268,0.001010662,0.0003347103,0.00004323814,0.0008773303,0.0008049806,0.002886068,0.05839695,0.8557473,0.006831101,0.07230169],"study_design_scores_gemma":[0.000118526,0.000752428,0.0007856812,0.0001504067,0.0001052728,0.004441255,0.0004660064,0.039622,0.3547783,0.3930736,0.2055302,0.000176268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1081963,0.001115961,0.7254505,0.002126279,0.001102857,0.0004025535,0.000388842,0.003652054,0.1575647],"genre_scores_gemma":[0.7734694,0.000733603,0.1185933,0.0005853614,0.0002884427,0.0002985893,0.0003581978,0.000617774,0.1050554],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02358147,"threshold_uncertainty_score":0.07888788,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008227163","doi":"10.1142/s0129626404001969","title":"ROUTING BALANCED COMMUNICATIONS ON HAMILTON DECOMPOSABLE NETWORKS","year":2004,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Permutation (music); Upper and lower bounds; Arc (geometry); Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Ring (chemistry); Routing (electronic design automation); Discrete mathematics; Computer science; Telecommunications; Computer network","authors":[{"name":"Ladislav Stacho","is_ca":true},{"name":"Jozef Širáň","is_ca":false},{"name":"Sanming Zhou","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01448476369148214,"gpt":0.2426226448110931,"spread":0.2281378811196109,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004938977,0.0008036206,0.0003655794,0.0007047639,0.0004262869,0.0006626583,0.0005356243,0.0003175533,0.004116422],"category_scores_gemma":[0.001737513,0.000278215,0.0001248595,0.0006660996,0.0004581048,0.001712445,0.0007784071,0.0005345283,0.0004980654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001019114,"about_ca_system_score_gemma":0.0004002237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001674256,"about_ca_topic_score_gemma":0.003507341,"domain_scores_codex":[0.9995813,0.00007839742,0.00001870337,0.00005687636,0.0001612909,0.0001033788],"domain_scores_gemma":[0.9987159,0.0007315486,0.000169112,0.0001334562,0.0001884549,0.00006159114],"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.0008809859,0.0001445758,0.001663805,0.0004590572,0.00007163879,0.0006219188,0.0004346554,0.2944685,0.08666778,0.4163145,0.007158265,0.1911144],"study_design_scores_gemma":[0.00006697574,0.0002298938,0.000682232,0.00003151048,0.0000262952,0.0001700673,0.000117474,0.741755,0.02295097,0.2228868,0.01105663,0.0000262252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3331706,0.0009031032,0.6300845,0.000455161,0.0000863638,0.0002063095,0.0007039944,0.0005077209,0.03388224],"genre_scores_gemma":[0.9034939,0.0009673832,0.08048021,0.0001430244,0.00004841,0.0001779761,0.0006944637,0.00008939595,0.01390535],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004116422,"threshold_uncertainty_score":0.01377076,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994164933","doi":"10.1142/s0129626405002350","title":"A Genetic Algorithm for Energy Aware Task Scheduling in Heterogeneous Systems","year":2005,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization Techniques","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Dynamic voltage scaling; Energy consumption; Scheduling (production processes); Genetic algorithm; Algorithm; Simulated annealing; Parallel computing; Distributed computing; Real-time computing; Mathematical optimization; Mathematics; Engineering","authors":[{"name":"Man Lin","is_ca":true},{"name":"Sai Man Ng","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0134874255332493,"gpt":0.246611139623415,"spread":0.2331237140901657,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008175923,0.0007069333,0.0006767865,0.000684982,0.0006022316,0.0006074318,0.000884102,0.001013393,0.0008783634],"category_scores_gemma":[0.001916271,0.0003819287,0.0005847254,0.0007463888,0.0005690628,0.0005387913,0.0004686165,0.0007043721,0.0001817231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009817694,"about_ca_system_score_gemma":0.001359962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007712532,"about_ca_topic_score_gemma":0.005232779,"domain_scores_codex":[0.9996989,0.0001113211,0.0000131368,0.00004544091,0.00009713449,0.00003413007],"domain_scores_gemma":[0.9996995,0.0001839728,0.00002798825,0.0000161083,0.00005880691,0.00001373133],"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.00003063579,0.00002745661,0.0002402495,0.00002421721,0.00003226835,0.00003982839,0.00003193058,0.947476,0.001465155,0.006675121,0.000565104,0.04339198],"study_design_scores_gemma":[0.00002052669,0.00001957867,0.00007253516,0.000004524256,0.00000788005,0.00001264789,0.000005816738,0.9954335,0.000323762,0.003382608,0.0007127695,0.000003818984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01489899,0.0003400033,0.9824592,0.0001668257,0.00004916201,0.00006215313,0.00002457949,0.000307949,0.001691093],"genre_scores_gemma":[0.3556624,0.0004604593,0.6401874,0.0001476262,0.00005119384,0.0003984701,0.0001554272,0.00008381528,0.002853065],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007712532,"threshold_uncertainty_score":0.01533532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138779000","doi":"10.1142/s0129626413500023","title":"PARALLEL CONSTRUCTION OF DATA CUBES ON MULTI-CORE MULTI-DISK PLATFORMS","year":2013,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Advanced Database Systems and Queries","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":"Online analytical processing; Computer science; Data cube; Cube (algebra); Sorting; Very large database; Parallel computing; Speedup; Data warehouse; Aggregate (composite); sort; Core (optical fiber); Database; Data mining; Algorithm; Mathematics","authors":[{"name":"Frank Dehne","is_ca":true},{"name":"Hamidreza Zaboli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08356213875085854,"gpt":0.3058545924301158,"spread":0.2222924536792573,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008685911,0.000592088,0.0007322005,0.0007708292,0.0009530957,0.001158332,0.001495379,0.0004580742,0.002235664],"category_scores_gemma":[0.002991284,0.000460807,0.0009204008,0.002041529,0.0006620583,0.001747511,0.001730415,0.0009558644,0.0007602134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007911952,"about_ca_system_score_gemma":0.001736394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004665238,"about_ca_topic_score_gemma":0.005818222,"domain_scores_codex":[0.9988497,0.0002228634,0.00008288591,0.000146842,0.0005485239,0.0001490756],"domain_scores_gemma":[0.9979505,0.0005925734,0.0001001065,0.0005727679,0.0006625987,0.0001214845],"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.000862908,0.0003082456,0.004310345,0.0004882089,0.0001635577,0.0005490643,0.0006418364,0.4218988,0.04511684,0.03626242,0.01870728,0.4706906],"study_design_scores_gemma":[0.000110311,0.0001486223,0.0007804611,0.00001524835,0.00002014623,0.0001339738,0.0001940653,0.9384754,0.02893252,0.01958482,0.01157409,0.00003044198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1305419,0.000487987,0.8559434,0.0004750352,0.0001458966,0.0002991547,0.0004264617,0.00528867,0.006391377],"genre_scores_gemma":[0.233199,0.0002564206,0.7620602,0.0001142213,0.00002873203,0.0003115273,0.001239461,0.000255868,0.002534445],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004665238,"threshold_uncertainty_score":0.009276152,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969579322","doi":"10.1142/s0129626405002374","title":"THE IMPROVED PARALLEL ICGS METHOD FOR LARGE AND SPARSE UNSYMMETRIC LINEAR SYSTEMS","year":2005,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Matrix Theory and Algorithms","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Conjugate gradient method; Computation; Parallel computing; Sparse matrix; Algorithm; Matrix (chemical analysis); Parallel algorithm; Coefficient matrix; Scheme (mathematics); Distributed memory; Linear system; Mathematical optimization; Shared memory; Mathematics","authors":[{"name":"Laurence T. Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01675863454036397,"gpt":0.2780497384753776,"spread":0.2612911039350136,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004462401,0.000626319,0.0005460805,0.0004418892,0.0003590377,0.0004105081,0.001031409,0.0005381025,0.002172416],"category_scores_gemma":[0.0009137195,0.0002453788,0.0003799738,0.0007963637,0.0005637243,0.0006472529,0.000631818,0.0007457073,0.0006517249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003470742,"about_ca_system_score_gemma":0.001525239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003465615,"about_ca_topic_score_gemma":0.003169871,"domain_scores_codex":[0.9997297,0.00006919089,0.000009997251,0.00003242707,0.0001396719,0.00001904094],"domain_scores_gemma":[0.9997129,0.00007455189,0.00002562294,0.00005115849,0.0001110675,0.00002471939],"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.0001930824,0.00009806037,0.0009078407,0.0002667978,0.00005836808,0.0002613261,0.0001557541,0.6404199,0.0300212,0.07055564,0.01232228,0.2447397],"study_design_scores_gemma":[0.00002571595,0.00002885314,0.00008842543,0.000004749388,0.000005407335,0.00005089238,0.000007377107,0.9847333,0.003175829,0.005466583,0.006403743,0.000009267714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005011796,0.0001613794,0.9919614,0.0001471703,0.00009392757,0.00004331884,0.00003761077,0.000392802,0.002150687],"genre_scores_gemma":[0.08228246,0.0002432839,0.9117288,0.0001154279,0.00008732642,0.0001734297,0.0001583752,0.0001826692,0.005028266],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003465615,"threshold_uncertainty_score":0.007267416,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4244021806","doi":"10.1142/s0129626401000622","title":"A NOTE ON COMMUNICATION-EFFICIENT DETERMINISTIC PARALLEL ALGORITHMS FOR PLANAR POINT LOCATION AND 2D VORONOÏ DIAGRAM","year":2001,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Computational Geometry and Mesh Generation","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":"Dalhousie University","funders":"","keywords":"Planar; Computation; Computer science; Interconnection; Algorithm; Diagram; Point (geometry); Point-to-point; Parallel algorithm; Point location; Parallel computing; Mathematics; Telecommunications; Geometry","authors":[{"name":"Mohamadou Diallo","is_ca":false},{"name":"Afonso Ferreira","is_ca":false},{"name":"Andrew Rau‐Chaplin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02666809811312965,"gpt":0.2859733324838822,"spread":0.2593052343707525,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001771883,0.0009056843,0.0009870158,0.0007122383,0.001047231,0.001672577,0.002027399,0.0008617555,0.003623961],"category_scores_gemma":[0.006859053,0.0007470637,0.001025257,0.002037075,0.001373999,0.003728568,0.001975863,0.002132169,0.00155067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001483213,"about_ca_system_score_gemma":0.001411528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004604114,"about_ca_topic_score_gemma":0.004775384,"domain_scores_codex":[0.9977653,0.0006386144,0.0001670713,0.0002719109,0.0009733942,0.0001836528],"domain_scores_gemma":[0.9973807,0.001615635,0.0001004406,0.0005267515,0.0003306714,0.00004580079],"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.0002886378,0.0000506947,0.0005731507,0.000360442,0.0000842847,0.0002483092,0.000167576,0.2512685,0.00559416,0.525789,0.02701064,0.1885647],"study_design_scores_gemma":[0.0000797492,0.00006727953,0.0002455347,0.00005214068,0.00004097814,0.0002162643,0.00004105235,0.640131,0.007792606,0.2672245,0.0840501,0.00005881503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001940577,0.001073559,0.9918951,0.0007159503,0.0004435986,0.00002706744,0.00006234053,0.0005032975,0.003338489],"genre_scores_gemma":[0.08142922,0.002669673,0.9080133,0.0006565029,0.0008253524,0.0001978092,0.000351305,0.0004601391,0.005396629],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004604114,"threshold_uncertainty_score":0.01212335,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4241500372","doi":"10.1142/s0129626402000811","title":"ANALYSIS OF A LATENCY HIDING BROADCASTING ALGORITHM ON A RECONFIGURABLE OPTICAL INTERCONNECT","year":2002,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Advanced 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":"University of Victoria; Queen's University","funders":"","keywords":"Control reconfiguration; Computer science; Broadcasting (networking); Latency (audio); Interconnection; Algorithm; Port (circuit theory); Transmission (telecommunications); Computer network; Parallel computing; Telecommunications; Embedded system; Engineering; Electronic engineering","authors":[{"name":"Ahmad Afsahi","is_ca":true},{"name":"N.J. Dimopoulos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02160783066796921,"gpt":0.2271601532584492,"spread":0.20555232259048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001068782,0.0004815065,0.0004589374,0.0004824331,0.0005578987,0.0007913981,0.001166862,0.0006638159,0.002405196],"category_scores_gemma":[0.004392616,0.0002944348,0.0003431575,0.0005068881,0.0009587059,0.001054218,0.0005523591,0.0006306974,0.0002793744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001908318,"about_ca_system_score_gemma":0.001211823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003551189,"about_ca_topic_score_gemma":0.00211591,"domain_scores_codex":[0.9995461,0.0001199601,0.0000161036,0.00005507439,0.0001494792,0.0001133744],"domain_scores_gemma":[0.9975915,0.001713587,0.0002921672,0.0001087344,0.000218752,0.00007528563],"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.000186539,0.00004815422,0.0007404597,0.00006874984,0.00001964368,0.0001360776,0.0002034302,0.8284436,0.0176137,0.1237001,0.0008498139,0.02798978],"study_design_scores_gemma":[0.000006352541,0.00001381336,0.00003644062,0.000001705627,0.000002828855,0.000009999899,0.000004940749,0.9953457,0.001084989,0.003383456,0.0001073666,0.000002388477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1838636,0.0001818075,0.808098,0.0002628018,0.00001582582,0.0000682812,0.0000314474,0.0002734628,0.007204707],"genre_scores_gemma":[0.8813367,0.0002244735,0.1109695,0.00006205106,0.00002682741,0.0001203732,0.00006109977,0.0001496724,0.007049321],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003551189,"threshold_uncertainty_score":0.01384586,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985747745","doi":"10.1142/s0129626405002349","title":"IMPROVING SCHEDULING OF COMMUNICATION INTENSIVE PARALLEL APPLICATIONS ON HETEROGENEOUS COMPUTING ENVIRONMENTS","year":2005,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Scheduling and Optimization Algorithms","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":"St. Francis Xavier University","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Scheduling (production processes); Distributed computing; Latency (audio); Telecommunications network; Parallel computing; Performance metric; Computer network; Mathematical optimization","authors":[{"name":"Renato Porfírio Ishii","is_ca":false},{"name":"Rodrigo Fernandes de Mello","is_ca":false},{"name":"Luciano José Senger","is_ca":false},{"name":"Marcos José Santana","is_ca":false},{"name":"Regina Helena Carlucci Santana","is_ca":false},{"name":"Laurence T. Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01176041358000744,"gpt":0.2297897431250932,"spread":0.2180293295450858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00110006,0.0006214055,0.0007599507,0.0003126218,0.0003656588,0.0007869814,0.0009172195,0.0004847601,0.0005364206],"category_scores_gemma":[0.00310527,0.0002770685,0.0003530214,0.0005043631,0.0003648696,0.001007437,0.000780598,0.0006311135,0.0001733339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008397888,"about_ca_system_score_gemma":0.001329259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003586609,"about_ca_topic_score_gemma":0.002481478,"domain_scores_codex":[0.9993197,0.0002597217,0.00002501133,0.00008942657,0.000211204,0.00009493978],"domain_scores_gemma":[0.9993599,0.0002832055,0.0001026367,0.0001279429,0.00007566994,0.00005056053],"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.00007260603,0.00005334251,0.000574505,0.00002331282,0.0000124947,0.00002577832,0.00002320329,0.9752179,0.004073794,0.003917211,0.0001918642,0.01581384],"study_design_scores_gemma":[0.000002713502,0.00002053061,0.00005180844,8.497591e-7,0.000002004493,0.000003182422,0.000003188748,0.9982883,0.0006194172,0.0008610736,0.0001459177,8.983509e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.17666,0.0002904646,0.8197666,0.000192497,0.00003769784,0.00009518258,0.00003896314,0.0004117108,0.002506917],"genre_scores_gemma":[0.9065346,0.0002697741,0.09159219,0.00004029983,0.00002674558,0.00009859623,0.0000681413,0.00008401922,0.001285657],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003586609,"threshold_uncertainty_score":0.007131517,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111012197","doi":"10.1142/s0129626406002496","title":"VOTING MECHANISMS IN ASYNCHRONOUS BYZANTINE ENVIRONMENTS","year":2006,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Distributed systems and fault tolerance","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":"Université du Québec en Outaouais","funders":"","keywords":"Asynchronous communication; Voting; Computer science; Byzantine fault tolerance; Quantum Byzantine agreement; Byzantine architecture; Distributed computing; Mechanism (biology); Computer network; Fault tolerance","authors":[{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006787671418311022,"gpt":0.205829578496257,"spread":0.1990419070779459,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004897482,0.0007806709,0.0009401861,0.001183951,0.001666605,0.003522797,0.001984387,0.001991646,0.003300329],"category_scores_gemma":[0.01132779,0.0005236559,0.0006630667,0.0008772305,0.002688241,0.006524981,0.002592984,0.001628795,0.0008520287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009473975,"about_ca_system_score_gemma":0.000816684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004360988,"about_ca_topic_score_gemma":0.0003719938,"domain_scores_codex":[0.9944146,0.002280084,0.0004606377,0.0009595904,0.001225278,0.000659827],"domain_scores_gemma":[0.9917501,0.003978241,0.001352521,0.001767472,0.0008441812,0.0003075559],"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.0002651036,0.000064182,0.0004675432,0.0001531257,0.00002800526,0.0002448431,0.0007520745,0.03388805,0.007444753,0.9232696,0.001378695,0.03204398],"study_design_scores_gemma":[0.000427842,0.0003196906,0.000276351,0.00008926458,0.00007369081,0.000352388,0.0002421773,0.2482144,0.02067058,0.6890437,0.04020728,0.00008270463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06954865,0.0004349459,0.9198524,0.0005664795,0.0001072996,0.0002150384,0.00007478089,0.0009831371,0.008217223],"genre_scores_gemma":[0.7334625,0.0005485053,0.2541131,0.0002107334,0.0002198234,0.0006783286,0.0001272669,0.0001429367,0.01049677],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004897482,"threshold_uncertainty_score":0.02590066,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403196427","doi":"10.1142/s0129626424500099","title":"On Broadcast Schemes of Knödel Graphs","year":2024,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematics; Combinatorics; Discrete mathematics; Parallel computing","authors":[{"name":"M.H. Fakharan","is_ca":true},{"name":"Hovhannes A. Harutyunyan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03075005442890547,"gpt":0.2869843886370516,"spread":0.2562343342081461,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001224899,0.0003250135,0.0003412178,0.0008407664,0.001165778,0.001010543,0.0006425045,0.0006757002,0.004583613],"category_scores_gemma":[0.006183072,0.0002514379,0.0003355449,0.0009238696,0.001836022,0.002480072,0.001636575,0.001280155,0.0005491035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001504132,"about_ca_system_score_gemma":0.0007851637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001392673,"about_ca_topic_score_gemma":0.001363393,"domain_scores_codex":[0.998998,0.0003846148,0.00003719262,0.0001175919,0.0002570705,0.0002055834],"domain_scores_gemma":[0.9966058,0.001915437,0.0003145674,0.0007350068,0.0002813143,0.0001478503],"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.00007365487,0.00001201718,0.0001405904,0.00004913111,0.000003240774,0.00002867597,0.0002172441,0.008258101,0.00279483,0.9778078,0.001224587,0.009390135],"study_design_scores_gemma":[0.00005804485,0.000104435,0.0002722341,0.00006902653,0.00001607457,0.0001467134,0.0002693906,0.06957348,0.005586662,0.9105945,0.01326945,0.00003996184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4362666,0.001604068,0.4694795,0.001470876,0.0002697255,0.0002481607,0.0005765586,0.0005898694,0.08949476],"genre_scores_gemma":[0.9317583,0.001146082,0.05681845,0.0003395156,0.0001052762,0.0001893744,0.0002667507,0.0001269822,0.009249278],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004583613,"threshold_uncertainty_score":0.01533377,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116466593","doi":"10.1142/s0129626403001483","title":"Predicated Partial Redundancy Elimination using a Cost Analysis","year":2003,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization Techniques","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":"University of Victoria","funders":"","keywords":"Redundancy (engineering); Computer science; Exploit; Compiler; Partial evaluation; Probabilistic logic; Computation; Data-flow analysis; Transformation (genetics); Static analysis; Parallel computing; Theoretical computer science; Algorithm; Programming language; Data flow diagram; Artificial intelligence","authors":[{"name":"Bernhard Scholz","is_ca":false},{"name":"Eduard Mehofer","is_ca":false},{"name":"Nigel Horspool","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02689541465424579,"gpt":0.2847682013409979,"spread":0.2578727866867521,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008364135,0.0006104015,0.0004719392,0.0009697982,0.00038287,0.0008184739,0.0006465316,0.0003604929,0.001557822],"category_scores_gemma":[0.002472739,0.000301595,0.0007754564,0.0007689638,0.000678058,0.001131833,0.0006294565,0.000671353,0.000273784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006152174,"about_ca_system_score_gemma":0.001189584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007752743,"about_ca_topic_score_gemma":0.0008276532,"domain_scores_codex":[0.9988883,0.0002212287,0.00004561013,0.0000717392,0.0006674523,0.000105753],"domain_scores_gemma":[0.9986169,0.0006568319,0.0001381074,0.0003097823,0.0002586556,0.00001968367],"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.0002311848,0.0001095962,0.001713908,0.0002705381,0.00007533437,0.0003994346,0.000104438,0.5127247,0.05064579,0.2210797,0.003187954,0.2094574],"study_design_scores_gemma":[0.0000149217,0.00008367032,0.0003261623,0.00001179647,0.00003533693,0.0001512849,0.00001329733,0.9278542,0.02379948,0.04460027,0.003092875,0.00001676026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03380383,0.00012195,0.961667,0.0001831056,0.00002506104,0.00007569879,0.00007716157,0.0007502222,0.003295962],"genre_scores_gemma":[0.5671341,0.0002549878,0.4293859,0.00008022515,0.00004286614,0.0001706224,0.0001693462,0.0002404885,0.002521463],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001557822,"threshold_uncertainty_score":0.005211473,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020165959","doi":"10.1142/s0129626406002782","title":"A HIGHLY CONCURRENT GROUP MUTUAL l-EXCLUSION ALGORITHM","year":2006,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Distributed systems and fault tolerance","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":"Memorial University of Newfoundland","funders":"","keywords":"Mutual exclusion; Concurrency; Computer science; Asynchronous communication; Generalization; Critical section; Algorithm; Group (periodic table); Process (computing); Suzuki-Kasami algorithm; Extension (predicate logic); Theoretical computer science; Distributed computing; Mathematics; Programming language; Computer network","authors":[{"name":"K. Vidyasankar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008804448669416143,"gpt":0.2258978333368807,"spread":0.2170933846674646,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001055863,0.000619784,0.0007788609,0.0005275352,0.001187132,0.001048074,0.002204278,0.001313262,0.005479363],"category_scores_gemma":[0.002355669,0.0003153684,0.0004102147,0.0008049534,0.0006149706,0.00145394,0.002145329,0.0009129324,0.001487667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007176638,"about_ca_system_score_gemma":0.001503087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00159247,"about_ca_topic_score_gemma":0.001926023,"domain_scores_codex":[0.9989179,0.0002480112,0.00005899739,0.0002014103,0.0004110094,0.0001626111],"domain_scores_gemma":[0.9989311,0.000354262,0.00008856944,0.0002613407,0.0002574804,0.0001071837],"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.000842394,0.0004764258,0.001464771,0.0002311583,0.00008804229,0.0003442747,0.0003675327,0.3061672,0.01990176,0.1095911,0.01872341,0.5418019],"study_design_scores_gemma":[0.0002231972,0.0001179058,0.0001493164,0.00001319739,0.00001989688,0.0001769946,0.00002835767,0.9314303,0.005066494,0.04590629,0.01684564,0.00002238421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01105508,0.0001515416,0.9817837,0.0002454994,0.00006547428,0.0001380656,0.00006201475,0.001379145,0.005119339],"genre_scores_gemma":[0.2212637,0.0001292346,0.768684,0.0002197251,0.00006985676,0.0002782973,0.0002475985,0.0001701939,0.008937416],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005479363,"threshold_uncertainty_score":0.01833028,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4417192292","doi":"10.1142/s0129626425500148","title":"Proxy Quantum Games","year":2025,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Business Development Bank of Canada","funders":"","keywords":"Quantum; Unitary state; Game theory; Stochastic game; Quantum pseudo-telepathy; Maximization; Class (philosophy); Nash equilibrium","authors":[{"name":"Georgios D. Varsamis","is_ca":false},{"name":"Ioannis Liliopoulos","is_ca":false},{"name":"Hamed Mohammadbagherpoor","is_ca":false},{"name":"Andreas K. Kostopoulos","is_ca":false},{"name":"Kristin Milchanowski","is_ca":true},{"name":"Evangelos Karamatskos","is_ca":false},{"name":"Panagiotis Dimitrakis","is_ca":false},{"name":"Richard P. Padbury","is_ca":true},{"name":"Ioannis G. Karafyllidis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009933293531759634,"gpt":0.2645762052592971,"spread":0.2546429117275374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001133598,0.0009177829,0.0008842183,0.0005079795,0.0007673787,0.002358692,0.001523952,0.001291336,0.009143859],"category_scores_gemma":[0.00383607,0.000339345,0.0008520441,0.0005390977,0.002543248,0.003257601,0.002050286,0.001616758,0.0006004165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001748024,"about_ca_system_score_gemma":0.001391002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001915243,"about_ca_topic_score_gemma":0.001574061,"domain_scores_codex":[0.998431,0.0006624476,0.00007771168,0.0002328437,0.0003550508,0.0002408377],"domain_scores_gemma":[0.9985633,0.0006518016,0.0001796361,0.0002528039,0.0001711707,0.0001812083],"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.00002978867,0.00002318458,0.0001326043,0.00002960165,0.00001032802,0.00006985336,0.00005888826,0.02909719,0.0005616259,0.9653906,0.0006390713,0.003957275],"study_design_scores_gemma":[0.00003769569,0.0000469223,0.0001299608,0.00001773779,0.00001123866,0.00006797438,0.0000606605,0.3261089,0.0007211497,0.6667593,0.006020905,0.00001757413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05697973,0.0003643302,0.8717188,0.0008138166,0.0001310993,0.0003457679,0.0002938681,0.0002488172,0.06910376],"genre_scores_gemma":[0.8985589,0.0004641674,0.08327556,0.0004002098,0.00009656506,0.0003606861,0.0001864552,0.00007585336,0.01658163],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009143859,"threshold_uncertainty_score":0.03058928,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017204622","doi":"10.1142/s0129626413500102","title":"PARALLEL ALGORITHM FOR SECOND–ORDER RESTRICTED WEAK INTEGER COMPOSITION GENERATION FOR SHARED MEMORY MACHINES","year":2013,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Distributed systems and fault tolerance","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":"University of Manitoba","funders":"","keywords":"Integer (computer science); Bounded function; Order (exchange); Integer programming; Mathematics; Combinatorics; Parallel algorithm; Computer science; Parallel computing; Algorithm; Discrete mathematics","authors":[{"name":"Daniel R. Page","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02030110114732653,"gpt":0.25457994559021,"spread":0.2342788444428834,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005976839,0.0007579889,0.0006751196,0.0006754243,0.0008631373,0.0008060065,0.001014249,0.0004969616,0.006495429],"category_scores_gemma":[0.001414006,0.0003486855,0.0008312878,0.0008804267,0.0005872782,0.00128394,0.00115366,0.0008620285,0.001428487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007007509,"about_ca_system_score_gemma":0.001261334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001241146,"about_ca_topic_score_gemma":0.002024628,"domain_scores_codex":[0.9994936,0.00008749837,0.00004077505,0.0001108698,0.0001805062,0.00008681099],"domain_scores_gemma":[0.9994819,0.0001952036,0.00003077075,0.0001194727,0.0001449212,0.00002784363],"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.0009075938,0.0002978116,0.001428774,0.0003662561,0.000107204,0.0004343708,0.0004201066,0.1282051,0.04972749,0.1583575,0.009512794,0.6502351],"study_design_scores_gemma":[0.0002504288,0.000221384,0.0003142648,0.00001671347,0.00005363526,0.0002809541,0.00008095277,0.8401846,0.03781093,0.1023065,0.0184399,0.00003962752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02344859,0.00008601504,0.9688639,0.0001282877,0.00006190813,0.0001687586,0.00007035195,0.001580683,0.005591515],"genre_scores_gemma":[0.194446,0.00008426448,0.7978991,0.00008673808,0.00004047533,0.0002604693,0.0003877956,0.0002679595,0.006527181],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006495429,"threshold_uncertainty_score":0.02172935,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2418965201","doi":"10.1142/s0129626416500080","title":"Pitfalls in Memory Consistency Modelling","year":2016,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization Techniques","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":"University of Calgary","funders":"","keywords":"Consistency (knowledge bases); Consistency model; Computer science; Sequential consistency; Data consistency; Theoretical computer science; Distributed computing; Artificial intelligence","authors":[{"name":"Lisa Highám","is_ca":true},{"name":"Jalal Kawash","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02377330247219279,"gpt":0.2452968953228121,"spread":0.2215235928506193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02605128,0.001392375,0.001985191,0.002385914,0.003093982,0.007752239,0.009432787,0.004012618,0.005196761],"category_scores_gemma":[0.07016413,0.001803244,0.002481993,0.003616286,0.008846247,0.02273645,0.007189631,0.009988497,0.002074925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003529508,"about_ca_system_score_gemma":0.00477064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005080611,"about_ca_topic_score_gemma":0.004638745,"domain_scores_codex":[0.9721556,0.01198792,0.003393847,0.002923537,0.007986641,0.001552493],"domain_scores_gemma":[0.9469584,0.02288114,0.002622568,0.01796163,0.008879855,0.0006963955],"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.000094757,0.00004364747,0.0008552213,0.0005347935,0.00005520142,0.0002641171,0.001018723,0.01965192,0.0006872096,0.9140772,0.01036079,0.05235628],"study_design_scores_gemma":[0.00002877619,0.00004454542,0.0001558721,0.0004142881,0.00003672147,0.00048009,0.0003870168,0.04419635,0.002941035,0.9155605,0.03566679,0.00008804454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008869835,0.003995278,0.9539253,0.01417336,0.000980286,0.0001780363,0.0002708256,0.001924298,0.01568284],"genre_scores_gemma":[0.2902539,0.005405469,0.6869109,0.004877081,0.001112303,0.0007796724,0.000437258,0.001839588,0.008383703],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02605128,"threshold_uncertainty_score":0.137774,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4408042918","doi":"10.1142/s0129626425500021","title":"Dimensional Broadcast Schemes for Generalized Knödel Graphs","year":2025,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Cooperative Communication and Network Coding","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":"Concordia University","funders":"","keywords":"Computer science; Mathematics; Theoretical computer science; Combinatorics; Discrete mathematics","authors":[{"name":"M.H. Fakharan","is_ca":true},{"name":"Hovhannes A. Harutyunyan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03188071808304565,"gpt":0.3001099265790213,"spread":0.2682292084959756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007312224,0.0002247541,0.0003565504,0.0006061343,0.0009017427,0.0008315599,0.0007040744,0.0005723995,0.003171909],"category_scores_gemma":[0.00338944,0.0001888131,0.0003310365,0.0006528875,0.001187519,0.001684521,0.001180378,0.0008558547,0.0003467023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001298852,"about_ca_system_score_gemma":0.0006482339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0011892,"about_ca_topic_score_gemma":0.001611332,"domain_scores_codex":[0.9992938,0.0002408992,0.00003151021,0.0001026668,0.0001912424,0.0001398785],"domain_scores_gemma":[0.9982898,0.0007310649,0.0001993985,0.0004497106,0.0002114776,0.0001185134],"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.0001583495,0.0000244641,0.0004538872,0.0001035994,0.00001252683,0.00006846407,0.0003805274,0.02242894,0.01235391,0.937131,0.002504815,0.02437944],"study_design_scores_gemma":[0.00009610441,0.0001916631,0.0008545858,0.00008766895,0.0000304424,0.0003856711,0.0006434779,0.1732863,0.01641458,0.7858386,0.02206727,0.0001036402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3929073,0.0009412146,0.5569686,0.0007760875,0.0001661431,0.0001942884,0.0004863713,0.0006155611,0.04694454],"genre_scores_gemma":[0.9254248,0.0004811566,0.0685794,0.0001997703,0.00004340158,0.000156228,0.0002433124,0.00008050157,0.004791537],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003171909,"threshold_uncertainty_score":0.01061112,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166306467","doi":"10.1142/s0129626407003046","title":"HOW SOLUTION DENSITY AFFECTS THE FINDING OF SPATIALLY ROBUST SOLUTIONS","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Evolutionary Algorithms and Applications","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 Guelph","funders":"National Science Council","keywords":"Robustness (evolution); Mathematical optimization; Computer science; Parameter space; Mathematics; Algorithm; Statistics","authors":[{"name":"Grzegorz Drzadzewski","is_ca":true},{"name":"Mark Wineberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03180162966349293,"gpt":0.244881691293984,"spread":0.2130800616304911,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005878791,0.0006038849,0.0009187471,0.001460783,0.0006677133,0.00192658,0.0009572146,0.001544866,0.00168212],"category_scores_gemma":[0.06198113,0.0005679687,0.0006657858,0.0007960101,0.002112119,0.002964928,0.001759669,0.001076782,0.0002653793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006491817,"about_ca_system_score_gemma":0.0005073594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001076346,"about_ca_topic_score_gemma":0.000661758,"domain_scores_codex":[0.9973507,0.0009165492,0.0002120352,0.0004463802,0.0008265713,0.000247878],"domain_scores_gemma":[0.9496149,0.04143047,0.003073077,0.003156973,0.002176212,0.0005483031],"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.0006841726,0.0002673076,0.02439209,0.000517467,0.0003669166,0.0007486938,0.00079586,0.7722806,0.08298822,0.03172523,0.0007076275,0.08452588],"study_design_scores_gemma":[0.000120138,0.0009931448,0.02026032,0.00008858745,0.0002571538,0.00133527,0.0004667736,0.8723318,0.06440046,0.03746006,0.002144805,0.0001414085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7895495,0.0008289139,0.2028271,0.0006422705,0.00005776819,0.0001063497,0.0001068945,0.0003777636,0.005503376],"genre_scores_gemma":[0.9779121,0.0001340025,0.02141429,0.00003639187,0.0000125753,0.00004028727,0.00004673405,0.00006237863,0.0003413746],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005878791,"threshold_uncertainty_score":0.03109038,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2771947453","doi":"10.1142/s0129626417500074","title":"A Parallel Local Search Algorithm for Clustering Large Biological Networks","year":2017,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University; Algoma University","funders":"","keywords":"Cluster analysis; Computer science; Set (abstract data type); Algorithm; Cluster (spacecraft); Canopy clustering algorithm; Quality (philosophy); CURE data clustering algorithm; Correlation clustering; Data stream clustering; Data mining; Artificial intelligence","authors":[{"name":"Gaetano Coccimiglio","is_ca":true},{"name":"Salimur Choudhury","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02437830927219367,"gpt":0.2814118185182725,"spread":0.2570335092460788,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009627361,0.0008606534,0.001095373,0.001354177,0.001152739,0.000988806,0.001789916,0.001133636,0.004187588],"category_scores_gemma":[0.002378581,0.0005770257,0.0008586453,0.002096899,0.0008241287,0.001004726,0.001356917,0.001332912,0.002413668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001171319,"about_ca_system_score_gemma":0.001494296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005132589,"about_ca_topic_score_gemma":0.00737373,"domain_scores_codex":[0.9993857,0.0001468831,0.00003112845,0.0001467961,0.0002446244,0.00004486256],"domain_scores_gemma":[0.9993883,0.0002033807,0.00007163519,0.0001203948,0.0001711295,0.00004515899],"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.0003238995,0.00011751,0.0009275171,0.0002805211,0.0001769945,0.0001960819,0.0002722724,0.5708854,0.01917767,0.01982387,0.01817616,0.3696422],"study_design_scores_gemma":[0.00005654163,0.00003851192,0.000138554,0.00001000534,0.00001579745,0.00007170239,0.00002106449,0.9817048,0.003226751,0.01046663,0.004235471,0.000014152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003763298,0.000229205,0.9922377,0.0001203376,0.00003099956,0.0000712568,0.00008238264,0.002396794,0.001067945],"genre_scores_gemma":[0.06142708,0.0001813068,0.9324805,0.0001537561,0.00003948547,0.0004606108,0.000529387,0.0005073181,0.004220468],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005132589,"threshold_uncertainty_score":0.01400888,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021984249","doi":"10.1142/s0129626407003034","title":"COMPARING MINIMUM NEIGHBORHOOD EVALUATION SCHEMES FOR FINDING SPATIALLY ROBUST SOLUTIONS","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Advanced Multi-Objective Optimization Algorithms","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 Guelph","funders":"National Science Council","keywords":"Robustness (evolution); Fitness function; Mathematical optimization; Neighbourhood (mathematics); Computer science; Algorithm; Mathematics; Genetic algorithm","authors":[{"name":"Grzegorz Drzadzewski","is_ca":true},{"name":"Mark Wineberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08517098334736357,"gpt":0.3201502356648206,"spread":0.234979252317457,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00581945,0.0007614169,0.00125657,0.002661454,0.0004732269,0.001105958,0.001271553,0.001622671,0.001362217],"category_scores_gemma":[0.02343068,0.0003260635,0.001062424,0.001630661,0.0008632701,0.002242066,0.001423997,0.0007159321,0.0002578161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001265264,"about_ca_system_score_gemma":0.000559472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001797221,"about_ca_topic_score_gemma":0.001625225,"domain_scores_codex":[0.99768,0.0008718818,0.0002063986,0.0002029231,0.0009323388,0.0001065043],"domain_scores_gemma":[0.9903342,0.006805597,0.0005390194,0.001020546,0.001150629,0.0001500541],"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.0006523289,0.0001298059,0.002719269,0.0003726691,0.0001923625,0.0000761101,0.000273334,0.7203446,0.006582792,0.03346517,0.001018186,0.2341733],"study_design_scores_gemma":[0.00003959879,0.0003344009,0.001418777,0.00004872811,0.00005496458,0.00009258195,0.00007864292,0.9824809,0.005735902,0.00849478,0.001181061,0.00003960071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.166894,0.002990282,0.8216618,0.0003240283,0.0001274384,0.0002784458,0.0001188324,0.0004454799,0.00715974],"genre_scores_gemma":[0.6086766,0.0009675291,0.3875316,0.00006218719,0.00004576248,0.0003026898,0.000215294,0.0001500296,0.002048206],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00581945,"threshold_uncertainty_score":0.03077656,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2897010537","doi":"10.1142/s012962641850010x","title":"The Importance of Applying Security Practices in Wireless Communication: Bluetooth Low Energy and RFID","year":2018,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Bluetooth and Wireless Communication Technologies","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":"Algoma University; Lakehead University","funders":"","keywords":"Sophistication; Bluetooth; Computer science; Exploit; Wireless; Computer security; Bluetooth Low Energy; Field (mathematics); Radio-frequency identification; Identification (biology); Internet of Things; Energy (signal processing); Creativity; Internet privacy; Telecommunications","authors":[{"name":"Joseph P. Tassone","is_ca":true},{"name":"Mike Biocchi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02021366403274929,"gpt":0.2718418950323758,"spread":0.2516282309996265,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005668881,0.000692354,0.0003344057,0.001079087,0.002684121,0.00663705,0.001108912,0.003988628,0.003207972],"category_scores_gemma":[0.0112182,0.0004668114,0.0003173708,0.0014153,0.01192787,0.009283714,0.002997444,0.006955665,0.002397304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001707241,"about_ca_system_score_gemma":0.001690893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001409608,"about_ca_topic_score_gemma":0.00158296,"domain_scores_codex":[0.9926426,0.002630586,0.0003654121,0.0005931874,0.003499455,0.0002687982],"domain_scores_gemma":[0.9885173,0.006269953,0.001180268,0.001098104,0.002503406,0.0004309633],"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.0001321817,0.0001721088,0.00239251,0.00129962,0.0000386828,0.0008315952,0.01269932,0.001391556,0.01274516,0.4780918,0.03546607,0.4547394],"study_design_scores_gemma":[0.0000241448,0.0002537457,0.002063636,0.00142631,0.00003125395,0.002855972,0.00643518,0.001916289,0.01053095,0.2087393,0.7655917,0.0001315735],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.02435124,0.09449242,0.3177132,0.3357529,0.009413763,0.0002130511,0.00004193538,0.0006068053,0.2174148],"genre_scores_gemma":[0.4778986,0.104578,0.24047,0.06173406,0.00945951,0.0004563009,0.00007918687,0.0006346394,0.1046897],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00663705,"threshold_uncertainty_score":0.02998024,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015861674","doi":"10.1142/s0129626407003010","title":"PARALLEL ALGORITHMS FOR CELLULAR MODELS SIMULATION","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":0,"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":"DEVS; Computer science; Rollback; Parallel computing; Formalism (music); Execution time; Kernel (algebra); Discrete event simulation; Modeling and simulation; Distributed computing; Algorithm; Theoretical computer science; Simulation; Programming language; Database transaction; Mathematics","authors":[{"name":"Shafagh Jafer","is_ca":true},{"name":"Gabriel Wainer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1887998226557505,"gpt":0.4272595805106424,"spread":0.2384597578548919,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007820938,0.0006659416,0.0008048667,0.000570754,0.0006923625,0.001183215,0.001191156,0.0007956996,0.004414967],"category_scores_gemma":[0.003243021,0.0004151959,0.0009313452,0.0007724929,0.0007858475,0.001088073,0.001460768,0.001228409,0.0008336778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001577457,"about_ca_system_score_gemma":0.001202909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005638199,"about_ca_topic_score_gemma":0.004225269,"domain_scores_codex":[0.9994324,0.0001811243,0.0000366816,0.00007248785,0.0002186903,0.00005850349],"domain_scores_gemma":[0.9989833,0.0005443661,0.00005754326,0.0001927345,0.0001796108,0.00004243083],"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.00004162162,0.00002074394,0.0003810673,0.00007082048,0.00002615432,0.00005242193,0.0000788724,0.7368381,0.001117509,0.2265664,0.001798341,0.03300793],"study_design_scores_gemma":[0.000009816855,0.000004181424,0.00002003752,0.000004270732,0.000002902721,0.00001023983,0.000007636309,0.9543946,0.0003936005,0.04232794,0.002821791,0.000002866794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004640877,0.0001734073,0.9901034,0.0001459693,0.00003945215,0.00004026682,0.00007670987,0.0005265762,0.004253435],"genre_scores_gemma":[0.2537121,0.00062143,0.7368708,0.0001100108,0.0000708299,0.0005957066,0.0004845338,0.0003722742,0.007162285],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005638199,"threshold_uncertainty_score":0.01476955,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}