{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15329567,0.003381712,0.8357225,0.0003376493,0.000075417316,0.0000517118,0.000032314438,0.00025472092,0.0068483814],"genre_scores_gemma":[0.9668909,0.0013927853,0.03104132,0.00004145122,0.000055268218,0.00003294119,0.000012074066,0.000016436097,0.0005168071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986865,0.0007047753,0.000049261598,0.00013884653,0.00029915207,0.00012140949],"domain_scores_gemma":[0.99511504,0.003510506,0.00052734726,0.0004174948,0.00038234825,0.000047254813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020812915,0.00079385017,0.00069264666,0.000584189,0.0003516025,0.0008109435,0.0009208513,0.0006580311,0.00049173756],"category_scores_gemma":[0.0069034854,0.00025290548,0.00031460318,0.0008361477,0.0010050108,0.0014189199,0.0008392467,0.0005750207,0.00015000967],"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.00033407894,0.00009384691,0.0014691275,0.00029772936,0.000105429426,0.00056402094,0.0003636866,0.7710235,0.06319359,0.073500015,0.00083348696,0.08822141],"study_design_scores_gemma":[0.000020093832,0.00022300945,0.0003801914,0.000023994371,0.00005317204,0.00036409323,0.000044885477,0.9621239,0.010248182,0.02511742,0.0013718266,0.000029176692],"about_ca_topic_score_codex":0.00038718697,"about_ca_topic_score_gemma":0.00034041135,"teacher_disagreement_score":0.0020812915,"about_ca_system_score_codex":0.00047718838,"about_ca_system_score_gemma":0.00025951973,"threshold_uncertainty_score":0.011007071},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06639583,0.0012919107,0.88407236,0.004466476,0.0008377219,0.00012808846,0.00016719004,0.004044882,0.03859561],"genre_scores_gemma":[0.6832338,0.0023499175,0.27521598,0.0013226862,0.0004914317,0.0002507193,0.0005581554,0.00077361066,0.03580365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994325,0.00013043622,0.00003445944,0.00006566574,0.000275164,0.00006177086],"domain_scores_gemma":[0.9991817,0.0001585701,0.000039540013,0.0003137892,0.00026639376,0.000039954393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089067855,0.00047314275,0.0003193695,0.0003482671,0.0005218914,0.00097235956,0.00067953847,0.0006992529,0.004755403],"category_scores_gemma":[0.0036550816,0.0003293809,0.00035309675,0.00038367565,0.00053684355,0.0027193967,0.0009828733,0.0010104467,0.0015162793],"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.00061999337,0.00023217914,0.008595365,0.00041822164,0.00016004423,0.0004428126,0.00065984734,0.10289241,0.078456715,0.104283296,0.03874353,0.6644956],"study_design_scores_gemma":[0.00013545743,0.0005707935,0.0045695696,0.00019021716,0.00012677541,0.0009415211,0.00030419495,0.46472645,0.09751932,0.04404595,0.38674,0.00012968355],"about_ca_topic_score_codex":0.0019177018,"about_ca_topic_score_gemma":0.0015964593,"teacher_disagreement_score":0.004755403,"about_ca_system_score_codex":0.0005632363,"about_ca_system_score_gemma":0.00034880656,"threshold_uncertainty_score":0.01590842},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010699027,0.045409255,0.0065517207,0.034777157,0.7523548,0.0001926048,0.0007769565,0.0006084439,0.1582592],"genre_scores_gemma":[0.007150073,0.0422868,0.0021494185,0.0072713094,0.52314603,0.0001602192,0.0017557278,0.00077536923,0.41530502],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986796,0.00019005866,0.000107406806,0.00023225372,0.00064591726,0.00014474159],"domain_scores_gemma":[0.9968215,0.00088853046,0.00017510666,0.0004769444,0.001073088,0.00056481635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014699482,0.0018552912,0.0022230567,0.0031144724,0.0019049194,0.0058065634,0.001982181,0.003462066,0.1399919],"category_scores_gemma":[0.0041226605,0.0006222815,0.0011321111,0.0036809582,0.0010267856,0.0054959767,0.0023133988,0.0030356364,0.04541036],"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.000035702196,0.000037847418,0.00010302025,0.0003065084,0.000013061257,0.00009046393,0.000015660868,0.00020122065,0.00022037447,0.0050363727,0.9646713,0.029268568],"study_design_scores_gemma":[0.00000798382,0.000026316337,0.0002748307,0.000091336435,0.000010853078,0.00014398388,0.000018157465,0.00035746518,0.00010131614,0.004557844,0.99440324,0.000006684423],"about_ca_topic_score_codex":0.0011269861,"about_ca_topic_score_gemma":0.0022287238,"teacher_disagreement_score":0.1399919,"about_ca_system_score_codex":0.0014476652,"about_ca_system_score_gemma":0.0016147355,"threshold_uncertainty_score":0.46831954},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024055682,0.3007623,0.14498678,0.04970184,0.005268664,0.000109959554,0.0003692891,0.00028141335,0.47446394],"genre_scores_gemma":[0.7087075,0.16055088,0.041399173,0.014454307,0.011322272,0.00024794939,0.00032777767,0.00013551579,0.06285466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992229,0.00026337564,0.00002750083,0.00010458071,0.00027692624,0.00010472343],"domain_scores_gemma":[0.9993148,0.0004155865,0.000042057367,0.00009425575,0.00008817692,0.00004516609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000903957,0.00035523114,0.0007016647,0.001149456,0.0014412435,0.002358176,0.0005594147,0.0017716417,0.0058013718],"category_scores_gemma":[0.0019495655,0.00019481964,0.0003619691,0.001200429,0.005410458,0.0039166166,0.0013540708,0.0023790356,0.00080172904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0000026625291,0.0000029701243,0.000031672716,0.000042983094,0.0000025569398,0.000022256334,0.0000695003,0.00039275156,0.00009006898,0.99110305,0.0030205275,0.0052191527],"study_design_scores_gemma":[0.0000019100207,0.0000073385804,0.00007926143,0.00003568071,0.0000012765439,0.00004382127,0.000029555928,0.00077136914,0.000057198373,0.9680875,0.030880343,0.000004591031],"about_ca_topic_score_codex":0.001784851,"about_ca_topic_score_gemma":0.0011639118,"teacher_disagreement_score":0.0058013718,"about_ca_system_score_codex":0.0016891862,"about_ca_system_score_gemma":0.0011737132,"threshold_uncertainty_score":0.01940757},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020613475,0.00013599504,0.97403777,0.00032746716,0.000051530147,0.00018051155,0.00010451133,0.0017852078,0.0027635433],"genre_scores_gemma":[0.14186057,0.0000923639,0.85508734,0.00013029086,0.000020098343,0.00018849748,0.0003235532,0.000119217664,0.0021781113],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995074,0.00008804249,0.000054821885,0.00012872931,0.00013367769,0.00008732701],"domain_scores_gemma":[0.9987386,0.000662085,0.00012564087,0.000201588,0.00020184461,0.00007039129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005743095,0.0007669101,0.0005519841,0.00080974086,0.00067755644,0.0007992153,0.0012336234,0.0010157673,0.004530128],"category_scores_gemma":[0.003030813,0.00030257707,0.0006591703,0.0006809835,0.0007488975,0.0014989967,0.0017020815,0.0010400708,0.0008290325],"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.0005278511,0.00014457977,0.002731394,0.00041043392,0.00008699736,0.0004183834,0.00041305617,0.22898357,0.024160191,0.036337327,0.010678171,0.69510806],"study_design_scores_gemma":[0.00013312256,0.00013563507,0.000484825,0.000029582607,0.000034140743,0.00044492545,0.00012717482,0.9440832,0.0121946195,0.037175156,0.005122194,0.000035307763],"about_ca_topic_score_codex":0.0047784843,"about_ca_topic_score_gemma":0.006498436,"teacher_disagreement_score":0.0047784843,"about_ca_system_score_codex":0.0012127825,"about_ca_system_score_gemma":0.0017491332,"threshold_uncertainty_score":0.015154779},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17310743,0.010781261,0.67214864,0.026339456,0.0006236812,0.00018093712,0.0004122882,0.00065553526,0.11575083],"genre_scores_gemma":[0.94166636,0.0025063832,0.05104896,0.00089856004,0.0006191594,0.00017592807,0.000121196674,0.00014510808,0.0028182538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99201655,0.0031407394,0.00039747046,0.0015405433,0.0019677847,0.00093684485],"domain_scores_gemma":[0.96188855,0.030115783,0.0014701186,0.004105607,0.0015894743,0.00083037914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064350865,0.00077885523,0.0016398912,0.0015139523,0.0032041157,0.006202538,0.0018983379,0.002299921,0.0028741537],"category_scores_gemma":[0.02968869,0.0007855993,0.0023161122,0.0014359615,0.020654367,0.0119564785,0.00733972,0.0056223394,0.00030007542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000012475901,0.0000072910075,0.00021755007,0.000054260072,0.000013711429,0.000058983853,0.00029669906,0.006911449,0.000116211406,0.9898666,0.000314131,0.0021305264],"study_design_scores_gemma":[0.0000047275903,0.000005479474,0.00007612065,0.000014074018,0.00000387875,0.000021421261,0.000045182653,0.008898007,0.00008758643,0.98981327,0.0010223899,0.000007913556],"about_ca_topic_score_codex":0.002822378,"about_ca_topic_score_gemma":0.0010779497,"teacher_disagreement_score":0.0064350865,"about_ca_system_score_codex":0.003325562,"about_ca_system_score_gemma":0.001797669,"threshold_uncertainty_score":0.034032345},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030530984,0.6261395,0.26374125,0.0044689314,0.0008788216,0.00044624257,0.00032156362,0.0010595688,0.0724132],"genre_scores_gemma":[0.19093746,0.5964559,0.18649574,0.0011043971,0.0015858277,0.0005581352,0.0010755865,0.00028185177,0.021505203],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998372,0.00032655438,0.00020131904,0.00023912813,0.0006987719,0.00016226097],"domain_scores_gemma":[0.99742293,0.0014356821,0.0002122697,0.0002903736,0.00053048023,0.00010836353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018501475,0.0009096178,0.0010087456,0.003313254,0.0010573192,0.00295656,0.001980284,0.0018232933,0.0070042703],"category_scores_gemma":[0.0038705345,0.0008215428,0.00059910916,0.007784572,0.0009882159,0.0062090545,0.0012826609,0.0016904764,0.002342496],"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.0001811151,0.00023934752,0.0026560712,0.004992474,0.000053080275,0.00023637908,0.0005975599,0.012001534,0.0030760276,0.2076114,0.01549889,0.7528562],"study_design_scores_gemma":[0.00008834477,0.0004288997,0.003219504,0.0021815791,0.00009884082,0.0023905297,0.0008080246,0.03190863,0.004534058,0.09634946,0.85788953,0.000102595055],"about_ca_topic_score_codex":0.00091626745,"about_ca_topic_score_gemma":0.00076096354,"teacher_disagreement_score":0.0070042703,"about_ca_system_score_codex":0.0016350121,"about_ca_system_score_gemma":0.0014362144,"threshold_uncertainty_score":0.0234316},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015676666,0.0025573533,0.9708986,0.0019924326,0.000107948355,0.00012125483,0.00007988494,0.00038171507,0.008184105],"genre_scores_gemma":[0.3305592,0.007156428,0.65326715,0.0007210256,0.0003837514,0.00065082294,0.00026311312,0.00036982857,0.0066286856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963476,0.0015595315,0.0002508558,0.0003735186,0.0012961224,0.00017232439],"domain_scores_gemma":[0.9850964,0.010365481,0.0006818947,0.0021146243,0.0015284112,0.00021314452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042695194,0.0010428643,0.0012153763,0.001653691,0.00073784153,0.0032318055,0.0026169056,0.0026244412,0.002427191],"category_scores_gemma":[0.030364126,0.0011046223,0.001022175,0.0014204633,0.0019846815,0.0087764375,0.0011812554,0.005433992,0.00081228383],"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.00008038169,0.00020505131,0.0023552594,0.00050686405,0.000078486264,0.00021496449,0.0010889326,0.318544,0.0058715087,0.61515933,0.002787566,0.05310773],"study_design_scores_gemma":[0.000027403634,0.000047295165,0.0004665369,0.00008733192,0.000013974201,0.0002100678,0.00010860697,0.81409776,0.0016434304,0.17306057,0.010209339,0.00002780223],"about_ca_topic_score_codex":0.0013170865,"about_ca_topic_score_gemma":0.000754557,"teacher_disagreement_score":0.0042695194,"about_ca_system_score_codex":0.0016300272,"about_ca_system_score_gemma":0.0011625045,"threshold_uncertainty_score":0.02257967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055140764,0.00029351804,0.93585443,0.000580763,0.00006636478,0.00016295382,0.00014545574,0.0037343814,0.0040213065],"genre_scores_gemma":[0.4055886,0.000203379,0.58761793,0.00022982823,0.00007342407,0.0002909861,0.00052880484,0.000396161,0.005070914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981248,0.00070938264,0.000091847076,0.00026330783,0.0005133872,0.00029723256],"domain_scores_gemma":[0.9975077,0.0011698598,0.0002236271,0.0005343901,0.00043073975,0.00013366061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014461592,0.00067276944,0.0010842682,0.00076178234,0.0010647598,0.0013993724,0.001718527,0.0007629625,0.0037679188],"category_scores_gemma":[0.0050238613,0.00048332175,0.0005115141,0.0012266623,0.001011048,0.0022318996,0.0012150719,0.000956058,0.0011877177],"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.0007132777,0.00028621696,0.0008594943,0.00019733363,0.00003880412,0.00010473556,0.000103929815,0.7085142,0.014264722,0.058272365,0.010818567,0.20582634],"study_design_scores_gemma":[0.00009794072,0.00007784447,0.00010429037,0.000004277035,0.000008010956,0.000015131767,0.00001805238,0.97316283,0.003195139,0.022420159,0.00088398275,0.000012352001],"about_ca_topic_score_codex":0.004627209,"about_ca_topic_score_gemma":0.009644185,"teacher_disagreement_score":0.004627209,"about_ca_system_score_codex":0.0016460575,"about_ca_system_score_gemma":0.002883815,"threshold_uncertainty_score":0.012604892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002707634,0.00048985356,0.9886812,0.0005377778,0.0002822532,0.00010853919,0.00002793574,0.00046885374,0.006695958],"genre_scores_gemma":[0.30909628,0.0018231462,0.6741051,0.0011859022,0.00086207053,0.0012676668,0.00012954626,0.00019061744,0.011339611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792874,0.0004740992,0.00013766253,0.00036674665,0.000936808,0.00015597898],"domain_scores_gemma":[0.9980957,0.0007062262,0.00019552553,0.00047258128,0.00032687176,0.00020322735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023132414,0.0006755534,0.0005223179,0.0007041898,0.0012314158,0.002680421,0.0026860752,0.0012136931,0.0016618969],"category_scores_gemma":[0.0030985742,0.00040316934,0.00069017074,0.00055093603,0.003189965,0.0030642732,0.0019594447,0.0033774553,0.00056840276],"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.00004306553,0.000047558857,0.000121698664,0.000104759034,0.00001876781,0.00014820042,0.00034293113,0.007122979,0.009890923,0.95055026,0.0023659787,0.029242838],"study_design_scores_gemma":[0.00019934398,0.0004247578,0.00027659492,0.00014130144,0.00008611191,0.0007510882,0.00017319684,0.23046975,0.020963337,0.5649297,0.18144722,0.00013756432],"about_ca_topic_score_codex":0.0011852669,"about_ca_topic_score_gemma":0.00138368,"teacher_disagreement_score":0.0026860752,"about_ca_system_score_codex":0.0010859579,"about_ca_system_score_gemma":0.0016537927,"threshold_uncertainty_score":0.012233734},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46219462,0.0006480639,0.5134444,0.0005765839,0.00015239236,0.00017222826,0.0008077024,0.0010426391,0.020961327],"genre_scores_gemma":[0.9693897,0.00045382688,0.023891166,0.00005888033,0.000020719996,0.0001388536,0.00032560702,0.00006188498,0.005659373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997744,0.000061384126,0.000012518845,0.000031385483,0.000071898765,0.000048417623],"domain_scores_gemma":[0.999456,0.0002776163,0.000067262125,0.000030830575,0.0001365823,0.000031729745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028301508,0.0005713941,0.00058184034,0.0005226648,0.0005090689,0.00065398787,0.00085034367,0.0011362378,0.001635993],"category_scores_gemma":[0.0010012276,0.0003084404,0.0006360503,0.0006249341,0.00045641468,0.0007464151,0.00047502606,0.00056646444,0.0002281888],"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.000011173733,0.000010884967,0.00041549242,0.000009299349,0.0000036863757,0.000027101221,0.000012325864,0.9974602,0.00046473497,0.0006560176,0.00007951883,0.0008496213],"study_design_scores_gemma":[0.0000020117106,0.000005372287,0.00006360694,9.650619e-7,0.0000014944817,0.0000036625997,0.0000044377775,0.9995963,0.00012808094,0.00012600915,0.000066350374,0.0000017910329],"about_ca_topic_score_codex":0.023110969,"about_ca_topic_score_gemma":0.009397578,"teacher_disagreement_score":0.023110969,"about_ca_system_score_codex":0.0005737304,"about_ca_system_score_gemma":0.001135185,"threshold_uncertainty_score":0.045952857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0559781,0.0005065495,0.9392789,0.00038183833,0.00010425999,0.000089327936,0.00012283963,0.001656304,0.0018818558],"genre_scores_gemma":[0.9165506,0.00028948626,0.08087101,0.00013969994,0.000070907365,0.000083048115,0.00017424597,0.00007660958,0.0017444908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832934,0.00045777223,0.00010699523,0.00028720679,0.0006002704,0.00021838394],"domain_scores_gemma":[0.9966446,0.0007832172,0.0005053781,0.0016827945,0.00029715174,0.00008686183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013784578,0.000663543,0.0007561666,0.0007061912,0.0007777124,0.00086748204,0.0012897165,0.0011256905,0.0010345367],"category_scores_gemma":[0.004372154,0.0003088641,0.0007475409,0.0006223159,0.0011651748,0.002761303,0.0028794885,0.0009508572,0.00046172668],"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.0017305454,0.0002476537,0.006243837,0.00087986485,0.00035074804,0.0019827995,0.001395421,0.21208344,0.24349351,0.04812667,0.009693921,0.4737715],"study_design_scores_gemma":[0.00011006986,0.00072697736,0.0026750814,0.000062050254,0.00016363693,0.0025715963,0.00030881204,0.7710991,0.18470503,0.022911433,0.014554642,0.00011159708],"about_ca_topic_score_codex":0.00034869733,"about_ca_topic_score_gemma":0.00029216395,"teacher_disagreement_score":0.0013784578,"about_ca_system_score_codex":0.00056939834,"about_ca_system_score_gemma":0.00066366285,"threshold_uncertainty_score":0.0072900653},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012779669,0.00023496388,0.9836897,0.00014874205,0.00005032231,0.00005820713,0.000026662181,0.00011878694,0.00289306],"genre_scores_gemma":[0.47958025,0.00051448686,0.5144185,0.0002654793,0.000104556646,0.00051658246,0.00029463362,0.00008009139,0.0042254357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943775,0.00022683674,0.000029652498,0.00006923549,0.00017603584,0.00006042006],"domain_scores_gemma":[0.99875486,0.00075425016,0.00012690811,0.00006844762,0.00023202792,0.00006347671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001865886,0.00090688147,0.0009844524,0.0010706792,0.0005744923,0.0011236966,0.001537431,0.0011035112,0.0017922345],"category_scores_gemma":[0.003368999,0.00033014925,0.00081728265,0.0009896717,0.0006813422,0.0008702024,0.0012216961,0.0012614526,0.00035966703],"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.00007592478,0.00006257552,0.0010668349,0.00008063351,0.0000706917,0.00007306323,0.00005646503,0.9047473,0.0010130045,0.025093662,0.0014368932,0.06622303],"study_design_scores_gemma":[0.0000063024286,0.000024765604,0.00005787144,0.0000042131906,0.0000042352426,0.000010634258,0.000005286617,0.99693346,0.00015350844,0.0023693563,0.0004278827,0.0000024782105],"about_ca_topic_score_codex":0.003342656,"about_ca_topic_score_gemma":0.002454181,"teacher_disagreement_score":0.003342656,"about_ca_system_score_codex":0.00066142133,"about_ca_system_score_gemma":0.0012767555,"threshold_uncertainty_score":0.009867847},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008565285,0.00035487616,0.97632205,0.0008672422,0.00029462157,0.00039587522,0.000421689,0.0017927823,0.01098558],"genre_scores_gemma":[0.10341935,0.0008063925,0.87681603,0.00032442145,0.00008209185,0.00033426192,0.001205127,0.0005537098,0.016458528],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993926,0.00009183797,0.000051626408,0.00016285572,0.00021976414,0.000081237624],"domain_scores_gemma":[0.9990735,0.00027694163,0.000054570908,0.00039063557,0.00016693443,0.00003732602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004168174,0.00069886446,0.00064561353,0.00066755305,0.000812283,0.0017846505,0.00063715753,0.0009467716,0.009567503],"category_scores_gemma":[0.002454306,0.00043724582,0.0009020633,0.00066145655,0.00091033016,0.0034054886,0.0010007385,0.0014555715,0.0045604603],"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.00028957232,0.00018784375,0.0007410273,0.0007055598,0.00009234365,0.00056971825,0.00049536984,0.02998258,0.043369602,0.36839414,0.03506941,0.52010286],"study_design_scores_gemma":[0.00016970925,0.00033344305,0.0007662519,0.00023128843,0.0001011918,0.0035099357,0.00038119088,0.21868122,0.06751384,0.48078743,0.22739638,0.00012807344],"about_ca_topic_score_codex":0.00076191005,"about_ca_topic_score_gemma":0.0010344682,"teacher_disagreement_score":0.009567503,"about_ca_system_score_codex":0.00068132044,"about_ca_system_score_gemma":0.0010423756,"threshold_uncertainty_score":0.032006502},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042415,0.008196457,0.31813267,0.018741632,0.0015341459,0.00015827896,0.0005994907,0.0010257626,0.60919654],"genre_scores_gemma":[0.91269034,0.0018785965,0.030026946,0.0021869882,0.0005229887,0.0003234293,0.00057131116,0.00047609626,0.051323283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697447,0.00077578676,0.00017639824,0.001128007,0.0005275855,0.0004177499],"domain_scores_gemma":[0.9958204,0.001600951,0.00022751006,0.0014923428,0.0006577897,0.00020088821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023884918,0.00059861,0.0006985974,0.001106068,0.0028130396,0.0044995476,0.0018765775,0.0018368197,0.013830493],"category_scores_gemma":[0.0077309166,0.00037781816,0.0010923679,0.0008234449,0.013697329,0.010955288,0.0053025363,0.004342984,0.0022911036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0000074442382,0.0000031034185,0.00008800083,0.000020185058,0.0000025832437,0.000028218345,0.0002659816,0.00015570526,0.00009690427,0.9961831,0.0009883089,0.0021603375],"study_design_scores_gemma":[0.0000069067482,0.0000078955345,0.00015724784,0.00003610976,0.00000669342,0.00011187929,0.00010299365,0.0015621284,0.00054196623,0.9494821,0.04797441,0.000009662066],"about_ca_topic_score_codex":0.0016626164,"about_ca_topic_score_gemma":0.0009534677,"teacher_disagreement_score":0.013830493,"about_ca_system_score_codex":0.0032726077,"about_ca_system_score_gemma":0.0015682143,"threshold_uncertainty_score":0.04626757},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011549065,0.017940816,0.01019725,0.3828588,0.005377469,0.000022403907,0.00021831549,0.0002571306,0.5715788],"genre_scores_gemma":[0.58281976,0.023659661,0.013830513,0.05816632,0.0023750155,0.00012623107,0.00027821082,0.0010639809,0.3176803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99754107,0.0007426153,0.00004687291,0.0004150188,0.00061490334,0.0006395318],"domain_scores_gemma":[0.99695045,0.000991722,0.00009392502,0.00040237833,0.00068832585,0.00087320403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003183788,0.00045525993,0.0006393066,0.001054024,0.020093359,0.010972693,0.001566586,0.0027806328,0.021589795],"category_scores_gemma":[0.0056636776,0.0004164262,0.00042552644,0.0016265584,0.028924692,0.019296505,0.006596596,0.00755963,0.0043438976],"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.000025539155,0.000010285074,0.00018340835,0.000046091598,0.000004803936,0.00008205283,0.009430935,0.00019078364,0.00007717065,0.9200444,0.060037334,0.009867181],"study_design_scores_gemma":[0.0000088799525,0.0000072003118,0.0002295256,0.00014927698,0.0000031344466,0.000070177615,0.009852907,0.0002204814,0.00007645634,0.27377146,0.71559507,0.000015481095],"about_ca_topic_score_codex":0.1776645,"about_ca_topic_score_gemma":0.26713502,"teacher_disagreement_score":0.1776645,"about_ca_system_score_codex":0.018916259,"about_ca_system_score_gemma":0.025173655,"threshold_uncertainty_score":0.35326082},"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":"commentary","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001514866,0.10443344,0.013020479,0.8005889,0.07084033,0.000012931325,0.000105073945,0.00006452339,0.0094194645],"genre_scores_gemma":[0.12895691,0.2209799,0.0086650215,0.28672716,0.33753753,0.00008968678,0.00013688074,0.0001922408,0.016714692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972306,0.00092385564,0.00022858441,0.0005504811,0.0008946126,0.0001718522],"domain_scores_gemma":[0.97861356,0.01720923,0.00076492457,0.0004132031,0.002708967,0.00029006667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004698994,0.0005360485,0.0007399268,0.0011159994,0.0017431165,0.0031537754,0.002296373,0.008385706,0.002114054],"category_scores_gemma":[0.018071463,0.00029945897,0.0008281541,0.001205336,0.009088739,0.007994153,0.0011727477,0.013536294,0.00049420854],"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.00008067122,0.000015534893,0.0003580438,0.0011268492,0.0000462224,0.00048650597,0.0012051404,0.0027799525,0.0010460126,0.62999135,0.30094066,0.06192314],"study_design_scores_gemma":[0.000018873823,0.0000494197,0.0005397354,0.0010100388,0.00002309091,0.0005739572,0.00056719955,0.0030246226,0.00052221183,0.47968915,0.5139224,0.00005940286],"about_ca_topic_score_codex":0.005527996,"about_ca_topic_score_gemma":0.0057828915,"teacher_disagreement_score":0.008385706,"about_ca_system_score_codex":0.004341782,"about_ca_system_score_gemma":0.0030870242,"threshold_uncertainty_score":0.03150195},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020918831,0.0062649846,0.37053874,0.011709273,0.004410263,0.00022603976,0.0018964434,0.006203728,0.5778316],"genre_scores_gemma":[0.48873106,0.008087474,0.16465457,0.0029178602,0.0013433766,0.00042830623,0.0038001616,0.0014875802,0.32854974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964595,0.00006737481,0.000018035136,0.00008217453,0.00013108217,0.00005541985],"domain_scores_gemma":[0.99941134,0.00009652836,0.000019577477,0.0002593764,0.00014101055,0.00007214522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035329678,0.00046795164,0.0004722486,0.0005522783,0.001122298,0.0028224692,0.0011405553,0.0013013602,0.04466229],"category_scores_gemma":[0.0018838557,0.00025485767,0.00044133494,0.0008649152,0.00076049735,0.0031716407,0.0018943434,0.0012802943,0.019726716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00011021489,0.00004296848,0.00023164676,0.00017523323,0.000025200192,0.0000973764,0.00011016801,0.0029111954,0.0058231154,0.8009951,0.063011974,0.12646575],"study_design_scores_gemma":[0.000037573533,0.000028819455,0.00023008372,0.00008620409,0.0000233987,0.000218382,0.00008691575,0.03193208,0.008657607,0.59027207,0.36839932,0.000027443597],"about_ca_topic_score_codex":0.0009654854,"about_ca_topic_score_gemma":0.0007805742,"teacher_disagreement_score":0.04466229,"about_ca_system_score_codex":0.00090994773,"about_ca_system_score_gemma":0.0008610577,"threshold_uncertainty_score":0.14941025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015675543,0.0008511062,0.97642195,0.000362647,0.000056858116,0.00004034548,0.000012402876,0.00008940569,0.0064897425],"genre_scores_gemma":[0.5358996,0.0014166554,0.45784128,0.000159314,0.00007112804,0.00019009797,0.000047881796,0.000045872894,0.004328246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968684,0.00013856328,0.000012508751,0.000031723666,0.00010959021,0.000020706808],"domain_scores_gemma":[0.9995994,0.00024795046,0.000032381595,0.00003684088,0.00006841763,0.000015000316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083805766,0.00044273853,0.0005477246,0.000534781,0.0003536073,0.000754199,0.0005830556,0.0006147672,0.0011120569],"category_scores_gemma":[0.0015447696,0.00026702037,0.0004056078,0.000507941,0.0008984781,0.0007965868,0.0006299768,0.0007907448,0.00018683064],"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.000027488457,0.000027572001,0.00032444828,0.00007700819,0.000029316221,0.00003581036,0.00006917251,0.8535746,0.0022096522,0.089977585,0.00060343713,0.053043913],"study_design_scores_gemma":[0.0000068553472,0.000025056814,0.0000379465,0.000005783968,0.00000296075,0.000008163565,0.000007561615,0.9786556,0.00040749068,0.019715225,0.0011242125,0.0000031595387],"about_ca_topic_score_codex":0.001258742,"about_ca_topic_score_gemma":0.0010933877,"teacher_disagreement_score":0.001258742,"about_ca_system_score_codex":0.0005760152,"about_ca_system_score_gemma":0.00059283595,"threshold_uncertainty_score":0.004432142},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28355533,0.0015412276,0.6627575,0.0014623065,0.00032279632,0.00017428158,0.00058409956,0.0009185619,0.048683904],"genre_scores_gemma":[0.96147513,0.00048920617,0.026826775,0.000098819015,0.000033640466,0.00017116,0.00016798079,0.000034885,0.01070238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997656,0.000046560854,0.000015107045,0.000068198104,0.000059259735,0.000045330187],"domain_scores_gemma":[0.99965763,0.00009600528,0.00005354936,0.000058545196,0.000094263545,0.00004006067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001441225,0.00039949387,0.00061196496,0.00041325207,0.0007200093,0.0011038512,0.0012405467,0.001105633,0.003230589],"category_scores_gemma":[0.00078236486,0.00021140507,0.00072013255,0.00044562752,0.0008931077,0.000917459,0.00061675993,0.00057348266,0.00049566186],"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.00008147772,0.000073412695,0.0014610381,0.00011801943,0.00005446876,0.0005628682,0.00026843773,0.7261862,0.013478382,0.24806857,0.0015567539,0.0080903405],"study_design_scores_gemma":[0.000024280127,0.000035427416,0.00017823665,0.000007664493,0.000014831745,0.000085571424,0.000030376887,0.95912546,0.0008796297,0.037122644,0.0024837032,0.00001215571],"about_ca_topic_score_codex":0.0053308653,"about_ca_topic_score_gemma":0.0022058443,"teacher_disagreement_score":0.0053308653,"about_ca_system_score_codex":0.00084197137,"about_ca_system_score_gemma":0.00080014457,"threshold_uncertainty_score":0.010807455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25734618,0.0010461693,0.73135227,0.00073647307,0.00012893007,0.00023563665,0.00022941173,0.00048761483,0.008437362],"genre_scores_gemma":[0.96648973,0.00021521524,0.031345464,0.00006466366,0.000017135602,0.000074434094,0.000061674255,0.00004146755,0.0016902373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989058,0.0003789739,0.000036223533,0.0001877578,0.00016811799,0.00032315287],"domain_scores_gemma":[0.9984414,0.00096609164,0.00015526076,0.000107834785,0.0001711018,0.0001583055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023362015,0.0009373535,0.0011578122,0.00063561,0.0008032756,0.0016013035,0.0013361896,0.0008759187,0.0010457878],"category_scores_gemma":[0.0035142577,0.00038698924,0.00045664335,0.0008416048,0.00097412505,0.0015741722,0.0008628005,0.000683434,0.000119138494],"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.0000693778,0.00002789428,0.00031680384,0.000019392803,0.000011007121,0.000029034412,0.000021882346,0.989394,0.00063222996,0.004093997,0.00039099948,0.004993244],"study_design_scores_gemma":[0.0000047566004,0.000014985227,0.000076252,0.0000014191035,0.0000031280613,0.0000058107607,0.00001512719,0.99719775,0.00013902933,0.002397856,0.0001413784,0.0000025253948],"about_ca_topic_score_codex":0.01739351,"about_ca_topic_score_gemma":0.011710574,"teacher_disagreement_score":0.01739351,"about_ca_system_score_codex":0.002613596,"about_ca_system_score_gemma":0.0024343138,"threshold_uncertainty_score":0.034584522},"labels":[],"label_agreement":null}]}