{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":19,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":19,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"7121e124400f","filters":{"venue":"International Journal of Communication Networks and Distributed Systems"}},"results":[{"id":"W2107796859","doi":"10.1504/ijcnds.2009.026558","title":"Cognitive networking of large scale wireless systems","year":2009,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Wireless WAN; Cognitive radio; Wireless network; Municipal wireless network; Wi-Fi array; Wireless mesh network; Wireless broadband; Wireless; Key distribution in wireless sensor networks; Radio resource management; Cognitive network; Quality of service; Multi-frequency network; Distributed computing; Telecommunications","authors":[{"name":"Liang Song","is_ca":true},{"name":"Dimitrios Hatzinakos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01706767653259575,"gpt":0.2775984651340733,"spread":0.2605307886014775,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000513104,0.0003781666,0.0003579963,0.0003843914,0.000520391,0.00122975,0.0007442019,0.0005386388,0.001127725],"category_scores_gemma":[0.001796738,0.0001669165,0.0002040188,0.0004656092,0.001093291,0.001573776,0.00104917,0.0007705479,0.0001587096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005008861,"about_ca_system_score_gemma":0.0003654762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001130695,"about_ca_topic_score_gemma":0.0009213506,"domain_scores_codex":[0.9997227,0.0000741348,0.000007608385,0.00003643943,0.0001124046,0.00004671096],"domain_scores_gemma":[0.9993367,0.0004060337,0.00006461777,0.00006601382,0.0000778293,0.00004893595],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007668469,0.00005969249,0.0008619973,0.0002684978,0.00007903311,0.0006159903,0.0003380175,0.2447616,0.00925294,0.6463489,0.00532873,0.09200783],"study_design_scores_gemma":[0.00003035017,0.00006472369,0.0004534435,0.00003271461,0.00002725573,0.000276586,0.0001036497,0.6264555,0.001369185,0.3526934,0.01846388,0.00002928849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03317521,0.005440081,0.9365032,0.001188088,0.0005391647,0.00006186213,0.00003305221,0.0003113281,0.02274789],"genre_scores_gemma":[0.9205982,0.004645718,0.06814769,0.000352571,0.0005860571,0.0001431865,0.00003358003,0.00003010749,0.005462924],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00122975,"threshold_uncertainty_score":0.003772616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996894843","doi":"10.1504/ijcnds.2008.021077","title":"Strategies for fast scanning, ranging and handovers in WiMAX/802.16","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Ranging; WiMAX; Handover; Computer network; Base station; Offset (computer science); Real-time computing; Mobile station; Telecommunications; Wireless; Operating system","authors":[{"name":"Paul Boone","is_ca":true},{"name":"Michel Barbeau","is_ca":true},{"name":"Evangelos Kranakis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01067226170701502,"gpt":0.2365594080644354,"spread":0.2258871463574204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008547042,0.0006896017,0.0005421974,0.00048766,0.0004761424,0.0005420966,0.001148118,0.0007057989,0.001097565],"category_scores_gemma":[0.002351428,0.0003715804,0.0002732523,0.000291061,0.0008863718,0.0009808415,0.0007469769,0.0004013385,0.0001535971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005144932,"about_ca_system_score_gemma":0.0007865112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002829,"about_ca_topic_score_gemma":0.002701208,"domain_scores_codex":[0.9995963,0.0001702978,0.00001583064,0.00004835649,0.00009250062,0.00007671833],"domain_scores_gemma":[0.9991164,0.0005239597,0.0001653121,0.00007261152,0.00007947649,0.00004231722],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002350265,0.0001732096,0.00124098,0.00007604623,0.00003016196,0.0002597086,0.000274529,0.8809505,0.01851766,0.03228353,0.0009525344,0.06500608],"study_design_scores_gemma":[0.00006539004,0.0002476251,0.0005195285,0.00001062744,0.00002552299,0.0001307688,0.0001062958,0.9833975,0.004112869,0.01037305,0.0009830293,0.00002784189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2487226,0.000854206,0.7437147,0.0004367866,0.00003447964,0.000178622,0.000034418,0.0003747409,0.005649388],"genre_scores_gemma":[0.9420155,0.0001595189,0.05641948,0.00004996044,0.00000982182,0.0001169139,0.00001675305,0.00001561606,0.001196561],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002829,"threshold_uncertainty_score":0.005625069,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035607164","doi":"10.1504/ijcnds.2008.020258","title":"Low jitter guaranteed-rate communications for cluster computing systems","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Jitter; Cluster (spacecraft); Computer network; Telecommunications; Real-time computing","authors":[{"name":"Ted H. Szymanski","is_ca":true},{"name":"Dave Gilbert","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0254555375885376,"gpt":0.2718507686505287,"spread":0.246395231061991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009058405,0.0006420886,0.0004831976,0.0005695253,0.001037321,0.001978636,0.0010903,0.0008640725,0.004574485],"category_scores_gemma":[0.004615308,0.0002548414,0.0002220593,0.001091141,0.0006124761,0.001150931,0.0009399609,0.001335206,0.001670272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001383795,"about_ca_system_score_gemma":0.001525741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00176336,"about_ca_topic_score_gemma":0.002240876,"domain_scores_codex":[0.9991844,0.0002445161,0.00003718066,0.00007187609,0.0003933925,0.00006854762],"domain_scores_gemma":[0.9987552,0.0005286997,0.0000935224,0.000267685,0.0002899504,0.00006489918],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003139108,0.00005831643,0.0005980526,0.0004949353,0.00003459038,0.0002590177,0.0002474624,0.1848087,0.01410611,0.4939407,0.03734341,0.2677949],"study_design_scores_gemma":[0.00004775916,0.00008884216,0.0002488178,0.0000823134,0.00002271991,0.0001757753,0.00004321303,0.8084229,0.006877156,0.1093274,0.07462369,0.00003951881],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008854683,0.005449924,0.9658974,0.001161911,0.0006546891,0.0001301156,0.00009978819,0.002631638,0.01511983],"genre_scores_gemma":[0.52187,0.006834925,0.4454181,0.0005215256,0.001103021,0.0005084152,0.0004986332,0.000734935,0.02251036],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004574485,"threshold_uncertainty_score":0.01530313,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013094895","doi":"10.1504/ijcnds.2012.046357","title":"A continuous-time Markov chain model and analysis for cognitive radio networks","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Cognitive radio; Computer science; Markov chain; Throughput; Markov model; Continuous-time Markov chain; Markov process; State space; Mathematical optimization; Telecommunications; Wireless; Markov property; Machine learning; Statistics; Mathematics","authors":[{"name":"Amir Sepasi Zahmati","is_ca":true},{"name":"Xavier Fernando","is_ca":true},{"name":"Ali Grami","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01384268296598802,"gpt":0.2564504263507543,"spread":0.2426077433847662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001078183,0.000978922,0.0008592959,0.0009275528,0.0005376104,0.001301583,0.001222964,0.001145861,0.003056087],"category_scores_gemma":[0.003910471,0.000476959,0.001020665,0.001328852,0.0008515011,0.001549397,0.0005853137,0.00182119,0.00069223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001720284,"about_ca_system_score_gemma":0.00209721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01575428,"about_ca_topic_score_gemma":0.008102597,"domain_scores_codex":[0.9993328,0.0001936483,0.00003333564,0.0001291161,0.0002094616,0.0001015953],"domain_scores_gemma":[0.998031,0.001386252,0.0001832558,0.00008793683,0.0002646376,0.00004699559],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002853657,0.00003951323,0.0006620387,0.00009093848,0.00003246838,0.0001806032,0.00008341229,0.8674054,0.001267926,0.1186564,0.00108818,0.01046462],"study_design_scores_gemma":[0.000003418657,0.000009957967,0.0001019099,0.000009235269,0.000007335804,0.00002894496,0.000007537521,0.982196,0.0001415539,0.01687266,0.0006134434,0.000008009582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004989666,0.0006273038,0.9907634,0.0002050176,0.00005406222,0.00003613285,0.0001590138,0.0001336006,0.003031906],"genre_scores_gemma":[0.7932377,0.005010474,0.1879439,0.0002525235,0.000305812,0.0006422222,0.0009723895,0.0001096742,0.01152546],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01575428,"threshold_uncertainty_score":0.03132516,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985838299","doi":"10.1504/ijcnds.2012.044320","title":"A seamless handover scheme for vehicles across heterogeneous networks","year":2011,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Handover; Network packet; Soft handover; Heterogeneous network; Packet loss; Mobility management; Overhead (engineering); Mobile IP; Wireless network; Wireless; Telecommunications","authors":[{"name":"Arun Prakash","is_ca":false},{"name":"Rajesh Verma","is_ca":false},{"name":"Rajeev Tripathi","is_ca":false},{"name":"Kshirasagar Naik","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02303948927825476,"gpt":0.2585587720696979,"spread":0.2355192827914431,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005613827,0.0003044292,0.000338998,0.0006070611,0.0007458033,0.000616479,0.0009519277,0.0007122712,0.0005749355],"category_scores_gemma":[0.0009242957,0.0001499556,0.0003085501,0.0003903891,0.0003738122,0.001023765,0.001373758,0.0006378687,0.0003272559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004837824,"about_ca_system_score_gemma":0.0003347145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001429438,"about_ca_topic_score_gemma":0.001540264,"domain_scores_codex":[0.9996015,0.0000726824,0.0000345837,0.00004653999,0.0001565026,0.00008827089],"domain_scores_gemma":[0.9996324,0.00005000361,0.00005467611,0.0001017067,0.00009504704,0.00006606497],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007470217,0.0002162708,0.002917552,0.0003383856,0.0002458792,0.001276983,0.0009315225,0.05915798,0.2483418,0.0436984,0.006485946,0.6356423],"study_design_scores_gemma":[0.0002709101,0.00258137,0.007621912,0.00007186944,0.0003655952,0.003261403,0.0007149022,0.7393039,0.1228583,0.02686399,0.09578403,0.0003018778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1283385,0.001408924,0.8626674,0.0002927852,0.0002748811,0.0003467255,0.0001217733,0.001536439,0.005012709],"genre_scores_gemma":[0.8663014,0.000472655,0.1286811,0.0001024096,0.0000846578,0.0001047363,0.0002406404,0.00003879718,0.003973631],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001429438,"threshold_uncertainty_score":0.003510118,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120152839","doi":"10.1504/ijcnds.2009.026876","title":"An algorithm based mesh check-sum fault tolerant scheme for stream ciphers","year":2009,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Checksum; Algorithm; RC4; Stream cipher; Scheme (mathematics); Overhead (engineering); Error detection and correction; Parallel computing; Cryptography; Mathematics","authors":[{"name":"C. N. Zhang","is_ca":true},{"name":"Xiao Wei Liu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01678018694094014,"gpt":0.3088972280854392,"spread":0.2921170411444991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004175376,0.000409735,0.0005016353,0.0009005539,0.0006433673,0.0007149098,0.0008396975,0.0005116491,0.002308884],"category_scores_gemma":[0.001423443,0.0001318016,0.0003511446,0.0007122314,0.0005197003,0.001407908,0.0009739209,0.0005163156,0.0004926609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007421595,"about_ca_system_score_gemma":0.0007602473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000582158,"about_ca_topic_score_gemma":0.0006877256,"domain_scores_codex":[0.9994739,0.0001097273,0.00006060952,0.00006496893,0.0002258871,0.00006494402],"domain_scores_gemma":[0.999263,0.0001743172,0.0001200383,0.0002061601,0.000193543,0.00004291157],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002136831,0.0001716248,0.001560826,0.0004160219,0.0001156014,0.0005814714,0.0004681089,0.1062827,0.1951338,0.1903845,0.008031807,0.4947166],"study_design_scores_gemma":[0.000262059,0.0008568128,0.0007402609,0.00006360107,0.00009546758,0.000917198,0.00007446547,0.7801059,0.1460647,0.04557415,0.02514985,0.00009549472],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08308923,0.0005652465,0.9087486,0.0002714901,0.0002393708,0.000192817,0.0001460327,0.0011942,0.005553034],"genre_scores_gemma":[0.6972011,0.0003365003,0.2950163,0.000171538,0.0000921005,0.0001885143,0.0002392444,0.00005338655,0.006701445],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002308884,"threshold_uncertainty_score":0.007723987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2505795549","doi":"10.1504/ijcnds.2016.077939","title":"Comparative performance analysis of TCP-based congestion control algorithms","year":2016,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Canadian Centre for Applied Research in Cancer Control","keywords":"Computer science; TCP Friendly Rate Control; TCP global synchronization; TCP Westwood plus; TCP tuning; TCP acceleration; CUBIC TCP; H-TCP; Zeta-TCP; Computer network; Algorithm; Network congestion; Goodput; Throughput; Network packet; Wireless; Telecommunications","authors":[{"name":"Sanjeev Patel","is_ca":false},{"name":"Kritika Rani","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01476010764119402,"gpt":0.2589028134979425,"spread":0.2441427058567485,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007468617,0.001200098,0.001484157,0.004933271,0.001106925,0.001867931,0.001768599,0.001434728,0.001229106],"category_scores_gemma":[0.02298086,0.0002821225,0.0006614106,0.003717434,0.0008173723,0.002410748,0.000923054,0.0008860902,0.0002168926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00255084,"about_ca_system_score_gemma":0.001473678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003010552,"about_ca_topic_score_gemma":0.00134632,"domain_scores_codex":[0.9928043,0.002332676,0.000618248,0.0006464274,0.002824154,0.0007741555],"domain_scores_gemma":[0.9772495,0.01364667,0.001137484,0.001450568,0.006034141,0.0004816671],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002184864,0.0006194807,0.01155987,0.0008398184,0.0005390931,0.0001891226,0.0002529483,0.8044727,0.007635754,0.01626477,0.005501926,0.1499397],"study_design_scores_gemma":[0.00006098875,0.0005802934,0.004327278,0.00003638195,0.0001081224,0.0001436666,0.00009675519,0.9861537,0.004666637,0.002494129,0.001285819,0.00004626568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7765298,0.02191665,0.1682191,0.001054698,0.001237271,0.0004659831,0.001232933,0.003315436,0.02602809],"genre_scores_gemma":[0.983549,0.001381059,0.01363853,0.00004236077,0.0001030988,0.0001016608,0.0004994239,0.00008162184,0.0006033701],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007468617,"threshold_uncertainty_score":0.03949827,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027354365","doi":"10.1504/ijcnds.2012.046363","title":"On the throughput performance of cluster-based cognitive radio networks","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cognitive radio; Throughput; Fusion center; Cluster analysis; Base station; Channel (broadcasting); Cluster (spacecraft); Computer network; Bandwidth (computing); Node (physics); Real-time computing; Wireless; Telecommunications; Artificial intelligence","authors":[{"name":"Sattar Hussain","is_ca":true},{"name":"Xavier Fernando","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01728026360198923,"gpt":0.2546513063078612,"spread":0.237371042705872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002590155,0.0007010504,0.0006809917,0.0008776263,0.0006490119,0.001127034,0.0007624007,0.0008300593,0.0008795731],"category_scores_gemma":[0.01416995,0.0003027008,0.0002381887,0.00107161,0.0009826542,0.001278282,0.0008289677,0.0005619764,0.0002745295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001407887,"about_ca_system_score_gemma":0.0006128025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002583755,"about_ca_topic_score_gemma":0.001217907,"domain_scores_codex":[0.9986387,0.0005095218,0.00003388241,0.0001569423,0.0004168445,0.0002440218],"domain_scores_gemma":[0.9873133,0.01033178,0.0006324254,0.0005492474,0.001054703,0.0001186045],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006150391,0.00006083706,0.002064838,0.0001349167,0.00007254738,0.0001795082,0.0001993399,0.94354,0.009491705,0.01710021,0.0009272507,0.02561392],"study_design_scores_gemma":[0.00001316859,0.0001486933,0.00123829,0.0000227545,0.00004097853,0.0001152353,0.00006599457,0.9820176,0.005935302,0.009965027,0.0004173297,0.00001945697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6475914,0.006330959,0.3239684,0.001173817,0.0001921304,0.00006499294,0.0002762193,0.0009844336,0.01941759],"genre_scores_gemma":[0.9955871,0.0006534014,0.003119357,0.00003631372,0.0000325584,0.00001638742,0.00003754463,0.00003268608,0.0004846544],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002590155,"threshold_uncertainty_score":0.01369816,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095529275","doi":"10.1504/ijcnds.2008.017201","title":"Profiling distributed connection chains","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Hacker; Network forensics; Profiling (computer programming); Key (lock); Connection (principal bundle); Computer security; Distributed computing; Computer network; Digital forensics; Operating system","authors":[{"name":"Ahmad Almulhem","is_ca":true},{"name":"Issa Traoré","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02038747323713776,"gpt":0.2513896032557611,"spread":0.2310021300186234,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001040753,0.0006733467,0.0006895468,0.003088596,0.0007972057,0.001721206,0.0007698921,0.0009285818,0.001840564],"category_scores_gemma":[0.009028552,0.0003407848,0.0003324147,0.002465408,0.0004636079,0.003315823,0.001551504,0.0009827014,0.0009140443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005084305,"about_ca_system_score_gemma":0.0005870264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001136631,"about_ca_topic_score_gemma":0.001386144,"domain_scores_codex":[0.9982119,0.0004529876,0.0001065967,0.0004536067,0.0006028392,0.0001721324],"domain_scores_gemma":[0.9936865,0.001985326,0.001066784,0.001951446,0.0009815565,0.0003283457],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0007743846,0.0004764326,0.1292162,0.0003382617,0.0001871889,0.001271498,0.001611491,0.3047605,0.04447765,0.03165802,0.007082332,0.4781461],"study_design_scores_gemma":[0.00002004017,0.0001376141,0.01140108,0.0000509371,0.00003493002,0.001091036,0.0003357325,0.9405302,0.01561009,0.02360207,0.007133346,0.00005289689],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4096673,0.0004521112,0.5783625,0.0003706937,0.00008777306,0.0002902186,0.0008189292,0.003360404,0.006590009],"genre_scores_gemma":[0.923036,0.0002364038,0.07403258,0.00003548223,0.00003154856,0.00008914083,0.0007544919,0.0001043704,0.001679931],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003088596,"threshold_uncertainty_score":0.006157279,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2405271895","doi":"10.1504/ijcnds.2016.076655","title":"Multi-objective resource allocation in interference-limited M2M communication networks","year":2016,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Throughput; Resource allocation; Interference (communication); Controller (irrigation); Convergence (economics); Computer network; Distributed computing; Cluster (spacecraft); Mathematical optimization; Wireless; Channel (broadcasting); Telecommunications","authors":[{"name":"Fatima Hussain","is_ca":true},{"name":"Alagan Anpalagan","is_ca":true},{"name":"Muhammad Naeem","is_ca":true},{"name":"Ahmed Shaharyar Khwaja","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01839262266529082,"gpt":0.2611754266784094,"spread":0.2427828040131186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001373299,0.001029555,0.001332995,0.0006128933,0.0004839632,0.0009293951,0.001363949,0.001313436,0.001332699],"category_scores_gemma":[0.002160409,0.0004955539,0.000553534,0.0007916579,0.0007745646,0.0008961816,0.001030404,0.0007089042,0.0002118031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008173851,"about_ca_system_score_gemma":0.0008043844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002547612,"about_ca_topic_score_gemma":0.001920536,"domain_scores_codex":[0.9992207,0.0004125456,0.00002324311,0.00009431782,0.0001667107,0.0000824274],"domain_scores_gemma":[0.9990985,0.0006301991,0.0001207743,0.00003214343,0.00008214974,0.00003614742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002336744,0.00002083275,0.0001092526,0.00004635742,0.00002321376,0.0000384583,0.00001478969,0.9900474,0.0004230252,0.002311382,0.0002287664,0.006713186],"study_design_scores_gemma":[0.000006539223,0.00002062419,0.00005161679,0.000003598623,0.000003497381,0.00001028863,0.000005820888,0.9979066,0.0001179133,0.001664371,0.0002066425,0.00000262355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0190552,0.0006279163,0.9768454,0.0002034715,0.00003817786,0.00005329138,0.00003629522,0.00009565581,0.003044493],"genre_scores_gemma":[0.7761191,0.0005139729,0.2182942,0.0002108547,0.00009149522,0.0002728988,0.00009380576,0.00008109235,0.004322668],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002547612,"threshold_uncertainty_score":0.007262826,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160476942","doi":"10.1504/ijcnds.2008.020261","title":"Adaptive collaborative filtering based on user-genre-item relation","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Collaborative filtering; MovieLens; Computer science; Similarity (geometry); Relevance (law); Relation (database); Information retrieval; Recommender system; Preference; Component (thermodynamics); Artificial intelligence; Data mining","authors":[{"name":"Jin Yang","is_ca":false},{"name":"Kin Fun Li","is_ca":true},{"name":"Da Fang Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02351463302081112,"gpt":0.2588317593858651,"spread":0.235317126365054,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003980598,0.001173523,0.002688717,0.004010211,0.001080335,0.001614903,0.002490662,0.00171278,0.001570671],"category_scores_gemma":[0.0155004,0.0006183756,0.00155326,0.00386141,0.0006727374,0.002560484,0.0009373641,0.001359341,0.001023679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001115209,"about_ca_system_score_gemma":0.0007753308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01119807,"about_ca_topic_score_gemma":0.01257744,"domain_scores_codex":[0.9959538,0.001157218,0.0002960494,0.00111506,0.001278897,0.0001989417],"domain_scores_gemma":[0.989599,0.006415411,0.0006275225,0.001452334,0.001649371,0.0002564607],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009772326,0.0008384802,0.02764589,0.0004929652,0.001028225,0.0006111363,0.0008360344,0.1659081,0.02121812,0.01293954,0.0102938,0.7572106],"study_design_scores_gemma":[0.00004906158,0.0001523454,0.005216959,0.00002290868,0.0001996092,0.0004266636,0.0000478871,0.9821133,0.002919338,0.006267985,0.002516754,0.00006717989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06563527,0.002208329,0.9254972,0.0003727047,0.000253212,0.0002174044,0.000329045,0.001383302,0.004103548],"genre_scores_gemma":[0.7409982,0.001398885,0.2509177,0.0002660219,0.0006165725,0.0002054605,0.000752829,0.00009121205,0.004753182],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01119807,"threshold_uncertainty_score":0.02226579,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055505453","doi":"10.1504/ijcnds.2008.020257","title":"A low complexity selective mapping OFDM using multiple IFFT stages","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Fast Fourier transform; Orthogonal frequency-division multiplexing; Computational complexity theory; Computer science; Reduction (mathematics); Decimation; Algorithm; Multiplicative function; Multiplexing; Mathematics; Telecommunications","authors":[{"name":"A. Ghassemi","is_ca":true},{"name":"T. Aaron Gulliver","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04595886525795274,"gpt":0.2657392712951209,"spread":0.2197804060371681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001648806,0.0004571328,0.0003617371,0.0003520143,0.0002859124,0.0003670632,0.0005502675,0.0004618363,0.001995911],"category_scores_gemma":[0.0004398899,0.0001961004,0.0003335235,0.0004230334,0.0001938204,0.0005818687,0.0002956861,0.000452678,0.000802384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002009511,"about_ca_system_score_gemma":0.0003894976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002866367,"about_ca_topic_score_gemma":0.0006307088,"domain_scores_codex":[0.9997848,0.00003470959,0.00001316515,0.00003654792,0.0001107939,0.00002003016],"domain_scores_gemma":[0.9998378,0.00004953323,0.00002752909,0.00003373102,0.00004068447,0.00001076306],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000204011,0.0001141931,0.0009084744,0.0002221717,0.00004014832,0.0003986643,0.00008451672,0.007789038,0.5198302,0.009980061,0.001726335,0.4587022],"study_design_scores_gemma":[0.000198501,0.001978249,0.003653796,0.00006420919,0.0001451494,0.006110548,0.00005359796,0.4186119,0.5139147,0.003753955,0.05142225,0.00009312796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02619043,0.0003911686,0.9689938,0.0001280944,0.0001028516,0.00008569291,0.00003546932,0.0005811373,0.003491354],"genre_scores_gemma":[0.2085714,0.00041023,0.7860959,0.000121447,0.0001355474,0.00008664653,0.00009007553,0.00002978003,0.004458935],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001995911,"threshold_uncertainty_score":0.006677032,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045527035","doi":"10.1504/ijcnds.2008.020710","title":"Periodically scheduled burst flows in optical burst switching networks","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Optical burst switching; Burst switching; Computer network; Telecommunications; Wavelength-division multiplexing; Optical performance monitoring; Optoelectronics; Transmission delay; Network packet; Physics","authors":[{"name":"Lei Li","is_ca":true},{"name":"Srinivas Sampalli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01166253628625714,"gpt":0.2360835886624638,"spread":0.2244210523762067,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007448821,0.0003018121,0.0002507566,0.0003570871,0.0004415772,0.0005543433,0.0003811177,0.0004782868,0.0005753268],"category_scores_gemma":[0.001497733,0.0002153156,0.0001557086,0.0003737119,0.0004016108,0.0006938996,0.0003052695,0.0005958357,0.0001081434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003539857,"about_ca_system_score_gemma":0.0005061272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001005699,"about_ca_topic_score_gemma":0.00106705,"domain_scores_codex":[0.999707,0.0001124279,0.00001482775,0.00002791042,0.0001123002,0.00002558562],"domain_scores_gemma":[0.9995508,0.0002401775,0.00007101623,0.00005140307,0.00006345464,0.00002306615],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004741538,0.0001398472,0.003232904,0.0002769674,0.00003908368,0.0007679098,0.0004450541,0.2391625,0.05172132,0.4580738,0.0054524,0.240214],"study_design_scores_gemma":[0.00006268953,0.0001465528,0.0006017945,0.00003444649,0.00002865634,0.0003301335,0.00005579041,0.8780716,0.006202891,0.1037418,0.01069533,0.00002830093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1664356,0.004191744,0.8212001,0.0007651797,0.0006707212,0.0001472955,0.00009118037,0.000635185,0.005863109],"genre_scores_gemma":[0.8212994,0.00263134,0.1708814,0.0002370573,0.00054501,0.0001302357,0.0001236071,0.00005887433,0.004092982],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001005699,"threshold_uncertainty_score":0.003939331,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094502762","doi":"10.1504/ijcnds.2008.020259","title":"Non-linear test pattern generators for built-in self-test","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"University of Victoria","keywords":"Computer science; Generator (circuit theory); Fault coverage; Benchmark (surveying); Overhead (engineering); Fault (geology); Digital pattern generator; Fault detection and isolation; Automatic test pattern generation; Finite-state machine; Stuck-at fault; Fault Simulator; Computer engineering; Embedded system; Electronic circuit; Algorithm; Power (physics); Engineering; Electrical engineering; Artificial intelligence","authors":[{"name":"Dandan Qi","is_ca":true},{"name":"J.C. Muzio","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02322678318931088,"gpt":0.2665727486870957,"spread":0.2433459654977849,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005841578,0.0004847484,0.0002738073,0.0005558154,0.0001868871,0.0003348498,0.0009467523,0.0004755759,0.003168424],"category_scores_gemma":[0.003017496,0.0001552521,0.0002462892,0.0004095044,0.0005125524,0.0008367151,0.0003880809,0.0006311875,0.0006293757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002934179,"about_ca_system_score_gemma":0.0002759237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001315497,"about_ca_topic_score_gemma":0.0002413163,"domain_scores_codex":[0.99924,0.0002936142,0.00005445252,0.0001024538,0.0002588669,0.00005062713],"domain_scores_gemma":[0.9980102,0.0009643414,0.0002729726,0.0003891726,0.0003157006,0.00004767275],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006136987,0.0002203241,0.002425492,0.0007114734,0.00005835358,0.0007132411,0.0001620522,0.06706816,0.1679818,0.1088281,0.006188442,0.6450289],"study_design_scores_gemma":[0.0002337978,0.001706504,0.002477452,0.00009950449,0.00006489192,0.002425767,0.00003968375,0.5789315,0.3210604,0.0586319,0.0342537,0.00007494078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02700379,0.0003221237,0.9681008,0.0001528685,0.00006630145,0.0001390559,0.00006382019,0.001976341,0.0021749],"genre_scores_gemma":[0.6120369,0.0001970204,0.383297,0.0002597836,0.00006865844,0.0003351279,0.000271139,0.0001970087,0.003337443],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003168424,"threshold_uncertainty_score":0.01059949,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2294971926","doi":"10.1504/ijcnds.2015.072398","title":"On social networking in intermittently connected networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Overhead (engineering); Routing (electronic design automation); Delay-tolerant networking; Task (project management); Routing protocol; Wireless Routing Protocol","authors":[{"name":"Ahmed B. Altamimi","is_ca":true},{"name":"T. Aaron Gulliver","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04511118189151455,"gpt":0.2877352204639491,"spread":0.2426240385724346,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002636847,0.001506299,0.00171166,0.003622326,0.001869039,0.003118069,0.001740876,0.002510653,0.003134152],"category_scores_gemma":[0.01096478,0.0006127032,0.001055985,0.00440214,0.00390225,0.005836908,0.002782433,0.002908211,0.0004840781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002507024,"about_ca_system_score_gemma":0.0008189158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002137626,"about_ca_topic_score_gemma":0.001698348,"domain_scores_codex":[0.9971356,0.001585254,0.0001133073,0.0003984605,0.0005649421,0.0002023798],"domain_scores_gemma":[0.9860275,0.01191115,0.0008264349,0.0004256208,0.0004873029,0.0003219524],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006233586,0.00007738781,0.001629042,0.0006114403,0.000124075,0.0005642761,0.0005143101,0.09739622,0.000925549,0.8574821,0.006729738,0.03388349],"study_design_scores_gemma":[0.00003211186,0.0001103887,0.00101353,0.0002502873,0.00005521207,0.000493369,0.0002004857,0.2615339,0.0003070558,0.7075079,0.02842878,0.0000669662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04192923,0.06199171,0.8223409,0.01131214,0.002045374,0.0004259247,0.0005002335,0.0003159609,0.05913858],"genre_scores_gemma":[0.7603332,0.08952418,0.1222441,0.002435345,0.00697218,0.001494477,0.0007074014,0.0001638857,0.01612517],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003622326,"threshold_uncertainty_score":0.01818985,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4396552233","doi":"10.1504/ijcnds.2024.138217","title":"An objective comparison of two prominent virtual actor frameworks: Proto.Actor and Orleans","year":2024,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Digital Games and Media","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Sheridan College","funders":"","keywords":"Computer science; Human–computer interaction; Virtual actor; Data science; Cognitive science; Virtual reality","authors":[{"name":"Edward R. Sykes","is_ca":true},{"name":"Alec DiVito","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02082992408500793,"gpt":0.3681888592405022,"spread":0.3473589351554942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006754106,0.0009020984,0.0005864922,0.001247977,0.0009412612,0.002025041,0.001743202,0.0007294057,0.002848807],"category_scores_gemma":[0.01460012,0.0004575619,0.0006452663,0.0009843174,0.00101336,0.003799169,0.001975841,0.001345733,0.0007319141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001544831,"about_ca_system_score_gemma":0.002081168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007754066,"about_ca_topic_score_gemma":0.009468364,"domain_scores_codex":[0.99607,0.001500415,0.0002462474,0.000476116,0.001223959,0.0004832122],"domain_scores_gemma":[0.9913195,0.004574536,0.0006042579,0.001168252,0.001613186,0.0007202897],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.01566829,0.003103811,0.03378362,0.005252823,0.0005969515,0.0003590712,0.004752063,0.1072121,0.02386058,0.1462189,0.04606397,0.613128],"study_design_scores_gemma":[0.002330416,0.008373745,0.04991969,0.001185981,0.000745306,0.0009748653,0.003785142,0.5986924,0.03383684,0.05374071,0.2459363,0.0004786531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7259874,0.008310422,0.1471338,0.001594939,0.0009695176,0.001278406,0.001622654,0.01728722,0.09581561],"genre_scores_gemma":[0.8568553,0.001876492,0.1275226,0.0003216725,0.00007505358,0.0004953782,0.002140336,0.002087146,0.008625928],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007754066,"threshold_uncertainty_score":0.03571951,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006014260","doi":"10.1504/ijcnds.2009.027595","title":"A mesh check-sum ABFT scheme for stream ciphers","year":2009,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Checksum; RC4; Stream cipher; Scheme (mathematics); Overhead (engineering); Error detection and correction; Algorithm; Parallel computing; Cryptography; Mathematics","authors":[{"name":"Chang N. Zhang","is_ca":true},{"name":"Xiao Wei Liu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01864526222089668,"gpt":0.3038732293090233,"spread":0.2852279670881266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003622501,0.0003988386,0.0004315406,0.0007253799,0.0005297551,0.000595953,0.0006352097,0.0004362321,0.002982109],"category_scores_gemma":[0.001394168,0.00014053,0.0003379751,0.0006497161,0.0004893155,0.001322337,0.0009399233,0.0005007739,0.0006469872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005758988,"about_ca_system_score_gemma":0.0005875276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004446834,"about_ca_topic_score_gemma":0.0005233794,"domain_scores_codex":[0.9995736,0.00008889509,0.0000425398,0.00005017732,0.0001868919,0.00005794335],"domain_scores_gemma":[0.999358,0.0001752082,0.00009098528,0.0001837576,0.0001508886,0.00004112852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001867388,0.0001262654,0.001100721,0.0004427985,0.00006554583,0.0006766186,0.0003521433,0.0489345,0.2952581,0.1940363,0.005671894,0.4514676],"study_design_scores_gemma":[0.0002719481,0.001261742,0.0009699899,0.0001083653,0.0001003562,0.001602104,0.0001023436,0.5751275,0.3098155,0.06699885,0.04351523,0.0001261029],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1083981,0.0008854211,0.8794739,0.0002682912,0.0002758453,0.000179977,0.0001787091,0.0008996128,0.009440052],"genre_scores_gemma":[0.7228512,0.0005280136,0.2672102,0.0001557962,0.0001137307,0.0001525451,0.0001912117,0.00005207513,0.008745368],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002982109,"threshold_uncertainty_score":0.009976149,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120897117","doi":"10.1504/ijcnds.2009.022330","title":"Performance analysis of the cdma2000 reverse packet data channel","year":2009,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; CDMA2000; Network packet; Channel (broadcasting); Code division multiple access","authors":[{"name":"Ayda Basyouni","is_ca":true},{"name":"Anjali Agarwal","is_ca":true},{"name":"A.K. Elhakeem","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01958183757935343,"gpt":0.2652981014556622,"spread":0.2457162638763088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001534046,0.000707189,0.0004947348,0.0008415005,0.0005296206,0.001001181,0.0005479609,0.0006908295,0.002107425],"category_scores_gemma":[0.00544194,0.0002438424,0.0002794146,0.0008030771,0.001009877,0.0007235524,0.0006950142,0.0007131076,0.0003637594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001736214,"about_ca_system_score_gemma":0.001179896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00746455,"about_ca_topic_score_gemma":0.003606828,"domain_scores_codex":[0.9984933,0.0003701798,0.00003162918,0.0001392722,0.0006678568,0.0002976325],"domain_scores_gemma":[0.9939884,0.003897311,0.0004590473,0.0002630289,0.001281214,0.0001109488],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001077073,0.0001341508,0.005142211,0.0001672233,0.00007748443,0.0003927529,0.0001846148,0.9094774,0.03928361,0.02014725,0.001065762,0.02285053],"study_design_scores_gemma":[0.000008688841,0.0001320266,0.001294871,0.00000820947,0.00001509234,0.000106187,0.00003133236,0.9903349,0.006960019,0.000853282,0.0002338851,0.00002148832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8206865,0.002757974,0.1535658,0.0005792945,0.00009153697,0.00006031507,0.0003436241,0.0004640944,0.02145073],"genre_scores_gemma":[0.9946754,0.0004019106,0.003271991,0.00003827631,0.0000209962,0.00001292918,0.00008740129,0.00002151752,0.001469667],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00746455,"threshold_uncertainty_score":0.01484221,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123965327","doi":"10.1504/ijcnds.2010.035558","title":"Bluehoc-based simulation study of user data throughput in Bluetooth-enabled devices","year":2010,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Bluetooth and Wireless Communication Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Bluetooth; Timeout; Computer science; Piconet; Transfer (computing); Throughput; Computer network; ISM band; Key (lock); Real-time computing; Wireless; Telecommunications; Operating system","authors":[{"name":"Syed Rahat","is_ca":true},{"name":"Alagan Anpalagan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03389787088143866,"gpt":0.3135846625864153,"spread":0.2796867917049767,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004202093,0.0003876409,0.0005286623,0.0004308878,0.0003790118,0.0003876123,0.0006890085,0.0005817345,0.001702252],"category_scores_gemma":[0.001675941,0.0001760179,0.0003673965,0.0006157015,0.0003924222,0.0005404565,0.0003463451,0.0004329182,0.0001567981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005370337,"about_ca_system_score_gemma":0.0004597106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007442178,"about_ca_topic_score_gemma":0.00385102,"domain_scores_codex":[0.9997452,0.00009466767,0.000009908647,0.0000275812,0.00005357606,0.00006908402],"domain_scores_gemma":[0.9980857,0.00141007,0.0001048615,0.00009671674,0.0002259631,0.00007669377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001528544,0.00009894011,0.002955779,0.00005646763,0.00001943429,0.0001173103,0.0001033177,0.9899997,0.002010967,0.0012495,0.0004328047,0.002802823],"study_design_scores_gemma":[0.000008721897,0.00007473311,0.0006764987,0.00000322458,0.000006201768,0.00001874573,0.00002759833,0.997862,0.0009896975,0.0001182215,0.0002090239,0.000005186735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9695705,0.0001500328,0.01856541,0.0001477866,0.00003363969,0.00006275449,0.0004331576,0.0004183942,0.01061839],"genre_scores_gemma":[0.996498,0.0000663798,0.002114884,0.00001673029,0.000003212586,0.00003855105,0.000129165,0.00001396782,0.001119022],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007442178,"threshold_uncertainty_score":0.01479769,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}