{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":21,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":21,"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":"95ef5f692d5e","filters":{"venue":"International Journal of Parallel Emergent and Distributed Systems"}},"results":[{"id":"W2046441464","doi":"10.1080/17445760500355678","title":"Quantum computation and quantum information","year":2005,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":302,"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 computer; Quantum information; Computer science; Theoretical computer science; Quantum cryptography; Quantum algorithm; Quantum network; Computation; Quantum information science; Quantum error correction; Quantum technology; Open quantum system; Cryptography; Quantum; Algorithm; Quantum mechanics; Physics; Quantum entanglement","retraction":null,"screen_n_in":null,"score":{"opus":0.01109462947866696,"gpt":0.2562813327281728,"spread":0.2451867032495059,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003810427,0.0001238283,0.0001833652,0.0001879408,0.00008471851,0.0003303807,0.0003616444,0.00004815424,0.000002793425],"category_scores_gemma":[0.00004850682,0.0001004816,0.00005998724,0.0001062899,0.0000284576,0.0008881603,0.0001167138,0.0001405635,0.000006343224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003971544,"about_ca_system_score_gemma":0.00004328958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002959169,"about_ca_topic_score_gemma":0.000001472831,"domain_scores_codex":[0.9985679,0.00006135993,0.0006428786,0.000112567,0.0004746742,0.0001405634],"domain_scores_gemma":[0.9987966,0.00005776116,0.0004957993,0.00007570688,0.0004486167,0.0001255212],"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.0001268377,0.0001841054,0.003637291,0.00006573625,0.0004092071,0.00005825284,0.002548193,0.7329125,0.0002569085,0.1412994,0.01506213,0.1034395],"study_design_scores_gemma":[0.0007189023,0.00009153519,0.00359217,0.00006117405,0.000007627586,0.0004408451,0.0001212854,0.9681239,0.000006975606,0.001123901,0.02559403,0.0001176596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1597594,0.0008954766,0.8347378,0.002888019,0.001571553,0.00006771204,0.00002078564,0.00002628519,0.00003294313],"genre_scores_gemma":[0.9934755,0.0001814764,0.005824615,0.00008725247,0.0003903332,0.000001460636,0.00002888748,0.000003387869,0.000007066424],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8337162,"threshold_uncertainty_score":0.4097522,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2618778734","doi":"10.1080/17445760.2017.1331439","title":"Cohort intelligence algorithm for discrete and mixed variable engineering problems","year":2017,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Metaheuristic; Continuous optimization; Penalty method; Mathematical optimization; Discrete optimization; Sampling (signal processing); Optimization problem; Reduction (mathematics); Algorithm; Computer science; Continuous variable; Integer programming; Nonlinear programming; Integer (computer science); Nonlinear system; Mathematics; Multi-swarm optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.01790737552077968,"gpt":0.2817691170762407,"spread":0.263861741555461,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004599606,0.0001557768,0.0002551857,0.0001056762,0.0001824771,0.0004903685,0.0007817436,0.00005516263,0.000002810708],"category_scores_gemma":[0.0002566874,0.000136183,0.00006340675,0.00005277264,0.00004567592,0.0009068163,0.0002106847,0.0001079397,5.333061e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006798409,"about_ca_system_score_gemma":0.00004001444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003500973,"about_ca_topic_score_gemma":0.0000015656,"domain_scores_codex":[0.9986634,0.00002440257,0.0005417045,0.0002334992,0.0003549889,0.0001819777],"domain_scores_gemma":[0.9980573,0.0000792233,0.0006612845,0.0002055737,0.0008454065,0.0001511864],"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.00007094307,0.0001769204,0.007158592,0.0001017431,0.001247493,0.00007919253,0.0003794535,0.8804186,0.0006225705,0.05618567,0.001100976,0.05245785],"study_design_scores_gemma":[0.0006745874,0.00007192018,0.001948657,0.0001110298,0.00001873371,0.0001698203,0.0000485124,0.9906828,0.00007877759,0.0007026149,0.005323091,0.0001694198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004675997,0.0006271377,0.995332,0.0003233914,0.002808658,0.0002843462,0.0001040437,0.00001987533,0.0000329678],"genre_scores_gemma":[0.404298,0.000878898,0.5939071,0.00001837012,0.0005171555,0.00006225428,0.00005492766,0.00002082136,0.0002425465],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4038304,"threshold_uncertainty_score":0.555338,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064720601","doi":"10.1080/17445760802441671","title":"Distributed architectures for electronic cash schemes: a survey1","year":2009,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"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":"Computer science; Electronic cash; Business; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01587769423538483,"gpt":0.2838235642934869,"spread":0.2679458700581021,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006637498,0.0001810066,0.0002900545,0.0001873722,0.0000965227,0.0002475271,0.0009726048,0.00007224867,0.000006911846],"category_scores_gemma":[0.0001561696,0.000149231,0.0002240252,0.0002235171,0.00003201802,0.0002153522,0.00007078723,0.0001904481,0.000001330498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006987645,"about_ca_system_score_gemma":0.0001132195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002977046,"about_ca_topic_score_gemma":0.00001710868,"domain_scores_codex":[0.9981765,0.00009120801,0.000664053,0.0002322844,0.0005133345,0.0003226625],"domain_scores_gemma":[0.9984345,0.0001103992,0.0004543273,0.000198617,0.0006279407,0.0001742477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001397494,0.001170399,0.01350203,0.00008549144,0.001769035,0.0002091228,0.0007688969,0.01952513,0.00178306,0.8890184,0.05701751,0.01375351],"study_design_scores_gemma":[0.01318398,0.003234457,0.07180718,0.0004754125,0.0002055493,0.002576116,0.0005928117,0.1956562,0.0005973301,0.1348998,0.5749331,0.001838069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08673925,0.002451635,0.9074661,0.001399344,0.001017254,0.0001845727,0.0006919098,0.00003083597,0.00001916417],"genre_scores_gemma":[0.9973871,0.0001913061,0.001687119,0.00007435755,0.0003349095,0.000007401736,0.0003085428,0.000004480907,0.00000474584],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9106479,"threshold_uncertainty_score":0.6085466,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2343583372","doi":"10.1080/17445760.2016.1169420","title":"Simulation and modeling of hydro acoustic communication channels with wide band attenuation and ambient noise","year":2016,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Defence Research and Development Canada; Carleton University","funders":"","keywords":"Attenuation; Underwater acoustic communication; Acoustics; Computer science; Multipath propagation; Underwater; Ambient noise level; Frequency domain; Noise (video); Telecommunications; Physics; Optics; Channel (broadcasting); Artificial intelligence; Geology","retraction":null,"screen_n_in":null,"score":{"opus":0.02808792312093643,"gpt":0.2584113099042998,"spread":0.2303233867833634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002648363,0.0001033726,0.0001893086,0.0001002619,0.00004249265,0.00005302879,0.0001339684,0.00004535266,0.000003313887],"category_scores_gemma":[0.00001583165,0.00007066411,0.00002547835,0.00004651213,0.00003677238,0.0002657071,0.00003196714,0.00005762931,4.534587e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004424455,"about_ca_system_score_gemma":0.00001013802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004064481,"about_ca_topic_score_gemma":0.00001137727,"domain_scores_codex":[0.9989845,0.00005653805,0.0005385679,0.0000771499,0.000262457,0.00008085543],"domain_scores_gemma":[0.9990513,0.0001166222,0.0002513735,0.0001106189,0.0003992541,0.00007083395],"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.00007995465,0.00002022725,0.007255987,0.00004342125,0.0001643056,0.000001345517,0.0003094926,0.9826325,0.008924359,0.00007612696,0.00003117912,0.0004611225],"study_design_scores_gemma":[0.001209184,0.00006437754,0.001642158,0.0004924978,0.00004024797,0.00003918682,0.0004100276,0.9950668,0.0002669999,0.0001319273,0.0005248245,0.0001117719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.536015,0.001424735,0.4621461,0.0002033333,0.00008393169,0.00008096403,0.00002258144,0.000008845765,0.00001451488],"genre_scores_gemma":[0.9985066,0.001235186,0.0001479358,0.000004640205,0.00005219696,0.000006130239,0.00002267603,0.00001015878,0.00001445416],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4624917,"threshold_uncertainty_score":0.2881599,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049763834","doi":"10.1080/17445760.2011.613834","title":"Computing with uncertainty and its implications to universality","year":2012,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Computability, Logic, AI Algorithms","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; Computation; Turing machine; Universality (dynamical systems); Executable; Theoretical computer science; Focus (optics); Model of computation; Theory of computation; Computational problem; Mathematical optimization; Algorithm; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02883385702395003,"gpt":0.2898491929551212,"spread":0.2610153359311712,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005777788,0.0001302104,0.0002105129,0.0001179883,0.00009216029,0.0001405508,0.0005479354,0.00003698709,0.000005133145],"category_scores_gemma":[0.00006507059,0.0001016305,0.00004710046,0.0002015157,0.00002668765,0.0004513157,0.0002671837,0.0001096501,0.000003287414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001248993,"about_ca_system_score_gemma":0.00005979139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006700328,"about_ca_topic_score_gemma":0.000007666057,"domain_scores_codex":[0.9986662,0.00009690055,0.0004419381,0.0001798772,0.000396641,0.0002184827],"domain_scores_gemma":[0.9983647,0.0001051553,0.0003051908,0.0001434469,0.0007569761,0.0003245636],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0003040547,0.0009860807,0.3894698,0.0001040667,0.0012245,0.00007915077,0.004954081,0.2700584,0.001056369,0.3102426,0.006411341,0.01510956],"study_design_scores_gemma":[0.002938968,0.0005727216,0.5626971,0.0002407814,0.00008448694,0.002111274,0.001336733,0.3914669,0.00005791355,0.00143387,0.03624612,0.0008131429],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2703806,0.0006714793,0.7254516,0.002319218,0.0009108335,0.0001384641,0.00003774143,0.00002150915,0.00006849685],"genre_scores_gemma":[0.9952567,0.00003574366,0.004322059,0.00005441798,0.0002975165,0.000002265758,0.00001113623,0.000004099558,0.00001608801],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.724876,"threshold_uncertainty_score":0.4144373,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2967594056","doi":"10.1080/17445760.2019.1655742","title":"Diagnosability of interconnection networks: past, present and future","year":2019,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"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; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.008821345230260635,"gpt":0.2397032492223636,"spread":0.2308819039921029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006432921,0.0001431402,0.0003411612,0.0001267744,0.00003606555,0.0001371924,0.0004418445,0.00009130836,0.00004000892],"category_scores_gemma":[0.00001646601,0.0001121681,0.0001302307,0.0001264561,0.00003230826,0.0004756908,0.0001423282,0.00016063,0.00000362934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005618386,"about_ca_system_score_gemma":0.00002286737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008597015,"about_ca_topic_score_gemma":0.000005294541,"domain_scores_codex":[0.9981863,0.0001625024,0.0008684678,0.0002105264,0.0004235033,0.0001486426],"domain_scores_gemma":[0.9982136,0.000121768,0.0006769538,0.0001810229,0.0006920298,0.0001146162],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001251475,0.001150999,0.3765814,0.0005533405,0.003313107,0.0001432643,0.003415727,0.3126274,0.0008513407,0.1307214,0.1360639,0.03332666],"study_design_scores_gemma":[0.002982905,0.0008319747,0.03533507,0.0005096305,0.00004686943,0.001035223,0.002264918,0.6476279,0.00005079426,0.0008009642,0.3080614,0.0004523152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2883629,0.0046302,0.6876867,0.003037604,0.01548206,0.0003588234,0.00002970796,0.00002570509,0.0003863201],"genre_scores_gemma":[0.9965041,0.0004684094,0.0001668268,0.00001776624,0.002731817,0.000005951664,0.00001281514,0.000005407569,0.00008694781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7081411,"threshold_uncertainty_score":0.4574082,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2900722080","doi":"10.1080/17445760.2018.1550771","title":"How to encrypt a graph","year":2018,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"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":"Plaintext; Encryption; Ciphertext; Computer science; Communication source; Theoretical computer science; Graph; Algorithm; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01845802772943096,"gpt":0.2688799792957745,"spread":0.2504219515663435,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003527086,0.000120234,0.0001825622,0.0002583236,0.00007615036,0.0004632876,0.001001754,0.00004519975,0.00001349381],"category_scores_gemma":[0.00009116565,0.00009743904,0.0001183135,0.00029703,0.00004826179,0.0006170362,0.0001876371,0.00009422704,0.000009909672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002599087,"about_ca_system_score_gemma":0.00003904801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003646239,"about_ca_topic_score_gemma":0.00001526824,"domain_scores_codex":[0.998607,0.00005706327,0.0003981682,0.0001840734,0.0005798658,0.0001737842],"domain_scores_gemma":[0.9984043,0.0000326102,0.0002786422,0.0001906027,0.0008534495,0.0002404123],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003555698,0.0003896905,0.01514656,0.00003123874,0.0009012421,0.000281768,0.001995608,0.0004848668,0.002982619,0.7649761,0.2058761,0.006578635],"study_design_scores_gemma":[0.002709105,0.001175548,0.01608246,0.0002601414,0.00004974907,0.001070833,0.001086164,0.01074691,0.000461591,0.02032793,0.9453241,0.0007054778],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03528972,0.000618229,0.9564083,0.003585052,0.003751871,0.0000866394,0.000106258,0.00002058522,0.0001333417],"genre_scores_gemma":[0.9927558,0.0001202147,0.006159921,0.000113851,0.0008031012,0.000003919822,0.00002035068,0.000003658193,0.00001914498],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9574661,"threshold_uncertainty_score":0.4467493,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4237833787","doi":"10.1080/17445760.2019.1659260","title":"Membrane computing","year":2019,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Imperial Experimental Cancer Medicine Centre; National Natural Science Foundation of China; Canadian Celiac Association","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01161099578073336,"gpt":0.2648090596284974,"spread":0.2531980638477641,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002478535,0.00008814591,0.0001483846,0.00003377894,0.00002630005,0.00004300055,0.0002291213,0.00006679378,0.00002800714],"category_scores_gemma":[0.00004698895,0.00006540508,0.00009216704,0.00003129616,0.00001865065,0.000005298524,0.00009795239,0.00007136072,0.000008241833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001081007,"about_ca_system_score_gemma":0.00001857847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008235685,"about_ca_topic_score_gemma":6.097549e-7,"domain_scores_codex":[0.9991592,0.00004586881,0.0003669,0.0001208117,0.0001958688,0.0001113094],"domain_scores_gemma":[0.9993325,0.00001333689,0.0002615018,0.0000642439,0.0002597226,0.00006873682],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0009850826,0.0002966966,0.2360034,0.00008084114,0.001348598,0.00009643673,0.00009923874,0.0540499,0.6877079,0.003353895,0.01188721,0.004090752],"study_design_scores_gemma":[0.01172576,0.003283425,0.08456522,0.0006547002,0.0001464634,0.002921296,0.002457526,0.04305187,0.01681785,0.0002885399,0.8324563,0.001631046],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9809889,0.0009904529,0.01548046,0.000168615,0.001828576,0.00006513291,0.00002009166,0.000004194942,0.0004536398],"genre_scores_gemma":[0.9987845,0.0001555058,0.0001402146,0.00005482919,0.0005975425,2.775882e-7,0.0001118579,0.000004698787,0.000150511],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8205691,"threshold_uncertainty_score":0.2667142,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2911434043","doi":"10.1080/17445760.2015.1079321","title":"Nonuniversality explained","year":2015,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Computability, Logic, AI Algorithms","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":"Counterexample; Computation; Universality (dynamical systems); Turing machine; Computer science; Turing; Theoretical computer science; Calculus (dental); Arithmetic; Algorithm; Mathematics; Discrete mathematics; Programming language; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.04338346268264646,"gpt":0.2821526329982421,"spread":0.2387691703155956,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008794219,0.0001409571,0.0002607943,0.0001396924,0.00004182175,0.0002051962,0.001085714,0.00005692352,0.00001193987],"category_scores_gemma":[0.0001795363,0.0001180329,0.0001143085,0.0001671271,0.00004208464,0.0005820188,0.0002885448,0.0001336983,0.0000117385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001889232,"about_ca_system_score_gemma":0.0001576721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001047377,"about_ca_topic_score_gemma":0.00000723523,"domain_scores_codex":[0.9979823,0.0001526131,0.000640458,0.0002019267,0.0008465739,0.0001761579],"domain_scores_gemma":[0.9976485,0.00007039875,0.0004401138,0.0002062738,0.001319211,0.0003154697],"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.001265208,0.002652762,0.1347879,0.0001310114,0.002959831,0.003342218,0.008581507,0.2599443,0.0009477521,0.3571413,0.2074206,0.02082558],"study_design_scores_gemma":[0.008904203,0.0009486531,0.02299505,0.0001729078,0.00007180226,0.002474109,0.003109092,0.7672976,0.00009206092,0.01681314,0.1761384,0.000983012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04768721,0.0007946907,0.9432737,0.002062908,0.005617621,0.0001031854,0.00003328525,0.00003846226,0.0003890008],"genre_scores_gemma":[0.9939237,0.00005105925,0.005413344,0.00003731677,0.0004695638,0.000002276215,0.00001795091,0.000004488141,0.00008028637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9462365,"threshold_uncertainty_score":0.4813244,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067908440","doi":"10.1080/17445760.2011.644792","title":"Towards better understanding of the behaviour of Bluetooth networks distributed algorithms","year":2012,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Bluetooth and Wireless Communication Technologies","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":"University of Ottawa","funders":"","keywords":"Bluetooth; Computer science; Scatternet; Algorithm; Leverage (statistics); Implementation; Computer network; Distributed computing; Wireless; Machine learning; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.04321824321711635,"gpt":0.2782119006052522,"spread":0.2349936573881359,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005739697,0.0001315003,0.0002889446,0.0001213111,0.00006983177,0.00005959611,0.001604445,0.0001016396,0.000006435394],"category_scores_gemma":[0.00008332579,0.00008981464,0.0001699577,0.0002706168,0.0001272434,0.000413225,0.0004117361,0.0002126494,3.633758e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001029329,"about_ca_system_score_gemma":0.00005624523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006377207,"about_ca_topic_score_gemma":0.000003089262,"domain_scores_codex":[0.9981601,0.0001198746,0.0008379258,0.00009748078,0.0005822133,0.0002024363],"domain_scores_gemma":[0.997972,0.00007560299,0.001071363,0.0003384843,0.0004522836,0.00009024038],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0001409118,0.000918454,0.6249067,0.00009378282,0.00137106,0.00001437254,0.001282095,0.02984444,0.0008612697,0.3172759,0.01512574,0.008165347],"study_design_scores_gemma":[0.008115096,0.0007281052,0.6012058,0.001890602,0.0004634454,0.0009239776,0.00894346,0.3366202,0.006880995,0.01282233,0.01977805,0.001627951],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06693568,0.002605763,0.9265302,0.001565141,0.002082136,0.0001030953,0.0001100597,0.0000194661,0.00004846395],"genre_scores_gemma":[0.9978669,0.0003886166,0.00155883,0.0000199896,0.0001244147,0.000003903124,0.000023933,0.000005246807,0.000008137943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9309313,"threshold_uncertainty_score":0.3662535,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047736902","doi":"10.1080/17445760903225700","title":"A (4<i>n</i> − 9)/3 diagnosis algorithm for generalised cube networks","year":2010,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Interconnection Networks and Systems","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":"University of Ottawa","funders":"","keywords":"Hypercube; Multiprocessing; Computer science; Cube (algebra); Algorithm; Set (abstract data type); Component (thermodynamics); Mathematics; Combinatorics; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.0140327216031463,"gpt":0.2623787811987453,"spread":0.248346059595599,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007266063,0.0001778873,0.0003200674,0.0001446821,0.0001112714,0.0003938101,0.0008651753,0.0001276458,0.00002141731],"category_scores_gemma":[0.00006407384,0.0001446687,0.0002402383,0.0001322145,0.00003071001,0.000439929,0.00009536293,0.0002366162,0.000002632567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004173653,"about_ca_system_score_gemma":0.00005233136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006952495,"about_ca_topic_score_gemma":0.0000237768,"domain_scores_codex":[0.9981277,0.00007322434,0.0008761275,0.0002270562,0.0004488308,0.0002470466],"domain_scores_gemma":[0.9977356,0.0001418857,0.0006178168,0.0001888872,0.001114385,0.0002014337],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002903431,0.0008453866,0.0160816,0.00007429843,0.002617545,0.0003124151,0.0008099035,0.1857171,0.001587717,0.1748637,0.4886764,0.1281236],"study_design_scores_gemma":[0.001281552,0.0001078563,0.0003808124,0.00005712505,0.00002002399,0.000406309,0.00006343416,0.8264494,0.00003550304,0.0003421861,0.1706654,0.0001903625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008381927,0.0009553321,0.9687493,0.0009820977,0.02053249,0.0002319931,0.00007612605,0.00002838131,0.00006230598],"genre_scores_gemma":[0.9836825,0.0004086072,0.01162905,0.0001521694,0.003796772,0.00009010479,0.00005750132,0.00001434042,0.0001690248],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9753005,"threshold_uncertainty_score":0.5899417,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978643984","doi":"10.1080/17445760801945367","title":"Getting the most of WiFi mesh networks with 802.16 mesh emulation","year":2008,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Wireless Networks and Protocols","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 Toronto","funders":"","keywords":"Wireless mesh network; Order One Network Protocol; Switched mesh; IEEE 802.11s; Computer science; Computer network; Shared mesh; Mesh networking; Network packet; Service set; Wireless network; Wireless; Wi-Fi; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02110527026767335,"gpt":0.2593071260064675,"spread":0.2382018557387942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005035223,0.0001352666,0.000250122,0.00008768771,0.0001363034,0.0001015042,0.0007039625,0.00005779221,0.000009742774],"category_scores_gemma":[0.00002710896,0.00008271325,0.00008687053,0.0002600703,0.00006329545,0.0003585226,0.00009267643,0.000170228,7.922686e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004689562,"about_ca_system_score_gemma":0.0000793047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005932552,"about_ca_topic_score_gemma":0.000007764965,"domain_scores_codex":[0.9981809,0.0001209204,0.0007206733,0.0001418062,0.0006682558,0.0001674202],"domain_scores_gemma":[0.9980073,0.0001095216,0.0008844344,0.0001674085,0.000741541,0.00008978307],"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.0003747478,0.0001680495,0.05393222,0.00003476443,0.0007264005,0.000144549,0.0007478934,0.8560088,0.0001566108,0.05849131,0.02576369,0.003450999],"study_design_scores_gemma":[0.002257502,0.0003697966,0.02472872,0.0005005343,0.00003911853,0.001228255,0.0002291135,0.9518007,0.00005876506,0.0004227248,0.01804465,0.0003200945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03466228,0.0008022254,0.9619288,0.0008338022,0.0009405906,0.0006062244,0.00001372455,0.00001337173,0.0001989524],"genre_scores_gemma":[0.9983402,0.000240061,0.0006877945,0.00004465478,0.0005305659,0.00004296278,0.00002053919,0.000006584159,0.00008665879],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9636779,"threshold_uncertainty_score":0.3372948,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111602967","doi":"10.1080/17445760500173485","title":"A paradigm for controllable QoS-based medium access control in local and<i>ad hoc</i>wireless networks","year":2005,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Wireless Networks and Protocols","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":"Countdown; Computer network; Computer science; Access control; Network packet; Quality of service; Random access; Channel access method; Protocol (science); Wireless; Multiple Access with Collision Avoidance for Wireless; Optimized Link State Routing Protocol; Telecommunications; Routing protocol; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01759009170794508,"gpt":0.2929534072630398,"spread":0.2753633155550947,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008506778,0.0002038892,0.0004852616,0.0001558306,0.00007279945,0.000422381,0.0008716144,0.0001196088,0.000007746842],"category_scores_gemma":[0.00002660183,0.000167465,0.0001244894,0.0001542778,0.00005588606,0.0006089499,0.00008122581,0.0001926578,8.254476e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00010692,"about_ca_system_score_gemma":0.000135741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003529491,"about_ca_topic_score_gemma":0.00008577135,"domain_scores_codex":[0.997894,0.0001276258,0.0009363392,0.0002530389,0.0004596822,0.0003292713],"domain_scores_gemma":[0.9984375,0.0002823041,0.0005832561,0.0001413129,0.0003379418,0.0002177332],"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.001464826,0.0002279559,0.009637527,0.00004678595,0.0002782544,0.00007516237,0.00007907728,0.9547856,0.00003953027,0.01148258,0.01100921,0.01087352],"study_design_scores_gemma":[0.007810516,0.0001756846,0.001553388,0.0001897654,0.00001687813,0.00005534582,0.00002101913,0.9374174,0.00001037487,0.000315625,0.05225091,0.0001830138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005076264,0.004672665,0.9804349,0.006774466,0.001484275,0.001467516,0.0000595954,0.00001738741,0.00001290788],"genre_scores_gemma":[0.9973521,0.0003860199,0.0006409282,0.0003723647,0.000767926,0.0004255472,0.00002642603,0.00001024885,0.00001850082],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9922758,"threshold_uncertainty_score":0.6829025,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977329051","doi":"10.1080/17445760.2012.660485","title":"Transmission rate enhancement via adaptive relaying in wireless networks","year":2012,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Cooperative Communication and Network Coding","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":"Fading; Transmission (telecommunications); Computer science; Wireless; Computer network; Channel (broadcasting); Constraint (computer-aided design); Link adaptation; Transmission rate; Wireless network; Energy (signal processing); Electronic engineering; Telecommunications; Engineering; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03429700463140622,"gpt":0.2877551742185444,"spread":0.2534581695871382,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000920856,0.0001167234,0.0001957784,0.0001228835,0.00007079836,0.00008154607,0.0005662288,0.00004784117,0.00002088455],"category_scores_gemma":[0.00001487305,0.00009742728,0.00006503412,0.00018259,0.00001849725,0.0005810182,0.0001219012,0.0001988493,0.000002975801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001133124,"about_ca_system_score_gemma":0.0000298177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001118014,"about_ca_topic_score_gemma":0.000003879813,"domain_scores_codex":[0.9985235,0.0002540469,0.0006193709,0.0001097779,0.0002938648,0.000199382],"domain_scores_gemma":[0.9990093,0.00007675135,0.0003395046,0.0001224598,0.0003072521,0.0001447785],"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.001271198,0.002306961,0.08467975,0.00006697458,0.001468713,0.0002276213,0.009436632,0.2837691,0.01947148,0.2515796,0.01345807,0.3322639],"study_design_scores_gemma":[0.00139778,0.0001012102,0.01028721,0.0003455775,0.00001199518,0.00009199978,0.0001946411,0.973084,0.0001541699,0.0001202815,0.01397334,0.000237812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0283439,0.006484069,0.9627388,0.0006251537,0.001565459,0.00009819571,0.000001753224,0.000009096534,0.0001335627],"genre_scores_gemma":[0.994197,0.004355187,0.001112567,0.00004926107,0.0002232149,0.000007753337,0.00001231191,0.000004420005,0.00003834833],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.965853,"threshold_uncertainty_score":0.3972969,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2914014471","doi":"10.1080/17445760.2019.1570193","title":"A computational journey in the true north","year":2019,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Computability, Logic, AI 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":true},"ca_institutions":"Queen's University","funders":"","keywords":"History; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02036448994160025,"gpt":0.2700259370955593,"spread":0.2496614471539591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009055962,0.0001461317,0.0002607132,0.0001942114,0.00004560402,0.0002939952,0.001449095,0.00004546009,0.00002503629],"category_scores_gemma":[0.00007410566,0.00009991135,0.0001288947,0.0002863405,0.00003141995,0.0004332149,0.0001662828,0.0002449743,0.00002019684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001025836,"about_ca_system_score_gemma":0.0001152577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000633857,"about_ca_topic_score_gemma":0.00002481307,"domain_scores_codex":[0.9975674,0.0002279935,0.0008182554,0.0002054513,0.000990737,0.0001901251],"domain_scores_gemma":[0.9984589,0.0002328993,0.0004544996,0.0001955754,0.0005653186,0.00009282164],"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.00009387325,0.0004650657,0.2583499,0.00003058456,0.0002522219,0.0002689621,0.001827892,0.6865836,0.00002445171,0.04323972,0.006394536,0.002469255],"study_design_scores_gemma":[0.002312193,0.0002436329,0.2983736,0.00008218948,0.00001258383,0.001256497,0.0005958246,0.6766838,0.000001619823,0.00585038,0.01432609,0.0002614717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4286406,0.0006624067,0.5638987,0.003090921,0.003232235,0.0002371711,0.00003557267,0.00001424556,0.0001881154],"genre_scores_gemma":[0.9974607,0.00005028734,0.00202656,0.0001239338,0.0002730433,0.000004929993,0.00002892604,0.000004262039,0.00002737106],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5688201,"threshold_uncertainty_score":0.4074267,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092935629","doi":"10.1080/10637199808947384","title":"RANDOMIZED OPTIMAL LIST RANKING ON COARSE-GRAINED PARALLEL COMPUTERS WITH O(log p) COMMUNICATION PHASES","year":2000,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","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":"York University","funders":"","keywords":"Computer science; Ranking (information retrieval); Computation; Parallel algorithm; Cost efficiency; Parallel computing; Randomized algorithm; Theoretical computer science; Algorithm; Information retrieval","retraction":null,"screen_n_in":null,"score":{"opus":0.01786713948870236,"gpt":0.275782526090011,"spread":0.2579153866013086,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001207,0.0002669474,0.0006059601,0.0002477624,0.000215637,0.0004302044,0.001270066,0.00008193836,0.00005142658],"category_scores_gemma":[0.00009092432,0.0002007612,0.0001995689,0.0002171459,0.0001408912,0.0004608344,0.00009442918,0.000278155,0.000005553706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008135348,"about_ca_system_score_gemma":0.00007179468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008590682,"about_ca_topic_score_gemma":0.000003087446,"domain_scores_codex":[0.9971645,0.0005316203,0.001018441,0.0002751876,0.0007725796,0.0002376719],"domain_scores_gemma":[0.9976591,0.0004173642,0.000776706,0.0003250126,0.0006565595,0.0001652842],"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.01326015,0.000337368,0.0002411457,0.00001345451,0.0006601302,0.00009732426,0.0006847996,0.9482094,0.00001741527,0.0198111,0.01251975,0.00414796],"study_design_scores_gemma":[0.05585954,0.0003509813,0.00008699256,0.0004792281,0.00005489156,0.000428852,0.0001012186,0.9284383,0.00002913572,0.0005285919,0.0132575,0.0003847377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01913208,0.001048227,0.9761373,0.001839039,0.0005505756,0.0003318774,0.00002165812,0.0001257479,0.0008134805],"genre_scores_gemma":[0.9362836,0.001268405,0.06169358,0.0002008605,0.0001801724,0.00002148294,0.000108973,0.00001365588,0.0002292851],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9171515,"threshold_uncertainty_score":0.8186804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990808368","doi":"10.1080/17445760903330971","title":"Special issue on Grid and P2P Systems","year":2011,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Tellabs (Canada)","funders":"","keywords":"Grid; Computer science; Grid system; Distributed computing; Geology; Geodesy","retraction":null,"screen_n_in":null,"score":{"opus":0.03083839866762356,"gpt":0.256778583519186,"spread":0.2259401848515624,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007261091,0.0002682036,0.0004557648,0.0002407075,0.000113557,0.0004031695,0.001048336,0.0001139731,0.00003847843],"category_scores_gemma":[0.00007201236,0.0002188324,0.0001286708,0.0001719609,0.00005840601,0.0004167215,0.0001915997,0.0002264693,0.00004082302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007664882,"about_ca_system_score_gemma":0.00006847046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001661756,"about_ca_topic_score_gemma":0.000002952935,"domain_scores_codex":[0.9973242,0.0001942867,0.00103582,0.0003283667,0.0008206376,0.0002966532],"domain_scores_gemma":[0.997974,0.00008522466,0.0007803563,0.0002511058,0.0006121922,0.0002970616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007243013,0.0008590826,0.02199187,0.0002116886,0.001777771,0.001444305,0.004027686,0.02688213,0.0001122411,0.2067388,0.7289185,0.006311588],"study_design_scores_gemma":[0.002578639,0.000766094,0.01000654,0.0005934138,0.00005247259,0.002032713,0.0008305192,0.03856137,0.00001855951,0.0004388813,0.9434961,0.0006246921],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05924987,0.005618605,0.7803977,0.001435938,0.1289869,0.000820811,0.0005587229,0.0001880186,0.02274347],"genre_scores_gemma":[0.9806614,0.0003202001,0.0004792791,0.00005116262,0.01802768,0.000007660701,0.00004564199,0.00001338071,0.00039362],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9214115,"threshold_uncertainty_score":0.8923725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403412891","doi":"10.1080/17445760.2024.2388245","title":"Advanced swarm intelligence algorithms in quantum circuit design","year":2024,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"School of Graduate Studies, Queen's University; European Commission","keywords":"Computer science; Swarm intelligence; Swarm behaviour; Quantum computer; Quantum; Quantum circuit; Algorithm; Computer engineering; Artificial intelligence; Particle swarm optimization; Quantum network; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.029971066380653,"gpt":0.2892045683903734,"spread":0.2592335020097204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007908688,0.0001830065,0.0002695417,0.000357286,0.00004623226,0.000388745,0.0009400193,0.00006395386,0.000007070254],"category_scores_gemma":[0.00007488894,0.0001471424,0.0001204692,0.0003706049,0.000034145,0.0003970055,0.0001422137,0.000313584,0.00001054443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001287335,"about_ca_system_score_gemma":0.0001608232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000424832,"about_ca_topic_score_gemma":0.000001852326,"domain_scores_codex":[0.9979238,0.0001250077,0.0008114312,0.0002898093,0.0006038492,0.0002461181],"domain_scores_gemma":[0.9990275,0.0001887859,0.0002267051,0.0001446825,0.0002733485,0.0001389698],"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.0000387872,0.00008127261,0.0001872068,0.00004335163,0.0001819227,0.001049059,0.0008573989,0.9007924,0.0002731549,0.03848021,0.001223729,0.05679157],"study_design_scores_gemma":[0.0002673917,0.0001349712,0.0003164169,0.0004106371,0.000006987535,0.0006328498,0.0001337381,0.9849717,0.00006845267,0.006287719,0.006596636,0.0001724783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01657658,0.007614265,0.9687709,0.0008810177,0.005926803,0.0001220073,0.00002048825,0.00005720239,0.00003070479],"genre_scores_gemma":[0.9912307,0.0006232187,0.007650422,0.00002857151,0.0003998982,0.00000614571,0.000009171669,0.00001021996,0.00004165181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9746541,"threshold_uncertainty_score":0.6000292,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403465826","doi":"10.1080/17445760.2024.2413509","title":"Cellular automaton model of self-healing","year":2024,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Cellular Automata 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":"Brock University","funders":"","keywords":"Computer science; Cellular automaton; Asynchronous cellular automaton; Self-healing; Automaton; Theoretical computer science; Distributed computing; Mobile automaton; Artificial intelligence; Automata theory","retraction":null,"screen_n_in":null,"score":{"opus":0.01895981900161137,"gpt":0.2692485628600408,"spread":0.2502887438584295,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003351958,0.0001002058,0.0001825395,0.0001612073,0.00003572101,0.0001689222,0.0005880097,0.00004722576,0.000007010032],"category_scores_gemma":[0.00001201625,0.00008395895,0.0001272137,0.0001565589,0.00001737564,0.0003181053,0.00009831411,0.0001018743,0.000006587694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005087802,"about_ca_system_score_gemma":0.0001187835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001910722,"about_ca_topic_score_gemma":6.218502e-7,"domain_scores_codex":[0.9985849,0.00003129524,0.0006454707,0.0001471988,0.0004783735,0.0001127832],"domain_scores_gemma":[0.9991603,0.00004018463,0.0002505408,0.0001417393,0.0003123347,0.00009485311],"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.00002100731,0.0002969221,0.0006593674,0.0002678605,0.000868507,0.0001543373,0.001266185,0.2240919,0.03968093,0.7181846,0.01245447,0.00205392],"study_design_scores_gemma":[0.0002021684,0.0000229433,0.00005783301,0.0001140508,0.00002349463,0.0001010067,0.00004867558,0.9872795,0.0006954165,0.001492253,0.009879399,0.0000832107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04908749,0.003983684,0.9446371,0.0006863724,0.001262901,0.00007496594,0.00006267039,0.00006685586,0.0001379961],"genre_scores_gemma":[0.9931611,0.0003174292,0.006272268,0.000009210995,0.0001482008,0.000004589676,0.00002832631,0.000006151843,0.00005272903],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9440736,"threshold_uncertainty_score":0.3423747,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2344387828","doi":"10.1080/17445760.2016.1170831","title":"FMSLPP: fake-message based sink location privacy preservation for WSNs against global eavesdroppers","year":2016,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Security in Wireless Sensor Networks","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 Ottawa","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Sink (geography); Adversary; Computer science; Software deployment; Encryption; Computer network; Computer security; Wireless sensor network; Privacy protection; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.02353065024600886,"gpt":0.2801555578933748,"spread":0.2566249076473659,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004840782,0.0001861351,0.00025403,0.0001117864,0.0000865779,0.0002327232,0.00103015,0.0001102088,0.000007273027],"category_scores_gemma":[0.0002955434,0.0001380465,0.0001474708,0.0002100057,0.00004680004,0.0009048347,0.0001039643,0.00008259246,0.000004988941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000295702,"about_ca_system_score_gemma":0.0001469068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002462065,"about_ca_topic_score_gemma":0.000008172313,"domain_scores_codex":[0.9978181,0.0001108678,0.0008155734,0.0002613446,0.0007397059,0.0002544655],"domain_scores_gemma":[0.9972262,0.0001800219,0.0007391003,0.0002474801,0.001434424,0.0001727314],"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.00177211,0.001390427,0.09504172,0.0003530135,0.002261689,0.0002388241,0.001254368,0.4807043,0.008610515,0.230295,0.1288514,0.04922667],"study_design_scores_gemma":[0.007200787,0.0003659216,0.01578855,0.0009456055,0.00006039706,0.0001289562,0.0001941406,0.8895036,0.0002958218,0.00319125,0.08169724,0.0006277199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0631525,0.0005960068,0.9270208,0.005660565,0.00301701,0.0002821521,0.0001621864,0.00003893703,0.00006981968],"genre_scores_gemma":[0.9961388,0.0001594648,0.002846716,0.0001192575,0.000561446,0.0000190935,0.00008998713,0.000008899382,0.00005631383],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9329863,"threshold_uncertainty_score":0.5629373,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4410600849","doi":"10.1080/17445760.2025.2508165","title":"Fair and efficient resource allocation optimization for internet of vehicles (IoV) in edge computing environments","year":2025,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"IoT and Edge/Fog Computing","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":"Queen's University","funders":"","keywords":"Computer science; Resource allocation; The Internet; Enhanced Data Rates for GSM Evolution; Distributed computing; Resource (disambiguation); Edge computing; Computer network; World Wide Web; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01286602744354434,"gpt":0.2589817957774178,"spread":0.2461157683338735,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005603735,0.00009717805,0.0001989016,0.0002297429,0.00003811945,0.00008056458,0.0003550175,0.00004821805,4.775964e-7],"category_scores_gemma":[0.0000694136,0.00009031712,0.0000522276,0.0001243249,0.00002912645,0.0001192523,0.0001656959,0.00007476677,1.994993e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000790878,"about_ca_system_score_gemma":0.00003253376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002683285,"about_ca_topic_score_gemma":5.5978e-7,"domain_scores_codex":[0.9987302,0.00006510144,0.000684777,0.0001577467,0.000241702,0.0001204143],"domain_scores_gemma":[0.9991885,0.000111118,0.0004270012,0.00007308755,0.0001561864,0.00004405281],"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.0001565896,0.0002223357,0.01916328,0.0001234502,0.0002074086,0.000008658884,0.001137936,0.9573045,0.0007085048,0.009322812,0.004090856,0.007553664],"study_design_scores_gemma":[0.001046363,0.00005317264,0.006156931,0.0002961612,0.00001054927,0.00001467207,0.0001283401,0.9875919,0.0001699544,0.00008620942,0.004368985,0.00007673131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1780462,0.0007794541,0.8183973,0.0003504795,0.002253794,0.0001287324,0.000002346604,0.000005332026,0.0000363056],"genre_scores_gemma":[0.9954429,0.00004566434,0.004227727,0.00002078514,0.0001954469,0.000002443526,0.00002494666,0.000003426121,0.00003660853],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8173968,"threshold_uncertainty_score":0.3683025,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}