{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003426776,0.0007393538,0.0005989904,0.0009148075,0.0002021148,0.0004730431,0.00062036,0.001018545,0.004216681],"category_scores_gemma":[0.0006993592,0.000288191,0.0002973313,0.000270693,0.0001870527,0.0005545523,0.0006350678,0.0002904739,0.001693759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001040251,"about_ca_system_score_gemma":0.0001498535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005125158,"about_ca_topic_score_gemma":0.001034409,"domain_scores_codex":[0.9997234,0.00006753611,0.0000171411,0.00008873687,0.00007549221,0.00002777026],"domain_scores_gemma":[0.9997256,0.0001146066,0.00004403016,0.0000373543,0.00004119497,0.00003713462],"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.002700338,0.0004035099,0.02363231,0.0005658406,0.0002655157,0.001220888,0.0003386502,0.002048453,0.1975368,0.0008707111,0.02338167,0.7470354],"study_design_scores_gemma":[0.001956868,0.008674414,0.2176844,0.0003334374,0.0008301405,0.01872163,0.0003927432,0.2930134,0.3584677,0.003374105,0.09592063,0.000630556],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.375532,0.005162126,0.5557953,0.0008831709,0.0006853046,0.00108291,0.004353297,0.04918673,0.007319214],"genre_scores_gemma":[0.5741925,0.001330382,0.4090911,0.001105055,0.0004762093,0.000610467,0.002534,0.0004539116,0.01020636],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004216681,"threshold_uncertainty_score":0.01410615,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005750089,0.0003221993,0.0003529672,0.0001979302,0.0005105683,0.0004518431,0.0007197534,0.0002863161,0.0009010406],"category_scores_gemma":[0.001105443,0.0001839122,0.0001762559,0.0002158148,0.0003955309,0.0006193618,0.0006027254,0.0004515527,0.0001031224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006797411,"about_ca_system_score_gemma":0.000956355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001476801,"about_ca_topic_score_gemma":0.002375918,"domain_scores_codex":[0.9997576,0.00005829409,0.000009925804,0.00004905971,0.00007663578,0.00004855405],"domain_scores_gemma":[0.99959,0.0001667538,0.00006278055,0.00005784718,0.00009471393,0.00002790374],"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.0004435525,0.0002183803,0.002727569,0.0001248729,0.00004023224,0.0003836189,0.0003841051,0.6895419,0.1146012,0.127219,0.002188839,0.06212669],"study_design_scores_gemma":[0.000008163234,0.00003109638,0.0001482692,0.000003348779,0.000005007838,0.00002827531,0.00001442569,0.9887832,0.004076257,0.006449966,0.0004464692,0.000005535565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2489708,0.0002010757,0.7445007,0.0002215498,0.00007095069,0.00004262227,0.00004493509,0.0001987587,0.005748508],"genre_scores_gemma":[0.9812372,0.00004786839,0.01741021,0.00003484799,0.00001695493,0.00001744588,0.00001316686,0.00001578833,0.001206476],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001476801,"threshold_uncertainty_score":0.004931927,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001146958,0.0004459149,0.0003815705,0.0005812315,0.0007424,0.00105036,0.0009149262,0.0007014858,0.0005996787],"category_scores_gemma":[0.002419162,0.0001517523,0.0002144143,0.0004766699,0.0007509753,0.002063448,0.001441236,0.0006165004,0.0001520897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004985492,"about_ca_system_score_gemma":0.0004024001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005105318,"about_ca_topic_score_gemma":0.0003437047,"domain_scores_codex":[0.9991855,0.0002667769,0.00007222095,0.00009797117,0.0002534187,0.0001240413],"domain_scores_gemma":[0.9979096,0.0008670624,0.0003720484,0.0004199056,0.000315462,0.0001158567],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001380069,0.0003854247,0.006080056,0.0004376169,0.0001622993,0.001436512,0.0007942308,0.4803539,0.1935718,0.1426979,0.003304586,0.1693955],"study_design_scores_gemma":[0.00003352644,0.0003034588,0.0005083733,0.00001664047,0.00003740637,0.0002800153,0.0001818624,0.9348862,0.03896599,0.02115835,0.003605541,0.00002278553],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1770446,0.0005345026,0.8189988,0.0002945823,0.00007027735,0.00009755017,0.00003299077,0.0003165748,0.002610115],"genre_scores_gemma":[0.9647563,0.000177607,0.03426981,0.00004977746,0.00003067572,0.00003204769,0.00003213019,0.00001109714,0.0006406024],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001146958,"threshold_uncertainty_score":0.006065786,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004974164,0.0003746415,0.0003973144,0.000622334,0.0006624471,0.0006843415,0.0007541792,0.0005542646,0.000879294],"category_scores_gemma":[0.002047763,0.0001920315,0.0001830375,0.0006261566,0.0005836182,0.001237972,0.001026273,0.0004421932,0.0002214119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005563346,"about_ca_system_score_gemma":0.0004329502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008443732,"about_ca_topic_score_gemma":0.0008419332,"domain_scores_codex":[0.9996216,0.0001268895,0.00001818388,0.00007605668,0.00009955069,0.00005767439],"domain_scores_gemma":[0.9992294,0.0003252946,0.0001092451,0.0001115063,0.0001462885,0.00007827064],"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.0003147759,0.0001490442,0.003791756,0.0002047089,0.00006138667,0.0004869095,0.0003134601,0.7610535,0.06998929,0.04433279,0.002920956,0.1163814],"study_design_scores_gemma":[0.00002214064,0.00008966565,0.0004180577,0.000007632607,0.00001337157,0.0001612646,0.00006869039,0.9806583,0.005448363,0.01076616,0.002335443,0.00001087804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1202634,0.0003014666,0.8749192,0.0002913278,0.00004556264,0.00009719222,0.00004162936,0.0005899689,0.003450338],"genre_scores_gemma":[0.9443815,0.0002029242,0.05401833,0.00005549503,0.00002748663,0.00009331102,0.00004114188,0.0000268867,0.001152941],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.000879294,"threshold_uncertainty_score":0.004036486,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005811767,0.0004943779,0.0004514666,0.001034245,0.0005382756,0.0005238489,0.00111087,0.0002982176,0.001302744],"category_scores_gemma":[0.002376179,0.0002451784,0.0001891256,0.0006921276,0.0003672185,0.0008408501,0.000586435,0.0003523961,0.0003345014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005348024,"about_ca_system_score_gemma":0.0004994079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007729899,"about_ca_topic_score_gemma":0.0009477022,"domain_scores_codex":[0.9992393,0.0001522506,0.00004786676,0.0001213037,0.0003458253,0.00009350583],"domain_scores_gemma":[0.9982395,0.0006118772,0.0002161445,0.0004576922,0.0004039944,0.00007086094],"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.00139324,0.0003772502,0.005790938,0.0001483958,0.00005849904,0.0002704556,0.0001813314,0.06051073,0.2461699,0.009305882,0.004676115,0.6711172],"study_design_scores_gemma":[0.00003694458,0.0002150162,0.001487389,0.000009775113,0.00002244613,0.0003072172,0.00002968184,0.8357922,0.1567672,0.001938877,0.0033678,0.00002553844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1472041,0.0003476314,0.8471817,0.0001103683,0.00007423137,0.00007849358,0.00006510314,0.002903803,0.002034521],"genre_scores_gemma":[0.7886869,0.00006678577,0.2095057,0.00007038668,0.00004377237,0.00005236509,0.0001306844,0.0001371621,0.00130618],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001302744,"threshold_uncertainty_score":0.004358113,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001182446,0.0005706847,0.00084122,0.00109598,0.0006645164,0.0009326804,0.001330423,0.0006191886,0.0004268721],"category_scores_gemma":[0.002178204,0.0002434085,0.00033045,0.0006328971,0.0004599289,0.001121658,0.0003659403,0.0009681236,0.0002240273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001483833,"about_ca_system_score_gemma":0.001686812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002588964,"about_ca_topic_score_gemma":0.002824749,"domain_scores_codex":[0.9991285,0.00009960629,0.00005137836,0.00015473,0.0004641606,0.0001016528],"domain_scores_gemma":[0.9977351,0.0004759024,0.000330565,0.0003481584,0.0009394388,0.000170817],"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.001356823,0.0007394779,0.02120934,0.0002738106,0.0001179523,0.0004331709,0.0002844096,0.1387208,0.3030801,0.008387766,0.004989732,0.5204066],"study_design_scores_gemma":[0.00003526995,0.0004014186,0.002612336,0.00001065791,0.000035453,0.0003082463,0.00002733481,0.9385583,0.05374231,0.000934076,0.003291552,0.00004304316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1162622,0.0008265321,0.8787425,0.0002570589,0.0001942912,0.0002277474,0.00008595659,0.002473245,0.0009304123],"genre_scores_gemma":[0.756778,0.0004020821,0.2409495,0.0001986329,0.000166264,0.0001190137,0.0002431431,0.00009246275,0.001050922],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002588964,"threshold_uncertainty_score":0.01076597,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00232282,0.0003836266,0.0004400048,0.0007034912,0.0004115159,0.001077531,0.0008340449,0.000523063,0.0004828228],"category_scores_gemma":[0.0191307,0.0002284368,0.0001794893,0.000964322,0.0007787414,0.0008325902,0.0006816734,0.000793843,0.0001143173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009125281,"about_ca_system_score_gemma":0.0005806152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002271569,"about_ca_topic_score_gemma":0.001564836,"domain_scores_codex":[0.9977332,0.0006283931,0.0001085263,0.0003151477,0.001003212,0.0002115285],"domain_scores_gemma":[0.9874686,0.007079687,0.001821653,0.001143044,0.002127938,0.0003591285],"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.002238523,0.0002977905,0.06702343,0.0002487111,0.0002852718,0.001446963,0.0005497266,0.7990102,0.04517309,0.007840693,0.002704144,0.0731815],"study_design_scores_gemma":[0.00003096383,0.0006160244,0.02294347,0.00002440892,0.00008081654,0.0006429626,0.0001043574,0.9570387,0.01392418,0.002661031,0.001873006,0.0000600464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9347693,0.0009320021,0.06045069,0.0001980113,0.00009556871,0.00005966653,0.0001836749,0.0006539443,0.00265704],"genre_scores_gemma":[0.9974588,0.00005616219,0.002241998,0.00001826785,0.00001366566,0.00001121423,0.00006018655,0.00002181043,0.0001178964],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00232282,"threshold_uncertainty_score":0.0122844,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002591779,0.0015456,0.0007277895,0.001902163,0.0005746048,0.001661506,0.001226641,0.0006212596,0.002515184],"category_scores_gemma":[0.009171503,0.0003577939,0.0006814084,0.001044878,0.0004983461,0.002582724,0.0007854002,0.0008162989,0.0004963242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00166821,"about_ca_system_score_gemma":0.001564766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005477269,"about_ca_topic_score_gemma":0.002709521,"domain_scores_codex":[0.9974878,0.0005850858,0.0001452025,0.0004660376,0.001031775,0.0002840602],"domain_scores_gemma":[0.9964595,0.001487327,0.0003691686,0.0004157612,0.001163325,0.0001049338],"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.0002853673,0.00009508222,0.006085425,0.0001191717,0.00005201671,0.00006615734,0.000139392,0.9333028,0.006614621,0.007301719,0.001202371,0.04473592],"study_design_scores_gemma":[0.00001001818,0.00007123786,0.0005857747,0.000006812039,0.0000203153,0.0000294039,0.00002055106,0.9954111,0.002266032,0.001036045,0.0005328528,0.000009904843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09221713,0.0003898547,0.8967985,0.0002403351,0.00006494926,0.0004154833,0.0003565877,0.002358872,0.007158211],"genre_scores_gemma":[0.9143428,0.0004577232,0.08066711,0.00004673846,0.00002529409,0.0006745255,0.0007627567,0.0002249614,0.002798059],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005477269,"threshold_uncertainty_score":0.0137068,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008556311,0.0006697505,0.0006603244,0.0008052737,0.0004681368,0.0006179455,0.0008099538,0.0007345063,0.001030563],"category_scores_gemma":[0.003097407,0.0002693697,0.0003962732,0.001100959,0.0006119731,0.001050658,0.001028784,0.0008394567,0.0003798797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004297241,"about_ca_system_score_gemma":0.001175474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00213678,"about_ca_topic_score_gemma":0.002245428,"domain_scores_codex":[0.9990137,0.0003020862,0.00003982952,0.0001307141,0.0004230947,0.00009056884],"domain_scores_gemma":[0.9988236,0.0004926808,0.0001090033,0.0001714032,0.0003694135,0.00003391106],"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.0007363731,0.0001240651,0.001370435,0.0002663088,0.0001737221,0.0004423494,0.0003731494,0.3355463,0.07285572,0.1082767,0.002522437,0.4773125],"study_design_scores_gemma":[0.00003005462,0.0001016103,0.0002472851,0.00001280417,0.00002908344,0.0002529908,0.00001755768,0.953876,0.03286903,0.009962661,0.002570799,0.00003017455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01620629,0.0002317053,0.9815552,0.00007078942,0.00004592293,0.00005584444,0.00002917489,0.0002712464,0.001533878],"genre_scores_gemma":[0.553319,0.0003779165,0.4410181,0.00008663964,0.00008351345,0.0001693542,0.0001282423,0.00004917126,0.004767997],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00213678,"threshold_uncertainty_score":0.004525006,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}