{"meta":{"query_hash":"95ef5f692d5e","filters":{"venue":"International Journal of Parallel Emergent and Distributed Systems"},"cohort_total":21,"direct_labels_cover":0,"predictions_cover":21,"exported":21,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/95ef5f692d5e","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Parallel+Emergent+and+Distributed+Systems"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.034297004631406225,"score_gpt":0.2877551742185444,"score_spread":0.2534581695871382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977329051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0283439,0.0064840694,0.9627388,0.00062515365,0.0015654591,0.00009819571,0.0000017532236,0.000009096534,0.00013356267],"genre_scores_gemma":[0.99419695,0.0043551866,0.0011125671,0.00004926107,0.00022321485,0.000007753337,0.0000123119125,0.000004420005,0.00003834833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852353,0.00025404687,0.0006193709,0.0001097779,0.00029386475,0.00019938205],"domain_scores_gemma":[0.99900925,0.00007675135,0.00033950462,0.0001224598,0.0003072521,0.00014477852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000920856,0.00011672337,0.00019577843,0.00012288347,0.00007079836,0.00008154607,0.00056622876,0.000047841168,0.00002088455],"category_scores_gemma":[0.000014873051,0.000097427284,0.00006503412,0.00018258995,0.000018497245,0.0005810182,0.00012190119,0.0001988493,0.0000029758012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012711979,0.002306961,0.084679745,0.00006697458,0.0014687134,0.00022762129,0.009436632,0.28376913,0.019471481,0.25157955,0.013458072,0.33226392],"study_design_scores_gemma":[0.0013977801,0.00010121019,0.01028721,0.0003455775,0.000011995185,0.00009199978,0.00019464106,0.973084,0.00015416989,0.000120281475,0.013973337,0.00023781197],"about_ca_topic_score_codex":0.000011180142,"about_ca_topic_score_gemma":0.0000038798125,"teacher_disagreement_score":0.96585304,"about_ca_system_score_codex":0.00011331244,"about_ca_system_score_gemma":0.000029817704,"threshold_uncertainty_score":0.39729694},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021105270267673348,"score_gpt":0.25930712600646755,"score_spread":0.2382018557387942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978643984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034662277,0.0008022254,0.96192884,0.0008338022,0.00094059063,0.0006062244,0.000013724548,0.00001337173,0.00019895237],"genre_scores_gemma":[0.9983402,0.00024006104,0.0006877945,0.000044654782,0.00053056586,0.000042962783,0.000020539192,0.000006584159,0.000086658794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981809,0.00012092044,0.0007206733,0.00014180622,0.0006682558,0.00016742016],"domain_scores_gemma":[0.9980073,0.000109521585,0.0008844344,0.00016740852,0.000741541,0.00008978307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005035223,0.00013526664,0.00025012196,0.00008768771,0.00013630344,0.000101504214,0.0007039625,0.000057792215,0.000009742774],"category_scores_gemma":[0.000027108956,0.000082713246,0.00008687053,0.00026007034,0.000063295454,0.0003585226,0.000092676426,0.00017022801,7.9226857e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037474785,0.00016804946,0.053932223,0.000034764427,0.00072640047,0.00014454899,0.0007478934,0.85600877,0.00015661084,0.05849131,0.025763694,0.0034509988],"study_design_scores_gemma":[0.002257502,0.0003697966,0.024728717,0.00050053425,0.000039118528,0.0012282552,0.0002291135,0.9518007,0.000058765057,0.0004227248,0.018044654,0.00032009452],"about_ca_topic_score_codex":0.000059325524,"about_ca_topic_score_gemma":0.000007764965,"teacher_disagreement_score":0.9636779,"about_ca_system_score_codex":0.000046895617,"about_ca_system_score_gemma":0.0000793047,"threshold_uncertainty_score":0.33729482},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Tellabs (Canada)","funders":"","keywords":"Grid; Computer science; Grid system; Distributed computing; Geology; Geodesy","score_opus":0.03083839866762356,"score_gpt":0.256778583519186,"score_spread":0.22594018485156242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990808368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059249867,0.005618605,0.78039765,0.001435938,0.12898692,0.00082081096,0.0005587229,0.0001880186,0.022743473],"genre_scores_gemma":[0.9806614,0.00032020005,0.00047927906,0.00005116262,0.01802768,0.000007660701,0.000045641995,0.00001338071,0.00039361996],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973242,0.00019428672,0.0010358201,0.00032836673,0.0008206376,0.00029665322],"domain_scores_gemma":[0.99797404,0.00008522466,0.0007803563,0.00025110584,0.0006121922,0.0002970616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007261091,0.00026820358,0.0004557648,0.00024070748,0.00011355702,0.00040316946,0.0010483362,0.000113973096,0.000038478433],"category_scores_gemma":[0.00007201236,0.00021883236,0.00012867081,0.00017196093,0.000058406014,0.00041672145,0.00019159971,0.00022646926,0.00004082302],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072430127,0.00085908256,0.021991866,0.00021168859,0.0017777714,0.001444305,0.004027686,0.02688213,0.0001122411,0.20673883,0.7289185,0.006311588],"study_design_scores_gemma":[0.002578639,0.00076609396,0.010006537,0.00059341383,0.000052472587,0.0020327126,0.0008305192,0.038561374,0.000018559509,0.00043888134,0.9434961,0.0006246921],"about_ca_topic_score_codex":0.00016617561,"about_ca_topic_score_gemma":0.0000029529353,"teacher_disagreement_score":0.9214115,"about_ca_system_score_codex":0.000076648816,"about_ca_system_score_gemma":0.000068470465,"threshold_uncertainty_score":0.8923725},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011094629478666957,"score_gpt":0.25628133272817283,"score_spread":0.24518670324950587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046441464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15975939,0.0008954766,0.83473784,0.0028880187,0.0015715533,0.00006771204,0.00002078564,0.00002628519,0.00003294313],"genre_scores_gemma":[0.9934755,0.00018147644,0.005824615,0.00008725247,0.00039033324,0.0000014606364,0.000028887483,0.000003387869,0.0000070664237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856794,0.000061359926,0.00064287864,0.00011256697,0.0004746742,0.00014056341],"domain_scores_gemma":[0.9987966,0.000057761164,0.0004957993,0.00007570688,0.00044861675,0.00012552123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003810427,0.00012382827,0.00018336516,0.00018794078,0.000084718515,0.00033038072,0.0003616444,0.000048154245,0.0000027934252],"category_scores_gemma":[0.000048506823,0.00010048162,0.000059987236,0.00010628985,0.000028457602,0.00088816026,0.0001167138,0.00014056353,0.000006343224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012683774,0.00018410543,0.0036372906,0.00006573625,0.0004092071,0.00005825284,0.0025481929,0.7329125,0.00025690853,0.14129935,0.015062131,0.10343949],"study_design_scores_gemma":[0.0007189023,0.00009153519,0.0035921696,0.00006117405,0.0000076275865,0.0004408451,0.00012128543,0.9681239,0.000006975606,0.0011239005,0.025594031,0.00011765961],"about_ca_topic_score_codex":0.000029591687,"about_ca_topic_score_gemma":0.0000014728313,"teacher_disagreement_score":0.83371615,"about_ca_system_score_codex":0.00003971544,"about_ca_system_score_gemma":0.000043289583,"threshold_uncertainty_score":0.40975216},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014032721603146303,"score_gpt":0.2623787811987453,"score_spread":0.248346059595599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047736902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008381927,0.00095533207,0.96874934,0.0009820977,0.020532489,0.00023199314,0.000076126045,0.00002838131,0.000062305975],"genre_scores_gemma":[0.98368245,0.00040860721,0.0116290515,0.0001521694,0.003796772,0.00009010479,0.000057501322,0.00001434042,0.00016902476],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981277,0.000073224335,0.00087612745,0.00022705617,0.00044883083,0.00024704658],"domain_scores_gemma":[0.9977356,0.00014188568,0.00061781675,0.0001888872,0.0011143846,0.00020143374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007266063,0.00017788733,0.00032006737,0.0001446821,0.00011127139,0.0003938101,0.0008651753,0.00012764582,0.000021417305],"category_scores_gemma":[0.000064073836,0.00014466868,0.0002402383,0.00013221453,0.000030710013,0.000439929,0.00009536293,0.00023661624,0.0000026325665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029034313,0.0008453866,0.016081601,0.00007429843,0.0026175454,0.00031241507,0.00080990355,0.18571714,0.0015877169,0.17486365,0.4886764,0.1281236],"study_design_scores_gemma":[0.0012815525,0.00010785631,0.00038081245,0.000057125053,0.000020023992,0.00040630897,0.000063434156,0.8264494,0.000035503035,0.0003421861,0.17066541,0.00019036245],"about_ca_topic_score_codex":0.00006952495,"about_ca_topic_score_gemma":0.000023776804,"teacher_disagreement_score":0.9753005,"about_ca_system_score_codex":0.000041736526,"about_ca_system_score_gemma":0.000052331365,"threshold_uncertainty_score":0.58994174},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028833857023950027,"score_gpt":0.2898491929551212,"score_spread":0.26101533593117116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049763834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27038062,0.00067147927,0.72545165,0.0023192177,0.0009108335,0.00013846412,0.000037741433,0.000021509151,0.000068496855],"genre_scores_gemma":[0.99525666,0.00003574366,0.004322059,0.000054417982,0.00029751647,0.0000022657575,0.0000111362315,0.000004099558,0.000016088006],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99866617,0.00009690055,0.00044193811,0.00017987724,0.000396641,0.00021848272],"domain_scores_gemma":[0.9983647,0.0001051553,0.00030519083,0.00014344686,0.00075697614,0.00032456362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057777885,0.00013021038,0.00021051294,0.00011798826,0.00009216029,0.00014055082,0.0005479354,0.000036987087,0.000005133145],"category_scores_gemma":[0.00006507059,0.00010163053,0.000047100457,0.00020151574,0.00002668765,0.00045131572,0.00026718373,0.000109650086,0.000003287414],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003040547,0.0009860807,0.38946977,0.00010406673,0.0012245002,0.00007915077,0.0049540815,0.2700584,0.0010563686,0.31024262,0.006411341,0.015109556],"study_design_scores_gemma":[0.0029389684,0.00057272165,0.5626971,0.00024078143,0.00008448694,0.002111274,0.0013367329,0.39146692,0.000057913552,0.0014338697,0.036246117,0.0008131429],"about_ca_topic_score_codex":0.00006700328,"about_ca_topic_score_gemma":0.000007666057,"teacher_disagreement_score":0.72487605,"about_ca_system_score_codex":0.00012489928,"about_ca_system_score_gemma":0.00005979139,"threshold_uncertainty_score":0.4144373},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Electronic cash; Business; World Wide Web","score_opus":0.015877694235384827,"score_gpt":0.2838235642934869,"score_spread":0.26794587005810205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064720601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08673925,0.002451635,0.90746605,0.0013993442,0.0010172536,0.00018457268,0.00069190975,0.000030835974,0.000019164167],"genre_scores_gemma":[0.9973871,0.00019130611,0.001687119,0.00007435755,0.00033490954,0.0000074017357,0.0003085428,0.000004480907,0.00000474584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99817646,0.00009120801,0.00066405296,0.00023228441,0.0005133345,0.00032266253],"domain_scores_gemma":[0.9984345,0.00011039918,0.00045432727,0.00019861704,0.0006279407,0.00017424767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006637498,0.00018100659,0.00029005454,0.00018737219,0.0000965227,0.00024752712,0.0009726048,0.00007224867,0.000006911846],"category_scores_gemma":[0.00015616958,0.00014923104,0.00022402522,0.00022351714,0.00003201802,0.00021535222,0.00007078723,0.0001904481,0.0000013304984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013974945,0.0011703992,0.013502027,0.00008549144,0.0017690355,0.00020912275,0.00076889695,0.019525127,0.0017830601,0.88901836,0.05701751,0.013753506],"study_design_scores_gemma":[0.013183984,0.0032344568,0.07180718,0.00047541247,0.00020554927,0.002576116,0.00059281173,0.19565621,0.0005973301,0.1348998,0.5749331,0.0018380687],"about_ca_topic_score_codex":0.000029770465,"about_ca_topic_score_gemma":0.000017108683,"teacher_disagreement_score":0.91064787,"about_ca_system_score_codex":0.00006987645,"about_ca_system_score_gemma":0.00011321946,"threshold_uncertainty_score":0.60854656},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04321824321711635,"score_gpt":0.2782119006052522,"score_spread":0.23499365738813585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067908440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06693568,0.0026057626,0.9265302,0.0015651408,0.0020821362,0.00010309527,0.00011005972,0.000019466097,0.000048463946],"genre_scores_gemma":[0.9978669,0.00038861664,0.0015588299,0.000019989599,0.00012441467,0.0000039031243,0.000023933004,0.000005246807,0.000008137943],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99816006,0.00011987457,0.0008379258,0.00009748078,0.00058221334,0.00020243626],"domain_scores_gemma":[0.997972,0.00007560299,0.0010713629,0.00033848427,0.00045228357,0.00009024038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057396974,0.0001315003,0.00028894458,0.00012131112,0.000069831774,0.000059596106,0.0016044446,0.000101639605,0.000006435394],"category_scores_gemma":[0.000083325795,0.00008981464,0.00016995773,0.00027061682,0.00012724339,0.00041322503,0.0004117361,0.00021264942,3.6337576e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014091183,0.00091845397,0.62490666,0.00009378282,0.0013710599,0.000014372537,0.001282095,0.029844437,0.0008612697,0.3172759,0.015125737,0.008165347],"study_design_scores_gemma":[0.008115096,0.0007281052,0.6012058,0.0018906022,0.00046344538,0.00092397764,0.00894346,0.33662015,0.0068809954,0.012822335,0.019778049,0.0016279512],"about_ca_topic_score_codex":0.00006377207,"about_ca_topic_score_gemma":0.0000030892616,"teacher_disagreement_score":0.93093127,"about_ca_system_score_codex":0.00010293287,"about_ca_system_score_gemma":0.00005624523,"threshold_uncertainty_score":0.36625347},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01786713948870236,"score_gpt":0.27578252609001097,"score_spread":0.25791538660130864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092935629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019132081,0.0010482266,0.97613734,0.0018390386,0.00055057555,0.0003318774,0.00002165812,0.00012574786,0.00081348047],"genre_scores_gemma":[0.9362836,0.0012684052,0.061693575,0.0002008605,0.00018017238,0.00002148294,0.00010897301,0.000013655885,0.0002292851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971645,0.00053162035,0.001018441,0.00027518757,0.00077257963,0.00023767186],"domain_scores_gemma":[0.9976591,0.0004173642,0.00077670603,0.00032501257,0.0006565595,0.00016528422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012069999,0.00026694743,0.0006059601,0.0002477624,0.00021563699,0.00043020444,0.0012700662,0.000081938364,0.000051426578],"category_scores_gemma":[0.000090924324,0.00020076119,0.00019956894,0.00021714593,0.00014089118,0.00046083445,0.000094429175,0.000278155,0.0000055537057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013260153,0.00033736802,0.0002411457,0.000013454508,0.0006601302,0.00009732426,0.00068479957,0.9482094,0.000017415272,0.019811105,0.012519749,0.00414796],"study_design_scores_gemma":[0.055859536,0.00035098125,0.00008699256,0.00047922813,0.00005489156,0.00042885196,0.000101218626,0.9284383,0.000029135717,0.0005285919,0.0132575,0.00038473774],"about_ca_topic_score_codex":0.00008590682,"about_ca_topic_score_gemma":0.0000030874462,"teacher_disagreement_score":0.9171515,"about_ca_system_score_codex":0.00008135348,"about_ca_system_score_gemma":0.00007179468,"threshold_uncertainty_score":0.8186804},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017590091707945076,"score_gpt":0.2929534072630398,"score_spread":0.27536331555509475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111602967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005076264,0.004672665,0.9804349,0.0067744656,0.0014842751,0.0014675156,0.0000595954,0.00001738741,0.000012907877],"genre_scores_gemma":[0.99735206,0.0003860199,0.0006409282,0.00037236474,0.000767926,0.00042554716,0.000026426025,0.000010248854,0.000018500818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789405,0.00012762583,0.0009363392,0.00025303886,0.00045968223,0.00032927134],"domain_scores_gemma":[0.99843746,0.00028230413,0.00058325613,0.00014131294,0.00033794183,0.0002177332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085067784,0.0002038892,0.00048526164,0.00015583062,0.00007279945,0.00042238104,0.00087161444,0.00011960879,0.000007746842],"category_scores_gemma":[0.000026601834,0.00016746501,0.00012448942,0.00015427782,0.00005588606,0.0006089499,0.000081225815,0.00019265778,8.2544756e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014648264,0.00022795591,0.009637527,0.00004678595,0.00027825436,0.000075162374,0.00007907728,0.9547856,0.000039530267,0.011482584,0.011009205,0.010873519],"study_design_scores_gemma":[0.007810516,0.00017568465,0.0015533877,0.00018976537,0.000016878128,0.000055345823,0.000021019134,0.93741745,0.000010374867,0.00031562505,0.052250914,0.00018301379],"about_ca_topic_score_codex":0.000035294914,"about_ca_topic_score_gemma":0.000085771346,"teacher_disagreement_score":0.9922758,"about_ca_system_score_codex":0.00010692001,"about_ca_system_score_gemma":0.00013574102,"threshold_uncertainty_score":0.6829025},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02808792312093643,"score_gpt":0.25841130990429984,"score_spread":0.2303233867833634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343583372","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.536015,0.0014247351,0.46214613,0.00020333331,0.000083931685,0.000080964026,0.000022581442,0.000008845765,0.000014514884],"genre_scores_gemma":[0.9985066,0.0012351858,0.00014793582,0.000004640205,0.000052196956,0.000006130239,0.000022676031,0.000010158782,0.000014454162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898446,0.00005653805,0.0005385679,0.000077149896,0.00026245698,0.00008085543],"domain_scores_gemma":[0.9990513,0.000116622236,0.00025137354,0.000110618916,0.00039925415,0.00007083395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002648363,0.000103372615,0.0001893086,0.00010026186,0.000042492655,0.000053028787,0.00013396841,0.000045352663,0.0000033138872],"category_scores_gemma":[0.000015831652,0.000070664115,0.000025478352,0.00004651213,0.000036772384,0.00026570712,0.000031967138,0.000057629313,4.5345874e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007995465,0.000020227251,0.007255987,0.00004342125,0.00016430565,0.0000013455174,0.0003094926,0.98263246,0.008924359,0.00007612696,0.000031179115,0.00046112246],"study_design_scores_gemma":[0.0012091842,0.00006437754,0.001642158,0.0004924978,0.00004024797,0.000039186816,0.00041002763,0.9950668,0.00026699988,0.00013192726,0.00052482454,0.000111771886],"about_ca_topic_score_codex":0.00004064481,"about_ca_topic_score_gemma":0.000011377271,"teacher_disagreement_score":0.46249166,"about_ca_system_score_codex":0.000044244553,"about_ca_system_score_gemma":0.000010138017,"threshold_uncertainty_score":0.2881599},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02353065024600886,"score_gpt":0.28015555789337476,"score_spread":0.2566249076473659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344387828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0631525,0.0005960068,0.92702085,0.005660565,0.0030170104,0.00028215206,0.00016218644,0.000038937025,0.00006981968],"genre_scores_gemma":[0.9961388,0.0001594648,0.0028467157,0.00011925751,0.000561446,0.0000190935,0.00008998713,0.000008899382,0.00005631383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781805,0.00011086776,0.0008155734,0.0002613446,0.0007397059,0.00025446547],"domain_scores_gemma":[0.99722624,0.00018002193,0.0007391003,0.00024748011,0.0014344237,0.00017273142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004840782,0.00018613508,0.00025403,0.00011178641,0.0000865779,0.0002327232,0.0010301498,0.00011020877,0.000007273027],"category_scores_gemma":[0.00029554337,0.0001380465,0.00014747083,0.00021000569,0.000046800036,0.0009048347,0.000103964274,0.00008259246,0.000004988941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017721102,0.0013904265,0.09504172,0.00035301346,0.0022616894,0.00023882408,0.0012543682,0.4807043,0.008610515,0.23029496,0.12885141,0.049226668],"study_design_scores_gemma":[0.007200787,0.00036592165,0.01578855,0.00094560545,0.000060397062,0.00012895625,0.00019414058,0.8895036,0.00029582184,0.0031912504,0.08169724,0.00062771986],"about_ca_topic_score_codex":0.000024620655,"about_ca_topic_score_gemma":0.000008172313,"teacher_disagreement_score":0.9329863,"about_ca_system_score_codex":0.00029570205,"about_ca_system_score_gemma":0.00014690681,"threshold_uncertainty_score":0.56293726},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017907375520779676,"score_gpt":0.2817691170762407,"score_spread":0.263861741555461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618778734","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046759966,0.00062713766,0.995332,0.0003233914,0.0028086577,0.00028434623,0.000104043735,0.00001987533,0.000032967804],"genre_scores_gemma":[0.40429798,0.000878898,0.59390706,0.000018370121,0.00051715545,0.00006225428,0.00005492766,0.000020821359,0.00024254655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986634,0.000024402574,0.0005417045,0.00023349917,0.00035498888,0.00018197765],"domain_scores_gemma":[0.9980573,0.0000792233,0.00066128455,0.0002055737,0.0008454065,0.0001511864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004599606,0.00015577675,0.0002551857,0.00010567616,0.00018247713,0.0004903685,0.0007817436,0.000055162625,0.000002810708],"category_scores_gemma":[0.0002566874,0.00013618296,0.000063406755,0.000052772644,0.00004567592,0.00090681633,0.00021068465,0.0001079397,5.333061e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007094307,0.0001769204,0.0071585923,0.00010174314,0.0012474926,0.000079192534,0.00037945347,0.8804186,0.0006225705,0.056185666,0.0011009765,0.052457854],"study_design_scores_gemma":[0.00067458744,0.00007192018,0.0019486565,0.000111029796,0.000018733708,0.00016982031,0.000048512396,0.99068284,0.00007877759,0.0007026149,0.0053230906,0.0001694198],"about_ca_topic_score_codex":0.000035009725,"about_ca_topic_score_gemma":0.0000015655996,"teacher_disagreement_score":0.40383038,"about_ca_system_score_codex":0.00006798409,"about_ca_system_score_gemma":0.00004001444,"threshold_uncertainty_score":0.555338},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Plaintext; Encryption; Ciphertext; Computer science; Communication source; Theoretical computer science; Graph; Algorithm; Computer network","score_opus":0.01845802772943096,"score_gpt":0.26887997929577445,"score_spread":0.2504219515663435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900722080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035289716,0.000618229,0.9564083,0.0035850524,0.0037518712,0.000086639404,0.000106257976,0.00002058522,0.00013334169],"genre_scores_gemma":[0.99275583,0.00012021467,0.0061599207,0.00011385099,0.00080310117,0.000003919822,0.000020350684,0.0000036581928,0.000019144978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860704,0.00005706327,0.0003981682,0.0001840734,0.0005798658,0.0001737842],"domain_scores_gemma":[0.99840426,0.0000326102,0.00027864223,0.0001906027,0.00085344946,0.00024041231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035270856,0.00012023398,0.00018256222,0.00025832362,0.00007615036,0.0004632876,0.0010017542,0.00004519975,0.000013493808],"category_scores_gemma":[0.00009116565,0.00009743904,0.00011831349,0.00029703003,0.00004826179,0.0006170362,0.00018763705,0.00009422704,0.000009909672],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035556985,0.00038969048,0.015146563,0.000031238742,0.00090124214,0.00028176804,0.0019956084,0.00048486676,0.0029826195,0.7649761,0.20587608,0.0065786354],"study_design_scores_gemma":[0.0027091054,0.0011755484,0.016082456,0.00026014136,0.00004974907,0.0010708326,0.0010861637,0.010746912,0.00046159103,0.02032793,0.94532406,0.0007054778],"about_ca_topic_score_codex":0.00003646239,"about_ca_topic_score_gemma":0.000015268237,"teacher_disagreement_score":0.9574661,"about_ca_system_score_codex":0.00002599087,"about_ca_system_score_gemma":0.00003904801,"threshold_uncertainty_score":0.4467493},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.043383462682646465,"score_gpt":0.28215263299824206,"score_spread":0.23876917031559558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911434043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04768721,0.0007946907,0.94327366,0.0020629084,0.005617621,0.00010318542,0.00003328525,0.000038462258,0.0003890008],"genre_scores_gemma":[0.9939237,0.00005105925,0.005413344,0.00003731677,0.00046956382,0.000002276215,0.000017950912,0.0000044881413,0.000080286365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798226,0.00015261312,0.000640458,0.00020192668,0.0008465739,0.00017615786],"domain_scores_gemma":[0.99764854,0.00007039875,0.0004401138,0.00020627385,0.0013192113,0.00031546975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087942195,0.0001409571,0.00026079427,0.00013969243,0.000041821746,0.00020519618,0.0010857135,0.000056923524,0.000011939872],"category_scores_gemma":[0.00017953634,0.00011803294,0.00011430847,0.00016712712,0.000042084645,0.0005820188,0.0002885448,0.00013369828,0.0000117385025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012652082,0.0026527615,0.13478786,0.0001310114,0.0029598312,0.0033422185,0.008581507,0.2599443,0.0009477521,0.35714135,0.20742063,0.020825583],"study_design_scores_gemma":[0.008904203,0.00094865315,0.02299505,0.00017290776,0.00007180226,0.0024741092,0.0031090917,0.76729757,0.00009206092,0.016813137,0.1761384,0.000983012],"about_ca_topic_score_codex":0.00010473772,"about_ca_topic_score_gemma":0.0000072352295,"teacher_disagreement_score":0.9462365,"about_ca_system_score_codex":0.00018892321,"about_ca_system_score_gemma":0.00015767213,"threshold_uncertainty_score":0.48132437},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Queen's University","funders":"","keywords":"History; Computer science","score_opus":0.020364489941600252,"score_gpt":0.27002593709555933,"score_spread":0.24966144715395908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914014471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42864063,0.0006624067,0.5638987,0.0030909206,0.0032322353,0.00023717112,0.000035572666,0.000014245557,0.00018811536],"genre_scores_gemma":[0.99746066,0.00005028734,0.0020265605,0.00012393383,0.00027304326,0.0000049299933,0.000028926042,0.0000042620386,0.000027371063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975674,0.0002279935,0.0008182554,0.00020545135,0.000990737,0.00019012508],"domain_scores_gemma":[0.99845886,0.00023289934,0.0004544996,0.00019557538,0.0005653186,0.00009282164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090559624,0.00014613173,0.00026071316,0.00019421137,0.00004560402,0.0002939952,0.0014490952,0.000045460092,0.000025036286],"category_scores_gemma":[0.000074105665,0.000099911354,0.00012889474,0.00028634048,0.000031419953,0.00043321488,0.00016628283,0.00024497433,0.000020196836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009387325,0.00046506574,0.2583499,0.000030584564,0.00025222191,0.00026896206,0.0018278925,0.6865836,0.000024451712,0.043239724,0.006394536,0.0024692551],"study_design_scores_gemma":[0.0023121932,0.00024363291,0.29837364,0.00008218948,0.000012583831,0.001256497,0.0005958246,0.67668384,0.000001619823,0.0058503803,0.014326092,0.00026147172],"about_ca_topic_score_codex":0.0000633857,"about_ca_topic_score_gemma":0.000024813071,"teacher_disagreement_score":0.56882006,"about_ca_system_score_codex":0.00010258363,"about_ca_system_score_gemma":0.00011525769,"threshold_uncertainty_score":0.40742666},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Interconnection; Computer science; Computer network","score_opus":0.008821345230260635,"score_gpt":0.23970324922236355,"score_spread":0.23088190399210293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967594056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2883629,0.0046301996,0.6876867,0.0030376043,0.01548206,0.00035882342,0.00002970796,0.000025705094,0.0003863201],"genre_scores_gemma":[0.99650407,0.00046840942,0.0001668268,0.00001776624,0.0027318166,0.0000059516638,0.000012815141,0.0000054075686,0.00008694781],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818635,0.00016250239,0.0008684678,0.00021052637,0.0004235033,0.00014864258],"domain_scores_gemma":[0.9982136,0.000121768026,0.0006769538,0.0001810229,0.0006920298,0.00011461617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006432921,0.00014314022,0.00034116118,0.00012677441,0.000036065547,0.0001371924,0.0004418445,0.000091308364,0.000040008923],"category_scores_gemma":[0.00001646601,0.000112168105,0.0001302307,0.00012645614,0.000032308257,0.00047569085,0.00014232821,0.00016062996,0.0000036293402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012514746,0.0011509995,0.3765814,0.0005533405,0.0033131067,0.00014326429,0.0034157266,0.3126274,0.00085134065,0.13072136,0.13606393,0.033326656],"study_design_scores_gemma":[0.0029829047,0.00083197467,0.035335068,0.0005096305,0.00004686943,0.001035223,0.002264918,0.6476279,0.000050794264,0.00080096425,0.30806142,0.00045231517],"about_ca_topic_score_codex":0.00008597015,"about_ca_topic_score_gemma":0.000005294541,"teacher_disagreement_score":0.70814115,"about_ca_system_score_codex":0.000056183857,"about_ca_system_score_gemma":0.000022867374,"threshold_uncertainty_score":0.45740825},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Imperial Experimental Cancer Medicine Centre; National Natural Science Foundation of China; Canadian Celiac Association","keywords":"Computer science","score_opus":0.011610995780733357,"score_gpt":0.26480905962849743,"score_spread":0.25319806384776405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237833787","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98098886,0.000990453,0.015480457,0.00016861502,0.0018285763,0.00006513291,0.000020091662,0.0000041949424,0.00045363978],"genre_scores_gemma":[0.99878454,0.00015550577,0.00014021457,0.00005482919,0.0005975425,2.7758824e-7,0.000111857946,0.000004698787,0.00015051101],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991592,0.00004586881,0.0003669,0.000120811674,0.00019586881,0.0001113094],"domain_scores_gemma":[0.9993325,0.000013336893,0.0002615018,0.0000642439,0.0002597226,0.00006873682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024785346,0.00008814591,0.00014838457,0.000033778942,0.00002630005,0.000043000553,0.00022912133,0.00006679378,0.000028007142],"category_scores_gemma":[0.00004698895,0.00006540508,0.000092167036,0.000031296157,0.000018650655,0.0000052985242,0.00009795239,0.000071360715,0.000008241833],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009850826,0.00029669664,0.23600344,0.000080841135,0.0013485978,0.00009643673,0.00009923874,0.054049898,0.6877079,0.0033538947,0.011887209,0.0040907525],"study_design_scores_gemma":[0.011725756,0.0032834248,0.08456522,0.0006547002,0.00014646337,0.0029212963,0.0024575263,0.04305187,0.016817845,0.00028853992,0.8324563,0.0016310464],"about_ca_topic_score_codex":0.000008235685,"about_ca_topic_score_gemma":6.0975486e-7,"teacher_disagreement_score":0.8205691,"about_ca_system_score_codex":0.000010810067,"about_ca_system_score_gemma":0.00001857847,"threshold_uncertainty_score":0.2667142},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.029971066380653003,"score_gpt":0.2892045683903734,"score_spread":0.2592335020097204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403412891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01657658,0.0076142647,0.9687709,0.0008810177,0.0059268028,0.000122007295,0.000020488247,0.000057202386,0.00003070479],"genre_scores_gemma":[0.9912307,0.00062321866,0.007650422,0.000028571509,0.00039989824,0.00000614571,0.000009171669,0.000010219957,0.00004165181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979238,0.00012500772,0.0008114312,0.0002898093,0.00060384924,0.00024611806],"domain_scores_gemma":[0.9990275,0.00018878587,0.00022670515,0.00014468249,0.0002733485,0.00013896983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079086877,0.00018300652,0.00026954172,0.00035728604,0.000046232257,0.00038874501,0.0009400193,0.000063953856,0.0000070702536],"category_scores_gemma":[0.000074888936,0.00014714237,0.000120469216,0.00037060492,0.000034145,0.0003970055,0.00014221366,0.00031358402,0.00001054443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038787202,0.00008127261,0.00018720681,0.000043351632,0.00018192267,0.0010490587,0.0008573989,0.90079236,0.00027315487,0.03848021,0.0012237291,0.05679157],"study_design_scores_gemma":[0.00026739173,0.00013497117,0.00031641693,0.00041063715,0.0000069875355,0.00063284975,0.00013373813,0.9849717,0.00006845267,0.0062877187,0.006596636,0.0001724783],"about_ca_topic_score_codex":0.000042483196,"about_ca_topic_score_gemma":0.0000018523261,"teacher_disagreement_score":0.97465414,"about_ca_system_score_codex":0.00012873349,"about_ca_system_score_gemma":0.00016082315,"threshold_uncertainty_score":0.60002923},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018959819001611374,"score_gpt":0.26924856286004084,"score_spread":0.2502887438584295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403465826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049087495,0.0039836843,0.94463706,0.0006863724,0.0012629009,0.000074965945,0.00006267039,0.00006685586,0.00013799615],"genre_scores_gemma":[0.9931611,0.0003174292,0.0062722685,0.000009210995,0.00014820078,0.0000045896763,0.00002832631,0.0000061518426,0.00005272903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858487,0.000031295243,0.0006454707,0.00014719879,0.00047837346,0.000112783215],"domain_scores_gemma":[0.99916035,0.000040184634,0.00025054082,0.00014173928,0.0003123347,0.00009485311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033519583,0.00010020585,0.00018253949,0.00016120732,0.00003572101,0.00016892224,0.0005880097,0.00004722576,0.000007010032],"category_scores_gemma":[0.0000120162495,0.00008395895,0.00012721366,0.00015655892,0.000017375642,0.00031810527,0.000098314114,0.000101874255,0.0000065876943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021007309,0.00029692208,0.0006593674,0.00026786045,0.00086850696,0.00015433726,0.0012661854,0.22409192,0.039680928,0.7181846,0.012454471,0.0020539204],"study_design_scores_gemma":[0.00020216838,0.000022943297,0.000057833007,0.00011405079,0.000023494626,0.00010100666,0.000048675578,0.98727953,0.0006954165,0.0014922533,0.009879399,0.0000832107],"about_ca_topic_score_codex":0.000019107225,"about_ca_topic_score_gemma":6.218502e-7,"teacher_disagreement_score":0.9440736,"about_ca_system_score_codex":0.00005087802,"about_ca_system_score_gemma":0.00011878349,"threshold_uncertainty_score":0.34237465},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012866027443544337,"score_gpt":0.2589817957774178,"score_spread":0.24611576833387347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410600849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17804621,0.00077945413,0.81839734,0.00035047947,0.002253794,0.00012873235,0.0000023466037,0.0000053320264,0.000036305602],"genre_scores_gemma":[0.9954429,0.000045664343,0.0042277267,0.000020785144,0.00019544686,0.0000024435258,0.000024946663,0.0000034261209,0.00003660853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873024,0.00006510144,0.00068477704,0.00015774675,0.00024170202,0.00012041426],"domain_scores_gemma":[0.99918854,0.00011111803,0.00042700124,0.000073087554,0.0001561864,0.000044052813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005603735,0.000097178054,0.00019890156,0.00022974287,0.00003811945,0.00008056458,0.00035501752,0.000048218055,4.7759636e-7],"category_scores_gemma":[0.000069413596,0.000090317124,0.0000522276,0.00012432491,0.000029126451,0.00011925232,0.00016569594,0.00007476677,1.994993e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015658958,0.00022233569,0.019163284,0.00012345018,0.00020740864,0.000008658884,0.0011379356,0.9573045,0.0007085048,0.009322812,0.004090856,0.007553664],"study_design_scores_gemma":[0.0010463633,0.00005317264,0.0061569307,0.00029616122,0.000010549273,0.000014672074,0.00012834014,0.9875919,0.00016995438,0.000086209424,0.0043689846,0.00007673131],"about_ca_topic_score_codex":0.000026832855,"about_ca_topic_score_gemma":5.5978e-7,"teacher_disagreement_score":0.81739676,"about_ca_system_score_codex":0.0000790878,"about_ca_system_score_gemma":0.000032533764,"threshold_uncertainty_score":0.36830252},"labels":[],"label_agreement":null}]}