{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":107,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":107,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"503c54ed4fb0","filters":{"venue":"2006 IEEE International Conference on Communications"}},"results":[{"id":"W2153919695","doi":"10.1109/icc.2006.255127","title":"Anomaly Based Network Intrusion Detection with Unsupervised Outlier Detection","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":247,"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":"Anomaly detection; Outlier; Computer science; Anomaly (physics); Intrusion detection system; Data mining; Random forest; Artificial intelligence; Anomaly-based intrusion detection system; Pattern recognition (psychology); Machine learning","authors":[{"name":"Jiong Zhang","is_ca":true},{"name":"Mohammad Zulkernine","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0376647273698407,"gpt":0.2678853771644259,"spread":0.2302206497945852,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002051475,0.0009651667,0.001711281,0.00349976,0.0005586713,0.001244987,0.001834824,0.00105228,0.0004880567],"category_scores_gemma":[0.007822873,0.0003880497,0.00112517,0.003058861,0.0007253084,0.002071868,0.001555179,0.001245094,0.0004202378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005695085,"about_ca_system_score_gemma":0.0008350132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00164783,"about_ca_topic_score_gemma":0.002064639,"domain_scores_codex":[0.9960814,0.0008660713,0.0003227611,0.000793588,0.001686192,0.0002500452],"domain_scores_gemma":[0.9942965,0.001944462,0.001008211,0.001061131,0.001548356,0.0001413946],"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.0004834411,0.0007384068,0.03406646,0.0002641081,0.0005804725,0.0004952576,0.0002224949,0.1819373,0.02500642,0.007480446,0.007069998,0.7416552],"study_design_scores_gemma":[0.0000219885,0.0001229711,0.004263192,0.00001193174,0.00003866163,0.0005299633,0.0000401174,0.9731232,0.01243059,0.006935985,0.00244694,0.00003441344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03101785,0.0001809285,0.963796,0.0001220492,0.00004999587,0.0001353843,0.0002231181,0.003902522,0.0005722256],"genre_scores_gemma":[0.4343913,0.0002023483,0.5623965,0.0001161515,0.0001032033,0.0002738424,0.001332128,0.0001383253,0.001046162],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00349976,"threshold_uncertainty_score":0.01084936,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155280140","doi":"10.1109/icc.2006.255766","title":"A Cooperative Game Framework for Bandwidth Allocation in 4G Heterogeneous Wireless Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":139,"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; Computer network; Bandwidth allocation; Shapley value; Wireless network; Channel allocation schemes; Bandwidth (computing); Resource allocation; Wireless; Distributed computing; Resource management (computing); Game theory; Telecommunications; Mathematics","authors":[{"name":"Dusit Niyato","is_ca":true},{"name":"Ekram Hossain","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04045177550414004,"gpt":0.3073339776887252,"spread":0.2668822021845851,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001995527,0.001330095,0.001148803,0.000607582,0.0008387727,0.001686002,0.002330425,0.001590498,0.00347287],"category_scores_gemma":[0.002325704,0.0004355353,0.0008166634,0.0008191879,0.001655202,0.001922996,0.001302091,0.001600503,0.0003878804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002415402,"about_ca_system_score_gemma":0.002210271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009017356,"about_ca_topic_score_gemma":0.006789781,"domain_scores_codex":[0.9989192,0.0005731522,0.0000312627,0.0001201626,0.0002163443,0.0001397699],"domain_scores_gemma":[0.9993272,0.0004085266,0.00006584506,0.00002682285,0.00009883667,0.00007274135],"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.0000413003,0.00005160047,0.0001283696,0.00005734023,0.00002973223,0.0001380226,0.0001223108,0.7308074,0.0009135405,0.2554551,0.001572222,0.01068306],"study_design_scores_gemma":[0.00001592459,0.00002508125,0.00002719751,0.000005445757,0.000006196487,0.00001845077,0.00001923077,0.9606113,0.00007920414,0.03830456,0.0008796626,0.00000771865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007039284,0.000262912,0.9859693,0.0001966444,0.00005174399,0.0001026738,0.00004063587,0.00005396372,0.006282782],"genre_scores_gemma":[0.7860525,0.0008291642,0.2001675,0.0002350989,0.0001315095,0.0006362724,0.00009046579,0.00004787897,0.01180957],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009017356,"threshold_uncertainty_score":0.01792973,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129447772","doi":"10.1109/icc.2006.255725","title":"Linear Processing for the Downlink in Multiuser MIMO Systems with Multiple Data Streams","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":115,"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":"Telecommunications link; Precoding; MIMO; Computer science; Data stream mining; Transmitter; Transmitter power output; Duality (order theory); Optimization problem; Mathematical optimization; Power (physics); Real-time computing; Algorithm; Mathematics; Computer network; Telecommunications; Beamforming; Data mining","authors":[{"name":"Ali Khachan","is_ca":true},{"name":"Adam J. Tenenbaum","is_ca":true},{"name":"Raviraj Adve","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09994237916741898,"gpt":0.3318474533875652,"spread":0.2319050742201462,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000988474,0.001250276,0.0009630783,0.0003381933,0.0004788082,0.001403745,0.0005528261,0.00110037,0.002790996],"category_scores_gemma":[0.002152486,0.0004806258,0.0006040331,0.0008123941,0.0009126972,0.001498697,0.0009918314,0.001611517,0.001116732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006820916,"about_ca_system_score_gemma":0.001372361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001403745,"about_ca_topic_score_gemma":0.002083231,"domain_scores_codex":[0.9993529,0.0002345056,0.00002370703,0.00009572299,0.0002186679,0.00007440907],"domain_scores_gemma":[0.9991599,0.0005733221,0.00008080831,0.00004470483,0.000119044,0.0000222915],"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.0000996404,0.0001008592,0.0004232837,0.0004731084,0.000077263,0.0002088107,0.0002138639,0.8394046,0.009816534,0.06843018,0.004153313,0.0765985],"study_design_scores_gemma":[0.00001760176,0.00006907804,0.00009217834,0.00002708491,0.00001661228,0.00005663237,0.00004750114,0.9755511,0.002592885,0.01912492,0.002390232,0.00001423786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004213207,0.0006581713,0.9921663,0.0003679016,0.00004505859,0.00002385706,0.00004336325,0.00005194611,0.002430201],"genre_scores_gemma":[0.3625151,0.005607729,0.6119326,0.0008698082,0.0006738872,0.0004689597,0.0004085902,0.0002078523,0.01731537],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002790996,"threshold_uncertainty_score":0.00933677,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111322283","doi":"10.1109/icc.2006.255061","title":"Joint Optimal Channel Assignment and Congestion Control for Multi-channel Wireless Mesh Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Goodput; Computer science; Computer network; Wireless mesh network; Channel (broadcasting); Channel allocation schemes; Network congestion; Order One Network Protocol; Control channel; Wireless network; Distributed computing; Wireless; Throughput; Telecommunications; Telecommunications link","authors":[{"name":"A. Mohsenian Rad","is_ca":true},{"name":"Vincent W. S. Wong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0858334613397398,"gpt":0.3109017701896493,"spread":0.2250683088499095,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002423778,0.0006166482,0.0008635523,0.0006800765,0.0006717441,0.000966449,0.0009707836,0.0005521539,0.000717434],"category_scores_gemma":[0.005410927,0.0004877288,0.000345614,0.0006997368,0.00122758,0.001460109,0.001195707,0.0006888936,0.00007108608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001297706,"about_ca_system_score_gemma":0.001411985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004563806,"about_ca_topic_score_gemma":0.00366515,"domain_scores_codex":[0.9987462,0.0006000368,0.00004847297,0.0001570918,0.0002400704,0.0002082312],"domain_scores_gemma":[0.9979498,0.001250424,0.0002838995,0.000146073,0.0002379476,0.0001319393],"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.00008501805,0.00003877191,0.0003503968,0.00002897331,0.00002238542,0.000022417,0.00003822756,0.9737781,0.0008581861,0.007749802,0.0004613955,0.01656616],"study_design_scores_gemma":[0.000009043864,0.00001165752,0.00004723729,0.000001087267,0.000003650098,0.000003502117,0.000004635039,0.9968411,0.0001415898,0.002853835,0.00008026863,0.000002527879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05013359,0.0006694493,0.9472978,0.000293569,0.00007668773,0.000053173,0.00002346941,0.0002577415,0.001194526],"genre_scores_gemma":[0.9574901,0.0001984824,0.04140949,0.00004043217,0.00006962068,0.00007118461,0.00002745953,0.00003214621,0.0006611587],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004563806,"threshold_uncertainty_score":0.01281834,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098319539","doi":"10.1109/icc.2006.255326","title":"Capacity of Fading Channels Under Spectrum-Sharing Constraints","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":98,"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":"Licensee; Fading; Interference (communication); Computer science; Channel (broadcasting); Fading distribution; Channel state information; Telecommunications; Channel capacity; Computer network; Electronic engineering; Wireless; Engineering; License","authors":[{"name":"Amir Ghasemi","is_ca":true},{"name":"E.S. Sousa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08893171150074693,"gpt":0.3039965116319894,"spread":0.2150648001312425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00165762,0.0009332213,0.001284909,0.001044182,0.0006761356,0.002207533,0.001155981,0.0009320084,0.004017182],"category_scores_gemma":[0.01132992,0.0004144099,0.0003674021,0.001526138,0.002673264,0.001632152,0.001418819,0.0007503033,0.0004811612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002024384,"about_ca_system_score_gemma":0.001325906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007279491,"about_ca_topic_score_gemma":0.002633136,"domain_scores_codex":[0.9981083,0.00052255,0.0000455341,0.0001873378,0.0003206884,0.000815638],"domain_scores_gemma":[0.9869375,0.01027237,0.0008748405,0.0005919675,0.001021353,0.000302052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007591605,0.00001528893,0.0005861048,0.00008095484,0.00002702851,0.0002331469,0.00008890277,0.931894,0.001459683,0.06120068,0.0008987274,0.003439459],"study_design_scores_gemma":[0.00001421557,0.00002451803,0.0006495096,0.00002755614,0.00001246506,0.0001137287,0.00006175395,0.9381979,0.0006804768,0.0596139,0.000580671,0.00002345134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5347139,0.002287437,0.4117237,0.001173388,0.00007563604,0.0000896581,0.001882752,0.0005974839,0.04745601],"genre_scores_gemma":[0.9947955,0.0005949478,0.003254442,0.00003859354,0.00004093001,0.00005122184,0.0001272347,0.00002255579,0.001074667],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007279491,"threshold_uncertainty_score":0.01468801,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127932079","doi":"10.1109/icc.2006.255655","title":"Stimulating Cooperative Diversity in Wireless Ad Hoc Networks through Pricing","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":87,"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":"Relay; Computer network; Wireless ad hoc network; Cooperative diversity; Computer science; Nash equilibrium; Game theory; Wireless; Diversity (politics); Wireless network; Channel (broadcasting); Power control; Telecommunications; Power (physics); Fading; Microeconomics; Economics","authors":[{"name":"Naveen Shastry","is_ca":true},{"name":"Raviraj Adve","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.146207729456455,"gpt":0.3518665285425901,"spread":0.2056587990861351,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002494291,0.0007244899,0.0006488335,0.0004385053,0.0008374131,0.001565579,0.001118555,0.00126823,0.001539701],"category_scores_gemma":[0.008614554,0.0003499665,0.0004483148,0.0006168263,0.002594976,0.003346588,0.00194003,0.001255905,0.0002189574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001024916,"about_ca_system_score_gemma":0.0007425903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004927095,"about_ca_topic_score_gemma":0.0004741555,"domain_scores_codex":[0.9979899,0.001309645,0.00004401344,0.0001187482,0.0003701784,0.0001674974],"domain_scores_gemma":[0.9952494,0.003584669,0.0003776557,0.0002254181,0.000295739,0.0002670422],"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.0002040499,0.000230923,0.00146621,0.000138811,0.00006844455,0.0005763865,0.0006203683,0.3405814,0.01080044,0.5959471,0.00141048,0.04795547],"study_design_scores_gemma":[0.0000891216,0.0002025859,0.000334715,0.00002425139,0.00002728798,0.0002614845,0.0001955052,0.5729036,0.00149807,0.4211104,0.003314623,0.0000383793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.176476,0.0006808889,0.7940156,0.001895646,0.0001223246,0.000180824,0.00002969728,0.0001217586,0.02647722],"genre_scores_gemma":[0.9820079,0.0002743104,0.01623755,0.0001072211,0.00004882375,0.00006313877,0.000004648474,0.00001183394,0.001244477],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002494291,"threshold_uncertainty_score":0.01319122,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2176074649","doi":"10.1109/icc.2006.255550","title":"Totally Disjoint Multipath Routing in Multihop Wireless Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":60,"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":"Multipath routing; Computer network; Computer science; Dynamic Source Routing; Geographic routing; Static routing; Distributed computing; Multipath propagation; Multipath interference; Link-state routing protocol; Equal-cost multi-path routing; Wireless Routing Protocol; Throughput; Disjoint sets; Wireless network; Routing (electronic design automation); Wireless; Routing protocol; Telecommunications","authors":[{"name":"Sonia Waharte","is_ca":true},{"name":"Raouf Boutaba","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05218695171686352,"gpt":0.3070467231362634,"spread":0.2548597714193999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001107392,0.0007488168,0.0005279492,0.0008115133,0.000582459,0.0009563154,0.0008322956,0.0007140341,0.000771359],"category_scores_gemma":[0.002881673,0.0004067716,0.0003197393,0.001297485,0.0007201792,0.001707146,0.001048278,0.0004820792,0.000200857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005377016,"about_ca_system_score_gemma":0.0005251489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007518704,"about_ca_topic_score_gemma":0.001091113,"domain_scores_codex":[0.9991933,0.0003506094,0.00003794187,0.00007062551,0.0002796019,0.00006792099],"domain_scores_gemma":[0.9987336,0.0006973966,0.0001942719,0.0001560036,0.000167052,0.00005171359],"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.0001425311,0.00004685033,0.0008928773,0.0003955097,0.0001424653,0.0002816317,0.0001652091,0.7451404,0.01375996,0.05658314,0.002012079,0.1804374],"study_design_scores_gemma":[0.00003623895,0.0003046062,0.0005078826,0.00004307633,0.00005875166,0.0005678941,0.0000811637,0.9115618,0.005129029,0.07347104,0.008191885,0.00004654496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05507592,0.009178599,0.9302046,0.0003515279,0.0002434925,0.0001194694,0.00007140148,0.0006000364,0.004154985],"genre_scores_gemma":[0.6913235,0.009506468,0.2944994,0.0001447813,0.0003371962,0.0002262167,0.0001464066,0.0001011034,0.003714922],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001107392,"threshold_uncertainty_score":0.005856514,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163096389","doi":"10.1109/icc.2006.255035","title":"Bilayer LDPC Codes for the Relay Channel","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Cooperative Communication and Network Coding","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":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Relay; Computer science; Relay channel; Channel (broadcasting); Algorithm; Channel capacity; Decoding methods; EXIT chart; Electronic engineering; Block code; Concatenated error correction code; Computer network; Physics; Engineering","authors":[{"name":"Peyman Razaghi","is_ca":true},{"name":"Wei Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1688634495766887,"gpt":0.3661864784126546,"spread":0.1973230288359659,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003555698,0.000326849,0.0002519008,0.0003741668,0.0003291047,0.0004927849,0.0004104686,0.0005192635,0.00160703],"category_scores_gemma":[0.001888314,0.0001586294,0.0002568176,0.0004142419,0.0005570305,0.0006480943,0.0005571839,0.0008197642,0.0006328184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004951674,"about_ca_system_score_gemma":0.0008215569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001150839,"about_ca_topic_score_gemma":0.001098589,"domain_scores_codex":[0.9996972,0.00007796191,0.00001408164,0.00003821273,0.000144086,0.00002850403],"domain_scores_gemma":[0.9994154,0.0002062073,0.00006665215,0.0001486732,0.0001443464,0.00001874507],"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.0001158558,0.00003874346,0.0003359629,0.0001684606,0.00001569633,0.000141513,0.0001522998,0.213131,0.04858866,0.6556934,0.001960212,0.07965817],"study_design_scores_gemma":[0.0000204452,0.00005906099,0.0001612627,0.00002898981,0.00001083762,0.000185594,0.00001579586,0.8779392,0.019408,0.08974302,0.01239946,0.00002839572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01202808,0.0002041542,0.9833128,0.000129098,0.0000336146,0.00005367399,0.00009632072,0.0002239133,0.003918272],"genre_scores_gemma":[0.3862749,0.0007682892,0.608578,0.0001414222,0.00003771207,0.0002019257,0.0001842191,0.00008436794,0.003729082],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00160703,"threshold_uncertainty_score":0.005376041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127936354","doi":"10.1109/icc.2006.254710","title":"IP Traffic Matrix Estimation Methods: Comparisons and Improvements","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Network Traffic and Congestion Control","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 Manitoba","funders":"","keywords":"Computer science; Maximization; Entropy (arrow of time); Entropy maximization; Mathematical optimization; Internet traffic; Linear programming; Data mining; The Internet; Point (geometry); Matrix (chemical analysis); Traffic generation model; Traffic engineering; Principle of maximum entropy; Algorithm; Artificial intelligence; Mathematics; Real-time computing; Computer network","authors":[{"name":"Md. Mahfuzur Rahman","is_ca":true},{"name":"Subrata Saha","is_ca":true},{"name":"Usha Chengan","is_ca":true},{"name":"Attahiru Sule Alfa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06709238678803496,"gpt":0.3795537295857243,"spread":0.3124613427976893,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008723445,0.001643696,0.001198585,0.003569441,0.0004816137,0.001190293,0.001954841,0.001381349,0.001827981],"category_scores_gemma":[0.03519089,0.0007158366,0.0009310348,0.003192553,0.0005677766,0.004187454,0.00145066,0.001561235,0.0005641225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009159838,"about_ca_system_score_gemma":0.0008752617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008398614,"about_ca_topic_score_gemma":0.00488148,"domain_scores_codex":[0.9936569,0.002941011,0.0003330087,0.0006293738,0.002255048,0.0001846764],"domain_scores_gemma":[0.970611,0.01933478,0.001209294,0.002534862,0.006068346,0.0002417499],"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.0004472579,0.0002303585,0.007060326,0.0005152152,0.0003514504,0.0000652653,0.0002532037,0.2324395,0.005127163,0.007750861,0.003449303,0.7423101],"study_design_scores_gemma":[0.0000294958,0.0001222694,0.003891752,0.00004880052,0.00006528668,0.0001296912,0.00006223565,0.9847323,0.006023923,0.002628529,0.002210702,0.00005492528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04098126,0.005731272,0.9470553,0.000657675,0.0001935786,0.00009840877,0.0001993016,0.001916511,0.003166697],"genre_scores_gemma":[0.3074256,0.004696665,0.6846642,0.0001294996,0.0003079962,0.0001362451,0.0005407373,0.0003016377,0.001797303],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008723445,"threshold_uncertainty_score":0.04613459,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149821387","doi":"10.1109/icc.2006.254850","title":"Analysis of Burst Transmission in IEEE 802.11e Wireless LANs","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":36,"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 network; Throughput; Wireless lan; Computer science; IEEE 802.11e-2005; Channel (broadcasting); Distributed coordination function; Quality of service; IEEE 802; Wireless; Transmission (telecommunications); IEEE 802.11; Wireless network; Wi-Fi array; Telecommunications","authors":[{"name":"Fei Peng","is_ca":true},{"name":"Hussein Alnuweiri","is_ca":true},{"name":"Victor C. M. Leung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07059347255846536,"gpt":0.3443863024702178,"spread":0.2737928299117524,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00121252,0.0005699915,0.0004779304,0.0008341542,0.0004251129,0.0007458872,0.0006177103,0.0005345746,0.001156206],"category_scores_gemma":[0.005120507,0.0004014983,0.0003637394,0.0005742509,0.0008064836,0.001437265,0.000570699,0.0008391296,0.0001694497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001126984,"about_ca_system_score_gemma":0.0004939474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003362422,"about_ca_topic_score_gemma":0.001131014,"domain_scores_codex":[0.9992875,0.0001804031,0.00003002191,0.00006845468,0.0002957554,0.0001378713],"domain_scores_gemma":[0.9979792,0.001355464,0.0002471016,0.0001001415,0.0002694808,0.00004860668],"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.00017369,0.00006340265,0.003792558,0.00008824255,0.00004505321,0.0002841943,0.00030931,0.9077527,0.01347214,0.05775953,0.0005055158,0.01575361],"study_design_scores_gemma":[0.000003596394,0.00002081772,0.0004271349,0.00000601619,0.000004734355,0.00003999871,0.00002032995,0.9954461,0.0007113904,0.003145443,0.0001699037,0.000004558668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3860935,0.001133988,0.6058757,0.0003349456,0.00003425591,0.0000743536,0.00009646767,0.0003470573,0.006009675],"genre_scores_gemma":[0.9878654,0.0004049428,0.01038534,0.00003262194,0.00002107782,0.00005572285,0.00004970274,0.00004110039,0.001144094],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003362422,"threshold_uncertainty_score":0.008176923,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121304904","doi":"10.1109/icc.2006.255029","title":"Low-Complexity Cooperative Coding for Sensor Networks using Rateless and LDGM Codes","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":28,"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 science; Relay; Coding (social sciences); Online codes; Wireless sensor network; Computer network; Linear network coding; Channel (broadcasting); Node (physics); Decoding methods; Distributed computing; Algorithm; Block code; Linear code; Mathematics; Engineering","authors":[{"name":"Andrew W. Eckford","is_ca":true},{"name":"Josephine Chu","is_ca":true},{"name":"Raviraj Adve","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2053501897785849,"gpt":0.375488632811532,"spread":0.1701384430329471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001471202,0.0004605277,0.0003978718,0.0004293198,0.0003276002,0.0005270254,0.0007625503,0.0006692822,0.0005015891],"category_scores_gemma":[0.005224932,0.0002352903,0.0002800352,0.0005425831,0.001284194,0.001105453,0.001012161,0.0007319245,0.0001478283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001052125,"about_ca_system_score_gemma":0.0007335799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001279895,"about_ca_topic_score_gemma":0.001295672,"domain_scores_codex":[0.9991912,0.000374493,0.00002178212,0.00004580366,0.0003146916,0.00005193032],"domain_scores_gemma":[0.9981115,0.001262697,0.0002009755,0.0002266894,0.0001721826,0.00002597865],"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.0001005885,0.00003411763,0.0003956222,0.0001213774,0.00002420085,0.0001709222,0.0002970455,0.6714904,0.01358688,0.2826123,0.0008406178,0.03032577],"study_design_scores_gemma":[0.0000145809,0.00003520694,0.00005623446,0.00001078277,0.000004765178,0.00004455441,0.00001271095,0.9517071,0.001463915,0.04601003,0.0006309688,0.000009146381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02647057,0.0004581616,0.9706846,0.0002521969,0.00001757576,0.00003493774,0.00002122471,0.0001110935,0.001949609],"genre_scores_gemma":[0.8209498,0.0006230015,0.176489,0.0001156698,0.00004072515,0.0001869659,0.00005394311,0.00002658288,0.001514305],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001471202,"threshold_uncertainty_score":0.007780552,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149201487","doi":"10.1109/icc.2006.255525","title":"Comparison between Convolutional and LDPC Code-based Turbo Frequency Domain Equalization","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":27,"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":"Convolutional code; Turbo code; Turbo equalizer; Computer science; Serial concatenated convolutional codes; Turbo; Low-density parity-check code; Equalization (audio); Algorithm; Frequency domain; Computational complexity theory; Concatenated error correction code; Decoding methods; Electronic engineering; Theoretical computer science; Block code; Error floor; Engineering","authors":[{"name":"Maryam Sabbaghian","is_ca":true},{"name":"D.D. Falconer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09658232150747445,"gpt":0.3654450014993963,"spread":0.2688626799919218,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007664508,0.0003785693,0.0004790903,0.0006854636,0.0002615901,0.0004631761,0.0004575872,0.0008919932,0.002099526],"category_scores_gemma":[0.004806394,0.0001537703,0.0002142174,0.0005687439,0.0003509319,0.0008126701,0.0003905154,0.0003447262,0.0004770464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003740111,"about_ca_system_score_gemma":0.0005198078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001466285,"about_ca_topic_score_gemma":0.002340693,"domain_scores_codex":[0.9992977,0.0002334217,0.00002943942,0.00004382502,0.0003190247,0.00007651249],"domain_scores_gemma":[0.9964914,0.002376362,0.0001041014,0.0002079452,0.0007596933,0.00006059492],"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.004802919,0.0002422002,0.006797628,0.0006825815,0.0003608901,0.0004207463,0.0002446604,0.3383404,0.1302468,0.01733157,0.00214006,0.4983897],"study_design_scores_gemma":[0.0001091809,0.0007372243,0.003921965,0.00004523111,0.0001553523,0.0007017356,0.00003693032,0.8562338,0.1326077,0.00183827,0.003534887,0.00007781225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3076262,0.002539364,0.6747961,0.0003474667,0.0001834838,0.00009355668,0.0001097285,0.001071882,0.01323222],"genre_scores_gemma":[0.8574311,0.001043015,0.1362177,0.0001617448,0.00008003882,0.00003849735,0.000141239,0.00007604137,0.004810621],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002099526,"threshold_uncertainty_score":0.007023573,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105474416","doi":"10.1109/icc.2006.255702","title":"Concentric Anchor-Beacons (CAB) Localization for Wireless Sensor Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beacon; Wireless sensor network; Electric beacon; Computer science; Node (physics); Intersection (aeronautics); Centroid; Range (aeronautics); Concentric; Wireless; Position (finance); Key distribution in wireless sensor networks; Real-time computing; Computer network; Wireless network; Engineering; Artificial intelligence; Mathematics; Telecommunications; Geometry","authors":[{"name":"Vijayanth Vivekanandan","is_ca":true},{"name":"Vincent W. S. Wong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04343659894178009,"gpt":0.2885356928234035,"spread":0.2450990938816234,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001026571,0.0007628651,0.0005756807,0.0008135112,0.0006343799,0.0004894671,0.001386628,0.0008637416,0.001270872],"category_scores_gemma":[0.003948211,0.0003298818,0.0004234314,0.001762146,0.0009405114,0.001398522,0.001069614,0.000693017,0.0009550438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005701249,"about_ca_system_score_gemma":0.0006835212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001552973,"about_ca_topic_score_gemma":0.001286215,"domain_scores_codex":[0.9989356,0.0003724672,0.00005392533,0.0001710498,0.0004272265,0.00003964459],"domain_scores_gemma":[0.9989533,0.000342772,0.0002235462,0.0001928848,0.0002406581,0.00004679749],"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.0002845271,0.00004606289,0.001427184,0.0009615399,0.00009843482,0.0002761165,0.0004444375,0.1362729,0.03112597,0.1126087,0.01593706,0.700517],"study_design_scores_gemma":[0.0001009597,0.0004022367,0.0009637881,0.0001564028,0.00009883034,0.001584195,0.0001302952,0.7725288,0.02221913,0.0735787,0.1281241,0.0001126125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00214607,0.002213201,0.9937392,0.0001395217,0.0001244249,0.00003095027,0.00002018229,0.0006455671,0.0009409569],"genre_scores_gemma":[0.2189389,0.005979351,0.7709042,0.000185631,0.0003094752,0.0002347557,0.0002777869,0.0001307972,0.00303911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001552973,"threshold_uncertainty_score":0.005429089,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130148470","doi":"10.1109/icc.2006.255170","title":"Quick Birkhoff-von Neumann Decomposition Algorithm for Agile All-Photonic Network Cores","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Canada Research Chairs; University of Ottawa","keywords":"Computer science; Scheduling (production processes); Von Neumann architecture; Time-division multiplexing; Algorithm; Cover (algebra); Multiplexing; Heuristics; Overhead (engineering); Distributed computing; Computer network; Mathematical optimization; Mathematics; Engineering; Telecommunications","authors":[{"name":"Gregor von Bochmann","is_ca":true},{"name":"Trevor J. Hall","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04859452152153041,"gpt":0.3282966524921064,"spread":0.2797021309705759,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006483637,0.000598842,0.0005184858,0.0006139,0.0004768721,0.0006399119,0.0006705566,0.0004507523,0.002334634],"category_scores_gemma":[0.001821484,0.0003726146,0.0003594199,0.0005318695,0.0004945995,0.0009934272,0.0009426411,0.0007346114,0.000529639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008510805,"about_ca_system_score_gemma":0.001214684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001993167,"about_ca_topic_score_gemma":0.002338229,"domain_scores_codex":[0.9995615,0.0001338814,0.00001999672,0.00004846214,0.0001531765,0.00008291247],"domain_scores_gemma":[0.999483,0.0002537017,0.00004676237,0.00006645228,0.0001044079,0.00004570244],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004319923,0.0001147598,0.0007362303,0.0001603116,0.00004021877,0.0001068664,0.0001642765,0.6102189,0.0167413,0.07524701,0.00477814,0.29126],"study_design_scores_gemma":[0.00002062573,0.00002465436,0.00005042895,0.000005221591,0.000001969288,0.00001730449,0.00001442831,0.9739105,0.002133904,0.02279662,0.001019369,0.000005089069],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02350989,0.000103442,0.9736065,0.00007566785,0.00002350931,0.00005329705,0.00004036015,0.0003319772,0.002255352],"genre_scores_gemma":[0.2801505,0.0001100423,0.7168293,0.0000771026,0.00001987907,0.0001858756,0.0002229661,0.0001261612,0.002278179],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002334634,"threshold_uncertainty_score":0.007810116,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151524846","doi":"10.1109/icc.2006.254792","title":"TCP NewReno: Slow-but-Steady or Impatient?","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":23,"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":"Burstiness; Computer science; Throughput; H-TCP; CUBIC TCP; TCP global synchronization; Network packet; TCP Friendly Rate Control; TCP acceleration; Computer network; Real-time computing; Transmission Control Protocol; Telecommunications","authors":[{"name":"Nadim Parvez","is_ca":true},{"name":"Anirban Mahanti","is_ca":true},{"name":"Carey Williamson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07612764646207502,"gpt":0.3189690561084509,"spread":0.2428414096463758,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00357656,0.0009677265,0.001020606,0.001465515,0.0008943349,0.00249128,0.002004281,0.001191456,0.0008565012],"category_scores_gemma":[0.01957417,0.0004805031,0.0007339637,0.001190663,0.001487158,0.00357622,0.001199574,0.002079667,0.0002872942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007968693,"about_ca_system_score_gemma":0.0006401694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001490984,"about_ca_topic_score_gemma":0.00155918,"domain_scores_codex":[0.9978102,0.0004635734,0.0001642187,0.0003086654,0.0008646632,0.000388717],"domain_scores_gemma":[0.9903849,0.003389869,0.001493766,0.001971633,0.001907445,0.0008524336],"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.01371661,0.002415736,0.1433269,0.001281392,0.002043332,0.002979101,0.002344939,0.3949524,0.1106771,0.07273579,0.009397044,0.2441296],"study_design_scores_gemma":[0.000555229,0.007007718,0.07803325,0.0002289336,0.0009932859,0.003495966,0.001853171,0.7931998,0.06147158,0.03838265,0.01416506,0.0006134023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9440393,0.002128238,0.04304228,0.0007422006,0.0004034241,0.0003114202,0.0003341191,0.001007764,0.007991174],"genre_scores_gemma":[0.9934809,0.0004342285,0.004915512,0.0001636246,0.00007048052,0.00006903831,0.0001635965,0.00008666681,0.0006159122],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00357656,"threshold_uncertainty_score":0.01891488,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118058487","doi":"10.1109/icc.2006.255763","title":"Downlink Joint Base-station Assignment and Packet Scheduling Algorithm for Cellular CDMA/TDMA Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":23,"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":"Time division multiple access; Base station; Computer science; Network packet; Computer network; Transmission delay; Telecommunications link; Scheduling (production processes); Cellular network; Code division multiple access; Optimization problem; Real-time computing; Algorithm; Mathematical optimization; Mathematics","authors":[{"name":"Keivan Navaie","is_ca":true},{"name":"Halim Yanıkömeroğlu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05015300850426564,"gpt":0.2786098435428289,"spread":0.2284568350385632,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006149412,0.0005854208,0.0007482939,0.0004053969,0.0004957051,0.0009074676,0.0008721481,0.0005874794,0.001756458],"category_scores_gemma":[0.001140715,0.0003275062,0.000264162,0.0006772104,0.0003932678,0.0006286627,0.0006841302,0.0006635756,0.0004990982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001108985,"about_ca_system_score_gemma":0.001594301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004534022,"about_ca_topic_score_gemma":0.004077057,"domain_scores_codex":[0.9996333,0.0001090846,0.00001557003,0.00006545371,0.00009098039,0.00008560751],"domain_scores_gemma":[0.9996675,0.000144858,0.00005158814,0.00003273689,0.00006926217,0.00003410623],"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.0002096757,0.0001307322,0.0005547362,0.00004916193,0.00002881208,0.00005894173,0.00006779618,0.8449435,0.003595035,0.01110812,0.002235164,0.1370182],"study_design_scores_gemma":[0.00001600724,0.00001810421,0.0000406598,0.000001382175,0.00000290992,0.00000872894,0.000006141394,0.9979632,0.0004492947,0.001231846,0.0002598377,0.000001999304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0233292,0.0001659774,0.9740879,0.0001019793,0.00003428983,0.00005879463,0.00003255655,0.0004235301,0.001765871],"genre_scores_gemma":[0.5453139,0.0002115483,0.4500316,0.0001145057,0.00004477628,0.0002675788,0.0001759204,0.0000869697,0.003753231],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004534022,"threshold_uncertainty_score":0.009015262,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077340013","doi":"10.1109/icc.2006.255490","title":"Improved Pilot-Assisted Prediction of Unknown Time-Selective Rayleigh Channels","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; Queen's University","funders":"","keywords":"Fading; Rayleigh fading; Computer science; Channel (broadcasting); Transmitter; Channel state information; Block (permutation group theory); Algorithm; Electronic engineering; Wireless; Telecommunications; Engineering; Mathematics","authors":[{"name":"Kareem E. Baddour","is_ca":true},{"name":"Norman C. Beaulieu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05413553195223243,"gpt":0.2966745473276717,"spread":0.2425390153754393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004864227,0.0004556314,0.0003726651,0.0002086265,0.0002234264,0.000300076,0.0005106868,0.0003399453,0.0004431532],"category_scores_gemma":[0.002670083,0.0002442384,0.0001716897,0.0002783973,0.0003616613,0.0007300434,0.0004187737,0.0006592196,0.000218698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001824378,"about_ca_system_score_gemma":0.00073374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002211251,"about_ca_topic_score_gemma":0.00291987,"domain_scores_codex":[0.9997196,0.00007706388,0.00001295736,0.00003646734,0.000106842,0.00004703911],"domain_scores_gemma":[0.998913,0.0005920308,0.0001275445,0.0001339447,0.0002005814,0.00003289272],"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.0007191446,0.00009362702,0.002323664,0.0001341975,0.00006325884,0.0004565112,0.0003789459,0.6146269,0.09746505,0.007837257,0.002006295,0.2738951],"study_design_scores_gemma":[0.00001307078,0.00007696605,0.0002797552,0.000005291537,0.000007628533,0.0000657152,0.000009312445,0.9891635,0.009242747,0.0007145362,0.000410101,0.00001131393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06680302,0.000370056,0.93132,0.00009573899,0.00005208749,0.0000208424,0.00004165199,0.000549918,0.0007466947],"genre_scores_gemma":[0.8626866,0.0004023192,0.1354589,0.00005782255,0.00005715119,0.00004142737,0.00009541541,0.00002535556,0.001174927],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002211251,"threshold_uncertainty_score":0.004396796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157382712","doi":"10.1109/icc.2006.255055","title":"Peer-to-Peer Mobility Management for all-IP Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":21,"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 science; Mobility management; Computer network; Scalability; Robustness (evolution); Single point of failure; Mobility model; File sharing; Wireless network; Mobile computing; Distributed computing; Wireless; Telecommunications; The Internet; World Wide Web; Database","authors":[{"name":"Ramy Farha","is_ca":true},{"name":"Khashayar Khavari","is_ca":true},{"name":"Nadeem Abji","is_ca":true},{"name":"Alberto Leon‐Garcia","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08502782887775434,"gpt":0.3521103720367123,"spread":0.267082543158958,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001385205,0.0006518784,0.0008119445,0.0005845036,0.001780408,0.001960485,0.002589607,0.001083521,0.003876639],"category_scores_gemma":[0.003932354,0.0003079908,0.0003436869,0.001054686,0.0008124762,0.003296761,0.001720962,0.001162824,0.0019521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008783374,"about_ca_system_score_gemma":0.001321727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001710179,"about_ca_topic_score_gemma":0.001871491,"domain_scores_codex":[0.9987561,0.0003035326,0.0001023512,0.000197513,0.0005490785,0.00009136456],"domain_scores_gemma":[0.9989448,0.0002500587,0.000154,0.0002736812,0.0002825414,0.00009485277],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002889284,0.0001644911,0.001181314,0.001230331,0.0001162782,0.001016591,0.0008529422,0.0630867,0.0251907,0.262848,0.05520632,0.5888174],"study_design_scores_gemma":[0.0001239953,0.0003235128,0.001308634,0.0001848596,0.0001381633,0.001394122,0.0002978095,0.4906017,0.01030132,0.2179605,0.2772222,0.0001431152],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009660242,0.006301093,0.9648574,0.001701073,0.0007110833,0.0005052709,0.0001670695,0.002977357,0.01311939],"genre_scores_gemma":[0.4065229,0.01011376,0.560514,0.00048658,0.00167152,0.001379229,0.000945939,0.0003983686,0.01796765],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003876639,"threshold_uncertainty_score":0.0129686,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095627734","doi":"10.1109/icc.2006.255692","title":"A Radio Resource Management Framework for IEEE 802.16-Based OFDM/TDD Wireless Mesh Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":20,"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 network; Computer science; Quality of service; Default gateway; Network packet; Wireless mesh network; Admission control; IEEE 802.11s; Queueing theory; IEEE 802; Call Admission Control; Wireless network; Wireless; Telecommunications","authors":[{"name":"Dusit Niyato","is_ca":true},{"name":"Ekram Hossain","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03646006721821619,"gpt":0.2930607101419478,"spread":0.2566006429237316,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001739513,0.0008331942,0.0006959991,0.0005580088,0.0007327774,0.001404734,0.002121639,0.0008905665,0.00237141],"category_scores_gemma":[0.0012077,0.0003587344,0.0008017657,0.0005415631,0.0006938732,0.001424879,0.001247991,0.001387663,0.0007456125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001019169,"about_ca_system_score_gemma":0.001537329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003950571,"about_ca_topic_score_gemma":0.004552918,"domain_scores_codex":[0.9993673,0.0001757224,0.00004581007,0.00007035148,0.000273803,0.00006706797],"domain_scores_gemma":[0.9997355,0.00007461874,0.00004120095,0.00004093603,0.00007625383,0.00003141879],"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.00003961062,0.0001293175,0.0003243352,0.0001954965,0.00006925833,0.0003377518,0.0001939268,0.4666947,0.008588909,0.417793,0.007279198,0.09835441],"study_design_scores_gemma":[0.00002881615,0.00008215897,0.0001149487,0.00003611364,0.0000302769,0.0001265568,0.00003648147,0.9165252,0.001635141,0.05180562,0.02954802,0.00003065022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001419264,0.0003568298,0.9953728,0.000187712,0.0000666196,0.00007994787,0.00004590508,0.0002894781,0.002181338],"genre_scores_gemma":[0.1286075,0.001179179,0.8641071,0.0001651673,0.0002087782,0.0007546311,0.0002080533,0.00008673805,0.004682741],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003950571,"threshold_uncertainty_score":0.00919956,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145384758","doi":"10.1109/icc.2006.255675","title":"On the Connectivity and Average Delay of Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":17,"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":"Waypoint; Wireless ad hoc network; Mobility model; Computer science; Computer network; Mobile ad hoc network; Transmission delay; Transmission (telecommunications); Range (aeronautics); Delay-tolerant networking; Topology (electrical circuits); Optimized Link State Routing Protocol; Mathematics; Real-time computing; Wireless; Telecommunications; Network packet; Engineering; Combinatorics","authors":[{"name":"Golnaz Farhadi","is_ca":true},{"name":"Norman C. Beaulieu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04000734000203587,"gpt":0.2912070029101281,"spread":0.2511996629080923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002075401,0.0014344,0.000948581,0.001810174,0.0006086677,0.001544202,0.001399491,0.001159522,0.001609553],"category_scores_gemma":[0.02382371,0.0004487064,0.0004921282,0.002790034,0.001990714,0.005006245,0.0009306321,0.0016013,0.0003950259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001664452,"about_ca_system_score_gemma":0.0006310236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001816868,"about_ca_topic_score_gemma":0.0009752087,"domain_scores_codex":[0.9987037,0.0003966768,0.00006590912,0.0002076374,0.0004924309,0.0001335916],"domain_scores_gemma":[0.9843998,0.01271526,0.00107361,0.0003203648,0.001294218,0.0001967648],"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.0001477281,0.00006499967,0.001755966,0.000400113,0.00008241709,0.0004361111,0.0003344766,0.7402921,0.003648168,0.2058235,0.002539286,0.04447506],"study_design_scores_gemma":[0.00002228964,0.0001336181,0.0006850065,0.0001029488,0.00005093535,0.000426374,0.00008093182,0.8537734,0.001148349,0.1365315,0.00700445,0.00004030121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05870268,0.02557703,0.9004388,0.002044665,0.0007603373,0.00007476098,0.0001536224,0.000272381,0.01197571],"genre_scores_gemma":[0.8844822,0.03476236,0.07205259,0.0005693769,0.002049652,0.0003015954,0.0002848295,0.0002143313,0.005283078],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002075401,"threshold_uncertainty_score":0.01207644,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981954312","doi":"10.1109/icc.2006.255544","title":"Joint Bandwidth Allocation and Connection Admission Control for Polling Services in IEEE 802.16 Broadband Wireless Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":17,"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":"Polling; Computer science; Computer network; Wireless broadband; Bandwidth allocation; Admission control; Link adaptation; IEEE 802; Network packet; Queueing theory; Bandwidth (computing); Wireless network; Wireless; Quality of service; Telecommunications; Channel (broadcasting); Fading","authors":[{"name":"Dusit Niyato","is_ca":true},{"name":"Ekram Hossain","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02831310386250166,"gpt":0.2732424491771529,"spread":0.2449293453146512,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002370075,0.0005786932,0.0007886626,0.0005406448,0.0005884371,0.001258506,0.001021307,0.0009136726,0.0005216186],"category_scores_gemma":[0.006713008,0.000336941,0.0003585614,0.0007531504,0.001057917,0.001222353,0.0008399253,0.0009110043,0.00008081845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001127603,"about_ca_system_score_gemma":0.001562255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004762508,"about_ca_topic_score_gemma":0.002696361,"domain_scores_codex":[0.9978505,0.0008738624,0.00008488974,0.0001859198,0.0007622762,0.0002425018],"domain_scores_gemma":[0.9986209,0.0007545889,0.0002489824,0.0001348767,0.0001692085,0.00007144706],"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.000228401,0.0001498202,0.001107734,0.00006454097,0.00006113834,0.0001065462,0.0001304071,0.8446239,0.008398455,0.03120879,0.0008638041,0.1130565],"study_design_scores_gemma":[0.00001069959,0.00003098383,0.0001787464,0.000002733481,0.0000103838,0.00002540122,0.000006206981,0.9938354,0.001055204,0.004566629,0.0002695047,0.000008164589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06024581,0.0009807963,0.9359186,0.0002451504,0.00007535263,0.00005104287,0.000009910599,0.0003720557,0.00210126],"genre_scores_gemma":[0.9590616,0.0002832209,0.03958328,0.0000489857,0.00006288275,0.00005488111,0.00001179088,0.0000215769,0.0008717073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004762508,"threshold_uncertainty_score":0.01253432,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148446350","doi":"10.1109/icc.2006.255751","title":"A low-complexity Generalized Sphere Decoding Approach for Underdetermined MIMO Systems","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Underdetermined system; Decoding methods; Cholesky decomposition; MIMO; Algorithm; Mathematics; Matrix (chemical analysis); QR decomposition; Diagonal; Dimension (graph theory); Transformation (genetics); Matrix decomposition; Rank (graph theory); Reduction (mathematics); Computational complexity theory; Computer science; Theoretical computer science; Channel (broadcasting); Combinatorics; Eigenvalues and eigenvectors; Telecommunications","authors":[{"name":"Ping Wang","is_ca":true},{"name":"Tho Le‐Ngoc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1396288473893694,"gpt":0.3443457400564485,"spread":0.204716892667079,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008579383,0.001119081,0.001076158,0.0005723289,0.0005106204,0.0009886548,0.0006502889,0.0009243406,0.001840459],"category_scores_gemma":[0.003528195,0.0002992073,0.0005167646,0.001118708,0.0009187699,0.0009794856,0.001465592,0.001097775,0.001107259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005367302,"about_ca_system_score_gemma":0.001395672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002004205,"about_ca_topic_score_gemma":0.003098716,"domain_scores_codex":[0.9985813,0.0006505083,0.00006812751,0.00018846,0.0004467475,0.00006494379],"domain_scores_gemma":[0.998764,0.0005470883,0.00009612605,0.0002988317,0.0002498102,0.00004418576],"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.0002218262,0.00006130388,0.0005942093,0.0002679496,0.0001170672,0.0002486606,0.000298449,0.3404519,0.02707976,0.1028683,0.005819463,0.5219711],"study_design_scores_gemma":[0.00002154308,0.00006323927,0.0001566813,0.0000158368,0.00001140099,0.0002667917,0.00003025382,0.9589328,0.01025853,0.02437756,0.005829779,0.00003560885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002080172,0.0001451178,0.996805,0.00007190528,0.00001789659,0.0000113371,0.00002396931,0.0001556908,0.000688931],"genre_scores_gemma":[0.1072572,0.0005515049,0.8894323,0.0001335514,0.00008107289,0.00006457884,0.0002097235,0.00006959396,0.002200495],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002004205,"threshold_uncertainty_score":0.006156981,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121489931","doi":"10.1109/icc.2006.255664","title":"An Improved Busy-Tone Solution for Collision Avoidance in Wireless Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":16,"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; Transmitter; Wireless ad hoc network; Network packet; Channel (broadcasting); Tone (literature); Throughput; Carrier sense multiple access with collision avoidance; Multiple Access with Collision Avoidance for Wireless; Hidden node problem; Wireless; Terminal (telecommunication); Real-time computing; Vehicular ad hoc network; Wireless network; Telecommunications; Wi-Fi array","authors":[{"name":"Ping Wang","is_ca":true},{"name":"Weihua Zhuang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04608635342127172,"gpt":0.3341788762120321,"spread":0.2880925227907604,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009417039,0.0005623148,0.0007528594,0.0006560364,0.0008154149,0.0009240144,0.001356774,0.0006850261,0.001139578],"category_scores_gemma":[0.002874232,0.0003032078,0.0003062446,0.0006235321,0.0005987287,0.001640201,0.001563975,0.001010521,0.0003562694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002803435,"about_ca_system_score_gemma":0.0006437049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005004961,"about_ca_topic_score_gemma":0.0006648758,"domain_scores_codex":[0.9992402,0.0002365477,0.00003953893,0.0000877381,0.0002887881,0.000107263],"domain_scores_gemma":[0.9990714,0.0003411944,0.00008692672,0.0001544767,0.0002566107,0.00008934239],"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.001059567,0.0003425464,0.001599846,0.0007063975,0.0002223007,0.000974034,0.001296273,0.09792479,0.158673,0.07902507,0.004487762,0.6536884],"study_design_scores_gemma":[0.0003150083,0.001513545,0.0008236741,0.00006859544,0.000215275,0.001531786,0.0002754769,0.9100083,0.03418342,0.03336225,0.01755796,0.0001447804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05294042,0.002212238,0.9417926,0.0002019952,0.0002084583,0.000110562,0.00002260073,0.0005100933,0.002001082],"genre_scores_gemma":[0.7176042,0.001328167,0.2767034,0.0003591948,0.0002327992,0.000174601,0.00006533043,0.00005717366,0.003475066],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001356774,"threshold_uncertainty_score":0.004980266,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120477018","doi":"10.1109/icc.2006.255398","title":"Queueing Analysis of 802.11e HCCA with Variable Bit Rate Traffic","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba; University of British Columbia","funders":"","keywords":"Computer science; Quality of service; Variable bitrate; Computer network; Queueing theory; Call Admission Control; Scheduling (production processes); IEEE 802; Admission control; Provisioning; Parameterized complexity; Wireless; Wireless network; Telecommunications; Engineering","authors":[{"name":"Mohammad Mamunur Rashid","is_ca":true},{"name":"Ekram Hossain","is_ca":true},{"name":"Vijay K. Bhargava","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05647420380720716,"gpt":0.3162094292700714,"spread":0.2597352254628643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002060864,0.0006142635,0.0006894374,0.0008734055,0.0007600037,0.001438462,0.001302581,0.0007511109,0.002341471],"category_scores_gemma":[0.006709629,0.0003084869,0.0004310086,0.0006504286,0.001081369,0.001391744,0.000731981,0.0009490462,0.000347061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004478301,"about_ca_system_score_gemma":0.001938084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03452307,"about_ca_topic_score_gemma":0.008823778,"domain_scores_codex":[0.9989117,0.0002641014,0.00003867961,0.0001303619,0.0003981891,0.0002568589],"domain_scores_gemma":[0.9961911,0.002015048,0.0002836915,0.0001345068,0.001209803,0.0001658341],"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.0001767312,0.0001303629,0.002061566,0.00006818437,0.0000378473,0.0002183804,0.0002887704,0.822001,0.00881618,0.1561328,0.002688814,0.007379306],"study_design_scores_gemma":[0.000003173278,0.000006241043,0.0001404953,0.000001358763,0.000001783684,0.000005756013,0.0000113526,0.9972651,0.0001554645,0.002303223,0.0001017739,0.000004245684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.372957,0.002553204,0.5927119,0.002044932,0.0003432579,0.0002340709,0.0005870186,0.0008018793,0.02776672],"genre_scores_gemma":[0.9879096,0.000434589,0.007702939,0.00009475079,0.00007465029,0.00005086311,0.0001505036,0.00005444008,0.00352767],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03452307,"threshold_uncertainty_score":0.06864423,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146283190","doi":"10.1109/icc.2006.255644","title":"A Self-Adaptive Detection System for MAC Misbehavior in Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Timeout; Network packet; Node (physics); Wireless ad hoc network; Mobile ad hoc network; Intrusion detection system; Transmission (telecommunications); Protocol (science); Transmitter; Process (computing); Packet forwarding; Computer security; Wireless; Channel (broadcasting); Engineering; Telecommunications","authors":[{"name":"Lei Guang","is_ca":true},{"name":"Chadi Assi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05146023725527795,"gpt":0.3018598311065452,"spread":0.2503995938512673,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001886145,0.0007974489,0.0006410449,0.00120436,0.000714464,0.0009316723,0.001698508,0.0009809083,0.001161978],"category_scores_gemma":[0.006788421,0.0004162708,0.0003170557,0.0003082552,0.0007572265,0.001333139,0.0007519134,0.001045091,0.000639985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004675972,"about_ca_system_score_gemma":0.0008228068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009092076,"about_ca_topic_score_gemma":0.0007663329,"domain_scores_codex":[0.9987743,0.0002800116,0.0001251521,0.0002123731,0.0005309103,0.00007725255],"domain_scores_gemma":[0.9947916,0.001499163,0.0006303492,0.001228678,0.001563449,0.0002867959],"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.001247757,0.001604682,0.01344068,0.0003536281,0.0002836732,0.0007992795,0.001067163,0.0623204,0.3521462,0.01169756,0.006010371,0.5490287],"study_design_scores_gemma":[0.0001439529,0.001620791,0.004425518,0.00003866648,0.0001742221,0.0009802876,0.00006638701,0.8181364,0.1617115,0.002429777,0.01013681,0.0001357551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09360639,0.0003112869,0.8808541,0.0001845859,0.000150438,0.0009027762,0.00004859613,0.0217747,0.002167084],"genre_scores_gemma":[0.6942087,0.0001843682,0.3001421,0.0002803919,0.0001038551,0.0005794152,0.0001493182,0.0003627781,0.003988999],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001886145,"threshold_uncertainty_score":0.009975016,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096902129","doi":"10.1109/icc.2006.254709","title":"A Concave Minimization Approach to Dynamic Spectrum Management for Digital Subscriber Lines","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Digital subscriber line; Minification; Mathematical optimization; Convex optimization; Concave function; Computer science; Convex function; Sequence (biology); Optimization problem; Linear programming; Reduction (mathematics); Function (biology); Computational complexity theory; Regular polygon; Dynamic programming; Spectrum (functional analysis); Spread spectrum; Mathematics; Algorithm; Telecommunications; Code division multiple access","authors":[{"name":"Xu Yang","is_ca":true},{"name":"S. Panigrahi","is_ca":true},{"name":"Tho Le‐Ngoc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04723828310420473,"gpt":0.2962215680881629,"spread":0.2489832849839581,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000981078,0.001580027,0.0009521864,0.0004801375,0.0004807454,0.001182993,0.001071685,0.0009148595,0.002335035],"category_scores_gemma":[0.001631675,0.0005471141,0.0006542615,0.0007160914,0.001083759,0.00114437,0.001136142,0.001712414,0.0005562084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001106075,"about_ca_system_score_gemma":0.001138349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002490113,"about_ca_topic_score_gemma":0.00222472,"domain_scores_codex":[0.9995263,0.000166254,0.00001247484,0.00007901384,0.0001519608,0.00006399938],"domain_scores_gemma":[0.9996045,0.0002445436,0.00002541472,0.00002680405,0.00007637556,0.00002241434],"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.0000454935,0.00005875865,0.0001919713,0.00009378187,0.0000218626,0.00006138083,0.00005624785,0.8850026,0.003399925,0.06106205,0.002850022,0.04715595],"study_design_scores_gemma":[0.000003846277,0.00001846581,0.00003158252,0.000003530093,0.000002897591,0.00001060882,0.000006366215,0.9915991,0.0005261819,0.006946323,0.000847724,0.000003307562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00232292,0.0001593288,0.9949355,0.000150747,0.00002233125,0.00001626866,0.00001914794,0.00006149116,0.002312344],"genre_scores_gemma":[0.4613453,0.001492345,0.5231871,0.000395017,0.0002877623,0.0002693295,0.0002013124,0.0003853224,0.01243658],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002490113,"threshold_uncertainty_score":0.00802511,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112869036","doi":"10.1109/icc.2006.255539","title":"Delay-Based Admission Control Using Fuzzy Logic for OFDMA Broadband Wireless Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":14,"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 broadband; Computer network; Admission control; Queueing theory; Orthogonal frequency-division multiple access; Broadband networks; Fuzzy logic; Frequency-division multiple access; Network packet; Wireless network; Channel (broadcasting); Wireless; Orthogonal frequency-division multiplexing; Real-time computing; Quality of service; Broadband; Telecommunications","authors":[{"name":"Dusit Niyato","is_ca":true},{"name":"Ekram Hossain","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05569923601809098,"gpt":0.3114964900403335,"spread":0.2557972540222425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001015976,0.000427691,0.0004414548,0.0004182912,0.0005980073,0.0009789827,0.0009628628,0.0006113593,0.0009582036],"category_scores_gemma":[0.00214559,0.0001717855,0.0003985896,0.0002800836,0.000790526,0.0006878102,0.0003669542,0.0007756873,0.0001345009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001307771,"about_ca_system_score_gemma":0.0009293845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006794655,"about_ca_topic_score_gemma":0.00457432,"domain_scores_codex":[0.9994386,0.0001139465,0.00003829549,0.0001105552,0.0002295844,0.00006902603],"domain_scores_gemma":[0.9993092,0.0004094084,0.00009301198,0.0000254251,0.0001365305,0.00002638649],"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.0004411912,0.0003250082,0.001520713,0.0001808424,0.0000987882,0.0002545546,0.0004297332,0.7325323,0.02970746,0.04396101,0.00119808,0.1893502],"study_design_scores_gemma":[0.00002091251,0.00003657907,0.00009986576,0.000007979508,0.00001345208,0.00002102,0.000007781845,0.993133,0.002457564,0.003857616,0.0003341914,0.00001013047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03441424,0.0002725227,0.962263,0.0001530164,0.00005126277,0.00006073675,0.00001848294,0.0003886868,0.002377951],"genre_scores_gemma":[0.903061,0.0002100735,0.09544635,0.00009120273,0.00004014262,0.00007864005,0.00002542914,0.0000127624,0.001034318],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006794655,"threshold_uncertainty_score":0.01351023,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131133406","doi":"10.1109/icc.2006.255620","title":"Distributed Minimum Energy Data Gathering and Aggregation in Sensor Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Subgradient method; Wireless sensor network; Computer science; Asynchronous communication; Data aggregator; Distributed algorithm; Transmission (telecommunications); Optimization problem; Graph; Distributed computing; Data transmission; Mathematical optimization; Computer network; Algorithm; Theoretical computer science; Mathematics","authors":[{"name":"Kevin C.J. Yuen","is_ca":true},{"name":"Baochun Li","is_ca":true},{"name":"Ben Liang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06984808571987601,"gpt":0.3008524928278922,"spread":0.2310044071080162,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001087394,0.0006671755,0.001124514,0.0003742888,0.0005895832,0.0006673018,0.00116156,0.0007853515,0.0005865859],"category_scores_gemma":[0.001829959,0.0003731473,0.0003686028,0.0006765788,0.0007163617,0.001214923,0.001095628,0.0008425011,0.0001795102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005807069,"about_ca_system_score_gemma":0.0007981497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009368735,"about_ca_topic_score_gemma":0.001081505,"domain_scores_codex":[0.9993267,0.0002490707,0.00002455608,0.0001261779,0.0002250523,0.00004854261],"domain_scores_gemma":[0.9994047,0.0003559457,0.00006956219,0.00007135729,0.00007279141,0.00002562237],"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.0001213508,0.00008318167,0.0004004686,0.0002025716,0.00004450305,0.00007131685,0.0001198991,0.8624635,0.00615984,0.0431533,0.001995194,0.08518487],"study_design_scores_gemma":[0.0000217671,0.0000320186,0.00005542723,0.000004151686,0.000005438853,0.00001969607,0.00001041955,0.985893,0.001086223,0.01161713,0.00125082,0.000003911822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005424658,0.0002937802,0.9932978,0.0001284952,0.00002733458,0.0000246282,0.00001061838,0.0001120607,0.0006806447],"genre_scores_gemma":[0.4773676,0.0007409201,0.5188098,0.0001296154,0.0001062265,0.0002578102,0.00008949246,0.00007959244,0.00241897],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00116156,"threshold_uncertainty_score":0.005750775,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113876301","doi":"10.1109/icc.2006.254801","title":"Novel Scheduling Algorithms for Multimedia Service in OFDM Broadband Wireless Systems","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":12,"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":"Computer science; Link adaptation; Wireless broadband; Orthogonal frequency-division multiplexing; Scheduling (production processes); Algorithm; Wireless; Spectral efficiency; Computer network; WiMAX; Time division multiple access; Broadband networks; Broadband; Wireless network; Fading; Channel (broadcasting); Decoding methods; Telecommunications; Mathematical optimization","authors":[{"name":"Haiying Zhu","is_ca":true},{"name":"Roshdy H. M. Hafez","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0690371081040146,"gpt":0.3127174330668064,"spread":0.2436803249627918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001303408,0.000555021,0.0004664766,0.0005778549,0.0005780937,0.0008453328,0.000841851,0.0006535212,0.001172908],"category_scores_gemma":[0.003743105,0.0002050779,0.0002462183,0.0009033749,0.0004493339,0.0009846695,0.0005322542,0.0007134991,0.0003582081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009174327,"about_ca_system_score_gemma":0.0009260504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009961388,"about_ca_topic_score_gemma":0.001147443,"domain_scores_codex":[0.9994217,0.0001812334,0.0000419959,0.00006310984,0.0002399098,0.00005212233],"domain_scores_gemma":[0.9991841,0.000426329,0.0001106125,0.00007036381,0.0001790694,0.0000294907],"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.0002011327,0.0001469367,0.000644777,0.0002186356,0.00004111517,0.0001191895,0.0001557104,0.4385948,0.01527749,0.1867178,0.005813468,0.3520688],"study_design_scores_gemma":[0.00002183889,0.00003428699,0.00008488177,0.000009397888,0.000006371854,0.00006274913,0.00001389674,0.9789045,0.001564856,0.01545136,0.003837787,0.000007957794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01086067,0.001147156,0.9846497,0.0002012865,0.0001828625,0.00006700768,0.00002758421,0.0001953395,0.002668353],"genre_scores_gemma":[0.3682817,0.002161875,0.6244496,0.0002304718,0.0007158724,0.0002585513,0.0001099259,0.00006728742,0.003724682],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001303408,"threshold_uncertainty_score":0.006893158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130788090","doi":"10.1109/icc.2006.255350","title":"Distributed Space-Time Block Coded OFDM for Relay-Assisted Transmission","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"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":"Orthogonal frequency-division multiplexing; Relay; Space–time block code; Computer science; Fading; Multipath propagation; Interleaving; Block code; Antenna diversity; Relay channel; Electronic engineering; Transmission (telecommunications); Diversity scheme; Diversity gain; Multiplexing; Telecommunications; Decoding methods; Channel (broadcasting); Wireless; Engineering; Power (physics); Physics","authors":[{"name":"H. Mheidat","is_ca":true},{"name":"Murat Uysal","is_ca":true},{"name":"Naofal Al‐Dhahir","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09538596805359514,"gpt":0.3377662854817189,"spread":0.2423803174281238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002550983,0.0002752815,0.0002353114,0.0001477263,0.0001315359,0.0002970191,0.0003766528,0.0003481965,0.0008053631],"category_scores_gemma":[0.0007905391,0.0000731615,0.0001639636,0.0002479186,0.0001862021,0.0002818929,0.0001924918,0.0002558786,0.0001875846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003411205,"about_ca_system_score_gemma":0.0003962109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008711411,"about_ca_topic_score_gemma":0.001294084,"domain_scores_codex":[0.9998367,0.00005822447,0.000004722152,0.00001774443,0.0000651551,0.0000173385],"domain_scores_gemma":[0.9996611,0.0001758104,0.00003895393,0.00003825948,0.00007742319,0.00000840879],"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.0001705087,0.00007284014,0.000948202,0.0003193041,0.00006810127,0.0004663043,0.0001419332,0.6977859,0.0945768,0.101202,0.001466963,0.1027812],"study_design_scores_gemma":[0.00000695317,0.00006226386,0.000129247,0.000007815177,0.000008541207,0.00008434823,0.000007342113,0.9911647,0.004465642,0.002886079,0.001171579,0.000005474406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07741258,0.001774969,0.9141581,0.0001544233,0.0000683527,0.0000353061,0.00006433622,0.0001174815,0.006214448],"genre_scores_gemma":[0.9071478,0.000930796,0.09001717,0.00004427266,0.00003586356,0.00003451791,0.00004943453,0.000008445435,0.001731702],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0008711411,"threshold_uncertainty_score":0.00269413,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113268536","doi":"10.1109/icc.2006.255484","title":"Antijamming Capacity and Performance Analysis of Multiple Access Spread Spectrum Systems in AWGN and Fading Environments","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":10,"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":"Jamming; Frequency-hopping spread spectrum; Computer science; Fading; Spread spectrum; Additive white Gaussian noise; Rayleigh fading; Telecommunications link; Bandwidth (computing); Channel (broadcasting); Computer network; Channel state information; Electronic engineering; Telecommunications; Wireless; Engineering","authors":[{"name":"Reza Nikjah","is_ca":true},{"name":"Norman C. Beaulieu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1166588041686524,"gpt":0.3385819704779986,"spread":0.2219231663093462,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002023843,0.001254664,0.0008310818,0.001813767,0.0005406464,0.00128311,0.000909738,0.001183859,0.001231104],"category_scores_gemma":[0.009049276,0.0004077447,0.0004712433,0.001557389,0.0015266,0.001766559,0.001004297,0.001064856,0.0003449082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001305448,"about_ca_system_score_gemma":0.0008184813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003499733,"about_ca_topic_score_gemma":0.00142127,"domain_scores_codex":[0.9983414,0.0006174083,0.00004171576,0.0001136038,0.000593694,0.0002919806],"domain_scores_gemma":[0.9931946,0.004372027,0.0005924888,0.0004351503,0.001292735,0.000112966],"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.0001143364,0.00005858826,0.0008879026,0.0001181767,0.00003647917,0.0002434187,0.000153266,0.900598,0.00624489,0.07764655,0.0008002112,0.01309819],"study_design_scores_gemma":[0.000001679138,0.00002437454,0.0002759042,0.000008132291,0.000005608716,0.00005723875,0.00001528153,0.9916463,0.0006516927,0.007155704,0.000147071,0.0000110266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2137919,0.003373684,0.7627124,0.0006843967,0.00008778697,0.00005954665,0.0002473154,0.0006213555,0.01842161],"genre_scores_gemma":[0.9884263,0.001207183,0.00847442,0.00005243457,0.0001012136,0.0000557614,0.0001022564,0.0000440913,0.001536262],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003499733,"threshold_uncertainty_score":0.01070327,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135207211","doi":"10.1109/icc.2006.255627","title":"A Position-Based QoS Routing Scheme for UWB Ad-Hoc Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"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; Wireless ad hoc network; Quality of service; Adaptive quality of service multi-hop routing; Reservation; Optimized Link State Routing Protocol; Wireless Routing Protocol; Bandwidth (computing); Ad hoc wireless distribution service; Dynamic Source Routing; Destination-Sequenced Distance Vector routing; Routing (electronic design automation); Wireless; Mobile ad hoc network; Geographic routing; Routing protocol; Distributed computing; Telecommunications; Network packet","authors":[{"name":"Atef Abdrabou","is_ca":true},{"name":"Weihua Zhuang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05844183790473124,"gpt":0.3214503915157503,"spread":0.263008553611019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007361093,0.0004992147,0.0003902985,0.0005851567,0.0009261841,0.0007449778,0.001075327,0.000617063,0.001247673],"category_scores_gemma":[0.00154503,0.0001885278,0.0003089637,0.0004565689,0.0005020275,0.001085087,0.0008247909,0.000835144,0.00060987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006170169,"about_ca_system_score_gemma":0.0004467889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005252933,"about_ca_topic_score_gemma":0.0007473703,"domain_scores_codex":[0.9994654,0.0001111987,0.00005131884,0.00008441252,0.0002359388,0.00005177863],"domain_scores_gemma":[0.9993256,0.0001113196,0.00009333438,0.0001355466,0.000264471,0.00006975677],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005012825,0.0002080622,0.0009753825,0.0003965808,0.00007831116,0.0005500829,0.0005457944,0.05509637,0.256029,0.1099604,0.00739145,0.5682673],"study_design_scores_gemma":[0.0002015093,0.001509859,0.001376665,0.00009706272,0.00019307,0.002560235,0.0002385201,0.7069079,0.1474923,0.02887298,0.1102839,0.0002658892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03176087,0.001347873,0.9590479,0.0005603503,0.0007064298,0.0001726999,0.00008211396,0.001351008,0.004970765],"genre_scores_gemma":[0.5056254,0.001289595,0.4827368,0.0004101166,0.0003782878,0.0001797293,0.0003243388,0.0001156296,0.008940113],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001247673,"threshold_uncertainty_score":0.004476786,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022961962","doi":"10.1109/icc.2006.254859","title":"Slope Domain Modeling and Analysis of Data Communication Networks: A Network Calculus Complement","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"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":"Complement (music); Network calculus; Computer science; Frequency domain; Legendre transformation; Algorithm; Domain (mathematical analysis); Domain analysis; Network analysis; Dual (grammatical number); Calculus (dental); Theoretical computer science; Applied mathematics; Mathematics; Mathematical analysis; Telecommunications","authors":[{"name":"Farshid Agharebparast","is_ca":true},{"name":"Victor C. M. Leung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1065234614758738,"gpt":0.3396266418671379,"spread":0.233103180391264,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000776915,0.0004856664,0.0004444249,0.0005982692,0.0004476976,0.001485552,0.0008521476,0.0005866088,0.001631272],"category_scores_gemma":[0.001638763,0.00020882,0.000587096,0.0007880567,0.001262108,0.002825837,0.0007731609,0.001434667,0.0003591318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009285627,"about_ca_system_score_gemma":0.0007633694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002039422,"about_ca_topic_score_gemma":0.0008360341,"domain_scores_codex":[0.9996611,0.0001038641,0.0000132841,0.00005369298,0.0001310459,0.0000370095],"domain_scores_gemma":[0.9995151,0.0002029055,0.00006039109,0.00008087913,0.0001085046,0.00003217629],"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.00001411587,0.000012989,0.0002167052,0.00002280406,0.000008729906,0.0000603246,0.00008774566,0.164207,0.002755249,0.8176659,0.0006657577,0.01428256],"study_design_scores_gemma":[0.000002742701,0.00001060154,0.00008140258,0.000005690568,0.00000347125,0.00003027611,0.00002500903,0.6930219,0.0007917109,0.3018439,0.004175857,0.000007403746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00386369,0.0001092152,0.9926871,0.0001593115,0.00002059157,0.000007556153,0.00002184076,0.00004982554,0.00308085],"genre_scores_gemma":[0.7368475,0.001611649,0.2500318,0.0003029221,0.0003962099,0.0001369376,0.0001292331,0.0001510856,0.01039267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002039422,"threshold_uncertainty_score":0.006737232,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100266001","doi":"10.1109/icc.2006.255130","title":"Grooming of Symmetric Traffic in Unidirectional SONET/WDM Rings","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Synchronous optical networking; Traffic grooming; Wavelength-division multiplexing; Computer science; Multiplexer; Computer network; Multiplexing; Upper and lower bounds; Routing and wavelength assignment; Optical mesh network; Optical add-drop multiplexer; Wavelength; Topology (electrical circuits); Algorithm; Optical performance monitoring; Mathematics; Telecommunications; Physics; Optics; Combinatorics; Wireless","authors":[{"name":"Yong Wang","is_ca":true},{"name":"Qian‐Ping Gu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0464256695655952,"gpt":0.2909900728766526,"spread":0.2445644033110574,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006811928,0.0007281423,0.0007902801,0.0005694504,0.000758288,0.0006541699,0.001265571,0.0007741665,0.001483675],"category_scores_gemma":[0.001590697,0.0005275189,0.0005881271,0.0007851077,0.0006621214,0.001408124,0.001336867,0.0006476574,0.0002134251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004871763,"about_ca_system_score_gemma":0.0005663187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00159649,"about_ca_topic_score_gemma":0.003334147,"domain_scores_codex":[0.9994579,0.0001632048,0.00002855498,0.0001118922,0.0001170093,0.0001214552],"domain_scores_gemma":[0.9990852,0.0004088244,0.0001779031,0.0001736942,0.00006855278,0.00008577503],"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.001228033,0.0005481731,0.003005536,0.0005108324,0.0001266401,0.0005562456,0.0006828998,0.5149647,0.0666362,0.04274505,0.00659254,0.3624032],"study_design_scores_gemma":[0.000052333,0.0000899869,0.0003143729,0.00001093532,0.00001452738,0.0001208467,0.00008876059,0.9746772,0.01090029,0.01225503,0.001464826,0.00001095316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3347152,0.0005299503,0.6581708,0.0003584502,0.00004591,0.0002100738,0.0001146437,0.00118618,0.004668756],"genre_scores_gemma":[0.5765867,0.0002916182,0.4201376,0.0001192574,0.00003163256,0.0001276342,0.0002953605,0.0001134152,0.002296819],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00159649,"threshold_uncertainty_score":0.004963398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161931435","doi":"10.1109/icc.2006.255095","title":"A Game Theoretic Model to Handle Network Intrusions over Multiple Packets","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Network packet; Computer science; Path (computing); Router; Computer network; Sampling (signal processing); Game theory; Routing (electronic design automation); Packet drop attack; Distributed computing; Routing protocol; Mathematics; Telecommunications; Link-state routing protocol","authors":[{"name":"Mona Mehrandish","is_ca":true},{"name":"Chadi Assi","is_ca":true},{"name":"Mourad Debbabi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06062968476393932,"gpt":0.315845859551549,"spread":0.2552161747876097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002728459,0.001968761,0.001399734,0.001033374,0.00117297,0.002794742,0.003619164,0.00299687,0.004673098],"category_scores_gemma":[0.004637765,0.0008537402,0.001367956,0.001187928,0.002500337,0.004646065,0.001944242,0.003696183,0.0007724767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00346453,"about_ca_system_score_gemma":0.002550854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007168692,"about_ca_topic_score_gemma":0.005486604,"domain_scores_codex":[0.9973219,0.001372524,0.0001127068,0.0003606398,0.0005048017,0.0003274517],"domain_scores_gemma":[0.9976088,0.001576056,0.0002550203,0.0001371705,0.0002082525,0.0002148308],"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.0000491853,0.0001047653,0.0002748535,0.00008411231,0.00004667869,0.0002272471,0.0001675944,0.5350177,0.000993968,0.4538996,0.002064684,0.007069584],"study_design_scores_gemma":[0.00002738169,0.00005139843,0.00005135022,0.00001204302,0.00001426884,0.00006907462,0.00003691073,0.8897699,0.0001231007,0.1068631,0.002964317,0.00001725598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006652093,0.0002424201,0.9822311,0.0008688505,0.0001097154,0.0002032768,0.0001331379,0.00009396972,0.009465497],"genre_scores_gemma":[0.643994,0.001280501,0.3316329,0.0007785017,0.0003517011,0.001154578,0.0002595404,0.0001069315,0.02044144],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007168692,"threshold_uncertainty_score":0.02513707,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147163407","doi":"10.1109/icc.2006.254984","title":"Modeling and Performance Analysis of Beyond 3G Integrated Wireless Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada); University of Toronto","funders":"","keywords":"Computer science; Wireless network; Distributed computing; Wireless; Set (abstract data type); Mobility model; Session (web analytics); Telecommunications","authors":[{"name":"Ahmed H. Zahran","is_ca":true},{"name":"Ben Liang","is_ca":true},{"name":"Aladdin Saleh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07100678099954745,"gpt":0.3296301567017113,"spread":0.2586233757021639,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005957104,0.0007242312,0.0005151891,0.0003696613,0.0002789536,0.0008270749,0.0008173367,0.0006714848,0.0008189942],"category_scores_gemma":[0.001316987,0.0002242931,0.0004037786,0.000555683,0.0003631972,0.001009521,0.0004149386,0.0005085163,0.0001578379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001280821,"about_ca_system_score_gemma":0.0007744977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008392445,"about_ca_topic_score_gemma":0.004868057,"domain_scores_codex":[0.9996019,0.000109918,0.00001246886,0.00005641048,0.0001391579,0.00008007115],"domain_scores_gemma":[0.9996632,0.0001274158,0.00006861056,0.00003711803,0.0000884275,0.00001519873],"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.00001700218,0.00001641607,0.0004062299,0.00001226903,0.00001032798,0.00004564358,0.0000248863,0.9793811,0.00155612,0.01354768,0.0002926932,0.004689713],"study_design_scores_gemma":[7.742423e-7,0.000008388823,0.0001099854,9.743401e-7,0.000002958998,0.000007878112,0.000003035331,0.9980543,0.0001178917,0.00153134,0.0001606832,0.000001717522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2559469,0.001511498,0.7223606,0.0006387582,0.00007789794,0.00007377641,0.0002937653,0.0004722067,0.01862462],"genre_scores_gemma":[0.9860681,0.0006624457,0.01067048,0.00004257137,0.00003773968,0.00003467258,0.00008198821,0.00002472725,0.002377233],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008392445,"threshold_uncertainty_score":0.01668721,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2122966624","doi":"10.1109/icc.2006.255603","title":"A Performance Study of Splittable and Unsplittable Traffic Allocation in Wireless Sensor Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Wireless sensor network; Computer science; Energy consumption; Resource allocation; Energy (signal processing); Computer network; Linear programming; Efficient energy use; Wireless; Constraint (computer-aided design); Mathematical optimization; Algorithm; Mathematics; Engineering; Telecommunications; Statistics","authors":[{"name":"Sylvia Tai","is_ca":true},{"name":"Robert Benkoczi","is_ca":true},{"name":"Hossam S. Hassanein","is_ca":true},{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04087262734399388,"gpt":0.2820153879959392,"spread":0.2411427606519453,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004157458,0.0009427515,0.0006636875,0.0008312731,0.0005714992,0.0009885267,0.0009210724,0.0007376296,0.001070247],"category_scores_gemma":[0.01932764,0.0003202601,0.0003401898,0.001080618,0.0009894784,0.00225954,0.0007512258,0.0005083564,0.0001672866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001227155,"about_ca_system_score_gemma":0.0008519337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001645886,"about_ca_topic_score_gemma":0.00172003,"domain_scores_codex":[0.9974514,0.001095893,0.00009833066,0.0002561905,0.0007918082,0.0003064515],"domain_scores_gemma":[0.9849194,0.0111948,0.001056782,0.0008725098,0.001688433,0.0002680517],"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.0004647363,0.0001015909,0.002239057,0.0001399623,0.00006457059,0.00008243487,0.0001220663,0.9403672,0.009840715,0.00673955,0.0004323554,0.0394057],"study_design_scores_gemma":[0.000007742717,0.0002679553,0.0004921184,0.000008661084,0.00001326701,0.00005593764,0.00004827666,0.9938924,0.003158815,0.001855674,0.0001917821,0.000007381005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7136163,0.002472328,0.2758446,0.0004667081,0.00007935191,0.0001342162,0.0001166114,0.0002895315,0.006980365],"genre_scores_gemma":[0.9830952,0.0004386322,0.01575742,0.00003261803,0.00001591478,0.00004577074,0.00006140539,0.00003131648,0.0005216567],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004157458,"threshold_uncertainty_score":0.02198696,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156199875","doi":"10.1109/icc.2006.255670","title":"A New Approach to Service Discovery in Wireless Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Multicast; Service discovery; Distributed computing; Mobile ad hoc network; Wireless ad hoc network; Protocol Independent Multicast; Reliable multicast; Geocast; Optimized Link State Routing Protocol; Wireless; Routing protocol; World Wide Web; Routing (electronic design automation); Web service; Telecommunications","authors":[{"name":"Yu Yang","is_ca":true},{"name":"Hossam S. Hassanein","is_ca":true},{"name":"Afzal Mawji","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05108726805425744,"gpt":0.3036527420738922,"spread":0.2525654740196348,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003134205,0.001167566,0.001589349,0.002214919,0.001503096,0.003926979,0.003921499,0.00247559,0.002280723],"category_scores_gemma":[0.006461521,0.0006449847,0.001142642,0.003274683,0.003312137,0.007719615,0.003652032,0.005321755,0.001161383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001529367,"about_ca_system_score_gemma":0.001593486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001140258,"about_ca_topic_score_gemma":0.00130849,"domain_scores_codex":[0.994936,0.001113813,0.0003226809,0.0006454409,0.002745426,0.0002365145],"domain_scores_gemma":[0.9976265,0.001160019,0.0001781809,0.0004380627,0.0004500972,0.0001471686],"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.0002585388,0.0002331398,0.000484436,0.001008701,0.0002183167,0.0002910476,0.0004960376,0.03670203,0.009496794,0.545878,0.01620059,0.3887324],"study_design_scores_gemma":[0.00020317,0.000745944,0.0003002043,0.0002401621,0.0002377997,0.001711885,0.0002410762,0.4499464,0.007367806,0.3277405,0.2111275,0.0001374835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003515844,0.007644914,0.974138,0.002463636,0.001806368,0.000270566,0.00006666587,0.0004660862,0.009628048],"genre_scores_gemma":[0.1445633,0.01654863,0.8157341,0.002661483,0.003814802,0.0007981042,0.0002870269,0.0001670693,0.01542537],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003926979,"threshold_uncertainty_score":0.01657546,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131665531","doi":"10.1109/icc.2006.255003","title":"CAPWAP Handover Protocol","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Handover; Computer network; Computer science; Context (archaeology); Wireless LAN controller; Protocol (science); Wireless Application Protocol; Wireless; Authentication (law); Wireless network; Wi-Fi array; Computer security; Telecommunications; Medicine","authors":[{"name":"Behçet Sarikaya","is_ca":true},{"name":"Xiao Zheng","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05884201005555691,"gpt":0.3261076523359609,"spread":0.267265642280404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009136338,0.000826811,0.000627157,0.001345563,0.002121257,0.002973159,0.002250943,0.001720408,0.01536818],"category_scores_gemma":[0.003214847,0.0003971044,0.0003779937,0.001102366,0.0005385048,0.002468291,0.003980156,0.002552962,0.008032048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007011743,"about_ca_system_score_gemma":0.001599722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002387718,"about_ca_topic_score_gemma":0.002019603,"domain_scores_codex":[0.9984123,0.0001649227,0.0001227033,0.0001498817,0.0008244795,0.0003258007],"domain_scores_gemma":[0.9986715,0.0002208535,0.0001057664,0.0003193439,0.0005362871,0.0001463014],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0009663987,0.0004434909,0.00162365,0.001301326,0.0001155355,0.001898073,0.0006032811,0.007006648,0.03140978,0.09459113,0.3407499,0.5192907],"study_design_scores_gemma":[0.0001809298,0.0002852027,0.001660771,0.0002957229,0.0001295225,0.002443866,0.0003099644,0.07089656,0.03382772,0.03277837,0.8569812,0.0002102127],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03359412,0.008978733,0.557004,0.004556392,0.005354887,0.00591776,0.008553838,0.02877841,0.3472619],"genre_scores_gemma":[0.5674102,0.0115455,0.1897131,0.006143942,0.002203078,0.008993619,0.02750936,0.001605668,0.1848757],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01536818,"threshold_uncertainty_score":0.05141175,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098609188","doi":"10.1109/icc.2006.255150","title":"Logical Topology Design for WDM Networks Using Survivable Routing","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Logical topology; Network topology; Computer science; Computer network; Routing (electronic design automation); Topology (electrical circuits); Heuristic; Distributed computing; Survivability; Routing table; Routing protocol; Engineering","authors":[{"name":"Arunita Jaekel","is_ca":true},{"name":"S. Bandyopadhyay","is_ca":true},{"name":"Y.P. Aneja","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1530916627088147,"gpt":0.344649310250105,"spread":0.1915576475412904,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009711439,0.0003803966,0.0002722008,0.0006769986,0.0003676274,0.0008589616,0.0006753143,0.0003557166,0.001467574],"category_scores_gemma":[0.001961746,0.0003285056,0.0003811671,0.0005006453,0.0005589683,0.001248752,0.0006550605,0.000474998,0.0001898662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006431828,"about_ca_system_score_gemma":0.000563829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003899659,"about_ca_topic_score_gemma":0.0009205706,"domain_scores_codex":[0.9995803,0.0001736352,0.00003158574,0.0000416343,0.0001392307,0.0000336908],"domain_scores_gemma":[0.9993703,0.0003286375,0.0001018608,0.00007243193,0.00009807726,0.00002876687],"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.00005225143,0.00004680881,0.0004843627,0.0002804346,0.00003542532,0.0001943609,0.0001024847,0.8075569,0.02071833,0.07014277,0.001394585,0.09899124],"study_design_scores_gemma":[0.00003699621,0.000105912,0.0001171281,0.00002921912,0.00002397153,0.00009584883,0.00005672317,0.922648,0.005506519,0.06268617,0.008679807,0.0000136282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01284808,0.0002473404,0.9845282,0.0001518576,0.00003001324,0.00006118194,0.00004636464,0.000153059,0.00193384],"genre_scores_gemma":[0.3373384,0.0007621523,0.6600268,0.00009274552,0.00004595651,0.0002598501,0.0002212988,0.00008997316,0.001162823],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001467574,"threshold_uncertainty_score":0.005135953,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023285516","doi":"10.1109/icc.2006.255546","title":"M-ary Orthogonal Coded/Balanced UWB Transmitted-Reference System","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":8,"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":"Inha University","keywords":"Multipath propagation; Computer science; Interference (communication); Joint (building); Algorithm; Multipath interference; Intersymbol interference; Pulse shaping; Electronic engineering; Telecommunications; Decoding methods; Physics; Engineering; Optics","authors":[{"name":"Dong Sik Kim","is_ca":true},{"name":"Tao Jia","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04288510017301155,"gpt":0.2783515406706197,"spread":0.2354664404976082,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006150541,0.0006269239,0.0005564089,0.0005370406,0.0004812812,0.0008911846,0.0009050614,0.0009089161,0.001639803],"category_scores_gemma":[0.0009617305,0.0002387112,0.000249976,0.0005141897,0.0004174759,0.0008341248,0.0009929787,0.0005031367,0.0006491471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006119577,"about_ca_system_score_gemma":0.001041353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007813977,"about_ca_topic_score_gemma":0.001440219,"domain_scores_codex":[0.9991969,0.000150962,0.00004957755,0.0001261015,0.0003557834,0.0001205977],"domain_scores_gemma":[0.9995322,0.00005924234,0.0001091091,0.00007753312,0.0001772762,0.00004454149],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001826786,0.0002109682,0.001812203,0.0003594469,0.0001049913,0.000898218,0.0002894419,0.03587556,0.6204006,0.09632938,0.004737973,0.2371544],"study_design_scores_gemma":[0.0004781692,0.002181396,0.00188295,0.0001022501,0.0002305923,0.003080452,0.00009927934,0.5629697,0.3879791,0.01171343,0.02903947,0.0002432577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1782031,0.001051956,0.8028393,0.0008392946,0.0004333333,0.0002270403,0.0004281792,0.00132578,0.01465197],"genre_scores_gemma":[0.8315275,0.0003701237,0.1607864,0.0003868479,0.000152878,0.0001354256,0.0002491224,0.00002284137,0.006368954],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001639803,"threshold_uncertainty_score":0.005485713,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146929559","doi":"10.1109/icc.2006.255231","title":"Analysis of Different Sleep and Wakeup Strategies in Solar Powered Wireless Sensor Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Network packet; Node (physics); Wireless sensor network; Battery (electricity); Markov chain; Real-time computing; Computer network; Markov process; Engineering; Mathematics; Power (physics)","authors":[{"name":"Dusit Niyato","is_ca":true},{"name":"Ekram Hossain","is_ca":true},{"name":"Afshin Fallahi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02820317856535465,"gpt":0.2714799582791193,"spread":0.2432767797137647,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001079655,0.0004899444,0.0005347517,0.0004237179,0.0003366927,0.000590943,0.000688607,0.0004910654,0.00075659],"category_scores_gemma":[0.004389566,0.0003215512,0.0003716768,0.0003605304,0.0006084249,0.001021423,0.0003738423,0.0002656188,0.00008523621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008206403,"about_ca_system_score_gemma":0.0005048224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002453433,"about_ca_topic_score_gemma":0.002158822,"domain_scores_codex":[0.9996331,0.0001242624,0.00001422426,0.0000450285,0.00009703921,0.00008640729],"domain_scores_gemma":[0.9985436,0.001001549,0.0001866251,0.00006267011,0.0001522985,0.000053315],"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.00006827596,0.00002860364,0.001018851,0.00005032309,0.00003149805,0.00007439505,0.00007022293,0.974396,0.004577296,0.01039653,0.0002056083,0.009082372],"study_design_scores_gemma":[0.000003351407,0.00002131677,0.0002659487,0.000002681987,0.000005827319,0.00001432846,0.00001444271,0.9972081,0.0004317678,0.001969997,0.00005963978,0.000002517834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4907703,0.001278329,0.5013254,0.0004804264,0.0000343773,0.00007317629,0.0000957577,0.0002155946,0.005726671],"genre_scores_gemma":[0.9933031,0.0002966065,0.005539665,0.00003039366,0.000009084541,0.00003240215,0.00002718628,0.00001693688,0.000744709],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002453433,"threshold_uncertainty_score":0.005954146,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150231611","doi":"10.1109/icc.2006.255023","title":"Code Hopping - Direct Sequence Spread Spectrum to Compensate for Intersymbol Interference in an Ultra-wideband System","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Direct-sequence spread spectrum; Intersymbol interference; Spread spectrum; Algorithm; Phase-shift keying; Computer science; Time-hopping; Bit error rate; Rake receiver; Frequency-hopping spread spectrum; Keying; Interference (communication); Rake; Electronic engineering; Modulation (music); Telecommunications; Channel (broadcasting); Decoding methods; Fading; Pulse-amplitude modulation; Physics; Engineering","authors":[{"name":"Sung Han Chung","is_ca":true},{"name":"P.J. McLane","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08110852820307053,"gpt":0.3235285154707956,"spread":0.2424199872677251,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002729214,0.0003579638,0.0003236376,0.0003245587,0.000185306,0.0002669763,0.0003735753,0.0004179733,0.0005996736],"category_scores_gemma":[0.0007575828,0.0001139028,0.0001673086,0.0003523927,0.0002193971,0.0003123245,0.0002371224,0.0002941209,0.0002247684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002196103,"about_ca_system_score_gemma":0.0003051429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007828115,"about_ca_topic_score_gemma":0.001212102,"domain_scores_codex":[0.9997821,0.00004188518,0.000008238641,0.00002373961,0.000124906,0.00001908283],"domain_scores_gemma":[0.9998061,0.00005522606,0.00002977214,0.00003285522,0.00006288635,0.00001312952],"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.0003411761,0.0001097475,0.004452121,0.0001994045,0.0001135418,0.0006415521,0.000152492,0.5392866,0.2167584,0.0385589,0.001090107,0.198296],"study_design_scores_gemma":[0.00003951265,0.0003341461,0.001401517,0.00001928817,0.00004415903,0.0006049951,0.00001893267,0.9547434,0.03522402,0.004695176,0.002850481,0.00002442988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1171747,0.0005956442,0.8785697,0.0001004316,0.00007959758,0.00004342044,0.00001929037,0.0006293892,0.002787839],"genre_scores_gemma":[0.7527268,0.0003238767,0.2446999,0.00008545485,0.00003751562,0.00004505972,0.00002892316,0.00001510161,0.002037386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0007828115,"threshold_uncertainty_score":0.002006114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124281857","doi":"10.1109/icc.2006.255194","title":"Optical Power Reduction for Multiple-Subcarrier Modulated Indoor Wireless Optical Channels","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Subcarrier; Bandwidth (computing); Optical wireless; Subcarrier multiplexing; Computer science; Multipath propagation; Optical power; Optical performance monitoring; Out-of-band management; Electronic engineering; Optical modulation amplitude; Optical Carrier transmission rates; Electrical engineering; Wireless; Telecommunications; Physics; Orthogonal frequency-division multiplexing; Optics; Engineering; Optical amplifier; Wavelength-division multiplexing; Radio over fiber; Computer network; Channel (broadcasting); Laser","authors":[{"name":"Weiwei Kang","is_ca":true},{"name":"Steve Hranilovic","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05738829357480846,"gpt":0.3023330864734128,"spread":0.2449447928986044,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009086997,0.000291269,0.000181815,0.0001911787,0.0002023913,0.000236744,0.0002215507,0.0001635974,0.001495157],"category_scores_gemma":[0.0004477909,0.00009941203,0.0001346267,0.0002305804,0.0001911604,0.0002995681,0.0002123451,0.0002142472,0.0002542032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001917404,"about_ca_system_score_gemma":0.00009631398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001810937,"about_ca_topic_score_gemma":0.0004222796,"domain_scores_codex":[0.9998602,0.00002520781,0.000004609697,0.00002054437,0.0000639573,0.00002538217],"domain_scores_gemma":[0.9997464,0.0001073093,0.0000599498,0.00003080831,0.0000452426,0.0000102669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003887396,0.0001041229,0.001984579,0.0001609347,0.0000320769,0.0001671109,0.00009806607,0.03767428,0.7742278,0.004058611,0.0006374341,0.1804661],"study_design_scores_gemma":[0.00002822716,0.0004861022,0.002273821,0.00001413356,0.00003956438,0.0003920982,0.00005327119,0.2082684,0.7819382,0.001559894,0.004928018,0.00001826486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7529179,0.0007006854,0.2368016,0.0002225157,0.00005622221,0.00002327964,0.00005208921,0.0003472467,0.008878578],"genre_scores_gemma":[0.9775597,0.0002118509,0.02050538,0.00002862698,0.00002826264,0.000009613034,0.00002765236,0.00002226159,0.001606591],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001495157,"threshold_uncertainty_score":0.005001783,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167918353","doi":"10.1109/icc.2006.255382","title":"Performance of a BPSK NB Receiver in MB-OFDM UWB Interference","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Phase-shift keying; Orthogonal frequency-division multiplexing; Additive white Gaussian noise; Bit error rate; Interference (communication); Electronic engineering; Narrowband; Adjacent-channel interference; Computer science; Telecommunications; White noise; Engineering; Decoding methods","authors":[{"name":"Amir Nasri","is_ca":true},{"name":"Robert Schober","is_ca":true},{"name":"Lutz Lampe","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04475798556474208,"gpt":0.2828073421672865,"spread":0.2380493566025444,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001635417,0.0008682668,0.00128107,0.0004338868,0.0006016943,0.0009500069,0.0006927513,0.001659003,0.001025468],"category_scores_gemma":[0.007688618,0.0002266856,0.0004116434,0.0003735645,0.0009239423,0.001030443,0.0007753958,0.0007303798,0.0005625981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006496747,"about_ca_system_score_gemma":0.0005262084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001419082,"about_ca_topic_score_gemma":0.0004090733,"domain_scores_codex":[0.997795,0.0005051722,0.0001119936,0.0002323064,0.0009608578,0.0003946107],"domain_scores_gemma":[0.9952743,0.003017828,0.0004929514,0.0002997053,0.0007374876,0.0001776818],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.008203301,0.0003892205,0.02612371,0.0006883148,0.0004033947,0.001566185,0.001007763,0.379474,0.517721,0.007828887,0.0004875396,0.05610685],"study_design_scores_gemma":[0.0001490444,0.002716577,0.009107533,0.00008815079,0.0002904614,0.001579331,0.0001994628,0.6990175,0.2843088,0.001498445,0.0009627602,0.00008190708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9244319,0.000624462,0.06937344,0.0001664845,0.00004106071,0.00002940067,0.00005874756,0.0004636553,0.004810928],"genre_scores_gemma":[0.9922827,0.0001207317,0.006924554,0.00005895923,0.00001504035,0.00001305415,0.00002839431,0.00002811183,0.0005285452],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001659003,"threshold_uncertainty_score":0.008648992,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156442063","doi":"10.1109/icc.2006.255759","title":"Delay-aware Power Adaptation for Incremental Redundancy Hybrid ARQ over Fading Channels with Memory","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Hybrid automatic repeat request; Fading; Automatic repeat request; Redundancy (engineering); Markov chain; Channel (broadcasting); Transmitter; Markov decision process; Network packet; Markov process; Computer network; Selective Repeat ARQ; Buffer overflow; Transmitter power output; Telecommunications link; Mathematics","authors":[{"name":"Ashok Karmokar","is_ca":true},{"name":"D.V. Djonin","is_ca":true},{"name":"Vijay K. Bhargava","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04341137406392314,"gpt":0.2860792194762979,"spread":0.2426678454123748,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006556222,0.0004786653,0.0004412083,0.0001781522,0.0002196428,0.0004926045,0.0006981409,0.0002634568,0.0007903934],"category_scores_gemma":[0.001456627,0.0002382714,0.0002162249,0.0002419358,0.0005236721,0.0004303115,0.0004271405,0.0004080674,0.00008655914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003907735,"about_ca_system_score_gemma":0.0004379429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001406244,"about_ca_topic_score_gemma":0.001424588,"domain_scores_codex":[0.9997606,0.00007980931,0.000007175608,0.00003256123,0.00006441231,0.00005557096],"domain_scores_gemma":[0.9993454,0.0004256362,0.00009622365,0.000036466,0.0000736311,0.00002263642],"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.0001141827,0.0000549552,0.0004840707,0.00005627141,0.00003601847,0.0001242278,0.00009292153,0.9515098,0.01387697,0.009829939,0.000386776,0.02343398],"study_design_scores_gemma":[0.000006671917,0.00004262255,0.00008642773,0.000001522293,0.000006203652,0.00001757767,0.000006624884,0.9980367,0.0008575568,0.0008919498,0.00004293459,0.000003214434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1553681,0.0004092056,0.8419605,0.0001853963,0.00002729803,0.00003257309,0.00002142451,0.0001388905,0.001856598],"genre_scores_gemma":[0.9895374,0.0001239482,0.009800914,0.00002789095,0.00001285623,0.00001538893,0.000005396965,0.000008679493,0.0004676323],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001406244,"threshold_uncertainty_score":0.003467321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166806744","doi":"10.1109/icc.2006.255483","title":"Accurate Closed-Form Approximations for the Error Rate and Outage of Equal Gain Combining Diversity in Nakagami Fading Channels","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Nakagami distribution; Fading; Closed-form expression; Diversity gain; Expression (computer science); Probability density function; Random variable; Mathematics; Binary number; Outage probability; Diversity combining; Diversity scheme; Computer science; Algorithm; Applied mathematics; Topology (electrical circuits); Statistics; Mathematical analysis; Combinatorics; Arithmetic","authors":[{"name":"Jeremiah Hu","is_ca":true},{"name":"Norman C. Beaulieu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1415502987405311,"gpt":0.3509963638070416,"spread":0.2094460650665106,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002701017,0.001232123,0.001155354,0.001044062,0.0006029923,0.002073405,0.001464803,0.001464924,0.002954113],"category_scores_gemma":[0.01887537,0.0006586648,0.0006161868,0.001127315,0.001302388,0.003720765,0.001092066,0.00189778,0.001934744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002073096,"about_ca_system_score_gemma":0.001200762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003015808,"about_ca_topic_score_gemma":0.002730297,"domain_scores_codex":[0.9984925,0.0003831447,0.00007062351,0.0001288327,0.000751692,0.0001732747],"domain_scores_gemma":[0.9938416,0.00439424,0.0004315552,0.0004445898,0.0008341347,0.00005374672],"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.00005117093,0.00002938242,0.0005227585,0.0001768286,0.00002323436,0.0001378491,0.0002622148,0.8781279,0.002613807,0.09060565,0.001294821,0.02615445],"study_design_scores_gemma":[0.000007170302,0.00001769457,0.0002002744,0.00006553634,0.000009161864,0.0001566281,0.00005745826,0.9716916,0.001929163,0.0243606,0.001481012,0.00002368962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009533695,0.0007782032,0.9858463,0.0001184632,0.00004270963,0.00002649166,0.00008511835,0.0002824035,0.003286658],"genre_scores_gemma":[0.5795622,0.005684853,0.4038376,0.000313502,0.0001637727,0.0004020903,0.0006273212,0.0004071323,0.009001552],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003015808,"threshold_uncertainty_score":0.01504141,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121780062","doi":"10.1109/icc.2006.255734","title":"On the Capacity Statistics of MIMO Ricean and Rayleigh Fading Channels","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Channel state information; Fading; Rician fading; Rayleigh fading; MIMO; Kurtosis; Fading distribution; Channel capacity; Skewness; Wishart distribution; Statistics; Mathematics; Channel (broadcasting); Computer science; Telecommunications; Wireless","authors":[{"name":"Amine Maaref","is_ca":true},{"name":"Sonia Aı̈ssa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06720011695716249,"gpt":0.287423843787456,"spread":0.2202237268302935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002818609,0.0009318183,0.001005647,0.001710457,0.0004064136,0.001339854,0.001124862,0.0007082978,0.002336709],"category_scores_gemma":[0.01654856,0.0004865681,0.0005716332,0.002029888,0.002187131,0.003348908,0.001137628,0.001326787,0.0006406485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001096507,"about_ca_system_score_gemma":0.001030719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002072051,"about_ca_topic_score_gemma":0.001052269,"domain_scores_codex":[0.9986941,0.0004670524,0.00004487977,0.0001332869,0.0005000468,0.0001606969],"domain_scores_gemma":[0.9896226,0.007569381,0.0007466974,0.0006530461,0.001287496,0.0001208141],"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.00004187124,0.00002077651,0.0007350683,0.00008220327,0.00002135928,0.0001610809,0.0001019216,0.7688035,0.001927394,0.2196691,0.0008232347,0.007612478],"study_design_scores_gemma":[0.000003400341,0.0000138415,0.0005112307,0.0000300766,0.000005982344,0.0001177931,0.00002933877,0.9301499,0.00112214,0.06739199,0.0005962082,0.00002815319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0589001,0.001484057,0.9251948,0.0003830512,0.00005199254,0.00003787909,0.0003974055,0.0003566176,0.01319408],"genre_scores_gemma":[0.950901,0.003595968,0.04105931,0.000196613,0.0002590996,0.0001894543,0.0006128781,0.0001844605,0.003001149],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002818609,"threshold_uncertainty_score":0.01490641,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144683195","doi":"10.1109/icc.2006.255665","title":"Performance Enhancement for WLAN Supporting Integrated Voice/Data Traffic","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":6,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer network; Computer science; Voice over IP; Quality of service; Polling; Overhead (engineering); Exploit; Wireless; Wireless Multimedia Extensions; The Internet; Wireless network; Telecommunications; Wi-Fi array; Computer security","authors":[{"name":"Ping Wang","is_ca":true},{"name":"Hai Jiang","is_ca":true},{"name":"Weihua Zhuang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1463746900810904,"gpt":0.3790275465780355,"spread":0.2326528564969451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006353995,0.0004331009,0.000418005,0.0004690688,0.0003222266,0.0008544571,0.0004058724,0.000539902,0.002156439],"category_scores_gemma":[0.001859288,0.0001282541,0.0001935122,0.0004622382,0.0002315778,0.0004575732,0.000572817,0.0004940743,0.0006156135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005349699,"about_ca_system_score_gemma":0.0002732195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005737019,"about_ca_topic_score_gemma":0.0004929519,"domain_scores_codex":[0.9994112,0.0001357191,0.00002080056,0.00005757587,0.0001899075,0.0001847118],"domain_scores_gemma":[0.9987998,0.0005288752,0.00009051361,0.00008214993,0.0004030133,0.00009559943],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004076532,0.0006412602,0.01124564,0.0003468973,0.000119399,0.001115047,0.0002618531,0.1711328,0.5375355,0.009248544,0.004010797,0.2602657],"study_design_scores_gemma":[0.0001010816,0.001505339,0.003944975,0.0000315878,0.0001174755,0.0007004129,0.0001093553,0.8837427,0.1049556,0.001509504,0.003228392,0.00005342746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.7958243,0.002936287,0.1782857,0.0005942667,0.0002027647,0.00005755985,0.00009696199,0.002922897,0.0190793],"genre_scores_gemma":[0.9945911,0.0001943133,0.00439639,0.00003840652,0.00004564395,0.00000888703,0.00003328299,0.00002000852,0.0006718545],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.002156439,"threshold_uncertainty_score":0.00721401,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142145488","doi":"10.1109/icc.2006.255418","title":"Optimal Packet Scheduling using Adaptive M-QAM and Orthogonal STBC in MIMO Nakagami-m Fading Channels","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nakagami distribution; Computer science; Fading; Space–time block code; Channel state information; Network packet; Algorithm; Hybrid automatic repeat request; Automatic repeat request; Computer network; Channel (broadcasting); Telecommunications link; Wireless; Telecommunications","authors":[{"name":"Ashok Karmokar","is_ca":true},{"name":"Vijay K. Bhargava","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07366207296990472,"gpt":0.3103393822915417,"spread":0.236677309321637,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001340394,0.0006679906,0.0008768895,0.0004486741,0.0003914181,0.001004016,0.0005492354,0.0007521674,0.0008167708],"category_scores_gemma":[0.003314234,0.0004660553,0.0002954209,0.0006959514,0.001010402,0.0009272295,0.0006424066,0.0003987869,0.0001089144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001467176,"about_ca_system_score_gemma":0.001538751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00746808,"about_ca_topic_score_gemma":0.004389451,"domain_scores_codex":[0.9994416,0.0002420897,0.00001711938,0.00006158131,0.00009075974,0.0001468571],"domain_scores_gemma":[0.9982292,0.001250641,0.0002277233,0.00004575764,0.0001666911,0.00007994572],"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.00005129909,0.00001814152,0.0002592251,0.00001965303,0.00001188548,0.00004536052,0.00002416728,0.9893376,0.0009667563,0.006806539,0.0001654193,0.002294007],"study_design_scores_gemma":[0.000010978,0.0000147508,0.00005644917,0.000001209915,0.00000345013,0.000004249305,0.000005745631,0.9978312,0.0001458828,0.001897432,0.00002647428,0.000002256047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3587998,0.001150411,0.6338525,0.0006690971,0.00006942591,0.00007204634,0.0001073464,0.0001317142,0.00514758],"genre_scores_gemma":[0.9798484,0.0003344049,0.01862204,0.00004276649,0.00003288149,0.00003310978,0.00002159679,0.0000149338,0.001049759],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00746808,"threshold_uncertainty_score":0.01484919,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}