{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003454582,0.0002269324,0.0002247679,0.00006635059,0.0003265089,0.0002970971,0.002479109,0.00004274689,0.00000416571],"category_scores_gemma":[0.00001496139,0.0001340764,0.0001252204,0.0006259598,0.0002967659,0.0003038583,0.0008368783,0.0001997906,0.00001686299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008935712,"about_ca_system_score_gemma":0.00008597102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004207897,"about_ca_topic_score_gemma":0.0001097331,"domain_scores_codex":[0.9981377,0.00009047538,0.0003331449,0.0005072433,0.0005220199,0.0004094226],"domain_scores_gemma":[0.9985953,0.0001735993,0.0001911081,0.0008773914,0.0001088687,0.00005374582],"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.0001009132,0.0008843594,0.04203988,0.000444846,0.0001510745,0.00006029832,0.01041973,0.4266039,0.007561051,0.05202494,0.1751395,0.2845694],"study_design_scores_gemma":[0.0008486331,0.00009362082,0.2322199,0.0001559591,0.00003326853,0.00005206293,0.00006045645,0.7344161,0.0003892899,0.01148662,0.01955581,0.0006882502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06259584,0.00008565,0.8917371,0.04454631,0.0003729513,0.0003091973,0.00000259798,0.0001175853,0.0002327744],"genre_scores_gemma":[0.8475799,6.661131e-7,0.1401577,0.01185739,0.0003329932,0.00001237351,0.000001503636,0.00001829993,0.00003914533],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7849841,"threshold_uncertainty_score":0.5467478,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0004177902,0.0002211494,0.0003661695,0.0001320558,0.0006047795,0.0006881669,0.0057139,0.0001566095,0.000001110126],"category_scores_gemma":[0.0001937638,0.0002079953,0.0000476372,0.0001282675,0.0001587616,0.0008738552,0.001284604,0.0004797657,0.00001004973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002199647,"about_ca_system_score_gemma":0.00009578006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002633414,"about_ca_topic_score_gemma":0.000003080533,"domain_scores_codex":[0.998073,0.00005210149,0.0004135607,0.0007144472,0.000411995,0.0003349296],"domain_scores_gemma":[0.9957194,0.00006427954,0.0006430169,0.003400446,0.00008702037,0.0000858095],"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.0000548526,0.0003539445,0.00213283,0.0001414692,0.00004077183,0.000009127045,0.001508084,0.769765,0.001097199,0.001955559,0.04003434,0.1829069],"study_design_scores_gemma":[0.0002882665,0.00003295188,0.0002886278,0.00020319,0.00000746493,0.000001945475,0.000006294069,0.9970658,0.0005168631,0.0008763855,0.0004697969,0.000242352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002663595,0.0001214561,0.9902742,0.004873535,0.0001826714,0.0001338091,0.000009259084,0.0003358173,0.001405687],"genre_scores_gemma":[0.5961292,0.0000073653,0.4025352,0.001196356,0.00006629259,0.000005978119,0.00001823006,0.00001208343,0.00002933361],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5934656,"threshold_uncertainty_score":0.9996657,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003708709,0.0001795757,0.0001815209,0.0001095506,0.0003168926,0.0002376697,0.0006617301,0.0000562823,0.000003767999],"category_scores_gemma":[0.0001117144,0.0001731322,0.00007773843,0.0002153063,0.00005096478,0.0006186691,0.0001113443,0.00009601045,0.00001637843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003973018,"about_ca_system_score_gemma":0.00004339943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008060269,"about_ca_topic_score_gemma":3.255256e-7,"domain_scores_codex":[0.998637,0.00003728842,0.0002590016,0.0003141398,0.0001854975,0.0005670293],"domain_scores_gemma":[0.9991472,0.0001821752,0.0001479579,0.0003284432,0.00006223996,0.0001319307],"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.0001570815,0.001126795,0.02577698,0.001334229,0.0001715165,0.00001850523,0.01579664,0.0659976,0.009209394,0.03929773,0.1496868,0.6914268],"study_design_scores_gemma":[0.0009431766,0.0001029242,0.001768693,0.0001082688,0.00003264378,0.00005870228,0.00002477067,0.9337899,0.00202758,0.004297578,0.05578801,0.001057754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002401253,0.0002704883,0.994279,0.001464986,0.000263107,0.000211921,0.000002344823,0.0007327472,0.0003741026],"genre_scores_gemma":[0.4202707,0.000003264777,0.5767775,0.002653256,0.000160552,0.00006509002,0.000007289739,0.00001428607,0.00004809703],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8677923,"threshold_uncertainty_score":0.7060126,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000209378,0.0001584578,0.0002115333,0.00009154529,0.0001706316,0.0001887273,0.0008191264,0.00006805233,0.000001888221],"category_scores_gemma":[0.00005057922,0.0001527443,0.0001032722,0.0004237713,0.00006778994,0.0003496649,0.00007210833,0.0001236842,0.000006485449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002869107,"about_ca_system_score_gemma":0.00007495563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004782333,"about_ca_topic_score_gemma":1.940877e-7,"domain_scores_codex":[0.9987241,0.00002016124,0.0002935192,0.0003955223,0.0002319852,0.0003347264],"domain_scores_gemma":[0.9991451,0.00005583434,0.0002045282,0.0004442507,0.00007916139,0.00007114072],"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.00001316253,0.0002318792,0.00002298849,0.0001690608,0.00002056901,0.00000640083,0.002584895,0.0002367475,0.04771537,0.1341132,0.0006116281,0.8142741],"study_design_scores_gemma":[0.002391421,0.0006302075,0.002889322,0.0009652382,0.000125216,0.00004302183,0.0002837348,0.6006102,0.1002309,0.2597884,0.03021474,0.001827586],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006696166,0.0002093128,0.9827738,0.009341409,0.00005047892,0.0004113885,0.000002400478,0.0003286389,0.0001864272],"genre_scores_gemma":[0.4921736,0.000001838076,0.506662,0.001032858,0.00004246001,0.00006402137,0.000007299583,0.000007124513,0.000008827313],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8124465,"threshold_uncertainty_score":0.6228729,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003748078,0.0001425179,0.0001392856,0.000060609,0.0002544534,0.0001333157,0.00103054,0.00003745409,0.000006263417],"category_scores_gemma":[0.00008531341,0.00009091594,0.00006486007,0.0002763155,0.0001233901,0.0001259492,0.0001256547,0.0004563646,0.000009972032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005682641,"about_ca_system_score_gemma":0.00003893848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005077383,"about_ca_topic_score_gemma":0.000002000254,"domain_scores_codex":[0.9988707,0.00003618946,0.0002198948,0.0003114109,0.0002831849,0.0002786363],"domain_scores_gemma":[0.9990345,0.0002012866,0.0001805447,0.0005009641,0.00003617011,0.00004650898],"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.00003273199,0.0002519733,0.007309795,0.0002189436,0.00006067343,0.00008832802,0.009092038,0.02877193,0.1698807,0.6530202,0.008419123,0.1228535],"study_design_scores_gemma":[0.0002302358,0.00005110666,0.003753986,0.0001010155,0.00000491545,0.00003261543,0.00001690394,0.9525217,0.002004659,0.04017971,0.000816019,0.0002870813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7342896,0.00002660565,0.2442371,0.02067349,0.0002541771,0.00006914289,2.668692e-7,0.0001013191,0.0003482463],"genre_scores_gemma":[0.9542525,6.43211e-7,0.04004621,0.005569735,0.0001017169,0.00000606802,4.151986e-7,0.00001062843,0.00001209332],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9237498,"threshold_uncertainty_score":0.3707444,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003394546,0.0001531107,0.0001478225,0.00003552534,0.000384353,0.0001144381,0.0002630625,0.00004226527,0.00004721741],"category_scores_gemma":[0.00000619807,0.0001467659,0.00006648128,0.0002196066,0.00009417983,0.0001494993,0.00004977306,0.0002315578,0.0000928573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003925671,"about_ca_system_score_gemma":0.0000305004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003769176,"about_ca_topic_score_gemma":0.000001982801,"domain_scores_codex":[0.9989054,0.00003080719,0.0003020944,0.0002485719,0.0001768667,0.0003362716],"domain_scores_gemma":[0.9992937,0.0000403861,0.0001750483,0.0003235689,0.00006657793,0.0001006548],"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.00007207977,0.0005242263,0.01056187,0.00004080147,0.00007163767,0.000001529352,0.0009020968,0.000088188,0.03167455,0.9210134,0.007551802,0.02749781],"study_design_scores_gemma":[0.004058501,0.0001072201,0.03974525,0.0004384393,0.0003679744,0.00001252466,0.001742857,0.3795924,0.01011108,0.4116165,0.1497473,0.002459906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2738082,0.0000396794,0.7209029,0.004458665,0.00003571316,0.0001431876,0.00001270856,0.00008207139,0.0005169412],"genre_scores_gemma":[0.9969757,0.000001510596,0.002034229,0.0002971241,0.0001231098,0.00004116589,0.0004424574,0.00002154775,0.0000631959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7231675,"threshold_uncertainty_score":0.5984939,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032288,0.0001361222,0.0001613445,0.00003971771,0.0001886322,0.00003027474,0.0002702921,0.00003859485,0.0000137277],"category_scores_gemma":[0.0000550405,0.00009219437,0.00008497822,0.0002459257,0.0001153849,0.00006233176,0.00001129083,0.0001637509,0.000007892349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001029179,"about_ca_system_score_gemma":0.00001258385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001057568,"about_ca_topic_score_gemma":6.514293e-7,"domain_scores_codex":[0.9991561,0.00004805786,0.0002243347,0.0001800982,0.0001979472,0.0001934737],"domain_scores_gemma":[0.9992548,0.0002398668,0.0001017924,0.0003329721,0.00003591007,0.00003470638],"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.0001839432,0.0007216607,0.0004853522,0.000214536,0.00007261964,0.000008441004,0.004820444,0.002029083,0.1401851,0.8238999,0.01782757,0.009551331],"study_design_scores_gemma":[0.0002790308,0.00007354665,0.001922399,0.0002202462,0.00007336619,0.00000605283,0.0002457772,0.001656149,0.009067645,0.9853295,0.0007909249,0.0003353297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9777623,0.00004013612,0.008881018,0.01119675,0.00001475761,0.0002336995,0.000003923928,0.00007801128,0.001789425],"genre_scores_gemma":[0.9884741,0.000003657654,0.008685655,0.002742748,0.00001378522,0.00001282064,0.000002323472,0.00001250176,0.0000524442],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1614297,"threshold_uncertainty_score":0.3759578,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000966819,0.0002706191,0.0002170316,0.0003001399,0.0004738326,0.0006463898,0.001174193,0.0000855207,0.000001477443],"category_scores_gemma":[0.00001952889,0.0001998043,0.00007407594,0.0008582677,0.0001341162,0.001442403,0.0002627616,0.0005111596,0.00002786446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008625721,"about_ca_system_score_gemma":0.0001042446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005482096,"about_ca_topic_score_gemma":0.00001265205,"domain_scores_codex":[0.9978917,0.00007809378,0.0004884999,0.000378269,0.0004589333,0.0007045279],"domain_scores_gemma":[0.9990908,0.0001176691,0.0002591083,0.0003546879,0.00007797391,0.0000997875],"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.00003807775,0.00006347482,0.001140394,0.0001246132,0.0000119926,0.0000910216,0.01412375,0.2368122,0.0002162813,0.002508417,0.001091402,0.7437783],"study_design_scores_gemma":[0.0005776952,0.00003153962,0.01167304,0.0001358496,0.000004303243,0.00007029514,0.00009840511,0.9820736,0.00002912931,0.0006624191,0.004325949,0.0003177768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1502417,0.0001956385,0.8405007,0.008142739,0.0002559257,0.0001847181,3.592323e-7,0.0002509952,0.0002272252],"genre_scores_gemma":[0.8835825,0.000004192146,0.109636,0.006520881,0.000222775,0.000005849574,0.000004978379,0.00001381634,0.00000900925],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7452614,"threshold_uncertainty_score":0.8147784,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008074768,0.0005102435,0.0006067989,0.0002144922,0.0006652394,0.001056116,0.001393976,0.0001623529,7.003494e-7],"category_scores_gemma":[0.0001822416,0.0004627379,0.000194918,0.0006552972,0.00007822277,0.0008821369,0.0001481857,0.0002582332,0.00002018597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000207642,"about_ca_system_score_gemma":0.0001396073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001865946,"about_ca_topic_score_gemma":0.000007937278,"domain_scores_codex":[0.9960344,0.0001112873,0.0008225183,0.001222349,0.0005952373,0.001214146],"domain_scores_gemma":[0.9981751,0.0002693741,0.0005099635,0.0005911476,0.0002864493,0.0001679693],"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.00002870333,0.002412877,0.0269992,0.02834608,0.0002304778,0.000190411,0.004540275,0.809241,0.003576152,0.07112003,0.01979993,0.03351486],"study_design_scores_gemma":[0.001595903,0.00004253701,0.0008424631,0.0004676103,0.00005114391,0.00008488047,0.0002218134,0.9946057,0.00003417445,0.0002008485,0.001090735,0.0007621702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005063436,0.001324726,0.9894514,0.0009635609,0.000250987,0.001281679,0.00003352977,0.0009963477,0.0006343054],"genre_scores_gemma":[0.8760888,0.000002373414,0.1203401,0.0005809506,0.0004593353,0.002258475,0.00006388145,0.00005911518,0.000147016],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8710253,"threshold_uncertainty_score":0.9999809,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001897104,0.0001775951,0.0002351263,0.000163166,0.0001361553,0.0002004942,0.001434009,0.00005721499,9.992638e-7],"category_scores_gemma":[0.00003764818,0.0001347602,0.00007672874,0.000816253,0.00008357785,0.0003302027,0.0001049548,0.0002599501,0.00001289478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003658521,"about_ca_system_score_gemma":0.00006563405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006855611,"about_ca_topic_score_gemma":0.000006158907,"domain_scores_codex":[0.9981352,0.00009974449,0.0005166649,0.0003677035,0.0003949636,0.0004857045],"domain_scores_gemma":[0.9990339,0.0001761316,0.0002690871,0.0004115432,0.00005559758,0.00005376862],"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.0001778164,0.00144195,0.05940817,0.001835763,0.0002011405,0.001108129,0.04839164,0.3500284,0.01920051,0.01730489,0.01767832,0.4832233],"study_design_scores_gemma":[0.004328668,0.0002539755,0.04651311,0.001544711,0.00004370943,0.0005015864,0.001962326,0.846507,0.001041296,0.001507128,0.09367541,0.002121065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05000691,0.0004232726,0.9459471,0.001964753,0.0002837059,0.0002374659,0.000001225961,0.0000836652,0.001051907],"genre_scores_gemma":[0.8901123,0.000001678391,0.1081724,0.001467778,0.0002048388,0.00002005305,0.000004845927,0.000007688416,0.0000083953],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8401055,"threshold_uncertainty_score":0.549536,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003395284,0.0002347881,0.0001973692,0.0001523918,0.0002479229,0.0003312908,0.000809902,0.00007803462,0.000006668208],"category_scores_gemma":[0.00004214938,0.0002167871,0.00008467706,0.000677401,0.0001085436,0.0003305842,0.0001701509,0.0005806679,0.00002661877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003309435,"about_ca_system_score_gemma":0.0000588453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003846505,"about_ca_topic_score_gemma":0.00001780953,"domain_scores_codex":[0.9981586,0.00005234168,0.000309035,0.0005679612,0.0003551928,0.000556814],"domain_scores_gemma":[0.9992283,0.00007143192,0.0001429685,0.0004048785,0.00004443771,0.000107992],"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.0004780005,0.001325097,0.007176627,0.0004960378,0.0001303802,0.0003316292,0.01519349,0.05716311,0.1992215,0.06322556,0.01000906,0.6452495],"study_design_scores_gemma":[0.001670442,0.0001188507,0.007121766,0.0001090687,0.000007704083,0.0000158281,0.0000228447,0.9764289,0.00141966,0.002306299,0.01017272,0.0006059251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4472169,0.00007761281,0.5467864,0.004818402,0.0007667705,0.00009101559,0.000001230405,0.0001420009,0.00009966706],"genre_scores_gemma":[0.9035467,0.000005065868,0.09546484,0.0007578902,0.0001698797,0.00002282404,0.00001618369,0.00001265683,0.000003950174],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9192657,"threshold_uncertainty_score":0.8840322,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002603836,0.0001414558,0.00009517487,0.00009198583,0.0002785703,0.0004380599,0.0005849476,0.00004109521,0.000005442437],"category_scores_gemma":[0.000008077221,0.0001206789,0.00002539261,0.0005197446,0.00004546764,0.00125991,0.00003650413,0.0001501537,0.00006633897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003124602,"about_ca_system_score_gemma":0.0000470359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001464191,"about_ca_topic_score_gemma":0.00001235206,"domain_scores_codex":[0.9987967,0.00002458965,0.0002495313,0.000332261,0.0003494798,0.0002474355],"domain_scores_gemma":[0.9990618,0.000006940095,0.0001710282,0.0005009773,0.000114206,0.0001449957],"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.0003568731,0.001076572,0.007928386,0.000361125,0.00003665111,0.000005437198,0.009819651,0.004219044,0.2480074,0.3798415,0.006119871,0.3422275],"study_design_scores_gemma":[0.002369082,0.0008499013,0.05396672,0.0001542842,0.00002202847,0.00005051222,0.0003308539,0.735763,0.01498203,0.00320242,0.1867737,0.001535479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09426926,0.000001404401,0.8982108,0.004201866,0.00003586122,0.002931624,0.000002789152,0.0002516026,0.00009480457],"genre_scores_gemma":[0.911433,2.342087e-7,0.07988486,0.002579142,0.00005436386,0.005944037,0.00009270949,0.000009068824,0.00000257646],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8183259,"threshold_uncertainty_score":0.4921144,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000226112,0.00008502756,0.0001091957,0.00001702806,0.0001354796,0.000105245,0.0002043916,0.00002134014,0.000004268571],"category_scores_gemma":[0.00001210126,0.00005300475,0.00001759227,0.00007682092,0.00008805527,0.0002090334,0.00004376272,0.00006736375,0.000001284875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006651873,"about_ca_system_score_gemma":0.0000072514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004319649,"about_ca_topic_score_gemma":0.000006914998,"domain_scores_codex":[0.9993908,0.00005062904,0.0001338278,0.0001911299,0.0001126283,0.0001209382],"domain_scores_gemma":[0.9996189,0.00008584292,0.00009523465,0.0001479876,0.00002353776,0.00002847158],"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.0003937081,0.0003629823,0.0513706,0.001300914,0.0003131669,0.00009711452,0.1543042,0.007946841,0.01145406,0.6715754,0.03554623,0.06533483],"study_design_scores_gemma":[0.003296763,0.001113762,0.07162573,0.003199793,0.00008177715,0.0003123389,0.003349882,0.8272989,0.00955329,0.06160552,0.01564953,0.002912735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7140862,0.0006943053,0.2794071,0.002558114,0.0002173193,0.00009822097,4.77835e-7,0.00004199886,0.002896249],"genre_scores_gemma":[0.9968008,0.00001488059,0.002148822,0.0009231397,0.00002729707,0.000003776618,1.170306e-7,0.000004068378,0.00007708921],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.819352,"threshold_uncertainty_score":0.2161471,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000366439,0.0001265453,0.000134491,0.00004273518,0.00008340137,0.0000182267,0.000187647,0.00008324329,0.000002783675],"category_scores_gemma":[0.00005566816,0.0001078817,0.00007556728,0.0001318663,0.000113283,0.000002421704,0.00009605248,0.00007556529,0.000003494237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006981937,"about_ca_system_score_gemma":0.00002048426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000520478,"about_ca_topic_score_gemma":0.000001494865,"domain_scores_codex":[0.999029,0.00002582051,0.0002471542,0.0002767265,0.0001171834,0.0003041395],"domain_scores_gemma":[0.999603,0.00001405682,0.0001385691,0.0001383345,0.00004939968,0.00005663926],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003645414,0.00003054298,0.002159542,0.000034916,0.00001514455,0.00001645223,0.00003182402,0.0001834488,0.9793603,0.00007068748,0.0001171523,0.01794354],"study_design_scores_gemma":[0.0008946601,0.000313392,0.01544497,0.0001061761,0.00002460123,0.00007229962,0.00009860847,0.001084994,0.973166,0.000209783,0.008032911,0.0005516488],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7244086,0.0004501948,0.2723488,0.0001739866,0.00005242695,0.000054137,4.371832e-7,0.0000192342,0.002492166],"genre_scores_gemma":[0.9869743,0.000003384589,0.01134483,0.001437201,0.0001949466,4.990871e-7,0.00001844538,0.00001217591,0.00001423855],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2625656,"threshold_uncertainty_score":0.4399288,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004189235,0.0003226019,0.0003447966,0.0001678962,0.0004427237,0.0004103329,0.001145752,0.0001102783,0.000001605909],"category_scores_gemma":[0.0000642595,0.0003088197,0.0001249257,0.0005346456,0.00008048406,0.0006435569,0.0001182926,0.0001711892,0.00002636397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003456721,"about_ca_system_score_gemma":0.0001614259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003191678,"about_ca_topic_score_gemma":0.000005821944,"domain_scores_codex":[0.9977028,0.00005143573,0.0004418187,0.0007664725,0.0004011576,0.0006363649],"domain_scores_gemma":[0.9987338,0.00009176364,0.0003011397,0.000481467,0.0002593469,0.0001325093],"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.000640941,0.0006517097,0.003444006,0.003737764,0.0002714404,0.0002027361,0.0115709,0.6616376,0.01955766,0.003786796,0.02593915,0.2685593],"study_design_scores_gemma":[0.001120878,0.00004066903,0.0001705212,0.0002287466,0.00001238144,0.00005801415,0.0000603694,0.9943755,0.0002438149,0.0001138139,0.003138895,0.000436439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005143325,0.0005116219,0.9879333,0.002902443,0.0002268384,0.0005191013,0.000002217344,0.002147807,0.0006133046],"genre_scores_gemma":[0.4998614,0.00001746222,0.498289,0.001378395,0.00005257743,0.0001723152,0.000007190212,0.0000277179,0.0001939306],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4947181,"threshold_uncertainty_score":0.9999364,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006013756,0.0002229115,0.0002689484,0.0001415946,0.0005787816,0.0002005527,0.001113044,0.00006936792,0.000005264878],"category_scores_gemma":[0.00004857805,0.0001702771,0.0001295794,0.0004403162,0.0001189074,0.0007680392,0.0001446999,0.0001469545,0.00001039633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003734431,"about_ca_system_score_gemma":0.00007473966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002459275,"about_ca_topic_score_gemma":9.645258e-7,"domain_scores_codex":[0.9982938,0.000101031,0.0004268152,0.0004075445,0.0003274145,0.0004434549],"domain_scores_gemma":[0.9985077,0.0004357905,0.0003438528,0.0004639296,0.0001771861,0.00007153333],"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.00005558913,0.0001065003,0.00003655407,0.00004483006,0.00002145376,0.000002260767,0.0009516624,0.940899,0.0004750575,0.03980532,0.01112995,0.00647178],"study_design_scores_gemma":[0.0004063009,0.00007220868,0.0001126858,0.00007522333,0.00000910676,0.000008446719,0.00001251665,0.9727761,0.0001542899,0.02597848,0.0001800298,0.0002145932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01091127,0.00004548712,0.9769579,0.008326756,0.00005353239,0.0004073197,0.000002709101,0.0004749346,0.002820077],"genre_scores_gemma":[0.5209488,0.00002747707,0.4759495,0.002775956,0.00004617549,0.00007910174,0.00001126559,0.00001866029,0.0001431261],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5100375,"threshold_uncertainty_score":0.6943699,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007006744,0.0002399263,0.000338242,0.0002122143,0.0001832311,0.0001603547,0.0005686047,0.00009967424,0.000009935417],"category_scores_gemma":[0.00006851933,0.0002384636,0.0001026637,0.0006100678,0.0001115952,0.0006937423,0.00006049986,0.0001686025,0.0001244455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007304395,"about_ca_system_score_gemma":0.0001258045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002907056,"about_ca_topic_score_gemma":0.000001220927,"domain_scores_codex":[0.9978518,0.0002828814,0.0005646619,0.0005061983,0.000419401,0.0003750921],"domain_scores_gemma":[0.9987637,0.00009992199,0.0003967977,0.0004659059,0.0001773432,0.00009632089],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001399555,0.001292064,0.004367696,0.002418528,0.000338374,0.0001361735,0.009967103,0.1050224,0.6771902,0.01978951,0.1166748,0.06266317],"study_design_scores_gemma":[0.003566924,0.0005141725,0.002312235,0.001408883,0.0001146972,0.0003495794,0.0002780674,0.94781,0.02217433,0.008597542,0.01019759,0.002675981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008491338,0.0001963253,0.9839183,0.0008887229,0.0001279263,0.0002966458,0.000001488341,0.0006139083,0.005465314],"genre_scores_gemma":[0.2943852,0.00001171634,0.704715,0.0004277334,0.00005228951,0.00004440473,0.000006453576,0.0000295686,0.0003276478],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8427876,"threshold_uncertainty_score":0.9724264,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006597742,0.0001746929,0.000218041,0.0003033003,0.000208288,0.0003001092,0.00164963,0.00005451669,0.000001649716],"category_scores_gemma":[0.00002794209,0.000121975,0.00007480478,0.001088155,0.0001202878,0.0003219152,0.0002379757,0.0005206274,0.000004611961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001086486,"about_ca_system_score_gemma":0.00007964885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001297307,"about_ca_topic_score_gemma":0.00008221457,"domain_scores_codex":[0.9983808,0.00009667097,0.0003394187,0.0004176108,0.0003217352,0.0004437754],"domain_scores_gemma":[0.9991849,0.0001013344,0.000170746,0.0003963028,0.00006405407,0.00008268298],"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.0001602593,0.0004872762,0.01523605,0.0004773867,0.00006744778,0.00005756393,0.01572963,0.2370194,0.1979379,0.01451327,0.003301633,0.5150121],"study_design_scores_gemma":[0.0006594135,0.00005671308,0.01651006,0.0001240703,0.000005329813,0.00002241671,0.000008215277,0.9759807,0.0001479331,0.004376725,0.001868692,0.0002397508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2969018,0.00006000152,0.6667511,0.03576716,0.0001260573,0.0002785977,8.027555e-7,0.00007815599,0.00003626716],"genre_scores_gemma":[0.8943051,0.000001183898,0.1013986,0.004134927,0.00009678451,0.00004949401,5.34829e-7,0.00001099311,0.000002407362],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7389613,"threshold_uncertainty_score":0.4973998,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002349261,0.0001858805,0.0001717489,0.000048126,0.0001316208,0.00001911293,0.0002205137,0.0001360185,0.000006465486],"category_scores_gemma":[0.0000457131,0.0001939832,0.00007472366,0.0001041445,0.0001577782,0.000007890307,0.00004334221,0.00008044804,0.000007286088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003883766,"about_ca_system_score_gemma":0.00005646173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001153549,"about_ca_topic_score_gemma":0.000001873972,"domain_scores_codex":[0.9987713,0.0001190351,0.0002942114,0.0003579308,0.0001451168,0.0003124333],"domain_scores_gemma":[0.999392,0.00001693442,0.0001882091,0.0002533211,0.00007401651,0.00007552483],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007187197,0.00002933451,0.002554654,0.00002138624,0.00002242958,1.753597e-7,0.00001584994,0.386353,0.6013297,0.00002899262,0.008985196,0.0005873854],"study_design_scores_gemma":[0.001198382,0.0002609879,0.01501913,0.00003588992,0.00005598013,0.00002503481,0.00002764866,0.9729598,0.006598697,0.0002215366,0.003053529,0.0005434244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1125185,0.002719996,0.8841339,0.0002581532,0.00006977682,0.0001538146,0.000005784033,0.00002463633,0.0001154754],"genre_scores_gemma":[0.9600096,0.00007532144,0.0383358,0.0008851178,0.0001817562,0.00002584943,0.0002329194,0.00003078964,0.0002228103],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8474911,"threshold_uncertainty_score":0.7910404,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001059804,0.0002389622,0.0002340451,0.0001978769,0.000432999,0.0004428898,0.0005090905,0.0001171559,0.000006758544],"category_scores_gemma":[0.00008868874,0.0002235814,0.000129496,0.0004076752,0.00003454524,0.0005199384,0.00006666643,0.0002816956,0.00001455265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001175634,"about_ca_system_score_gemma":0.00002548653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002135508,"about_ca_topic_score_gemma":0.00001633372,"domain_scores_codex":[0.998068,0.00004865195,0.0004705574,0.0005610975,0.0002185765,0.0006330998],"domain_scores_gemma":[0.998875,0.0003156787,0.0002626351,0.0003109958,0.0001231945,0.0001125263],"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.0008662677,0.0003877451,0.001070496,0.0004423159,0.0002087479,0.00008913003,0.004836519,0.2954029,0.01239812,0.1519223,0.02628976,0.5060857],"study_design_scores_gemma":[0.0008792772,0.0001700725,0.0002979249,0.0002775101,0.000006776704,0.00005482229,0.000107157,0.994694,0.000228687,0.0007918069,0.002111235,0.0003807187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02166616,0.0001002296,0.9724277,0.00166656,0.001420056,0.00030807,2.904544e-7,0.0003451688,0.002065727],"genre_scores_gemma":[0.9547437,0.000001316811,0.03942327,0.004852021,0.0007699745,0.00004310867,0.000004115451,0.00002752179,0.0001349196],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9330776,"threshold_uncertainty_score":0.9117386,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004500052,0.0001153629,0.0001445079,0.00004718183,0.000176644,0.00007963544,0.0003086033,0.00005387042,0.00003267084],"category_scores_gemma":[0.00006189742,0.00006098465,0.00005908903,0.0001646603,0.0002183332,0.0002608523,0.00005797794,0.0001179902,0.00001220952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001974682,"about_ca_system_score_gemma":0.00001523946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006161874,"about_ca_topic_score_gemma":0.000001216085,"domain_scores_codex":[0.9989236,0.000136128,0.0002752435,0.0002914784,0.0001795322,0.0001940167],"domain_scores_gemma":[0.9988493,0.0006369115,0.0001578527,0.0002637278,0.0000513053,0.00004089267],"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.000179596,0.0004334068,0.03792872,0.000237107,0.0002917832,0.00004701209,0.003173105,0.03000777,0.007899729,0.6689319,0.1381275,0.1127424],"study_design_scores_gemma":[0.004424245,0.0006279274,0.1152316,0.002550908,0.00006107408,0.0004540683,0.0001634954,0.5483262,0.001058105,0.3194668,0.005802276,0.001833345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4210384,0.0001915434,0.5504815,0.02697773,0.0003252365,0.000173115,0.000001785449,0.00009606729,0.0007146109],"genre_scores_gemma":[0.9972873,0.000008283161,0.0003386207,0.002220186,0.0000398221,0.00002885407,9.546725e-7,0.000006354933,0.00006962448],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5762489,"threshold_uncertainty_score":0.2486882,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002115168,0.0002037227,0.0001765824,0.000501362,0.0003964716,0.0005091556,0.0005534039,0.00005309117,0.0000142794],"category_scores_gemma":[0.00002423013,0.0002067968,0.00008097151,0.001794139,0.00005370547,0.0008298026,0.0001057329,0.0001504172,0.0001395833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006576911,"about_ca_system_score_gemma":0.00009049887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004372262,"about_ca_topic_score_gemma":0.000006212099,"domain_scores_codex":[0.9982527,0.00006282851,0.0003738851,0.0004851733,0.000450553,0.0003748099],"domain_scores_gemma":[0.9992648,0.00009527602,0.0001786394,0.0002507847,0.0001298215,0.00008067461],"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.000008420526,0.0001941568,0.001164985,0.00005603431,0.00001762526,0.00002302721,0.0001825316,0.8872837,0.001799898,0.014785,0.02503831,0.0694463],"study_design_scores_gemma":[0.001717758,0.00007616451,0.05518393,0.00006123631,0.0000268167,0.00009205159,0.00001821728,0.897644,0.0004471907,0.01781229,0.02594748,0.0009728087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02622472,0.0007044913,0.9652174,0.005565215,0.0002537117,0.0001678969,0.000001317313,0.000321171,0.001544082],"genre_scores_gemma":[0.7114842,0.000004553132,0.2857383,0.002091408,0.0002539793,0.00003647138,0.00004900448,0.00001244832,0.0003296697],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6852595,"threshold_uncertainty_score":0.843293,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002596863,0.00007537448,0.0001007648,0.00005673423,0.00008501208,0.00008665206,0.0007635433,0.00002004578,0.000001404583],"category_scores_gemma":[0.00002022967,0.00005559404,0.00002044948,0.0004218026,0.00005436297,0.0002576536,0.0000482732,0.00009349352,0.00001451686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001589439,"about_ca_system_score_gemma":0.0000405372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005388849,"about_ca_topic_score_gemma":0.000006506019,"domain_scores_codex":[0.9992383,0.0000238446,0.0001986269,0.0002047948,0.0001539516,0.0001804512],"domain_scores_gemma":[0.9994885,0.00004854626,0.0001043559,0.0003098894,0.00001943357,0.00002922583],"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.000002501061,0.00006226432,0.0002188762,0.00001536373,0.000002910932,0.000005447617,0.003361938,0.0006495382,0.01636886,0.001256329,0.001857125,0.9761989],"study_design_scores_gemma":[0.0004701589,0.00005108803,0.02634137,0.0001343423,0.000007335421,0.00001543765,0.00009953773,0.9681873,0.0007548064,0.003051859,0.0006145266,0.0002722621],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09724024,0.0001422293,0.778702,0.1181955,0.00004991422,0.0002604868,0.000002531974,0.0002018986,0.005205255],"genre_scores_gemma":[0.7771667,0.000004663444,0.2208114,0.001902117,0.00004949441,0.00001572342,0.000004235821,0.000004607721,0.00004112656],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9759266,"threshold_uncertainty_score":0.2267059,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004849024,0.0001965762,0.0001967952,0.0002314957,0.0002769849,0.000397916,0.0004961011,0.00008309747,0.000009964504],"category_scores_gemma":[0.000161341,0.0002066416,0.00003184178,0.0005968109,0.0004924212,0.0009422462,0.0001994496,0.0003040971,0.00006557234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001015321,"about_ca_system_score_gemma":0.00005748972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001141449,"about_ca_topic_score_gemma":0.00007376685,"domain_scores_codex":[0.9981082,0.0001147752,0.000438112,0.0005749481,0.0002613396,0.0005026201],"domain_scores_gemma":[0.9993396,0.00008413378,0.0001735015,0.000221345,0.00009569261,0.0000856644],"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.00004916687,0.00007606739,0.008800765,0.00006769333,0.00001134945,0.00004976455,0.01583664,0.03281621,0.04934917,0.00957624,0.00001748051,0.8833495],"study_design_scores_gemma":[0.0000306489,0.0000510822,0.0008971682,0.0000979189,0.000004631204,0.00002905776,0.0003269823,0.9828299,0.006405465,0.008844657,0.0001957366,0.0002867252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2676418,0.0002762462,0.7302367,0.00131751,0.0001728769,0.00009697795,7.219296e-8,0.0001343965,0.0001234407],"genre_scores_gemma":[0.9206022,0.0000141865,0.07832079,0.000832969,0.0001952967,0.000008274822,5.417064e-7,0.00001495434,0.00001076484],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9500137,"threshold_uncertainty_score":0.84266,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006088815,0.0002549943,0.0002494624,0.00009107198,0.0002365423,0.0003751832,0.0007468818,0.00007022322,0.000001914305],"category_scores_gemma":[0.00004704763,0.0001365055,0.00004358578,0.0002720102,0.0002085941,0.0002441658,0.00005768538,0.0001710306,0.000006187312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003407071,"about_ca_system_score_gemma":0.00006506676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004475738,"about_ca_topic_score_gemma":0.000003001692,"domain_scores_codex":[0.9982534,0.000102089,0.0002989185,0.0005590399,0.0002928156,0.0004937295],"domain_scores_gemma":[0.9989979,0.0003857808,0.000168317,0.0003207363,0.00005273387,0.00007458431],"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.00114074,0.0004674269,0.008498827,0.0008405672,0.0002616593,0.0005591769,0.01334492,0.2893734,0.005098609,0.03487991,0.009171684,0.6363631],"study_design_scores_gemma":[0.01771683,0.001126942,0.007480984,0.004199626,0.0000764634,0.001199209,0.0005546178,0.944704,0.0005021426,0.007438177,0.01224591,0.00275508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1273492,0.0001217679,0.8622636,0.009552181,0.0001708269,0.0003512924,0.000007606995,0.00009048246,0.00009315408],"genre_scores_gemma":[0.8430383,0.000002240697,0.154497,0.002195109,0.0001841183,0.00004461372,0.000006164756,0.00001420493,0.00001826248],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7156891,"threshold_uncertainty_score":0.5566532,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007693267,0.0001788647,0.000134222,0.0001589234,0.00008171557,0.0002521806,0.0001242245,0.00004368078,0.00001464591],"category_scores_gemma":[0.00001196844,0.0001691748,0.00004855626,0.0003281183,0.00002360905,0.0002324357,0.00002364502,0.0001944995,0.0003840219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000764979,"about_ca_system_score_gemma":0.00002294678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002532512,"about_ca_topic_score_gemma":0.00000265164,"domain_scores_codex":[0.9992186,0.000006206989,0.0001459089,0.00009880438,0.0001309955,0.0003995079],"domain_scores_gemma":[0.9997454,0.00003730493,0.000009513015,0.00009498764,0.00001230928,0.000100464],"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.00003112914,0.00001297371,0.0001228699,0.001219417,0.0000928733,0.00008317253,0.07944798,0.4232148,0.209034,0.0001032301,0.09956509,0.1870724],"study_design_scores_gemma":[0.0003823956,0.00008987184,0.001582269,0.001825147,0.00007832918,0.00009421228,0.000831165,0.8834329,0.009779499,0.0001516649,0.1003507,0.001401862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4438659,0.0013907,0.5339148,0.004584472,0.0008646118,0.0002198609,0.000007821015,0.001631944,0.01351987],"genre_scores_gemma":[0.9917373,0.000005176992,0.005410873,0.002073464,0.0004373025,0.00002329401,0.000002387096,0.0000615274,0.0002486834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5478714,"threshold_uncertainty_score":0.689875,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004473804,0.0002956879,0.0002237565,0.00008128988,0.000888531,0.0009048268,0.001449302,0.00007276755,0.000008049535],"category_scores_gemma":[0.00002684725,0.0001763811,0.00008169838,0.0004463014,0.0002339743,0.0005732427,0.0001099396,0.0008603979,0.00001831869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001464939,"about_ca_system_score_gemma":0.0001248536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003089168,"about_ca_topic_score_gemma":0.00002881226,"domain_scores_codex":[0.997997,0.00005134184,0.0002801315,0.0005610363,0.0004691035,0.0006413676],"domain_scores_gemma":[0.9988979,0.0001569561,0.000157553,0.0005997609,0.00006459493,0.0001232288],"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.00007901061,0.0001573608,0.001223333,0.0002653436,0.0001230486,0.0002062586,0.01605786,0.05744576,0.0143915,0.01436343,0.005851382,0.8898357],"study_design_scores_gemma":[0.0007049681,0.00008096028,0.0009248373,0.0001192227,0.0000173699,0.0002887089,0.00006417247,0.9727638,0.0003530852,0.003041841,0.02104924,0.0005917531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.157999,0.0001472594,0.7969839,0.04365546,0.0003153856,0.0002106486,3.736976e-7,0.0003112642,0.000376676],"genre_scores_gemma":[0.7384932,0.000005027721,0.2541142,0.007006447,0.0002809596,0.00003913485,0.000001535033,0.00002809472,0.00003133168],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9153181,"threshold_uncertainty_score":0.8725266,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003698392,0.0003197557,0.0002677685,0.0002010844,0.0003461545,0.0006555021,0.0007877085,0.00006909742,0.000007776468],"category_scores_gemma":[0.0000327407,0.0002839493,0.0001407599,0.0002682635,0.00005985161,0.001505833,0.00007401539,0.0001592083,0.00004153008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008279139,"about_ca_system_score_gemma":0.00006340424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008187345,"about_ca_topic_score_gemma":9.511301e-7,"domain_scores_codex":[0.9977576,0.00006869398,0.0003950617,0.0004758058,0.0003737568,0.0009290692],"domain_scores_gemma":[0.9990024,0.0001080179,0.0002050746,0.0003982101,0.0000664304,0.000219857],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005399574,0.001151383,0.006456317,0.003691213,0.0003344842,0.00004077352,0.02940731,0.1001726,0.4458315,0.005224636,0.1250631,0.2820867],"study_design_scores_gemma":[0.01320834,0.0007539149,0.004805678,0.001395457,0.0002674058,0.0003938911,0.0004516186,0.5113236,0.08878455,0.004725207,0.367506,0.006384299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01502787,0.0001751087,0.9775312,0.005403438,0.0003912136,0.0005025021,0.000008327489,0.000321313,0.000639038],"genre_scores_gemma":[0.6997604,7.425337e-7,0.2920345,0.007582951,0.00026145,0.0001883308,0.00004066883,0.00003333826,0.00009760628],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6854967,"threshold_uncertainty_score":0.9999613,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009293219,0.000127699,0.0002110458,0.00009117723,0.0003692759,0.0001500239,0.0003612339,0.00006022134,0.00000314377],"category_scores_gemma":[0.00007751535,0.00008457424,0.00004371529,0.0005438189,0.0001491657,0.0002858717,0.0001358917,0.0003330679,0.000001718492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004397383,"about_ca_system_score_gemma":0.00006376554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004657679,"about_ca_topic_score_gemma":0.00002596153,"domain_scores_codex":[0.9985032,0.000268283,0.0003451963,0.0003342976,0.0003217619,0.000227265],"domain_scores_gemma":[0.9992098,0.0001495074,0.0001752815,0.0001973243,0.0002152284,0.00005291566],"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.00115928,0.0007163636,0.003715593,0.002538352,0.0006133735,0.00001719739,0.2016379,0.03660454,0.08013738,0.06073146,0.01769733,0.5944312],"study_design_scores_gemma":[0.001223441,0.0006707854,0.004640537,0.002008943,0.00002460722,0.00005262759,0.007242376,0.8795181,0.03518206,0.0002390302,0.06837962,0.000817871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6254293,0.001466819,0.333573,0.03775907,0.0005013358,0.0004664711,4.835473e-7,0.0001068984,0.0006965146],"genre_scores_gemma":[0.9973735,0.00003431652,0.0009598752,0.001239663,0.0003171777,0.00005295784,3.428109e-7,0.000009464479,0.0000127276],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8429136,"threshold_uncertainty_score":0.3448837,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002604275,0.0001659731,0.0001613379,0.0001697578,0.000248368,0.0005926548,0.0008785611,0.00007093303,0.00007129938],"category_scores_gemma":[0.00001851067,0.0001557347,0.00007957226,0.0003405559,0.0001160346,0.001495671,0.00009843356,0.0003196512,0.0006075232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001097734,"about_ca_system_score_gemma":0.00005769296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006090403,"about_ca_topic_score_gemma":0.000002684087,"domain_scores_codex":[0.9986745,0.0000217059,0.0002798292,0.0002908394,0.0003741666,0.0003589908],"domain_scores_gemma":[0.9992076,0.00002081223,0.0001566856,0.0004255318,0.00007161051,0.0001178291],"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.0001013441,0.00075669,0.02514032,0.0005445226,0.0001615385,0.00003289974,0.017611,0.0005293883,0.400836,0.03777546,0.04110096,0.4754099],"study_design_scores_gemma":[0.004741915,0.0002035878,0.05022055,0.0003390985,0.00006839668,0.0001796699,0.000126136,0.7225769,0.008273121,0.008727629,0.2011511,0.003392002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2686,0.00003049524,0.7168911,0.007253732,0.0003130083,0.0001649639,7.436832e-7,0.0005448099,0.006201199],"genre_scores_gemma":[0.843038,0.000001495103,0.1379922,0.01871751,0.0001196062,0.00002695601,0.000002856521,0.00001381621,0.00008755307],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7220474,"threshold_uncertainty_score":0.7808685,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000079107,0.0002143462,0.000198296,0.00006474266,0.0002464279,0.00007887495,0.0005646897,0.0001041415,0.000002457657],"category_scores_gemma":[0.00002576175,0.0002180447,0.00004492889,0.000309884,0.0001653028,0.0002050861,0.00007010713,0.0005084359,0.00004178455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001770698,"about_ca_system_score_gemma":0.000008038847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002533562,"about_ca_topic_score_gemma":0.000004839445,"domain_scores_codex":[0.9989102,0.00001144407,0.0002476441,0.000218052,0.0001250709,0.0004875485],"domain_scores_gemma":[0.9992208,0.00007593863,0.00004925099,0.0005784128,0.00001955316,0.00005604205],"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.000005801072,0.00001809777,0.0001146513,0.0000204874,0.00001158276,0.000004181561,0.00008293928,0.9876511,0.001208079,0.001139331,0.0002508938,0.009492911],"study_design_scores_gemma":[0.0008059912,0.0000334161,0.0004898891,0.0003959073,0.0000161008,0.000009645713,0.00007020302,0.9922778,0.0004778932,0.002370658,0.002492783,0.000559721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05703006,0.001127439,0.9322396,0.002966319,0.0001555714,0.000193598,9.48325e-7,0.002680452,0.003606015],"genre_scores_gemma":[0.784427,0.000178637,0.2142114,0.001017761,0.00005943393,0.00004172022,0.00001105911,0.00004568066,0.000007387062],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7273969,"threshold_uncertainty_score":0.8891604,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002292012,0.0002396061,0.0002684384,0.0002525895,0.0002000238,0.0004056258,0.0007789856,0.00009335118,7.411558e-7],"category_scores_gemma":[0.00001044119,0.0002478322,0.00007752774,0.000352499,0.00003845456,0.0003538788,0.0001130991,0.0001198016,0.000005334908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001134594,"about_ca_system_score_gemma":0.00007373724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005437525,"about_ca_topic_score_gemma":0.00000471606,"domain_scores_codex":[0.9981351,0.00007199695,0.0004519471,0.0005907413,0.0002345187,0.0005156574],"domain_scores_gemma":[0.9992394,0.00005709602,0.0001889079,0.0003363166,0.00008636542,0.00009187083],"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.000002966287,0.00003541419,0.00004336543,0.00003654028,0.000007214525,0.000009994769,0.0002321667,0.8075293,0.0001729126,0.0000703578,0.0003730052,0.1914867],"study_design_scores_gemma":[0.0004326614,0.00002880059,0.00002282688,0.0001095965,0.000004184764,0.00005103495,0.00000733467,0.9954214,0.0002494878,0.000100338,0.003260595,0.0003117536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00224722,0.001904149,0.9936564,0.001245947,0.0001381939,0.000218324,0.000001563408,0.0005474805,0.00004073382],"genre_scores_gemma":[0.3589839,0.00002409277,0.6389264,0.001686751,0.0001846305,0.0001300309,0.000004203212,0.00002163005,0.00003830572],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3567367,"threshold_uncertainty_score":0.9999974,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001980404,0.0002770267,0.0003332466,0.0001307297,0.0002343169,0.0001184217,0.001022608,0.00007268971,0.00001289958],"category_scores_gemma":[0.00006153365,0.000218632,0.00005243543,0.0002592823,0.0002592931,0.00367536,0.0004286054,0.0002109997,0.00009433729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003217607,"about_ca_system_score_gemma":0.00005961865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001826999,"about_ca_topic_score_gemma":0.0000167829,"domain_scores_codex":[0.9979926,0.00002266287,0.0005028811,0.0007230937,0.0003493882,0.0004093779],"domain_scores_gemma":[0.9981261,0.00005942805,0.0003742906,0.001230482,0.00009966546,0.0001099927],"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.0002531111,0.001613844,0.02581025,0.002844059,0.0003932193,0.0001220573,0.009562964,0.05880338,0.07348748,0.07821779,0.02201075,0.7268811],"study_design_scores_gemma":[0.002342624,0.00008586144,0.006170474,0.0005090877,0.00001741989,0.00007247947,0.0004778385,0.9826266,0.000933203,0.0005927432,0.005374332,0.0007973018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0470584,0.0002323154,0.9510036,0.0008459477,0.0002391604,0.0003444298,0.00003312537,0.0001871633,0.00005593154],"genre_scores_gemma":[0.137773,0.00002261431,0.8610492,0.0008583196,0.00007316484,0.0000523794,0.00008381523,0.0000208333,0.00006663445],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9238232,"threshold_uncertainty_score":0.8915556,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001857151,0.0002536747,0.0002715008,0.0001260556,0.0008635912,0.0006953009,0.0008741615,0.00008006975,0.000001128889],"category_scores_gemma":[0.0001157094,0.0001783682,0.00008976607,0.0004471983,0.00006163046,0.0005941067,0.0001748713,0.0002107051,0.00001533305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003723707,"about_ca_system_score_gemma":0.00005342198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001222649,"about_ca_topic_score_gemma":0.000003271011,"domain_scores_codex":[0.9979912,0.0001668918,0.0003908258,0.0005522864,0.0002324675,0.0006663451],"domain_scores_gemma":[0.9985779,0.0005192063,0.0002379498,0.0004446953,0.0000842565,0.0001360223],"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.0002924024,0.0003390019,0.0001864882,0.001004158,0.0002328729,0.00002464873,0.003682956,0.02118878,0.00587794,0.1909643,0.01374566,0.7624608],"study_design_scores_gemma":[0.0009647995,0.00003941651,0.00003437729,0.00002965402,0.00001807821,0.00003206007,0.00005503304,0.9076715,0.0001188612,0.001059799,0.08970417,0.0002723208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008468396,0.003487933,0.983479,0.01104335,0.0002868137,0.0005168546,0.000004421735,0.0001899,0.0001449425],"genre_scores_gemma":[0.09644088,0.00009106335,0.8971459,0.0042921,0.0007710031,0.000242481,0.00000481869,0.00003837982,0.0009734177],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8864827,"threshold_uncertainty_score":0.7273645,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003378728,0.0001863441,0.0001620406,0.0001552861,0.0004764977,0.0002928825,0.0004145345,0.000053776,0.000001501703],"category_scores_gemma":[0.00008479011,0.0001828108,0.00004246275,0.0003328031,0.00007364127,0.0002805767,0.00005931253,0.0001167335,0.00001480249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006986996,"about_ca_system_score_gemma":0.00007568671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001292167,"about_ca_topic_score_gemma":0.000006991418,"domain_scores_codex":[0.9986572,0.00006488535,0.0002984516,0.0004500131,0.0002499033,0.0002795796],"domain_scores_gemma":[0.9989971,0.0002507928,0.0001728397,0.0003578418,0.0001253918,0.00009606158],"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.000105747,0.0002638569,0.0001030975,0.0001276043,0.00002159486,0.000009936789,0.002620313,0.4943999,0.0007841463,0.008224898,0.00123774,0.4921012],"study_design_scores_gemma":[0.0007349831,0.00010049,0.002383562,0.00007567583,0.00001331929,0.00003497507,0.00002413905,0.9925597,0.00005264804,0.001842821,0.001919751,0.0002579592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01862369,0.0004822173,0.9701761,0.01000248,0.0001226736,0.0003902894,0.000002075383,0.000113601,0.00008690023],"genre_scores_gemma":[0.7896292,0.00003249464,0.2071093,0.002862607,0.00009584266,0.0001479709,0.00004595082,0.00001248533,0.00006406868],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7710056,"threshold_uncertainty_score":0.7454808,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001076735,0.0002304807,0.0004406224,0.00040313,0.00007600003,0.00004853545,0.000250546,0.0001060089,0.00007802547],"category_scores_gemma":[0.0001322786,0.0002236239,0.0001335639,0.001113246,0.0001117183,0.0002092001,0.00002589757,0.0003546224,0.00002645204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008145929,"about_ca_system_score_gemma":0.000002416036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002105079,"about_ca_topic_score_gemma":9.867261e-7,"domain_scores_codex":[0.9986402,0.00001408263,0.0004010411,0.0003030774,0.0001837145,0.000457817],"domain_scores_gemma":[0.9994113,0.000177883,0.00007685216,0.0002415162,0.00003182925,0.00006058377],"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.000005636701,0.00002948378,0.0001721619,0.00008000584,0.0002774333,0.00002349838,0.0002183531,0.5507361,0.007266431,0.00007856568,0.0001823809,0.4409299],"study_design_scores_gemma":[0.0001842224,0.00003730739,0.0001522659,0.0001763179,0.0001769994,0.000005319672,0.00007237474,0.9973375,0.001320587,0.0001070706,0.0001571135,0.0002728837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3050199,0.001617584,0.6809106,0.000993795,0.0001546983,0.0001811629,0.000005003217,0.00154987,0.009567417],"genre_scores_gemma":[0.8560767,0.00007861647,0.143537,0.0001809655,0.00003813809,0.00002044643,0.000003702679,0.00003765059,0.00002672026],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5510569,"threshold_uncertainty_score":0.9119118,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001390021,0.0002039,0.0002094396,0.0001201692,0.0001898572,0.00005728673,0.0002799371,0.00007608224,0.000008460142],"category_scores_gemma":[0.00002635184,0.0002245886,0.00006207713,0.0001561947,0.00008554859,0.000153111,0.00004633496,0.0002524079,0.00004260892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009927902,"about_ca_system_score_gemma":0.00001109133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004398315,"about_ca_topic_score_gemma":9.136415e-7,"domain_scores_codex":[0.9988565,0.00003028145,0.0004115964,0.0002367402,0.0001993225,0.0002655169],"domain_scores_gemma":[0.9993118,0.00006157972,0.0001712746,0.0003339026,0.00005175931,0.00006966224],"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.000007393621,0.00002722478,0.00006936173,0.00004871002,0.00002327567,5.043854e-7,0.0004955408,0.9501362,0.004586593,0.00001572257,0.00002164222,0.04456779],"study_design_scores_gemma":[0.0004219959,0.00001182446,0.0000748939,0.0001010214,0.00002038702,0.0000071854,0.0001573469,0.9955635,0.003078309,0.0000130152,0.0003172235,0.0002332849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07181891,0.000892156,0.9259796,0.0005969573,0.00004430925,0.0002324237,0.000002374928,0.0002450217,0.000188213],"genre_scores_gemma":[0.6494793,0.00004112581,0.3495404,0.0007625995,0.00007515441,0.00003012505,0.00002531224,0.0000369546,0.000009119244],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5776603,"threshold_uncertainty_score":0.9158457,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002535454,0.0001832259,0.0002048189,0.00008831287,0.0001335547,0.0002323292,0.0005682366,0.00005430213,0.000003782262],"category_scores_gemma":[0.000006726706,0.0001810786,0.00004249042,0.0002911098,0.00003469881,0.0005262856,0.0000963035,0.0001479234,0.00006105623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005323241,"about_ca_system_score_gemma":0.00002192446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000105822,"about_ca_topic_score_gemma":0.00001235049,"domain_scores_codex":[0.9983668,0.00004203178,0.0003658938,0.0004654381,0.0002960422,0.0004637623],"domain_scores_gemma":[0.9995261,0.00001663188,0.000164614,0.000239209,0.000008600174,0.0000448895],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005681226,0.00150575,0.03830744,0.0007064788,0.00005994828,0.001342381,0.002178686,0.2642764,0.4027897,0.1143689,0.009160599,0.1652469],"study_design_scores_gemma":[0.003574657,0.00007312714,0.06818456,0.0006127902,0.00001350458,0.0001291927,0.00005691808,0.9016,0.004785279,0.00296905,0.01632396,0.001676926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03172188,0.0002291,0.9650287,0.001774909,0.000133484,0.0001254287,0.000001370893,0.0001073365,0.0008777765],"genre_scores_gemma":[0.94504,0.000001283051,0.05387869,0.0008658372,0.00007019952,0.00002514436,0.000008585183,0.00001321379,0.00009700393],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9133182,"threshold_uncertainty_score":0.7384173,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001878928,0.0001150083,0.0001189497,0.0001571606,0.000127316,0.0002399229,0.0006722219,0.00002691665,0.00001368535],"category_scores_gemma":[0.00002072303,0.00009989563,0.00006071496,0.0005750093,0.00007374316,0.0003531089,0.0001344711,0.0002112481,0.00004046147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000202498,"about_ca_system_score_gemma":0.00005221708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001139289,"about_ca_topic_score_gemma":4.602411e-7,"domain_scores_codex":[0.9991293,0.00005197972,0.0001904535,0.0002703435,0.0001882375,0.0001697097],"domain_scores_gemma":[0.9994012,0.00009479193,0.00004883017,0.0003685447,0.00004594959,0.00004071582],"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.000009748993,0.00007478103,0.0001144442,0.0002110822,0.00004124542,0.00001799092,0.002424411,0.001503552,0.02986539,0.2947522,0.01577662,0.6552085],"study_design_scores_gemma":[0.0006405024,0.00012955,0.0006944739,0.001831658,0.00002098744,0.00002905824,0.00003999414,0.9068265,0.006648755,0.009821103,0.07252769,0.0007897097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03692061,0.008192533,0.9365404,0.01503282,0.000244374,0.0001081512,6.686393e-7,0.0003811409,0.002579279],"genre_scores_gemma":[0.9679003,0.0001932079,0.02930761,0.002423418,0.00002694565,0.0000126379,0.000001696905,0.00001025011,0.0001239786],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9309796,"threshold_uncertainty_score":0.4073626,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005107064,0.0002094446,0.0002619774,0.0004322227,0.0003907251,0.0004079586,0.0005658038,0.00008180803,0.00001161928],"category_scores_gemma":[0.00009323857,0.0002133741,0.0001200234,0.0020058,0.0000762004,0.0006211253,0.0000680845,0.0001642621,0.000009680451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009430966,"about_ca_system_score_gemma":0.0001098331,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001943392,"about_ca_topic_score_gemma":0.000001073215,"domain_scores_codex":[0.9980533,0.0001985867,0.0003968617,0.000563541,0.0003711361,0.0004165923],"domain_scores_gemma":[0.9990029,0.00003884192,0.0002887254,0.0004221881,0.0001332893,0.0001140819],"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.00001749829,0.0002013484,0.00369591,0.00006490637,0.0002613156,0.00002556455,0.001826525,0.9665734,0.004611599,0.004788195,0.001937615,0.01599611],"study_design_scores_gemma":[0.0002803098,0.00001574169,0.000618969,0.00003160018,0.0001031843,0.00001391902,0.00001030105,0.9953212,0.001950098,0.0002386681,0.001121239,0.0002947611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009851001,0.0001695906,0.9871596,0.001141078,0.00009830868,0.0001900564,6.554964e-7,0.0007099576,0.0006797604],"genre_scores_gemma":[0.6217768,0.000006103587,0.3773312,0.0007859927,0.00002722101,0.00002009896,0.000007718961,0.00001101594,0.00003385747],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6119258,"threshold_uncertainty_score":0.8701142,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002251633,0.0002399191,0.0002469978,0.00008445384,0.0003121095,0.0004695698,0.0007625065,0.0000691429,0.000004167806],"category_scores_gemma":[0.000005870998,0.0002153441,0.00008526182,0.0003991445,0.00008045135,0.0006880551,0.0001676753,0.0001788626,0.0001017095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000770208,"about_ca_system_score_gemma":0.00004017647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001212364,"about_ca_topic_score_gemma":0.00000578742,"domain_scores_codex":[0.9980168,0.00005751313,0.0003916392,0.0005689031,0.0004679715,0.0004971473],"domain_scores_gemma":[0.9992933,0.00002621986,0.0001944903,0.0003301677,0.0000644012,0.00009140685],"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.00001432234,0.0004806895,0.0009631183,0.000248006,0.00003041675,0.0002831241,0.0009245571,0.003256389,0.01656764,0.01866094,0.1025696,0.8560012],"study_design_scores_gemma":[0.002200446,0.00009406789,0.006000645,0.0003369412,0.00001732138,0.0001271657,0.00002990556,0.795316,0.0003791561,0.001039688,0.1933537,0.001104932],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007709323,0.0009301304,0.9861407,0.003229415,0.0006237848,0.0001629793,0.000007883133,0.0003650295,0.0008307668],"genre_scores_gemma":[0.9245591,0.000004694101,0.07292926,0.001736949,0.0004483018,0.0000456431,0.00004579129,0.000018768,0.0002114826],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9168498,"threshold_uncertainty_score":0.8781478,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007716682,0.0001264814,0.0001285197,0.00006062056,0.000216779,0.0001120242,0.0001933092,0.00002052727,0.00006648328],"category_scores_gemma":[0.000002456199,0.0001177988,0.00006038524,0.000229615,0.00003847362,0.00009520809,0.00003893576,0.000124382,0.00006046253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001270527,"about_ca_system_score_gemma":0.00006011795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002729549,"about_ca_topic_score_gemma":2.577952e-7,"domain_scores_codex":[0.9992378,0.00001325176,0.0001763607,0.000249482,0.00008913314,0.0002339811],"domain_scores_gemma":[0.9996515,0.00001754147,0.00007193604,0.0001891023,0.00003204181,0.00003789621],"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.000012027,0.0001762842,0.006016695,0.00009412708,0.00006177176,9.749832e-7,0.0002374032,0.0001743211,0.01307977,0.9129837,0.02481235,0.04235054],"study_design_scores_gemma":[0.001282687,0.00002471658,0.002465545,0.000341252,0.0001093018,0.000001071758,0.0005492628,0.1130859,0.003779196,0.7112216,0.166339,0.0008004361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1381411,0.0002028041,0.8364437,0.01351567,0.0001404629,0.0002847092,0.00000661475,0.000122052,0.01114294],"genre_scores_gemma":[0.9961432,0.000001376358,0.00154409,0.001558622,0.0001101322,0.000152568,0.00001702619,0.00001254425,0.0004604071],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8580021,"threshold_uncertainty_score":0.4803696,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001910407,0.0002914089,0.0003212206,0.0001204017,0.0004423674,0.000904484,0.0006059013,0.0001171642,0.00002681355],"category_scores_gemma":[0.00002767584,0.0002655499,0.0001193586,0.00032221,0.0000478027,0.001453603,0.00005978639,0.0001379155,0.00002899773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007203592,"about_ca_system_score_gemma":0.00006931975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005305928,"about_ca_topic_score_gemma":0.000007785031,"domain_scores_codex":[0.9980354,0.00005652594,0.0005107642,0.0006612049,0.0002465368,0.0004895413],"domain_scores_gemma":[0.9987245,0.00007739798,0.0002912144,0.0003566251,0.0004387248,0.0001115611],"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.00005094377,0.000274214,0.00007170996,0.0005746969,0.0001304451,0.000005397009,0.00157968,0.01481736,0.1484066,0.001097224,0.4157766,0.4172151],"study_design_scores_gemma":[0.001439757,0.00005505784,0.0004089233,0.00007228044,0.00001255589,0.00001378315,0.00002233901,0.9904166,0.0004009103,0.0003411958,0.006429339,0.0003871924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005257018,0.0003288306,0.9853634,0.006683223,0.0004950745,0.00141149,0.00006463451,0.000251697,0.0001446769],"genre_scores_gemma":[0.1070182,0.000003644216,0.8836157,0.004591454,0.0007401331,0.002358842,0.000754596,0.00004837558,0.0008690912],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9755993,"threshold_uncertainty_score":0.9999797,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000383996,0.0001824701,0.000206011,0.0002297401,0.0001326867,0.0001510132,0.0007677708,0.00006363368,0.000005056856],"category_scores_gemma":[0.00002857016,0.0001380278,0.0000540909,0.0003565475,0.00008516396,0.0006784807,0.0001364467,0.0001185966,0.00003747674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007153732,"about_ca_system_score_gemma":0.0000764236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002431757,"about_ca_topic_score_gemma":0.000001930415,"domain_scores_codex":[0.9984089,0.00008061221,0.0003616114,0.0004997062,0.0002413509,0.0004077782],"domain_scores_gemma":[0.9992504,0.00009101893,0.0001399336,0.0003840222,0.00005919795,0.00007545089],"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.00004285622,0.0002493667,0.002794504,0.0001653145,0.00002895986,0.0001388468,0.003713318,0.7149994,0.01300428,0.011827,0.007653656,0.2453825],"study_design_scores_gemma":[0.0009206121,0.00002792185,0.0002629083,0.0004251134,0.000003946878,0.00002555442,0.00001474137,0.9906329,0.001304899,0.00480781,0.000993777,0.000579819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008264902,0.0003172012,0.981133,0.007466944,0.00009174648,0.0001157345,2.820729e-7,0.0006029894,0.002007203],"genre_scores_gemma":[0.6091872,0.00003084957,0.3885881,0.001975833,0.00003484681,0.00001818896,4.526477e-7,0.00001229619,0.0001522092],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6009223,"threshold_uncertainty_score":0.5628608,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002261965,0.0001519695,0.00016736,0.0001468417,0.0005250606,0.0002676788,0.0008159339,0.00003828886,0.000006435501],"category_scores_gemma":[0.00004173815,0.0001417853,0.00008624278,0.0004894496,0.00007371548,0.000340221,0.0002547333,0.0001210264,0.00000723312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003335096,"about_ca_system_score_gemma":0.00009355154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001619063,"about_ca_topic_score_gemma":0.000001768752,"domain_scores_codex":[0.9989376,0.00006177987,0.0002358861,0.00035492,0.0001389339,0.0002708773],"domain_scores_gemma":[0.9992259,0.00009696884,0.00008118659,0.0004123517,0.0001346666,0.00004896169],"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.00006927716,0.0001512566,0.0005821591,0.0001742774,0.000097131,0.000003792043,0.0007843612,0.004372006,0.05002977,0.2363141,0.09238794,0.6150339],"study_design_scores_gemma":[0.00220627,0.00002651857,0.0006649662,0.0002641703,0.00002737657,0.000005877826,0.00001232141,0.7465131,0.002039438,0.006879242,0.2408248,0.0005358851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0107775,0.003200443,0.9589608,0.02586633,0.0002042886,0.0002181974,7.570014e-7,0.0001973285,0.000574387],"genre_scores_gemma":[0.5054751,0.0001581879,0.4627146,0.03027161,0.00006478615,0.0002028593,0.00001737217,0.00001601064,0.001079437],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7421411,"threshold_uncertainty_score":0.5781837,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006680444,0.0001283936,0.0001229267,0.0000899185,0.0008235368,0.0001670209,0.000619471,0.00005068186,0.000001074936],"category_scores_gemma":[0.00004143236,0.0001027713,0.00007133455,0.0005150905,0.0001755865,0.000565901,0.0001644598,0.000173665,0.000005490202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006594215,"about_ca_system_score_gemma":0.00007035117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003401586,"about_ca_topic_score_gemma":0.00003941615,"domain_scores_codex":[0.9987817,0.00004265997,0.0001798014,0.0002941034,0.0003032218,0.0003985077],"domain_scores_gemma":[0.9991536,0.0001236678,0.0002142659,0.0003568192,0.00009082774,0.00006085557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005981654,0.0008841466,0.008976188,0.0004522819,0.0001760695,0.00005936202,0.007264017,0.135259,0.3966008,0.150739,0.02340974,0.2761196],"study_design_scores_gemma":[0.000833274,0.00008012259,0.1027759,0.0001724455,0.00005759676,0.000116983,0.0001676819,0.8811628,0.006771059,0.003810492,0.003321393,0.0007303403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02769846,0.0002229864,0.9417244,0.02977714,0.0001171655,0.0001782441,9.060051e-7,0.0001082224,0.0001725038],"genre_scores_gemma":[0.82932,0.000004952709,0.169896,0.0005739193,0.0001183512,0.00001466776,0.000003670183,0.000006822063,0.00006172068],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8016214,"threshold_uncertainty_score":0.6334063,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004570138,0.0002458754,0.0002358889,0.00002789078,0.0008771573,0.0002958624,0.0005966317,0.0002605503,0.000006543756],"category_scores_gemma":[0.00002227844,0.0002147084,0.0001454164,0.00002649871,0.0002549439,0.00001695213,0.0003540085,0.0002032304,0.000007780521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002000014,"about_ca_system_score_gemma":0.00004410588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009907429,"about_ca_topic_score_gemma":0.00001438035,"domain_scores_codex":[0.9984208,0.0000277885,0.0002981978,0.0004233094,0.0001145983,0.0007152627],"domain_scores_gemma":[0.9991165,0.00001386724,0.0001861336,0.0004879764,0.00006316414,0.0001323354],"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.0005159135,0.0001717926,0.001763421,0.0002034417,0.0002287764,0.0000208947,0.0003006422,0.1025115,0.008829024,0.0001260718,0.01775701,0.8675715],"study_design_scores_gemma":[0.001838913,0.0001584232,0.0009455929,0.00004858823,0.00001771778,0.00002505694,0.00008591509,0.974303,0.0001628872,0.00008780864,0.02187118,0.0004548877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01039755,0.0006919369,0.9869849,0.001048948,0.0002071037,0.0003357921,0.00001635505,0.0000261278,0.0002912628],"genre_scores_gemma":[0.8887013,0.0001295515,0.1063863,0.003230926,0.000999803,0.0001000629,0.0002063474,0.00004111113,0.0002046068],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8805985,"threshold_uncertainty_score":0.8755553,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001166185,0.0002349331,0.000225791,0.0002564326,0.0007150995,0.0002979618,0.0005552707,0.00007148706,0.000006286121],"category_scores_gemma":[0.0002807463,0.0002553583,0.0000812293,0.0005390343,0.00007866017,0.001270179,0.0001415686,0.0001670365,0.00001252787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000279919,"about_ca_system_score_gemma":0.0001546485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007063233,"about_ca_topic_score_gemma":0.00001525403,"domain_scores_codex":[0.9977692,0.00004964727,0.0004286759,0.0006048327,0.0004919549,0.0006556584],"domain_scores_gemma":[0.9986734,0.0001808428,0.0003199517,0.0003091632,0.0004028519,0.0001138038],"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.00003824231,0.0001306389,0.001946136,0.00007593229,0.00004056804,0.000005047578,0.00150124,0.870895,0.005394638,0.002522692,0.0003332139,0.1171166],"study_design_scores_gemma":[0.001311179,0.00002427762,0.001409707,0.00006286675,0.00002317905,0.000007766935,0.00005594665,0.9951935,0.0007291564,0.0005733835,0.0002813841,0.0003276709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002582567,0.0001871094,0.9936842,0.001705703,0.0003634246,0.0006505005,0.000001132587,0.0002846752,0.0005406549],"genre_scores_gemma":[0.4269929,0.000001668325,0.5721979,0.0005530455,0.0001253642,0.00006874315,0.00001571215,0.00001934038,0.00002535665],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4244103,"threshold_uncertainty_score":0.9999899,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005971524,0.0001332434,0.0001750835,0.00008935654,0.0004685754,0.0002613929,0.002036618,0.00006943817,7.438056e-7],"category_scores_gemma":[0.0001310032,0.0001054965,0.00002280867,0.0005185955,0.0007889043,0.0007940307,0.0006042283,0.0002095706,9.843865e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002471777,"about_ca_system_score_gemma":0.0000635292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009338511,"about_ca_topic_score_gemma":0.0004129889,"domain_scores_codex":[0.9987594,0.0001380185,0.0003644038,0.0002804334,0.0002011733,0.0002565243],"domain_scores_gemma":[0.997647,0.0003215937,0.0007565736,0.001135829,0.0001048584,0.00003409493],"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.0001098598,0.0002448783,0.128857,0.0003907782,0.0000630411,0.000009824687,0.01025983,0.0001005178,0.007827666,0.2334184,0.002589962,0.6161282],"study_design_scores_gemma":[0.004487731,0.0003510293,0.05900722,0.002063437,0.00005156046,0.0001396266,0.006019612,0.6934835,0.04715139,0.1310975,0.05333036,0.002817029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8448744,0.009260836,0.1004614,0.04304687,0.00008376061,0.0002899712,9.148054e-7,0.0003696409,0.00161214],"genre_scores_gemma":[0.9816818,0.0009797536,0.01592389,0.001289646,0.0000184121,0.00008839451,0.000001269446,0.000008239939,0.00000858664],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.693383,"threshold_uncertainty_score":0.4302021,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002391342,0.0002011915,0.0002536857,0.0002807446,0.0004498257,0.0003410467,0.0005834405,0.0001145844,0.00003983369],"category_scores_gemma":[0.0002594421,0.0001711246,0.0001597223,0.0006394391,0.00009585654,0.0006447278,0.00005197002,0.0001258713,0.00005774789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005680024,"about_ca_system_score_gemma":0.00003727248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009487858,"about_ca_topic_score_gemma":0.000002268778,"domain_scores_codex":[0.9972031,0.00003525095,0.0008355483,0.000622594,0.000864431,0.000439059],"domain_scores_gemma":[0.9976616,0.0009750603,0.0003659544,0.0004763592,0.0003878572,0.0001332048],"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.00005558851,0.00005084928,0.0002228423,0.00001092791,0.000006518839,0.000001617744,0.000400712,0.8807908,0.003083625,0.002873049,0.003199143,0.1093044],"study_design_scores_gemma":[0.0004567517,0.00001873303,0.0002972931,0.00001161689,0.00001153693,0.000001090407,0.0001019197,0.8969196,0.0005514153,0.07439288,0.02699612,0.0002410137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01439893,0.0001811238,0.9806002,0.002892157,0.00008277515,0.0006348501,0.00000694651,0.0002388147,0.0009641427],"genre_scores_gemma":[0.7617294,0.000001556377,0.2355743,0.001703482,0.000200805,0.00007911649,0.00002041301,0.00002562038,0.0006652197],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7473305,"threshold_uncertainty_score":0.6978257,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}