{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":9,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":9,"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":"8539c5f06699","filters":{"venue":"Journal of Communications"}},"results":[{"id":"W2150175170","doi":"10.4304/jcm.2.2.1-9","title":"HealthGear: Automatic Sleep Apnea Detection and Monitoring with a Mobile Phone","year":2007,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Obstructive Sleep Apnea Research","field":"Medicine","cited_by":84,"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":"Mobile phone; Computer science; Sleep apnea; Sleep (system call); Apnea; Medicine; Telecommunications; Internal medicine; Operating system","authors":[{"name":"Nuria Oliver","is_ca":false},{"name":"Fernando Flores-Mangas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02984336643901363,"gpt":0.355923899585083,"spread":0.3260805331460694,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008556879,0.00007015537,0.0001949595,0.0002679503,0.0001880718,0.00002117981,0.000187649,0.00004225841,0.000013168],"category_scores_gemma":[0.0001152701,0.00005448832,0.00003997376,0.0003251418,0.0001547016,0.0001476349,0.00007570684,0.0005338922,0.000005447998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001602209,"about_ca_system_score_gemma":0.00003878984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000203286,"about_ca_topic_score_gemma":0.00002586651,"domain_scores_codex":[0.9990205,0.00007616832,0.0003593332,0.00005843689,0.000321399,0.0001641664],"domain_scores_gemma":[0.9983312,0.0002935685,0.0002362429,0.0005272644,0.0004160719,0.0001956742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0004383457,0.0005535993,0.0689478,0.0001526043,0.0003231773,0.00004001054,0.002348847,0.00002401826,0.06490853,0.00006705603,0.000008564285,0.8621874],"study_design_scores_gemma":[0.006582527,0.00374904,0.9115677,0.000452423,0.0004016222,0.005734859,0.009745313,0.01547624,0.04185078,0.0002110438,0.003957754,0.0002706968],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9837079,0.002008444,0.0122441,0.0009372404,0.00006833811,0.0002484113,6.017303e-7,0.00002053399,0.0007644164],"genre_scores_gemma":[0.9688698,0.0001893427,0.03077901,0.0000206616,0.0001008663,0.00000822249,4.942478e-7,0.00001434331,0.00001723441],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8619168,"threshold_uncertainty_score":0.2319525,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129923823","doi":"10.4304/jcm.7.5.400-408","title":"Downstream-based Scheduling for Energy Conservation in Green EPONs","year":2012,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kootenay Association for Science & Technology; University of Waterloo","funders":"","keywords":"Computer science; Environmental science; Energy conservation; Scheduling (production processes); Ecology; Mathematics; Mathematical optimization; Biology","authors":[{"name":"Ahmad R. Dhaini","is_ca":true},{"name":"Pin‐Han Ho","is_ca":true},{"name":"Basem Shihada","is_ca":true},{"name":"Gangxiang Shen","is_ca":false},{"name":"Chih-Hao Lin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03436517072594063,"gpt":0.2809146160056933,"spread":0.2465494452797526,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002169787,0.00006258382,0.0001275457,0.0001473871,0.00004621477,0.00000792571,0.0003821887,0.00006526987,0.000002692662],"category_scores_gemma":[0.0001747379,0.00006083409,0.00005100348,0.0002109858,0.00006006642,0.0002379112,0.00003556403,0.0002037944,9.599262e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007894742,"about_ca_system_score_gemma":0.00002111038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005493614,"about_ca_topic_score_gemma":0.00004930087,"domain_scores_codex":[0.9994167,0.00002299492,0.000324229,0.00002403539,0.00006111695,0.0001508919],"domain_scores_gemma":[0.9988394,0.0005478811,0.00009361673,0.0003879643,0.00009058131,0.00004059877],"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.00006373641,0.0004910158,0.02091355,0.00008176336,0.0001409565,0.000001650539,0.000267018,0.5154485,0.006843421,0.3356344,0.001020121,0.1190938],"study_design_scores_gemma":[0.001656962,0.0001197754,0.00884604,0.0003135709,0.00007221135,0.00003125523,0.000459582,0.8585063,0.00372651,0.03755045,0.0883405,0.0003768564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07544874,0.006854319,0.9094079,0.005963607,0.0001993104,0.0001418569,0.000007793351,0.0001730292,0.001803502],"genre_scores_gemma":[0.6779979,0.0002672247,0.3216176,0.0000557713,0.00003123134,0.00001311442,0.000003778122,0.000009199264,0.000004134043],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6025493,"threshold_uncertainty_score":0.2480742,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107308768","doi":"10.4304/jcm.5.2.152-163","title":"Preventing Unauthorized Messages and Achieving End-to-End Security in Delay Tolerant Heterogeneous Wireless Networks","year":2010,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":12,"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 science; Computer network; Roaming; Node (physics); Wireless network; Heterogeneous network; Wireless ad hoc network; Distributed computing; Computer security; Wireless; Telecommunications","authors":[{"name":"Hany Samuel","is_ca":false},{"name":"Weihua Zhuang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01793017471716186,"gpt":0.2786829743651169,"spread":0.260752799647955,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00165258,0.0001502006,0.0003505309,0.0001891956,0.0002908962,0.0002280824,0.001840289,0.0001153473,0.00001214338],"category_scores_gemma":[0.00003272732,0.0001375505,0.00009594587,0.0003624815,0.0001030146,0.0004032316,0.0008117314,0.001104248,0.000001274148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002520293,"about_ca_system_score_gemma":0.000114399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002316637,"about_ca_topic_score_gemma":0.000244512,"domain_scores_codex":[0.9982385,0.0003115011,0.0007490395,0.0001704096,0.000248392,0.0002821547],"domain_scores_gemma":[0.9973702,0.0006536494,0.0004583822,0.001100895,0.0001771771,0.0002396901],"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.0001032523,0.0009277792,0.01658424,0.00004427911,0.000225021,0.000296351,0.008590142,0.005800876,0.002862249,0.0423545,0.0006015038,0.9216098],"study_design_scores_gemma":[0.0006360977,0.00009656624,0.002886209,0.0002104561,0.00003519624,0.0008132525,0.00008444376,0.9884898,0.00004182839,0.002747282,0.00371656,0.0002423043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4805295,0.001417267,0.513403,0.003143434,0.0004423409,0.0001728119,0.0000021435,0.00002958092,0.0008599325],"genre_scores_gemma":[0.9566712,0.0005766031,0.04241814,0.0001930237,0.0001017595,0.000006290193,0.000001874504,0.00001099308,0.00002009149],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9826889,"threshold_uncertainty_score":0.5609146,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005916424","doi":"10.4304/jcm.7.8.587-595","title":"Designing P2P Networks Tolerant to Attacks and Faults Based on Bimodal Degree Distribution","year":2012,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":12,"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":"Degree (music); Computer science; Degree distribution; Distribution (mathematics); Distributed computing; Computer network; Mathematics; Complex network; World Wide Web; Physics","authors":[{"name":"Katsuya Suto","is_ca":false},{"name":"Hiroki Nishiyama","is_ca":true},{"name":"Xuemin Shen","is_ca":false},{"name":"Nei Kato","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05762545248745442,"gpt":0.3063750261670883,"spread":0.2487495736796339,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009465393,0.0001174425,0.0001866367,0.0001812909,0.0002741643,0.00009853551,0.002098526,0.00007780889,0.000001279695],"category_scores_gemma":[0.0002554342,0.0001028161,0.00005652738,0.0006022158,0.00005696949,0.0004099083,0.0006417031,0.0004238607,0.000009092933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001163105,"about_ca_system_score_gemma":0.00005050254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005953858,"about_ca_topic_score_gemma":0.00001090533,"domain_scores_codex":[0.9988244,0.0001570662,0.0003592806,0.0001033271,0.0002594316,0.0002964577],"domain_scores_gemma":[0.9975145,0.0004988784,0.0002196179,0.001332485,0.0002145258,0.000219986],"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.0001674405,0.00116767,0.03964803,0.0000159708,0.0001378733,0.00001572483,0.002338634,0.2138065,0.001889865,0.04713924,0.05122905,0.642444],"study_design_scores_gemma":[0.001048288,0.0009800104,0.1970668,0.0005513291,0.00005895109,0.0001710476,0.0001850271,0.7270758,0.001488346,0.001351181,0.06941159,0.0006117097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02039369,0.0005808522,0.9592907,0.01904381,0.0001779138,0.0001327072,0.000003781343,0.00007677322,0.0002997334],"genre_scores_gemma":[0.7630388,0.00004012006,0.2363296,0.0005071993,0.0000597028,0.000008355592,0.000003056104,0.000005497011,0.000007735352],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.742645,"threshold_uncertainty_score":0.4192719,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975686539","doi":"10.4304/jcm.7.1.28-38","title":"Low-Overhead Dynamic Sampling for Redundant Traffic Elimination","year":2012,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Advanced Data Storage Technologies","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":"University of Calgary","funders":"","keywords":"Computer science; Byte; Redundancy (engineering); Network packet; Overhead (engineering); Data redundancy; Throughput; Traverse; Sampling (signal processing); Algorithm; Real-time computing; Computer network; Detector; Computer hardware","authors":[{"name":"Emir Halepovic","is_ca":true},{"name":"Carey Williamson","is_ca":false},{"name":"Majid Ghaderi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06176264834551478,"gpt":0.3605533027415574,"spread":0.2987906543960426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005907682,0.00007430798,0.0001369719,0.000188264,0.0002144708,0.00005463079,0.002441203,0.00004838985,0.000001219071],"category_scores_gemma":[0.0004576807,0.00006802244,0.00009900044,0.0002538565,0.00008329326,0.001541038,0.0003736081,0.0002324614,0.000005024647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001443555,"about_ca_system_score_gemma":0.00006017906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.849565e-7,"about_ca_topic_score_gemma":0.000004626624,"domain_scores_codex":[0.9991832,0.00004410962,0.0003725144,0.00006413495,0.0001527353,0.0001832978],"domain_scores_gemma":[0.997421,0.0004937229,0.0004493963,0.001341037,0.000241235,0.00005360554],"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.0000163945,0.0006306295,0.00003759416,0.00003070297,0.00007216523,6.796146e-7,0.001858906,0.00296672,0.00808442,0.3060037,0.001306569,0.6789915],"study_design_scores_gemma":[0.003909892,0.001340575,0.01577277,0.0008918142,0.0002956748,0.0012176,0.003895447,0.4855564,0.01128822,0.1222751,0.3519723,0.001584258],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01008836,0.002497576,0.9813013,0.00558169,0.0002421936,0.0001165617,0.000008037809,0.00008463152,0.00007961074],"genre_scores_gemma":[0.5439821,0.0003540892,0.4555887,0.00003349597,0.0000168634,0.000006549131,0.000003972003,0.000004391183,0.000009787691],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6774072,"threshold_uncertainty_score":0.4536404,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094782639","doi":"10.4304/jcm.6.3.215-224","title":"A Short-Time Burst degradation Classifier for Real-Time Traffic with Application in MPLS Ingress Nodes","year":2011,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Network Traffic and Congestion Control","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Computer network; Burstiness; Quality of service; Real-time computing; Scheduling (production processes); Classifier (UML); Queueing theory; Polling; Network packet; Artificial intelligence","authors":[{"name":"Masoomeh Torabzadeh","is_ca":false},{"name":"Wessam Ajib","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03889477770260401,"gpt":0.2671918485944175,"spread":0.2282970708918135,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006368037,0.0001096202,0.0002230004,0.0001977004,0.0001496562,0.00006775896,0.001542882,0.00006383567,0.000005134979],"category_scores_gemma":[0.00002825418,0.00009173493,0.00007303456,0.0003837932,0.00008547418,0.000561149,0.00007187063,0.0002022562,0.00001173604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006591461,"about_ca_system_score_gemma":0.0001344842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008642517,"about_ca_topic_score_gemma":0.00006179249,"domain_scores_codex":[0.9988783,0.0001391261,0.000503542,0.0001324459,0.0001829768,0.0001635856],"domain_scores_gemma":[0.997908,0.000347918,0.0003688466,0.0009187277,0.0003771666,0.00007933534],"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.0002204578,0.0008573659,0.001717832,0.00001314622,0.0001185816,0.000003643252,0.002045068,0.00305623,0.001438922,0.042546,0.001036134,0.9469466],"study_design_scores_gemma":[0.00156996,0.0003720392,0.0170294,0.0001838422,0.00008643969,0.00009024412,0.0001377,0.9734893,0.000109824,0.0017596,0.004863675,0.0003079161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1040261,0.0003886949,0.8880962,0.003766912,0.00007246107,0.0006346506,0.000004790222,0.00009490579,0.002915321],"genre_scores_gemma":[0.8715922,0.0001631198,0.1279316,0.00005097105,0.00003932325,0.00007367082,0.000007593456,0.00001062473,0.0001309013],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9704331,"threshold_uncertainty_score":0.3740842,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159049494","doi":"10.4304/jcm.1.2.48-56","title":"Round-trip Time Variation in SmoothTCP in the Face of Spurious Errors","year":2006,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Network Traffic and Congestion Control","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":"Western University","funders":"","keywords":"Spurious relationship; Variation (astronomy); Computer science; Face (sociological concept); Statistics; Geodesy; Mathematics; Geology; Machine learning; Physics","authors":[{"name":"Elvis M. Vieira","is_ca":true},{"name":"Michael Bauer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01310995419330829,"gpt":0.2464315340251916,"spread":0.2333215798318833,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001077347,0.0000559776,0.000148116,0.0001734002,0.00005531712,0.00004629694,0.00190471,0.00003772534,0.000004658302],"category_scores_gemma":[0.00004929724,0.00004288657,0.00005939147,0.000571102,0.00004387556,0.0002859673,0.00007849703,0.0002715843,0.0000062855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004611139,"about_ca_system_score_gemma":0.0001083855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009592876,"about_ca_topic_score_gemma":0.0002618154,"domain_scores_codex":[0.9987206,0.0003795571,0.0005378192,0.00005404396,0.0002126844,0.00009532752],"domain_scores_gemma":[0.9982197,0.0005040541,0.0004078869,0.0007306426,0.0001212998,0.00001643029],"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.00008667328,0.00343527,0.01237742,0.00001767655,0.00009434998,0.00003571417,0.017905,0.1763441,0.002322956,0.5768834,0.008825846,0.2016716],"study_design_scores_gemma":[0.002740201,0.0002226291,0.345706,0.0001710024,0.00004138415,0.0001345158,0.0004128578,0.5963804,0.0000344061,0.03175168,0.02215457,0.000250349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3289482,0.006378153,0.5589679,0.09028561,0.0003571334,0.0006039407,0.000003791494,0.00004525118,0.01441009],"genre_scores_gemma":[0.9919743,0.00009466645,0.007669617,0.0001382971,0.00003075756,0.000003952198,8.215959e-7,0.00000256624,0.00008503068],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6630262,"threshold_uncertainty_score":0.3539456,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2381569823","doi":"","title":"Evaluation model for topology partition base on simulation run time","year":2013,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Partition (number theory); Computer science; Subnet; Topology (electrical circuits); Algorithm; Mathematics","authors":[{"name":"Li Bin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09010810095060073,"gpt":0.3494173123101519,"spread":0.2593092113595512,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001218255,0.0000589989,0.0001026502,0.0001388256,0.0002425295,0.0000750061,0.0006495147,0.00005828421,0.00007248353],"category_scores_gemma":[0.0002680596,0.00005381593,0.00008046634,0.0001525956,0.0000329811,0.0008105361,0.00007815574,0.0001546745,0.00006121025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009006653,"about_ca_system_score_gemma":0.00009342285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003811518,"about_ca_topic_score_gemma":0.000006085479,"domain_scores_codex":[0.9989384,0.0002608203,0.0003559711,0.00007536288,0.0002751733,0.00009420725],"domain_scores_gemma":[0.9973925,0.0004400647,0.0003462723,0.0006658414,0.001104413,0.00005093497],"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.00001884313,0.000251568,0.000006410092,0.000003276106,0.00002807007,7.099316e-8,0.0006337985,0.8055987,0.001704898,0.03728928,0.005070966,0.1493942],"study_design_scores_gemma":[0.0003019518,0.0001855522,0.0001389123,0.00001680145,0.00002103902,0.000004249301,0.000007494268,0.8995035,0.0002436252,0.09791254,0.001615563,0.00004873356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01878928,0.0001386923,0.9705143,0.008956753,0.0001741564,0.0003634253,0.000001410487,0.0000249008,0.001037069],"genre_scores_gemma":[0.9548919,0.00005802836,0.04445222,0.0004004292,0.00007650333,0.00004167407,0.000005218918,0.000004282319,0.00006971486],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9361026,"threshold_uncertainty_score":0.219455,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2371742128","doi":"","title":"Adaptive joint source-channel coding and MAP decoding of error correction arithmetic codes","year":2007,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Algorithms and Data Compression","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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Variable-length code; Decoding methods; Computer science; Algorithm; Arithmetic coding; Shannon–Fano coding; Coding gain; Adaptive coding; List decoding; Coding (social sciences); Channel (broadcasting); Source code; Theoretical computer science; Context-adaptive binary arithmetic coding; Concatenated error correction code; Mathematics; Block code; Telecommunications; Data compression; Statistics","authors":[{"name":"Tianhao Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07945490248697054,"gpt":0.3163771763641999,"spread":0.2369222738772293,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00115697,0.00007571948,0.0001947797,0.0002332126,0.0002428901,0.00005616964,0.0007952291,0.00004147705,0.000002503047],"category_scores_gemma":[0.0001340632,0.0000652595,0.00006138437,0.0001994639,0.00009979698,0.0004918868,0.0005285161,0.0002730651,0.00000131759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004209503,"about_ca_system_score_gemma":0.00004755603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003434432,"about_ca_topic_score_gemma":0.00002440425,"domain_scores_codex":[0.9990056,0.00009383901,0.0004959431,0.00008099825,0.0002040734,0.0001195258],"domain_scores_gemma":[0.997844,0.0005576077,0.000601327,0.0005937435,0.0003156964,0.00008756186],"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.0001911605,0.001367756,0.002386333,0.0001032386,0.0003888683,0.00002911114,0.02268216,0.004097448,0.02223319,0.07020907,0.008755331,0.8675563],"study_design_scores_gemma":[0.0007574857,0.0004292575,0.01181943,0.0007094016,0.000057079,0.0004763176,0.003156018,0.9651474,0.005133644,0.006543988,0.005533046,0.0002368864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006230448,0.001202668,0.9910098,0.0007352438,0.0003393838,0.00005663213,0.00000201817,0.00001465061,0.0004091327],"genre_scores_gemma":[0.7861435,0.0003211614,0.2134189,0.00003103574,0.00003520286,6.843198e-7,0.000001009057,0.000004358826,0.00004406919],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.96105,"threshold_uncertainty_score":0.2661205,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}