{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003533421,0.0002629708,0.0001894515,0.0003085191,0.0007280358,0.0004141417,0.00194913,0.0001580393,0.0001323567],"category_scores_gemma":[0.00002276796,0.0002490805,0.00009825251,0.0007529932,0.0001460865,0.0006963423,0.0002046439,0.0005059137,0.0001615295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002176843,"about_ca_system_score_gemma":0.000109658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006674886,"about_ca_topic_score_gemma":0.005606327,"domain_scores_codex":[0.9979234,0.00026125,0.0004507148,0.0004852804,0.0005564914,0.0003228823],"domain_scores_gemma":[0.9972926,0.0001782932,0.0002738032,0.00157806,0.0005925234,0.00008470462],"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.0008903464,0.002382386,0.002729349,0.00003062445,0.0002223708,0.00002238134,0.0003821598,0.08741276,0.0678945,0.4240194,0.004162382,0.4098513],"study_design_scores_gemma":[0.0008625141,0.0003893876,0.005076516,0.0001029253,0.00001725817,0.00002374457,0.00001941915,0.9465051,0.01417428,0.008462466,0.02394998,0.0004164198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04217788,0.00005950413,0.9118397,0.003850041,0.001468339,0.0004503338,0.00001542534,0.0005618031,0.03957695],"genre_scores_gemma":[0.9858857,0.00006908549,0.0125353,0.0005561562,0.0003782932,0.00013512,0.00005304351,0.00002145597,0.0003658612],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9437078,"threshold_uncertainty_score":0.9999961,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001151584,0.0002240556,0.0002055338,0.0001831346,0.0001088749,0.0001016391,0.0007882183,0.0001667918,0.00005837727],"category_scores_gemma":[0.00003199577,0.0002600373,0.00006052148,0.0002830511,0.00009520568,0.0002159113,0.00004680941,0.0003601047,0.00002051764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002658592,"about_ca_system_score_gemma":0.00003844802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004521893,"about_ca_topic_score_gemma":0.0008946942,"domain_scores_codex":[0.9987916,0.00006494237,0.0004609591,0.0002412242,0.0001773818,0.0002638311],"domain_scores_gemma":[0.9984758,0.0003590674,0.0001075872,0.0006786399,0.0003343924,0.00004444892],"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.00002272621,0.00009416401,0.0001389446,0.000004390002,0.00002230069,6.039497e-7,0.00005257941,0.8387671,0.0002472017,0.1571495,0.0003695139,0.003130983],"study_design_scores_gemma":[0.0004102809,0.00003184393,0.0002825673,0.00014856,0.000007482519,0.000002752919,0.00002874936,0.9867768,0.0005711357,0.01012279,0.00136243,0.0002545727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008565409,0.0002195218,0.9821603,0.000852267,0.0005562679,0.0005769017,0.00008546687,0.0002344841,0.006749352],"genre_scores_gemma":[0.9748745,0.001010269,0.02226615,0.0001258531,0.0002037937,0.0005851389,0.0007193376,0.00005181451,0.0001631594],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9663091,"threshold_uncertainty_score":0.9999852,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001835714,0.0001579623,0.0001384679,0.0001121959,0.0001485837,0.0001157987,0.001595718,0.00006459057,0.000006573004],"category_scores_gemma":[0.00004983852,0.0001234957,0.00001984516,0.0001685893,0.00007785519,0.0003608394,0.00008219186,0.0002170435,0.00001445375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001182216,"about_ca_system_score_gemma":0.00005344028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006579331,"about_ca_topic_score_gemma":0.005035481,"domain_scores_codex":[0.9990507,0.00003545651,0.0003708689,0.000209672,0.0001658944,0.0001673671],"domain_scores_gemma":[0.997834,0.0003647553,0.0001123845,0.001359811,0.0003056765,0.00002340853],"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.00002184166,0.00009582836,0.001260746,0.00002792932,0.00002933968,4.607114e-7,0.00008330841,0.9897685,0.0004116921,0.004370689,0.000768485,0.003161147],"study_design_scores_gemma":[0.0005901863,0.00001303359,0.0003368045,0.0001991135,0.00001082515,0.00000335545,0.0002259263,0.9912955,0.00009300016,0.00007108333,0.007011104,0.0001500598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002105309,0.0007551713,0.9825663,0.001314588,0.0005271735,0.001425073,0.0009671623,0.0002985843,0.01004064],"genre_scores_gemma":[0.9753341,0.0001664728,0.02243607,0.00002150418,0.0001406984,0.0004010744,0.001104394,0.00003677864,0.000358879],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9732288,"threshold_uncertainty_score":0.5036007,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004508104,0.0002579976,0.0002640099,0.0001448575,0.0003565592,0.0003579085,0.001828747,0.0001469296,0.00001468582],"category_scores_gemma":[0.00002949642,0.0002681921,0.00009668416,0.0001322171,0.0001937784,0.0003816018,0.0002937251,0.0003312547,0.00001657621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001478825,"about_ca_system_score_gemma":0.00008162836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001609683,"about_ca_topic_score_gemma":0.0003564839,"domain_scores_codex":[0.9982009,0.0001587546,0.0005063658,0.0004748513,0.0003169425,0.0003421861],"domain_scores_gemma":[0.9975263,0.0003412663,0.0003087877,0.00116311,0.000550823,0.0001097206],"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.00004154997,0.0005504499,0.00006394169,0.000006294687,0.00008853286,0.000002295318,0.000120138,0.1053338,0.0004088883,0.8836519,0.004165257,0.005566972],"study_design_scores_gemma":[0.001430047,0.0001113536,0.001016516,0.00008330249,0.00001643561,0.00001054542,0.00003104919,0.9926626,0.0001467568,0.003494808,0.0007247692,0.0002717832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007738493,0.0001185253,0.9889103,0.006563688,0.0007361536,0.0007927741,0.00008738971,0.0001561981,0.001861167],"genre_scores_gemma":[0.9813193,0.0002628528,0.01614729,0.0005139175,0.0002153038,0.0007882048,0.0001391286,0.00002148826,0.0005925164],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9805455,"threshold_uncertainty_score":0.9999771,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001136559,0.0001471919,0.0001628725,0.0001937235,0.00008486135,0.00004781753,0.0008155596,0.00007301697,0.0001885599],"category_scores_gemma":[0.00001800878,0.0001719456,0.00005392077,0.0001497014,0.0001795947,0.000210639,0.00006095544,0.000213878,0.00005282765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001735572,"about_ca_system_score_gemma":0.0000222152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001611292,"about_ca_topic_score_gemma":0.0002046614,"domain_scores_codex":[0.9990722,0.00002708499,0.0004143002,0.0001532381,0.0001726721,0.0001605064],"domain_scores_gemma":[0.998881,0.0000846906,0.0001274122,0.0006791722,0.0001934236,0.00003426762],"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.000002917264,0.00006259103,0.0003489894,0.00001249938,0.00004235896,3.788212e-7,0.0001064859,0.5634519,0.01374958,0.421679,0.0002337832,0.0003095314],"study_design_scores_gemma":[0.0005164837,0.00002435637,0.0007875631,0.000303372,0.00001598206,0.00001550643,0.0001935827,0.9383332,0.02197907,0.03684416,0.0006089677,0.0003777771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03627699,0.000074002,0.6354275,0.0009903425,0.001235187,0.0003433092,0.0002099187,0.0003764028,0.3250664],"genre_scores_gemma":[0.9934934,0.00008888848,0.005761866,0.0000224208,0.00009183786,0.0000372072,0.0001004463,0.00002474513,0.0003792265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9572164,"threshold_uncertainty_score":0.7011738,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003683731,0.0002213336,0.0002241889,0.0001864902,0.0008537301,0.0003011556,0.004115113,0.00008975984,0.00006315897],"category_scores_gemma":[0.00004475577,0.0002360107,0.0000696706,0.0006565496,0.0001655078,0.0007982603,0.001983267,0.0005989858,0.00004181754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002715721,"about_ca_system_score_gemma":0.0001078853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001707955,"about_ca_topic_score_gemma":0.002544482,"domain_scores_codex":[0.9981177,0.0003729828,0.0004863825,0.000390106,0.0003470978,0.0002857573],"domain_scores_gemma":[0.9971302,0.0004512022,0.0002126484,0.001593361,0.0005636223,0.0000489241],"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.00001527378,0.000363158,0.004171407,0.000002020398,0.00002673967,0.000004190334,0.001095813,0.02179811,0.0005969825,0.9484419,0.001053006,0.02243142],"study_design_scores_gemma":[0.0006547307,0.00005651458,0.008222968,0.0001767199,0.000004655387,0.000003994673,0.0001163396,0.9824749,0.0001579114,0.004029634,0.003767001,0.0003345798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04565579,0.001211686,0.7682798,0.01608871,0.0008129517,0.0006505002,0.00002675191,0.0003764497,0.1668974],"genre_scores_gemma":[0.9843351,0.00308913,0.01113788,0.0006428793,0.00005789641,0.00005013218,0.00007515158,0.000011604,0.0006001801],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9606768,"threshold_uncertainty_score":0.9624238,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004124604,0.0002388973,0.0002230239,0.0002065507,0.0002054435,0.0003449826,0.004181127,0.0001247899,0.00004729028],"category_scores_gemma":[0.00003797021,0.0002540224,0.00009351423,0.0004131808,0.000135978,0.0004959643,0.0006737741,0.000616309,0.00009382705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002403513,"about_ca_system_score_gemma":0.0001099435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001248742,"about_ca_topic_score_gemma":0.003685801,"domain_scores_codex":[0.9978827,0.0002095999,0.0006412972,0.0004692089,0.0004096773,0.0003875653],"domain_scores_gemma":[0.9969995,0.0003779068,0.0002665969,0.001971678,0.0003079542,0.00007633473],"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.000009804187,0.0004709436,0.002923332,0.000001697478,0.00001598936,0.000009812437,0.0001631707,0.0378559,0.0004162938,0.9341258,0.0008890835,0.0231182],"study_design_scores_gemma":[0.0004872683,0.00002672214,0.01064764,0.0001237773,0.000002650648,0.000007527274,0.00003307204,0.9838347,0.00009158309,0.003454234,0.001027016,0.0002637582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02079882,0.00009848028,0.8361939,0.007021879,0.001264726,0.0005905353,0.00002947923,0.0003641232,0.1336381],"genre_scores_gemma":[0.9820475,0.000150213,0.01636454,0.0003255634,0.0001665288,0.0001719887,0.00008742844,0.00001905535,0.0006671599],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9612487,"threshold_uncertainty_score":0.9999912,"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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0004433276,0.000160695,0.0001288475,0.0001256064,0.0008176308,0.0003822972,0.005547112,0.00005032975,0.00006088381],"category_scores_gemma":[0.00007357289,0.0001258692,0.0001065086,0.0002829559,0.0001757064,0.0002980308,0.0004962078,0.0002713671,0.000107008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000837047,"about_ca_system_score_gemma":0.00009063155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006731245,"about_ca_topic_score_gemma":0.0006416024,"domain_scores_codex":[0.9987684,0.0001515908,0.0003466191,0.0002621567,0.0002662845,0.0002048711],"domain_scores_gemma":[0.9958803,0.0009549969,0.0001704337,0.002348804,0.0006041176,0.00004132798],"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.000006466021,0.0001340549,0.00004672095,0.000001032128,0.00002929905,1.762686e-7,0.000113605,0.001596028,0.001706073,0.9760464,0.01480287,0.005517283],"study_design_scores_gemma":[0.0004379407,0.00004038264,0.001680948,0.00005362467,0.00001123254,0.000006023632,0.00005124119,0.7874427,0.001047103,0.01217031,0.1968005,0.0002580104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006467367,0.0007507734,0.8011792,0.09909323,0.0008036245,0.0005932191,0.00006628709,0.0002350196,0.09663185],"genre_scores_gemma":[0.9785933,0.001948845,0.01393575,0.001252851,0.0001380831,0.0004175579,0.00007294401,0.00001297652,0.003627631],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9779466,"threshold_uncertainty_score":0.9998333,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003727651,0.0001824847,0.0001797881,0.0001810649,0.0002990885,0.00037671,0.001870849,0.00007523293,0.00004467837],"category_scores_gemma":[0.00003013279,0.0001866581,0.00005975029,0.0002072616,0.0001379043,0.000410119,0.000213667,0.000265056,0.00009393639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007207189,"about_ca_system_score_gemma":0.00008847767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000986485,"about_ca_topic_score_gemma":0.000137066,"domain_scores_codex":[0.9985278,0.0002152286,0.0004188814,0.0003407426,0.0002885046,0.000208905],"domain_scores_gemma":[0.9980503,0.0003291597,0.0002119677,0.001057393,0.0002756095,0.00007554115],"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.000008277261,0.0002047099,0.00006789756,0.000002358273,0.00003112809,7.395144e-7,0.00005636398,0.005911977,0.0003225939,0.683676,0.004346076,0.3053719],"study_design_scores_gemma":[0.0006087261,0.00004501459,0.0009440289,0.00003289337,0.00001298969,0.000007650277,0.00002940342,0.9798089,0.00009135421,0.007190453,0.01103847,0.0001901026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004428271,0.0002670364,0.9558185,0.01527404,0.0006212336,0.0003117776,0.00002975934,0.0003059254,0.02294342],"genre_scores_gemma":[0.791478,0.00011666,0.2068356,0.0002790483,0.00006432584,0.00009344015,0.00005831257,0.000008705643,0.001065799],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9738969,"threshold_uncertainty_score":0.7611696,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002984261,0.0001516588,0.0002808217,0.0005700084,0.00009985636,0.0001128937,0.003039995,0.00009376627,0.00008303174],"category_scores_gemma":[0.000005820956,0.0001488933,0.0001452577,0.001086199,0.0001098743,0.0002632781,0.0001067434,0.0002677586,0.00001886259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008370591,"about_ca_system_score_gemma":0.000104382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001338588,"about_ca_topic_score_gemma":0.00219518,"domain_scores_codex":[0.9984297,0.0001681051,0.0005370326,0.0002863668,0.0003871575,0.0001916865],"domain_scores_gemma":[0.9978893,0.0002423884,0.000227844,0.00130692,0.0002835619,0.00004993654],"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.00003568316,0.001174272,0.0183374,0.00001285659,0.000280946,0.000005784423,0.0004451871,0.035184,0.004457713,0.9009404,0.001326994,0.03779881],"study_design_scores_gemma":[0.0004545045,0.00006156011,0.02575216,0.0001553809,0.00004292129,0.000001378943,0.00002525882,0.961471,0.001193078,0.00505867,0.005550481,0.0002336382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05077596,0.0001702039,0.8036383,0.01340061,0.0005084411,0.002168523,0.0002185396,0.0002028652,0.1289166],"genre_scores_gemma":[0.9936414,0.0001438401,0.005093752,0.0001150367,0.0000400865,0.0004016915,0.00009992314,0.000007824534,0.0004564414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9428654,"threshold_uncertainty_score":0.6071693,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003934765,0.0002319736,0.000246389,0.0001623407,0.00110176,0.0007409104,0.002200079,0.00008367351,0.00003414489],"category_scores_gemma":[0.00006068528,0.0002385301,0.000069788,0.0002852815,0.0004194549,0.0004385949,0.000522732,0.0003178985,0.0000100388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001323627,"about_ca_system_score_gemma":0.0001345224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008890712,"about_ca_topic_score_gemma":0.000680393,"domain_scores_codex":[0.9984117,0.0002786885,0.0004449842,0.0003857962,0.000210955,0.0002679279],"domain_scores_gemma":[0.996924,0.0005723532,0.0002227018,0.001264027,0.0009399614,0.00007696801],"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.00001758917,0.0001763437,0.0001676331,0.000005112216,0.00003108703,7.276254e-7,0.0001741369,0.005535836,0.004476822,0.9830288,0.0008219125,0.005563997],"study_design_scores_gemma":[0.0005226146,0.00004131178,0.0006139286,0.0001184668,0.000009160637,0.00001010006,0.00007142576,0.9898242,0.001643085,0.00376099,0.00309587,0.0002888298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01484466,0.0002423225,0.9664664,0.006180918,0.0004048116,0.0005233128,0.00008088258,0.0001618131,0.01109493],"genre_scores_gemma":[0.9418551,0.0009033942,0.05590364,0.0005254403,0.0001305013,0.00009900233,0.0001245193,0.00001603348,0.0004423318],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9842884,"threshold_uncertainty_score":0.9726976,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002067159,0.0002364388,0.0002456082,0.0002694182,0.0002455536,0.0001100638,0.00125065,0.0001407472,0.0001103289],"category_scores_gemma":[0.00002937846,0.0002765633,0.00005530093,0.0002109499,0.0003105241,0.0002613815,0.0001038078,0.0004111756,0.00005242397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002434808,"about_ca_system_score_gemma":0.00006554811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001323498,"about_ca_topic_score_gemma":0.0003673572,"domain_scores_codex":[0.9984796,0.0001395289,0.000613708,0.0002237722,0.0003379316,0.0002054527],"domain_scores_gemma":[0.9979494,0.0003496449,0.000176098,0.001119407,0.0003370271,0.00006848898],"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.00001165886,0.0002247823,0.02765921,0.00002113406,0.00006193708,6.210783e-7,0.0001112876,0.008938629,0.01151819,0.9447665,0.003249885,0.003436159],"study_design_scores_gemma":[0.001994608,0.000156119,0.06015225,0.0004730364,0.00006349804,0.000008367258,0.0002531011,0.5559101,0.02217101,0.3224042,0.03481496,0.001598748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07417759,0.001028044,0.7291699,0.00677212,0.0004132283,0.0008182888,0.001070714,0.002085386,0.1844647],"genre_scores_gemma":[0.9428114,0.000265466,0.05507418,0.0001006035,0.00008109023,0.0001608581,0.001377281,0.00003799061,0.00009112537],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8686338,"threshold_uncertainty_score":0.9999686,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009930177,0.0001934634,0.0001703128,0.0001629635,0.0002301949,0.0001197866,0.0008864132,0.0001687881,0.0001041868],"category_scores_gemma":[0.00003419008,0.000210176,0.00008060969,0.0002742449,0.0001669153,0.0001469409,0.00005153149,0.0002237978,0.00004737426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001612026,"about_ca_system_score_gemma":0.00003520762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006108144,"about_ca_topic_score_gemma":0.0001754726,"domain_scores_codex":[0.9989446,0.00003501603,0.0003948748,0.0001906839,0.0001841725,0.0002506595],"domain_scores_gemma":[0.9985675,0.0001708266,0.00009283295,0.0006954837,0.0004349932,0.00003838108],"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.00002207522,0.0001602366,0.001693395,0.00001948954,0.00007841946,0.000001240981,0.00006134127,0.3830386,0.001133463,0.5660024,0.04001513,0.007774258],"study_design_scores_gemma":[0.0004548138,0.00002315459,0.0002454882,0.00004689954,0.00001633495,0.00000301601,0.00009463694,0.9522057,0.00285899,0.002818475,0.04098879,0.0002437339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00351876,0.000219141,0.9480422,0.001393689,0.0009992259,0.0004960754,0.0002675511,0.0009355888,0.04412776],"genre_scores_gemma":[0.994868,0.0007012626,0.002349279,0.0001796698,0.000177453,0.0002998812,0.000732955,0.00003730053,0.0006541568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9913493,"threshold_uncertainty_score":0.857073,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001103266,0.0002263036,0.0001970884,0.000131647,0.0002002246,0.000103008,0.00126436,0.0001499097,0.0000755759],"category_scores_gemma":[0.00002082238,0.0002489137,0.00009744912,0.0001777445,0.0001828165,0.0002001277,0.0001163942,0.0003534349,0.0000992451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002078333,"about_ca_system_score_gemma":0.00002494736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004777039,"about_ca_topic_score_gemma":0.00033451,"domain_scores_codex":[0.9987788,0.00002971895,0.0004051497,0.000232268,0.0002033975,0.0003506978],"domain_scores_gemma":[0.9983827,0.0003428768,0.00009570199,0.0008823688,0.0002486976,0.00004758281],"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.00003025836,0.0003003683,0.0001625332,0.00001660352,0.0001840474,0.000002886582,0.00003060137,0.3240947,0.005331711,0.5312315,0.05315238,0.08546238],"study_design_scores_gemma":[0.0003365547,0.00006351104,0.0003193623,0.00008161705,0.00001964293,0.000005345856,0.00002338584,0.8944544,0.0009303926,0.05289657,0.05057815,0.0002910982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01194246,0.001173787,0.8860889,0.005088108,0.002477824,0.001345445,0.0006337224,0.002803022,0.08844673],"genre_scores_gemma":[0.7176302,0.001302692,0.2783299,0.0002346502,0.000321885,0.0005529255,0.001042858,0.00006249485,0.000522383],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7056877,"threshold_uncertainty_score":0.9999963,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002054133,0.0002300733,0.0001993189,0.0002015183,0.0003248765,0.000393596,0.004153989,0.00009611713,0.0003133122],"category_scores_gemma":[0.0000403905,0.0002052292,0.0001058787,0.0003203434,0.0001493339,0.0004690195,0.0003143682,0.0003463806,0.00064364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001224584,"about_ca_system_score_gemma":0.000252074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003110732,"about_ca_topic_score_gemma":0.0005414405,"domain_scores_codex":[0.9981368,0.0001618415,0.000501802,0.000395881,0.0004961468,0.0003075105],"domain_scores_gemma":[0.9969597,0.0003245459,0.0002361335,0.001844641,0.0005289377,0.0001059911],"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.00003581836,0.0004221062,0.0002425567,0.000001898467,0.00004146528,0.000006092345,0.00008833796,0.001005171,0.0004051407,0.8782079,0.02732758,0.09221593],"study_design_scores_gemma":[0.001520243,0.000222605,0.002333709,0.0001097756,0.0000209522,0.00003381196,0.00009565126,0.8593054,0.0002787041,0.01324912,0.1222314,0.0005985916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01728382,0.000290997,0.4274481,0.05487888,0.003812528,0.0008430582,0.000204223,0.001155751,0.4940826],"genre_scores_gemma":[0.9713488,0.0001595126,0.009275828,0.001023416,0.0002428244,0.0001313451,0.0001025262,0.00001509422,0.01770068],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.954065,"threshold_uncertainty_score":0.8369003,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001829316,0.0002130958,0.000175819,0.000146945,0.0002124839,0.0001292166,0.0004031484,0.000113573,0.00004773397],"category_scores_gemma":[0.00001817534,0.000243418,0.00005744486,0.0001326094,0.00008985217,0.0002429117,0.0000579502,0.0002617112,0.00001303804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001917385,"about_ca_system_score_gemma":0.00002651548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003009737,"about_ca_topic_score_gemma":0.00006901308,"domain_scores_codex":[0.9988471,0.00005095251,0.0004358403,0.0002345359,0.000199474,0.0002320596],"domain_scores_gemma":[0.9987808,0.0001900565,0.0001337539,0.0005430446,0.000290271,0.00006207099],"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.000006004266,0.00007140938,0.00004389621,0.000007483181,0.00003814615,5.752225e-7,0.00003259435,0.9360316,0.002052163,0.02660716,0.001089208,0.03401978],"study_design_scores_gemma":[0.0004664975,0.00002888499,0.0001209023,0.0000863663,0.00001801883,0.000001830888,0.00005384362,0.9920307,0.001510542,0.003476567,0.001963003,0.0002428406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001362204,0.0003138849,0.9916267,0.0008781936,0.0004821054,0.0004221874,0.0001892275,0.0002232804,0.004502235],"genre_scores_gemma":[0.7764814,0.001000961,0.220092,0.00008212186,0.000262307,0.000257035,0.001579687,0.00004404647,0.0002003941],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7751192,"threshold_uncertainty_score":0.9926298,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001474457,0.000203926,0.0002181002,0.0002863671,0.0001275926,0.00004476092,0.001477072,0.00009812584,0.0001196556],"category_scores_gemma":[0.00003662995,0.0002298091,0.00007368204,0.0002933805,0.0001887175,0.0002630812,0.0001164416,0.000365908,0.00005054632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002283529,"about_ca_system_score_gemma":0.00004965147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001414609,"about_ca_topic_score_gemma":0.0001042694,"domain_scores_codex":[0.9987594,0.00009195977,0.0005536916,0.0001841207,0.0002352863,0.0001755029],"domain_scores_gemma":[0.9975859,0.0001889316,0.0001976334,0.001371182,0.0006144508,0.00004188358],"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.00007203848,0.0009820254,0.0001942762,0.00002704312,0.0002042173,5.402995e-7,0.0001528144,0.01186519,0.7820174,0.1823073,0.009759722,0.01241749],"study_design_scores_gemma":[0.0008811002,0.000270444,0.002792037,0.0002294064,0.00003307638,0.000008615898,0.00004241824,0.7584636,0.2102397,0.01306346,0.01351981,0.0004563173],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.03425326,0.0006467197,0.2423115,0.003147288,0.001442281,0.001901144,0.00152137,0.00389501,0.7108814],"genre_scores_gemma":[0.9861547,0.00053684,0.01122455,0.00002961389,0.00007081726,0.0002544424,0.000500683,0.00004005865,0.001188262],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9519015,"threshold_uncertainty_score":0.9371344,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008101291,0.0002731326,0.0002241958,0.000381021,0.0002844551,0.0004615674,0.008117354,0.000127662,0.00003237351],"category_scores_gemma":[0.0001471746,0.0002898549,0.0001225658,0.0005495798,0.0001221275,0.0002969039,0.001407717,0.0003330148,0.0002591053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002858101,"about_ca_system_score_gemma":0.00005478173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001818852,"about_ca_topic_score_gemma":0.0005245722,"domain_scores_codex":[0.9974129,0.0000788364,0.0005197601,0.0006360383,0.0008789835,0.0004735071],"domain_scores_gemma":[0.9945213,0.0003049715,0.0001551251,0.003316453,0.001578427,0.0001237908],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001694481,0.0003300225,0.0001629691,0.000003232978,0.00005944904,0.000001824216,0.00006660098,0.0147723,0.00009081385,0.7668399,0.1925678,0.02508814],"study_design_scores_gemma":[0.0004700235,0.0001446812,0.005376316,0.00007057343,0.00001871769,0.000005160194,0.00006845992,0.3943532,0.0003306084,0.05792216,0.5407262,0.0005138558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001212026,0.00003117252,0.7722271,0.1502778,0.0008692816,0.0009812354,0.0001008817,0.0006046215,0.07369586],"genre_scores_gemma":[0.7587132,0.00003652344,0.2233495,0.002155267,0.0001290419,0.001016022,0.0001838088,0.00001998797,0.01439656],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7575012,"threshold_uncertainty_score":0.9999554,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001802027,0.0003096307,0.0002521038,0.0002360404,0.0002667915,0.0001432107,0.001475904,0.0001922589,0.0000879561],"category_scores_gemma":[0.00001504104,0.0003652124,0.0001295303,0.0003279838,0.0001372778,0.0001709021,0.00006453499,0.0004513596,0.00003332745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003984264,"about_ca_system_score_gemma":0.00003020913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002648808,"about_ca_topic_score_gemma":0.000142693,"domain_scores_codex":[0.9983663,0.00007483595,0.0005349841,0.0003224553,0.0003301375,0.0003712985],"domain_scores_gemma":[0.9976915,0.0004738259,0.0001731951,0.001319523,0.0002649262,0.00007704699],"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.00003167082,0.0001061373,0.00005104341,0.00001460937,0.00006326366,8.804199e-7,0.00001610943,0.666864,0.00004475659,0.3172211,0.01068356,0.004902821],"study_design_scores_gemma":[0.0006064614,0.00002950812,0.0001239928,0.00026546,0.00003385768,0.00000159963,0.00004935547,0.9693298,0.0002818485,0.009616059,0.01929665,0.0003654397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006613589,0.000119569,0.9515143,0.001250555,0.0007170444,0.0006380561,0.0001161233,0.0004832048,0.04449979],"genre_scores_gemma":[0.9088688,0.0005373034,0.0872945,0.0002847605,0.0003780625,0.000672852,0.0009637547,0.00009035788,0.0009095414],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9082075,"threshold_uncertainty_score":0.99988,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003826992,0.0001496343,0.0001545956,0.00008379677,0.000228596,0.0001491437,0.002531667,0.00007387455,0.0000875214],"category_scores_gemma":[0.00004019043,0.0001212928,0.00006045767,0.0002019548,0.0002469198,0.0001988104,0.0003878916,0.0003762831,0.00002700823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005633777,"about_ca_system_score_gemma":0.0000591483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007459926,"about_ca_topic_score_gemma":0.0003403577,"domain_scores_codex":[0.9987226,0.0002252294,0.0003175287,0.000268155,0.0002968092,0.0001697095],"domain_scores_gemma":[0.996452,0.001289985,0.0002271758,0.001708334,0.0002812869,0.0000412214],"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.00001090912,0.0002161524,0.0001412832,0.000001209498,0.00002387309,0.000001085754,0.00007979017,0.01438316,0.0001757555,0.9662849,0.002998419,0.01568343],"study_design_scores_gemma":[0.0003192004,0.0001671737,0.002825147,0.00008409017,0.000006511346,0.0000105683,0.00002534313,0.9466152,0.0002779253,0.03882743,0.0106406,0.0002007852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1473562,0.001971307,0.6778792,0.01366632,0.001124038,0.001188175,0.0001039192,0.0002477386,0.1564632],"genre_scores_gemma":[0.9957302,0.0009839102,0.002126396,0.0004322652,0.00004592389,0.0001692107,0.00002181087,0.000008958342,0.0004812816],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9322321,"threshold_uncertainty_score":0.4946177,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001973214,0.0002190435,0.0002246639,0.0002328869,0.0001852295,0.0001187514,0.0003865501,0.000149211,0.00002237277],"category_scores_gemma":[0.00001268898,0.0002455039,0.00004698849,0.0001875884,0.00006445433,0.000346956,0.00002596229,0.0002605421,0.000004377219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002427574,"about_ca_system_score_gemma":0.00002858421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001845197,"about_ca_topic_score_gemma":0.001501632,"domain_scores_codex":[0.9987803,0.00006604935,0.0004980411,0.0002523204,0.0001703689,0.0002329911],"domain_scores_gemma":[0.9988424,0.0002263889,0.0001571614,0.000436921,0.000276718,0.0000604271],"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.00006073969,0.00009133159,0.0007630562,0.00002820578,0.00003050762,3.123016e-7,0.00006263853,0.9606315,0.005253475,0.02558551,0.0002840581,0.007208677],"study_design_scores_gemma":[0.001215809,0.00003350275,0.001581193,0.000265188,0.00001569947,0.000003336938,0.00007203608,0.9920203,0.001366935,0.002383058,0.0008045358,0.000238413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06209309,0.000500315,0.9300824,0.001101657,0.0007243308,0.0007274305,0.00008008107,0.0002436553,0.004446993],"genre_scores_gemma":[0.9941401,0.001607394,0.002984847,0.000114443,0.0002135933,0.000257824,0.0005061352,0.00004177815,0.0001338627],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.932047,"threshold_uncertainty_score":0.9999997,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000171036,0.0002517276,0.0002595205,0.0001712533,0.0002541481,0.0001732684,0.002056868,0.0001214589,0.00004669033],"category_scores_gemma":[0.0000273984,0.0002820766,0.0001111956,0.000158091,0.0001756508,0.0002351981,0.0001243857,0.0002822565,0.00002189955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002768076,"about_ca_system_score_gemma":0.00004453689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001821155,"about_ca_topic_score_gemma":0.0002295094,"domain_scores_codex":[0.9986383,0.00008875111,0.0005537124,0.0002385073,0.0002291523,0.0002515181],"domain_scores_gemma":[0.9975551,0.0002103609,0.0001596846,0.001645896,0.0003722152,0.00005678971],"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.00003061966,0.0003681585,0.00009606656,0.00008748655,0.00007951887,4.688993e-7,0.00006977162,0.07754628,0.01780965,0.8914163,0.007936448,0.004559258],"study_design_scores_gemma":[0.0005443863,0.00002260592,0.00009003065,0.00009730297,0.00001325269,0.000005811895,0.00009392811,0.9730522,0.005000355,0.01261642,0.00810592,0.0003577553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005117576,0.0002887521,0.8593283,0.0005840057,0.000352851,0.0008738136,0.0003413656,0.001078243,0.1320351],"genre_scores_gemma":[0.8310654,0.0003807274,0.1658644,0.00005285189,0.0001045373,0.0009176236,0.0008098027,0.00005113029,0.0007535971],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.895506,"threshold_uncertainty_score":0.9999632,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005139899,0.00022847,0.0002255405,0.0002122092,0.0002993045,0.0003284126,0.003991387,0.0001672337,0.00001299605],"category_scores_gemma":[0.00002524274,0.0002530232,0.00008338648,0.0004161435,0.0001420784,0.000782612,0.0002597991,0.0004193227,0.00001958424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002800336,"about_ca_system_score_gemma":0.0001567162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003161221,"about_ca_topic_score_gemma":0.005832646,"domain_scores_codex":[0.9980183,0.000196462,0.0005771219,0.0005220613,0.0003071456,0.0003789181],"domain_scores_gemma":[0.9966528,0.0003514808,0.0002998125,0.002048133,0.0005650144,0.00008280426],"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.0001455814,0.001599532,0.000694503,0.000009648737,0.00003381764,0.000003189164,0.0002077734,0.04418182,0.01108899,0.7856482,0.004712047,0.1516749],"study_design_scores_gemma":[0.0007263677,0.0001407434,0.002236444,0.00009354263,0.000004164969,0.00000352217,0.00002162938,0.9859897,0.0003293176,0.006615214,0.003575772,0.0002635894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01412328,0.0003255509,0.9747418,0.004551413,0.0008463673,0.0007651398,0.00005760123,0.0001865078,0.004402322],"genre_scores_gemma":[0.9525948,0.0007144381,0.04485229,0.0003172787,0.0001672729,0.000566734,0.0003038637,0.00002112188,0.0004622267],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9418079,"threshold_uncertainty_score":0.9999922,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003394633,0.0001532581,0.0002504367,0.0004015322,0.0001730124,0.0002213078,0.002769085,0.00006302841,0.0001342032],"category_scores_gemma":[0.00001223465,0.0001367477,0.00009287083,0.001233673,0.0001240448,0.0003257934,0.0001748255,0.0002181515,0.00002144025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005765164,"about_ca_system_score_gemma":0.0001696589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005905921,"about_ca_topic_score_gemma":0.001181378,"domain_scores_codex":[0.9986289,0.0001679928,0.0004113951,0.0002819255,0.0003216901,0.0001881024],"domain_scores_gemma":[0.9973109,0.0003010306,0.0003057506,0.001518697,0.00051641,0.00004722806],"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.00001843362,0.0002852413,0.0008876771,0.000004075189,0.00030333,0.000001473692,0.0001001758,0.1495956,0.000811012,0.8443857,0.0009214985,0.002685789],"study_design_scores_gemma":[0.0003633469,0.00009632811,0.00369911,0.0001087075,0.00007994061,0.00000214458,0.00001853897,0.9831944,0.0004279838,0.003485453,0.008304528,0.0002195299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01929869,0.00009710487,0.7871746,0.006829616,0.000275449,0.001671998,0.0001464973,0.0002588375,0.1842471],"genre_scores_gemma":[0.9691887,0.00003863692,0.02902883,0.0001656309,0.00004259627,0.0004681251,0.00009903681,0.000009035113,0.0009594257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.94989,"threshold_uncertainty_score":0.557641,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003461131,0.0002080892,0.0001999951,0.0002415445,0.0002216359,0.0002368253,0.002814284,0.0001444267,0.000009975682],"category_scores_gemma":[0.00001246478,0.0002285612,0.0001037513,0.0003697509,0.00006534835,0.0003757256,0.0002406106,0.0003727272,0.0000445374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000521631,"about_ca_system_score_gemma":0.0001051283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001573113,"about_ca_topic_score_gemma":0.002769979,"domain_scores_codex":[0.998301,0.0001701916,0.0005077262,0.000420169,0.0002963409,0.000304601],"domain_scores_gemma":[0.9974657,0.0003205335,0.000257064,0.00143664,0.0004596631,0.00006038044],"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.0001016713,0.00101294,0.0003652677,0.0000190067,0.00006593976,0.000009089221,0.0002782601,0.01278779,0.0009461946,0.8797212,0.001507953,0.1031848],"study_design_scores_gemma":[0.0006495927,0.000113621,0.001176398,0.0001123718,0.00001170907,0.000013821,0.00006408105,0.9866058,0.0004443363,0.001913126,0.008648277,0.0002468683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002113028,0.0004539546,0.9741185,0.001404474,0.00119442,0.001018124,0.00004507411,0.0004194249,0.01923299],"genre_scores_gemma":[0.9393056,0.0002033431,0.05884812,0.00009055163,0.0001308742,0.00102264,0.00005609001,0.00001866908,0.0003241394],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.973818,"threshold_uncertainty_score":0.9320457,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008138346,0.0001873836,0.0001445441,0.0002625668,0.0001496342,0.0002109243,0.001382825,0.00005979395,0.00003148488],"category_scores_gemma":[0.0000167226,0.0002055511,0.0000825011,0.0002178955,0.00006247972,0.0002029397,0.0001338874,0.0001443671,0.0001032989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001734843,"about_ca_system_score_gemma":0.00002297492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002247777,"about_ca_topic_score_gemma":0.00013105,"domain_scores_codex":[0.9990234,0.00002133992,0.0003744985,0.0002005934,0.0001781179,0.0002020977],"domain_scores_gemma":[0.9983577,0.0000974278,0.00006073658,0.001195238,0.0002286552,0.0000602072],"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.00006715526,0.001325849,0.0002666934,0.00005809974,0.0002876549,9.297218e-7,0.0002964188,0.09047008,0.0009580916,0.8466326,0.04994588,0.009690543],"study_design_scores_gemma":[0.0006457051,0.0000403316,0.001667262,0.00007613774,0.00003020173,0.000004469361,0.000140152,0.8638906,0.0002727041,0.00829572,0.1245278,0.0004088983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.005950333,0.0001919319,0.4208806,0.006696266,0.0006503318,0.001206293,0.0009894291,0.000508049,0.5629267],"genre_scores_gemma":[0.9680023,0.0002746114,0.02554217,0.0001198844,0.00007250078,0.0005374354,0.00170957,0.00003842459,0.003703143],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9620519,"threshold_uncertainty_score":0.838213,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001172186,0.000237607,0.0002168115,0.0001617002,0.0002467672,0.0000976305,0.0007974047,0.0001523966,0.00006671954],"category_scores_gemma":[0.00001808008,0.0002573073,0.00009586994,0.0001865644,0.00009439213,0.0001915018,0.0000320889,0.0002615172,0.000008825855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002105038,"about_ca_system_score_gemma":0.00006487555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003722007,"about_ca_topic_score_gemma":0.00009729408,"domain_scores_codex":[0.9988021,0.00005899849,0.0004352641,0.0002226211,0.0002076997,0.0002733562],"domain_scores_gemma":[0.998418,0.0002702769,0.0001571454,0.0006533922,0.0004310086,0.00007016966],"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.0000434013,0.00009551479,0.00029159,0.000007962326,0.00003319453,5.831739e-7,0.000006323679,0.9603124,0.002413453,0.03303532,0.0008201531,0.002940159],"study_design_scores_gemma":[0.001016034,0.00002659584,0.0001450584,0.0001398797,0.00002955102,0.000002163754,0.00001111637,0.9935698,0.0004565011,0.002582936,0.001754241,0.0002661083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006174763,0.0003233567,0.9838192,0.0007965228,0.0005975669,0.0004975657,0.0001980675,0.0003016735,0.007291248],"genre_scores_gemma":[0.9733328,0.0003245117,0.02488829,0.0002203835,0.0002558101,0.0002389781,0.0005372118,0.00005529293,0.0001467845],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.967158,"threshold_uncertainty_score":0.9999879,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002392691,0.0001717224,0.0001512792,0.0001858632,0.0001543081,0.0002782804,0.003361449,0.00009824667,0.00001127848],"category_scores_gemma":[0.00003464412,0.0001859845,0.00002599622,0.000357738,0.0001348467,0.000434097,0.0008151016,0.0002537021,0.000007840855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007471679,"about_ca_system_score_gemma":0.0000463795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009640341,"about_ca_topic_score_gemma":0.002765736,"domain_scores_codex":[0.9984701,0.000160809,0.0003972476,0.0004548283,0.000275124,0.0002419369],"domain_scores_gemma":[0.9970526,0.0003087511,0.0001812325,0.002226542,0.0001774731,0.00005347737],"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.00001421815,0.0003604907,0.002331275,0.000002435851,0.00002534417,0.00001052021,0.0000612423,0.2414912,0.0004693878,0.7321497,0.002115879,0.02096838],"study_design_scores_gemma":[0.0002880157,0.00001418587,0.003136046,0.00008226143,0.000003173129,0.000009651339,0.00001997892,0.9891109,0.00009990585,0.001274758,0.005774803,0.0001863254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01460411,0.0003874702,0.9595241,0.00775199,0.0006090374,0.000145803,0.0001230019,0.0002127926,0.01664172],"genre_scores_gemma":[0.9794468,0.0007247255,0.01840448,0.0001823997,0.00008534054,0.0000258386,0.000813616,0.0000127562,0.0003040687],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9648427,"threshold_uncertainty_score":0.7584229,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001358017,0.0001943342,0.0001948758,0.0002153784,0.00010184,0.0001007678,0.0008601063,0.0001179933,0.00001471202],"category_scores_gemma":[0.00001890365,0.0002299597,0.00004174721,0.0002836108,0.00004967877,0.0002582197,0.00005098136,0.0002636112,0.00002678091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002219514,"about_ca_system_score_gemma":0.00004261313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003629289,"about_ca_topic_score_gemma":0.001153702,"domain_scores_codex":[0.9988553,0.0000263856,0.0004671535,0.0002084794,0.0002073386,0.0002353671],"domain_scores_gemma":[0.9985693,0.0002586828,0.0001084966,0.0005990874,0.0004212099,0.00004322638],"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.00001088779,0.0001231819,0.0001683506,0.00002124203,0.00002197856,3.254548e-7,0.00006673064,0.9678684,0.005529694,0.02357893,0.0001890847,0.002421182],"study_design_scores_gemma":[0.0007994833,0.000009780237,0.0004349631,0.0002025067,0.000006852876,0.00000314564,0.00008848465,0.9958315,0.0004495765,0.0003665877,0.001578621,0.000228462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01412142,0.0002946024,0.9694317,0.0008909001,0.001214481,0.0007414892,0.0003559777,0.0003268265,0.01262258],"genre_scores_gemma":[0.9185233,0.0003254567,0.07945921,0.00006005153,0.0002177323,0.0004260998,0.0007148286,0.00004921711,0.0002241493],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9044018,"threshold_uncertainty_score":0.9377483,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003441115,0.0002352931,0.000232762,0.0001953656,0.0006252917,0.0003355352,0.004087936,0.0001102738,0.0001154984],"category_scores_gemma":[0.00006255562,0.0002366504,0.0001532974,0.0004149628,0.0001447571,0.0003502982,0.0003239721,0.0003203997,0.0001461342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001710895,"about_ca_system_score_gemma":0.0001614209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003888265,"about_ca_topic_score_gemma":0.0001096864,"domain_scores_codex":[0.9982273,0.0002421602,0.0005249461,0.0003879618,0.0003467056,0.0002709523],"domain_scores_gemma":[0.9961985,0.0005028882,0.0002410665,0.002064459,0.0008953388,0.00009775372],"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.0000464105,0.000773052,0.00006375,0.000005974738,0.00006792946,0.000001290831,0.0001539103,0.001687495,0.02957331,0.9010324,0.04090881,0.02568567],"study_design_scores_gemma":[0.000984459,0.00008519981,0.001181021,0.0001251094,0.00001520982,0.00001041143,0.00001537582,0.785452,0.002495044,0.005238751,0.2040445,0.0003529336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001903872,0.0003070326,0.8750526,0.06512754,0.0004016679,0.0007446799,0.0002846475,0.0004835231,0.0556944],"genre_scores_gemma":[0.9263906,0.0007142131,0.06626273,0.0004205472,0.00008998877,0.0002410527,0.0008336765,0.0000215239,0.005025609],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9244868,"threshold_uncertainty_score":0.9650323,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004391813,0.0001294852,0.0002377484,0.0006950534,0.0001660672,0.000275445,0.002685831,0.0000603674,0.000007768334],"category_scores_gemma":[0.00003194015,0.0001384113,0.00003611651,0.0006698943,0.0002468341,0.0006669204,0.0008698272,0.0002891218,0.000003634859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001049579,"about_ca_system_score_gemma":0.00003292231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002751405,"about_ca_topic_score_gemma":0.001947746,"domain_scores_codex":[0.9985173,0.0002149072,0.0004383673,0.0002827228,0.0003580608,0.0001886331],"domain_scores_gemma":[0.9978113,0.0004627799,0.0002323708,0.001358292,0.0000866954,0.00004851996],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002205004,0.0004615537,0.7467932,0.00002716275,0.0002576874,0.000001506079,0.0005084377,0.04545585,0.003702196,0.1926322,0.00006352479,0.01007464],"study_design_scores_gemma":[0.0001792905,0.00001436359,0.2878177,0.00006555916,0.00001094426,0.000001702524,0.00002418611,0.7109413,0.0003445731,0.0003086942,0.0001986302,0.00009309944],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9519594,0.0002936414,0.03933212,0.001480393,0.00009302107,0.0002545501,0.00003893885,0.00003172582,0.006516207],"genre_scores_gemma":[0.9953346,0.001793494,0.002652195,0.00002051437,0.00001319878,0.00004811929,0.00004004653,0.000006415991,0.00009139058],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6654854,"threshold_uncertainty_score":0.5644248,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003606906,0.0002290763,0.0001916399,0.0001646042,0.0004491763,0.0004335765,0.003865436,0.0001289485,0.0000709318],"category_scores_gemma":[0.00004662271,0.0002514981,0.000152856,0.0003082912,0.0001279391,0.000373607,0.0002645767,0.0003700211,0.00007484062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002017149,"about_ca_system_score_gemma":0.0002076439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006744907,"about_ca_topic_score_gemma":0.0003473132,"domain_scores_codex":[0.9981951,0.0001242021,0.0005135817,0.0004385843,0.0003697661,0.0003587842],"domain_scores_gemma":[0.9963234,0.0006750468,0.0003005797,0.001915465,0.0007033746,0.00008213982],"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.00002700696,0.0003750258,0.0002549278,0.00000377597,0.00003775529,0.000001760018,0.00004487252,0.02263895,0.0005616684,0.9503874,0.01369514,0.01197168],"study_design_scores_gemma":[0.0005828248,0.00007543023,0.0004709888,0.0001034431,0.000007923087,0.000004346372,0.000009825728,0.9685113,0.0002114155,0.008521653,0.02123877,0.000262059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006645171,0.0002294114,0.9574608,0.01266986,0.0009065758,0.0005407223,0.00006101045,0.0002966844,0.02717047],"genre_scores_gemma":[0.8651089,0.00009125259,0.1315532,0.001259635,0.0003280066,0.0005204221,0.0003501581,0.00002363528,0.0007648372],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9458724,"threshold_uncertainty_score":0.9999937,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007755191,0.0001804755,0.0003181999,0.0002386916,0.0003235411,0.0002170161,0.005222762,0.00006985653,0.00005769719],"category_scores_gemma":[0.00001468715,0.0001862172,0.00008155024,0.0007106797,0.000172009,0.00047994,0.00118043,0.0002587309,0.000008892908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005770876,"about_ca_system_score_gemma":0.00008077236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000597304,"about_ca_topic_score_gemma":0.002835865,"domain_scores_codex":[0.9980028,0.0003093908,0.0006674626,0.0004130622,0.0003696044,0.0002376366],"domain_scores_gemma":[0.9951446,0.0003760105,0.0003284645,0.003638464,0.0004454568,0.00006697937],"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.00001084019,0.000129499,0.0005105869,0.000001189618,0.0002937412,4.281972e-7,0.00006525724,0.3007935,0.00001079553,0.6769958,0.00141555,0.01977281],"study_design_scores_gemma":[0.0003475624,0.00002130695,0.0007353229,0.00004986146,0.0001237614,0.000001785574,0.00005139435,0.9883736,7.515083e-7,0.006859623,0.003266083,0.0001689671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001991965,0.0007627773,0.9763266,0.006798163,0.0001511067,0.0002282003,0.0001243868,0.00009821595,0.01351862],"genre_scores_gemma":[0.9197085,0.000890035,0.07783989,0.0002813025,0.00007135144,0.00004576706,0.001040506,0.000008540494,0.0001141312],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9177165,"threshold_uncertainty_score":0.9705278,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001035343,0.0001300813,0.0001559451,0.000473092,0.0000479739,0.00002309467,0.0008849636,0.0000912947,0.00005042559],"category_scores_gemma":[0.00005644839,0.0001473484,0.00004725214,0.000533827,0.0001555088,0.00013838,0.00007563538,0.0003546471,0.0000300652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001712258,"about_ca_system_score_gemma":0.00002156735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007748669,"about_ca_topic_score_gemma":0.0005281146,"domain_scores_codex":[0.999113,0.00002345437,0.0003804114,0.000135496,0.0001775888,0.0001700004],"domain_scores_gemma":[0.9990139,0.0002601319,0.00006830083,0.0005042193,0.0001321811,0.00002129011],"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.00001008501,0.0002096159,0.001116837,0.00001013141,0.00002841974,0.00000157285,0.00002785446,0.3277914,0.002300122,0.6495416,0.000702101,0.01826032],"study_design_scores_gemma":[0.0005202635,0.00004300828,0.009788964,0.0001831585,0.000009283825,0.000007117561,0.0001178258,0.9526604,0.001863748,0.02919324,0.005281907,0.0003311142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6588564,0.0009074291,0.01443351,0.002504158,0.0009088574,0.000406342,0.0001210438,0.00111208,0.3207502],"genre_scores_gemma":[0.9806692,0.0004996983,0.01847948,0.00001477687,0.0000378158,0.00004931168,0.00004444481,0.00001756266,0.0001876924],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.624869,"threshold_uncertainty_score":0.6008693,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002998447,0.0002395201,0.0002026561,0.0001659483,0.0003170373,0.0003685654,0.004630381,0.0001049986,0.0001483473],"category_scores_gemma":[0.00006114782,0.0002406548,0.0001054592,0.0004383103,0.0001587666,0.0003478493,0.0009584271,0.0003951222,0.0003990017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001541523,"about_ca_system_score_gemma":0.0001580603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000172066,"about_ca_topic_score_gemma":0.001176952,"domain_scores_codex":[0.9980359,0.000158658,0.0004591946,0.000459198,0.0004828451,0.0004041888],"domain_scores_gemma":[0.9962537,0.0004279025,0.0001715614,0.002601831,0.0003959849,0.0001489829],"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.00001095633,0.0002000755,0.0003915919,0.000001032554,0.00001642526,0.000001438351,0.000139198,0.1353589,0.0002829791,0.8476333,0.0135017,0.002462372],"study_design_scores_gemma":[0.0002933956,0.00003919887,0.001039775,0.0000834498,0.000005807,0.000004339275,0.000006678296,0.8594359,0.00009279481,0.1308579,0.007903962,0.0002367371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01060671,0.00006986752,0.8770805,0.01010627,0.0007166976,0.0005142111,0.00007872645,0.0002957944,0.1005312],"genre_scores_gemma":[0.9495288,0.0001070076,0.04648615,0.001685393,0.0002241678,0.0002671155,0.00009185132,0.00002174007,0.001587799],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.938922,"threshold_uncertainty_score":0.9813619,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004796086,0.0001797097,0.00029468,0.0007108874,0.0002619195,0.0002316635,0.004412749,0.0001018644,0.00003725018],"category_scores_gemma":[0.00002073463,0.0001802771,0.00009837758,0.001462049,0.0002576603,0.0004669076,0.0007500893,0.0004791745,0.000009030018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009279764,"about_ca_system_score_gemma":0.0001157308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007680349,"about_ca_topic_score_gemma":0.0008749964,"domain_scores_codex":[0.9981416,0.0002333108,0.000582999,0.0003276658,0.0004747382,0.0002396976],"domain_scores_gemma":[0.9960922,0.00031145,0.0002106665,0.002359178,0.0009556524,0.00007085966],"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.00002131805,0.0002770519,0.004477452,0.000004619098,0.0003146952,5.489679e-7,0.0001321265,0.4072655,0.0004356156,0.5609612,0.0002302857,0.02587956],"study_design_scores_gemma":[0.0001817902,0.00003333943,0.004520319,0.00004978514,0.00003830392,0.000001769703,0.00003444581,0.9936175,0.00009677619,0.001055776,0.0002078763,0.0001622957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2200845,0.000314473,0.7438855,0.003708497,0.0001725511,0.0002290232,0.00004606388,0.000139817,0.03141968],"genre_scores_gemma":[0.9862803,0.001869238,0.01112045,0.00009635548,0.00002780376,0.00005888348,0.0002257193,0.00001125355,0.000309957],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7661959,"threshold_uncertainty_score":0.8200058,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000345243,0.0001814419,0.0002260044,0.0002959784,0.0001525004,0.0001272334,0.001791645,0.00008454323,0.000008924772],"category_scores_gemma":[0.00001016726,0.0001929623,0.00003020964,0.0005425072,0.0001235622,0.0003589331,0.0002478899,0.0003004759,0.000006777212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009438535,"about_ca_system_score_gemma":0.00005981341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007034157,"about_ca_topic_score_gemma":0.001634347,"domain_scores_codex":[0.998288,0.0001794781,0.0005508593,0.0003746858,0.0003573621,0.0002496465],"domain_scores_gemma":[0.9978918,0.0002220047,0.0002473373,0.00127442,0.0003197941,0.00004467926],"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.0000221699,0.001615179,0.01118071,0.00000716242,0.00002159925,0.000002064564,0.000367053,0.8786128,0.0005234052,0.1008985,0.0001063898,0.006642938],"study_design_scores_gemma":[0.0006401464,0.0001231059,0.01703739,0.00009356034,0.000005633882,0.000004901415,0.0001780727,0.9813898,0.0001488362,0.00007754404,0.0001261556,0.0001748653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9711882,0.00006137291,0.01579557,0.0007460075,0.000233976,0.0003290084,0.000004844988,0.00008359492,0.01155739],"genre_scores_gemma":[0.9948421,0.0003021238,0.004193971,0.00004478895,0.00003988032,0.00007591795,0.00003286136,0.00001277219,0.0004556339],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.102777,"threshold_uncertainty_score":0.7868776,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0002751418,0.0002385854,0.0002282829,0.0002555306,0.000138159,0.0005506818,0.005817896,0.0001193392,0.00004537233],"category_scores_gemma":[0.0000105061,0.0002560036,0.00007114498,0.000921538,0.00004816255,0.0007568517,0.0007975361,0.0004932622,0.0002260415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002253563,"about_ca_system_score_gemma":0.0002304273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007662935,"about_ca_topic_score_gemma":0.004132623,"domain_scores_codex":[0.9980124,0.0001612014,0.000497213,0.0005463654,0.0004256387,0.0003571734],"domain_scores_gemma":[0.9967818,0.0002214049,0.0001623464,0.002432477,0.0002742416,0.000127785],"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.00003085081,0.0007578086,0.0004026638,0.00000484007,0.00002681414,0.000003278304,0.0003544808,0.116999,0.0002785259,0.8056476,0.01824044,0.05725369],"study_design_scores_gemma":[0.0005331662,0.00005176037,0.002444551,0.0001235436,0.000004974509,0.000009928672,0.00006445617,0.9595743,0.00006182625,0.005352585,0.03138516,0.0003937802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004328212,0.0003033854,0.8763963,0.005785037,0.0005609665,0.0006563431,0.00002413294,0.0001669646,0.1117786],"genre_scores_gemma":[0.9404938,0.000484367,0.05287945,0.001495811,0.0001828661,0.0005542501,0.000153027,0.00002313976,0.003733292],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9361656,"threshold_uncertainty_score":0.9999892,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000188211,0.0002243194,0.0001783032,0.000130724,0.0001550545,0.0001554281,0.001382902,0.000121559,0.0007046547],"category_scores_gemma":[0.00002051504,0.0002398495,0.00009200575,0.0001592163,0.000158537,0.0002361917,0.0001224357,0.0004537255,0.0004003748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000223924,"about_ca_system_score_gemma":0.00005372136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003810113,"about_ca_topic_score_gemma":0.002002733,"domain_scores_codex":[0.9986555,0.00007943479,0.0004310822,0.0002210685,0.0003512786,0.0002616434],"domain_scores_gemma":[0.9981584,0.0001244286,0.00008676483,0.001279884,0.0002888724,0.00006166509],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002150035,0.002221113,0.00537462,0.0001346264,0.0003342087,0.0000130374,0.0005134732,0.04470398,0.009648622,0.7403501,0.1787591,0.0177321],"study_design_scores_gemma":[0.002290582,0.00007597394,0.005970951,0.000166704,0.00003117136,0.00001462097,0.00005311835,0.4030914,0.00379164,0.02553801,0.5581853,0.000790456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.007626986,0.00008829052,0.01344579,0.002348054,0.001790047,0.02265169,0.0003438223,0.001039526,0.9506658],"genre_scores_gemma":[0.9703097,0.00003397077,0.00160189,0.0001433961,0.000314675,0.02532536,0.0001730266,0.00003861276,0.002059364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9626827,"threshold_uncertainty_score":0.978078,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001787874,0.0001648718,0.0001757586,0.00009317185,0.0001899674,0.000064843,0.001030716,0.0001656604,0.00005379189],"category_scores_gemma":[0.00008275786,0.0001718915,0.00005976021,0.0001426558,0.0002003133,0.0001212724,0.000107846,0.000326715,0.00001697348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001548989,"about_ca_system_score_gemma":0.00002176265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004707055,"about_ca_topic_score_gemma":0.00008252387,"domain_scores_codex":[0.999017,0.00004765864,0.0003416,0.0001784695,0.0001143826,0.0003008695],"domain_scores_gemma":[0.9984407,0.0006464732,0.00006699361,0.0006269793,0.0001880498,0.00003078035],"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.000008827515,0.00003920061,0.00008669348,0.000001529798,0.00001891516,5.400208e-7,0.000003506907,0.6537395,0.000906305,0.3426714,0.0007868286,0.001736829],"study_design_scores_gemma":[0.0001794747,0.00003111138,0.0001142632,0.0000297672,0.000009040721,0.00000445513,0.00003590277,0.9616505,0.0003575596,0.03530068,0.002108484,0.0001787749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003565654,0.0001402905,0.9732997,0.0007856889,0.0004224527,0.0002687802,0.00002869225,0.0005118448,0.02097691],"genre_scores_gemma":[0.7910149,0.0001709216,0.2083031,0.00005386623,0.0001269126,0.00008757849,0.00006274443,0.00002282257,0.0001572297],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7874492,"threshold_uncertainty_score":0.7009532,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000153883,0.0002886122,0.0002647724,0.0003208813,0.0002587268,0.0001042558,0.003150777,0.0002151977,0.0002352247],"category_scores_gemma":[0.00002246902,0.0003145164,0.00009994279,0.0003333691,0.0002622149,0.0002115635,0.0001104373,0.0007256707,0.0004630712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002574474,"about_ca_system_score_gemma":0.00009603454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001903448,"about_ca_topic_score_gemma":0.0008142308,"domain_scores_codex":[0.9983749,0.0001006819,0.0006047464,0.0002692673,0.0003377911,0.0003126011],"domain_scores_gemma":[0.9969774,0.0002295377,0.0001162014,0.002245837,0.0003492246,0.0000818005],"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.00002486869,0.0002810415,0.0007830989,0.00002649636,0.0001227227,0.000003563984,0.00007204488,0.003928568,0.01521215,0.966996,0.007035919,0.005513588],"study_design_scores_gemma":[0.002920403,0.0001953245,0.01863446,0.0008813539,0.0001510633,0.0002013074,0.0009925284,0.7232039,0.01475325,0.02860937,0.2071057,0.002351386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.07333425,0.0006743871,0.02948242,0.006535525,0.0008755841,0.0005865463,0.0008213654,0.00309432,0.8845956],"genre_scores_gemma":[0.9927095,0.0006096752,0.004735981,0.0001276456,0.00006769591,0.0003198764,0.0006659497,0.00004471657,0.0007189957],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9383866,"threshold_uncertainty_score":0.9999307,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001152653,0.0001840512,0.0003005649,0.0004051743,0.00005662145,0.00009205988,0.000659749,0.0001142732,0.00004352476],"category_scores_gemma":[0.00001013118,0.0001932806,0.00007267688,0.0004044342,0.0001528139,0.000136893,0.00007594453,0.0003334828,0.000001812467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007882997,"about_ca_system_score_gemma":0.00001606096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003725612,"about_ca_topic_score_gemma":0.005774778,"domain_scores_codex":[0.9988931,0.00008376678,0.0004669205,0.0001765405,0.0001933223,0.0001863472],"domain_scores_gemma":[0.9987401,0.0002936349,0.0001117981,0.0006687755,0.0001468258,0.00003887869],"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.000008866388,0.000128697,0.01598958,0.000007475908,0.0002913808,0.000001684818,0.00007455592,0.8820468,0.001452553,0.09816182,0.00007190948,0.00176466],"study_design_scores_gemma":[0.0001972788,0.00001284105,0.06100247,0.0000775161,0.00006554989,9.602518e-7,0.0001024932,0.9374893,0.0001833217,0.000599565,0.0001023101,0.0001664366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9202675,0.0003128201,0.03024439,0.0003808446,0.0003641137,0.000161794,0.0001010119,0.0001919715,0.04797561],"genre_scores_gemma":[0.9978048,0.0008150067,0.0008521564,0.00001767566,0.00004263948,0.0000368079,0.0003149544,0.00002091369,0.00009503889],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09756225,"threshold_uncertainty_score":0.7881756,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002889227,0.0003159255,0.0003541179,0.0006321872,0.0001823454,0.0001908551,0.003418208,0.0001524235,0.0000339058],"category_scores_gemma":[0.00006754798,0.000360184,0.0000857337,0.0004017266,0.0001756981,0.0003318057,0.0001046741,0.0004925507,0.0001019635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006024907,"about_ca_system_score_gemma":0.00006453166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006708659,"about_ca_topic_score_gemma":0.01380517,"domain_scores_codex":[0.9981735,0.0001265504,0.0007205699,0.0003910253,0.000191746,0.000396658],"domain_scores_gemma":[0.9969411,0.0004276114,0.0001241872,0.002139881,0.0002735107,0.00009372996],"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.0001709155,0.0007658456,0.00534688,0.0001035952,0.0001763193,0.000008661188,0.001118471,0.04642751,0.3250962,0.610162,0.003236359,0.007387253],"study_design_scores_gemma":[0.00274466,0.000694379,0.003976095,0.002853752,0.00008633244,0.00009446991,0.002584784,0.8039415,0.1452071,0.01422367,0.02110074,0.002492453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3701683,0.0003974493,0.2276228,0.01699727,0.002101385,0.003748282,0.002344141,0.003758489,0.3728618],"genre_scores_gemma":[0.9937427,0.0001289172,0.004597228,0.0001400205,0.00005581661,0.0007345581,0.0003329995,0.00005240577,0.0002153312],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.757514,"threshold_uncertainty_score":0.999885,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001977276,0.00029469,0.0002771108,0.000288426,0.000236974,0.0001879875,0.002067526,0.0003032434,0.00008273165],"category_scores_gemma":[0.0001643561,0.000318272,0.0001359251,0.0002731827,0.0004318627,0.0002779834,0.00020953,0.000596112,0.0001311358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002487068,"about_ca_system_score_gemma":0.00004922657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003494678,"about_ca_topic_score_gemma":0.00005252738,"domain_scores_codex":[0.9983236,0.0000481146,0.0006173199,0.0003094508,0.0003378247,0.0003637113],"domain_scores_gemma":[0.9970654,0.0004215934,0.00009895856,0.001727054,0.000597975,0.00008906601],"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.00007353698,0.0005478297,0.0001600128,0.0000159096,0.0001505478,0.00000119909,0.00008764573,0.01183964,0.0662275,0.9031242,0.004188341,0.01358362],"study_design_scores_gemma":[0.001340582,0.0001344779,0.001312809,0.0001341088,0.00003014179,0.00001942234,0.0003062221,0.8908232,0.07515037,0.01774823,0.01226106,0.0007393098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6235238,0.0004318849,0.1611376,0.02593501,0.003573782,0.00225729,0.0006081808,0.004223525,0.1783089],"genre_scores_gemma":[0.9809947,0.0002782083,0.01715773,0.00004668222,0.0001092959,0.0005712812,0.0003869127,0.00006136187,0.0003938258],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.885376,"threshold_uncertainty_score":0.9999269,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001548348,0.0001779805,0.0002109531,0.0004499893,0.00006955839,0.00003057742,0.002520158,0.0001290697,0.0001882155],"category_scores_gemma":[0.00003698134,0.0001982231,0.00005666998,0.000376098,0.0002629479,0.0002090047,0.0001562766,0.0005126407,0.0001213311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001661683,"about_ca_system_score_gemma":0.00005302817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003785639,"about_ca_topic_score_gemma":0.001810621,"domain_scores_codex":[0.9988225,0.00006567768,0.0005599862,0.0001688717,0.0001840155,0.0001989989],"domain_scores_gemma":[0.997753,0.000189664,0.0001157336,0.001664491,0.0002499591,0.00002714879],"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.000185828,0.002407537,0.08169047,0.0001204029,0.0003030029,0.000005162533,0.001307306,0.0344439,0.1528005,0.6529981,0.01458127,0.05915649],"study_design_scores_gemma":[0.001669925,0.0002526411,0.05598073,0.0008946026,0.00003556167,0.00002875046,0.0004199167,0.8706054,0.02999569,0.0118426,0.02728661,0.0009875291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6673329,0.0002330934,0.001431206,0.002510671,0.0003433342,0.0002775137,0.00009995011,0.0003240164,0.3274473],"genre_scores_gemma":[0.9935804,0.00168001,0.003932332,0.0000435998,0.00001942152,0.0001417229,0.000106948,0.00002180038,0.0004737844],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8361616,"threshold_uncertainty_score":0.8083302,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009058387,0.0002119427,0.0001528935,0.0001779892,0.0002085867,0.000101241,0.000599531,0.00005852037,0.0001218626],"category_scores_gemma":[0.00001116643,0.0002293412,0.00005422798,0.0001424863,0.00008211417,0.0004135509,0.00004436748,0.0002052849,0.00002304257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002617326,"about_ca_system_score_gemma":0.0000439996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007200399,"about_ca_topic_score_gemma":0.0002784874,"domain_scores_codex":[0.9989257,0.00003183889,0.0003421869,0.0002152028,0.000262813,0.0002221941],"domain_scores_gemma":[0.9988039,0.0001280308,0.0001297534,0.0005606721,0.0003323767,0.00004531026],"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.00004506595,0.0000898601,0.00008498086,0.000008368022,0.00005974478,0.000001353557,0.0001255157,0.9706179,0.001091308,0.02329033,0.002784946,0.001800655],"study_design_scores_gemma":[0.0007179388,0.00006060448,0.0001855086,0.0001404944,0.00001665653,0.000009215061,0.0001426502,0.9923412,0.001956983,0.001790278,0.002345211,0.0002932475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03262115,0.0001165579,0.9311079,0.0006826188,0.0007737175,0.0006906089,0.0003148509,0.0003973932,0.03329524],"genre_scores_gemma":[0.9786019,0.0001429103,0.01901537,0.00007730004,0.0001493837,0.0003214883,0.001140921,0.00005776261,0.0004928994],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9459808,"threshold_uncertainty_score":0.9352261,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003946117,0.0001473519,0.0001728111,0.0002133812,0.0003191223,0.00005574073,0.001304307,0.00006867234,0.00001404361],"category_scores_gemma":[0.00007065316,0.0001435008,0.00005138916,0.0001781108,0.000194988,0.0002881796,0.0003466535,0.0002865983,0.000003275374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000107501,"about_ca_system_score_gemma":0.00002318783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001911829,"about_ca_topic_score_gemma":0.0004906447,"domain_scores_codex":[0.9990776,0.00007404903,0.0004159801,0.0001320169,0.0001419145,0.0001584746],"domain_scores_gemma":[0.9979566,0.0008600586,0.0001663223,0.0007752125,0.0002168464,0.0000249019],"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.00003980236,0.0002380888,0.001015854,0.00005493291,0.00008946284,4.40334e-7,0.002022227,0.1317142,0.006905835,0.8499551,0.0006178801,0.00734621],"study_design_scores_gemma":[0.0005237892,0.00002598105,0.001928609,0.0001242676,0.00001176928,0.000001192184,0.0005119924,0.9602452,0.003197371,0.03209284,0.001141896,0.0001951104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09149899,0.0004086428,0.8744885,0.004641333,0.0004293127,0.001576761,0.0006550661,0.0004824768,0.02581892],"genre_scores_gemma":[0.9918118,0.0005765583,0.006991465,0.00004986741,0.0000202587,0.0002482483,0.0001336754,0.00001914331,0.0001489633],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9003128,"threshold_uncertainty_score":0.5851792,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121223,0.0001150127,0.0001116381,0.0001014232,0.0001127776,0.00004262308,0.0004930322,0.00004427318,0.0000565881],"category_scores_gemma":[0.00005668757,0.0001015979,0.00002128046,0.00009665182,0.0001229564,0.00009343413,0.00003778333,0.0001829849,0.00001985816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006885569,"about_ca_system_score_gemma":0.00001271892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001267616,"about_ca_topic_score_gemma":0.0001405682,"domain_scores_codex":[0.9993175,0.00005418235,0.0002754785,0.000100802,0.0001509508,0.0001011457],"domain_scores_gemma":[0.9987264,0.0004142591,0.0001042218,0.0005182117,0.000214046,0.00002290984],"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.000004511594,0.00005400216,0.0001006639,0.00001079522,0.00003006994,2.411382e-7,0.0001767711,0.1434569,0.003052285,0.8502218,0.002516022,0.0003759563],"study_design_scores_gemma":[0.0003258704,0.00004553546,0.0006725633,0.0001878519,0.00001613607,0.000004815971,0.0001427722,0.9496642,0.004758937,0.04226856,0.001668039,0.0002447386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06370265,0.0001342552,0.7760717,0.002132766,0.0009885064,0.0005975417,0.001046746,0.000229139,0.1550967],"genre_scores_gemma":[0.9915454,0.0001687819,0.007770031,0.00003991391,0.00004385593,0.00003813274,0.00008397367,0.0000167491,0.0002931466],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9278428,"threshold_uncertainty_score":0.4143041,"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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0004996824,0.0001733623,0.000157766,0.0001167923,0.0003231204,0.0003221439,0.006031475,0.00006737852,0.00007154916],"category_scores_gemma":[0.00003024436,0.0001653213,0.00005429313,0.0002058717,0.000084391,0.0005585476,0.0004611052,0.000238799,0.00009957379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008695929,"about_ca_system_score_gemma":0.0001961882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009728616,"about_ca_topic_score_gemma":0.0002671552,"domain_scores_codex":[0.9984455,0.00007274673,0.0005017308,0.000400425,0.0002985409,0.0002810499],"domain_scores_gemma":[0.9967209,0.0002157889,0.0002880465,0.002285492,0.0004381877,0.00005161782],"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.0000982791,0.001475774,0.001242213,0.0000476831,0.0001397967,0.000002694955,0.0003603542,0.004630674,0.004443173,0.5948107,0.05108072,0.341668],"study_design_scores_gemma":[0.0003352446,0.0000875769,0.0003797426,0.00009824008,0.000005069776,0.000002947533,0.00001707286,0.931568,0.0003605052,0.001078669,0.06588008,0.0001868736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01228489,0.00005048812,0.9335986,0.01345327,0.0008271353,0.003355878,0.0002431084,0.0002989518,0.03588762],"genre_scores_gemma":[0.9454135,0.00008542007,0.04989851,0.0002724715,0.0001548018,0.001626482,0.0009407095,0.00001264641,0.001595424],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9331287,"threshold_uncertainty_score":0.9993464,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001360716,0.0002091069,0.0001840992,0.0002901394,0.0001433102,0.00009940433,0.0004942936,0.0001016857,0.00002861827],"category_scores_gemma":[0.00002053483,0.0002534417,0.00003774518,0.0002534513,0.0001205621,0.0003840195,0.0001002254,0.0003825879,0.00001027997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002198601,"about_ca_system_score_gemma":0.00004231702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008270777,"about_ca_topic_score_gemma":0.0003195198,"domain_scores_codex":[0.998863,0.00006122898,0.000389013,0.0002274679,0.0002115625,0.0002477624],"domain_scores_gemma":[0.9991112,0.0001476855,0.00009925983,0.0004078332,0.0001827274,0.00005125711],"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.00001340733,0.00005144835,0.0006170599,0.000004252729,0.00002101644,0.000002213426,0.0001032066,0.9600203,0.001740381,0.03638034,0.00003976273,0.001006598],"study_design_scores_gemma":[0.0003596649,0.00001662734,0.000786753,0.0001884558,0.000007558412,0.000008347291,0.0001399703,0.9962224,0.0004353914,0.001393025,0.0001980566,0.0002437865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5843911,0.0004871706,0.3977275,0.0005833091,0.0006197199,0.0003700121,0.0001186806,0.0002654963,0.01543703],"genre_scores_gemma":[0.9309621,0.0004395538,0.0681386,0.00003140197,0.0001300191,0.00004617849,0.0001435909,0.00003629267,0.00007223566],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.346571,"threshold_uncertainty_score":0.9999918,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}