{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001205381,0.0001571221,0.0004227676,0.0001266916,0.0001261864,0.0003374346,0.001238412,0.0001275436,0.000001946735],"category_scores_gemma":[0.0000118748,0.0001390385,0.0001076611,0.0002489917,0.00006750022,0.0004642732,0.0001793072,0.0003061628,7.122507e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005745843,"about_ca_system_score_gemma":0.00007607086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002158693,"about_ca_topic_score_gemma":0.000002695821,"domain_scores_codex":[0.9977131,0.0002993291,0.001066454,0.0001528061,0.0005475517,0.000220799],"domain_scores_gemma":[0.9962781,0.0004210959,0.001381982,0.0003551948,0.001412089,0.0001515189],"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.001107785,0.002120731,0.01880633,0.0001041025,0.001920246,0.0003189824,0.003804843,0.3050962,0.0001107503,0.3315442,0.02612457,0.3089413],"study_design_scores_gemma":[0.0009922271,0.00011651,0.001232304,0.001006621,0.00003207159,0.0003462624,0.0006553287,0.9914076,0.000002586574,0.0003614601,0.003702579,0.0001444811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01129755,0.01328367,0.9724994,0.0004774946,0.001578403,0.0001427254,0.00004139378,0.00002512607,0.0006542102],"genre_scores_gemma":[0.9960341,0.002951615,0.0002857028,0.0001090111,0.0004983649,0.000003244285,0.00008997833,0.000006483323,0.00002143906],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9847366,"threshold_uncertainty_score":0.5669826,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002393246,0.0001021168,0.0001970667,0.0001180342,0.00007913967,0.0001017899,0.0001991881,0.00006417855,0.000001423289],"category_scores_gemma":[0.00002206836,0.0001020517,0.00003376947,0.0001041519,0.00005882904,0.0004503785,0.00003181482,0.0001592427,8.51257e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001164543,"about_ca_system_score_gemma":0.00002199262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001548387,"about_ca_topic_score_gemma":0.00001490227,"domain_scores_codex":[0.9991735,0.00004348818,0.0004565453,0.00006516562,0.0001423279,0.0001190048],"domain_scores_gemma":[0.999184,0.0001835996,0.0002181614,0.0001015353,0.0002626831,0.00005007796],"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.00005198825,0.00001003361,0.002548445,0.00001065311,0.00005306273,0.000003497876,0.000182401,0.9928662,0.00001719665,0.001735135,0.000974993,0.001546435],"study_design_scores_gemma":[0.001327165,0.00002655271,0.001422998,0.000308398,0.000009270941,0.0001728402,0.00101793,0.9920064,0.000005220234,0.0002342589,0.003359635,0.0001093007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0496634,0.01082774,0.9386452,0.00008123873,0.0003662113,0.0001357143,0.00002330296,0.00002586646,0.0002312772],"genre_scores_gemma":[0.9924068,0.006300188,0.0009968039,0.00001196028,0.0001424078,0.00001298157,0.0001059327,0.00001439866,0.000008526632],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9427434,"threshold_uncertainty_score":0.4161549,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002136076,0.0002257856,0.0004840239,0.0002164769,0.0005434991,0.0006811169,0.003014667,0.0001621603,0.000001503994],"category_scores_gemma":[0.0001242373,0.0001979987,0.0002060506,0.0002482803,0.0001575445,0.0006777011,0.0005150493,0.0003770319,0.000003307115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001637987,"about_ca_system_score_gemma":0.00008694521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006907841,"about_ca_topic_score_gemma":0.000007826802,"domain_scores_codex":[0.9968559,0.0007266225,0.001498261,0.000224943,0.0004154059,0.0002789367],"domain_scores_gemma":[0.9939294,0.001256274,0.00147219,0.001073464,0.00212357,0.0001450615],"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.0002159185,0.0003700129,0.003668748,0.00007026894,0.0008638884,0.00002238158,0.001799577,0.7607571,0.00008200305,0.1700827,0.05906271,0.003004684],"study_design_scores_gemma":[0.001227811,0.00009019601,0.0005577148,0.0005099807,0.00001777179,0.001530351,0.0003462841,0.928074,0.000004753795,0.0001372647,0.0672999,0.0002039481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006810163,0.006413532,0.9799402,0.002503774,0.003531057,0.0004356106,0.00004258105,0.00006156318,0.0002615531],"genre_scores_gemma":[0.995033,0.001630383,0.00195732,0.0004036539,0.0007273991,0.00003286461,0.00009733011,0.00001886181,0.00009914908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9882229,"threshold_uncertainty_score":0.8074152,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014996,0.000175084,0.0004606927,0.0002216557,0.000190402,0.00046068,0.0005527921,0.0001097772,0.000002596149],"category_scores_gemma":[0.0001027291,0.0001583308,0.0001755768,0.0003167737,0.00008765592,0.0006446705,0.0001984852,0.0002436223,2.651499e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007692615,"about_ca_system_score_gemma":0.0000319642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001428894,"about_ca_topic_score_gemma":0.000004971928,"domain_scores_codex":[0.9983387,0.0002568515,0.0006645222,0.0001661275,0.0002858582,0.0002879671],"domain_scores_gemma":[0.9968582,0.0009929334,0.000757235,0.0002384938,0.0009430167,0.0002101433],"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.0003933516,0.0002663158,0.03284588,0.0000115956,0.004162001,0.00001060371,0.0007184845,0.8851377,0.00002555632,0.03472916,0.002923616,0.03877575],"study_design_scores_gemma":[0.0009081294,0.00004842895,0.008689483,0.0001433201,0.0002347315,0.0001809824,0.0001167461,0.9886006,0.000001223344,0.0002136901,0.0006959046,0.0001667993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01438109,0.01436501,0.9699164,0.0005588222,0.0003429772,0.0002115382,0.000054467,0.00002293881,0.0001467591],"genre_scores_gemma":[0.9945433,0.001719709,0.002943268,0.0001159949,0.0004462687,0.00001056462,0.0001687309,0.00001073498,0.0000414341],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9801622,"threshold_uncertainty_score":0.6456543,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009285878,0.0002288226,0.0003981377,0.00006121834,0.0001504721,0.0002437994,0.0008430475,0.0002183284,0.00001163438],"category_scores_gemma":[0.00004351639,0.0002183343,0.0001797357,0.0001235307,0.0001094081,0.0003377965,0.0001580254,0.000399937,0.000001016673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001590487,"about_ca_system_score_gemma":0.00002056106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004093935,"about_ca_topic_score_gemma":0.00004787819,"domain_scores_codex":[0.998166,0.0001340839,0.0009130704,0.0001493803,0.0003079874,0.0003294435],"domain_scores_gemma":[0.9978647,0.000289625,0.0004501223,0.0004058726,0.0008296004,0.0001601323],"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.0005463717,0.0001677235,0.006669705,0.00005194499,0.0008035594,0.00001637909,0.000577812,0.9809932,0.00003611689,0.001663761,0.003792388,0.004681105],"study_design_scores_gemma":[0.001853815,0.00007548268,0.002249269,0.0002611596,0.00005088077,0.00023728,0.0002549806,0.9827303,0.00004943863,0.0003633532,0.01161447,0.000259541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1873434,0.02845893,0.7800568,0.00006954752,0.003086627,0.0004586019,0.0002398186,0.0001047133,0.0001816028],"genre_scores_gemma":[0.9962674,0.002256025,0.0004848969,0.0000432964,0.0006608885,0.00004380352,0.0001943023,0.00003608264,0.00001324992],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8089241,"threshold_uncertainty_score":0.8903414,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007927031,0.0001245608,0.0002103191,0.000135555,0.0001776104,0.0005433194,0.00122882,0.00007022553,0.000004874222],"category_scores_gemma":[0.00002673922,0.0001118867,0.0001131595,0.0001985967,0.00003738228,0.0006163425,0.00004671205,0.0001674209,1.91788e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006376606,"about_ca_system_score_gemma":0.00007601222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000345492,"about_ca_topic_score_gemma":0.000008939933,"domain_scores_codex":[0.998516,0.0001427355,0.0006636535,0.0001422723,0.000373364,0.0001619224],"domain_scores_gemma":[0.9976463,0.0001685046,0.0005722626,0.0004075813,0.001071409,0.0001339958],"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.0003475264,0.001974187,0.004028518,0.00002613569,0.0007230683,0.00003127671,0.001277018,0.2506145,0.000482543,0.3773628,0.02077606,0.3423563],"study_design_scores_gemma":[0.001305157,0.0002224751,0.002291452,0.00007869791,0.00001369155,0.00004917017,0.0003798961,0.9840682,0.00001707539,0.001192121,0.01025525,0.0001268445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007692347,0.001008161,0.9883049,0.002182166,0.0004473801,0.0001942558,0.0000968888,0.00002823931,0.00004564891],"genre_scores_gemma":[0.9645024,0.0001982667,0.03454385,0.0002410914,0.0001745392,0.00001146086,0.0003211276,0.000004660965,0.000002615973],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9568101,"threshold_uncertainty_score":0.5239241,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008348249,0.0001217842,0.0004593992,0.0002694126,0.00007127188,0.0001160581,0.001028878,0.00007302225,0.000007224915],"category_scores_gemma":[0.00004315365,0.00008417953,0.0001414626,0.0004146493,0.0001162914,0.0004342814,0.00006036824,0.0001266338,9.106795e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007374523,"about_ca_system_score_gemma":0.0000774366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001153098,"about_ca_topic_score_gemma":0.000005442519,"domain_scores_codex":[0.9981942,0.0003190655,0.0007999344,0.0001290827,0.0004330326,0.0001246735],"domain_scores_gemma":[0.9959182,0.0008677379,0.001143551,0.0003571093,0.001618373,0.00009499814],"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.0001891887,0.0001172155,0.01390388,0.000003820704,0.001777174,0.000003436873,0.00007328177,0.9088197,0.0000645453,0.01467848,0.0005841529,0.05978516],"study_design_scores_gemma":[0.001714963,0.00009879508,0.02496701,0.0001975204,0.000192339,0.00001795437,0.00003207088,0.9709924,0.00001422422,0.00003688796,0.0016391,0.00009666674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03084629,0.002205701,0.9646428,0.00160023,0.0004645728,0.0001040373,0.00005134244,0.00002063952,0.00006440932],"genre_scores_gemma":[0.9986036,0.0005514325,0.0006273661,0.00006520284,0.00009501438,0.000008875928,0.00003105556,0.000003363247,0.0000141011],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9677573,"threshold_uncertainty_score":0.3432742,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001443307,0.0001480027,0.0002648114,0.00009211614,0.0001767158,0.0001958585,0.0009346329,0.0000795611,0.000005632749],"category_scores_gemma":[0.0001171453,0.000103061,0.000110047,0.0002461372,0.0001325022,0.0004620287,0.0001554296,0.0003890312,8.429726e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007516963,"about_ca_system_score_gemma":0.00004491472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001230683,"about_ca_topic_score_gemma":0.000001757895,"domain_scores_codex":[0.9981366,0.0004450174,0.0006474963,0.0001042924,0.0004454769,0.0002211428],"domain_scores_gemma":[0.9958405,0.001994197,0.000923297,0.0003380351,0.0008051985,0.00009871722],"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.0004227214,0.0003497132,0.01340851,0.00001224051,0.0004641007,0.000005588318,0.0003989206,0.8658215,0.000009405484,0.09816048,0.004230143,0.01671672],"study_design_scores_gemma":[0.000754307,0.0001423673,0.009088536,0.000664584,0.00002715229,0.0001420431,0.0001269676,0.9877505,0.00002322221,0.0001127219,0.001049136,0.0001184684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1194534,0.005630054,0.8720856,0.001203427,0.0009978873,0.0001583989,0.00001070874,0.00001428249,0.0004462144],"genre_scores_gemma":[0.997997,0.001001974,0.0002500163,0.0002843919,0.0004170151,0.00000458804,0.00003048551,0.000008444566,0.000006063068],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8785436,"threshold_uncertainty_score":0.4202704,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006822005,0.0001272093,0.0002283599,0.0001429262,0.0003090263,0.000238526,0.001011701,0.0001111456,0.000004995858],"category_scores_gemma":[0.0001101485,0.0001152601,0.00009173679,0.0003064745,0.00008362366,0.0007798167,0.0002206195,0.0003497606,0.000002048801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001153012,"about_ca_system_score_gemma":0.00006136377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000330438,"about_ca_topic_score_gemma":0.000004539327,"domain_scores_codex":[0.9982923,0.0002581013,0.0007112971,0.0001441851,0.0004391493,0.000154982],"domain_scores_gemma":[0.9974796,0.0002167416,0.0007648077,0.0003497116,0.001071302,0.0001178719],"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.0003709266,0.0005507933,0.01474505,0.00002479701,0.0006703445,0.0001537231,0.0007921723,0.6473469,0.0004381012,0.3011503,0.01788995,0.01586704],"study_design_scores_gemma":[0.0009548053,0.0001313749,0.004151122,0.0001675564,0.00001320746,0.002231584,0.0001603113,0.966026,0.00009693402,0.0006547019,0.02522239,0.0001900146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0478195,0.00326141,0.945837,0.001022692,0.001713252,0.000118602,0.00002248976,0.00005763977,0.0001473679],"genre_scores_gemma":[0.9947867,0.003654019,0.0009295024,0.00007545135,0.0004066878,0.000007170534,0.0001174447,0.000006240552,0.00001676691],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9469672,"threshold_uncertainty_score":0.4700172,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001089915,0.0002024902,0.0003287242,0.0002112975,0.00008478883,0.0001903873,0.0009261207,0.0002055752,0.00001355015],"category_scores_gemma":[0.00009288349,0.0001590253,0.00007977704,0.0002585227,0.0001003642,0.0004549619,0.000148437,0.0004598021,0.00000223825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003038247,"about_ca_system_score_gemma":0.00002704297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004734885,"about_ca_topic_score_gemma":0.00007878342,"domain_scores_codex":[0.9979106,0.0004432818,0.001036204,0.0001319586,0.0002545,0.0002234288],"domain_scores_gemma":[0.9976864,0.0006097204,0.0005182272,0.0004738988,0.0006064721,0.0001052382],"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.0002194853,0.00009912087,0.006922293,0.00001221764,0.0002137641,0.000005825431,0.0002572951,0.9631839,0.0001355811,0.001496563,0.004771852,0.02268207],"study_design_scores_gemma":[0.002374056,0.00007010755,0.01565322,0.00203611,0.0000229319,0.00009394015,0.0003994266,0.9608864,0.00002515041,0.0002052462,0.0179559,0.0002775359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0149424,0.01064707,0.9708255,0.0009580232,0.0007156315,0.001156527,0.00004189665,0.00008985055,0.0006231245],"genre_scores_gemma":[0.9939774,0.00494471,0.0004294178,0.00004187643,0.0002316624,0.0001656942,0.0001525284,0.00002614784,0.00003062097],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.979035,"threshold_uncertainty_score":0.6484863,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000643096,0.0001355318,0.0002423224,0.0001758962,0.0001884882,0.0002282556,0.00097285,0.00009238151,0.000002318934],"category_scores_gemma":[0.00006564094,0.0001163272,0.00007312147,0.0002523707,0.00004623904,0.0006020088,0.0001308279,0.0002568415,0.000001186085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001454907,"about_ca_system_score_gemma":0.00008262497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003610779,"about_ca_topic_score_gemma":0.000003016227,"domain_scores_codex":[0.9982545,0.0003672346,0.0006717502,0.0001404815,0.0004480058,0.0001180538],"domain_scores_gemma":[0.997152,0.0004590265,0.0008723278,0.0003951794,0.001031747,0.00008972775],"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.0005296951,0.0006038924,0.02545961,0.00002367368,0.00069233,0.0002041183,0.001761046,0.7237355,0.0001755494,0.1942981,0.03869221,0.01382427],"study_design_scores_gemma":[0.0008521079,0.0002682214,0.01236621,0.0004741442,0.000008264547,0.0003111762,0.0001983641,0.9666121,0.00006755298,0.0002527472,0.01840368,0.00018543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00453033,0.00136743,0.9912226,0.0009838607,0.000692491,0.0001697669,0.00002321535,0.00005149353,0.0009588504],"genre_scores_gemma":[0.9936029,0.0005679317,0.005490132,0.0001032909,0.0001448403,0.00001550289,0.00003952835,0.000007764095,0.00002810911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9890726,"threshold_uncertainty_score":0.4743686,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002910669,0.0001276382,0.000239075,0.000140343,0.0001608515,0.0000868494,0.0004097332,0.00008245629,0.00000731883],"category_scores_gemma":[0.00007086604,0.0001279366,0.00007110841,0.0001669363,0.0001220104,0.0003082328,0.00006554466,0.0003400239,0.000001104595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002476558,"about_ca_system_score_gemma":0.00003527693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005532574,"about_ca_topic_score_gemma":0.000005639937,"domain_scores_codex":[0.9987447,0.0001291433,0.0006123296,0.00007633067,0.0002995673,0.0001379896],"domain_scores_gemma":[0.9984951,0.0001857165,0.0003575721,0.0001911153,0.0006806046,0.00008989101],"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.00002907199,0.00004627931,0.01110691,0.00001459134,0.0002396579,0.00001151073,0.0002828448,0.9843394,0.0005172704,0.0003376507,0.002652012,0.0004228163],"study_design_scores_gemma":[0.0008480792,0.00002002913,0.01471262,0.0003155438,0.00001620622,0.001318222,0.0005334254,0.9769681,0.0001138751,0.0001107469,0.004866001,0.0001772071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4404213,0.004469508,0.5532501,0.0001125006,0.001224265,0.0001285148,0.00007594126,0.00006709458,0.0002508586],"genre_scores_gemma":[0.9970579,0.001470008,0.001015029,0.00001245585,0.0003434161,0.000004315347,0.00007070258,0.00001563977,0.00001054093],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5566366,"threshold_uncertainty_score":0.5217102,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004571132,0.0001996115,0.0003998839,0.0001658054,0.0001156923,0.0001336827,0.0008439084,0.0002357582,0.000006214699],"category_scores_gemma":[0.0001779835,0.000185118,0.00008733205,0.0002637569,0.0001452713,0.0003510561,0.0001671271,0.0009339562,0.000001624255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002046382,"about_ca_system_score_gemma":0.00002812666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009559364,"about_ca_topic_score_gemma":0.00001226688,"domain_scores_codex":[0.9981737,0.00008309908,0.0009749969,0.0001264056,0.000362912,0.0002788807],"domain_scores_gemma":[0.9985727,0.000385389,0.0002405549,0.0003216237,0.0003453615,0.0001343901],"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.00005316408,0.00004542337,0.005040643,0.000005272052,0.00009139429,0.0000677475,0.00003672537,0.9880559,0.00002372602,0.00369431,0.0003033881,0.002582285],"study_design_scores_gemma":[0.0008115981,0.0000395667,0.007975166,0.0003455541,0.00001288894,0.0004739219,0.0002375238,0.9864548,0.000001921638,0.0002384056,0.003217824,0.0001907609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2222941,0.01167522,0.7642797,0.0004624389,0.0007463441,0.0001338598,0.000009425531,0.0001219711,0.0002769113],"genre_scores_gemma":[0.9862619,0.008520813,0.00478895,0.00002646735,0.0002998894,0.00001287921,0.00006096376,0.00002419964,0.000003943491],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7639678,"threshold_uncertainty_score":0.7548891,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006099407,0.0001134888,0.00021965,0.0001237321,0.0001462088,0.0001538195,0.001221081,0.00006876603,7.846733e-7],"category_scores_gemma":[0.0002070402,0.0001031513,0.00007496899,0.0001851039,0.00003288512,0.0003797942,0.0001395375,0.0002020114,9.272478e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008564875,"about_ca_system_score_gemma":0.00008392929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005184862,"about_ca_topic_score_gemma":0.00001367843,"domain_scores_codex":[0.9986998,0.00005928122,0.0006827269,0.0001281206,0.0002701265,0.0001599482],"domain_scores_gemma":[0.9975331,0.0008035589,0.000555749,0.0002945765,0.0007215013,0.00009153333],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004327418,0.0007345002,0.7989643,0.00003138044,0.0001759944,0.0001282469,0.0007137816,0.1592819,0.0002144967,0.001676823,0.006091882,0.03198231],"study_design_scores_gemma":[0.0009599365,0.0000909747,0.021284,0.0002169402,0.000007619441,0.0005927685,0.00005509334,0.9740949,0.00002950467,0.0001047379,0.002429738,0.0001338079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05495986,0.0016793,0.9419031,0.0007238981,0.0004859293,0.0001328342,0.00002554813,0.0000285711,0.00006096655],"genre_scores_gemma":[0.9976186,0.0007132586,0.001135024,0.00009554986,0.0003659894,0.00001123542,0.00004617257,0.000007757023,0.000006454967],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9426587,"threshold_uncertainty_score":0.4206388,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001477633,0.0001887596,0.0003881107,0.0001970868,0.0001070007,0.0005017907,0.001533206,0.000171383,0.000002626793],"category_scores_gemma":[0.00003750145,0.0001704048,0.00009326086,0.000343586,0.00008212752,0.0004445901,0.000330765,0.0005845042,0.00000155952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001888172,"about_ca_system_score_gemma":0.000101454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003703577,"about_ca_topic_score_gemma":0.0000106523,"domain_scores_codex":[0.9975449,0.0004522626,0.001009655,0.0001897959,0.0005387535,0.0002646668],"domain_scores_gemma":[0.9972008,0.0005151335,0.0008920523,0.0003422537,0.0008423034,0.0002074728],"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.0005364827,0.0003488533,0.006499862,0.000005842054,0.0002805814,0.0002681918,0.0006414641,0.7536789,0.0000013192,0.09783289,0.04941202,0.09049366],"study_design_scores_gemma":[0.001530173,0.00009138305,0.001302125,0.0002984722,0.00001074606,0.0002385487,0.0002364129,0.9876673,1.571666e-7,0.001635471,0.006820098,0.0001691404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008416932,0.003850987,0.9823189,0.001353823,0.002935058,0.0001319539,0.000007618878,0.00003730593,0.0009474585],"genre_scores_gemma":[0.9978775,0.0006252112,0.0002590586,0.0003099718,0.0008046384,0.00000725274,0.0000851617,0.00001138709,0.00001985189],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9894605,"threshold_uncertainty_score":0.6948904,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007561498,0.00009335134,0.0002424432,0.00008843721,0.00006816723,0.000485927,0.0004232651,0.0001213357,0.00001042639],"category_scores_gemma":[0.0001602448,0.00007622658,0.0000587568,0.0001368658,0.0002280511,0.0005403364,0.00006251009,0.0003754717,4.497137e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009891186,"about_ca_system_score_gemma":0.0001365035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000137192,"about_ca_topic_score_gemma":0.0001253574,"domain_scores_codex":[0.9985471,0.00024653,0.0005449368,0.0001008536,0.0004439749,0.0001166463],"domain_scores_gemma":[0.9982679,0.0004122739,0.0004053157,0.0001375696,0.0006223173,0.0001545616],"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.0007943819,0.001218304,0.07078183,0.0001330734,0.001660007,0.00003644376,0.06412831,0.0321061,0.0005147164,0.4876046,0.006946776,0.3340755],"study_design_scores_gemma":[0.002766171,0.001534508,0.01615268,0.006090258,0.0002526876,0.0001297069,0.08623522,0.2980619,0.0001270424,0.003009161,0.5848935,0.0007471603],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8106798,0.026247,0.148456,0.003428502,0.004176306,0.001383842,0.0003736298,0.00008960757,0.005165327],"genre_scores_gemma":[0.9981831,0.001037154,0.0001012396,0.00001821132,0.0004743351,0.00001437325,0.00006365479,0.000007823287,0.0001001532],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5779467,"threshold_uncertainty_score":0.4685806,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006823644,0.0001025505,0.0001845301,0.0001186863,0.0001448553,0.0004356635,0.001093684,0.0000585478,0.000004168956],"category_scores_gemma":[0.00004945429,0.00009188029,0.0001119633,0.0001861313,0.00003458193,0.0004757331,0.00008457425,0.0001507891,2.94516e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005523105,"about_ca_system_score_gemma":0.00005233372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002010601,"about_ca_topic_score_gemma":0.000007420939,"domain_scores_codex":[0.9987429,0.00008835417,0.0006106407,0.0001109785,0.000305007,0.000142155],"domain_scores_gemma":[0.9979666,0.0001866324,0.0005674335,0.0003145711,0.0008696062,0.00009517313],"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.0001448935,0.0004180014,0.00445721,0.00001202637,0.0004445897,0.000009358731,0.0006125611,0.01528888,0.00012238,0.9129095,0.03048054,0.03510004],"study_design_scores_gemma":[0.003615278,0.000443514,0.01607412,0.0002939268,0.00004521514,0.0003081551,0.001176216,0.869047,0.00003059844,0.0133644,0.09522633,0.0003752591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01218331,0.002410253,0.9807783,0.003670241,0.0005214939,0.0001822493,0.00004529873,0.00002400462,0.0001848252],"genre_scores_gemma":[0.9918435,0.000742014,0.006941784,0.0001735427,0.0001622416,0.000009073465,0.0001156886,0.000003518677,0.000008677078],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9796602,"threshold_uncertainty_score":0.4201114,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006883691,0.00009117679,0.000243847,0.0001467488,0.0000605409,0.00004579344,0.001969109,0.00006076664,0.000003768796],"category_scores_gemma":[0.00005285475,0.0000708791,0.00007230514,0.0004286618,0.00005960524,0.0003499131,0.0001820764,0.0002402048,1.719234e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007191074,"about_ca_system_score_gemma":0.00001770881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001219824,"about_ca_topic_score_gemma":0.000007783724,"domain_scores_codex":[0.9987715,0.0001327733,0.0006263548,0.00006252544,0.0003272503,0.00007955047],"domain_scores_gemma":[0.997699,0.0001166874,0.0005059326,0.001078617,0.000561194,0.00003857851],"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.00001511583,0.00003097987,0.001418155,0.000004136961,0.0004672637,2.870054e-7,0.00005914074,0.9881231,0.00004949666,0.0005986297,0.002338464,0.006895255],"study_design_scores_gemma":[0.0002052531,0.00001379391,0.01856304,0.0001870886,0.000184952,0.00001840421,0.0001070975,0.9745967,0.00004662783,0.00008754554,0.005914458,0.00007508165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2651915,0.02739954,0.7000039,0.002566362,0.001130615,0.0004641217,0.0008024554,0.0001851548,0.00225638],"genre_scores_gemma":[0.9902905,0.009119511,0.0002704435,0.0000328277,0.00004670846,0.000002061831,0.0002235467,0.000006060012,0.000008348538],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.725099,"threshold_uncertainty_score":0.3659127,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00143807,0.0001336239,0.0003171633,0.0002806574,0.00008895231,0.0002960202,0.0052833,0.0001322458,0.000002413017],"category_scores_gemma":[0.0002837779,0.0001163785,0.00003858485,0.0004238142,0.0000915601,0.001115318,0.0009350547,0.0005345279,4.568513e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003611407,"about_ca_system_score_gemma":0.00009646719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002051547,"about_ca_topic_score_gemma":0.0003435593,"domain_scores_codex":[0.9978335,0.0003188587,0.001063005,0.0001863202,0.0004645344,0.000133785],"domain_scores_gemma":[0.9950951,0.0008366921,0.001236983,0.001845224,0.0009305162,0.00005551511],"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.000119412,0.001139135,0.08795853,0.00001609546,0.000157393,0.00000833142,0.0003965832,0.8879917,0.0001082836,0.01231351,0.0004872017,0.009303833],"study_design_scores_gemma":[0.001472217,0.0001169155,0.04020334,0.000135197,0.00001406156,0.00001453408,0.0007583813,0.953107,0.00001461313,0.0002301822,0.003814458,0.0001190942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5057353,0.001598137,0.490462,0.001163832,0.0005863982,0.0002902533,0.00002711438,0.00005224094,0.00008472162],"genre_scores_gemma":[0.9970789,0.0002276298,0.002502708,0.00003891307,0.00005104885,0.000008479051,0.00008268165,0.000007034086,0.00000262191],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4913436,"threshold_uncertainty_score":0.9817774,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}