{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1526,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":1526,"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":"5edaa165112a","filters":{"topic":"Wireless Communication Networks Research"}},"results":[{"id":"W2042519026","doi":"10.1109/pimrc.2013.6666156","title":"Sparse code multiple access","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1293,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Codebook; Computer science; Code word; Code division multiple access; Algorithm; Code (set theory); Quadrature amplitude modulation; QAM; Heuristic; Multiplexing; Theoretical computer science; Set (abstract data type); Computer engineering; Decoding methods; Bit error rate; Telecommunications; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.08173974885336378,"gpt":0.3325771200439259,"spread":0.2508373711905622,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001602685,0.00006404051,0.00007243983,0.00006466408,0.00009974886,0.0006206294,0.003776875,0.00003313608,0.000476747],"category_scores_gemma":[0.00005175774,0.00005257127,0.00002532841,0.000383763,0.00004019239,0.001305005,0.001785581,0.0001358018,0.001786889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002137095,"about_ca_system_score_gemma":0.00003548119,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003592791,"about_ca_topic_score_gemma":0.0001207331,"domain_scores_codex":[0.9990985,0.0000840852,0.0001292902,0.0001978105,0.0002385229,0.0002517313],"domain_scores_gemma":[0.9981285,0.0002544914,0.00002863803,0.001332124,0.0001422332,0.0001139994],"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.000003289213,0.0002824035,0.03738857,0.00001484892,0.00003075261,0.000005600854,0.0003932973,0.003884763,0.001973525,0.1654885,0.3285968,0.4619376],"study_design_scores_gemma":[0.0001637781,0.000008632383,0.02573858,0.000004126789,2.440756e-7,0.000002111889,0.000006982521,0.9542658,0.001383704,0.002018418,0.01630941,0.00009815428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0247934,0.00007441194,0.9177107,0.009852824,0.0001149343,0.0003590943,3.900861e-7,0.0004206518,0.04667363],"genre_scores_gemma":[0.9498433,0.00003744132,0.0467185,0.0005350774,0.00002534684,0.00008256178,0.000001278277,0.000005638318,0.002750824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9503811,"threshold_uncertainty_score":0.9989904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973473949","doi":"10.1109/mwc.2002.1043857","title":"An overview of scheduling algorithms in wireless multimedia networks","year":2002,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":362,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Scheduling (production processes); Time division multiple access; Quality of service; Jitter; Wireless network; Round-robin scheduling; Network packet; Fair-share scheduling; Wireless; Distributed computing; Algorithm; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.1390963759028425,"gpt":0.3654904477131586,"spread":0.2263940718103161,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001155241,0.00030885,0.000557874,0.0004819541,0.0003752146,0.0001892311,0.01142443,0.0002503264,0.00004112286],"category_scores_gemma":[0.00004879445,0.000342327,0.0001409332,0.002573089,0.0005120574,0.001203673,0.001394079,0.001126874,0.00005511021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001508943,"about_ca_system_score_gemma":0.00008822485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000280679,"about_ca_topic_score_gemma":0.0004637964,"domain_scores_codex":[0.9958379,0.001295977,0.001033281,0.0005555045,0.0006009369,0.0006764021],"domain_scores_gemma":[0.9886737,0.00114831,0.0003834338,0.009119873,0.000402466,0.0002722245],"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.00001068957,0.003012331,0.006441141,0.00008478254,0.00008598806,0.00001147348,0.003950193,0.0697877,0.003555344,0.0922657,0.0003000702,0.8204946],"study_design_scores_gemma":[0.0005768313,0.00004910481,0.002756072,0.0002306983,0.000005998986,0.000008072802,0.00008916301,0.9948314,0.0004535715,0.0002680279,0.0003995343,0.0003315681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1431622,0.02823341,0.8177592,0.004841635,0.0006222491,0.001569626,0.00002358328,0.0008249907,0.002963178],"genre_scores_gemma":[0.8791028,0.02207248,0.09833298,0.000126704,0.00005534037,0.0001977353,0.00002762422,0.00004109494,0.00004330039],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9250436,"threshold_uncertainty_score":0.9999029,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108088366","doi":"10.1109/comst.2005.1423334","title":"Call admission control in wireless networks: A comprehensive survey","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":274,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer network; Computer science; Call Admission Control; Quality of service; Wireless network; Handover; Radio resource management; Wireless; Provisioning; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.07636075998898414,"gpt":0.3454329390672601,"spread":0.269072179078276,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.01248386,0.0004057025,0.0008026892,0.0004407145,0.0005885268,0.0004348215,0.01044176,0.0003254689,0.00002590916],"category_scores_gemma":[0.0006777867,0.0004229601,0.0001474946,0.002299082,0.0004214921,0.001039004,0.001785485,0.001129366,0.0001870568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004642909,"about_ca_system_score_gemma":0.0005141007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002493475,"about_ca_topic_score_gemma":0.01043132,"domain_scores_codex":[0.9742356,0.02202932,0.001385107,0.0007073154,0.0007485561,0.0008940779],"domain_scores_gemma":[0.9785053,0.01075829,0.0004470191,0.00876755,0.001156056,0.0003657564],"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.0003727353,0.006071105,0.1465424,0.00008302393,0.0005881,0.00003437655,0.003994335,0.20129,0.01234261,0.04511726,0.07789066,0.5056735],"study_design_scores_gemma":[0.002420944,0.00006647403,0.1675158,0.0001271923,0.00000876074,0.000009178434,0.0000206986,0.7822394,0.0001908922,0.0001908193,0.04652858,0.0006812016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04733909,0.005743494,0.9306759,0.008848752,0.002333796,0.00230581,0.00008924278,0.0007627644,0.001901209],"genre_scores_gemma":[0.9872348,0.002742401,0.008439371,0.0004493208,0.0003907518,0.0003013334,0.000140561,0.00004891289,0.0002525299],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9398957,"threshold_uncertainty_score":0.9998222,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163076848","doi":"10.1109/65.871336","title":"Location management for next-generation personal communications networks","year":2000,"lang":"en","type":"article","venue":"IEEE Network","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":246,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Paging; Computer science; Software deployment; Computer network; Terminal (telecommunication); Next-generation network; Personal Communications Service; Distributed computing; Telecommunications; Wireless; Wireless network; The Internet; World Wide Web; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.08950082178500111,"gpt":0.3118761744615526,"spread":0.2223753526765515,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008035724,0.0001816607,0.0001724797,0.00007319194,0.0008585474,0.0004394656,0.002843,0.0001152746,0.00003385183],"category_scores_gemma":[0.000006887794,0.0001970957,0.00009319645,0.001077502,0.0001095997,0.0006169698,0.0002665081,0.0002732681,0.0001118257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001201428,"about_ca_system_score_gemma":0.00005252243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001210529,"about_ca_topic_score_gemma":0.0000602427,"domain_scores_codex":[0.9980059,0.0002924001,0.0003779505,0.0004277628,0.0003365537,0.0005594146],"domain_scores_gemma":[0.9969052,0.0003054897,0.00009817506,0.002339802,0.0002206041,0.0001307334],"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.00002458646,0.0001108869,0.00003864472,0.000017093,0.00005795186,8.967678e-7,0.0002016921,0.4752515,0.000021695,0.02723671,0.1279069,0.3691314],"study_design_scores_gemma":[0.0003047766,0.00003692173,0.0003225722,0.00004311233,0.00000952869,0.000003575736,0.000008445457,0.8807293,0.000008514923,0.001162357,0.1171854,0.0001854297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008740703,0.003437601,0.9816545,0.003640111,0.001232087,0.001093802,0.000001422276,0.0003232232,0.007743148],"genre_scores_gemma":[0.8894122,0.003299967,0.09836064,0.001169664,0.003635206,0.0009349348,0.0001287319,0.00003818391,0.003020498],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8885381,"threshold_uncertainty_score":0.8037331,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2171430095","doi":"10.1109/icupc.1993.528528","title":"Performance of orthogonal CDMA codes for quasi-synchronous communication systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":183,"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":"Synchronization (alternating current); Code division multiple access; Computer science; Hadamard transform; Gold code; Algorithm; Hadamard code; Bit error rate; Sequence (biology); Set (abstract data type); Synchronous CDMA; Theoretical computer science; Interference (communication); Spread spectrum; Mathematics; Telecommunications; Multiuser detection; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.04626192763673607,"gpt":0.2815107729142237,"spread":0.2352488452774876,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006357298,0.00009339198,0.0001839549,0.000101906,0.0002055509,0.00009336622,0.002317587,0.00005961116,0.00003821534],"category_scores_gemma":[0.00003646262,0.0000847395,0.0000525327,0.0003632836,0.0001085916,0.000427519,0.0004268801,0.0001294913,0.00003880652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000481779,"about_ca_system_score_gemma":0.00003466355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003684617,"about_ca_topic_score_gemma":0.00001866785,"domain_scores_codex":[0.9987417,0.0001753884,0.0003524608,0.0001836475,0.0003056838,0.0002410904],"domain_scores_gemma":[0.9971598,0.0005630808,0.000145499,0.001741601,0.0003274705,0.00006257113],"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.00003443813,0.0009610526,0.009931706,0.0003491551,0.00009657854,5.715763e-7,0.00155155,0.02724866,0.0006622697,0.7069386,0.01461811,0.2376073],"study_design_scores_gemma":[0.0002463054,0.0001482135,0.001105562,0.00004627445,0.00000185778,0.000005796458,0.00002932611,0.9945778,0.0002474348,0.00005868241,0.003435664,0.00009711273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2209793,0.003842063,0.7524706,0.001870177,0.0001621475,0.001053848,0.000008158281,0.0002822645,0.01933137],"genre_scores_gemma":[0.9557444,0.0008908256,0.04227111,0.0000294752,0.00002122176,0.0001368372,0.000007838024,0.000008645163,0.0008895718],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9673291,"threshold_uncertainty_score":0.4306692,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1596747665","doi":"10.1109/vetec.1996.503446","title":"Probability distribution of channel holding time in cellular telephony systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":179,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Log-normal distribution; Channel (broadcasting); Telephony; Computer science; Exponential distribution; Exponential function; Probability distribution; Cellular radio; Computer network; Mathematics; Statistics; Mathematical analysis; Base station","retraction":null,"screen_n_in":null,"score":{"opus":0.05512437988348634,"gpt":0.2409251353221893,"spread":0.185800755438703,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007943223,0.00007505425,0.0001571311,0.00007219301,0.00004799191,0.00006542947,0.001105477,0.00005963417,0.00003464],"category_scores_gemma":[0.00006596429,0.00006874446,0.00003280197,0.0007853546,0.00005508492,0.0002928944,0.0004138787,0.0001510058,0.00007839203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001136362,"about_ca_system_score_gemma":0.00001555677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001215481,"about_ca_topic_score_gemma":0.00000604618,"domain_scores_codex":[0.998663,0.0002481526,0.0003092863,0.0002311712,0.0003055089,0.000242896],"domain_scores_gemma":[0.9986122,0.0001564,0.00007307191,0.0009874331,0.0001152206,0.00005572282],"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.00004304677,0.005084761,0.01728512,0.001080967,0.0001131438,0.00005523676,0.006012064,0.313241,0.060942,0.4642097,0.0327814,0.09915148],"study_design_scores_gemma":[0.0001326518,0.00002148811,0.001255164,0.00003500811,4.202874e-7,0.000001488849,0.000008874084,0.9954684,0.002270109,0.0004047583,0.0003275539,0.0000740781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3665562,0.001036659,0.6248634,0.001188939,0.0001229143,0.0007802407,0.000005274163,0.0001998889,0.005246477],"genre_scores_gemma":[0.9982275,0.00003641159,0.001213267,0.000005206553,0.00001494109,0.00003110171,0.000006447691,0.00000382171,0.000461267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6822274,"threshold_uncertainty_score":0.2803318,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092585135","doi":"10.1002/wcm.246","title":"Call admission control in mobile cellular networks: a comprehensive survey","year":2005,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":158,"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; Handover; Call Admission Control; Reservation; Quality of service; Cellular network; Computer network; Context (archaeology); Key (lock); Prioritization; Service (business); Admission control; Control (management); Wireless network; Wireless; Telecommunications; Artificial intelligence; Computer security; Management science","retraction":null,"screen_n_in":null,"score":{"opus":0.03063374075431031,"gpt":0.3055013583557952,"spread":0.2748676176014849,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001559938,0.0003081755,0.0005110834,0.0002895712,0.000723916,0.0003320437,0.004061251,0.0001784404,0.00000777599],"category_scores_gemma":[0.00003827528,0.0003207788,0.00008381959,0.00112152,0.0002970368,0.0004525665,0.003403104,0.0009265612,0.00001912005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001573821,"about_ca_system_score_gemma":0.0001352026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003470758,"about_ca_topic_score_gemma":0.0005154142,"domain_scores_codex":[0.9958178,0.001766563,0.0008151158,0.0006013981,0.000332895,0.000666249],"domain_scores_gemma":[0.9926533,0.002548449,0.0002718478,0.003851929,0.0003950223,0.0002794867],"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.0000272391,0.0006954125,0.01706477,0.00003207463,0.00004692888,0.000006000543,0.001955611,0.1730252,0.001189829,0.003496286,0.0005614758,0.8018991],"study_design_scores_gemma":[0.001001964,0.00008382505,0.009787212,0.0001316013,0.000003948639,0.00001048559,0.000107863,0.9614246,0.00004718008,0.00002527985,0.02705352,0.0003225033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3962776,0.03119146,0.569124,0.000949701,0.0001150037,0.001570541,0.000009546208,0.0003393052,0.0004228571],"genre_scores_gemma":[0.977553,0.005333137,0.01628135,0.0003510155,0.00006616812,0.0002694462,0.00006119751,0.0000328525,0.00005184071],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8015767,"threshold_uncertainty_score":0.9999244,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061555057","doi":"10.1109/mnet.2005.1509947","title":"Resource management for QoS support in cellular/WLAN interworking","year":2005,"lang":"en","type":"article","venue":"IEEE Network","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":150,"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; Quality of service; Call Admission Control; Admission control; Resource management (computing); Resource allocation; Wireless network; Mobility management; Cellular network; Wireless; Provisioning; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03433723377642627,"gpt":0.292508955248031,"spread":0.2581717214716047,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001181372,0.000155808,0.0001928731,0.0001525448,0.0001594618,0.000184054,0.002308354,0.00008066908,0.00001193041],"category_scores_gemma":[0.000006857134,0.0001651371,0.00008177203,0.0007590003,0.00004250816,0.0002262056,0.0005953311,0.0003057116,0.00008626185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001485963,"about_ca_system_score_gemma":0.00002811564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004702124,"about_ca_topic_score_gemma":0.00009920383,"domain_scores_codex":[0.9979571,0.0001680771,0.0003919834,0.0004314099,0.0003261658,0.0007252853],"domain_scores_gemma":[0.9981706,0.0002907424,0.00009407495,0.001293447,0.00004181411,0.0001093535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008264437,0.00018862,0.001002476,0.00005050153,0.00005491562,0.0000403791,0.0008649297,0.2084516,0.00008196977,0.02902962,0.4097659,0.3503864],"study_design_scores_gemma":[0.000493936,0.00004187848,0.0003986577,0.00009570652,0.000002355861,0.000003020488,0.00002032769,0.2458667,0.0001341731,0.001120243,0.7516251,0.0001979091],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003621756,0.0006859298,0.944124,0.005442273,0.002218161,0.00128495,0.0000011657,0.0003482738,0.0422735],"genre_scores_gemma":[0.9187834,0.000107524,0.07157371,0.001191392,0.004671989,0.0003079949,0.00001430793,0.00003781152,0.003311912],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9151616,"threshold_uncertainty_score":0.6734095,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090709584","doi":"10.1109/jsac.2012.120222","title":"A Distributed Multi-Service Resource Allocation Algorithm in Heterogeneous Wireless Access Medium","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":135,"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; Multihoming; Base station; Computer network; Wireless network; Resource allocation; Radio resource management; Wireless; Algorithm; Bandwidth (computing); Heterogeneous network; Distributed computing; Telecommunications; The Internet","retraction":null,"screen_n_in":null,"score":{"opus":0.08049653532620309,"gpt":0.358224660653129,"spread":0.2777281253269259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002081509,0.0003015486,0.0003797596,0.0008761748,0.0004746479,0.0005294643,0.01012918,0.0002246264,0.0000109935],"category_scores_gemma":[0.0003009498,0.0003081213,0.0000776845,0.00537176,0.0001242428,0.001525126,0.001394702,0.002330007,0.00004837163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008484905,"about_ca_system_score_gemma":0.0004077679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001973905,"about_ca_topic_score_gemma":0.001641094,"domain_scores_codex":[0.9944311,0.002548628,0.001004618,0.0003407638,0.0007568931,0.0009180107],"domain_scores_gemma":[0.9931328,0.001432642,0.0004571902,0.00371032,0.0008518996,0.0004151319],"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.0004113943,0.02879155,0.1278472,0.0001433144,0.0006530216,0.0001683441,0.02121394,0.1820224,0.007980604,0.01319364,0.01319074,0.6043839],"study_design_scores_gemma":[0.00171016,0.0000692154,0.06767354,0.0003545382,0.000009937125,0.0003188381,0.0001119872,0.9187505,0.001305306,0.0002540781,0.008921828,0.0005200821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1465683,0.003623233,0.8044815,0.04160332,0.0007354808,0.001565993,0.00004838796,0.0005175723,0.0008562626],"genre_scores_gemma":[0.9670189,0.001612327,0.03016264,0.0007095917,0.0001312498,0.0001877092,0.0001108151,0.00003958375,0.0000272042],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8204506,"threshold_uncertainty_score":0.9999717,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1497754119","doi":"10.1109/jsac.2015.2435451","title":"Stochastic Geometric Analysis of User Mobility in Heterogeneous Wireless Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":133,"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; Bell Canada Enterprises","keywords":"Computer science; Handover; Wireless network; Computer network; Stochastic geometry; Correctness; Network topology; Overhead (engineering); Wireless; Heterogeneous network; Randomness; Mobility model; Distributed computing; Algorithm; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.06691783397807413,"gpt":0.3370538354872839,"spread":0.2701360015092098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["bibliometrics","open_science"],"consensus_categories":[],"category_scores_codex":[0.002616305,0.0002137654,0.0006100903,0.003642912,0.0001850744,0.000175027,0.006516626,0.0001668832,0.000009375942],"category_scores_gemma":[0.0005936524,0.0002127765,0.0001588424,0.02188812,0.0001936095,0.0004094879,0.0007644729,0.001730844,0.000006658884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007059091,"about_ca_system_score_gemma":0.0004885044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001946,"about_ca_topic_score_gemma":0.001956783,"domain_scores_codex":[0.9952022,0.002044346,0.001140207,0.0003287302,0.0007680126,0.0005164383],"domain_scores_gemma":[0.9913641,0.002350607,0.0005060931,0.004215835,0.001255576,0.0003078003],"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.00003977623,0.00113878,0.01410107,0.00000232384,0.0002059676,0.000007158658,0.0003990731,0.9758408,0.00003038115,0.001028131,0.0001523058,0.00705425],"study_design_scores_gemma":[0.0006278055,0.0001154538,0.05878992,0.00007128362,0.00004046805,0.00002938768,0.00003738861,0.9396508,0.00003702204,0.000322874,0.00009157998,0.0001860566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5478785,0.001562582,0.4484548,0.001166173,0.000163127,0.0003933133,0.000006077246,0.00007151947,0.0003038906],"genre_scores_gemma":[0.9941773,0.0009635013,0.004647728,0.00007461096,0.00002550676,0.00005907718,0.00001690446,0.00001759443,0.00001778767],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4462988,"threshold_uncertainty_score":0.9989021,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114369809","doi":"10.1109/7693.975440","title":"Accurate DS-CDMA bit-error probability calculation in Rayleigh fading","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":128,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Rayleigh fading; Bit error rate; Fading; Algorithm; Asynchronous communication; Spread spectrum; Expression (computer science); Mathematics; Computer science; Sequence (biology); Code division multiple access; Gaussian; Interference (communication); Binary number; Telecommunications; Decoding methods; Channel (broadcasting); Physics; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.1065534400891797,"gpt":0.3259711737384159,"spread":0.2194177336492362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008721174,0.0003368206,0.0003813314,0.0006990071,0.001054051,0.0003089761,0.005375145,0.0002316984,0.0001186235],"category_scores_gemma":[0.00003515301,0.0003646966,0.0001897085,0.002843864,0.0003717035,0.001344384,0.0000979526,0.001390767,0.0003067105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005073517,"about_ca_system_score_gemma":0.00009694214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002349365,"about_ca_topic_score_gemma":0.001302091,"domain_scores_codex":[0.9959932,0.001207532,0.0008859956,0.0006669896,0.0006041532,0.0006421449],"domain_scores_gemma":[0.991206,0.00124127,0.0002095062,0.006823667,0.0003008713,0.0002186298],"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.00005523513,0.005833451,0.0008650669,0.0001008043,0.0001634742,0.0000123759,0.008253478,0.412256,0.00308888,0.05443329,0.001007164,0.5139308],"study_design_scores_gemma":[0.0006888059,0.00005532703,0.001314718,0.0001106576,0.000009337966,0.00001099326,0.00005071405,0.99376,0.00114165,0.0007558506,0.001712924,0.0003890262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02751155,0.0003137621,0.9578263,0.009551705,0.0002396005,0.001045375,0.00001753678,0.0005561113,0.002938098],"genre_scores_gemma":[0.9758192,0.001123328,0.02163421,0.0001820975,0.00001832851,0.0007023077,0.00001081552,0.00003938291,0.0004703829],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9483076,"threshold_uncertainty_score":0.9998805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117340361","doi":"10.1109/49.957309","title":"An adaptive distance-based location update algorithm for next-generation PCS networks","year":2001,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Paging; Base station; Mobility model; Network topology; Boundary (topology); Algorithm; Bandwidth (computing); Wireless network; Cellular network; Path (computing); Wireless; Computer network; Real-time computing; Distributed computing; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.09890229836677501,"gpt":0.338317888648,"spread":0.239415590281225,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001385171,0.0002580865,0.0002815098,0.0005263396,0.001168808,0.0007656788,0.004998919,0.0001793558,0.000008843725],"category_scores_gemma":[0.0001446128,0.000265555,0.00008664627,0.003093096,0.0001457902,0.001463273,0.0001483556,0.001255343,0.00001278902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006095603,"about_ca_system_score_gemma":0.0005878562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002515571,"about_ca_topic_score_gemma":0.0006408645,"domain_scores_codex":[0.9963182,0.001457406,0.0007591271,0.0003983045,0.000506494,0.000560526],"domain_scores_gemma":[0.9930361,0.0009604968,0.0004383153,0.003393138,0.001905839,0.0002661436],"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.0001044189,0.001294972,0.000436039,0.000003463635,0.00005036759,0.000006349402,0.0002419279,0.5193081,0.0005306226,0.01900178,0.002478636,0.4565433],"study_design_scores_gemma":[0.0008942584,0.0003266994,0.001224963,0.00009929389,0.000008768367,0.00003619744,0.0000286555,0.9902336,0.0001954806,0.00097969,0.005694579,0.0002777987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001900609,0.0009727105,0.9914196,0.004484826,0.0002660099,0.0006155949,0.000007291001,0.000155148,0.0001782386],"genre_scores_gemma":[0.7741154,0.002327901,0.2222282,0.0005379982,0.0002938403,0.0002658215,0.000171836,0.0000325685,0.00002639864],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7722148,"threshold_uncertainty_score":0.9999797,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980494386","doi":"10.1007/s10291-014-0407-3","title":"Spoofing detection, classification and cancelation (SDCC) receiver architecture for a moving GNSS receiver","year":2014,"lang":"en","type":"article","venue":"GPS Solutions","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Spoofing attack; GNSS applications; Computer science; Artificial intelligence; Interference (communication); Computer vision; Global Positioning System; Computer security; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.04571485214876148,"gpt":0.2792750269741458,"spread":0.2335601748253843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007305762,0.0001169864,0.0001197652,0.0001920858,0.0009773833,0.0001730616,0.0005348453,0.0001054377,0.00000532009],"category_scores_gemma":[0.0003025305,0.0001231694,0.00004901455,0.0005240258,0.0001018943,0.0004131576,0.0002160405,0.0002644343,0.00001319978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001516172,"about_ca_system_score_gemma":0.00007046535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009191343,"about_ca_topic_score_gemma":0.0005454451,"domain_scores_codex":[0.998591,0.000237689,0.0002265908,0.0003809791,0.000212123,0.0003516276],"domain_scores_gemma":[0.9982789,0.0005000707,0.0001197127,0.0007438701,0.0002547488,0.0001026856],"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.00002692664,0.00006471816,0.001062116,0.00004691041,0.00003699685,2.414689e-7,0.002046028,0.02103284,0.01393902,0.1418725,0.002112827,0.8177589],"study_design_scores_gemma":[0.0003257582,0.00004342487,0.03342203,0.00003490131,0.000008066077,0.000008634071,0.00004029557,0.9219553,0.0002713656,0.01262882,0.03108863,0.0001727173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009101512,0.0002013693,0.9846946,0.004082566,0.0001809086,0.0003907529,0.000004207071,0.0001883854,0.001155719],"genre_scores_gemma":[0.9568073,0.00009851705,0.04235695,0.0001009188,0.000139621,0.0001898154,0.00001426251,0.00001366276,0.0002789585],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9477058,"threshold_uncertainty_score":0.7517341,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143040511","doi":"10.1109/tvt.2009.2037507","title":"Application of Mobility Prediction in Wireless Networks Using Markov Renewal Theory","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Wireless network; Quality of service; Computer network; Markov chain; Markov process; Reservation; Cellular network; Wireless; Bandwidth (computing); Markov model; Mobility model; Radio resource management; Distributed computing; Machine learning; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01207991407456789,"gpt":0.2644405576527293,"spread":0.2523606435781615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007546068,0.0001553172,0.0002495003,0.0007061963,0.0001424877,0.00002133126,0.001187656,0.0003998427,0.000005596485],"category_scores_gemma":[0.000008239727,0.0001664721,0.00008147261,0.002180682,0.0002017392,0.0002204574,0.00001222615,0.0007015417,0.000003758993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001916907,"about_ca_system_score_gemma":0.00006456015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003575939,"about_ca_topic_score_gemma":0.00003674329,"domain_scores_codex":[0.9982164,0.0002894995,0.000452015,0.0004532114,0.000265858,0.000323002],"domain_scores_gemma":[0.9979271,0.0001327631,0.0001326731,0.001614614,0.0001442534,0.00004865627],"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.00005589062,0.0006477608,0.0002934084,0.000009776868,0.00002140077,0.00000366833,0.00005441007,0.493448,0.0196689,0.01906038,0.000004066959,0.4667324],"study_design_scores_gemma":[0.0003489753,0.0001414652,0.0008760248,0.00004117523,0.000007196564,0.00001708167,0.0000226274,0.9642409,0.02557978,0.008585657,0.000019896,0.0001191863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1597306,0.0001082219,0.8388545,0.0005021773,0.00007985727,0.0003796615,0.00000242322,0.0002726532,0.00006992544],"genre_scores_gemma":[0.9895754,0.00009838799,0.01016265,0.00003980006,0.00001198248,0.00008562396,0.000002258195,0.00001041092,0.00001344107],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8298448,"threshold_uncertainty_score":0.6788535,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976526421","doi":"10.1049/el.2009.3330","title":"Efficient computation of DFT of Zadoff-Chu sequences","year":2009,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","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 British Columbia","funders":"","keywords":"Sequence (biology); Discrete Fourier transform (general); Computation; Algorithm; Prime (order theory); Fast Fourier transform; Computer science; Arithmetic; Mathematics; Fourier analysis; Fourier transform; Combinatorics; Fractional Fourier transform; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01279726512769633,"gpt":0.273856390635857,"spread":0.2610591255081607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004434784,0.00008930869,0.0001656508,0.0001537108,0.0000573027,0.00002935569,0.001158034,0.00003590144,0.000002302608],"category_scores_gemma":[0.0000238098,0.0000882846,0.00006098012,0.0006698107,0.00008869026,0.00008364427,0.00009967598,0.0002102895,0.000004538101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008914688,"about_ca_system_score_gemma":0.0001245882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001114892,"about_ca_topic_score_gemma":0.000003175988,"domain_scores_codex":[0.9985799,0.000151762,0.0003002618,0.000198342,0.0004548947,0.0003148092],"domain_scores_gemma":[0.9989622,0.000132535,0.0001902191,0.0005519062,0.0001212715,0.00004189226],"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.00001836791,0.0002010711,0.0001790975,0.00002549419,0.00003252979,0.000003135088,0.0008220256,0.58265,0.2341323,0.1015074,0.001244824,0.07918378],"study_design_scores_gemma":[0.0003154198,0.0002825156,0.003007452,0.00004743943,0.000004063606,0.000006394133,0.000009497285,0.9562211,0.03727962,0.002438426,0.0002327861,0.0001552771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4917583,0.001008172,0.4964447,0.01016181,0.00004688908,0.0001506519,5.009173e-7,0.00005395814,0.0003749969],"genre_scores_gemma":[0.9866313,0.00004953941,0.01283651,0.0004520254,0.00001488893,0.000002811993,0.0000024878,0.000004223527,0.000006164785],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.494873,"threshold_uncertainty_score":0.3600141,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1843871604","doi":"","title":"Modeling and Characterization of Traffic in Public Safety Wireless Networks","year":2006,"lang":"en","type":"article","venue":"Summit (Simon Fraser University)","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Weibull distribution; Computer network; Erlang (programming language); Uncorrelated; Autocorrelation; Log-normal distribution; Computer science; Engineering; Telecommunications; Statistics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01700713796398249,"gpt":0.2102118052051963,"spread":0.1932046672412138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002583736,0.0001094982,0.0001762591,0.0004930248,0.0001277998,0.0000715146,0.000946864,0.0001073016,0.000005288731],"category_scores_gemma":[0.000005367086,0.0001314265,0.0000349608,0.001595857,0.00007643903,0.0008620127,0.0004156005,0.0002277381,0.000001534534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009455111,"about_ca_system_score_gemma":0.0000658831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001244964,"about_ca_topic_score_gemma":0.01270088,"domain_scores_codex":[0.9988453,0.0002015352,0.0002197499,0.0002866455,0.0001731306,0.0002736825],"domain_scores_gemma":[0.9991428,0.00007461187,0.00007853818,0.0005051464,0.0001272758,0.00007163151],"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.0000629095,0.0002602078,0.1293944,0.0000327791,0.00002024645,0.00003547336,0.00004887193,0.7355894,0.0001173123,0.07537436,0.00008981662,0.05897417],"study_design_scores_gemma":[0.0004777782,0.00001457779,0.003365125,0.00002953272,0.000002210251,7.148926e-9,0.0001850383,0.9943098,0.00004230056,0.00004776878,0.001402952,0.0001228638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7096601,0.00004573458,0.2892874,0.0003386711,0.00003024065,0.00011302,0.000002085388,0.00005478312,0.0004679466],"genre_scores_gemma":[0.9988215,0.0003718037,0.0005859291,0.00001529913,0.00002072467,6.534984e-7,0.00003812789,0.000008224384,0.0001377327],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2891614,"threshold_uncertainty_score":0.7087388,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097962411","doi":"10.1109/mwc.2002.998522","title":"Dynamic bandwidth allocation with fair scheduling for WCDMA systems","year":2002,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Government of Canada; Australian Government","keywords":"Computer science; Computer network; Scheduling (production processes); Code division multiple access; Quality of service; Broadband networks; Network packet; W-CDMA; Bandwidth (computing); Exploit; Bandwidth allocation; Wireless; Wireless network; Broadband; Distributed computing; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.0550840306179374,"gpt":0.2986498327629833,"spread":0.2435658021450459,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006426036,0.0002572119,0.000309143,0.0002698158,0.001086584,0.00054831,0.006965199,0.0001436419,0.000008197356],"category_scores_gemma":[0.00004992324,0.0002499485,0.00009525081,0.001130902,0.0003002633,0.0008728348,0.0006458135,0.0004978959,0.00009930831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002079528,"about_ca_system_score_gemma":0.0001075251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005801988,"about_ca_topic_score_gemma":0.0001772347,"domain_scores_codex":[0.9975309,0.0004248046,0.000530695,0.0004873693,0.0004833075,0.0005429348],"domain_scores_gemma":[0.9910068,0.001090238,0.0002832663,0.006780505,0.0006514418,0.0001877632],"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.00005453885,0.001909849,0.0009045504,0.0003330162,0.0004743352,0.000005294579,0.004982989,0.1779202,0.006209506,0.5925928,0.005170192,0.2094427],"study_design_scores_gemma":[0.0006095102,0.00008085386,0.0001709785,0.0001483891,0.00001325099,0.00002096392,0.000137747,0.9905466,0.0001722069,0.0003040005,0.007477391,0.0003180479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009083885,0.002913033,0.9760173,0.007890845,0.0002138397,0.001165758,0.00001316497,0.0005539611,0.002148221],"genre_scores_gemma":[0.8682734,0.001620247,0.1280834,0.0001030548,0.00003309223,0.00119232,0.00004785453,0.00004586729,0.0006007898],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8591895,"threshold_uncertainty_score":0.9999953,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1507732015","doi":"10.1109/infcom.1998.662929","title":"A generalized processor sharing approach to time scheduling in hybrid CDMA/TDMA","year":2002,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":73,"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":"Time division multiple access; Computer science; Computer network; Scheduling (production processes); Quality of service; Code division multiple access; Power control; Wireless; Access control; Distributed computing; Power (physics); Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.06039456438375101,"gpt":0.2822135887274377,"spread":0.2218190243436867,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006009051,0.0001391238,0.0001976351,0.0002950557,0.0001156065,0.0003614907,0.003136938,0.00004262387,0.0001190553],"category_scores_gemma":[0.00008289534,0.0001316102,0.00004028501,0.001283539,0.00002424383,0.0005134659,0.001519494,0.0002796963,0.0006666254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000884586,"about_ca_system_score_gemma":0.00002622336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004307349,"about_ca_topic_score_gemma":0.000006784885,"domain_scores_codex":[0.9981264,0.000100504,0.0003045435,0.0005510405,0.0004142431,0.0005032989],"domain_scores_gemma":[0.9983214,0.00007347014,0.00004296677,0.001286023,0.00009842564,0.0001777823],"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.00004268073,0.002210262,0.003627879,0.0001800454,0.00008042492,0.00005400229,0.006905495,0.4917945,0.0070543,0.1964687,0.01631567,0.275266],"study_design_scores_gemma":[0.0003276504,0.0000142054,0.0001504642,0.00002390841,5.363543e-7,0.00001013276,0.000008148506,0.9968596,0.0007333088,0.0003562277,0.001340977,0.0001748794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1548108,0.0004395185,0.7676145,0.00389519,0.00004364728,0.000708126,5.288288e-7,0.0004751769,0.07201248],"genre_scores_gemma":[0.6697812,0.00002812237,0.3250431,0.0004140072,0.00004007275,0.0001390692,0.000002098153,0.00001486122,0.00453752],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5149704,"threshold_uncertainty_score":0.8568343,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126351019","doi":"10.1109/vetec.1992.245394","title":"Equalization for interference cancellation in spread spectrum multiple access systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Spread spectrum; Multipath propagation; Computer science; Fading; Interference (communication); Direct-sequence spread spectrum; Equalizer; Equalization (audio); Single antenna interference cancellation; Sequence (biology); Computer network; Electronic engineering; Code division multiple access; Telecommunications; Channel (broadcasting); Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0935303903317965,"gpt":0.3549115830983723,"spread":0.2613811927665758,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005836275,0.00008332796,0.0001159845,0.0001643407,0.0000735568,0.0003649543,0.001169694,0.00005146762,0.00001321551],"category_scores_gemma":[0.0002281562,0.00007998735,0.00002109669,0.0006367984,0.00001844637,0.0006814715,0.0001893405,0.00009175138,0.00001094609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001403712,"about_ca_system_score_gemma":0.00009277933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005943627,"about_ca_topic_score_gemma":0.002059069,"domain_scores_codex":[0.9988051,0.0002267342,0.000272082,0.0002651317,0.0001759691,0.0002549925],"domain_scores_gemma":[0.9985468,0.0005680628,0.00008041746,0.0006505566,0.00010517,0.00004898975],"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.0000120378,0.00007607393,0.02871712,0.00005437904,0.000006358528,6.582419e-7,0.000367249,0.09142582,0.0003888189,0.8722028,0.001126202,0.005622493],"study_design_scores_gemma":[0.0003618421,0.00002495577,0.002144032,0.00004168357,4.666351e-7,0.000001248428,0.00002804931,0.990179,0.00305523,0.00199996,0.002052084,0.0001114316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006354916,0.000176007,0.9877679,0.000386256,0.0002453329,0.0005927713,0.000001103369,0.00008329029,0.004392427],"genre_scores_gemma":[0.9929369,0.00005982806,0.006233898,0.00003592203,0.00001975274,0.000151325,0.00000785812,0.000007601273,0.000546904],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.986582,"threshold_uncertainty_score":0.3519262,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020519696","doi":"10.1016/s0012-365x(01)00162-5","title":"Complex Golay sequences: structure and applications","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge; University of Manitoba","funders":"","keywords":"Binary Golay code; Mathematics; Hadamard transform; Complementary sequences; Ternary Golay code; Combinatorics; Factorization; Hadamard matrix; Complex Hadamard matrix; Discrete mathematics; Autocorrelation; Algorithm; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05757504967536323,"gpt":0.3001317181726881,"spread":0.2425566684973249,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001244049,0.0001118034,0.0001426566,0.00006000996,0.0002049216,0.0002499043,0.001236432,0.00005009832,0.0001214895],"category_scores_gemma":[0.00002329713,0.00009339205,0.00002741069,0.0003719157,0.0001369262,0.0002301835,0.0004644665,0.0001677521,0.00006141086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002185078,"about_ca_system_score_gemma":0.000009149203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002899038,"about_ca_topic_score_gemma":0.000004729181,"domain_scores_codex":[0.9990317,0.00005245966,0.0002107399,0.000215448,0.0002761822,0.0002134491],"domain_scores_gemma":[0.9984376,0.000194137,0.00008349106,0.001116272,0.00006688118,0.000101602],"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":[3.362841e-7,0.00006232681,0.0001421809,0.0001210045,0.00002559037,0.000002246337,0.002852943,0.000254435,0.0008932722,0.9565495,0.002446344,0.03664981],"study_design_scores_gemma":[0.0001272784,0.00001627314,0.0002169336,0.00002413378,0.000004373942,0.00003324472,0.0001071646,0.930672,0.0001311709,0.05453284,0.01395309,0.0001814559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002979168,0.0005720885,0.9813405,0.002202935,0.00002058099,0.0004635461,0.00001567258,0.0002079059,0.01219766],"genre_scores_gemma":[0.7717472,0.0001675386,0.2274567,0.0001275987,0.00004077523,0.000056341,0.000008083143,0.00001218176,0.0003835718],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9304176,"threshold_uncertainty_score":0.3808417,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015650505","doi":"10.1007/s11036-005-4464-2","title":"Efficient QoS Provisioning for Adaptive Multimedia in Mobile Communication Networks by Reinforcement Learning","year":2005,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Reinforcement learning; Quality of service; Markov decision process; Computer network; Provisioning; Wireless network; Call Admission Control; Bandwidth (computing); Bandwidth allocation; Wireless; Handover; Distributed computing; Multimedia; Markov process; Artificial intelligence; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01202593828585021,"gpt":0.2769615978193788,"spread":0.2649356595335286,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009004754,0.0002149839,0.000248561,0.0001233646,0.0007106719,0.000217896,0.001156547,0.0001545467,0.00001007545],"category_scores_gemma":[0.00001701695,0.0002199591,0.00006300304,0.0007248268,0.0001381271,0.0001984411,0.0007010547,0.0006032279,0.000008022137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001603627,"about_ca_system_score_gemma":0.00004447587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003066543,"about_ca_topic_score_gemma":0.00003816908,"domain_scores_codex":[0.9979603,0.0001833003,0.0005407005,0.0005330496,0.0002413523,0.0005413404],"domain_scores_gemma":[0.9974083,0.00091356,0.0002244571,0.001109247,0.0001774563,0.0001669585],"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.000008766556,0.0001116526,0.0000813332,0.000004065482,0.000007204563,5.391412e-8,0.0001575156,0.7617008,0.00001549224,0.002986471,0.001053874,0.2338727],"study_design_scores_gemma":[0.0005600185,0.0001025725,0.00009615385,0.00004597767,0.000004427708,0.000001246542,0.0001243398,0.8946449,0.00002023261,0.0000326394,0.1041639,0.0002035431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001784047,0.008558388,0.98509,0.0002680322,0.00002963661,0.003661617,0.000002051529,0.0001572853,0.000448941],"genre_scores_gemma":[0.9590002,0.002323478,0.01902098,0.0001158568,0.0001961872,0.0188643,0.0001325805,0.00002827872,0.000318175],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.966069,"threshold_uncertainty_score":0.8969673,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121206659","doi":"10.1109/35.989769","title":"QoS-oriented access control for 4G mobile multimedia CDMA communications","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":67,"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; Quality of service; Code division multiple access; Statistical time division multiplexing; Network packet; Scheduling (production processes); Channel access method; Access control; Media access control; Wireless; Multiplexing; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.08460526554272246,"gpt":0.3581217892171276,"spread":0.2735165236744051,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001039522,0.0003607814,0.0004792923,0.0004462826,0.001464502,0.0005677325,0.02568654,0.0001924975,0.000113563],"category_scores_gemma":[0.0005035134,0.0003845293,0.0002373182,0.001922083,0.000845359,0.00151122,0.004374238,0.00083905,0.0007994013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002125618,"about_ca_system_score_gemma":0.0001438007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000442227,"about_ca_topic_score_gemma":0.0003856357,"domain_scores_codex":[0.996236,0.0009691844,0.0009386839,0.0005856971,0.0005218795,0.0007485648],"domain_scores_gemma":[0.9733805,0.004166698,0.0004099438,0.02052851,0.001189903,0.0003244552],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007903939,0.007627859,0.002148094,0.0001551894,0.0005952185,0.000004827615,0.004052446,0.004735981,0.004749551,0.2099528,0.4198045,0.3460945],"study_design_scores_gemma":[0.001397532,0.00007610697,0.0004661962,0.00004007802,0.00001973174,0.000008071604,0.000021473,0.6586959,0.0001096434,0.0004302746,0.338441,0.0002939682],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004904342,0.009208905,0.9348272,0.03113305,0.0008502687,0.003961847,0.0001654969,0.001144905,0.0182179],"genre_scores_gemma":[0.6899405,0.009202248,0.2915841,0.0009507777,0.0001910877,0.005514133,0.0002187718,0.00007490671,0.002323526],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.68945,"threshold_uncertainty_score":0.9999786,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2490855483","doi":"10.1109/icc.1994.368899","title":"Comparison of methods of computing lognormal sum distributions and outages for digital wireless applications","year":2002,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Sigma; Log-normal distribution; Wireless; Matching (statistics); Algorithm; Transmission (telecommunications); Computer science; Cumulant; Mathematics; Wireless network; Statistics; Telecommunications; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.1067792676923582,"gpt":0.4312417207186375,"spread":0.3244624530262794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003641343,0.00008251236,0.000249083,0.00008049032,0.000155164,0.00008395068,0.0008889654,0.00004878878,0.000006174922],"category_scores_gemma":[0.0000572009,0.00007798302,0.00005633127,0.0004173274,0.0002101188,0.0002696846,0.0005980564,0.0001099069,0.000001142405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001437268,"about_ca_system_score_gemma":0.00001531413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007182638,"about_ca_topic_score_gemma":0.000003060733,"domain_scores_codex":[0.9989702,0.00008694027,0.0004133013,0.0001943281,0.0001374079,0.0001978012],"domain_scores_gemma":[0.9975763,0.001300395,0.0001765513,0.0006216137,0.0002553709,0.00006975585],"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.000002778101,0.0004239395,0.01534935,0.0000872264,0.00003743233,4.416711e-8,0.0005912309,0.0008210954,0.0009394682,0.2856213,0.0008037276,0.6953223],"study_design_scores_gemma":[0.0002029519,0.00005218245,0.002713951,0.0000140537,0.000004291042,0.000001750349,0.0001181735,0.9892287,0.005083602,0.0005289082,0.001963614,0.00008778754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008256199,0.0003710451,0.9893661,0.0004306846,0.00001665927,0.0003465306,0.00003059586,0.00005495746,0.001127301],"genre_scores_gemma":[0.7633635,0.00002716604,0.2364907,0.000004600653,0.00001027342,0.00002996261,0.00001420896,0.000003993938,0.00005549593],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9884076,"threshold_uncertainty_score":0.3180055,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149570559","doi":"10.1109/infcom.2001.916771","title":"Mobility-based predictive call admission control and bandwidth reservation in wireless cellular networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Handover; Computer science; Reservation; Computer network; Call Admission Control; Bandwidth (computing); Wireless; Wireless network; Cellular network; Admission control; Bandwidth allocation; Mobility model; Scheme (mathematics); Distributed computing; Quality of service; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02340543832944053,"gpt":0.2503884892567539,"spread":0.2269830509273134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009308957,0.0001432484,0.0002036186,0.0001633214,0.0001548828,0.0001479259,0.0009403264,0.0001408393,0.00004594688],"category_scores_gemma":[0.00008433789,0.0001273903,0.00003363332,0.0007222148,0.0001015449,0.0004824175,0.0002865887,0.0004155843,0.000007419296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009977684,"about_ca_system_score_gemma":0.00004276511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001149984,"about_ca_topic_score_gemma":0.0000936337,"domain_scores_codex":[0.997893,0.0005606975,0.0003327664,0.0004476208,0.0003954665,0.0003704198],"domain_scores_gemma":[0.9978893,0.000653234,0.00007519536,0.001028171,0.0001613169,0.0001928242],"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.0004623268,0.002485568,0.243851,0.000162549,0.0000779648,0.00008815293,0.001809416,0.4872805,0.004245197,0.03874511,0.01564076,0.2051515],"study_design_scores_gemma":[0.001213675,0.00009806966,0.01723638,0.00004609848,0.000001671426,7.407343e-7,0.000007633888,0.9803641,0.0002020903,0.0002078934,0.0004929712,0.00012866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0614265,0.0005448109,0.9316748,0.004239697,0.00005074985,0.000562746,0.000001149076,0.0001472899,0.001352217],"genre_scores_gemma":[0.9953825,0.0001474822,0.003680571,0.0003852099,0.0000334943,0.00008652091,0.00000613132,0.0000105744,0.0002675531],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.933956,"threshold_uncertainty_score":0.5194825,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110220656","doi":"10.1109/icc.1993.397395","title":"Integrated services on wireless multiple access networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Institut National de la Recherche Scientifique; McGill University; Nortel (Canada)","funders":"","keywords":"Time division multiple access; Code division multiple access; Computer science; Multi-frequency time division multiple access; Computer network; Bandwidth (computing); Channel access method; Wireless; Wireless network; Access control; Radio resource management; Telecommunications; Orthogonal frequency-division multiplexing; Channel (broadcasting); MIMO-OFDM","retraction":null,"screen_n_in":null,"score":{"opus":0.05551174668388755,"gpt":0.2945736359199346,"spread":0.2390618892360471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002480349,0.0001745831,0.0001711915,0.0001544734,0.000230857,0.0007859681,0.005281826,0.000105446,0.0003152441],"category_scores_gemma":[0.00001496981,0.000140783,0.00005519356,0.001207909,0.00005505575,0.0009178168,0.001243554,0.0004461349,0.0003743342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005824663,"about_ca_system_score_gemma":0.00001305298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000195886,"about_ca_topic_score_gemma":0.0002676839,"domain_scores_codex":[0.9982515,0.000218824,0.0002497932,0.0004198187,0.0004093648,0.0004507233],"domain_scores_gemma":[0.9973965,0.000470985,0.00007391049,0.001721211,0.0001746657,0.0001627137],"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.00002522577,0.0006833427,0.01161642,0.000033534,0.00006596322,0.00002709095,0.0006242055,0.07508668,0.0001265594,0.06072713,0.03029362,0.8206902],"study_design_scores_gemma":[0.0002712567,0.00003563659,0.001738956,0.00003922509,8.176738e-7,0.000002683583,0.00001441827,0.9886363,0.0002710519,0.00009767461,0.008722678,0.0001693034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05563173,0.0004672628,0.887586,0.006175047,0.0004534607,0.0005384196,0.000001780891,0.001342464,0.04780386],"genre_scores_gemma":[0.9928092,0.0003322045,0.003886791,0.001228867,0.00006734321,0.00004692681,0.000007410752,0.00001623255,0.001605073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9371774,"threshold_uncertainty_score":0.9815035,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1502585607","doi":"10.1023/a:1019166304306","title":"User mobility profile prediction: An adaptive fuzzy inference approach","year":2000,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Base station; Code division multiple access; Quality of service; Channel (broadcasting); Wireless; Computer network; Wireless network; Cellular network; Real-time computing; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03071548595568414,"gpt":0.2781505992398886,"spread":0.2474351132842045,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009428558,0.0003413792,0.0003725928,0.0001058198,0.0005205005,0.0004211703,0.003535627,0.0003171718,0.0003115818],"category_scores_gemma":[0.00001639373,0.0003288818,0.0001067509,0.001367378,0.0003091592,0.001653704,0.0006395127,0.001044681,0.0001304013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001425754,"about_ca_system_score_gemma":0.0001847641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009414787,"about_ca_topic_score_gemma":0.00003427276,"domain_scores_codex":[0.9960382,0.0008077829,0.000538271,0.001033341,0.0007266238,0.0008557733],"domain_scores_gemma":[0.9957184,0.0002903491,0.0001250881,0.003167475,0.0002925792,0.0004061261],"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.0001274947,0.0009587941,0.002646235,0.00001845571,0.00005455473,0.000008314664,0.0006866269,0.3811981,0.00001410386,0.04993283,0.003238359,0.5611161],"study_design_scores_gemma":[0.0003956962,0.0001946688,0.01149713,0.0000350463,0.000005137289,0.00001265609,0.00004623917,0.9842423,0.00002134656,0.0005947127,0.002632207,0.0003229011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05911764,0.0005095386,0.8995351,0.0002692535,0.0002549511,0.00110004,0.00001485824,0.001094208,0.03810446],"genre_scores_gemma":[0.9708645,0.000361827,0.02625695,0.0001624425,0.0003966862,0.0004657223,0.00008013636,0.0000356829,0.001376065],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9117469,"threshold_uncertainty_score":0.9999163,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118082742","doi":"10.1109/tsp.2005.861785","title":"Cross-Layer optimal connection admission control for variable bit rate multimedia traffic in packet wireless CDMA networks","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Quality of service; Call Admission Control; Network packet; Wireless network; Code division multiple access; Admission control; Markov process; Wireless; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.0242739614723515,"gpt":0.2958302235899355,"spread":0.271556262117584,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001236286,0.0003090452,0.000361912,0.0003895548,0.0007994666,0.0006907987,0.0008694088,0.0002818461,0.00005634065],"category_scores_gemma":[0.00001132373,0.0003087857,0.000125268,0.001307017,0.0001300348,0.001217359,0.000007570317,0.0007440455,0.00001149702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002159566,"about_ca_system_score_gemma":0.0003205358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006349386,"about_ca_topic_score_gemma":0.00007483122,"domain_scores_codex":[0.9972335,0.0003353833,0.0006483984,0.000685635,0.0003582578,0.0007387887],"domain_scores_gemma":[0.9977452,0.0009865903,0.0002060461,0.0005012366,0.0003859529,0.0001750419],"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.0002649942,0.000322743,0.00002696501,0.0000384977,0.00001222453,0.000003748545,0.00008795444,0.8346897,0.004361225,0.00009254779,0.00006418398,0.1600352],"study_design_scores_gemma":[0.002762704,0.0001458964,0.0001933076,0.000200351,0.00001310941,0.00001010347,0.00002214077,0.9876018,0.008350268,0.0001370928,0.0002307285,0.0003325688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04624896,0.0001990644,0.9518644,0.0003261562,0.0002467456,0.0007325565,0.00001054652,0.000287475,0.00008407961],"genre_scores_gemma":[0.9785612,0.00002241357,0.02045528,0.0001245036,0.0001589812,0.0003239553,0.0000122839,0.00004708202,0.0002943303],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9323122,"threshold_uncertainty_score":0.9999364,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098596704","doi":"10.1109/have.2003.1244724","title":"Assessment of effects of packet loss on speech quality in VoIP","year":2004,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"PESQ; Mean opinion score; Voice over IP; Packet loss; Computer science; Codec; PSQM; Speech recognition; Network packet; Quality (philosophy); Quality of service; Voice activity detection; Computer network; Speech processing; The Internet; Speech enhancement; Artificial intelligence; Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03263667057921973,"gpt":0.3854193181139367,"spread":0.352782647534717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009844566,0.00006880375,0.0001951799,0.0001293443,0.00001713076,0.00001726024,0.001220158,0.00004516143,0.000007292711],"category_scores_gemma":[0.00008498065,0.00005888633,0.00004095201,0.000592672,0.00007183045,0.0001277203,0.0004259749,0.0001875712,0.000006747931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001012543,"about_ca_system_score_gemma":0.0001459113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004099099,"about_ca_topic_score_gemma":0.0001713053,"domain_scores_codex":[0.9984995,0.0003272736,0.0003146725,0.0001810549,0.0005057016,0.0001718082],"domain_scores_gemma":[0.9978746,0.0006768237,0.0001009048,0.001203585,0.00009847067,0.00004558482],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001040509,0.001129481,0.02812833,0.0002540882,0.00001714857,0.00001436548,0.0003382399,0.007901466,0.004741193,0.9291269,0.0000842167,0.0282542],"study_design_scores_gemma":[0.001549992,0.0003306138,0.8480542,0.0002763737,0.000001009494,0.000001560597,0.00002061158,0.01683107,0.1198862,0.01285842,0.0000386175,0.0001513476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8210568,0.0000408134,0.168863,0.00141444,0.0000531324,0.000271508,4.238579e-7,0.00003199376,0.008267858],"genre_scores_gemma":[0.9585226,0.00004640968,0.04130507,0.00005689419,0.000005750098,0.00001006522,7.273059e-7,0.000003392271,0.00004909759],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9162685,"threshold_uncertainty_score":0.2401315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153440829","doi":"10.1109/twc.2007.060418","title":"Semidefinite programming relaxation approach for multiuser detection of QAM signals","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; Mtekvision (Canada); Lakehead University","funders":"","keywords":"QAM; Semidefinite programming; Quadrature amplitude modulation; Relaxation (psychology); Detector; Integer programming; Computer science; Binary number; Algorithm; Mathematical optimization; Integer (computer science); Quadratically constrained quadratic program; Mathematics; Quadratic programming; Bit error rate; Telecommunications; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.05912382391115883,"gpt":0.3182582509253235,"spread":0.2591344270141647,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001990978,0.0002522026,0.0003251758,0.0006467989,0.0009586017,0.0001249821,0.003267023,0.000234728,0.000003496399],"category_scores_gemma":[0.00004448859,0.0002739301,0.0002524827,0.001760838,0.0003023213,0.000653647,0.00004611716,0.0007024599,0.00001137674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000192957,"about_ca_system_score_gemma":0.000112352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008050624,"about_ca_topic_score_gemma":0.0002135954,"domain_scores_codex":[0.9972679,0.0003773834,0.0008810376,0.0004555857,0.000513685,0.0005043996],"domain_scores_gemma":[0.9923189,0.002252496,0.0004393955,0.004096472,0.0007298678,0.000162858],"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.000100986,0.001637841,0.00002657963,0.0000859007,0.0001280103,2.974543e-7,0.001408237,0.03710448,0.05056278,0.01131981,0.00002221832,0.8976029],"study_design_scores_gemma":[0.0009746694,0.000249871,0.0002867898,0.00009211083,0.00003820566,0.000009662637,0.000270794,0.826645,0.1682869,0.0002777277,0.002470573,0.0003976357],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003920313,0.0002122066,0.9929425,0.0004604376,0.0001406646,0.001322932,0.00001779323,0.0003662706,0.0006168975],"genre_scores_gemma":[0.7390798,0.0003014205,0.2597667,0.00004383739,0.00001749984,0.0006107978,0.00002270107,0.00003388506,0.0001233346],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8972052,"threshold_uncertainty_score":0.9999713,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032997440","doi":"10.1109/tmc.2004.1261818","title":"QoS-oriented packet scheduling for wireless multimedia CDMA communications","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":54,"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; Quality of service; Transmission delay; Network packet; Scheduling (production processes); Code division multiple access; Packet loss; Wireless; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03757708550607677,"gpt":0.3231624036712443,"spread":0.2855853181651676,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007417036,0.0002833008,0.0003172688,0.0003286732,0.001436698,0.000236485,0.003105635,0.0001567526,0.000007618332],"category_scores_gemma":[0.00002526542,0.0003114131,0.000225194,0.001183889,0.0002318394,0.000450148,0.00006949542,0.0008112736,0.00007537528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003014496,"about_ca_system_score_gemma":0.0002424149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005335614,"about_ca_topic_score_gemma":0.00006533755,"domain_scores_codex":[0.9974532,0.0002379188,0.0005926658,0.0006078879,0.0004507284,0.0006575731],"domain_scores_gemma":[0.9949309,0.001238386,0.0001895693,0.002971791,0.0004360637,0.0002332861],"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.00002043086,0.0006713314,0.00001359799,0.00003106597,0.00006544773,0.000002000555,0.001598966,0.7042112,0.001525328,0.006474319,0.00004532446,0.285341],"study_design_scores_gemma":[0.001433769,0.0001697105,0.00003461473,0.0001729064,0.00001204393,0.00001224309,0.0002052492,0.9846475,0.01126326,0.0002719345,0.001448143,0.0003286215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02920179,0.0001744156,0.9668856,0.0009611313,0.0008414967,0.001143435,0.00001656084,0.0006372315,0.0001383532],"genre_scores_gemma":[0.6643511,0.000110898,0.3349547,0.0001257779,0.00007907203,0.0003009064,0.00001149953,0.00003237628,0.00003363018],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6351493,"threshold_uncertainty_score":0.9999338,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151667449","doi":"10.1109/tmc.2005.19","title":"Call admission control in wideband CDMA cellular networks by using fuzzy logic","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":54,"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":"Call blocking; Computer science; Call Admission Control; Code division multiple access; Computer network; Handover; Fuzzy logic; Cellular network; Wideband; Blocking (statistics); Base station; Scheme (mathematics); Telecommunications; Wireless; Wireless network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02238673601283529,"gpt":0.2845824088462968,"spread":0.2621956728334615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007643643,0.000261962,0.000323487,0.0002674307,0.0004867432,0.000206099,0.001281182,0.0001886707,0.00002570011],"category_scores_gemma":[0.000007301897,0.0002681847,0.0001222067,0.0009099319,0.00007601109,0.0003929785,0.00002311528,0.0009446173,0.00002708319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003147392,"about_ca_system_score_gemma":0.00009384734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008176424,"about_ca_topic_score_gemma":0.00003815552,"domain_scores_codex":[0.9972686,0.0004831328,0.0005711608,0.0005846822,0.0004174082,0.0006749723],"domain_scores_gemma":[0.9979427,0.0005998827,0.0001414275,0.0009790079,0.0001088069,0.0002281456],"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.00001475578,0.0002172554,0.00003091068,0.000005522243,0.00001115523,0.000006168317,0.0001332849,0.8330283,0.005084327,0.00003075818,0.0001817669,0.1612557],"study_design_scores_gemma":[0.0009657628,0.00008885767,0.00001157105,0.0001061633,0.000005859973,0.00001177324,0.00001615629,0.9926177,0.00495322,0.00002368772,0.0009357468,0.0002635614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03387071,0.0009421161,0.9635431,0.0004277406,0.000297093,0.0005291578,0.000002384243,0.0002171743,0.000170536],"genre_scores_gemma":[0.9843292,0.00009775163,0.01486213,0.0004412197,0.0001076024,0.00003559489,0.000002429901,0.00002879391,0.00009529076],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9504585,"threshold_uncertainty_score":0.9999771,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165415702","doi":"10.1109/tcomm.2005.863766","title":"An enhanced widely linear CDMA receiver with OQPSK modulation","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":53,"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":"Phase-shift keying; Minimum-shift keying; Electronic engineering; Code division multiple access; Computer science; Asynchronous communication; Demodulation; Keying; Radio receiver design; Fading; Pulse-position modulation; Modulation (music); Telecommunications; Bit error rate; Pulse-amplitude modulation; Engineering; Transmitter; Detector; Physics; Channel (broadcasting); Pulse (music)","retraction":null,"screen_n_in":null,"score":{"opus":0.03211758633553163,"gpt":0.3014470995112853,"spread":0.2693295131757537,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000350178,0.0002250728,0.0001984701,0.000322853,0.001109995,0.0002200986,0.004050531,0.0001250099,0.00004028974],"category_scores_gemma":[0.000004291185,0.0002197404,0.0000833762,0.001367714,0.0002708939,0.001252647,0.00002411377,0.0006879003,0.0001532044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001604461,"about_ca_system_score_gemma":0.0001587423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003909049,"about_ca_topic_score_gemma":0.001514088,"domain_scores_codex":[0.9977223,0.0005632802,0.0004157159,0.000442632,0.0004964804,0.0003595571],"domain_scores_gemma":[0.992106,0.0004559134,0.0001465277,0.006699815,0.0004513208,0.0001404107],"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.00006575555,0.001975666,0.00005586194,0.000009546751,0.00006742839,0.0000017168,0.0008003959,0.8345928,0.01216244,0.02280547,0.0003528055,0.1271102],"study_design_scores_gemma":[0.0006223532,0.0002266845,0.001723654,0.00004942591,0.00001512156,0.000009660346,0.0000494852,0.9789456,0.01374868,0.001470187,0.002779884,0.0003593271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008312565,0.0000701903,0.9825082,0.003321622,0.00009161591,0.0004288453,0.00001271064,0.0005465851,0.004707662],"genre_scores_gemma":[0.8468349,0.0002449716,0.1518791,0.0001195652,0.00003092057,0.0002384013,0.00003561555,0.00003080826,0.0005857418],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8385223,"threshold_uncertainty_score":0.8960755,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137921460","doi":"10.1145/1089803.1089969","title":"Characterizing and modeling user mobility in a cellular data network","year":2005,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":53,"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; Cellular network; Computer network; Distributed computing","retraction":null,"screen_n_in":null,"score":{"opus":0.1003489755810365,"gpt":0.321888142963132,"spread":0.2215391673820954,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001320238,0.00008056744,0.0001180466,0.00005321824,0.00008892109,0.000195993,0.002278397,0.0000457496,0.00001535483],"category_scores_gemma":[0.00002650366,0.00007619114,0.00001031225,0.0003604796,0.00002771874,0.001218388,0.003443933,0.0002441211,0.00001680247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003207014,"about_ca_system_score_gemma":0.00004099263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008614663,"about_ca_topic_score_gemma":0.0002515917,"domain_scores_codex":[0.9986942,0.0001519639,0.0002348984,0.0004149748,0.0001873662,0.0003165604],"domain_scores_gemma":[0.9973521,0.0001220619,0.00002761472,0.002387878,0.00003434099,0.00007605073],"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.00002504187,0.0004675072,0.01754711,0.00004372106,0.00002817572,0.00001352832,0.001482485,0.4969965,0.003571095,0.05870324,0.001581615,0.41954],"study_design_scores_gemma":[0.0001169612,0.000004070868,0.001123703,0.00001571247,4.307257e-7,0.000001389514,0.000008631217,0.9949149,0.00005208806,0.000259515,0.003417275,0.00008528281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.214507,0.000695226,0.7802765,0.003291299,0.00003273529,0.0001783506,7.124563e-7,0.00009824782,0.0009198698],"genre_scores_gemma":[0.8949631,0.00019874,0.1043963,0.000253313,0.00008835397,0.00000989489,0.000008852583,0.000005614523,0.00007577918],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6804561,"threshold_uncertainty_score":0.4292617,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2224668454","doi":"10.1109/tvt.2015.2438192","title":"On the Multivariate Gamma–Gamma Distribution With Arbitrary Correlation and Applications in Wireless Communications","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Queen's University; National Natural Science Foundation of China; China Postdoctoral Science Foundation; Queen's University Belfast","keywords":"Cumulative distribution function; Moment-generating function; Probability density function; Gamma distribution; Multivariate statistics; Joint probability distribution; Correlation; Random variable; Mathematics; Multivariate normal distribution; Distribution (mathematics); Correlation function (quantum field theory); Moment (physics); Elliptical distribution; Statistical physics; Wireless; Statistics; Probability distribution; Computer science; Physics; Mathematical analysis; Telecommunications; Quantum mechanics; Spectral density","retraction":null,"screen_n_in":null,"score":{"opus":0.0258025618658446,"gpt":0.2653797140596098,"spread":0.2395771521937652,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004889164,0.0001911029,0.0001873967,0.0003711274,0.0004721782,0.00008928333,0.001717846,0.0002436355,0.000002391098],"category_scores_gemma":[0.00002127326,0.0001454575,0.00003695378,0.001929602,0.0005083978,0.0002559254,0.00004121266,0.001141116,0.00003317535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001905743,"about_ca_system_score_gemma":0.0001249378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007203197,"about_ca_topic_score_gemma":0.0002180347,"domain_scores_codex":[0.9983571,0.0003312315,0.0002895658,0.0004043622,0.0003189867,0.0002987354],"domain_scores_gemma":[0.9964714,0.0006028196,0.0001128936,0.002523082,0.0001949209,0.00009486238],"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.00007579965,0.0009734935,0.0005591528,0.00001092787,0.00007433989,0.000008589922,0.0004676431,0.04329242,0.0005003469,0.8727837,0.000111914,0.08114166],"study_design_scores_gemma":[0.001352514,0.0003480524,0.001437479,0.0001155429,0.00002122203,0.00005421525,0.0003982002,0.9698626,0.00437592,0.0188634,0.002793947,0.0003769493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05438951,0.0001167344,0.9325172,0.01154358,0.0000404527,0.0008269563,0.0000133068,0.0003216378,0.0002306542],"genre_scores_gemma":[0.994535,0.0001498809,0.004156658,0.0001042195,0.000006791938,0.00096454,0.00002584115,0.00001751616,0.00003956409],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9401455,"threshold_uncertainty_score":0.5931585,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160433355","doi":"10.1109/98.892255","title":"Optimal resource management in packet-switching TDD CDMA systems","year":2000,"lang":"en","type":"article","venue":"IEEE Personal Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":50,"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; Statistical time division multiplexing; Code division multiple access; Scheduling (production processes); Network packet; Quality of service; Time-division multiplexing; Distributed computing; Real-time computing; Multiplexing; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.04952656291708212,"gpt":0.3155314516888623,"spread":0.2660048887717801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001073395,0.0001896094,0.0002181921,0.0002868471,0.0006084941,0.0004130114,0.007099592,0.00008755326,0.00005639804],"category_scores_gemma":[0.00001291145,0.0002052209,0.00008338156,0.001154634,0.0001449452,0.000511581,0.001057204,0.0007832979,0.0003382182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002311983,"about_ca_system_score_gemma":0.00006488447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002419434,"about_ca_topic_score_gemma":0.0001056824,"domain_scores_codex":[0.9972048,0.0008741558,0.0004605344,0.0003968632,0.0005647369,0.0004988794],"domain_scores_gemma":[0.9947035,0.0005138083,0.00008942674,0.004462608,0.00008013505,0.0001505428],"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.00008455409,0.001598669,0.001129542,0.0001204872,0.0002774396,0.00007258246,0.01956837,0.09641787,0.0004289272,0.2251348,0.01739623,0.6377706],"study_design_scores_gemma":[0.000437641,0.00002507791,0.001767618,0.0001249973,0.00000556247,0.00002824635,0.0006811354,0.8664271,0.00001104504,0.0001650548,0.1300593,0.0002672444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3076004,0.01496021,0.1532524,0.04620203,0.0004276098,0.003217313,0.00003091785,0.001518593,0.4727906],"genre_scores_gemma":[0.9593915,0.001697619,0.03566975,0.0002387213,0.00004456972,0.0002815858,0.00001983841,0.00002361015,0.002632823],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7700092,"threshold_uncertainty_score":0.9982725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162971298","doi":"10.1109/tmc.2005.26","title":"Fair resource allocation with guaranteed statistical QoS for multimedia traffic in wideband CDMA cellular network","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":49,"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; Quality of service; Computer network; Resource allocation; Weighting; Telecommunications link; Cellular network; Fading; Code division multiple access; Channel (broadcasting); Real-time computing","retraction":null,"screen_n_in":null,"score":{"opus":0.01637165450728999,"gpt":0.2699364562629294,"spread":0.2535648017556394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008378308,0.0002424043,0.0002917961,0.0002282838,0.0004419696,0.0001682402,0.001003813,0.0001202352,0.00001355178],"category_scores_gemma":[0.00001215164,0.0002376339,0.00007428559,0.0008818231,0.0001194004,0.0002467505,0.00001253972,0.0005817485,0.0000246644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001880026,"about_ca_system_score_gemma":0.0001181353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001935704,"about_ca_topic_score_gemma":0.0002453623,"domain_scores_codex":[0.9975355,0.0003095171,0.0005206444,0.0006036751,0.0003775182,0.0006531811],"domain_scores_gemma":[0.9970799,0.001668352,0.0001186338,0.0008595328,0.0001289551,0.000144591],"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.00006112578,0.0001908393,0.00001272381,0.00001364173,0.00001468612,0.00000232268,0.0005903529,0.7032753,0.0001704527,0.0002013935,0.0002390366,0.2952282],"study_design_scores_gemma":[0.00131143,0.0002424975,0.00007190377,0.0001284757,0.000008706748,0.00001026177,0.00007593272,0.9919716,0.001720279,0.00002429619,0.004173984,0.0002606403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03840246,0.0001275188,0.9593887,0.0004234724,0.0001759142,0.001149837,0.000006322705,0.0002534485,0.00007228227],"genre_scores_gemma":[0.8202071,0.00001523816,0.1791411,0.0001323393,0.000185086,0.0002214206,0.00001061822,0.00003148129,0.00005558525],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7818046,"threshold_uncertainty_score":0.9690431,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119581773","doi":"10.1109/tit.2006.880015","title":"Optimal Power/Rate Allocation and Code Selection for Iterative Joint Detection of Coded Random CDMA","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Additive white Gaussian noise; Mathematics; Algorithm; Channel capacity; Single antenna interference cancellation; Noise power; Code division multiple access; Upper and lower bounds; Code rate; Minimum mean square error; Statistics; Computer science; Decoding methods; Channel (broadcasting); Telecommunications; White noise; Power (physics); Estimator","retraction":null,"screen_n_in":null,"score":{"opus":0.01247599520787556,"gpt":0.2475004139536381,"spread":0.2350244187457625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001208767,0.0001427661,0.0001748474,0.0004195479,0.0003858938,0.0001699205,0.0002547234,0.0001050109,0.00001259002],"category_scores_gemma":[0.00002547131,0.0001421052,0.00008162764,0.000475887,0.00009566377,0.002090675,0.000004939589,0.0002035551,0.00001276994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000103255,"about_ca_system_score_gemma":0.00006672731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002221847,"about_ca_topic_score_gemma":0.00004191308,"domain_scores_codex":[0.9985522,0.0003124305,0.00055189,0.0001600848,0.0002343468,0.0001890671],"domain_scores_gemma":[0.9983314,0.000503941,0.0002721227,0.000336886,0.0005068274,0.00004888398],"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.001332219,0.0002302855,0.00000336613,0.0001043506,0.00008292797,9.005989e-8,0.003572695,0.7315134,0.03989992,0.08184148,0.0001369803,0.1412822],"study_design_scores_gemma":[0.001678722,0.0003001373,0.0001605955,0.00002456293,0.00001200916,0.000007818711,0.0001364339,0.7244483,0.2697156,0.002860317,0.0005115872,0.0001439363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02556272,0.0000222417,0.9727754,0.0002224986,0.000182036,0.0006982499,0.00003014663,0.0001409984,0.000365718],"genre_scores_gemma":[0.9877142,0.00002411363,0.01175486,0.00007275246,0.00001570507,0.000270785,0.00001499976,0.000008783579,0.0001237893],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9621515,"threshold_uncertainty_score":0.5794884,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114499779","doi":"10.1109/tmc.2006.29","title":"Call admission control for voice/data integration, in.broadband, wireless networks","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":48,"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; Handover; Call Admission Control; Quality of service; Wireless broadband; Bandwidth (computing); Mobile broadband; Bandwidth allocation; Broadband networks; Wireless; Wireless network; Broadband; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02693504600755002,"gpt":0.3015962590009492,"spread":0.2746612129933992,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009890049,0.0002508971,0.0003227742,0.0002852095,0.0005236529,0.000269834,0.002471686,0.0001745397,0.000007258301],"category_scores_gemma":[0.00001292123,0.0002476808,0.0001069283,0.0008706498,0.00007151519,0.0005321786,0.0000351591,0.0006706063,0.00001494401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001654409,"about_ca_system_score_gemma":0.0001251151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001720617,"about_ca_topic_score_gemma":0.000397051,"domain_scores_codex":[0.9973634,0.0003040307,0.0006572473,0.0007375126,0.0003588074,0.0005789952],"domain_scores_gemma":[0.9962635,0.001381277,0.0001663255,0.001857766,0.0002034701,0.0001276405],"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.0000344492,0.0002376328,0.00007277744,0.000009971215,0.00001003098,0.000002202419,0.00006779782,0.7337155,0.0001944968,0.0004676379,0.0005859268,0.2646015],"study_design_scores_gemma":[0.00134219,0.0001092648,0.0003661398,0.0001492323,0.00000786581,0.000006909894,0.000019701,0.9956734,0.0007327367,0.0001513077,0.001194871,0.000246348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007735009,0.0002415396,0.9895929,0.0004257415,0.0005228941,0.001093385,0.00001810287,0.0002621463,0.0001082475],"genre_scores_gemma":[0.9812887,0.00005385277,0.01792157,0.0001372468,0.0001797345,0.0001901676,0.00003816669,0.00003141351,0.0001591626],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9735537,"threshold_uncertainty_score":0.9999976,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1958608222","doi":"10.1109/wcnc.1999.796933","title":"Service scheduling for general packet radio service classes","year":2003,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Motorola (Canada); University of British Columbia","funders":"","keywords":"General Packet Radio Service; Computer network; Computer science; Quality of service; Bottleneck; Scheduling (production processes); GPRS core network; Access Point Name; Network packet; FIFO (computing and electronics); Real-time computing; Telecommunications; Wireless; Engineering; Operating system; Embedded system","retraction":null,"screen_n_in":null,"score":{"opus":0.05901994501801366,"gpt":0.3191990102087507,"spread":0.2601790651907371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006569746,0.0001400314,0.0001578918,0.0000885499,0.0002576466,0.0003174108,0.002010315,0.00008380004,0.00005179787],"category_scores_gemma":[0.00008121982,0.0001300359,0.00005221945,0.001109176,0.00001695911,0.000548819,0.000358882,0.0001905071,0.000113947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005724541,"about_ca_system_score_gemma":0.0002156358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008391489,"about_ca_topic_score_gemma":0.0003823192,"domain_scores_codex":[0.9984188,0.0002129592,0.0002361484,0.0003655361,0.0003008482,0.000465702],"domain_scores_gemma":[0.9974349,0.0004183711,0.00006075295,0.001386298,0.0005453826,0.0001542784],"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.00001106462,0.0001364777,0.0005539251,0.0000991465,0.00005132582,0.000002229649,0.0005107827,0.01812269,0.002242892,0.9562325,0.007508387,0.01452857],"study_design_scores_gemma":[0.0005048321,0.00002454961,0.0002632425,0.00001550159,0.000002794513,0.00001235775,0.00007874957,0.9266326,0.003935325,0.004333056,0.06397704,0.0002199317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03675081,0.0003575362,0.941521,0.01269587,0.0002027923,0.0004094285,0.000001668186,0.0003069751,0.0077539],"genre_scores_gemma":[0.237433,0.00006453802,0.7566442,0.004731658,0.0001030542,0.0001162698,0.00001112775,0.00002215126,0.0008740027],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9518995,"threshold_uncertainty_score":0.5302711,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157634894","doi":"10.1109/tcomm.2004.826247","title":"Call Admission Control for Integrated On/Off Voice and Best-Effort Data Services in Mobile Cellular Communications","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":46,"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; Quality of service; Call Admission Control; Handover; Admission control; Partition (number theory); Computer network; Provisioning; Markov process; Real-time computing; Telecommunications; Mathematics; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.06221408652698515,"gpt":0.3406307085928149,"spread":0.2784166220658297,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009361844,0.0003013359,0.0003513817,0.0004789231,0.001275806,0.0002749299,0.01229218,0.0002043757,0.000006713459],"category_scores_gemma":[0.00002820743,0.0003059641,0.00009042353,0.001168359,0.000385026,0.0009210399,0.0002812929,0.001155903,0.00006921626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002523508,"about_ca_system_score_gemma":0.0003501316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000598327,"about_ca_topic_score_gemma":0.005145123,"domain_scores_codex":[0.9973907,0.0004998096,0.0006741745,0.0006329663,0.0003577364,0.0004446066],"domain_scores_gemma":[0.9824888,0.001855209,0.0001781819,0.01490197,0.0003276361,0.000248202],"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.0004444594,0.01884758,0.000242392,0.0002893694,0.0005281445,0.000008395075,0.007013511,0.3357041,0.006348529,0.05059152,0.0008809468,0.5791011],"study_design_scores_gemma":[0.002931229,0.0004217408,0.0001241359,0.000455794,0.00005049238,0.00001046192,0.0003650282,0.9263282,0.001365973,0.001271294,0.06622839,0.0004472689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005532788,0.002871621,0.9720677,0.01557147,0.0001407909,0.002416007,0.0003865095,0.0003002111,0.0007128938],"genre_scores_gemma":[0.9252748,0.008316662,0.06382557,0.0005050137,0.00001302018,0.00158684,0.0002624744,0.00003944438,0.000176102],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9197421,"threshold_uncertainty_score":0.9999393,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158653121","doi":"10.1109/twc.2002.804077","title":"PCS networks with correlated arrival process and retrial phenomenon","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor; University of Manitoba","funders":"","keywords":"Markovian arrival process; Handover; Computer science; Markov chain; Blocking (statistics); Markov process; Process (computing); Call blocking; Telecommunications network; Probability distribution; Stationary distribution; Computer network; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03759643292548034,"gpt":0.2737603345130007,"spread":0.2361639015875204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0003853622,0.0003213909,0.0003416679,0.0003437633,0.001427274,0.0003580016,0.003797737,0.0002039668,0.00006309506],"category_scores_gemma":[0.00000989515,0.0003046828,0.00007811259,0.001949825,0.0005786768,0.0007623871,0.00005869295,0.001426156,0.00005902487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001271295,"about_ca_system_score_gemma":0.00007116071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003684887,"about_ca_topic_score_gemma":0.0001351294,"domain_scores_codex":[0.9973581,0.0005359432,0.0004917909,0.000549816,0.0005343271,0.0005300224],"domain_scores_gemma":[0.9937248,0.0008793646,0.0001961642,0.004579414,0.0003363693,0.000283848],"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.0002662281,0.003331113,0.0002750103,0.00006492466,0.0005162029,0.00001682562,0.006795282,0.3602554,0.0003239661,0.02288978,0.0009285836,0.6043367],"study_design_scores_gemma":[0.001223666,0.0002405629,0.0001146815,0.0001082172,0.00002838715,0.0000449866,0.000102387,0.9964921,0.0002450971,0.0001414195,0.0008707559,0.0003877534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01046359,0.0007473904,0.9801804,0.004222944,0.0001983894,0.0006744153,0.000009850837,0.0005653259,0.002937731],"genre_scores_gemma":[0.9854447,0.003916094,0.009623681,0.00017675,0.0000342748,0.0003140501,0.00000879183,0.00004834038,0.0004333744],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9749811,"threshold_uncertainty_score":0.9999405,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4303183652","doi":"10.1109/access.2022.3211392","title":"Detection of Signals in MC–CDMA Using a Novel Iterative Block Decision Feedback Equalizer","year":2022,"lang":"en","type":"article","venue":"IEEE Access","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Institut National de la Recherche Scientifique","funders":"Agencia Estatal de Investigación; Universidad Carlos III de Madrid; European Commission; Ministerio de Ciencia, Innovación y Universidades","keywords":"Computer science; Code division multiple access; Bit error rate; Electronic engineering; Interference (communication); Nonlinear distortion; Multiuser detection; Spread spectrum; Spectral efficiency; Minimum mean square error; Algorithm; Channel (broadcasting); Amplifier; Decoding methods; Telecommunications; Mathematics; Bandwidth (computing); Engineering; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.1121801439954171,"gpt":0.3870836728718541,"spread":0.2749035288764371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009197176,0.0001091178,0.0001985859,0.000394688,0.0002375511,0.0002133534,0.002641214,0.00004385575,0.00004589698],"category_scores_gemma":[0.00006601486,0.0001142719,0.00005402566,0.002053305,0.00004466431,0.0008972465,0.001758672,0.0003566667,0.000003763512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002040152,"about_ca_system_score_gemma":0.0001150943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002841008,"about_ca_topic_score_gemma":0.00010171,"domain_scores_codex":[0.9979214,0.0003950946,0.0004178148,0.0003298856,0.0006756326,0.0002601518],"domain_scores_gemma":[0.9982175,0.0005207788,0.0002045904,0.0008199718,0.0001841842,0.00005302073],"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.00009551558,0.0003741501,0.0008251892,0.00001537792,0.00002133355,0.000008024151,0.001809777,0.7115825,0.2416633,0.0008236216,0.0001310066,0.04265022],"study_design_scores_gemma":[0.0006311333,0.00006884059,0.00170271,0.00004994257,0.000001944687,0.00001379035,0.00005363947,0.9404725,0.05529353,0.001212945,0.0003463097,0.0001527574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4831535,0.00008760914,0.516157,0.00009972371,0.0001830368,0.0001884936,0.000003167747,0.0000236407,0.0001038233],"genre_scores_gemma":[0.9926204,0.00001314227,0.007135004,0.00009610026,0.00003015813,0.00006146225,9.958983e-7,0.00001161648,0.00003110287],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5094669,"threshold_uncertainty_score":0.4908076,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142834307","doi":"10.1109/infcom.2004.1354620","title":"A new QoS provisioning method for adaptive multimedia in cellular wireless networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Quality of service; Computer network; Provisioning; Multimedia; Wireless; Mobile QoS; Wireless network; IP Multimedia Subsystem; Telecommunications; Service (business); Service provider","retraction":null,"screen_n_in":null,"score":{"opus":0.03182973976905035,"gpt":0.3180040227420852,"spread":0.2861742829730348,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001039778,0.0001736897,0.0002507814,0.0002007334,0.0001407534,0.0001791659,0.002015254,0.0001349503,0.00001361336],"category_scores_gemma":[0.00007194463,0.0001587641,0.00008353666,0.0009503474,0.00003270681,0.0004913197,0.0007355538,0.0004092723,0.00001864709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001768958,"about_ca_system_score_gemma":0.0003824981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007642405,"about_ca_topic_score_gemma":0.0004019327,"domain_scores_codex":[0.9980089,0.0002085287,0.0003564451,0.0005096195,0.0003394952,0.0005770338],"domain_scores_gemma":[0.9976546,0.0008667223,0.000091205,0.001026164,0.000145074,0.0002162142],"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.00003461796,0.00009537307,0.0000589359,0.000007094546,0.00001595476,0.000009394041,0.00104569,0.2977284,0.0006318816,0.1255381,0.0008602598,0.5739743],"study_design_scores_gemma":[0.001368165,0.00009206893,0.0001450412,0.00006667759,0.000001701998,0.000002370952,0.00005862813,0.990637,0.002752878,0.003999122,0.0006811838,0.0001951851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003601285,0.0002949708,0.9955326,0.001880994,0.0001699617,0.0009150119,3.78248e-7,0.0001674276,0.0006785072],"genre_scores_gemma":[0.2103134,0.00002707418,0.7888295,0.0001433186,0.0001397471,0.0001339512,0.000004044655,0.00001792515,0.0003909837],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6929086,"threshold_uncertainty_score":0.6474211,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139943085","doi":"10.1109/pimrc.1996.568414","title":"Scheduled CDMA: a hybrid multiple access for wireless ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":41,"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":"Computer network; Computer science; Quality of service; Time division multiple access; Code division multiple access; Power control; Base station; Asynchronous Transfer Mode; Wireless; Cellular network; Wireless network; Telecommunications; Power (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.0772732583061471,"gpt":0.3100859639936086,"spread":0.2328127056874615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004840399,0.0002020892,0.0002576515,0.0001305943,0.0003835212,0.0007515209,0.004985381,0.00008696085,0.0001519955],"category_scores_gemma":[0.000110432,0.0001847464,0.0001316613,0.0007216618,0.00009325067,0.001102486,0.001664677,0.0003214216,0.0001007285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000719011,"about_ca_system_score_gemma":0.00003308665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003779642,"about_ca_topic_score_gemma":0.00005845242,"domain_scores_codex":[0.9978505,0.0001600134,0.0003548302,0.0005467851,0.0003820892,0.00070577],"domain_scores_gemma":[0.9964452,0.001010281,0.0001067731,0.001926398,0.0002888442,0.0002224521],"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.00005036821,0.0008286614,0.006322905,0.0000644787,0.0001411165,0.00002132874,0.0002688458,0.05069699,0.0002084049,0.1049214,0.1241286,0.712347],"study_design_scores_gemma":[0.0008977707,0.00003926027,0.0005399439,0.00001810687,0.000002581068,0.000008538538,0.000005549073,0.9873277,0.0006022343,0.0004182177,0.009902044,0.0002380537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01178075,0.0004692844,0.9791428,0.003727638,0.0002452141,0.0007213044,0.000002129882,0.0004598581,0.003451056],"genre_scores_gemma":[0.9509646,0.0002727886,0.04598918,0.0005273494,0.000168589,0.00035006,0.000008932507,0.00002735158,0.001691133],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9391838,"threshold_uncertainty_score":0.9264161,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1504221435","doi":"10.1109/msp.2004.1328088","title":"An overview of CAC principles in DS-CDMA networks - Call admission control in wireless multimedia networks","year":2004,"lang":"en","type":"article","venue":"IEEE Signal Processing Magazine","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"National Science Foundation","keywords":"Call Admission Control; Computer science; Time division multiple access; Quality of service; Code division multiple access; Computer network; Wireless network; Admission control; Cellular network; Access control; Physical layer; Wireless; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.05225293197614525,"gpt":0.3270822643071171,"spread":0.2748293323309718,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001608288,0.0003443844,0.0006310156,0.0004038425,0.0001300724,0.0002031947,0.002360635,0.0002828744,0.0000133082],"category_scores_gemma":[0.00004560212,0.0003257239,0.00007942574,0.001931478,0.0002061731,0.001060991,0.0002782618,0.000987419,0.000008379269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002499235,"about_ca_system_score_gemma":0.000697278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001929148,"about_ca_topic_score_gemma":0.0009382862,"domain_scores_codex":[0.9962687,0.0005046288,0.001017029,0.000694903,0.0006810826,0.0008336497],"domain_scores_gemma":[0.9976603,0.0003132159,0.0003930969,0.001008167,0.0003082463,0.000316963],"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.00009084922,0.0004801773,0.002983737,0.0001098024,0.000007582724,0.00005472721,0.0003378293,0.822426,0.003401041,0.0005636674,0.00003972387,0.1695049],"study_design_scores_gemma":[0.002496009,0.0001443004,0.01550571,0.00125733,0.000004973875,0.00001067794,0.000008512373,0.979399,0.0004254535,0.0002635089,0.0001556134,0.0003289175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06556172,0.006816983,0.9256956,0.0007018365,0.0001445855,0.000677815,0.000002507284,0.000164017,0.0002349261],"genre_scores_gemma":[0.9893639,0.0006548741,0.009422582,0.0002485676,0.0001575966,0.00006005134,0.00001458955,0.00004166789,0.00003613543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9238022,"threshold_uncertainty_score":0.9999195,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099685905","doi":"10.1109/tit.2010.2040887","title":"New Sets of Zero or Low Correlation Zone Sequences via Interleaving Techniques","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":40,"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":"Interleaving; Hadamard transform; Sequence (biology); Zero (linguistics); Mathematics; Code division multiple access; Complementary sequences; Ideal (ethics); Algorithm; Construct (python library); Discrete mathematics; Combinatorics; Computer science; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01254090588742972,"gpt":0.2729346333241561,"spread":0.2603937274367263,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000823351,0.0001323128,0.0001443058,0.0004491965,0.0002067687,0.0001380398,0.00104171,0.0001434732,0.000229664],"category_scores_gemma":[0.00002661634,0.0001141239,0.00007211634,0.0006503203,0.0001099467,0.003197849,0.00001178222,0.0005957806,0.0001203966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005218173,"about_ca_system_score_gemma":0.0001922582,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005227656,"about_ca_topic_score_gemma":0.00004567885,"domain_scores_codex":[0.9986367,0.0001498197,0.0005164001,0.0001242048,0.0003865945,0.0001862303],"domain_scores_gemma":[0.9981262,0.0004705645,0.0002494849,0.0008151335,0.0002401474,0.00009844032],"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.0000755409,0.00004364701,0.000002738788,0.00002494027,0.00001725994,3.028092e-7,0.002137616,0.007303164,0.002914596,0.01723207,0.0002286109,0.9700195],"study_design_scores_gemma":[0.0006963945,0.000384678,0.0001396342,0.0002679474,0.00001642229,0.00007752933,0.0002730402,0.5933924,0.3839247,0.01721278,0.003132834,0.0004816715],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002377224,0.000005377139,0.9944871,0.0002447528,0.0005117836,0.0002901478,0.000005104049,0.0002996784,0.001778833],"genre_scores_gemma":[0.9196079,0.00003340708,0.07979563,0.0001134551,0.00001508548,0.00004290527,0.000005095453,0.000007318417,0.0003792494],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9695379,"threshold_uncertainty_score":0.4653837,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166146132","doi":"10.1109/tvt.2004.825746","title":"Virtual Partitioning Resource Allocation for Multiclass Traffic in Cellular Systems With QoS Constraints","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":39,"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":"Quality of service; Computer science; Preemption; Handover; Computer network; Call blocking; Blocking (statistics); Resource allocation; Network packet; Call Admission Control; Markov chain; Markov process; Distributed computing; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.01631725378460329,"gpt":0.2453775174623815,"spread":0.2290602636777783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003852267,0.0001792927,0.0002268511,0.000669462,0.000287501,0.0000947239,0.0009240521,0.0002851462,0.000001707127],"category_scores_gemma":[0.00001353448,0.0001781117,0.00005800787,0.001239705,0.0003704532,0.0002277462,0.000007097673,0.0005730941,0.00001838328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002962745,"about_ca_system_score_gemma":0.0001541263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002186293,"about_ca_topic_score_gemma":0.0001793295,"domain_scores_codex":[0.9983653,0.0001206164,0.0003432862,0.0004800647,0.0002567894,0.0004339641],"domain_scores_gemma":[0.9985465,0.0001673445,0.00009250834,0.0009669124,0.0001546284,0.00007205091],"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.0000242824,0.0002516598,0.000004642967,0.00001363094,0.00002904573,0.00001636232,0.0001900162,0.9502716,0.003708404,0.0198465,0.000006879462,0.02563697],"study_design_scores_gemma":[0.003049807,0.0006620198,0.00001651378,0.0002812183,0.00001518833,0.00008395084,0.0006833904,0.9321622,0.06139943,0.000304428,0.0009887305,0.0003531736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1519767,0.00008040995,0.8439163,0.002711842,0.0001109654,0.0007700693,0.000003863052,0.0004073303,0.00002246805],"genre_scores_gemma":[0.9845197,0.00002055452,0.01453083,0.00004396319,0.00001648155,0.0008044469,0.000005741767,0.00002345925,0.00003484288],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.832543,"threshold_uncertainty_score":0.7263183,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114381489","doi":"10.1109/icc.1999.765440","title":"Call admission on the uplink of a CDMA system based on total received power","year":2003,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Telecommunications link; Computer science; Computer network; Call Admission Control; Power control; Network packet; Interference (communication); Code division multiple access; Resource allocation; Transmission (telecommunications); Wireless network; Wireless; Resource management (computing); Power (physics); Real-time computing; Telecommunications; Channel (broadcasting)","retraction":null,"screen_n_in":null,"score":{"opus":0.02641483242194794,"gpt":0.2678486449783026,"spread":0.2414338125563546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009070996,0.0001019162,0.0001272317,0.00008586959,0.0001329043,0.00006392316,0.001238065,0.00006411019,0.0001343747],"category_scores_gemma":[0.0002080337,0.00006001351,0.00006340518,0.0004481965,0.00004035869,0.00006624376,0.0001484192,0.0002521516,0.0001143539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007855638,"about_ca_system_score_gemma":0.0001401343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001386084,"about_ca_topic_score_gemma":0.000001768564,"domain_scores_codex":[0.9982518,0.0005803055,0.0002201825,0.0002367464,0.0004957519,0.0002152296],"domain_scores_gemma":[0.9969418,0.0009377422,0.00007818866,0.001794906,0.0001424642,0.0001049096],"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.000104501,0.0005293558,0.0002309429,0.00004269077,0.00002640184,0.00001090715,0.0004587782,0.02654252,0.002262938,0.93908,0.02089149,0.009819449],"study_design_scores_gemma":[0.0003456862,0.0002227381,0.0008631108,0.0001705814,0.000001048805,0.000003344843,0.0000510015,0.987429,0.008193845,0.00007037818,0.002537058,0.0001121718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.0735597,0.00008821185,0.4457086,0.01450257,0.0004096846,0.001084964,0.00000162387,0.0003775822,0.4642671],"genre_scores_gemma":[0.992404,0.000003338521,0.005950165,0.0003378691,0.000007260138,0.00002296798,6.683494e-7,0.000008038046,0.00126567],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9608865,"threshold_uncertainty_score":0.244728,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137433440","doi":"10.1109/tvt.2007.891467","title":"Least Squares Approximations to Lognormal Sum Distributions","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":39,"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":"Mathematics; Log-normal distribution; Logarithm; Linear approximation; Probability density function; Applied mathematics; Range (aeronautics); Approximation theory; Least-squares function approximation; Cumulative distribution function; Function (biology); Mathematical analysis; Statistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01649180936011668,"gpt":0.2787652946075907,"spread":0.262273485247474,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005249313,0.0001980786,0.0002015825,0.001115711,0.0006918306,0.00009977705,0.002001056,0.0003015446,0.00003123853],"category_scores_gemma":[0.00002999523,0.0002076894,0.0001144976,0.003258955,0.0002266081,0.000298265,0.00003479251,0.0008292171,0.0003133671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001925845,"about_ca_system_score_gemma":0.00008777926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002374855,"about_ca_topic_score_gemma":0.000204843,"domain_scores_codex":[0.9979891,0.00008278575,0.0003828355,0.0004783695,0.0003917947,0.0006751103],"domain_scores_gemma":[0.99748,0.0001852989,0.00006337336,0.001796407,0.0002747671,0.000200165],"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.00004910583,0.001508295,0.000164731,0.00002462077,0.0001506412,0.00007487124,0.0003735355,0.1052348,0.01373185,0.3127558,0.001228325,0.5647034],"study_design_scores_gemma":[0.002142281,0.00127919,0.002738098,0.0001930778,0.00006670609,0.0005207567,0.0007269339,0.3946142,0.5063267,0.01157369,0.07788303,0.001935297],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01661744,0.00006392431,0.9697619,0.01138861,0.0002336967,0.0004413881,0.00001999554,0.00101789,0.0004551357],"genre_scores_gemma":[0.9517131,0.0000244988,0.04769913,0.0001591258,0.00002152825,0.0001919077,0.00000711071,0.00001736793,0.0001662529],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9350956,"threshold_uncertainty_score":0.8469328,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097812145","doi":"10.1109/lcomm.2002.805515","title":"A memetic algorithm for assigning cells to switches in cellular mobile networks","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Memetic algorithm; Tabu search; Computer science; Heuristics; Cellular network; Heuristic; Context (archaeology); Memetics; Algorithm; Local search (optimization); Mathematical optimization; Artificial intelligence; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.05095501752109461,"gpt":0.2887896770371899,"spread":0.2378346595160953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0009260216,0.0002091789,0.0002687444,0.0004278875,0.0004206838,0.0002937971,0.007261476,0.00009643148,0.00001473519],"category_scores_gemma":[0.00003589594,0.000236469,0.0001097701,0.001576646,0.0001370942,0.0003974898,0.001186572,0.0005531884,0.0001048515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002035094,"about_ca_system_score_gemma":0.00002464893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005485178,"about_ca_topic_score_gemma":0.00004930177,"domain_scores_codex":[0.9976938,0.0004351256,0.0005106222,0.0004371642,0.0003071251,0.0006162121],"domain_scores_gemma":[0.992942,0.001285097,0.0001251471,0.005332808,0.0001379045,0.0001770673],"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.000004405324,0.0006425164,0.0001439187,0.00002118043,0.00006423052,0.000006461968,0.003428263,0.2884715,0.0710976,0.001183914,0.04674171,0.5881943],"study_design_scores_gemma":[0.0003359183,0.000044738,0.00003966171,0.00005174223,0.000004631917,0.000001845745,0.00004954876,0.9727579,0.003653067,0.00005186378,0.02274358,0.0002655453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003335328,0.00130773,0.97994,0.01359898,0.0002020185,0.001164664,0.000003661532,0.0001716129,0.0002759855],"genre_scores_gemma":[0.5881237,0.0004365148,0.407177,0.002228581,0.00006643025,0.001790839,0.00001031652,0.00003367266,0.0001328538],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6842863,"threshold_uncertainty_score":0.9981097,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}