{"meta":{"query_hash":"503c54ed4fb0","filters":{"venue":"2006 IEEE International Conference on Communications"},"cohort_total":107,"direct_labels_cover":0,"predictions_cover":107,"exported":107,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/503c54ed4fb0","api":"https://metacan.xera.ac/api/v1/cohort?venue=2006+IEEE+International+Conference+on+Communications"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02831310386250166,"score_gpt":0.2732424491771529,"score_spread":0.24492934531465124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981954312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062093094,0.000500315,0.93008244,0.0011016574,0.0007243308,0.0007274305,0.000080081074,0.00024365532,0.004446993],"genre_scores_gemma":[0.99414015,0.0016073942,0.002984847,0.000114442955,0.00021359327,0.00025782397,0.0005061352,0.00004177815,0.00013386272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878025,0.000066049346,0.0004980411,0.0002523204,0.00017036895,0.00023299111],"domain_scores_gemma":[0.99884236,0.00022638886,0.00015716141,0.000436921,0.00027671797,0.0000604271],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019732137,0.00021904355,0.00022466393,0.00023288695,0.0001852295,0.000118751355,0.00038655012,0.00014921099,0.000022372771],"category_scores_gemma":[0.000012688976,0.00024550388,0.000046988487,0.00018758843,0.000064454325,0.00034695605,0.000025962292,0.0002605421,0.000004377219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060739687,0.00009133159,0.00076305616,0.000028205784,0.000030507623,3.1230164e-7,0.00006263853,0.9606315,0.0052534747,0.025585506,0.00028405807,0.007208677],"study_design_scores_gemma":[0.0012158093,0.000033502754,0.0015811928,0.00026518805,0.000015699467,0.0000033369377,0.00007203608,0.9920203,0.0013669349,0.0023830584,0.0008045358,0.00023841305],"about_ca_topic_score_codex":0.00018451971,"about_ca_topic_score_gemma":0.0015016317,"teacher_disagreement_score":0.932047,"about_ca_system_score_codex":0.00024275742,"about_ca_system_score_gemma":0.000028584214,"threshold_uncertainty_score":0.9999997},"labels":[],"label_agreement":null},{"id":"W1994473001","doi":"10.1109/icc.2006.255392","title":"Effects of Code Design on the Spectral Characteristics of MCSK Based Impulse Radios","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Inha University","keywords":"Computer science; Code rate; Code (set theory); Time-hopping; Impulse radio; Constant-weight code; Spectral efficiency; Electronic engineering; Spectral density; Telecommunications; Set (abstract data type); Ultra-wideband; Concatenated error correction code; Decoding methods; Engineering; Block code","score_opus":0.0395612661209778,"score_gpt":0.26830498880481146,"score_spread":0.22874372268383367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994473001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5300155,0.00067286746,0.27605116,0.022886211,0.0012965198,0.0027928518,0.0012268701,0.0011239239,0.16393407],"genre_scores_gemma":[0.99396473,0.00031532496,0.0052810814,0.00008336945,0.000023377912,0.00013533734,0.00007615892,0.00002237763,0.00009822811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989456,0.00015100453,0.000442128,0.00011093667,0.00020900395,0.00014133997],"domain_scores_gemma":[0.99659085,0.0014034553,0.0001745515,0.0015841175,0.00022498862,0.000022028587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017335707,0.0001566752,0.00020252557,0.0002086616,0.000088395966,0.00002197776,0.0021238169,0.00009291807,0.00007152299],"category_scores_gemma":[0.0001177791,0.00013815388,0.00008108404,0.00020265435,0.00028500694,0.00005056329,0.000054073775,0.00036454923,0.000030111043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007434103,0.0011356288,0.0007641829,0.000053130436,0.00020225675,0.0000017666292,0.00014518086,0.011576354,0.21689889,0.7580629,0.0055584083,0.0055269715],"study_design_scores_gemma":[0.0011239632,0.00030444018,0.019848194,0.00045837587,0.000087873625,0.0000068949967,0.00007014084,0.43791008,0.5209121,0.01383635,0.004956849,0.00048472348],"about_ca_topic_score_codex":0.00006704643,"about_ca_topic_score_gemma":0.00005723225,"teacher_disagreement_score":0.7442265,"about_ca_system_score_codex":0.00008656258,"about_ca_system_score_gemma":0.000058728685,"threshold_uncertainty_score":0.5633752},"labels":[],"label_agreement":null},{"id":"W2005571301","doi":"10.1109/icc.2006.255313","title":"Performance Bounds for Combined Channel Coding and Space-Time Block Coding with Receive Antenna Selection","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Upper and lower bounds; Algorithm; Block code; Concatenation (mathematics); Fading; Computer science; Coding gain; Space–time block code; Convolutional code; Concatenated error correction code; Antenna (radio); Space–time code; Mathematics; Topology (electrical circuits); Telecommunications; Decoding methods; Combinatorics","score_opus":0.03586838227740779,"score_gpt":0.2800951122051082,"score_spread":0.2442267299277004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005571301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36028484,0.0004574286,0.45437402,0.012924417,0.00071069016,0.00338668,0.00058078126,0.0044017327,0.16287942],"genre_scores_gemma":[0.97999644,0.001522333,0.016911462,0.000045553003,0.00005140321,0.0003503707,0.00019580692,0.000044642486,0.0008819756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906945,0.000038955062,0.00030734416,0.00019715102,0.00017649453,0.00021059086],"domain_scores_gemma":[0.9985194,0.0002198218,0.00013416698,0.0006360856,0.00044488892,0.000045610384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015130991,0.00021196478,0.0001941458,0.00023029883,0.00037641783,0.00011844795,0.0007301467,0.00008523071,0.00001732138],"category_scores_gemma":[0.000021433356,0.00022500957,0.000035316054,0.00019517347,0.00017078129,0.00033821104,0.00007542066,0.00029358378,0.000013361274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007244713,0.0010647204,0.0046209493,0.00029561715,0.0006441925,0.0000020703776,0.0012094534,0.07270783,0.36769602,0.5239616,0.013795979,0.0132770855],"study_design_scores_gemma":[0.0005896615,0.00015557691,0.0010304616,0.0002666992,0.000017762524,0.000014221221,0.00006252954,0.98181784,0.011258741,0.0018136455,0.002655672,0.00031718018],"about_ca_topic_score_codex":0.000042593532,"about_ca_topic_score_gemma":0.000132802,"teacher_disagreement_score":0.90911,"about_ca_system_score_codex":0.000184652,"about_ca_system_score_gemma":0.000034618944,"threshold_uncertainty_score":0.9175624},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10652346147587384,"score_gpt":0.33962664186713787,"score_spread":0.23310318039126404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022961962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001991965,0.0007627773,0.9763266,0.0067981626,0.00015110672,0.00022820031,0.0001243868,0.000098215954,0.013518624],"genre_scores_gemma":[0.9197085,0.000890035,0.07783989,0.00028130252,0.00007135144,0.000045767058,0.0010405064,0.000008540494,0.00011413119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980028,0.00030939077,0.00066746265,0.00041306223,0.00036960442,0.00023763656],"domain_scores_gemma":[0.9951446,0.00037601055,0.00032846452,0.0036384636,0.00044545677,0.00006697937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077551906,0.00018047552,0.0003181999,0.00023869159,0.00032354105,0.00021701613,0.005222762,0.00006985653,0.000057697194],"category_scores_gemma":[0.000014687149,0.0001862172,0.000081550235,0.0007106797,0.00017200901,0.00047994,0.0011804297,0.00025873087,0.000008892908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010840189,0.000129499,0.00051058695,0.0000011896179,0.00029374118,4.2819718e-7,0.00006525724,0.3007935,0.000010795531,0.6769958,0.0014155502,0.01977281],"study_design_scores_gemma":[0.0003475624,0.000021306954,0.00073532294,0.00004986146,0.00012376145,0.0000017855739,0.00005139435,0.9883736,7.515083e-7,0.0068596234,0.003266083,0.00016896713],"about_ca_topic_score_codex":0.000597304,"about_ca_topic_score_gemma":0.0028358647,"teacher_disagreement_score":0.9177165,"about_ca_system_score_codex":0.000057708763,"about_ca_system_score_gemma":0.00008077236,"threshold_uncertainty_score":0.97052777},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04288510017301155,"score_gpt":0.27835154067061973,"score_spread":0.23546644049760818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023285516","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073334254,0.00067438715,0.02948242,0.0065355245,0.00087558414,0.0005865463,0.0008213654,0.0030943197,0.8845956],"genre_scores_gemma":[0.99270946,0.00060967525,0.0047359806,0.00012764562,0.00006769591,0.0003198764,0.00066594966,0.000044716566,0.0007189957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837494,0.00010068189,0.0006047464,0.00026926727,0.0003377911,0.0003126011],"domain_scores_gemma":[0.9969774,0.00022953768,0.000116201394,0.002245837,0.00034922457,0.0000818005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015388298,0.00028861218,0.00026477236,0.00032088129,0.00025872682,0.00010425583,0.0031507774,0.00021519767,0.00023522472],"category_scores_gemma":[0.000022469016,0.0003145164,0.00009994279,0.0003333691,0.00026221492,0.0002115635,0.0001104373,0.00072567066,0.00046307116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024868694,0.0002810415,0.0007830989,0.000026496356,0.00012272272,0.0000035639841,0.00007204488,0.0039285677,0.015212155,0.96699595,0.0070359195,0.0055135884],"study_design_scores_gemma":[0.0029204031,0.00019532451,0.018634455,0.0008813539,0.00015106332,0.00020130737,0.0009925284,0.7232039,0.0147532495,0.028609369,0.20710565,0.0023513865],"about_ca_topic_score_codex":0.00019034483,"about_ca_topic_score_gemma":0.0008142308,"teacher_disagreement_score":0.93838656,"about_ca_system_score_codex":0.0002574474,"about_ca_system_score_gemma":0.00009603454,"threshold_uncertainty_score":0.9999307},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.054135531952232425,"score_gpt":0.2966745473276717,"score_spread":0.24253901537543926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077340013","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03425326,0.0006467197,0.24231151,0.003147288,0.001442281,0.0019011436,0.0015213699,0.0038950099,0.7108814],"genre_scores_gemma":[0.98615474,0.00053684,0.011224548,0.000029613886,0.00007081726,0.00025444236,0.00050068303,0.00004005865,0.0011882625],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875945,0.00009195977,0.0005536916,0.00018412065,0.00023528634,0.00017550286],"domain_scores_gemma":[0.9975859,0.00018893159,0.0001976334,0.0013711816,0.00061445084,0.000041883577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014744572,0.00020392604,0.00021810019,0.00028636708,0.00012759265,0.000044760916,0.0014770721,0.00009812584,0.000119655575],"category_scores_gemma":[0.000036629946,0.00022980913,0.00007368204,0.0002933805,0.00018871755,0.00026308117,0.00011644155,0.00036590797,0.000050546325],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007203848,0.0009820254,0.00019427623,0.000027043121,0.0002042173,5.402995e-7,0.00015281436,0.011865193,0.7820174,0.18230726,0.009759722,0.012417488],"study_design_scores_gemma":[0.0008811002,0.000270444,0.0027920366,0.00022940636,0.00003307638,0.000008615898,0.000042418236,0.7584636,0.21023971,0.013063464,0.013519814,0.0004563173],"about_ca_topic_score_codex":0.00014146087,"about_ca_topic_score_gemma":0.00010426944,"teacher_disagreement_score":0.9519015,"about_ca_system_score_codex":0.00022835289,"about_ca_system_score_gemma":0.00004965147,"threshold_uncertainty_score":0.93713444},"labels":[],"label_agreement":null},{"id":"W2086270857","doi":"10.1109/icc.2006.255558","title":"Performance Analysis of Space-Time Diversity in Multiuser CDMA Systems over Fading Channels","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Rayleigh fading; Fading; Computer science; Probability density function; Diversity scheme; Multiuser detection; Code division multiple access; Algorithm; Antenna diversity; Time diversity; Spread spectrum; Block code; Mathematics; Telecommunications; Statistics; Decoding methods; Wireless","score_opus":0.06112467063690417,"score_gpt":0.30439045766845946,"score_spread":0.2432657870315553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086270857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91770107,0.00017838729,0.013015432,0.00031510775,0.00025874944,0.00036106183,0.00022547778,0.00040621948,0.06753853],"genre_scores_gemma":[0.9965699,0.0007714429,0.0019679214,0.000011641135,0.000018790997,0.0000646716,0.0001919683,0.000017214317,0.0003864863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989127,0.000074629505,0.00043822185,0.00015019979,0.00026685867,0.00015742121],"domain_scores_gemma":[0.9982202,0.00018005734,0.00015743141,0.0011772977,0.00023524735,0.000029788147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018731304,0.00015730616,0.00028132368,0.0008153887,0.00012211026,0.000036819798,0.0015335378,0.00008719305,0.000092410075],"category_scores_gemma":[0.000016279342,0.00018312628,0.00008662324,0.0006787087,0.0001101345,0.00029715573,0.0003128119,0.00026468097,0.000027411104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014189562,0.0002247087,0.045490257,0.000020935522,0.00030013671,6.563149e-7,0.00035858413,0.90440977,0.009572654,0.038282674,0.00051206985,0.0008133638],"study_design_scores_gemma":[0.00018732809,0.000011219141,0.03191565,0.0001078091,0.000041292067,4.2326317e-7,0.000042980326,0.96480185,0.001893589,0.00019935425,0.00062099565,0.00017750252],"about_ca_topic_score_codex":0.0010199908,"about_ca_topic_score_gemma":0.00046411037,"teacher_disagreement_score":0.07886883,"about_ca_system_score_codex":0.0002431521,"about_ca_system_score_gemma":0.000015932203,"threshold_uncertainty_score":0.74676734},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03646006721821619,"score_gpt":0.29306071014194784,"score_spread":0.25660064292373164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095627734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006613589,0.000119568984,0.9515143,0.0012505549,0.0007170444,0.00063805614,0.000116123316,0.00048320484,0.044499792],"genre_scores_gemma":[0.90886885,0.0005373034,0.087294504,0.0002847605,0.0003780625,0.000672852,0.00096375466,0.000090357884,0.00090954144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983663,0.000074835945,0.0005349841,0.0003224553,0.00033013747,0.00037129846],"domain_scores_gemma":[0.9976915,0.0004738259,0.00017319513,0.0013195225,0.00026492623,0.000077046985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018020268,0.00030963073,0.00025210378,0.00023604045,0.0002667915,0.00014321071,0.0014759044,0.00019225886,0.000087956105],"category_scores_gemma":[0.000015041035,0.00036521239,0.00012953026,0.0003279838,0.00013727779,0.00017090212,0.00006453499,0.00045135958,0.00003332745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031670825,0.00010613729,0.00005104341,0.000014609366,0.00006326366,8.804199e-7,0.00001610943,0.66686404,0.000044756594,0.3172211,0.010683556,0.0049028215],"study_design_scores_gemma":[0.0006064614,0.000029508117,0.00012399278,0.00026545997,0.00003385768,0.00000159963,0.000049355465,0.9693298,0.00028184848,0.009616059,0.019296648,0.00036543966],"about_ca_topic_score_codex":0.00002648808,"about_ca_topic_score_gemma":0.00014269301,"teacher_disagreement_score":0.90820754,"about_ca_system_score_codex":0.00039842643,"about_ca_system_score_gemma":0.000030209132,"threshold_uncertainty_score":0.99987996},"labels":[],"label_agreement":null},{"id":"W2096331657","doi":"10.1109/icc.2006.255765","title":"Non-Cooperative Transmission Game in Wireless Networks with Multipacket Reception and Packet Priority","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Network packet; Computer science; Transmission (telecommunications); Computer network; Nash equilibrium; Telecommunications link; Channel (broadcasting); Wireless sensor network; Wireless; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.042724750071956454,"score_gpt":0.3146773586526888,"score_spread":0.27195260858073234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096331657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07475792,0.00008022763,0.89240414,0.009220452,0.00021595595,0.002925256,0.0000274988,0.00014885185,0.020219706],"genre_scores_gemma":[0.9873539,0.00041548448,0.010931048,0.00016077279,0.00007236001,0.00075524545,0.00007194512,0.000011571044,0.0002276532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864924,0.0001660568,0.00033385426,0.0003603803,0.00026907396,0.00022136567],"domain_scores_gemma":[0.99856097,0.00015718088,0.0001456,0.00079059735,0.00027662015,0.00006901138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028142775,0.00019419583,0.0001935466,0.00013908763,0.00016577078,0.0002822219,0.001287853,0.00011324188,0.00002796195],"category_scores_gemma":[0.0000046512796,0.00016833308,0.000031639316,0.00030523687,0.00015926041,0.0004936912,0.00013625128,0.00044485123,0.0000108890845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040301497,0.001881792,0.02490562,0.000027860602,0.00008109847,0.00002353632,0.0020562992,0.039173175,0.003888122,0.69068044,0.003292482,0.23358658],"study_design_scores_gemma":[0.0009845387,0.0001373315,0.023629727,0.00031708495,0.0000033896936,0.000008537789,0.00003450567,0.9695948,0.00037928892,0.002367757,0.002277604,0.0002654404],"about_ca_topic_score_codex":0.00053850334,"about_ca_topic_score_gemma":0.0015187692,"teacher_disagreement_score":0.9304216,"about_ca_system_score_codex":0.0000871344,"about_ca_system_score_gemma":0.0000984499,"threshold_uncertainty_score":0.6864424},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.047238283104204734,"score_gpt":0.29622156808816286,"score_spread":0.2489832849839581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096902129","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005950333,0.00019193192,0.42088065,0.006696266,0.00065033184,0.0012062935,0.0009894291,0.00050804904,0.5629267],"genre_scores_gemma":[0.96800226,0.00027461143,0.025542172,0.00011988436,0.00007250078,0.0005374354,0.0017095696,0.00003842459,0.0037031434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990234,0.000021339923,0.00037449852,0.00020059342,0.0001781179,0.00020209773],"domain_scores_gemma":[0.9983577,0.0000974278,0.000060736576,0.001195238,0.00022865522,0.0000602072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008138346,0.0001873836,0.00014454407,0.00026256678,0.0001496342,0.00021092432,0.0013828248,0.00005979395,0.000031484884],"category_scores_gemma":[0.000016722599,0.0002055511,0.0000825011,0.00021789553,0.000062479725,0.00020293966,0.00013388744,0.00014436712,0.00010329894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006715526,0.0013258487,0.00026669336,0.00005809974,0.0002876549,9.2972175e-7,0.00029641885,0.09047008,0.00095809164,0.8466326,0.049945883,0.009690543],"study_design_scores_gemma":[0.0006457051,0.0000403316,0.0016672618,0.00007613774,0.000030201727,0.000004469361,0.00014015197,0.8638906,0.0002727041,0.00829572,0.124527805,0.00040889828],"about_ca_topic_score_codex":0.000022477774,"about_ca_topic_score_gemma":0.00013104996,"teacher_disagreement_score":0.9620519,"about_ca_system_score_codex":0.0001734843,"about_ca_system_score_gemma":0.000022974917,"threshold_uncertainty_score":0.838213},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08893171150074693,"score_gpt":0.3039965116319894,"score_spread":0.21506480013124246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098319539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03627699,0.000074002,0.6354275,0.0009903425,0.0012351872,0.00034330925,0.00020991871,0.00037640278,0.32506636],"genre_scores_gemma":[0.9934934,0.00008888848,0.005761866,0.000022420802,0.00009183786,0.000037207195,0.000100446334,0.00002474513,0.00037922646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990722,0.000027084994,0.00041430022,0.00015323806,0.00017267212,0.00016050637],"domain_scores_gemma":[0.99888104,0.0000846906,0.0001274122,0.0006791722,0.0001934236,0.000034267618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011365586,0.00014719191,0.00016287254,0.00019372354,0.00008486135,0.000047817528,0.00081555964,0.00007301697,0.00018855989],"category_scores_gemma":[0.000018008779,0.00017194562,0.000053920772,0.00014970145,0.00017959472,0.00021063896,0.000060955437,0.00021387804,0.000052827654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029172638,0.000062591025,0.00034898942,0.000012499383,0.000042358963,3.788212e-7,0.00010648592,0.56345195,0.013749581,0.42167896,0.00023378318,0.00030953137],"study_design_scores_gemma":[0.0005164837,0.00002435637,0.0007875631,0.000303372,0.00001598206,0.000015506434,0.00019358275,0.93833315,0.021979075,0.03684416,0.0006089677,0.0003777771],"about_ca_topic_score_codex":0.00016112917,"about_ca_topic_score_gemma":0.0002046614,"teacher_disagreement_score":0.9572164,"about_ca_system_score_codex":0.00017355723,"about_ca_system_score_gemma":0.000022215201,"threshold_uncertainty_score":0.70117384},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.15309166270881466,"score_gpt":0.34464931025010503,"score_spread":0.19155764754129037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098609188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035656537,0.0001402905,0.9732997,0.00078568887,0.00042245272,0.00026878025,0.000028692251,0.00051184476,0.020976912],"genre_scores_gemma":[0.79101485,0.00017092157,0.20830311,0.000053866228,0.00012691256,0.00008757849,0.00006274443,0.000022822573,0.0001572297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999017,0.00004765864,0.00034160004,0.00017846948,0.000114382594,0.00030086952],"domain_scores_gemma":[0.99844074,0.0006464732,0.000066993605,0.00062697934,0.00018804982,0.00003078035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017878736,0.0001648718,0.00017575864,0.00009317185,0.0001899674,0.000064843,0.0010307162,0.00016566044,0.00005379189],"category_scores_gemma":[0.000082757855,0.00017189152,0.000059760212,0.00014265579,0.00020031333,0.000121272446,0.00010784597,0.00032671503,0.000016973483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008827515,0.000039200615,0.00008669348,0.0000015297976,0.000018915163,5.400208e-7,0.0000035069072,0.65373945,0.000906305,0.34267136,0.00078682863,0.0017368289],"study_design_scores_gemma":[0.00017947468,0.000031111384,0.000114263166,0.000029767198,0.000009040721,0.00000445513,0.000035902773,0.9616505,0.00035755956,0.035300676,0.0021084843,0.00017877488],"about_ca_topic_score_codex":0.000047070553,"about_ca_topic_score_gemma":0.000082523875,"teacher_disagreement_score":0.7874492,"about_ca_system_score_codex":0.00015489892,"about_ca_system_score_gemma":0.000021762648,"threshold_uncertainty_score":0.70095325},"labels":[],"label_agreement":null},{"id":"W2098833650","doi":"10.1109/icc.2006.255032","title":"Snapshot Capacity of Multi Hop 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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Snapshot (computer storage); Computer science; Wireless ad hoc network; Hop (telecommunications); Computer network; Distributed computing; Algorithm; Wireless; Telecommunications","score_opus":0.09865646480188171,"score_gpt":0.31940572436053377,"score_spread":0.22074925955865204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098833650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0120328115,0.0008547652,0.8838421,0.006010519,0.00147805,0.00050880987,0.00010338393,0.0002390719,0.09493046],"genre_scores_gemma":[0.94617146,0.00068505434,0.051912036,0.0002625608,0.00009109235,0.00008722448,0.00013314902,0.000012712422,0.00064467697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825174,0.00017980555,0.00054617506,0.00034859902,0.00040941755,0.00026429558],"domain_scores_gemma":[0.9962902,0.0002942205,0.00034728055,0.0023581393,0.00063680817,0.00007332155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030022307,0.00020129014,0.00022029124,0.00016530056,0.00017515224,0.00014962124,0.004775601,0.00012336734,0.00017493228],"category_scores_gemma":[0.000035652498,0.00021051282,0.000118339856,0.00034295392,0.00027274157,0.00037069403,0.00047211722,0.00044084017,0.000058734247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016419091,0.00089332974,0.0008494073,0.000005081439,0.00006715464,0.0000026132,0.00020913238,0.018619863,0.0016702662,0.94557613,0.011082502,0.021008104],"study_design_scores_gemma":[0.00048029993,0.000064918,0.003865499,0.00008259949,0.0000084471985,0.000008404912,0.000021427573,0.9729012,0.0006456072,0.0062243952,0.015430926,0.00026623774],"about_ca_topic_score_codex":0.0002298021,"about_ca_topic_score_gemma":0.0010965433,"teacher_disagreement_score":0.9542814,"about_ca_system_score_codex":0.00010548579,"about_ca_system_score_gemma":0.00009670181,"threshold_uncertainty_score":0.88743347},"labels":[],"label_agreement":null},{"id":"W2099116406","doi":"10.1109/icc.2006.254877","title":"Equal Opportunity Fairness in Resilient Packet Rings","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Stateful firewall; Computer science; Bandwidth (computing); Network packet; Reuse; Fairness measure; Bandwidth allocation; Degradation (telecommunications); Computer network; Throughput; Scheme (mathematics); Ring (chemistry); Distributed computing; Mathematics; Telecommunications; Wireless; Engineering","score_opus":0.09110053322300368,"score_gpt":0.32663139765940646,"score_spread":0.23553086443640278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099116406","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029186709,0.00014553305,0.41224203,0.05061741,0.001503713,0.0005472029,0.00007780866,0.0005017056,0.5051779],"genre_scores_gemma":[0.9938082,0.00008596228,0.0033705924,0.00061549176,0.00009449226,0.00009934464,0.0000631476,0.000008639072,0.0018541088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983745,0.00019341489,0.00044743076,0.0003321076,0.00039921285,0.00025333485],"domain_scores_gemma":[0.9977739,0.00025059326,0.00016863587,0.0013909001,0.00031990814,0.000096091186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038199325,0.00016765934,0.00016414214,0.00023930908,0.00016429425,0.00022480522,0.0031639205,0.00007921122,0.00012518057],"category_scores_gemma":[0.000051144296,0.00017552059,0.0000652604,0.00030422505,0.00013237877,0.00038543195,0.00028775522,0.00037232297,0.00016677262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010969151,0.0003106653,0.0010091878,0.0000012685634,0.000009404291,0.0000060120688,0.000069474976,0.0009770874,0.00013827751,0.9621553,0.0038586117,0.03145374],"study_design_scores_gemma":[0.0014985014,0.00010079183,0.016244782,0.00016360127,0.00000905184,0.000018331548,0.0001473698,0.8554545,0.0002602595,0.08866924,0.03683226,0.0006013128],"about_ca_topic_score_codex":0.00044170028,"about_ca_topic_score_gemma":0.0012366894,"teacher_disagreement_score":0.9646215,"about_ca_system_score_codex":0.00013859608,"about_ca_system_score_gemma":0.0002218975,"threshold_uncertainty_score":0.7157522},"labels":[],"label_agreement":null},{"id":"W2099615353","doi":"10.1109/icc.2006.255256","title":"Uncoordinated Distributed Space-Time Trellis Coding","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Trellis (graph); Computer science; Space–time code; Space–time trellis code; Node (physics); Coding (social sciences); Block code; Linear network coding; Algorithm; Space–time block code; Wireless; Decoding methods; Theoretical computer science; Topology (electrical circuits); Mathematics; Computer network; Telecommunications; Combinatorics; Engineering; Network packet; Concatenated error correction code","score_opus":0.08132225189048607,"score_gpt":0.3244198392259747,"score_spread":0.24309758733548864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099615353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030557343,0.0003221778,0.5088787,0.070540085,0.00080784777,0.0004683244,0.00022051453,0.00087924016,0.41482738],"genre_scores_gemma":[0.9828435,0.00091266684,0.010284207,0.0003804235,0.0000904417,0.00007241942,0.0005079806,0.000016050457,0.004892317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822444,0.00028780467,0.00046429556,0.00036915037,0.00037579593,0.00027852957],"domain_scores_gemma":[0.99623847,0.00034024514,0.00023274946,0.0023735447,0.0007276476,0.00008732098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031934847,0.00023435673,0.0002137425,0.0002473819,0.0005464438,0.00048470154,0.004923627,0.00008766356,0.00033247803],"category_scores_gemma":[0.000072486626,0.00024250601,0.0001067787,0.0006639483,0.0001745256,0.00050081045,0.0006795289,0.00040576822,0.00068260723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006777771,0.0002664914,0.00018913987,0.0000012960828,0.000032209657,0.0000021173664,0.00007332945,0.0005383235,0.0061611757,0.96280223,0.023263255,0.006663629],"study_design_scores_gemma":[0.0007600989,0.00006665684,0.0025225866,0.00013717785,0.000012969383,0.000013739199,0.00003365426,0.84459776,0.0025680861,0.013669186,0.13507603,0.00054203096],"about_ca_topic_score_codex":0.00010614196,"about_ca_topic_score_gemma":0.00021733569,"teacher_disagreement_score":0.97978777,"about_ca_system_score_codex":0.00021758326,"about_ca_system_score_gemma":0.00012379463,"threshold_uncertainty_score":0.9889108},"labels":[],"label_agreement":null},{"id":"W2099784141","doi":"10.1109/icc.2006.255377","title":"Trellis Shaping for PAR Reduction in OFDM Systems","year":2006,"lang":"fr","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Trellis (graph); Orthogonal frequency-division multiplexing; Decoding methods; Computer science; Reduction (mathematics); Space–time trellis code; Metric (unit); Algorithm; Multiplexing; Frequency domain; Theoretical computer science; Electronic engineering; Mathematics; Telecommunications; Channel (broadcasting); Block code; Engineering; Concatenated error correction code","score_opus":0.15869783456136582,"score_gpt":0.3523572342273642,"score_spread":0.19365939966599838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099784141","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047863733,0.018113853,0.08053155,0.09575121,0.04919208,0.0037857273,0.0029441353,0.00092006574,0.70089763],"genre_scores_gemma":[0.969054,0.0025944174,0.007371973,0.000031827654,0.0011701186,0.0007066315,0.00049154286,0.000066273155,0.018513242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792415,0.00016019763,0.0008714123,0.00034829616,0.00031370172,0.00038224962],"domain_scores_gemma":[0.99788743,0.00024508225,0.00023240289,0.0010826507,0.0004798842,0.00007252421],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037201296,0.0002983972,0.00029211913,0.000490426,0.00021222858,0.00024343721,0.0012370116,0.00025565864,0.00023030028],"category_scores_gemma":[0.00006288318,0.00039353507,0.00013929191,0.00033090665,0.00025338124,0.00043085398,0.000070279,0.00054604857,0.00029678227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032272896,0.00050176,0.00027337493,0.000097938384,0.00010781256,0.0000016847297,0.00031109055,0.19932383,0.009124468,0.74341136,0.0416178,0.0051965774],"study_design_scores_gemma":[0.0011366508,0.000073590556,0.0013123741,0.0011891947,0.00005362375,0.00006337464,0.00075106975,0.7077864,0.0023180891,0.015632812,0.26904854,0.0006342952],"about_ca_topic_score_codex":0.0041245786,"about_ca_topic_score_gemma":0.00081743475,"teacher_disagreement_score":0.92119026,"about_ca_system_score_codex":0.00095263845,"about_ca_system_score_gemma":0.00013795983,"threshold_uncertainty_score":0.99985164},"labels":[],"label_agreement":null},{"id":"W2100102129","doi":"10.1109/icc.2006.255651","title":"Connection Data Rate Optimization of IEEE 802.15.3 Scatternets with Multi-rate Carriers","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Bluetooth and Wireless Communication Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Piconet; Computer science; Computer network; Scatternet; RADIUS; Bluetooth; Wireless; Telecommunications","score_opus":0.11734350393291272,"score_gpt":0.3271071344956604,"score_spread":0.20976363056274772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100102129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006923035,0.00012884059,0.9671872,0.011596136,0.00046037653,0.00039579745,0.00024217696,0.00048191615,0.012584514],"genre_scores_gemma":[0.90588665,0.00054451916,0.09224682,0.00024433417,0.00002921851,0.000077114135,0.0005574234,0.000017798626,0.00039612738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981127,0.00028846457,0.0005592819,0.00048274265,0.00032456082,0.00023224534],"domain_scores_gemma":[0.9931763,0.00029709053,0.0005528067,0.005091518,0.0008242391,0.00005804323],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0004909695,0.00023525931,0.00023828822,0.00036723097,0.0002795279,0.00024297612,0.008293661,0.00013017804,0.00003860866],"category_scores_gemma":[0.00009029193,0.00022349978,0.000048944956,0.00052671536,0.00042448624,0.0009997026,0.0007458812,0.00036542484,0.000037979335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105530824,0.001507576,0.004933011,0.00003499009,0.00027043012,0.0000047471435,0.0003319764,0.17681009,0.009654715,0.781375,0.009507154,0.015464762],"study_design_scores_gemma":[0.00079457695,0.000092321476,0.0027873009,0.00011920913,0.000017913564,0.000006997858,0.00012004543,0.9836127,0.0075908066,0.0016344589,0.002903524,0.00032013704],"about_ca_topic_score_codex":0.00095013424,"about_ca_topic_score_gemma":0.0013149999,"teacher_disagreement_score":0.89896363,"about_ca_system_score_codex":0.0000897689,"about_ca_system_score_gemma":0.00025724768,"threshold_uncertainty_score":0.9970719},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0464256695655952,"score_gpt":0.29099007287665263,"score_spread":0.24456440331105744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100266001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6588564,0.00090742914,0.014433513,0.002504158,0.0009088574,0.00040634198,0.00012104378,0.0011120804,0.32075018],"genre_scores_gemma":[0.9806692,0.00049969833,0.01847948,0.000014776873,0.000037815797,0.00004931168,0.000044444805,0.000017562661,0.00018769238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999113,0.000023454366,0.00038041142,0.00013549604,0.00017758875,0.0001700004],"domain_scores_gemma":[0.9990139,0.0002601319,0.00006830083,0.00050421926,0.00013218114,0.000021290114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010353426,0.00013008132,0.00015594508,0.00047309202,0.000047973903,0.00002309467,0.0008849636,0.0000912947,0.00005042559],"category_scores_gemma":[0.00005644839,0.00014734839,0.00004725214,0.000533827,0.00015550878,0.00013838001,0.000075635384,0.00035464714,0.000030065197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010085014,0.00020961593,0.0011168373,0.000010131406,0.000028419743,0.0000015728504,0.000027854456,0.32779136,0.0023001223,0.64954156,0.000702101,0.018260323],"study_design_scores_gemma":[0.0005202635,0.000043008276,0.009788964,0.0001831585,0.000009283825,0.000007117561,0.00011782577,0.9526604,0.0018637478,0.029193236,0.0052819066,0.0003311142],"about_ca_topic_score_codex":0.000077486686,"about_ca_topic_score_gemma":0.0005281146,"teacher_disagreement_score":0.624869,"about_ca_system_score_codex":0.00017122584,"about_ca_system_score_gemma":0.000021567348,"threshold_uncertainty_score":0.6008693},"labels":[],"label_agreement":null},{"id":"W2100438466","doi":"10.1109/icc.2006.255020","title":"Equalization for 4BOK DS-UWB Systems","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"MIMO; Equalization (audio); Computer science; Intersymbol interference; Electronic engineering; Ultra-wideband; Transmission (telecommunications); Keying; Wireless; Interference (communication); Filter (signal processing); Channel (broadcasting); Telecommunications; Engineering","score_opus":0.08191052318176238,"score_gpt":0.32136843115606817,"score_spread":0.23945790797430577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100438466","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02267841,0.001969833,0.3843154,0.013496707,0.0031723548,0.0021461088,0.0012121453,0.0033663716,0.5676427],"genre_scores_gemma":[0.99097157,0.0006121243,0.0048387083,0.00007440977,0.000102339836,0.0007532977,0.0008900706,0.000040674637,0.0017168116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988924,0.00005882935,0.00047347957,0.00017458257,0.00019096164,0.00020972613],"domain_scores_gemma":[0.9974313,0.00036027806,0.00010874005,0.0016463231,0.000418208,0.000035185094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000167444,0.0001808107,0.00017329936,0.00028131617,0.00021471373,0.00013007413,0.0019438433,0.00014941714,0.000060364735],"category_scores_gemma":[0.000063770436,0.0002035257,0.00007317587,0.00022140046,0.00012933239,0.00017511618,0.00007659062,0.0002476094,0.00013781588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007159371,0.0001465948,0.00016293,0.000013032134,0.00005492773,1.8220997e-7,0.000042867225,0.013490156,0.00847598,0.96037525,0.015284622,0.0019462818],"study_design_scores_gemma":[0.00086478057,0.00007114002,0.0005235589,0.00013710048,0.00003901531,0.000013701245,0.00023202416,0.66536766,0.0042119776,0.022604212,0.3053937,0.00054113916],"about_ca_topic_score_codex":0.0001796761,"about_ca_topic_score_gemma":0.0003593077,"teacher_disagreement_score":0.96829313,"about_ca_system_score_codex":0.00018430175,"about_ca_system_score_gemma":0.00004287307,"threshold_uncertainty_score":0.8299538},"labels":[],"label_agreement":null},{"id":"W2100685058","doi":"10.1109/icc.2006.254890","title":"Statistical Delay Budget Partitioning Algorithm","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Queen's University","funders":"","keywords":"Quality of service; Computer science; Algorithm; Heuristic; Metric (unit); Path (computing); Distributed computing; Computer network; Artificial intelligence","score_opus":0.041214242478621446,"score_gpt":0.3090131341010348,"score_spread":0.2677988916224134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100685058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016979352,0.00013152765,0.7918586,0.0024106917,0.00047909626,0.00014482696,0.00032504628,0.0010538643,0.2018984],"genre_scores_gemma":[0.758367,0.00038632355,0.24040066,0.000067523244,0.00009262918,0.00009346902,0.00030983007,0.000022222093,0.0002603295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991011,0.000025944873,0.00029422392,0.00015264394,0.00020886525,0.00021724516],"domain_scores_gemma":[0.9988773,0.00021976588,0.000039820494,0.00066810945,0.00015380779,0.000041187814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000068134614,0.00014644631,0.00012186707,0.00010364351,0.00013015456,0.0000818874,0.00084730587,0.00008749528,0.0002556703],"category_scores_gemma":[0.00003755719,0.00015819127,0.000034752484,0.00013445808,0.00022267607,0.00015075025,0.00008761294,0.00036735067,0.00029909227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032236721,0.000097825796,0.00018800246,0.0000027433978,0.000031081392,0.000005340302,0.000010971706,0.030343281,0.0004462792,0.92849755,0.01060739,0.029766303],"study_design_scores_gemma":[0.0002157221,0.000029960134,0.0010403587,0.00004715811,0.000010317146,0.000010558147,0.000044162975,0.86410713,0.00043018966,0.10111018,0.03268076,0.00027349254],"about_ca_topic_score_codex":0.00003869731,"about_ca_topic_score_gemma":0.00013689685,"teacher_disagreement_score":0.83376384,"about_ca_system_score_codex":0.000118500655,"about_ca_system_score_gemma":0.000017442915,"threshold_uncertainty_score":0.6450852},"labels":[],"label_agreement":null},{"id":"W2101632594","doi":"10.1109/icc.2006.255669","title":"Queueing Analysis of Distributed MAC in Wireless Ad Hoc Networks with Differentiated Services","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer network; Computer science; Queueing theory; Wireless ad hoc network; Layered queueing network; Node (physics); Queue; Distributed computing; Wireless; Telecommunications; Engineering","score_opus":0.03406871733561885,"score_gpt":0.30266823049098684,"score_spread":0.268599513155368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101632594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22286405,0.0002830575,0.7605644,0.0033671975,0.00021898371,0.0017611257,0.0002816461,0.00020934574,0.010450199],"genre_scores_gemma":[0.99575084,0.00022779054,0.0027558012,0.000075863194,0.000020319247,0.00044732247,0.0006266081,0.000009071866,0.00008636802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984652,0.00016953723,0.00049831514,0.0003049467,0.0003396255,0.0002224164],"domain_scores_gemma":[0.9977346,0.00020171807,0.00035467057,0.0012799546,0.0003831674,0.000045900702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018114893,0.0001812963,0.00031554222,0.00041567575,0.000110805115,0.00019867918,0.0027873982,0.00008728443,0.000043581953],"category_scores_gemma":[0.0000027119756,0.00016266487,0.000090850466,0.0014465406,0.00010392439,0.00028290882,0.0002556202,0.00028005592,0.000004296548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017441793,0.0015769106,0.11296024,0.000030228619,0.0010092359,0.000012315686,0.00038760965,0.24683478,0.0008350522,0.61590314,0.0002992648,0.019976817],"study_design_scores_gemma":[0.00039494646,0.000043145203,0.09273734,0.00019113641,0.000043189164,8.8198715e-7,0.00002509581,0.9049996,0.00011375956,0.00083519664,0.0004413248,0.00017439305],"about_ca_topic_score_codex":0.000877675,"about_ca_topic_score_gemma":0.012409902,"teacher_disagreement_score":0.7728868,"about_ca_system_score_codex":0.00007669248,"about_ca_system_score_gemma":0.00006107634,"threshold_uncertainty_score":0.69250166},"labels":[],"label_agreement":null},{"id":"W2101837036","doi":"10.1109/icc.2006.254735","title":"BER of A Bandlimited Single-Interferer Maximum-Likelihood BPSK Receiver With Carrier Phase Error","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bandlimiting; Phase-shift keying; Intersymbol interference; Additive white Gaussian noise; Mathematics; Algorithm; Bit error rate; Phase noise; Keying; Gaussian noise; Computer science; Statistics; Electronic engineering; White noise; Telecommunications; Decoding methods; Engineering","score_opus":0.06204148074783607,"score_gpt":0.32265638083334613,"score_spread":0.2606149000855101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101837036","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21742493,0.00061910605,0.25876182,0.004939383,0.0006071851,0.0013391474,0.0019063145,0.001993661,0.5124085],"genre_scores_gemma":[0.9788565,0.00028168352,0.019745035,0.00007602775,0.000031358886,0.00016903524,0.0004874097,0.000045775963,0.0003071509],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986113,0.00008340001,0.0005435397,0.00021330782,0.0003203492,0.00022815974],"domain_scores_gemma":[0.9971493,0.00016087384,0.00019799886,0.0017871575,0.0006398102,0.00006488838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010883558,0.0002601665,0.0002632081,0.00029907405,0.0001045696,0.00005564366,0.0016352313,0.00011150413,0.00032255772],"category_scores_gemma":[0.000022275908,0.00025699157,0.000080976075,0.0002744404,0.00028127644,0.00028827786,0.000117733296,0.0004101481,0.000040687275],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010246246,0.008439528,0.0033755817,0.00016927431,0.0013776497,0.00001913997,0.0021120352,0.017214382,0.47307268,0.3028977,0.041239303,0.14905813],"study_design_scores_gemma":[0.009368993,0.0015180585,0.002490487,0.0020144272,0.00025374728,0.00008399422,0.0009795319,0.30560583,0.47229663,0.051389217,0.15098415,0.003014924],"about_ca_topic_score_codex":0.00015128788,"about_ca_topic_score_gemma":0.00052827614,"teacher_disagreement_score":0.7614316,"about_ca_system_score_codex":0.0001882893,"about_ca_system_score_gemma":0.000052356652,"threshold_uncertainty_score":0.99998826},"labels":[],"label_agreement":null},{"id":"W2102338228","doi":"10.1109/icc.2006.255479","title":"Generalized Selection Combining in Generalized Correlated Nakagami-m Fading","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Nakagami distribution; Fading; Selection (genetic algorithm); Mathematics; Maximal-ratio combining; Correlation; Statistics; Fading distribution; Algorithm; Applied mathematics; Integer (computer science); Computer science; Artificial intelligence","score_opus":0.05644918069506329,"score_gpt":0.32221346266076717,"score_spread":0.2657642819657039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102338228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46127552,0.00095722673,0.15212798,0.0045200684,0.0016418425,0.001415187,0.00017890109,0.0046544624,0.37322882],"genre_scores_gemma":[0.97373956,0.0013642069,0.02328287,0.000110392764,0.0000507617,0.0002764878,0.00040613115,0.000053161417,0.0007164128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844587,0.00016208291,0.0006404958,0.00022667949,0.00026041866,0.00026443953],"domain_scores_gemma":[0.99838984,0.00015862602,0.00014661657,0.0009971181,0.00026037413,0.000047404224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002054241,0.0002470671,0.00024691471,0.0004924534,0.00017747423,0.00010310132,0.0014297254,0.0001532867,0.00016829622],"category_scores_gemma":[0.000031143074,0.0002984932,0.00007346674,0.00047274298,0.00011044402,0.00032269693,0.0001163976,0.00061482185,0.00007853373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041119813,0.00036761412,0.0030345453,0.000012209239,0.00007728814,0.0000029311316,0.00025080313,0.22311674,0.08571947,0.6765052,0.0049670693,0.0059049814],"study_design_scores_gemma":[0.0010532617,0.000026731888,0.0018848177,0.00016418895,0.00000998793,0.000010124887,0.000056583736,0.9597931,0.012394946,0.014638944,0.009522306,0.00044502548],"about_ca_topic_score_codex":0.0005362274,"about_ca_topic_score_gemma":0.001098042,"teacher_disagreement_score":0.73667634,"about_ca_system_score_codex":0.00043782778,"about_ca_system_score_gemma":0.00004318795,"threshold_uncertainty_score":0.9999467},"labels":[],"label_agreement":null},{"id":"W2103237477","doi":"10.1109/icc.2006.255225","title":"Wireless Image Transmission Using Rate-Compatible LDPC Codes","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Set partitioning in hierarchical trees; Low-density parity-check code; Computer science; Algorithm; Fading; Channel (broadcasting); Forward error correction; Signal-to-noise ratio (imaging); Transmitter; Transmission (telecommunications); Decoding methods; Image compression; Telecommunications; Image (mathematics); Image processing; Artificial intelligence","score_opus":0.10195383576930901,"score_gpt":0.365148018683611,"score_spread":0.263194182914302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103237477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031362288,0.000046906014,0.8845869,0.005077482,0.00042884162,0.0002504199,0.00002957311,0.0007074504,0.07751016],"genre_scores_gemma":[0.82325184,0.00007023041,0.17577806,0.000189476,0.000054467866,0.000038273254,0.00004593452,0.00001710664,0.0005546333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828416,0.0002528086,0.00044793583,0.00038153733,0.0003809971,0.0002525871],"domain_scores_gemma":[0.9971993,0.00027175297,0.0002388052,0.0016494258,0.00057383307,0.00006688475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000404083,0.0002191935,0.00019870802,0.00029556986,0.00046289695,0.0005211023,0.0039799134,0.00009053173,0.00007477969],"category_scores_gemma":[0.000026263102,0.00022685561,0.0000966636,0.00036055312,0.00020220739,0.0006546905,0.0002846141,0.00038390217,0.00008429794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001958018,0.00065852515,0.00072325906,0.000010902269,0.000033970944,0.000007732626,0.00041965683,0.00062131457,0.26351583,0.713498,0.0047925743,0.01569868],"study_design_scores_gemma":[0.00028289427,0.000053080257,0.0008527892,0.00020261217,0.000009599623,0.000019515786,0.0000393616,0.913731,0.051537707,0.027522577,0.0053828154,0.00036609062],"about_ca_topic_score_codex":0.001475935,"about_ca_topic_score_gemma":0.0003347791,"teacher_disagreement_score":0.91310966,"about_ca_system_score_codex":0.00017977126,"about_ca_system_score_gemma":0.00020993265,"threshold_uncertainty_score":0.9250904},"labels":[],"label_agreement":null},{"id":"W2103989375","doi":"10.1109/icc.2006.254703","title":"Structured Peer-to-Peer Control Plane","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Chord (peer-to-peer); Computer science; Scalability; Peer-to-peer; Computer network; Distributed computing; Robustness (evolution); Forwarding plane; Overlay; Implementation; Operating system; Software engineering","score_opus":0.053119662832878965,"score_gpt":0.32023050545049003,"score_spread":0.2671108426176111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103989375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0095925005,0.00005211395,0.49089122,0.36097065,0.0017741406,0.00080619287,0.0005338391,0.0013297594,0.13404961],"genre_scores_gemma":[0.9160836,0.000011173324,0.07374022,0.0023963994,0.00015082465,0.00017032807,0.00014404868,0.000018039496,0.0072853756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99736595,0.00010724506,0.00047960907,0.00052009756,0.0011156069,0.0004114768],"domain_scores_gemma":[0.99501246,0.0002811115,0.00016790883,0.0029445947,0.0014538858,0.00014006671],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039780914,0.00027904136,0.00025378735,0.00049711764,0.00027251925,0.0004996142,0.008405853,0.00014416616,0.00009435761],"category_scores_gemma":[0.00027284978,0.00028253824,0.00008434554,0.0005828319,0.00013395134,0.0003159931,0.00073903246,0.00047769706,0.0008605095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022077771,0.00016619389,0.0006642016,0.0000013950985,0.000048239508,0.0000065669783,0.00013173524,0.0035917107,0.0035524487,0.82091296,0.15825208,0.012650399],"study_design_scores_gemma":[0.0016829324,0.00033729532,0.024965348,0.00013769614,0.000026490237,0.0000569087,0.00011385836,0.14924583,0.004912811,0.107736446,0.70952964,0.0012547423],"about_ca_topic_score_codex":0.00043624555,"about_ca_topic_score_gemma":0.0012234468,"teacher_disagreement_score":0.9064911,"about_ca_system_score_codex":0.00020175942,"about_ca_system_score_gemma":0.00013321494,"threshold_uncertainty_score":0.9999627},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04343659894178009,"score_gpt":0.2885356928234035,"score_spread":0.24509909388162343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105474416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035187604,0.00021914102,0.9480422,0.0013936888,0.0009992259,0.0004960754,0.00026755108,0.0009355888,0.04412776],"genre_scores_gemma":[0.99486804,0.0007012626,0.002349279,0.00017966979,0.000177453,0.0002998812,0.000732955,0.00003730053,0.0006541568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989446,0.000035016034,0.00039487483,0.00019068393,0.0001841725,0.0002506595],"domain_scores_gemma":[0.99856746,0.00017082662,0.000092832954,0.0006954837,0.00043499318,0.000038381077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009930177,0.0001934634,0.00017031282,0.00016296354,0.00023019493,0.00011978658,0.00088641315,0.0001687881,0.000104186816],"category_scores_gemma":[0.000034190085,0.00021017605,0.000080609694,0.00027424493,0.00016691531,0.00014694086,0.000051531486,0.0002237978,0.000047374262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022075217,0.00016023655,0.0016933954,0.00001948954,0.000078419456,0.0000012409811,0.00006134127,0.38303855,0.0011334629,0.5660024,0.04001513,0.0077742576],"study_design_scores_gemma":[0.0004548138,0.00002315459,0.00024548825,0.00004689954,0.000016334945,0.0000030160102,0.00009463694,0.95220566,0.00285899,0.0028184752,0.04098879,0.0002437339],"about_ca_topic_score_codex":0.00006108144,"about_ca_topic_score_gemma":0.00017547264,"teacher_disagreement_score":0.9913493,"about_ca_system_score_codex":0.00016120261,"about_ca_system_score_gemma":0.000035207624,"threshold_uncertainty_score":0.857073},"labels":[],"label_agreement":null},{"id":"W2107013636","doi":"10.1109/icc.2006.255290","title":"A Novel Rank Estimator for Inter-cell Interference Cancellation in CDMA Systems","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Telecommunications link; Orthogonality; Code division multiple access; Computer science; Estimator; Single antenna interference cancellation; Interference (communication); Multipath propagation; Algorithm; SIGNAL (programming language); Spread spectrum; Decoding methods; Telecommunications; Mathematics; Statistics","score_opus":0.12357672633406926,"score_gpt":0.36542167192536196,"score_spread":0.24184494559129271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107013636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018323398,0.00023030973,0.93081707,0.010182336,0.0007814628,0.00092109974,0.00010899378,0.00017769025,0.054948695],"genre_scores_gemma":[0.9529788,0.00022552583,0.043506656,0.000111608024,0.00009961217,0.0008293399,0.00017926696,0.000024236884,0.0020449671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976283,0.0002239418,0.00079549605,0.0005022223,0.00045555018,0.00039454768],"domain_scores_gemma":[0.9951365,0.00087322766,0.00034669187,0.0026700592,0.0008863036,0.00008724403],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006482238,0.00025755246,0.00027848766,0.0005297562,0.0002650762,0.0006040331,0.0067509324,0.00013511837,0.000027703007],"category_scores_gemma":[0.0000871694,0.00027723884,0.00009855016,0.00053581886,0.00017906936,0.0006048285,0.000678149,0.00052304706,0.00008898888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005624447,0.0009585922,0.00076933246,0.000028685788,0.00002571512,0.00000132531,0.00022005757,0.020455865,0.008489617,0.955989,0.0062202364,0.0067853383],"study_design_scores_gemma":[0.0010579176,0.000066933986,0.00076487684,0.00023992565,0.0000036902868,0.0000073361966,0.00006988527,0.98340404,0.0005988617,0.003678293,0.009820164,0.00028805566],"about_ca_topic_score_codex":0.0016597837,"about_ca_topic_score_gemma":0.002134126,"teacher_disagreement_score":0.9629482,"about_ca_system_score_codex":0.00043940617,"about_ca_system_score_gemma":0.0003139165,"threshold_uncertainty_score":0.999968},"labels":[],"label_agreement":null},{"id":"W2107395567","doi":"10.1109/icc.2006.255715","title":"Achievable Communication Rates in Ad hoc Wireless Networks Using Local Node Cooperation","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Wireless ad hoc network; Computer network; Computer science; Node (physics); Relay; Throughput; Wireless; Communication complexity; Mobile ad hoc network; Vehicular ad hoc network; Distributed computing; Telecommunications; Theoretical computer science; Network packet; Engineering","score_opus":0.10135500579580987,"score_gpt":0.34953787562953237,"score_spread":0.2481828698337225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107395567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018658467,0.0022775077,0.92991865,0.0127609065,0.0004839078,0.00054499233,0.000022403485,0.00027030864,0.035062835],"genre_scores_gemma":[0.9701734,0.006307078,0.021880921,0.00065676344,0.00005304791,0.00011529713,0.00027677443,0.00002329285,0.00051339396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741125,0.00068890967,0.00075465936,0.00043570448,0.00036153136,0.0003479451],"domain_scores_gemma":[0.9955977,0.00037488807,0.00030587852,0.0029007867,0.0007444972,0.00007624221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066831685,0.00028778252,0.00027559118,0.00037346696,0.0006565803,0.00055561896,0.004885958,0.00015117248,0.00008656945],"category_scores_gemma":[0.000036110785,0.00031494824,0.00008327617,0.000841255,0.00030190643,0.00097484165,0.000826674,0.0007157195,0.00007316926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035871144,0.000721025,0.0011170559,0.000004262208,0.000034379267,0.0000026780901,0.00031481587,0.09068506,0.0035202133,0.85673404,0.0017787702,0.045051817],"study_design_scores_gemma":[0.00061600166,0.000032534623,0.0015743164,0.00018516633,0.000006036172,0.000008521988,0.000075483564,0.9884906,0.0005392958,0.0022338463,0.0059042214,0.0003339662],"about_ca_topic_score_codex":0.0002965485,"about_ca_topic_score_gemma":0.004027561,"teacher_disagreement_score":0.95151496,"about_ca_system_score_codex":0.0004225769,"about_ca_system_score_gemma":0.00020980001,"threshold_uncertainty_score":0.99993026},"labels":[],"label_agreement":null},{"id":"W2110318861","doi":"10.1109/icc.2006.255422","title":"Adaptive Rate Allocation for Multi-layered Video Transmission in Wireless Communication Systems","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quality of service; Throughput; Channel (broadcasting); Scalability; Transmission (telecommunications); Wireless; Computer network; Adaptation (eye); Link adaptation; Video quality; Real-time computing; Transmission rate; Fading; Telecommunications; Engineering","score_opus":0.08722122320464445,"score_gpt":0.31903870898698466,"score_spread":0.2318174857823402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110318861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005288837,0.0005294723,0.9825078,0.0011058557,0.00041521253,0.0011283648,0.00014673037,0.0003414668,0.0085362615],"genre_scores_gemma":[0.95494634,0.0014875415,0.04101874,0.00003692694,0.000064453896,0.0008760172,0.0011450405,0.000055968812,0.00036897263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847984,0.00018180537,0.00064100913,0.0002534952,0.0001985916,0.0002452492],"domain_scores_gemma":[0.998067,0.00032017642,0.00017461726,0.00093023654,0.00045719347,0.000050781597],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030828337,0.00024481837,0.00023548586,0.0002900906,0.0001855602,0.000107569125,0.0010758081,0.00015613736,0.000013407743],"category_scores_gemma":[0.000019943282,0.00028336362,0.00006597324,0.0002977688,0.00009726568,0.00041393426,0.00004318588,0.00031881503,0.000025211823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053461048,0.00020159029,0.000094351315,0.000014964611,0.00002988394,3.141491e-7,0.000100137084,0.8372818,0.0054972894,0.15024813,0.0005840904,0.0058939517],"study_design_scores_gemma":[0.001029333,0.00003154217,0.00049370795,0.000284549,0.000011094333,0.0000014741763,0.00013475561,0.99320114,0.0010312008,0.0017149204,0.0017884418,0.0002778469],"about_ca_topic_score_codex":0.000251952,"about_ca_topic_score_gemma":0.0007470683,"teacher_disagreement_score":0.9496575,"about_ca_system_score_codex":0.00037711233,"about_ca_system_score_gemma":0.000052569783,"threshold_uncertainty_score":0.99996185},"labels":[],"label_agreement":null},{"id":"W2111215802","doi":"10.1109/icc.2006.255215","title":"Near-Optimal Training-Based Estimation of Frequency Offset and Channel Response in OFDM with Phase Noise","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Carrier frequency offset; Algorithm; Fast Fourier transform; Computer science; Orthogonal frequency-division multiplexing; Gaussian noise; Frequency domain; Phase noise; Covariance matrix; Channel (broadcasting); Speech recognition; Frequency offset; Telecommunications; Electronic engineering; Engineering","score_opus":0.05674387569650165,"score_gpt":0.3316647657967481,"score_spread":0.27492089010024645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111215802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73934263,0.00019710597,0.24690379,0.0026564144,0.00006386476,0.00050464395,0.00035521336,0.00039318495,0.009583132],"genre_scores_gemma":[0.9361426,0.00010643507,0.06328409,0.000035948342,0.000007507326,0.00016730864,0.000205697,0.000024992054,0.00002539362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998965,0.000115706025,0.0004247741,0.0001491855,0.00020597408,0.0001393123],"domain_scores_gemma":[0.99843335,0.0002971854,0.00014256428,0.0008849265,0.00020428725,0.00003770156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024677123,0.00016568947,0.00018866555,0.00030335697,0.00008247618,0.000044332683,0.0007246346,0.00007614641,0.000027599963],"category_scores_gemma":[0.00006278127,0.00017739153,0.000027780527,0.00024009052,0.0002959111,0.00023935089,0.000042338346,0.00028262258,0.00000491333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006742168,0.00086639065,0.00051224383,0.000036417332,0.000043687884,0.0000040637456,0.000994539,0.9097009,0.022126773,0.05313999,0.0002549257,0.0116459085],"study_design_scores_gemma":[0.0009340919,0.00016758658,0.0021535151,0.0002555854,0.0000068437525,0.0000043517807,0.0001033231,0.9881881,0.0056459233,0.0021925077,0.00015393969,0.00019424666],"about_ca_topic_score_codex":0.000148484,"about_ca_topic_score_gemma":0.00035132983,"teacher_disagreement_score":0.19679998,"about_ca_system_score_codex":0.00011521909,"about_ca_system_score_gemma":0.0001055669,"threshold_uncertainty_score":0.72338164},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0858334613397398,"score_gpt":0.31090177018964926,"score_spread":0.22506830884990947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111322283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077384926,0.00011852531,0.98891026,0.0065636877,0.0007361536,0.00079277414,0.00008738971,0.00015619808,0.0018611671],"genre_scores_gemma":[0.9813193,0.00026285285,0.01614729,0.0005139175,0.00021530382,0.00078820484,0.0001391286,0.000021488257,0.00059251644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982009,0.00015875458,0.00050636585,0.0004748513,0.0003169425,0.00034218613],"domain_scores_gemma":[0.9975263,0.00034126634,0.00030878774,0.00116311,0.000550823,0.000109720575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004508104,0.0002579976,0.00026400987,0.00014485753,0.00035655918,0.0003579085,0.0018287466,0.00014692957,0.000014685816],"category_scores_gemma":[0.000029496416,0.00026819212,0.00009668416,0.00013221709,0.00019377843,0.0003816018,0.00029372508,0.00033125468,0.000016576214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004154997,0.00055044994,0.00006394169,0.0000062946874,0.000088532855,0.0000022953177,0.00012013799,0.10533384,0.00040888833,0.88365185,0.004165257,0.0055669723],"study_design_scores_gemma":[0.0014300465,0.00011135362,0.0010165158,0.00008330249,0.00001643561,0.0000105454155,0.000031049192,0.9926626,0.00014675678,0.0034948078,0.0007247692,0.0002717832],"about_ca_topic_score_codex":0.00016096828,"about_ca_topic_score_gemma":0.0003564839,"teacher_disagreement_score":0.98054546,"about_ca_system_score_codex":0.00014788251,"about_ca_system_score_gemma":0.000081628365,"threshold_uncertainty_score":0.99997705},"labels":[],"label_agreement":null},{"id":"W2111561875","doi":"10.1109/icc.2006.255081","title":"Sensor Networks for Estimating and Updating the Performance of Cellular Systems","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Path loss; Computer science; Base station; Stochastic geometry; Coverage probability; Cellular network; Interference (communication); Outage probability; Fading; Signal-to-noise ratio (imaging); False alarm; Signal-to-interference-plus-noise ratio; Real-time computing; SIGNAL (programming language); Shadow mapping; Electronic engineering; Algorithm; Power (physics); Statistics; Telecommunications; Mathematics; Decoding methods; Engineering; Wireless","score_opus":0.036618688007675815,"score_gpt":0.2774882505871868,"score_spread":0.24086956257951098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111561875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02144617,0.0002963786,0.9665604,0.00021951263,0.0006194756,0.0004479695,0.000061521176,0.00010353017,0.010244998],"genre_scores_gemma":[0.9555719,0.00010774433,0.04376746,0.000008837656,0.00012989256,0.00012579068,0.000103133185,0.000018904033,0.00016636665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993251,0.000032082757,0.00034805996,0.00009228042,0.00009535324,0.00010711106],"domain_scores_gemma":[0.99891925,0.00024900388,0.00014288566,0.00043508428,0.00023824428,0.000015524916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017829223,0.00010101478,0.00011389891,0.00005647782,0.00015658503,0.00005540711,0.00041398554,0.000044690703,0.000004086679],"category_scores_gemma":[0.000024200372,0.00008974376,0.000024403966,0.00007563727,0.000073833064,0.00012327697,0.00003607104,0.00012367389,0.0000023214645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028547352,0.0000115408075,0.0002037557,0.000028282733,0.000015873906,3.8801346e-8,0.000037615773,0.96694094,0.0027725995,0.029206552,0.00019662626,0.00058333395],"study_design_scores_gemma":[0.00014066274,0.000014713362,0.00006123484,0.00013468925,0.000008615518,0.0000028328238,0.00011810664,0.99836475,0.0006310233,0.00008433368,0.0003531355,0.00008591542],"about_ca_topic_score_codex":0.000054531414,"about_ca_topic_score_gemma":0.000021594502,"teacher_disagreement_score":0.9341257,"about_ca_system_score_codex":0.000043234075,"about_ca_system_score_gemma":0.000011349227,"threshold_uncertainty_score":0.3659644},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05569923601809098,"score_gpt":0.3114964900403335,"score_spread":0.2557972540222425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112869036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061747627,0.0003233567,0.98381925,0.0007965228,0.0005975669,0.0004975657,0.00019806746,0.00030167354,0.007291248],"genre_scores_gemma":[0.97333276,0.0003245117,0.024888288,0.00022038353,0.0002558101,0.00023897813,0.0005372118,0.00005529293,0.00014678453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880207,0.00005899849,0.0004352641,0.0002226211,0.0002076997,0.00027335616],"domain_scores_gemma":[0.99841803,0.0002702769,0.0001571454,0.0006533922,0.0004310086,0.000070169655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000117218646,0.00023760703,0.00021681152,0.00016170024,0.0002467672,0.0000976305,0.0007974047,0.00015239658,0.00006671954],"category_scores_gemma":[0.000018080078,0.00025730726,0.00009586994,0.0001865644,0.00009439213,0.00019150178,0.0000320889,0.00026151724,0.000008825855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043401298,0.00009551479,0.00029159003,0.000007962326,0.000033194534,5.831739e-7,0.000006323679,0.96031237,0.0024134533,0.033035323,0.0008201531,0.0029401593],"study_design_scores_gemma":[0.001016034,0.000026595835,0.00014505835,0.00013987972,0.000029551022,0.0000021637538,0.000011116365,0.9935698,0.00045650115,0.002582936,0.0017542408,0.00026610825],"about_ca_topic_score_codex":0.00003722007,"about_ca_topic_score_gemma":0.00009729408,"teacher_disagreement_score":0.96715796,"about_ca_system_score_codex":0.00021050379,"about_ca_system_score_gemma":0.00006487555,"threshold_uncertainty_score":0.9999879},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11665880416865243,"score_gpt":0.3385819704779986,"score_spread":0.22192316630934616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113268536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95195943,0.00029364144,0.039332118,0.0014803928,0.00009302107,0.0002545501,0.00003893885,0.00003172582,0.006516207],"genre_scores_gemma":[0.9953346,0.0017934943,0.0026521953,0.000020514368,0.000013198776,0.000048119295,0.000040046525,0.0000064159913,0.00009139058],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851733,0.00021490717,0.00043836728,0.0002827228,0.0003580608,0.00018863313],"domain_scores_gemma":[0.9978113,0.00046277995,0.00023237079,0.001358292,0.0000866954,0.00004851996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043918134,0.00012948517,0.00023774842,0.0006950534,0.00016606723,0.00027544503,0.0026858314,0.0000603674,0.000007768334],"category_scores_gemma":[0.000031940148,0.00013841125,0.000036116508,0.00066989433,0.0002468341,0.00066692044,0.0008698272,0.00028912176,0.0000036348586],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002205004,0.00046155375,0.7467932,0.000027162747,0.00025768738,0.0000015060788,0.0005084377,0.04545585,0.0037021963,0.1926322,0.000063524785,0.010074643],"study_design_scores_gemma":[0.00017929047,0.000014363588,0.2878177,0.00006555916,0.000010944259,0.0000017025244,0.000024186113,0.71094126,0.00034457305,0.00030869423,0.00019863022,0.00009309944],"about_ca_topic_score_codex":0.0027514054,"about_ca_topic_score_gemma":0.001947746,"teacher_disagreement_score":0.66548544,"about_ca_system_score_codex":0.00010495793,"about_ca_system_score_gemma":0.000032922315,"threshold_uncertainty_score":0.56442475},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0690371081040146,"score_gpt":0.3127174330668064,"score_spread":0.2436803249627918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113876301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014121418,0.0002946024,0.9694317,0.0008909001,0.0012144814,0.00074148923,0.00035597768,0.00032682647,0.012622582],"genre_scores_gemma":[0.91852325,0.0003254567,0.079459205,0.000060051527,0.00021773229,0.00042609975,0.0007148286,0.000049217113,0.00022414928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988553,0.0000263856,0.00046715353,0.0002084794,0.00020733861,0.00023536714],"domain_scores_gemma":[0.9985693,0.00025868282,0.000108496606,0.0005990874,0.0004212099,0.00004322638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001358017,0.00019433419,0.00019487584,0.0002153784,0.00010184004,0.00010076778,0.00086010626,0.000117993295,0.000014712023],"category_scores_gemma":[0.000018903647,0.00022995967,0.00004174721,0.00028361077,0.000049678772,0.0002582197,0.000050981358,0.00026361117,0.000026780912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010887792,0.00012318193,0.00016835064,0.000021242031,0.000021978562,3.254548e-7,0.00006673064,0.9678684,0.0055296943,0.023578925,0.00018908468,0.0024211823],"study_design_scores_gemma":[0.00079948327,0.000009780237,0.00043496315,0.00020250668,0.000006852876,0.0000031456402,0.00008848465,0.99583155,0.00044957653,0.00036658774,0.0015786213,0.00022846204],"about_ca_topic_score_codex":0.00036292887,"about_ca_topic_score_gemma":0.0011537019,"teacher_disagreement_score":0.90440184,"about_ca_system_score_codex":0.00022195143,"about_ca_system_score_gemma":0.000042613134,"threshold_uncertainty_score":0.9377483},"labels":[],"label_agreement":null},{"id":"W2117376236","doi":"10.1109/icc.2006.254876","title":"A Feedback Control Model for Multiple-Link Adaptive Bandwidth Provisioning Systems","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Provisioning; Computer science; Bandwidth (computing); Quality of service; Computer network; Dynamic bandwidth allocation; Bandwidth allocation; Adaptive control; Distributed computing; Control (management)","score_opus":0.07987083732580426,"score_gpt":0.3013197851380725,"score_spread":0.22144894781226826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117376236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030145934,0.00017547655,0.97151893,0.010837035,0.0006653049,0.0008571741,0.0001755897,0.00025456105,0.015214485],"genre_scores_gemma":[0.9635703,0.000047913596,0.031905893,0.00042992076,0.00027190355,0.0007329515,0.00008134521,0.000018371042,0.0029414298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982044,0.00013314394,0.0005258214,0.0004344179,0.0003909355,0.00031124754],"domain_scores_gemma":[0.99657303,0.0007928175,0.0002989117,0.0012777034,0.00096923846,0.00008830923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003502866,0.00023557647,0.00025466562,0.0001670216,0.0004110429,0.00044125156,0.0028625936,0.00010932456,0.000009022539],"category_scores_gemma":[0.00006582832,0.00022897951,0.0001368461,0.00016014547,0.000116905445,0.00042775896,0.00013532452,0.00028142126,0.000067561305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060752944,0.00015816845,0.00008384976,0.0000030189572,0.000050081664,6.5728887e-7,0.00006810612,0.14141497,0.00017406185,0.8312252,0.0034126306,0.02334846],"study_design_scores_gemma":[0.0017396513,0.00007815917,0.000109422486,0.00009174436,0.000015716763,0.000004609383,0.000028331991,0.9845036,0.000016473889,0.008904089,0.004263283,0.00024490792],"about_ca_topic_score_codex":0.00013829397,"about_ca_topic_score_gemma":0.00022581765,"teacher_disagreement_score":0.9632688,"about_ca_system_score_codex":0.00013219636,"about_ca_system_score_gemma":0.0002562961,"threshold_uncertainty_score":0.93375134},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05015300850426564,"score_gpt":0.27860984354282886,"score_spread":0.22845683503856323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118058487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013622041,0.00031388493,0.9916267,0.0008781936,0.00048210545,0.00042218744,0.00018922746,0.00022328038,0.0045022345],"genre_scores_gemma":[0.77648145,0.0010009609,0.22009197,0.00008212186,0.000262307,0.00025703496,0.0015796865,0.00004404647,0.00020039415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988471,0.00005095251,0.00043584028,0.00023453594,0.00019947402,0.00023205958],"domain_scores_gemma":[0.9987808,0.00019005647,0.00013375391,0.0005430446,0.00029027104,0.00006207099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018293163,0.00021309585,0.00017581905,0.00014694504,0.00021248385,0.00012921655,0.00040314844,0.00011357305,0.000047733967],"category_scores_gemma":[0.00001817534,0.00024341799,0.00005744486,0.00013260942,0.00008985217,0.00024291169,0.0000579502,0.0002617112,0.000013038038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060042657,0.00007140938,0.000043896205,0.0000074831805,0.00003814615,5.752225e-7,0.000032594355,0.9360316,0.0020521635,0.026607161,0.0010892078,0.034019783],"study_design_scores_gemma":[0.00046649747,0.00002888499,0.00012090234,0.0000863663,0.000018018829,0.0000018308876,0.000053843618,0.9920307,0.0015105418,0.0034765669,0.001963003,0.00024284062],"about_ca_topic_score_codex":0.00003009737,"about_ca_topic_score_gemma":0.000069013084,"teacher_disagreement_score":0.77511925,"about_ca_system_score_codex":0.00019173852,"about_ca_system_score_gemma":0.00002651548,"threshold_uncertainty_score":0.99262977},"labels":[],"label_agreement":null},{"id":"W2119162374","doi":"10.1109/icc.2006.255724","title":"A BICM Scheme with Iterative Demapping and Decoding for Non-Coherent MIMO Communication","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Decoding methods; Computer science; Scheme (mathematics); Algorithm; MIMO; Channel (broadcasting); Signal-to-noise ratio (imaging); Bit error rate; Real-time computing; Mathematics; Computer network; Telecommunications","score_opus":0.0541304703431848,"score_gpt":0.32270968430357916,"score_spread":0.26857921396039436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119162374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042118292,0.00091249286,0.79898745,0.0057720593,0.00016974863,0.0018132693,0.00027516877,0.0011419553,0.14880958],"genre_scores_gemma":[0.79738075,0.00095747487,0.20021683,0.000081149075,0.000029705645,0.00076708564,0.00029222126,0.000037702728,0.000237076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895334,0.000058516063,0.00040584456,0.00020759818,0.00017763757,0.00019704804],"domain_scores_gemma":[0.9975762,0.0003809148,0.00015530387,0.0013953676,0.00044106174,0.00005119444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016897861,0.00023198836,0.0002059419,0.00022192989,0.00034028862,0.00016104912,0.0012653291,0.000087842986,0.000023791881],"category_scores_gemma":[0.000024566005,0.00023750683,0.000046871624,0.00016734081,0.00021806787,0.00037379522,0.00015219112,0.00032882878,0.00001098607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010610943,0.00047000247,0.002416862,0.000094747666,0.00030084248,0.0000010249165,0.0010101821,0.0072098905,0.050404962,0.9047778,0.006741657,0.026465874],"study_design_scores_gemma":[0.0010771209,0.00010333917,0.0011449668,0.0006983837,0.000026812128,0.000012540513,0.00036766587,0.94682443,0.013712138,0.016705567,0.018696051,0.00063095766],"about_ca_topic_score_codex":0.000061654755,"about_ca_topic_score_gemma":0.00061005016,"teacher_disagreement_score":0.9396146,"about_ca_system_score_codex":0.00016520973,"about_ca_system_score_gemma":0.000035607125,"threshold_uncertainty_score":0.96852475},"labels":[],"label_agreement":null},{"id":"W2119277930","doi":"10.1109/icc.2006.255491","title":"Two-Stage Blind Detection of Alamouti Based Minimum-Shift Keying","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Fading; Phase-shift keying; Computer science; Keying; Algorithm; Bit error rate; Channel (broadcasting); Block code; Channel state information; Minimum-shift keying; Telecommunications; Electronic engineering; Mathematics; Decoding methods; Engineering","score_opus":0.06983092492082836,"score_gpt":0.3369903039710563,"score_spread":0.2671593790502279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119277930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10364949,0.00038919246,0.5917785,0.0018999841,0.00065066846,0.00079238234,0.00042550842,0.0016293183,0.29878494],"genre_scores_gemma":[0.981332,0.00020020457,0.017712548,0.000054587625,0.000045307686,0.00015934659,0.00018787078,0.000038345363,0.0002697945],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871254,0.00009219883,0.0005593736,0.0001711006,0.0002918435,0.00017295833],"domain_scores_gemma":[0.9975638,0.00026237674,0.00020440404,0.0016150258,0.00031340492,0.00004102543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017928574,0.00019792079,0.00019152567,0.00033941152,0.00013728165,0.000054237767,0.0015962097,0.00009640091,0.00012722016],"category_scores_gemma":[0.000033908535,0.00023313469,0.00009233192,0.0002529604,0.00019069026,0.0002338959,0.00009905056,0.0003876184,0.00004295996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011478903,0.0008107048,0.0010893083,0.00006783259,0.00013792257,0.0000020815169,0.00030116612,0.14783704,0.47868332,0.3477329,0.00073182455,0.02249111],"study_design_scores_gemma":[0.0010819979,0.000054515735,0.0019118442,0.00018063755,0.000018721475,0.0000019580127,0.000102820566,0.70013,0.2813957,0.0066894367,0.0079985885,0.00043380976],"about_ca_topic_score_codex":0.00029553994,"about_ca_topic_score_gemma":0.0008952895,"teacher_disagreement_score":0.8776825,"about_ca_system_score_codex":0.00016665939,"about_ca_system_score_gemma":0.00004657563,"threshold_uncertainty_score":0.95069563},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.056474203807207156,"score_gpt":0.3162094292700714,"score_spread":0.25973522546286426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120477018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019298691,0.00009710487,0.78717464,0.006829616,0.000275449,0.001671998,0.00014649729,0.00025883754,0.18424714],"genre_scores_gemma":[0.9691887,0.00003863692,0.029028825,0.00016563086,0.00004259627,0.00046812513,0.000099036806,0.000009035113,0.0009594257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986289,0.0001679928,0.00041139513,0.00028192552,0.00032169014,0.00018810244],"domain_scores_gemma":[0.9973109,0.00030103064,0.00030575064,0.0015186972,0.00051641,0.000047228055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033946332,0.0001532581,0.00025043674,0.00040153222,0.00017301238,0.00022130783,0.0027690853,0.00006302841,0.00013420325],"category_scores_gemma":[0.000012234654,0.00013674771,0.00009287083,0.0012336726,0.00012404482,0.0003257934,0.00017482552,0.00021815147,0.000021440246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018433619,0.00028524126,0.00088767713,0.0000040751893,0.00030333005,0.000001473692,0.00010017579,0.14959557,0.000811012,0.84438574,0.0009214985,0.0026857888],"study_design_scores_gemma":[0.00036334686,0.000096328105,0.00369911,0.000108707536,0.00007994061,0.0000021445803,0.000018538969,0.9831944,0.0004279838,0.0034854526,0.008304528,0.00021952992],"about_ca_topic_score_codex":0.0005905921,"about_ca_topic_score_gemma":0.0011813784,"teacher_disagreement_score":0.94989,"about_ca_system_score_codex":0.000057651636,"about_ca_system_score_gemma":0.00016965887,"threshold_uncertainty_score":0.55764097},"labels":[],"label_agreement":null},{"id":"W2120796513","doi":"10.1109/icc.2006.255015","title":"Performance of Selection Diversity MFSK in the Presence of Estimation Errors","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Estimator; Selection (genetic algorithm); Noise (video); Diversity combining; Independent and identically distributed random variables; Algorithm; Computer science; Signal-to-noise ratio (imaging); A priori and a posteriori; Statistics; Frequency-shift keying; Mathematics; Noise power; SIGNAL (programming language); Keying; Power (physics); Speech recognition; Telecommunications; Fading; Demodulation; Artificial intelligence; Physics","score_opus":0.0546348964081913,"score_gpt":0.31056121369369344,"score_spread":0.25592631728550214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120796513","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9148065,0.00007209568,0.025472468,0.00081728847,0.000109127024,0.0003604533,0.000054807995,0.00015871912,0.058148555],"genre_scores_gemma":[0.98996466,0.00050816365,0.009354852,0.000012368527,0.000007871154,0.00005010594,0.000051064973,0.000007195816,0.00004368601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999178,0.00008259899,0.0003353479,0.000077168865,0.00024542704,0.00008143561],"domain_scores_gemma":[0.9987155,0.00019701169,0.00014365822,0.0007074012,0.00022722769,0.000009153707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021499873,0.00008779292,0.000106966836,0.00018544297,0.00009698183,0.000010355177,0.0015151076,0.000048384783,0.00002309767],"category_scores_gemma":[0.000029985937,0.00008422723,0.000032896172,0.0002818546,0.00015262263,0.00024127071,0.00013299924,0.00022374553,0.0000047064864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005606061,0.000726836,0.05368533,0.00008664386,0.000048151942,2.9170587e-7,0.0016017864,0.6397132,0.025733912,0.258242,0.0015532076,0.018552518],"study_design_scores_gemma":[0.00014992763,0.000039944418,0.035935014,0.00011901213,0.0000059792906,0.0000017858281,0.00011432857,0.942104,0.018224254,0.0029752478,0.00022845401,0.00010205132],"about_ca_topic_score_codex":0.00039357427,"about_ca_topic_score_gemma":0.0005069375,"teacher_disagreement_score":0.30239075,"about_ca_system_score_codex":0.000075775504,"about_ca_system_score_gemma":0.000020165855,"threshold_uncertainty_score":0.34346867},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.20535018977858485,"score_gpt":0.375488632811532,"score_spread":0.17013844303294715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121304904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014844656,0.00024232254,0.96646637,0.0061809183,0.00040481164,0.0005233128,0.00008088258,0.0001618131,0.011094926],"genre_scores_gemma":[0.94185513,0.0009033942,0.055903636,0.0005254403,0.00013050126,0.000099002325,0.00012451933,0.000016033482,0.0004423318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841166,0.0002786885,0.00044498418,0.00038579621,0.000210955,0.0002679279],"domain_scores_gemma":[0.996924,0.0005723532,0.00022270181,0.001264027,0.0009399614,0.00007696801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039347648,0.00023197355,0.00024638898,0.00016234072,0.00110176,0.0007409104,0.0022000787,0.00008367351,0.00003414489],"category_scores_gemma":[0.00006068528,0.00023853012,0.000069788,0.00028528148,0.00041945488,0.00043859493,0.00052273204,0.00031789855,0.000010038801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017589173,0.00017634367,0.00016763307,0.0000051122156,0.00003108703,7.2762543e-7,0.0001741369,0.0055358363,0.0044768215,0.9830288,0.0008219125,0.005563997],"study_design_scores_gemma":[0.00052261463,0.00004131178,0.0006139286,0.00011846682,0.000009160637,0.000010100063,0.00007142576,0.98982424,0.0016430848,0.0037609902,0.0030958704,0.00028882982],"about_ca_topic_score_codex":0.000088907116,"about_ca_topic_score_gemma":0.000680393,"teacher_disagreement_score":0.9842884,"about_ca_system_score_codex":0.0001323627,"about_ca_system_score_gemma":0.00013452239,"threshold_uncertainty_score":0.97269756},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.046086353421271715,"score_gpt":0.33417887621203207,"score_spread":0.28809252279076036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121489931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01412328,0.00032555094,0.9747418,0.0045514125,0.0008463673,0.0007651398,0.000057601228,0.00018650781,0.004402322],"genre_scores_gemma":[0.95259476,0.0007144381,0.044852287,0.0003172787,0.00016727293,0.000566734,0.00030386366,0.000021121881,0.0004622267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801826,0.00019646205,0.00057712186,0.00052206125,0.00030714562,0.0003789181],"domain_scores_gemma":[0.9966528,0.00035148085,0.00029981247,0.0020481332,0.0005650144,0.00008280426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005139899,0.00022847,0.00022554054,0.00021220915,0.00029930446,0.00032841257,0.0039913873,0.00016723367,0.000012996048],"category_scores_gemma":[0.00002524274,0.00025302317,0.000083386476,0.0004161435,0.00014207835,0.00078261195,0.00025979907,0.0004193227,0.000019584239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001455814,0.0015995316,0.00069450296,0.000009648737,0.00003381764,0.0000031891643,0.00020777338,0.044181824,0.011088986,0.78564817,0.004712047,0.15167494],"study_design_scores_gemma":[0.0007263677,0.00014074343,0.0022364443,0.00009354263,0.0000041649687,0.0000035221703,0.000021629376,0.9859897,0.00032931764,0.006615214,0.0035757716,0.00026358938],"about_ca_topic_score_codex":0.00031612205,"about_ca_topic_score_gemma":0.0058326456,"teacher_disagreement_score":0.94180787,"about_ca_system_score_codex":0.00028003362,"about_ca_system_score_gemma":0.00015671624,"threshold_uncertainty_score":0.9999922},"labels":[],"label_agreement":null},{"id":"W2121663390","doi":"10.1109/icc.2006.254807","title":"Performance Modelling of the Multicast Balanced Gamma Switch","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Multicast; Computer science; Computer network; Unicast; Xcast; Source-specific multicast; Protocol Independent Multicast; Pragmatic General Multicast; Distributed computing","score_opus":0.10975263391100584,"score_gpt":0.29517420692971386,"score_spread":0.185421573018708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121663390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10154449,0.000049122064,0.6482722,0.0067668753,0.0022052317,0.0003459295,0.000030964296,0.00012260908,0.24066256],"genre_scores_gemma":[0.99229646,0.000063261905,0.005620647,0.00012502696,0.00009427055,0.000037632108,0.000008268678,0.000006621241,0.0017477863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988361,0.00009764178,0.00040468603,0.0001895108,0.00032603994,0.0001460479],"domain_scores_gemma":[0.9976996,0.0001196861,0.00023646808,0.0014360627,0.0004836936,0.000024482079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021489381,0.00011307853,0.00012475086,0.00008410164,0.00022237588,0.000104103005,0.003090093,0.00005338717,0.000029530085],"category_scores_gemma":[0.000011207616,0.000087953675,0.000088190616,0.00021817895,0.000102919636,0.0002444723,0.00024033524,0.00022277387,0.000044078384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000109620505,0.00024107516,0.0027776554,0.0000077006125,0.00003095732,3.2246882e-7,0.0002478782,0.13160175,0.0026123824,0.85747886,0.001970938,0.0030195215],"study_design_scores_gemma":[0.00017449318,0.000019877378,0.0016435202,0.000105134015,0.0000027094552,0.0000064178826,0.000024012365,0.992187,0.001264215,0.001651761,0.0028229582,0.00009789589],"about_ca_topic_score_codex":0.0003049964,"about_ca_topic_score_gemma":0.00015443859,"teacher_disagreement_score":0.890752,"about_ca_system_score_codex":0.00006200306,"about_ca_system_score_gemma":0.00006631216,"threshold_uncertainty_score":0.57422125},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06720011695716249,"score_gpt":0.287423843787456,"score_spread":0.2202237268302935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121780062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06370265,0.00013425518,0.77607167,0.0021327662,0.0009885064,0.0005975417,0.0010467456,0.00022913897,0.15509672],"genre_scores_gemma":[0.99154544,0.0001687819,0.0077700308,0.000039913913,0.000043855925,0.000038132745,0.00008397367,0.000016749098,0.0002931466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931747,0.000054182354,0.00027547847,0.000100802026,0.0001509508,0.0001011457],"domain_scores_gemma":[0.99872637,0.00041425906,0.00010422181,0.00051821175,0.000214046,0.000022909837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012122301,0.0001150127,0.000111638066,0.000101423204,0.00011277762,0.000042623084,0.00049303216,0.00004427318,0.0000565881],"category_scores_gemma":[0.00005668757,0.00010159788,0.000021280463,0.00009665182,0.00012295644,0.00009343413,0.00003778333,0.0001829849,0.000019858157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004511594,0.000054002157,0.00010066391,0.000010795217,0.000030069945,2.4113822e-7,0.00017677112,0.14345694,0.0030522852,0.85022175,0.0025160217,0.0003759563],"study_design_scores_gemma":[0.00032587035,0.000045535464,0.0006725633,0.00018785187,0.000016136073,0.000004815971,0.00014277222,0.9496642,0.0047589373,0.042268563,0.0016680394,0.00024473862],"about_ca_topic_score_codex":0.00012676157,"about_ca_topic_score_gemma":0.0001405682,"teacher_disagreement_score":0.9278428,"about_ca_system_score_codex":0.00006885569,"about_ca_system_score_gemma":0.000012718921,"threshold_uncertainty_score":0.4143041},"labels":[],"label_agreement":null},{"id":"W2122198105","doi":"10.1109/icc.2006.254726","title":"Traffic Engineering in BFWA Mesh Networks at Millimeter Wave Band","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Wireless mesh network; Scalability; Mesh networking; Computer network; Extremely high frequency; Distributed computing; Channel (broadcasting); Interference (communication); Channel allocation schemes; Radio spectrum; Control reconfiguration; Electronic engineering; Wireless; Wireless network; Telecommunications; Engineering","score_opus":0.06271020328224598,"score_gpt":0.2661835124456546,"score_spread":0.2034733091634086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122198105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6962306,0.00065477175,0.17892703,0.0015976329,0.0013824232,0.00060299144,0.00011036114,0.0006891897,0.11980501],"genre_scores_gemma":[0.99611336,0.0005795618,0.002108026,0.00009049702,0.00010528095,0.00008151224,0.00023400549,0.000035646382,0.0006521376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889994,0.000038006652,0.0004316275,0.00018923811,0.0002014976,0.00023967493],"domain_scores_gemma":[0.99906874,0.000114913695,0.00005191705,0.0005940634,0.00011573005,0.000054611195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015337081,0.00019727608,0.00016405033,0.00027695525,0.00008145086,0.00007841783,0.0005411065,0.0001044591,0.0002706613],"category_scores_gemma":[0.000014085515,0.00021944422,0.000073239185,0.00016170052,0.00004141485,0.00013440252,0.00006126893,0.00034556218,0.00008345984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013062037,0.00010461087,0.00018469714,0.000010070809,0.00004658889,0.000003984221,0.00012611996,0.97382015,0.014384519,0.005448166,0.0026636706,0.0031943393],"study_design_scores_gemma":[0.00040028594,0.000014719558,0.00062170095,0.00007632063,0.0000072638763,0.0000068230206,0.000012917919,0.99235415,0.003802381,0.0001522608,0.0023183657,0.00023280563],"about_ca_topic_score_codex":0.00005103388,"about_ca_topic_score_gemma":0.0006232063,"teacher_disagreement_score":0.29988274,"about_ca_system_score_codex":0.00024291247,"about_ca_system_score_gemma":0.000016598622,"threshold_uncertainty_score":0.89486754},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.040872627343993884,"score_gpt":0.2820153879959392,"score_spread":0.24114276065194534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122966624","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97118825,0.000061372906,0.01579557,0.0007460075,0.00023397601,0.00032900838,0.000004844988,0.00008359492,0.011557391],"genre_scores_gemma":[0.99484205,0.00030212384,0.0041939714,0.00004478895,0.000039880324,0.00007591795,0.00003286136,0.000012772189,0.00045563388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998288,0.00017947805,0.0005508593,0.0003746858,0.0003573621,0.00024964646],"domain_scores_gemma":[0.9978918,0.00022200467,0.00024733727,0.0012744203,0.0003197941,0.000044679262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034524302,0.00018144194,0.00022600435,0.0002959784,0.0001525004,0.00012723336,0.0017916446,0.00008454323,0.000008924772],"category_scores_gemma":[0.000010167264,0.00019296234,0.000030209636,0.0005425072,0.00012356216,0.00035893312,0.00024788987,0.00030047595,0.0000067772116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022169903,0.0016151794,0.011180712,0.0000071624204,0.000021599246,0.0000020645637,0.00036705297,0.8786128,0.0005234052,0.100898504,0.0001063898,0.006642938],"study_design_scores_gemma":[0.0006401464,0.0001231059,0.017037386,0.00009356034,0.0000056338818,0.0000049014147,0.00017807275,0.9813898,0.00014883625,0.00007754404,0.00012615557,0.0001748653],"about_ca_topic_score_codex":0.0007034157,"about_ca_topic_score_gemma":0.0016343471,"teacher_disagreement_score":0.10277697,"about_ca_system_score_codex":0.00009438535,"about_ca_system_score_gemma":0.00005981341,"threshold_uncertainty_score":0.7868776},"labels":[],"label_agreement":null},{"id":"W2123591316","doi":"10.1109/icc.2006.255184","title":"A Fast Class-of-Service Packet Scheduling for Ethernet Passive Optical Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Lakehead University","funders":"","keywords":"Computer science; Computer network; Dynamic bandwidth allocation; Round-robin scheduling; Dynamic priority scheduling; Fair-share scheduling; Scheduling (production processes); Passive optical network; Distributed computing; Quality of service; Engineering; Wavelength-division multiplexing","score_opus":0.061948780434551765,"score_gpt":0.3084563301606151,"score_spread":0.2465075497260633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123591316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103118114,0.00062346907,0.5934851,0.029408917,0.0017319839,0.0013564674,0.0006038408,0.0018263675,0.26784572],"genre_scores_gemma":[0.9372842,0.00021092228,0.061734114,0.00013315384,0.00013378078,0.00017106599,0.00019077868,0.00003145154,0.00011053674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897385,0.00002470405,0.00040378913,0.00016866012,0.0001870005,0.00024201836],"domain_scores_gemma":[0.99811476,0.00050445815,0.00008956539,0.0008109333,0.0004400747,0.000040195646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000108521,0.00017673179,0.00019935185,0.00011763471,0.00007994247,0.00006685217,0.0013218701,0.00019106994,0.00004962763],"category_scores_gemma":[0.000065806315,0.0001844006,0.00008041927,0.00021333234,0.00018061383,0.00010826908,0.00012444568,0.0004020982,0.000037162343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016469654,0.00010977002,0.00011689024,0.000012406856,0.000064907355,4.2095587e-7,0.000020886797,0.24810597,0.0011206169,0.74123126,0.0021049175,0.007095483],"study_design_scores_gemma":[0.00029445183,0.00003984345,0.00034839453,0.00010641052,0.00001804479,0.0000019490078,0.000102610444,0.9819627,0.0009366088,0.012304671,0.0036910572,0.00019327505],"about_ca_topic_score_codex":0.00004863073,"about_ca_topic_score_gemma":0.0004690743,"teacher_disagreement_score":0.8341661,"about_ca_system_score_codex":0.000091573434,"about_ca_system_score_gemma":0.000031839267,"threshold_uncertainty_score":0.75196385},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05738829357480846,"score_gpt":0.30233308647341284,"score_spread":0.24494479289860438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124281857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6235238,0.00043188487,0.16113764,0.025935015,0.0035737818,0.0022572903,0.0006081808,0.004223525,0.1783089],"genre_scores_gemma":[0.9809947,0.00027820826,0.017157728,0.00004668222,0.00010929592,0.0005712812,0.0003869127,0.00006136187,0.00039382582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832356,0.000048114598,0.0006173199,0.00030945078,0.0003378247,0.0003637113],"domain_scores_gemma":[0.99706537,0.00042159343,0.00009895856,0.0017270538,0.000597975,0.00008906601],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019772764,0.00029468996,0.00027711075,0.00028842597,0.00023697401,0.00018798753,0.0020675259,0.0003032434,0.00008273165],"category_scores_gemma":[0.0001643561,0.00031827204,0.0001359251,0.00027318273,0.00043186266,0.00027798343,0.00020953002,0.00059611205,0.00013113578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007353698,0.00054782967,0.00016001282,0.000015909596,0.00015054781,0.0000011990898,0.00008764573,0.011839645,0.066227496,0.9031242,0.004188341,0.013583618],"study_design_scores_gemma":[0.0013405816,0.00013447794,0.0013128087,0.00013410878,0.000030141788,0.000019422336,0.00030622206,0.89082325,0.07515037,0.01774823,0.012261065,0.00073930976],"about_ca_topic_score_codex":0.00003494678,"about_ca_topic_score_gemma":0.00005252738,"teacher_disagreement_score":0.885376,"about_ca_system_score_codex":0.0002487068,"about_ca_system_score_gemma":0.000049226568,"threshold_uncertainty_score":0.9999269},"labels":[],"label_agreement":null},{"id":"W2126302403","doi":"10.1109/icc.2006.254728","title":"Modeling and Analysis of Fair Rate Calculation in Resilient Packet Ring Conservative Mode","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Node (physics); Network packet; Upstream (networking); Bandwidth (computing); Engineering","score_opus":0.09284567089556628,"score_gpt":0.36389482125928097,"score_spread":0.2710491503637147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126302403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2523564,0.00005228548,0.72856146,0.003666386,0.00007718438,0.00091685075,0.00007376515,0.000051487117,0.014244183],"genre_scores_gemma":[0.9905221,0.00006917434,0.008889816,0.00008049326,0.000012270395,0.0002586668,0.00007655597,0.0000042606066,0.00008665981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885213,0.00018254535,0.000418343,0.00022882433,0.00019788236,0.00012029933],"domain_scores_gemma":[0.9985712,0.00021381941,0.00015755772,0.0007179502,0.00031092827,0.00002853044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003250216,0.00010449036,0.00019192463,0.0003990011,0.000088015804,0.00009802671,0.000939595,0.00005129737,0.000008505911],"category_scores_gemma":[0.000022553915,0.000106988075,0.000053940377,0.0005855193,0.00007491388,0.00028580017,0.00018414782,0.00016022938,0.0000022723648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012629221,0.00009581654,0.0070619313,0.0000026363184,0.00006000042,5.690921e-7,0.00021912264,0.48155847,0.0005890383,0.50914675,0.000039637616,0.0012134043],"study_design_scores_gemma":[0.00021792337,0.000015404794,0.01952653,0.00006879096,0.000015274607,3.424811e-7,0.000023300587,0.96956056,0.00018533954,0.010230515,0.00005748861,0.00009849844],"about_ca_topic_score_codex":0.0020269034,"about_ca_topic_score_gemma":0.0038784626,"teacher_disagreement_score":0.7381657,"about_ca_system_score_codex":0.000063691856,"about_ca_system_score_gemma":0.000060522118,"threshold_uncertainty_score":0.43628472},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.14620772945645497,"score_gpt":0.3518665285425901,"score_spread":0.20565879908613513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127932079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045655794,0.0012116861,0.7682798,0.016088706,0.0008129517,0.0006505002,0.000026751912,0.00037644967,0.16689736],"genre_scores_gemma":[0.9843351,0.0030891297,0.011137883,0.0006428793,0.00005789641,0.00005013218,0.00007515158,0.000011603998,0.0006001801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981177,0.00037298285,0.0004863825,0.00039010603,0.00034709784,0.00028575727],"domain_scores_gemma":[0.9971302,0.00045120216,0.00021264837,0.0015933609,0.0005636223,0.0000489241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036837312,0.00022133363,0.00022418893,0.0001864902,0.00085373013,0.0003011556,0.004115113,0.00008975984,0.00006315897],"category_scores_gemma":[0.000044755772,0.00023601073,0.0000696706,0.00065654964,0.00016550778,0.0007982603,0.0019832668,0.0005989858,0.000041817537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015273783,0.00036315797,0.0041714073,0.0000020203984,0.000026739666,0.0000041903336,0.0010958129,0.02179811,0.00059698254,0.94844186,0.0010530057,0.022431416],"study_design_scores_gemma":[0.00065473065,0.000056514582,0.008222968,0.00017671987,0.0000046553873,0.000003994673,0.000116339645,0.9824749,0.00015791136,0.0040296344,0.0037670012,0.00033457982],"about_ca_topic_score_codex":0.00017079547,"about_ca_topic_score_gemma":0.0025444818,"teacher_disagreement_score":0.96067685,"about_ca_system_score_codex":0.00027157212,"about_ca_system_score_gemma":0.0001078853,"threshold_uncertainty_score":0.9624238},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06709238678803496,"score_gpt":0.37955372958572425,"score_spread":0.3124613427976893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127936354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044282707,0.0002670364,0.95581853,0.01527404,0.0006212336,0.00031177758,0.000029759343,0.00030592544,0.022943418],"genre_scores_gemma":[0.79147804,0.00011666002,0.20683564,0.00027904828,0.00006432584,0.000093440154,0.000058312573,0.000008705643,0.0010657989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852777,0.00021522859,0.00041888136,0.00034074255,0.00028850455,0.00020890501],"domain_scores_gemma":[0.99805033,0.00032915972,0.0002119677,0.0010573928,0.00027560952,0.00007554115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037276512,0.00018248468,0.00017978813,0.00018106485,0.0002990885,0.00037671003,0.0018708487,0.00007523293,0.000044678367],"category_scores_gemma":[0.000030132787,0.00018665809,0.00005975029,0.00020726163,0.0001379043,0.00041011896,0.00021366702,0.00026505603,0.00009393639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008277261,0.00020470987,0.00006789756,0.000002358273,0.00003112809,7.395144e-7,0.00005636398,0.0059119766,0.00032259387,0.683676,0.0043460764,0.30537188],"study_design_scores_gemma":[0.0006087261,0.00004501459,0.0009440289,0.000032893375,0.000012989692,0.000007650277,0.000029403418,0.9798089,0.00009135421,0.007190453,0.011038468,0.00019010264],"about_ca_topic_score_codex":0.0000986485,"about_ca_topic_score_gemma":0.00013706597,"teacher_disagreement_score":0.9738969,"about_ca_system_score_codex":0.00007207189,"about_ca_system_score_gemma":0.00008847767,"threshold_uncertainty_score":0.76116955},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09994237916741898,"score_gpt":0.33184745338756516,"score_spread":0.23190507422014617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129447772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021053092,0.00075517135,0.9825663,0.0013145878,0.00052717346,0.0014250729,0.00096716225,0.00029858432,0.010040636],"genre_scores_gemma":[0.9753341,0.00016647282,0.02243607,0.000021504182,0.00014069836,0.00040107436,0.0011043942,0.000036778638,0.000358879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905074,0.000035456505,0.00037086892,0.00020967203,0.00016589438,0.00016736706],"domain_scores_gemma":[0.99783397,0.00036475528,0.00011238451,0.0013598107,0.00030567654,0.000023408533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018357136,0.0001579623,0.00013846792,0.00011219591,0.00014858368,0.00011579867,0.0015957175,0.00006459057,0.0000065730037],"category_scores_gemma":[0.00004983852,0.00012349567,0.000019845163,0.00016858928,0.00007785519,0.00036083945,0.00008219186,0.0002170435,0.000014453754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021841659,0.000095828356,0.0012607459,0.000027929316,0.000029339675,4.6071136e-7,0.00008330841,0.9897685,0.00041169213,0.004370689,0.000768485,0.0031611468],"study_design_scores_gemma":[0.00059018633,0.000013033589,0.00033680454,0.0001991135,0.000010825147,0.00000335545,0.00022592625,0.9912955,0.000093000155,0.000071083334,0.0070111044,0.00015005979],"about_ca_topic_score_codex":0.0006579331,"about_ca_topic_score_gemma":0.005035481,"teacher_disagreement_score":0.9732288,"about_ca_system_score_codex":0.000118221564,"about_ca_system_score_gemma":0.000053440275,"threshold_uncertainty_score":0.5036007},"labels":[],"label_agreement":null},{"id":"W2129771257","doi":"10.1109/icc.2006.255634","title":"A Protocol for Interactive Streaming of Image-Based Scenes over Wireless Ad-hoc Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Wireless ad hoc network; Rendering (computer graphics); Computer network; Mobile ad hoc network; Multimedia; Mobile device; Real Time Streaming Protocol; Mobile computing; Wireless; The Internet; Network packet; Computer graphics (images); World Wide Web; Telecommunications","score_opus":0.09469278749983699,"score_gpt":0.386399444454753,"score_spread":0.291706656954916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129771257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017120204,0.000025662297,0.96832097,0.004671077,0.00025543186,0.014887813,0.00006188728,0.00039778557,0.009667385],"genre_scores_gemma":[0.89388317,0.000015238711,0.055339158,0.00011208062,0.000034815774,0.050302982,0.000030565017,0.000012791385,0.00026921846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988084,0.00007991525,0.00039935313,0.0002807009,0.00025496638,0.00017666596],"domain_scores_gemma":[0.9971765,0.0004639084,0.00038241834,0.0012936522,0.0006558427,0.000027653454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015217546,0.000164326,0.00017851985,0.00022750146,0.00018333198,0.00017992433,0.0031555058,0.000083794686,0.000026255055],"category_scores_gemma":[0.000052435567,0.00015150539,0.00010574626,0.00020589097,0.0001809337,0.0003292901,0.00033047405,0.00023119093,0.000006090264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029576395,0.0019383039,0.0009119125,0.000061457235,0.00009894375,0.0000023937052,0.00015665342,0.0044873683,0.018951163,0.73513776,0.012889603,0.22506869],"study_design_scores_gemma":[0.0010676259,0.00016200771,0.00090917444,0.00047475164,0.000005417908,0.0000014628147,0.000055642795,0.9550429,0.019696025,0.013345765,0.00901411,0.00022509592],"about_ca_topic_score_codex":0.00006744976,"about_ca_topic_score_gemma":0.000102889055,"teacher_disagreement_score":0.95055556,"about_ca_system_score_codex":0.000076030396,"about_ca_system_score_gemma":0.0001249345,"threshold_uncertainty_score":0.61782104},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04859452152153041,"score_gpt":0.3282966524921064,"score_spread":0.27970213097057595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130148470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011942461,0.0011737866,0.8860889,0.0050881077,0.002477824,0.0013454449,0.0006337224,0.002803022,0.08844673],"genre_scores_gemma":[0.7176302,0.0013026923,0.2783299,0.00023465022,0.00032188505,0.0005529255,0.0010428578,0.00006249485,0.00052238296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877876,0.000029718954,0.00040514974,0.00023226804,0.0002033975,0.00035069784],"domain_scores_gemma":[0.99838275,0.00034287683,0.00009570199,0.00088236877,0.00024869762,0.000047582813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011032657,0.00022630364,0.00019708845,0.00013164702,0.00020022465,0.00010300798,0.0012643597,0.0001499097,0.0000755759],"category_scores_gemma":[0.00002082238,0.0002489137,0.00009744912,0.00017774454,0.00018281651,0.0002001277,0.00011639424,0.00035343485,0.0000992451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030258361,0.0003003683,0.00016253316,0.000016603524,0.00018404737,0.000002886582,0.000030601368,0.32409474,0.0053317114,0.53123146,0.05315238,0.085462384],"study_design_scores_gemma":[0.0003365547,0.00006351104,0.00031936227,0.00008161705,0.00001964293,0.000005345856,0.000023385837,0.89445436,0.00093039265,0.05289657,0.05057815,0.0002910982],"about_ca_topic_score_codex":0.000047770387,"about_ca_topic_score_gemma":0.00033451,"teacher_disagreement_score":0.7056877,"about_ca_system_score_codex":0.00020783329,"about_ca_system_score_gemma":0.00002494736,"threshold_uncertainty_score":0.9999963},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09538596805359514,"score_gpt":0.33776628548171894,"score_spread":0.2423803174281238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130788090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019038719,0.0003070326,0.87505263,0.065127544,0.0004016679,0.00074467994,0.00028464754,0.00048352306,0.0556944],"genre_scores_gemma":[0.92639065,0.00071421306,0.06626273,0.0004205472,0.00008998877,0.00024105266,0.0008336765,0.000021523896,0.0050256094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982273,0.00024216018,0.00052494614,0.00038796183,0.00034670555,0.00027095233],"domain_scores_gemma":[0.9961985,0.00050288823,0.00024106652,0.002064459,0.0008953388,0.00009775372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003441115,0.0002352931,0.00023276205,0.00019536559,0.00062529166,0.00033553515,0.004087936,0.000110273824,0.0001154984],"category_scores_gemma":[0.00006255562,0.00023665039,0.00015329738,0.00041496276,0.00014475711,0.00035029816,0.0003239721,0.00032039973,0.00014613419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046410496,0.000773052,0.00006375,0.0000059747376,0.00006792946,0.0000012908309,0.00015391028,0.0016874953,0.029573308,0.9010324,0.040908813,0.025685672],"study_design_scores_gemma":[0.000984459,0.00008519981,0.0011810211,0.00012510939,0.000015209821,0.0000104114315,0.00001537582,0.785452,0.0024950437,0.0052387514,0.20404446,0.0003529336],"about_ca_topic_score_codex":0.000038882652,"about_ca_topic_score_gemma":0.00010968638,"teacher_disagreement_score":0.9244868,"about_ca_system_score_codex":0.00017108949,"about_ca_system_score_gemma":0.00016142087,"threshold_uncertainty_score":0.9650323},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06984808571987601,"score_gpt":0.3008524928278922,"score_spread":0.23100440710801623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131133406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014604109,0.00038747024,0.9595241,0.0077519896,0.0006090374,0.00014580297,0.00012300185,0.00021279261,0.016641725],"genre_scores_gemma":[0.97944677,0.00072472554,0.018404476,0.0001823997,0.00008534054,0.000025838599,0.00081361603,0.000012756197,0.00030406867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847007,0.00016080901,0.00039724755,0.00045482832,0.00027512398,0.00024193694],"domain_scores_gemma":[0.99705255,0.00030875107,0.00018123252,0.0022265418,0.00017747314,0.000053477368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023926907,0.00017172236,0.00015127921,0.00018586325,0.00015430813,0.00027828038,0.0033614489,0.000098246666,0.0000112784755],"category_scores_gemma":[0.000034644123,0.00018598452,0.00002599622,0.000357738,0.00013484666,0.00043409702,0.0008151016,0.00025370208,0.000007840855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014218146,0.00036049073,0.0023312753,0.0000024358512,0.000025344172,0.000010520209,0.0000612423,0.24149115,0.0004693878,0.73214966,0.0021158787,0.020968383],"study_design_scores_gemma":[0.00028801573,0.000014185874,0.0031360455,0.00008226143,0.0000031731292,0.000009651339,0.000019978925,0.9891109,0.000099905854,0.001274758,0.0057748035,0.00018632536],"about_ca_topic_score_codex":0.0009640341,"about_ca_topic_score_gemma":0.002765736,"teacher_disagreement_score":0.9648427,"about_ca_system_score_codex":0.00007471679,"about_ca_system_score_gemma":0.0000463795,"threshold_uncertainty_score":0.7584229},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05884201005555691,"score_gpt":0.3261076523359609,"score_spread":0.267265642280404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131665531","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076269857,0.00008829052,0.013445788,0.0023480542,0.001790047,0.022651695,0.00034382226,0.0010395264,0.9506658],"genre_scores_gemma":[0.9703097,0.000033970766,0.0016018902,0.00014339614,0.00031467504,0.025325362,0.00017302662,0.000038612765,0.002059364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986555,0.000079434794,0.00043108224,0.00022106846,0.00035127858,0.00026164338],"domain_scores_gemma":[0.9981584,0.00012442857,0.000086764834,0.0012798839,0.00028887237,0.000061665094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018821098,0.00022431942,0.00017830325,0.00013072396,0.00015505445,0.00015542806,0.0013829016,0.00012155898,0.00070465467],"category_scores_gemma":[0.000020515035,0.00023984953,0.00009200575,0.00015921635,0.00015853703,0.00023619174,0.00012243567,0.00045372552,0.00040037476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021500353,0.002221113,0.00537462,0.00013462637,0.0003342087,0.000013037396,0.0005134732,0.044703983,0.009648622,0.74035007,0.17875914,0.017732097],"study_design_scores_gemma":[0.0022905818,0.00007597394,0.005970951,0.00016670399,0.00003117136,0.000014620966,0.00005311835,0.4030914,0.0037916396,0.025538007,0.55818534,0.00079045596],"about_ca_topic_score_codex":0.0003810113,"about_ca_topic_score_gemma":0.0020027333,"teacher_disagreement_score":0.9626827,"about_ca_system_score_codex":0.00022392397,"about_ca_system_score_gemma":0.00005372136,"threshold_uncertainty_score":0.978078},"labels":[],"label_agreement":null},{"id":"W2134948485","doi":"10.1109/icc.2006.255410","title":"Optimal and Approximate Mobility Assisted Opportunistic Scheduling in Cellular Data Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of British Columbia","keywords":"Computer science; Scheduling (production processes); Constraint (computer-aided design); Dynamic priority scheduling; Mobility model; Mathematical optimization; Fair-share scheduling; Distributed computing; Computer network; Algorithm; Mathematics; Quality of service","score_opus":0.10293129158668685,"score_gpt":0.31475729204383396,"score_spread":0.2118260004571471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134948485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039616518,0.00034432329,0.9399432,0.0005096996,0.00033934292,0.00033249025,0.00021916941,0.00027571616,0.018419573],"genre_scores_gemma":[0.95804256,0.00084794644,0.03875142,0.00002424579,0.00007229737,0.00005543107,0.002097045,0.000027161104,0.00008189364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988983,0.000063689775,0.0004083206,0.00027207655,0.00016117797,0.0001964081],"domain_scores_gemma":[0.9982858,0.00014798401,0.00008550638,0.0013149676,0.00011639344,0.000049392704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023396383,0.00016865447,0.00016284936,0.00012983134,0.00009985749,0.00009856395,0.0011095399,0.000093793846,0.000040461982],"category_scores_gemma":[0.000030312704,0.0001988917,0.000018936704,0.0001856085,0.00013381145,0.00031221015,0.00023595885,0.00035914758,0.0000069419734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007802411,0.00010437829,0.0005683247,0.0000071736577,0.0000141830515,0.0000022111944,0.000013248513,0.976139,0.0005083783,0.020594254,0.00011438819,0.0019266475],"study_design_scores_gemma":[0.00025501673,0.00000726133,0.0013857693,0.000074798765,0.000008273344,0.0000033311908,0.000035613208,0.9969716,0.000048602975,0.00060068676,0.00042940516,0.00017961157],"about_ca_topic_score_codex":0.00007241197,"about_ca_topic_score_gemma":0.00031047722,"teacher_disagreement_score":0.91842604,"about_ca_system_score_codex":0.000111513014,"about_ca_system_score_gemma":0.00003071442,"threshold_uncertainty_score":0.81105685},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.058441837904731245,"score_gpt":0.3214503915157503,"score_spread":0.26300855361101905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135207211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066451705,0.00022941135,0.95746076,0.012669857,0.0009065758,0.0005407223,0.00006101045,0.0002966844,0.02717047],"genre_scores_gemma":[0.8651089,0.000091252594,0.13155316,0.0012596346,0.0003280066,0.00052042207,0.00035015814,0.000023635283,0.0007648372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819505,0.0001242021,0.00051358173,0.00043858433,0.00036976612,0.00035878422],"domain_scores_gemma":[0.9963234,0.0006750468,0.0003005797,0.0019154645,0.00070337456,0.00008213982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003606906,0.0002290763,0.00019163989,0.00016460424,0.00044917632,0.00043357647,0.0038654364,0.00012894848,0.0000709318],"category_scores_gemma":[0.000046622714,0.0002514981,0.00015285602,0.0003082912,0.00012793907,0.00037360698,0.00026457672,0.00037002107,0.000074840624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027006958,0.0003750258,0.0002549278,0.0000037759703,0.000037755286,0.0000017600177,0.00004487252,0.02263895,0.00056166836,0.9503874,0.013695139,0.011971684],"study_design_scores_gemma":[0.0005828248,0.00007543023,0.0004709888,0.00010344312,0.000007923087,0.000004346372,0.000009825728,0.96851134,0.00021141546,0.008521653,0.02123877,0.000262059],"about_ca_topic_score_codex":0.00006744907,"about_ca_topic_score_gemma":0.00034731318,"teacher_disagreement_score":0.94587237,"about_ca_system_score_codex":0.00020171494,"about_ca_system_score_gemma":0.00020764387,"threshold_uncertainty_score":0.99999374},"labels":[],"label_agreement":null},{"id":"W2136190208","doi":"10.1109/icc.2006.254808","title":"Delivering Reliable Real-Time Multicast Services over Virtual Private LAN Service","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Computer network; Computer science; Testbed; IP multicast; Pragmatic General Multicast; Xcast; Multiprotocol Label Switching; Source-specific multicast; Protocol Independent Multicast; Service provider; Quality of service; Service (business); Business","score_opus":0.028576039226420963,"score_gpt":0.2807428115821683,"score_spread":0.25216677235574736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136190208","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73844343,0.00012986448,0.008686127,0.00246798,0.0005237353,0.00039756417,0.00022117421,0.0027750318,0.24635507],"genre_scores_gemma":[0.9623573,0.0009200389,0.03574786,0.00012883205,0.00009040466,0.00006687043,0.00018387436,0.000042886426,0.00046196367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891716,0.00002031918,0.00034845728,0.00020784931,0.00024140297,0.0002648226],"domain_scores_gemma":[0.9984768,0.00014786643,0.000073022224,0.0010401567,0.00021511407,0.000047066897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007319184,0.00020936664,0.00017278155,0.00013382122,0.00013888498,0.000100976584,0.0015513747,0.00012400311,0.0002042919],"category_scores_gemma":[0.000011842868,0.0002263321,0.000044569173,0.000232839,0.000095390285,0.00029316221,0.00025533946,0.00034753067,0.00059981685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042555675,0.00034342005,0.0019571786,0.000050547922,0.00015881244,0.000009229239,0.00017008706,0.4392437,0.08929202,0.46107796,0.0018669515,0.005787526],"study_design_scores_gemma":[0.00033855028,0.000029064691,0.0036435444,0.00020456391,0.000013291559,0.0000037945597,0.000059574755,0.9795681,0.0012998249,0.005219921,0.009285985,0.00033378563],"about_ca_topic_score_codex":0.0005415398,"about_ca_topic_score_gemma":0.0007895,"teacher_disagreement_score":0.5403244,"about_ca_system_score_codex":0.00014932462,"about_ca_system_score_gemma":0.000014312317,"threshold_uncertainty_score":0.92295545},"labels":[],"label_agreement":null},{"id":"W2140107870","doi":"10.1109/icc.2006.255524","title":"Turbo Equalization for Alamouti Space-Time Block Coded Transmission","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Space–time block code; Computer science; Block code; Fading; MIMO; Algorithm; Decoding methods; Turbo; Turbo code; Equalization (audio); Coding gain; Convolutional code; Bit error rate; Channel (broadcasting); Electronic engineering; Telecommunications; Engineering","score_opus":0.05385649156617813,"score_gpt":0.325284449029882,"score_spread":0.2714279574637039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140107870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007916567,0.0006077567,0.7872105,0.010126175,0.00050132355,0.0017143373,0.0006569018,0.003050135,0.18821628],"genre_scores_gemma":[0.94653547,0.0008557788,0.048786815,0.00009376177,0.00008050576,0.0004051604,0.0009960306,0.000061018156,0.0021854776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987551,0.00007503391,0.0004884597,0.0002075281,0.00025793677,0.00021592689],"domain_scores_gemma":[0.99776757,0.00034286958,0.00013029097,0.0012787441,0.00042287746,0.00005765504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016398805,0.00023126113,0.00020194416,0.00022895503,0.00022004281,0.00009280495,0.0015228064,0.00013864535,0.00014000501],"category_scores_gemma":[0.000036753278,0.00025851285,0.00010217357,0.00018625658,0.00011773542,0.0002500784,0.000067059365,0.00025858436,0.0000917314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006394122,0.0005207621,0.00007495067,0.000045218945,0.00010989606,6.3078045e-7,0.00025916466,0.06894879,0.23495178,0.63885343,0.03446126,0.021710154],"study_design_scores_gemma":[0.00064530614,0.000051862397,0.00014858948,0.0001636769,0.00002233675,0.0000040098557,0.00003551627,0.7862428,0.076728016,0.021597076,0.11390296,0.00045787424],"about_ca_topic_score_codex":0.000043309545,"about_ca_topic_score_gemma":0.000051402218,"teacher_disagreement_score":0.9386189,"about_ca_system_score_codex":0.00018603026,"about_ca_system_score_gemma":0.000041496416,"threshold_uncertainty_score":0.9999867},"labels":[],"label_agreement":null},{"id":"W2141655399","doi":"10.1109/icc.2006.255701","title":"Effect of chromatic dispersion on fiber over wireless systems","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Photonic Communication Systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton; Université du Québec à Trois-Rivières","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Wireless network; Wireless; Base station; Wi-Fi array; Wireless WAN; Fixed wireless; Mobile ad hoc network; Distributed computing; Telecommunications; Network packet","score_opus":0.0284319002610365,"score_gpt":0.30986601229894983,"score_spread":0.28143411203791335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141655399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5522129,0.0005750409,0.0022116057,0.00043309113,0.0012673077,0.0010666546,0.00032649047,0.00048420034,0.44142273],"genre_scores_gemma":[0.99773806,0.00022492699,0.00018714106,0.00001366886,0.000057260673,0.00019547735,0.00017482616,0.000036028574,0.0013725789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852604,0.00021780937,0.0005356861,0.00016417015,0.00039489008,0.00016139395],"domain_scores_gemma":[0.9971013,0.00066580076,0.00018463838,0.0018389283,0.00016528224,0.000044031003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026198995,0.00021765579,0.0002841211,0.00019784545,0.00010263976,0.000055287994,0.0014557166,0.00009159163,0.00021826319],"category_scores_gemma":[0.000022986605,0.0002069847,0.0000956641,0.00017732967,0.000120992496,0.00014093597,0.00009377136,0.00029720963,0.0002935894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029011606,0.0012368211,0.0022104143,0.000804422,0.0006295769,0.0000057163174,0.00060541,0.34052613,0.1149942,0.48747525,0.024898253,0.026323669],"study_design_scores_gemma":[0.0013277791,0.00028342434,0.0013073904,0.001206152,0.000038796552,0.000011626052,0.00007577716,0.9455809,0.017966485,0.0004154122,0.031277034,0.00050921744],"about_ca_topic_score_codex":0.00025916338,"about_ca_topic_score_gemma":0.000063363186,"teacher_disagreement_score":0.60505474,"about_ca_system_score_codex":0.00024799968,"about_ca_system_score_gemma":0.000024696563,"threshold_uncertainty_score":0.8440591},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07366207296990472,"score_gpt":0.31033938229154173,"score_spread":0.236677309321637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142145488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5843911,0.00048717056,0.39772746,0.0005833091,0.0006197199,0.00037001213,0.00011868059,0.0002654963,0.0154370265],"genre_scores_gemma":[0.93096215,0.00043955384,0.0681386,0.00003140197,0.00013001909,0.000046178495,0.00014359089,0.000036292673,0.000072235656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998863,0.00006122898,0.000389013,0.00022746793,0.00021156251,0.00024776236],"domain_scores_gemma":[0.99911124,0.00014768545,0.00009925983,0.0004078332,0.00018272738,0.000051257106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001360716,0.0002091069,0.00018409925,0.00029013943,0.00014331017,0.00009940433,0.00049429364,0.000101685706,0.00002861827],"category_scores_gemma":[0.000020534828,0.00025344169,0.000037745176,0.00025345126,0.00012056211,0.00038401945,0.00010022536,0.00038258787,0.000010279966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013407329,0.000051448347,0.0006170599,0.000004252729,0.000021016442,0.0000022134257,0.00010320656,0.9600203,0.0017403809,0.036380336,0.00003976273,0.0010065985],"study_design_scores_gemma":[0.0003596649,0.000016627338,0.00078675296,0.0001884558,0.000007558412,0.000008347291,0.0001399703,0.9962224,0.00043539138,0.001393025,0.00019805657,0.00024378646],"about_ca_topic_score_codex":0.00008270777,"about_ca_topic_score_gemma":0.0003195198,"teacher_disagreement_score":0.346571,"about_ca_system_score_codex":0.00021986013,"about_ca_system_score_gemma":0.00004231702,"threshold_uncertainty_score":0.9999918},"labels":[],"label_agreement":null},{"id":"W2143225590","doi":"10.1109/icc.2006.255477","title":"Enhanced QoS Provisioning in Distributed Wireless Access","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Quality of service; Provisioning; Throughput; Channel (broadcasting); Wireless Multimedia Extensions; Wireless; Scheme (mathematics); Term (time); Real-time computing; Distributed computing; Wireless network; Telecommunications; Wi-Fi array","score_opus":0.08532469804669834,"score_gpt":0.37162878787795567,"score_spread":0.2863040898312573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143225590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014784032,0.000036458645,0.8516391,0.012773604,0.00074689515,0.0023143527,0.00009045094,0.0002732828,0.11734185],"genre_scores_gemma":[0.9935504,0.00005690348,0.003887894,0.0002182374,0.00012296028,0.0015509198,0.00014981866,0.0000101511305,0.00045271814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984429,0.00014765405,0.00045172172,0.0003472187,0.00035132558,0.0002591666],"domain_scores_gemma":[0.99784434,0.00021901351,0.00021028766,0.0013613509,0.00031320142,0.000051813797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024579873,0.00016953463,0.00017299644,0.00019656803,0.00015661123,0.0006110574,0.005094504,0.000084994215,0.00005138341],"category_scores_gemma":[0.000023288172,0.00016964841,0.00005722054,0.0004777104,0.000091846865,0.0007409106,0.0005809515,0.00036610223,0.00006505463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019676936,0.0004692384,0.0014919438,0.000005589599,0.000013578007,0.0000046060673,0.00009135227,0.0049502323,0.0020865684,0.9627044,0.0040514073,0.024111377],"study_design_scores_gemma":[0.0011437361,0.000077737044,0.015200805,0.0004690781,0.0000037966986,0.0000057381453,0.000031582204,0.92913324,0.005544103,0.034287762,0.013551049,0.00055137],"about_ca_topic_score_codex":0.0005792001,"about_ca_topic_score_gemma":0.0010852702,"teacher_disagreement_score":0.9787664,"about_ca_system_score_codex":0.00013378775,"about_ca_system_score_gemma":0.0001462186,"threshold_uncertainty_score":0.946694},"labels":[],"label_agreement":null},{"id":"W2143932820","doi":"10.1109/icc.2006.255486","title":"Performance Analysis of Convolutional Codes over Fading Channels with Maximum Ratio Combining Diversity","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rician fading; Convolutional code; Additive white Gaussian noise; Fading; Rayleigh fading; Viterbi decoder; Computer science; Bit error rate; Algorithm; Nakagami distribution; Maximal-ratio combining; Viterbi algorithm; Diversity combining; Electronic engineering; Decoding methods; Telecommunications; White noise; Engineering","score_opus":0.05112931825113507,"score_gpt":0.29097537937624,"score_spread":0.23984606112510495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143932820","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68304485,0.00014532705,0.21474117,0.00063856377,0.00025687678,0.00039529582,0.00048022834,0.00070621906,0.09959148],"genre_scores_gemma":[0.99185675,0.0004667328,0.0068535013,0.00003461061,0.000020024407,0.00006089575,0.00050915073,0.000018173647,0.00018016393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887353,0.00005536487,0.00038494973,0.00016317562,0.00036156413,0.00016140989],"domain_scores_gemma":[0.9981507,0.00019102015,0.00018975718,0.0009962642,0.00043527046,0.000036972273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001477379,0.00017816968,0.00026730838,0.00051630253,0.00030436565,0.000042483374,0.0013706938,0.00007043244,0.00015082845],"category_scores_gemma":[0.000010460286,0.00018974282,0.00008440784,0.00056624966,0.00026690928,0.0003420744,0.0002607277,0.000272409,0.000010023511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005414002,0.00032507814,0.050374493,0.000023156314,0.0010596771,8.656044e-7,0.00043955666,0.708274,0.0092865275,0.22777501,0.00078832434,0.0015991598],"study_design_scores_gemma":[0.00034456913,0.00004420199,0.030829823,0.00010442523,0.00012926817,0.0000016446322,0.00008015499,0.9603802,0.005732697,0.0015433758,0.0005397132,0.0002699607],"about_ca_topic_score_codex":0.00022383008,"about_ca_topic_score_gemma":0.00033498154,"teacher_disagreement_score":0.3088119,"about_ca_system_score_codex":0.00017978196,"about_ca_system_score_gemma":0.000034534944,"threshold_uncertainty_score":0.77374876},"labels":[],"label_agreement":null},{"id":"W2144001349","doi":"10.1109/icc.2006.255752","title":"On the Optimal Phase Control in MIMO Systems with Phase Quantization","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"MIMO; Quantization (signal processing); Phase control; Wireless; Phase (matter); Computer science; Constant (computer programming); Optimal control; Control theory (sociology); Mathematics; Mathematical optimization; Topology (electrical circuits); Control (management); Algorithm; Telecommunications; Physics; Combinatorics; Antenna (radio)","score_opus":0.10809659300969633,"score_gpt":0.3638260656193581,"score_spread":0.2557294726096618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144001349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03011751,0.0002883057,0.85441476,0.042890914,0.0004714815,0.0010110578,0.0001016993,0.0002087197,0.07049555],"genre_scores_gemma":[0.99632424,0.00029922696,0.0016338218,0.00083381985,0.000052243493,0.0002547309,0.000103157596,0.000012346304,0.00048643243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981727,0.00049072865,0.00043949785,0.0002940233,0.0003955453,0.00020748227],"domain_scores_gemma":[0.9965951,0.0007042496,0.00023381787,0.0019288986,0.00049185136,0.000046077752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000493353,0.00019477279,0.00017653577,0.00024056766,0.00038271231,0.00046032693,0.0033972254,0.00005413516,0.000074698175],"category_scores_gemma":[0.000056944948,0.00014558305,0.000046858673,0.0004883798,0.00016658567,0.00034939678,0.00015592482,0.00040808658,0.000089960595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058760004,0.0009946184,0.000071617294,0.000001127035,0.000021678627,0.0000022837344,0.00012995588,0.00992306,0.000865903,0.98287123,0.002517655,0.0025421092],"study_design_scores_gemma":[0.0028700116,0.00023269709,0.00017410988,0.00015224596,0.0000056758054,0.0000069698904,0.00006944944,0.9851705,0.00016482097,0.0012140496,0.009736645,0.0002028451],"about_ca_topic_score_codex":0.00011680082,"about_ca_topic_score_gemma":0.00045796885,"teacher_disagreement_score":0.9816572,"about_ca_system_score_codex":0.00013644941,"about_ca_system_score_gemma":0.00013230483,"threshold_uncertainty_score":0.63129467},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.14637469008109044,"score_gpt":0.3790275465780355,"score_spread":0.23265285649694506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144683195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012284888,0.000050488117,0.93359864,0.013453267,0.00082713534,0.003355878,0.00024310844,0.00029895178,0.035887618],"genre_scores_gemma":[0.94541353,0.00008542007,0.049898505,0.00027247155,0.00015480176,0.0016264817,0.00094070955,0.000012646408,0.0015954245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984455,0.000072746734,0.0005017308,0.000400425,0.0002985409,0.00028104993],"domain_scores_gemma":[0.99672085,0.00021578885,0.00028804646,0.0022854921,0.0004381877,0.00005161782],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00049968244,0.00017336232,0.000157766,0.000116792275,0.00032312036,0.00032214387,0.006031475,0.00006737852,0.00007154916],"category_scores_gemma":[0.00003024436,0.00016532131,0.000054293134,0.0002058717,0.000084391,0.00055854756,0.00046110517,0.00023879895,0.000099573794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098279095,0.0014757741,0.0012422131,0.000047683105,0.00013979666,0.0000026949551,0.00036035417,0.004630674,0.004443173,0.59481066,0.05108072,0.34166795],"study_design_scores_gemma":[0.0003352446,0.000087576904,0.0003797426,0.00009824008,0.0000050697763,0.000002947533,0.000017072858,0.93156797,0.0003605052,0.0010786687,0.06588008,0.00018687363],"about_ca_topic_score_codex":0.00009728616,"about_ca_topic_score_gemma":0.0002671552,"teacher_disagreement_score":0.93312865,"about_ca_system_score_codex":0.00008695929,"about_ca_system_score_gemma":0.00019618821,"threshold_uncertainty_score":0.9993464},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.040007340002035874,"score_gpt":0.29120700291012813,"score_spread":0.25119966290809226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145384758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14735615,0.0019713065,0.67787915,0.013666324,0.0011240384,0.0011881748,0.00010391917,0.00024773864,0.15646319],"genre_scores_gemma":[0.9957302,0.0009839102,0.0021263964,0.00043226517,0.000045923887,0.00016921075,0.00002181087,0.000008958342,0.0004812816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872255,0.00022522936,0.00031752867,0.00026815498,0.0002968092,0.0001697095],"domain_scores_gemma":[0.996452,0.001289985,0.00022717584,0.001708334,0.00028128686,0.000041221403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003826992,0.00014963432,0.00015459563,0.00008379677,0.00022859599,0.00014914369,0.0025316672,0.00007387455,0.0000875214],"category_scores_gemma":[0.000040190425,0.000121292804,0.000060457667,0.0002019548,0.0002469198,0.00019881043,0.00038789163,0.00037628307,0.000027008231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010909122,0.00021615242,0.00014128319,0.0000012094981,0.000023873092,0.0000010857543,0.000079790174,0.014383161,0.00017575554,0.96628493,0.0029984193,0.01568343],"study_design_scores_gemma":[0.00031920036,0.00016717374,0.002825147,0.00008409017,0.000006511346,0.000010568298,0.000025343132,0.9466152,0.00027792525,0.038827427,0.010640604,0.00020078522],"about_ca_topic_score_codex":0.00007459926,"about_ca_topic_score_gemma":0.00034035774,"teacher_disagreement_score":0.9322321,"about_ca_system_score_codex":0.000056337773,"about_ca_system_score_gemma":0.000059148304,"threshold_uncertainty_score":0.4946177},"labels":[],"label_agreement":null},{"id":"W2145566973","doi":"10.1109/icc.2006.254795","title":"Performance of Wireless Profiled TCP in Heterogeneous Wireless Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Throughput; Wireless; TCP acceleration; Transmission (telecommunications); TCP global synchronization; Computer network; Wireless network; Zeta-TCP; CUBIC TCP; TCP tuning; Heterogeneous network; TCP Friendly Rate Control; H-TCP; Telecommunications","score_opus":0.03547833174263766,"score_gpt":0.2772262848521024,"score_spread":0.24174795310946473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145566973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8160972,0.00021696583,0.119372584,0.0059192674,0.0011763487,0.00065361155,0.000036440837,0.00026694557,0.056260623],"genre_scores_gemma":[0.9969611,0.00033004704,0.0017390711,0.0001611291,0.00008383446,0.00012467192,0.000044102675,0.000010940165,0.00054508896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984311,0.00014357945,0.0005499284,0.00029540865,0.00033495206,0.00024505987],"domain_scores_gemma":[0.9979291,0.00018736008,0.00026103423,0.0012086055,0.00036570392,0.00004820492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024044955,0.000175378,0.00022708392,0.00020391779,0.000111426474,0.00009203985,0.0029123828,0.00009499395,0.00004410334],"category_scores_gemma":[0.000006971208,0.00018113288,0.00007352741,0.00034486398,0.00015325079,0.00026880775,0.00020714934,0.00030942823,0.000035547055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008458961,0.0009309692,0.013000748,0.000012005219,0.000057056997,0.000007792096,0.00013261824,0.09091375,0.0011678358,0.6926398,0.0010424026,0.2000104],"study_design_scores_gemma":[0.0005121664,0.00006346776,0.0034095093,0.00011145503,0.000004046336,0.000007758376,0.0000088138595,0.9942772,0.00042448117,0.0005078365,0.0004974374,0.00017584715],"about_ca_topic_score_codex":0.00015088063,"about_ca_topic_score_gemma":0.0004577677,"teacher_disagreement_score":0.9033634,"about_ca_system_score_codex":0.00008202696,"about_ca_system_score_gemma":0.00012178451,"threshold_uncertainty_score":0.73863846},"labels":[],"label_agreement":null},{"id":"W2145651918","doi":"10.1109/icc.2006.255080","title":"Interconnecting 802.15.4 clusters in slotted CSMA-CA mode","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer network; Computer science; Cluster (spacecraft); Carrier sense multiple access with collision avoidance; Collision; Distributed computing; Topology (electrical circuits); Throughput; Wireless; Engineering; Computer security; Telecommunications","score_opus":0.0836790709060221,"score_gpt":0.3549817972117935,"score_spread":0.2713027263057714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145651918","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036306147,0.00010070071,0.4421567,0.04289904,0.001600575,0.0034162467,0.000084783496,0.0005222697,0.47291353],"genre_scores_gemma":[0.98545754,0.000040569666,0.011908937,0.00063469406,0.00011630553,0.0009186803,0.000067863555,0.000014168328,0.0008412244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982851,0.00020803302,0.0005259076,0.0003685616,0.00032154625,0.0002908308],"domain_scores_gemma":[0.9976888,0.00033256022,0.00020767262,0.0014520623,0.00026088464,0.00005804652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032239698,0.00019516182,0.0001894363,0.00030157552,0.00018917686,0.0003596868,0.0037766756,0.00009853044,0.000108238106],"category_scores_gemma":[0.000037825717,0.00020435816,0.0000801116,0.00038130727,0.00009771631,0.00052910286,0.00046862088,0.00047267208,0.00017248154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027440441,0.00045931086,0.0020739401,0.000006876469,0.000028338298,0.00000777369,0.0003588272,0.015402525,0.0012578163,0.95811266,0.007508,0.014756481],"study_design_scores_gemma":[0.0005717117,0.00004938197,0.0016814573,0.00021368176,0.000002535421,0.000008898369,0.00006077931,0.96646464,0.00028672555,0.02264275,0.0077420943,0.0002753462],"about_ca_topic_score_codex":0.0011414735,"about_ca_topic_score_gemma":0.0040577366,"teacher_disagreement_score":0.9510621,"about_ca_system_score_codex":0.00017325312,"about_ca_system_score_gemma":0.0001112807,"threshold_uncertainty_score":0.83334845},"labels":[],"label_agreement":null},{"id":"W2146266469","doi":"10.1109/icc.2006.255459","title":"A Novel Multi-Dimensional Mapping of 8-PSK for BICM-ID","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Phase-shift keying; Computer science; Decoding methods; Algorithm; Constellation; Construct (python library); Antenna (radio); Bit error rate; Telecommunications; Computer network","score_opus":0.12304288196451009,"score_gpt":0.34601510083176534,"score_spread":0.22297221886725527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146266469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009003624,0.00030038058,0.9599798,0.0018223026,0.00039201192,0.0006876961,0.00097113923,0.0006978224,0.026145227],"genre_scores_gemma":[0.78176993,0.00018321321,0.21695064,0.00005879799,0.000035973,0.00026973546,0.0003880287,0.000030361254,0.00031335262],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989445,0.00002066279,0.0005096491,0.00015515574,0.00020729065,0.0001626942],"domain_scores_gemma":[0.99784994,0.000288746,0.00016063266,0.0011760402,0.00048982474,0.00003482675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014433237,0.00017137418,0.00019087855,0.00026702028,0.00012144121,0.000029535064,0.0014637258,0.00008880682,0.000050153394],"category_scores_gemma":[0.00004008517,0.00019464175,0.00008812549,0.00016131051,0.00015918864,0.00016731043,0.00012533205,0.00023019116,0.000019470313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025015259,0.0007878473,0.0002948366,0.000041233314,0.00011764154,2.4406995e-7,0.0001543984,0.039344963,0.550872,0.39551058,0.005666385,0.0071848305],"study_design_scores_gemma":[0.0010260455,0.00004320086,0.0019830363,0.00024798777,0.000011929062,0.0000067001724,0.00009200958,0.90084344,0.056328714,0.008186711,0.030797634,0.00043257073],"about_ca_topic_score_codex":0.00014297962,"about_ca_topic_score_gemma":0.00023943282,"teacher_disagreement_score":0.8614985,"about_ca_system_score_codex":0.00011300075,"about_ca_system_score_gemma":0.00004415075,"threshold_uncertainty_score":0.79372597},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05146023725527795,"score_gpt":0.3018598311065452,"score_spread":0.25039959385126725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146283190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021130277,0.0004539546,0.97411853,0.0014044738,0.0011944197,0.0010181236,0.000045074114,0.00041942493,0.01923299],"genre_scores_gemma":[0.9393056,0.0002033431,0.058848117,0.00009055163,0.00013087418,0.0010226396,0.00005609001,0.00001866908,0.0003241394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830097,0.0001701916,0.00050772616,0.00042016903,0.00029634094,0.00030460104],"domain_scores_gemma":[0.9974657,0.00032053347,0.00025706404,0.0014366404,0.0004596631,0.00006038044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034611308,0.00020808922,0.00019999512,0.00024154449,0.0002216359,0.00023682528,0.0028142836,0.00014442667,0.000009975682],"category_scores_gemma":[0.000012464781,0.00022856124,0.00010375127,0.00036975092,0.00006534835,0.0003757256,0.00024061058,0.00037272717,0.000044537403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001016713,0.0010129398,0.00036526768,0.000019006698,0.00006593976,0.000009089221,0.00027826012,0.012787785,0.00094619463,0.87972116,0.0015079529,0.10318475],"study_design_scores_gemma":[0.00064959266,0.00011362105,0.0011763975,0.00011237184,0.000011709075,0.000013820997,0.00006408105,0.9866058,0.00044433633,0.0019131256,0.008648277,0.0002468683],"about_ca_topic_score_codex":0.00015731131,"about_ca_topic_score_gemma":0.0027699794,"teacher_disagreement_score":0.973818,"about_ca_system_score_codex":0.00052163104,"about_ca_system_score_gemma":0.00010512828,"threshold_uncertainty_score":0.9320457},"labels":[],"label_agreement":null},{"id":"W2146609386","doi":"10.1109/icc.2006.255487","title":"Bit Error Probability Analysis of OFDM Systems in the Presence of Channel Estimation Error over Rayleigh and Ricean Fading Channels","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Orthogonal frequency-division multiplexing; Bit error rate; Rayleigh fading; Algorithm; Channel (broadcasting); Maximal-ratio combining; Mathematics; Computer science; Electronic engineering; Statistics; Telecommunications; Engineering","score_opus":0.08200144633665699,"score_gpt":0.33920240972073235,"score_spread":0.2572009633840754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146609386","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8114463,0.0009869172,0.16066046,0.0018050388,0.00030199645,0.0017172463,0.000545815,0.00032414455,0.022212053],"genre_scores_gemma":[0.9954366,0.00028460816,0.0038492465,0.000011889715,0.000011053561,0.00021228653,0.00014632684,0.000012503703,0.000035467547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858004,0.00019083828,0.00064215227,0.00015978716,0.0003017834,0.0001254185],"domain_scores_gemma":[0.99759316,0.0005272003,0.00028122356,0.0012880842,0.00028969668,0.00002065303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047364936,0.00014887094,0.0002840041,0.00052881247,0.00007135425,0.000041517804,0.0013611547,0.00007603551,0.000014557212],"category_scores_gemma":[0.0000807785,0.00013621857,0.00006847705,0.0007323511,0.00022504339,0.00025765167,0.00011055008,0.00024280311,0.0000012339414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013743912,0.0002919093,0.0022922491,0.00007062391,0.0001699891,2.5444805e-7,0.001107854,0.8349008,0.0043489872,0.15584879,0.00015126004,0.0008035289],"study_design_scores_gemma":[0.00014099068,0.0000198183,0.014545885,0.00014497436,0.000051871622,9.86593e-7,0.00021564995,0.97778666,0.0012800873,0.0055905855,0.00009961632,0.0001228527],"about_ca_topic_score_codex":0.0009861024,"about_ca_topic_score_gemma":0.00065295293,"teacher_disagreement_score":0.18399028,"about_ca_system_score_codex":0.00009358977,"about_ca_system_score_gemma":0.000022289705,"threshold_uncertainty_score":0.55548316},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.028203178565354654,"score_gpt":0.2714799582791193,"score_spread":0.24327677971376466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146929559","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92026746,0.00031282008,0.030244393,0.00038084458,0.00036411374,0.00016179401,0.00010101185,0.00019197147,0.04797561],"genre_scores_gemma":[0.9978048,0.0008150067,0.00085215643,0.000017675657,0.000042639484,0.0000368079,0.00031495438,0.000020913692,0.00009503889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988931,0.000083766776,0.00046692052,0.00017654047,0.0001933223,0.00018634721],"domain_scores_gemma":[0.9987401,0.0002936349,0.00011179813,0.0006687755,0.00014682581,0.000038878694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011526526,0.00018405123,0.00030056486,0.00040517427,0.00005662145,0.00009205988,0.00065974897,0.00011427316,0.000043524757],"category_scores_gemma":[0.000010131182,0.00019328065,0.000072676885,0.00040443425,0.00015281394,0.00013689295,0.00007594453,0.0003334828,0.000001812467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008866388,0.00012869696,0.015989585,0.000007475908,0.00029138083,0.0000016848176,0.000074555915,0.8820468,0.0014525527,0.09816182,0.00007190948,0.0017646599],"study_design_scores_gemma":[0.00019727882,0.000012841051,0.061002467,0.000077516095,0.00006554989,9.602518e-7,0.000102493184,0.9374893,0.00018332167,0.00059956504,0.00010231009,0.00016643663],"about_ca_topic_score_codex":0.00037256122,"about_ca_topic_score_gemma":0.005774778,"teacher_disagreement_score":0.09756225,"about_ca_system_score_codex":0.00007882997,"about_ca_system_score_gemma":0.00001606096,"threshold_uncertainty_score":0.78817564},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07100678099954745,"score_gpt":0.3296301567017113,"score_spread":0.25862337570216387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147163407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22008446,0.00031447303,0.74388546,0.003708497,0.00017255105,0.00022902322,0.000046063884,0.00013981698,0.03141968],"genre_scores_gemma":[0.9862803,0.0018692377,0.011120445,0.000096355485,0.000027803764,0.000058883477,0.00022571934,0.000011253554,0.00030995702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981416,0.00023331084,0.000582999,0.00032766582,0.0004747382,0.00023969759],"domain_scores_gemma":[0.9960922,0.00031144996,0.00021066655,0.0023591784,0.0009556524,0.000070859656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047960857,0.00017970966,0.00029468004,0.00071088737,0.00026191954,0.00023166351,0.004412749,0.00010186435,0.00003725018],"category_scores_gemma":[0.000020734633,0.00018027707,0.000098377575,0.0014620486,0.00025766034,0.00046690763,0.0007500893,0.00047917452,0.000009030018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021318048,0.00027705193,0.0044774525,0.000004619098,0.0003146952,5.489679e-7,0.00013212646,0.40726554,0.00043561557,0.5609612,0.0002302857,0.02587956],"study_design_scores_gemma":[0.00018179024,0.00003333943,0.004520319,0.000049785143,0.000038303922,0.0000017697033,0.000034445813,0.99361753,0.00009677619,0.0010557764,0.00020787626,0.00016229574],"about_ca_topic_score_codex":0.0007680349,"about_ca_topic_score_gemma":0.0008749964,"teacher_disagreement_score":0.7661959,"about_ca_system_score_codex":0.000092797636,"about_ca_system_score_gemma":0.000115730814,"threshold_uncertainty_score":0.82000583},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.13962884738936943,"score_gpt":0.34434574005644847,"score_spread":0.20471689266707904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148446350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005117576,0.00028875205,0.8593283,0.00058400567,0.00035285103,0.00087381364,0.00034136558,0.0010782428,0.13203508],"genre_scores_gemma":[0.83106536,0.0003807274,0.16586436,0.000052851887,0.000104537336,0.00091762363,0.00080980273,0.000051130286,0.0007535971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863833,0.00008875111,0.0005537124,0.00023850732,0.00022915225,0.00025151813],"domain_scores_gemma":[0.9975551,0.00021036086,0.00015968463,0.0016458962,0.0003722152,0.00005678971],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017103602,0.00025172764,0.00025952046,0.00017125334,0.0002541481,0.00017326839,0.002056868,0.00012145889,0.000046690326],"category_scores_gemma":[0.000027398397,0.0002820766,0.00011119557,0.00015809097,0.00017565078,0.00023519807,0.00012438565,0.00028225651,0.000021899546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003061966,0.0003681585,0.000096066564,0.00008748655,0.00007951887,4.688993e-7,0.00006977162,0.07754628,0.017809648,0.89141625,0.007936448,0.0045592585],"study_design_scores_gemma":[0.0005443863,0.000022605922,0.000090030655,0.00009730297,0.000013252689,0.000005811895,0.00009392811,0.9730522,0.005000355,0.012616419,0.00810592,0.00035775526],"about_ca_topic_score_codex":0.00018211555,"about_ca_topic_score_gemma":0.00022950945,"teacher_disagreement_score":0.89550596,"about_ca_system_score_codex":0.0002768076,"about_ca_system_score_gemma":0.000044536886,"threshold_uncertainty_score":0.99996316},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09658232150747445,"score_gpt":0.3654450014993963,"score_spread":0.2688626799919218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149201487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07417759,0.0010280441,0.7291699,0.0067721196,0.00041322826,0.00081828877,0.0010707141,0.002085386,0.18446471],"genre_scores_gemma":[0.9428114,0.00026546596,0.05507418,0.0001006035,0.000081090235,0.00016085812,0.0013772812,0.00003799061,0.00009112537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984796,0.0001395289,0.00061370805,0.00022377216,0.00033793165,0.00020545267],"domain_scores_gemma":[0.99794936,0.00034964495,0.000176098,0.0011194069,0.00033702707,0.00006848898],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020671586,0.00023643878,0.00024560821,0.00026941817,0.00024555365,0.00011006385,0.0012506503,0.00014074717,0.00011032888],"category_scores_gemma":[0.000029378463,0.00027656325,0.000055300934,0.00021094992,0.00031052408,0.00026138147,0.00010380782,0.0004111756,0.000052423973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011658856,0.0002247823,0.02765921,0.000021134058,0.000061937084,6.210783e-7,0.000111287634,0.008938629,0.01151819,0.9447665,0.0032498853,0.003436159],"study_design_scores_gemma":[0.0019946084,0.00015611903,0.060152255,0.00047303637,0.00006349804,0.0000083672585,0.00025310105,0.55591005,0.022171007,0.32240424,0.034814965,0.0015987484],"about_ca_topic_score_codex":0.00013234977,"about_ca_topic_score_gemma":0.00036735716,"teacher_disagreement_score":0.8686338,"about_ca_system_score_codex":0.00024348081,"about_ca_system_score_gemma":0.000065548105,"threshold_uncertainty_score":0.99996865},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07059347255846536,"score_gpt":0.3443863024702178,"score_spread":0.2737928299117524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149821387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050775964,0.00017020387,0.8036383,0.013400614,0.0005084411,0.0021685231,0.00021853962,0.00020286517,0.12891658],"genre_scores_gemma":[0.9936414,0.00014384008,0.0050937524,0.00011503674,0.000040086496,0.00040169153,0.00009992314,0.000007824534,0.0004564414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842966,0.00016810512,0.00053703255,0.00028636685,0.00038715752,0.00019168653],"domain_scores_gemma":[0.99788934,0.00024238843,0.00022784402,0.0013069197,0.00028356188,0.00004993654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002984261,0.00015165881,0.0002808217,0.00057000836,0.00009985636,0.00011289374,0.0030399947,0.00009376627,0.00008303174],"category_scores_gemma":[0.0000058209557,0.0001488933,0.00014525767,0.0010861994,0.00010987427,0.00026327808,0.00010674336,0.00026775865,0.00001886259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003568316,0.0011742718,0.018337399,0.000012856586,0.00028094603,0.000005784423,0.0004451871,0.035184003,0.0044577126,0.90094036,0.0013269936,0.037798814],"study_design_scores_gemma":[0.00045450445,0.00006156011,0.025752159,0.00015538087,0.000042921292,0.0000013789435,0.000025258822,0.96147096,0.001193078,0.00505867,0.005550481,0.00023363825],"about_ca_topic_score_codex":0.0013385883,"about_ca_topic_score_gemma":0.00219518,"teacher_disagreement_score":0.94286543,"about_ca_system_score_codex":0.000083705905,"about_ca_system_score_gemma":0.00010438201,"threshold_uncertainty_score":0.6071693},"labels":[],"label_agreement":null},{"id":"W2150202460","doi":"10.1109/icc.2006.255450","title":"Blind Channel Estimation and Multi-User Detection for Wireless CDMA Systems","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Multiuser detection; Detector; Matching pursuit; Channel (broadcasting); Subspace topology; Code division multiple access; Single antenna interference cancellation; Algorithm; Interference (communication); Wireless; Artificial intelligence; Compressed sensing; Telecommunications","score_opus":0.14033408265000427,"score_gpt":0.37410601925358017,"score_spread":0.2337719366035759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150202460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00493809,0.00020108862,0.9832471,0.0058617312,0.00053190836,0.0008071851,0.000055291068,0.00021046023,0.004147172],"genre_scores_gemma":[0.9646754,0.0003747581,0.032060083,0.00008250673,0.0001016627,0.0007641468,0.00014085392,0.000021149557,0.0017794316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821585,0.00023386248,0.00047718463,0.00038896746,0.00041377379,0.00027035002],"domain_scores_gemma":[0.9963393,0.0005419811,0.00026347366,0.0018703318,0.0009011184,0.00008377677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052711513,0.00019827807,0.00018714488,0.00034661312,0.00054342434,0.00068415,0.0030834374,0.0001319399,0.000005573587],"category_scores_gemma":[0.00006513171,0.00021007062,0.00006310733,0.00032048923,0.00018363041,0.0006587946,0.0004587711,0.00033639977,0.000045324614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000458347,0.00047649894,0.00009722844,0.00002210348,0.000053226504,6.3011987e-7,0.00017258138,0.014063376,0.0030478626,0.9384592,0.0012273728,0.042334042],"study_design_scores_gemma":[0.00088488247,0.000053074255,0.00070105464,0.000077767,0.0000059433933,0.00000994938,0.000049853843,0.9898003,0.00073422986,0.003197982,0.0042753085,0.000209693],"about_ca_topic_score_codex":0.00044647622,"about_ca_topic_score_gemma":0.00066062406,"teacher_disagreement_score":0.97573686,"about_ca_system_score_codex":0.00016087404,"about_ca_system_score_gemma":0.00009988498,"threshold_uncertainty_score":0.8566431},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08110852820307053,"score_gpt":0.3235285154707956,"score_spread":0.24241998726772507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150231611","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37016833,0.0003974493,0.22762284,0.016997267,0.0021013846,0.0037482823,0.0023441415,0.003758489,0.3728618],"genre_scores_gemma":[0.9937427,0.00012891722,0.0045972276,0.00014002051,0.00005581661,0.0007345581,0.00033299954,0.000052405765,0.00021533124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981735,0.0001265504,0.00072056986,0.00039102533,0.00019174599,0.00039665797],"domain_scores_gemma":[0.9969411,0.00042761143,0.00012418722,0.0021398815,0.00027351067,0.00009372996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002889227,0.0003159255,0.00035411792,0.0006321872,0.00018234536,0.00019085513,0.0034182076,0.00015242345,0.0000339058],"category_scores_gemma":[0.00006754798,0.00036018397,0.0000857337,0.00040172657,0.00017569806,0.00033180573,0.00010467407,0.00049255067,0.000101963546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017091552,0.0007658456,0.0053468803,0.000103595215,0.00017631931,0.000008661188,0.0011184715,0.046427507,0.32509616,0.610162,0.003236359,0.007387253],"study_design_scores_gemma":[0.0027446595,0.00069437904,0.0039760955,0.0028537523,0.00008633244,0.000094469906,0.0025847838,0.80394155,0.14520712,0.014223672,0.021100745,0.0024924525],"about_ca_topic_score_codex":0.0006708659,"about_ca_topic_score_gemma":0.013805167,"teacher_disagreement_score":0.757514,"about_ca_system_score_codex":0.00060249073,"about_ca_system_score_gemma":0.00006453166,"threshold_uncertainty_score":0.999885},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07612764646207502,"score_gpt":0.3189690561084509,"score_spread":0.24284140964637585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151524846","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017283816,0.00029099698,0.42744812,0.054878883,0.0038125284,0.00084305817,0.00020422302,0.0011557507,0.49408263],"genre_scores_gemma":[0.97134876,0.00015951262,0.009275828,0.0010234163,0.00024282439,0.00013134506,0.00010252616,0.000015094216,0.017700681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981368,0.00016184153,0.00050180196,0.00039588095,0.0004961468,0.00030751046],"domain_scores_gemma":[0.99695975,0.00032454592,0.00023613354,0.0018446413,0.0005289377,0.00010599113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002054133,0.00023007333,0.00019931889,0.00020151831,0.00032487654,0.00039359598,0.004153989,0.00009611713,0.0003133122],"category_scores_gemma":[0.000040390503,0.00020522918,0.000105878695,0.00032034342,0.00014933386,0.00046901955,0.0003143682,0.00034638058,0.00064364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003581836,0.00042210624,0.00024255672,0.0000018984674,0.00004146528,0.0000060923453,0.00008833796,0.0010051711,0.00040514072,0.8782079,0.02732758,0.09221593],"study_design_scores_gemma":[0.0015202435,0.00022260497,0.0023337088,0.00010977563,0.000020952204,0.00003381196,0.00009565126,0.85930544,0.00027870413,0.013249122,0.122231394,0.00059859164],"about_ca_topic_score_codex":0.00031107324,"about_ca_topic_score_gemma":0.0005414405,"teacher_disagreement_score":0.95406497,"about_ca_system_score_codex":0.00012245837,"about_ca_system_score_gemma":0.00025207404,"threshold_uncertainty_score":0.8369003},"labels":[],"label_agreement":null},{"id":"W2153892666","doi":"10.1109/icc.2006.255384","title":"Approximate MAP Nakagami m Parameter Estimator for Indoor Ultra-Wide Bandwidth Channels","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Estimator; Nakagami distribution; Maximum a posteriori estimation; Estimation theory; Fading; Bandwidth (computing); Statistics; Mathematics; Minimax estimator; Minimum-variance unbiased estimator; Algorithm; Maximum likelihood; Computer science; Telecommunications","score_opus":0.049780393745263475,"score_gpt":0.2961567223344722,"score_spread":0.24637632858920874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153892666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053489823,0.0015304163,0.60134125,0.05104517,0.0047060912,0.004178684,0.0023706756,0.0052490197,0.27608886],"genre_scores_gemma":[0.9644842,0.0002934557,0.031740487,0.00023438076,0.00008563224,0.0012774315,0.00071232923,0.00006425612,0.001107843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984761,0.00006196549,0.0005804382,0.0002843499,0.00023291241,0.00036424247],"domain_scores_gemma":[0.9965064,0.0008196043,0.0001377482,0.0021162475,0.0003524807,0.00006749697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019456321,0.0003027246,0.00027686654,0.00034245633,0.00028858628,0.00017444413,0.0027017184,0.00020601206,0.00011941356],"category_scores_gemma":[0.00013334406,0.0003262279,0.00014055897,0.0002122978,0.00025542287,0.00023596949,0.00009301213,0.000466269,0.00020196363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008556313,0.0011605392,0.0021230476,0.00010041145,0.00047124576,0.0000029121516,0.0002817987,0.016149329,0.026281353,0.8599185,0.08038253,0.013042773],"study_design_scores_gemma":[0.0020202177,0.00015986117,0.0008516624,0.00028109414,0.00009131778,0.000029005565,0.00021152191,0.6322742,0.038102742,0.107990064,0.2167267,0.0012616141],"about_ca_topic_score_codex":0.000083101564,"about_ca_topic_score_gemma":0.00017338102,"teacher_disagreement_score":0.91099435,"about_ca_system_score_codex":0.0001723097,"about_ca_system_score_gemma":0.000056238907,"threshold_uncertainty_score":0.999919},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0376647273698407,"score_gpt":0.2678853771644259,"score_spread":0.2302206497945852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153919695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04217788,0.000059504135,0.9118397,0.0038500407,0.0014683394,0.00045033375,0.00001542534,0.00056180306,0.03957695],"genre_scores_gemma":[0.9858857,0.000069085494,0.012535299,0.00055615616,0.00037829322,0.00013511996,0.000053043506,0.000021455966,0.0003658612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979234,0.00026124995,0.00045071475,0.0004852804,0.0005564914,0.00032288226],"domain_scores_gemma":[0.99729264,0.00017829324,0.00027380316,0.0015780604,0.00059252337,0.00008470462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035334213,0.0002629708,0.0001894515,0.00030851908,0.0007280358,0.00041414172,0.0019491295,0.00015803931,0.00013235674],"category_scores_gemma":[0.000022767965,0.00024908048,0.00009825251,0.0007529932,0.00014608653,0.00069634226,0.00020464387,0.0005059137,0.00016152952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089034636,0.002382386,0.0027293488,0.000030624447,0.00022237081,0.000022381339,0.0003821598,0.08741276,0.067894496,0.42401943,0.004162382,0.4098513],"study_design_scores_gemma":[0.00086251413,0.00038938757,0.0050765164,0.00010292525,0.000017258168,0.000023744567,0.000019419145,0.94650507,0.014174276,0.008462466,0.023949984,0.00041641985],"about_ca_topic_score_codex":0.00066748855,"about_ca_topic_score_gemma":0.0056063267,"teacher_disagreement_score":0.9437078,"about_ca_system_score_codex":0.00021768431,"about_ca_system_score_gemma":0.00010965798,"threshold_uncertainty_score":0.9999961},"labels":[],"label_agreement":null},{"id":"W2154004095","doi":"10.1109/icc.2006.254906","title":"Procedures for Efficient Iterative Decoding of Orthogonal Convolutional Codes","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Sequential decoding; Decoding methods; Concatenation (mathematics); Computer science; List decoding; Algorithm; Serial concatenated convolutional codes; Belief propagation; Concatenated error correction code; Berlekamp–Welch algorithm; Interleaving; Theoretical computer science; Mathematics; Block code; Arithmetic","score_opus":0.08670520343720678,"score_gpt":0.366594295161755,"score_spread":0.27988909172454823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154004095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021886839,0.00008258759,0.9337396,0.0044899657,0.00047289216,0.000503932,0.00022922966,0.00028704782,0.038307924],"genre_scores_gemma":[0.8640222,0.000018493218,0.13517751,0.00011377684,0.000055366374,0.00019632597,0.000087493485,0.000008986241,0.00031987118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986224,0.00008330554,0.00045451225,0.0002937466,0.00036444754,0.0001815935],"domain_scores_gemma":[0.9970894,0.0005915834,0.0003227376,0.0008103917,0.0011499401,0.000035987487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033069146,0.00015566424,0.00017020143,0.00025241566,0.00028990305,0.00014621395,0.0023440418,0.00006419231,0.000023397532],"category_scores_gemma":[0.00018132896,0.00015887148,0.00010607523,0.00020898889,0.00024033031,0.00019010266,0.00023354434,0.00017437866,0.00001133496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015896128,0.0002735754,0.0008018076,0.000009735384,0.00002175758,2.6817187e-7,0.00017583763,0.0011458129,0.005259906,0.9894623,0.0019878729,0.00084521924],"study_design_scores_gemma":[0.0005098113,0.00015546766,0.0035109539,0.00033629025,0.0000117057,0.000016527925,0.00006504245,0.9009759,0.018259311,0.073706634,0.0021100051,0.00034238686],"about_ca_topic_score_codex":0.000092126385,"about_ca_topic_score_gemma":0.0003704456,"teacher_disagreement_score":0.9157557,"about_ca_system_score_codex":0.000117843265,"about_ca_system_score_gemma":0.00035467226,"threshold_uncertainty_score":0.6478591},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.040451775504140045,"score_gpt":0.30733397768872517,"score_spread":0.26688220218458514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155280140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008565409,0.00021952175,0.98216033,0.00085226697,0.0005562679,0.00057690166,0.00008546687,0.00023448406,0.006749352],"genre_scores_gemma":[0.9748745,0.001010269,0.022266153,0.00012585311,0.00020379366,0.00058513886,0.0007193376,0.00005181451,0.00016315942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879164,0.000064942375,0.00046095907,0.00024122425,0.00017738176,0.0002638311],"domain_scores_gemma":[0.99847585,0.00035906743,0.00010758724,0.00067863986,0.00033439245,0.000044448916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000115158415,0.0002240556,0.00020553377,0.0001831346,0.000108874854,0.000101639074,0.00078821834,0.00016679181,0.000058377267],"category_scores_gemma":[0.000031995765,0.00026003728,0.000060521477,0.00028305114,0.00009520568,0.00021591132,0.000046809408,0.0003601047,0.000020517644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022726208,0.00009416401,0.00013894458,0.000004390002,0.00002230069,6.039497e-7,0.000052579406,0.8387671,0.0002472017,0.15714948,0.00036951393,0.0031309833],"study_design_scores_gemma":[0.0004102809,0.000031843934,0.0002825673,0.00014856002,0.0000074825193,0.0000027529195,0.00002874936,0.9867768,0.0005711357,0.010122788,0.0013624296,0.00025457275],"about_ca_topic_score_codex":0.000045218934,"about_ca_topic_score_gemma":0.0008946942,"teacher_disagreement_score":0.9663091,"about_ca_system_score_codex":0.0002658592,"about_ca_system_score_gemma":0.00003844802,"threshold_uncertainty_score":0.99998516},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.051087268054257444,"score_gpt":0.3036527420738922,"score_spread":0.25256547401963475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156199875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004328212,0.00030338537,0.8763963,0.005785037,0.0005609665,0.0006563431,0.000024132936,0.00016696462,0.11177865],"genre_scores_gemma":[0.9404938,0.00048436696,0.052879445,0.0014958106,0.00018286613,0.00055425015,0.00015302698,0.000023139755,0.0037332918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980124,0.00016120137,0.000497213,0.0005463654,0.00042563872,0.00035717338],"domain_scores_gemma":[0.99678177,0.00022140492,0.00016234638,0.0024324767,0.00027424158,0.00012778498],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0002751418,0.00023858539,0.0002282829,0.00025553058,0.00013815895,0.00055068184,0.005817896,0.00011933916,0.000045372326],"category_scores_gemma":[0.000010506102,0.00025600355,0.000071144976,0.000921538,0.00004816255,0.0007568517,0.0007975361,0.0004932622,0.0002260415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030850813,0.0007578086,0.00040266378,0.00000484007,0.000026814145,0.0000032783037,0.0003544808,0.11699901,0.00027852593,0.8056476,0.018240435,0.057253692],"study_design_scores_gemma":[0.00053316617,0.00005176037,0.0024445513,0.0001235436,0.0000049745095,0.000009928672,0.00006445617,0.9595743,0.00006182625,0.005352585,0.031385165,0.00039378024],"about_ca_topic_score_codex":0.0007662935,"about_ca_topic_score_gemma":0.0041326233,"teacher_disagreement_score":0.9361656,"about_ca_system_score_codex":0.00022535626,"about_ca_system_score_gemma":0.00023042734,"threshold_uncertainty_score":0.9999892},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04341137406392314,"score_gpt":0.28607921947629794,"score_spread":0.2426678454123748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156442063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03262115,0.00011655788,0.9311079,0.00068261876,0.0007737175,0.0006906089,0.00031485088,0.0003973932,0.033295244],"genre_scores_gemma":[0.97860193,0.0001429103,0.019015374,0.00007730004,0.00014938372,0.0003214883,0.0011409206,0.000057762612,0.0004928994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892575,0.000031838892,0.0003421869,0.00021520282,0.00026281303,0.00022219407],"domain_scores_gemma":[0.99880385,0.00012803078,0.00012975343,0.0005606721,0.00033237666,0.000045310262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009058387,0.00021194274,0.00015289347,0.00017798922,0.00020858666,0.00010124101,0.000599531,0.00005852037,0.00012186263],"category_scores_gemma":[0.000011166435,0.00022934117,0.000054227978,0.0001424863,0.000082114166,0.0004135509,0.000044367483,0.00020528493,0.000023042574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004506595,0.0000898601,0.00008498086,0.000008368022,0.000059744783,0.0000013535573,0.00012551568,0.9706179,0.0010913081,0.023290334,0.0027849455,0.0018006552],"study_design_scores_gemma":[0.00071793876,0.000060604478,0.00018550859,0.00014049442,0.000016656533,0.000009215061,0.00014265018,0.9923412,0.0019569825,0.0017902781,0.0023452106,0.0002932475],"about_ca_topic_score_codex":0.00007200399,"about_ca_topic_score_gemma":0.00027848736,"teacher_disagreement_score":0.9459808,"about_ca_system_score_codex":0.00026173255,"about_ca_system_score_gemma":0.0000439996,"threshold_uncertainty_score":0.93522614},"labels":[],"label_agreement":null},{"id":"W2156664142","doi":"10.1109/icc.2006.255206","title":"Multiple-Link Failures Survivability in Optical Networks with Traffic Grooming Capability","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Concordia University","funders":"","keywords":"Traffic grooming; Survivability; Computer science; Spare part; Computer network; Distributed computing; Robustness (evolution); Bandwidth (computing); Flexibility (engineering); Wavelength-division multiplexing; Engineering","score_opus":0.03735410674308162,"score_gpt":0.278678088952506,"score_spread":0.2413239822094244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156664142","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78087825,0.00023058124,0.16364911,0.008003604,0.00050410186,0.0008241053,0.0000804571,0.001683137,0.044146664],"genre_scores_gemma":[0.9599841,0.0001247781,0.039518613,0.000022302216,0.00007043562,0.00013528985,0.00008665977,0.000026027563,0.000031788142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986696,0.000062762534,0.000444729,0.0002789202,0.00023008822,0.00031386057],"domain_scores_gemma":[0.99785113,0.00075059134,0.000052776406,0.0011269182,0.00017078914,0.000047788937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020641927,0.00022434728,0.00022843521,0.00013565354,0.00009165565,0.0000699031,0.0011640246,0.00016312978,0.000043506472],"category_scores_gemma":[0.000121189565,0.00021429133,0.000051248713,0.0002862423,0.00045584526,0.00019410592,0.00010690422,0.0007495777,0.00001669256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030703068,0.0001714237,0.007416283,0.000006486028,0.000019380284,0.0000026195898,0.000022327438,0.9150454,0.00016770296,0.067140795,0.00009162445,0.009885257],"study_design_scores_gemma":[0.00042271256,0.000035702054,0.019119546,0.00007248125,0.000006043116,0.0000039132983,0.00010486489,0.9751535,0.00010293473,0.0037664773,0.0009417912,0.00027001312],"about_ca_topic_score_codex":0.00016688317,"about_ca_topic_score_gemma":0.008689731,"teacher_disagreement_score":0.17910586,"about_ca_system_score_codex":0.00026552376,"about_ca_system_score_gemma":0.0000277502,"threshold_uncertainty_score":0.8738547},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08502782887775434,"score_gpt":0.3521103720367123,"score_spread":0.26708254315895796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157382712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012120261,0.000031172523,0.7722271,0.15027781,0.0008692816,0.0009812354,0.00010088168,0.00060462154,0.07369586],"genre_scores_gemma":[0.75871325,0.000036523437,0.22334953,0.002155267,0.00012904193,0.0010160218,0.0001838088,0.000019987967,0.0143965585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99741286,0.0000788364,0.00051976007,0.00063603825,0.00087898347,0.00047350707],"domain_scores_gemma":[0.99452126,0.0003049715,0.00015512508,0.003316453,0.0015784267,0.00012379076],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008101291,0.00027313255,0.00022419583,0.00038102103,0.0002844551,0.00046156743,0.0081173545,0.000127662,0.000032373508],"category_scores_gemma":[0.00014717464,0.00028985486,0.00012256582,0.0005495798,0.00012212752,0.00029690386,0.0014077167,0.0003330148,0.0002591053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016944814,0.0003300225,0.00016296908,0.0000032329783,0.00005944904,0.0000018242159,0.00006660098,0.014772302,0.000090813846,0.7668399,0.19256777,0.025088143],"study_design_scores_gemma":[0.00047002354,0.00014468122,0.0053763157,0.000070573435,0.000018717692,0.0000051601937,0.00006845992,0.3943532,0.0003306084,0.05792216,0.54072624,0.0005138558],"about_ca_topic_score_codex":0.0001818852,"about_ca_topic_score_gemma":0.0005245722,"teacher_disagreement_score":0.75750124,"about_ca_system_score_codex":0.0002858101,"about_ca_system_score_gemma":0.00005478173,"threshold_uncertainty_score":0.99995536},"labels":[],"label_agreement":null},{"id":"W2159736011","doi":"10.1109/icc.2006.255753","title":"Soft-Output Trellis/Tree Iterative Decoder for high-order BICM on MIMO Frequency Selective Rayleigh Fading Channels","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Trellis (graph); Rayleigh fading; Space–time trellis code; Trellis modulation; MIMO; Algorithm; Fading; Computer science; Decoding methods; Tree (set theory); Trellis quantization; Computational complexity theory; Mathematics; Telecommunications; Channel (broadcasting); Error floor; Low-density parity-check code","score_opus":0.05684969023708189,"score_gpt":0.3208128363876775,"score_spread":0.2639631461505956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159736011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072007035,0.0005385753,0.8118642,0.0050613494,0.0010000821,0.001573227,0.000829036,0.0016380693,0.17029476],"genre_scores_gemma":[0.93754727,0.00077823026,0.057813134,0.00023232137,0.00016994176,0.0011809072,0.0007596543,0.0000845229,0.0014340101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982622,0.00011627131,0.0006037716,0.0003627732,0.00030955733,0.0003453746],"domain_scores_gemma":[0.99647033,0.0007443878,0.00021002545,0.0015410996,0.00096446375,0.00006971251],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001683758,0.0003839066,0.0003112662,0.00044758565,0.00037776656,0.00016800596,0.0019843956,0.00017991822,0.000088428504],"category_scores_gemma":[0.00009859162,0.00041849783,0.000115466806,0.00035897992,0.00017642583,0.0004179527,0.00011208565,0.000572476,0.00009937313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005767285,0.00064047996,0.00014877298,0.000028043669,0.00025464836,0.0000015403667,0.0006664412,0.07186789,0.017794842,0.8726255,0.013567711,0.022346444],"study_design_scores_gemma":[0.0021756475,0.00043106373,0.0010344271,0.0007512497,0.00007053159,0.000010096902,0.0002347519,0.5802972,0.12778844,0.25242078,0.03297521,0.001810614],"about_ca_topic_score_codex":0.0001627005,"about_ca_topic_score_gemma":0.0005206467,"teacher_disagreement_score":0.93034655,"about_ca_system_score_codex":0.00040894403,"about_ca_system_score_gemma":0.00007426099,"threshold_uncertainty_score":0.99982667},"labels":[],"label_agreement":null},{"id":"W2160396587","doi":"10.1109/icc.2006.255342","title":"Optimal Power and Resource Allocation For Half-Duplex Cooperative Multiple Access","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Computer network; Resource allocation; Quality of service; Channel state information; Pairwise comparison; Channel (broadcasting); Wireless; Transmission (telecommunications); Resource management (computing); Key (lock); Telecommunications; Computer security","score_opus":0.1268459888610935,"score_gpt":0.36832971769364,"score_spread":0.24148372883254648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160396587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014357583,0.0004874626,0.8472509,0.06483689,0.00043214433,0.0011162219,0.00010342254,0.00034420379,0.07107119],"genre_scores_gemma":[0.96585685,0.00050537096,0.030577652,0.00085949356,0.0000678906,0.0003126088,0.00023028937,0.000015670028,0.0015741477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985391,0.00019890143,0.00040143385,0.00039459506,0.0002499342,0.00021601547],"domain_scores_gemma":[0.9967378,0.00062385027,0.00019456631,0.0014976689,0.00087356503,0.00007257523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033924644,0.00020337087,0.0001737015,0.00019466263,0.00063389796,0.000732535,0.0035405904,0.00007691079,0.000055070726],"category_scores_gemma":[0.00013074114,0.00020810592,0.00006446967,0.00027650103,0.00020271998,0.000747044,0.0007455172,0.00025585733,0.00002795897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026806634,0.00025856256,0.00029660348,0.000002842118,0.00003729657,3.9561715e-7,0.00032959942,0.0033615564,0.0025494106,0.9754474,0.010027987,0.007661516],"study_design_scores_gemma":[0.00089234737,0.00010245427,0.00276074,0.00007261074,0.0000085603115,0.0000073240763,0.00009456207,0.84596467,0.0016017071,0.00171021,0.14643332,0.00035147247],"about_ca_topic_score_codex":0.0000735947,"about_ca_topic_score_gemma":0.0005519851,"teacher_disagreement_score":0.97373724,"about_ca_system_score_codex":0.00010143483,"about_ca_system_score_gemma":0.00011499204,"threshold_uncertainty_score":0.84863126},"labels":[],"label_agreement":null},{"id":"W2161689505","doi":"10.1109/icc.2006.255209","title":"A Dynamic Spot Diffusing Architecture for Indoor Wireless Optical Communications","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Transmitter; Computer science; Erasure; Synchronizing; Multipath propagation; Wireless; Optical wireless; Channel (broadcasting); Real-time computing; Telecommunications; Transmission (telecommunications)","score_opus":0.04899225053116671,"score_gpt":0.31435618451871905,"score_spread":0.2653639339875523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161689505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15057653,0.0020894886,0.41143763,0.09211024,0.0015052602,0.0029457393,0.0016726913,0.0056482735,0.33201414],"genre_scores_gemma":[0.919327,0.001316066,0.07753477,0.00012424514,0.000039381855,0.00062136434,0.00063019333,0.00006557786,0.00034138048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983111,0.00007743074,0.0006487795,0.000281529,0.00030888602,0.00037229338],"domain_scores_gemma":[0.99469036,0.00083660515,0.00013421736,0.0038485539,0.00041268655,0.000077565666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019626833,0.00032179794,0.00030648292,0.00035922462,0.00041605224,0.00022064058,0.005058917,0.00023754933,0.000045340978],"category_scores_gemma":[0.00010411505,0.00034619388,0.0001567658,0.00031978937,0.00070943363,0.00019140923,0.00052819744,0.00083184644,0.00010106716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029475825,0.00057371653,0.00013908799,0.00002674064,0.00011784369,8.001469e-7,0.000100019104,0.003983507,0.022230657,0.91798264,0.0018651432,0.052950356],"study_design_scores_gemma":[0.0009020034,0.000069029025,0.0010823745,0.00020159369,0.00003733284,0.000015034144,0.00023845854,0.91707367,0.004842266,0.033233117,0.041638542,0.000666583],"about_ca_topic_score_codex":0.00006670908,"about_ca_topic_score_gemma":0.0012006206,"teacher_disagreement_score":0.91309017,"about_ca_system_score_codex":0.0002922782,"about_ca_system_score_gemma":0.000058023288,"threshold_uncertainty_score":0.999899},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06062968476393932,"score_gpt":0.31584585955154904,"score_spread":0.2552161747876097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161931435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010606709,0.00006986752,0.8770805,0.010106271,0.0007166976,0.00051421113,0.00007872645,0.00029579442,0.1005312],"genre_scores_gemma":[0.94952875,0.000107007625,0.046486147,0.0016853926,0.00022416776,0.00026711554,0.00009185132,0.000021740072,0.0015877986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980359,0.00015865797,0.00045919465,0.00045919797,0.00048284506,0.00040418885],"domain_scores_gemma":[0.9962537,0.00042790253,0.00017156138,0.0026018315,0.0003959849,0.00014898286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029984472,0.00023952012,0.00020265607,0.00016594827,0.00031703734,0.00036856544,0.0046303812,0.00010499855,0.00014834735],"category_scores_gemma":[0.000061147824,0.00024065482,0.0001054592,0.00043831032,0.00015876662,0.0003478493,0.00095842715,0.0003951222,0.00039900173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010956331,0.0002000755,0.00039159186,0.0000010325541,0.000016425256,0.000001438351,0.00013919805,0.13535894,0.00028297908,0.8476333,0.013501702,0.002462372],"study_design_scores_gemma":[0.00029339563,0.000039198865,0.0010397751,0.0000834498,0.000005807,0.0000043392747,0.000006678296,0.8594359,0.00009279481,0.13085793,0.007903962,0.0002367371],"about_ca_topic_score_codex":0.00017206604,"about_ca_topic_score_gemma":0.0011769516,"teacher_disagreement_score":0.93892205,"about_ca_system_score_codex":0.0001541523,"about_ca_system_score_gemma":0.00015806027,"threshold_uncertainty_score":0.98136187},"labels":[],"label_agreement":null},{"id":"W2162937330","doi":"10.1109/icc.2006.255749","title":"Explicit Bounds for the Outage Probability for Multiple Antenna Systems in the Presence of Spatial Correlation","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Spatial correlation; Rayleigh fading; MIMO; Fading; Channel state information; Transmitter; Computer science; Algorithm; Rank (graph theory); Signal-to-noise ratio (imaging); Channel (broadcasting); Correlation; Covariance matrix; Mathematics; Wireless; Telecommunications; Combinatorics","score_opus":0.07877377463889304,"score_gpt":0.3096442571258446,"score_spread":0.23087048248695155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162937330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028682249,0.00017610326,0.99092686,0.0007910987,0.00062100973,0.0021519358,0.00038455572,0.000055944463,0.0020242524],"genre_scores_gemma":[0.9932955,0.00006023927,0.004271094,0.000013019904,0.00009322878,0.001856491,0.00024490175,0.00001678867,0.00014873379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899447,0.00007840099,0.00048526638,0.00013673982,0.00017188494,0.000133238],"domain_scores_gemma":[0.99697435,0.0016337367,0.00016784413,0.00080215535,0.00041039474,0.000011530359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004465645,0.00011936187,0.00013544138,0.00007873504,0.00014494681,0.00007021625,0.0010102799,0.00006358076,0.0000039456236],"category_scores_gemma":[0.00022830558,0.00008989293,0.00006177543,0.00011603536,0.00008630804,0.00017150192,0.000029346893,0.00014179769,0.0000025127244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004521877,0.00014860179,0.0021892732,0.000054932312,0.000026214218,5.7622433e-8,0.0004682292,0.8359212,0.0024725632,0.15743174,0.00054171187,0.0007002652],"study_design_scores_gemma":[0.0004199822,0.000028807639,0.0016362275,0.00008075537,0.000009997083,0.0000012437619,0.0003470458,0.9924113,0.00012575921,0.0030349158,0.0018136776,0.00009029749],"about_ca_topic_score_codex":0.0009506557,"about_ca_topic_score_gemma":0.0029396387,"teacher_disagreement_score":0.99042726,"about_ca_system_score_codex":0.000107003274,"about_ca_system_score_gemma":0.000032751057,"threshold_uncertainty_score":0.3665727},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.16886344957668867,"score_gpt":0.36618647841265456,"score_spread":0.1973230288359659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163096389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006467367,0.00075077335,0.80117923,0.09909323,0.00080362445,0.00059321907,0.00006628709,0.00023501962,0.09663185],"genre_scores_gemma":[0.97859335,0.0019488449,0.013935751,0.001252851,0.00013808311,0.00041755792,0.000072944014,0.00001297652,0.0036276313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876845,0.0001515908,0.0003466191,0.00026215665,0.0002662845,0.00020487109],"domain_scores_gemma":[0.9958803,0.00095499685,0.00017043375,0.002348804,0.0006041176,0.000041327985],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00044332765,0.000160695,0.00012884752,0.00012560644,0.00081763085,0.0003822972,0.0055471123,0.000050329752,0.000060883813],"category_scores_gemma":[0.00007357289,0.00012586916,0.00010650857,0.00028295585,0.00017570636,0.00029803076,0.0004962078,0.00027136705,0.00010700799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006466021,0.00013405495,0.00004672095,0.0000010321282,0.000029299053,1.7626857e-7,0.00011360499,0.0015960281,0.0017060727,0.9760464,0.01480287,0.0055172825],"study_design_scores_gemma":[0.00043794067,0.00004038264,0.0016809481,0.000053624673,0.000011232535,0.000006023632,0.00005124119,0.7874427,0.0010471031,0.012170314,0.19680052,0.00025801038],"about_ca_topic_score_codex":0.000067312445,"about_ca_topic_score_gemma":0.00064160244,"teacher_disagreement_score":0.97794664,"about_ca_system_score_codex":0.0000837047,"about_ca_system_score_gemma":0.00009063155,"threshold_uncertainty_score":0.99983335},"labels":[],"label_agreement":null},{"id":"W2164310707","doi":"10.1109/icc.2006.255482","title":"BER of BFSK with Postdetection Switched Combining in Correlated Rayleigh Fading","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rayleigh fading; Bit error rate; Frequency-shift keying; Fading; Mathematics; Statistics; Algorithm; Electronic engineering; Telecommunications; Computer science; Engineering; Demodulation; Decoding methods; Channel (broadcasting)","score_opus":0.03841615168049465,"score_gpt":0.2931076202302877,"score_spread":0.254691468549793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164310707","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5677571,0.0003886198,0.13353673,0.0021785933,0.0005001087,0.00097014185,0.00012746349,0.0015215944,0.2930196],"genre_scores_gemma":[0.98911357,0.00040374827,0.009980936,0.000023245886,0.000013630612,0.00011347615,0.00014162812,0.000033948352,0.00017582742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989087,0.00006774048,0.0004860425,0.00014645458,0.00022098632,0.00017007567],"domain_scores_gemma":[0.99836874,0.0001952799,0.00016584397,0.0009873571,0.00025326904,0.00002953098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015212531,0.00016985291,0.00019942611,0.00038209953,0.000078320845,0.000032700187,0.0010118308,0.00009871686,0.000061971004],"category_scores_gemma":[0.000019497456,0.00018156825,0.000039510833,0.00031464288,0.00013527354,0.00024643104,0.00007739698,0.0004661499,0.000017642014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021407273,0.0011310814,0.016082874,0.000056071753,0.00023192348,0.0000064298692,0.0010504002,0.27744338,0.27157578,0.4166113,0.0012731957,0.014323478],"study_design_scores_gemma":[0.0023505802,0.00020310427,0.017491413,0.0011991865,0.00003481331,0.000028112392,0.00059569353,0.8227509,0.13416436,0.016270155,0.0039626136,0.00094903266],"about_ca_topic_score_codex":0.0003489066,"about_ca_topic_score_gemma":0.0011717997,"teacher_disagreement_score":0.5453076,"about_ca_system_score_codex":0.0002106311,"about_ca_system_score_gemma":0.000035380723,"threshold_uncertainty_score":0.7404138},"labels":[],"label_agreement":null},{"id":"W2166415399","doi":"10.1109/icc.2006.255452","title":"EXIT Analysis of a Soft-Input/Soft-Output Iterative Multiuser Detector","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Concatenation (mathematics); EXIT chart; Detector; Computer science; Focus (optics); Algorithm; Iterative method; Gaussian; Convolutional code; Multiuser detection; Convergence (economics); Decoding methods; Mathematics; Concatenated error correction code; Telecommunications; Block code","score_opus":0.06069264069823589,"score_gpt":0.3293539180723604,"score_spread":0.26866127737412454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166415399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057649024,0.00058728945,0.7956078,0.0017666614,0.00038350563,0.00074919267,0.0013466001,0.0015861336,0.14032376],"genre_scores_gemma":[0.975156,0.0005936718,0.022881709,0.000070892704,0.00003359276,0.00020826553,0.00048114243,0.000035252626,0.0005394487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851316,0.00010636781,0.00064464746,0.00021648529,0.0003281738,0.00019117638],"domain_scores_gemma":[0.9967913,0.00037964366,0.00022696269,0.0019288618,0.0006214731,0.000051755058],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014286746,0.00023924709,0.00034374298,0.0011130228,0.00012543234,0.0000694479,0.0019991617,0.00011470859,0.00023762092],"category_scores_gemma":[0.000056032502,0.00026261798,0.00018739939,0.0010354313,0.0002181484,0.00027489435,0.000164968,0.00037216532,0.000051010156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011463213,0.0017646911,0.008008774,0.00006570033,0.004009251,0.000004816491,0.0016946511,0.43130794,0.114051536,0.3686917,0.01268489,0.057601415],"study_design_scores_gemma":[0.0003345993,0.00003806103,0.005974632,0.00010871355,0.00015899648,0.0000014404425,0.00010060401,0.95686686,0.020911815,0.003938639,0.011148843,0.00041677873],"about_ca_topic_score_codex":0.00023815423,"about_ca_topic_score_gemma":0.0010141956,"teacher_disagreement_score":0.917507,"about_ca_system_score_codex":0.00015043325,"about_ca_system_score_gemma":0.00003403181,"threshold_uncertainty_score":0.9999826},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.14155029874053107,"score_gpt":0.35099636380704163,"score_spread":0.20944606506651056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166806744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091498986,0.00040864284,0.8744885,0.004641333,0.00042931267,0.0015767606,0.0006550661,0.00048247675,0.025818923],"genre_scores_gemma":[0.9918118,0.0005765583,0.0069914646,0.000049867405,0.000020258702,0.0002482483,0.00013367539,0.00001914331,0.00014896333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907756,0.00007404903,0.00041598012,0.00013201692,0.00014191451,0.00015847465],"domain_scores_gemma":[0.99795663,0.00086005864,0.00016632231,0.00077521254,0.00021684641,0.0000249019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039461168,0.00014735188,0.0001728111,0.00021338122,0.00031912234,0.000055740726,0.0013043075,0.000068672336,0.000014043611],"category_scores_gemma":[0.00007065316,0.00014350079,0.000051389157,0.00017811081,0.00019498804,0.0002881796,0.00034665354,0.00028659834,0.000003275374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003980236,0.00023808879,0.0010158538,0.000054932905,0.00008946284,4.4033405e-7,0.0020222273,0.13171415,0.0069058347,0.84995514,0.0006178801,0.0073462096],"study_design_scores_gemma":[0.0005237892,0.000025981051,0.0019286093,0.00012426758,0.000011769276,0.0000011921837,0.0005119924,0.9602452,0.0031973713,0.03209284,0.0011418959,0.00019511042],"about_ca_topic_score_codex":0.00019118295,"about_ca_topic_score_gemma":0.00049064466,"teacher_disagreement_score":0.90031284,"about_ca_system_score_codex":0.00010750099,"about_ca_system_score_gemma":0.000023187828,"threshold_uncertainty_score":0.5851792},"labels":[],"label_agreement":null},{"id":"W2167620763","doi":"10.1109/icc.2006.255412","title":"Per-user Throughput of Opportunistic Scheduling Scheme over Broadcast Fading Channels","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fading; Computer science; Scheduling (production processes); Throughput; Channel (broadcasting); Computer network; Transmission (telecommunications); Wireless; Real-time computing; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.07149299120821652,"score_gpt":0.3182595882033603,"score_spread":0.2467665969951438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167620763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0491986,0.0004430661,0.7943465,0.0010142219,0.0014788775,0.00042680456,0.00023354725,0.00053072034,0.15232767],"genre_scores_gemma":[0.9551996,0.00077417627,0.042640384,0.0000450788,0.00017049073,0.000050599785,0.00036181306,0.000042664982,0.00071519014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988557,0.000035429497,0.0004618613,0.0001825848,0.0002604666,0.0002039292],"domain_scores_gemma":[0.9986781,0.00012757964,0.00015337608,0.0007612118,0.00023283552,0.000046908142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000084115956,0.00019293488,0.0001937325,0.00018080523,0.00010770307,0.00006312676,0.0008550939,0.0000945531,0.00027515794],"category_scores_gemma":[0.0000212735,0.00022504774,0.00006798306,0.00018780943,0.0001300804,0.000299896,0.000093381364,0.00028331464,0.00004483626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000085060865,0.000102160106,0.00042809924,0.000014297163,0.000048257818,9.224219e-7,0.000081449754,0.7762862,0.014557827,0.20633626,0.0005496018,0.0015864327],"study_design_scores_gemma":[0.00030637134,0.000015975033,0.00026924704,0.00016927064,0.000011580395,0.0000035885405,0.00006279997,0.9895372,0.0017173894,0.0023016243,0.0053697624,0.00023521291],"about_ca_topic_score_codex":0.00003086313,"about_ca_topic_score_gemma":0.000025512081,"teacher_disagreement_score":0.90600103,"about_ca_system_score_codex":0.00010343187,"about_ca_system_score_gemma":0.00003818167,"threshold_uncertainty_score":0.91771805},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04475798556474208,"score_gpt":0.28280734216728654,"score_spread":0.23804935660254445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167918353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6673329,0.00023309341,0.0014312062,0.002510671,0.00034333416,0.0002775137,0.000099950106,0.00032401644,0.32744732],"genre_scores_gemma":[0.9935804,0.0016800096,0.0039323317,0.0000435998,0.000019421519,0.00014172289,0.000106947955,0.00002180038,0.00047378437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882245,0.000065677676,0.0005599862,0.00016887169,0.00018401547,0.00019899888],"domain_scores_gemma":[0.997753,0.00018966396,0.00011573361,0.0016644913,0.00024995912,0.00002714879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015483478,0.00017798052,0.00021095312,0.00044998934,0.00006955839,0.000030577416,0.0025201582,0.00012906965,0.0001882155],"category_scores_gemma":[0.000036981335,0.00019822308,0.00005666998,0.000376098,0.0002629479,0.00020900468,0.00015627664,0.0005126407,0.00012133107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018582796,0.002407537,0.08169047,0.00012040285,0.00030300295,0.0000051625334,0.0013073055,0.0344439,0.15280046,0.65299815,0.014581271,0.05915649],"study_design_scores_gemma":[0.0016699247,0.00025264113,0.055980735,0.0008946026,0.000035561672,0.000028750455,0.00041991667,0.8706054,0.029995695,0.011842604,0.027286608,0.000987529],"about_ca_topic_score_codex":0.0003785639,"about_ca_topic_score_gemma":0.0018106215,"teacher_disagreement_score":0.83616155,"about_ca_system_score_codex":0.00016616829,"about_ca_system_score_gemma":0.000053028172,"threshold_uncertainty_score":0.80833024},"labels":[],"label_agreement":null},{"id":"W2169720840","doi":"10.1109/icc.2006.255019","title":"A Method for Spectrum Shaping and NBI Suppression in UWB Communications","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Victoria","funders":"","keywords":"Narrowband; Spread spectrum; Interference (communication); Electronic engineering; Robustness (evolution); Computer science; Matched filter; Physics; Telecommunications; Channel (broadcasting); Engineering","score_opus":0.0884219052281435,"score_gpt":0.35676456458213696,"score_spread":0.2683426593539935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169720840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03937106,0.003992289,0.59010684,0.10295012,0.00088974065,0.002867368,0.0009770497,0.002076499,0.25676903],"genre_scores_gemma":[0.88116693,0.0018772931,0.11565045,0.00011962778,0.000030378083,0.00059086824,0.0003059262,0.000033616267,0.00022491363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987303,0.00012500011,0.0005072802,0.00022455837,0.00014146222,0.00027139194],"domain_scores_gemma":[0.9965417,0.0007277383,0.00009921718,0.002444048,0.0001453324,0.000041957563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000337299,0.00020139292,0.00022283153,0.00044640567,0.00027094755,0.00009782431,0.0025945709,0.00015560909,0.00004361016],"category_scores_gemma":[0.0000551982,0.00022806787,0.00006355441,0.00027160955,0.00023098891,0.00020086319,0.0003411037,0.0005086621,0.00002389977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027155831,0.00045434805,0.0013815449,0.000024330684,0.000077216755,6.6790966e-7,0.0003062424,0.0048331385,0.023123533,0.94029146,0.003807116,0.025673265],"study_design_scores_gemma":[0.0009238434,0.00004573619,0.0030634545,0.00019004857,0.000023208006,0.000017388966,0.00021904004,0.8769989,0.0031697005,0.06676828,0.04817797,0.00040241872],"about_ca_topic_score_codex":0.00044387014,"about_ca_topic_score_gemma":0.0034904878,"teacher_disagreement_score":0.8735232,"about_ca_system_score_codex":0.00016502562,"about_ca_system_score_gemma":0.00004162292,"threshold_uncertainty_score":0.9300338},"labels":[],"label_agreement":null},{"id":"W2170938908","doi":"10.1109/icc.2006.255552","title":"Estimators for K Factor and Local Average SNR Using Noisy Correlated Samples","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Estimator; Fading; Channel (broadcasting); Signal-to-noise ratio (imaging); Algorithm; Statistics; Computer science; Noise (video); Mathematics; Telecommunications; Artificial intelligence","score_opus":0.09858220969822669,"score_gpt":0.3433188998058788,"score_spread":0.24473669010765214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170938908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032877065,0.00023004042,0.95644784,0.000516156,0.00022250768,0.00038506213,0.00044397174,0.0005964272,0.008280918],"genre_scores_gemma":[0.92313766,0.0004340902,0.07580383,0.000048800284,0.000030374593,0.00011372849,0.00027166112,0.000038455924,0.00012139033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991106,0.00003885745,0.00036187848,0.00016652717,0.00015096743,0.00017121252],"domain_scores_gemma":[0.9984264,0.0003207535,0.00009907219,0.0008689028,0.00023563369,0.00004924885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007310557,0.00018966755,0.00016957003,0.0001784924,0.00020416571,0.000085568536,0.0008995217,0.00010608664,0.00005379342],"category_scores_gemma":[0.00003288118,0.00021440418,0.00005175915,0.00011107586,0.00021403297,0.00022705217,0.00010885233,0.00026920863,0.00001288201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005665486,0.00039526212,0.002339366,0.00006309612,0.00019898373,0.0000017316638,0.00040154252,0.21112095,0.052689005,0.683018,0.0029780364,0.046737354],"study_design_scores_gemma":[0.00030815808,0.000021912938,0.00078395114,0.000096888754,0.000010509484,0.000007146653,0.00005072297,0.9749197,0.0061441613,0.010030197,0.0073577506,0.00026891215],"about_ca_topic_score_codex":0.00017344537,"about_ca_topic_score_gemma":0.0001903849,"teacher_disagreement_score":0.8902606,"about_ca_system_score_codex":0.00018022634,"about_ca_system_score_gemma":0.00003515249,"threshold_uncertainty_score":0.87431484},"labels":[],"label_agreement":null},{"id":"W2171967797","doi":"10.1109/icc.2006.254858","title":"Multi-Scale Queuing Analysis of Long-Range Dependent Traffic and Variable Service Rates","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Queue; Queueing theory; Variable (mathematics); Computer science; Range (aeronautics); Scale (ratio); Service (business); Real-time computing; Mathematics; Computer network; Engineering; Physics","score_opus":0.051232693595476636,"score_gpt":0.307988660002505,"score_spread":0.25675596640702836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171967797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121190466,0.00054486305,0.85305434,0.009985465,0.00044112027,0.00035561214,0.0001480986,0.00023480231,0.014045202],"genre_scores_gemma":[0.96929383,0.0001561082,0.029442653,0.00029842847,0.00003283077,0.00004712485,0.00007846061,0.0000068630297,0.0006436981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870723,0.00013390122,0.00040156138,0.00029907867,0.00029195176,0.00016628175],"domain_scores_gemma":[0.9978775,0.00028565255,0.00021740333,0.0009793278,0.0005825547,0.000057594047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027434705,0.000148141,0.00023926071,0.00032189037,0.00016154227,0.00017608512,0.0017811888,0.00006961356,0.000069897265],"category_scores_gemma":[0.000014035113,0.00015120268,0.00007233875,0.00073121337,0.00008663935,0.00028062976,0.00018451881,0.00018436294,0.000019449913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006795244,0.0023010238,0.028507005,0.000030706065,0.001648989,0.000008040475,0.0011625659,0.30061924,0.0049488572,0.5695506,0.0009300291,0.090224996],"study_design_scores_gemma":[0.00042852995,0.000019137766,0.016933464,0.000037136426,0.00011090969,0.0000032539187,0.00004330461,0.98160666,0.000068541354,0.00028672232,0.00031394,0.0001484175],"about_ca_topic_score_codex":0.00063890265,"about_ca_topic_score_gemma":0.006702358,"teacher_disagreement_score":0.84810334,"about_ca_system_score_codex":0.000046146397,"about_ca_system_score_gemma":0.000086496104,"threshold_uncertainty_score":0.6165866},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.052186951716863515,"score_gpt":0.3070467231362634,"score_spread":0.2548597714193999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176074649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020798817,0.00009848028,0.83619386,0.007021879,0.0012647258,0.0005905353,0.000029479232,0.00036412323,0.13363811],"genre_scores_gemma":[0.9820475,0.00015021302,0.016364543,0.0003255634,0.00016652883,0.00017198874,0.00008742844,0.000019055347,0.0006671599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788266,0.00020959988,0.0006412972,0.00046920887,0.00040967728,0.00038756535],"domain_scores_gemma":[0.9969995,0.0003779068,0.00026659688,0.0019716776,0.00030795424,0.00007633473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041246042,0.00023889731,0.00022302392,0.00020655069,0.00020544346,0.00034498263,0.004181127,0.00012478993,0.00004729028],"category_scores_gemma":[0.000037970207,0.00025402242,0.00009351423,0.0004131808,0.000135978,0.00049596425,0.0006737741,0.000616309,0.00009382705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009804187,0.00047094363,0.002923332,0.0000016974778,0.00001598936,0.000009812437,0.00016317065,0.037855905,0.00041629383,0.9341258,0.0008890835,0.023118198],"study_design_scores_gemma":[0.00048726832,0.000026722137,0.010647644,0.00012377727,0.0000026506477,0.0000075272737,0.00003307204,0.98383474,0.00009158309,0.0034542342,0.0010270156,0.00026375824],"about_ca_topic_score_codex":0.0012487415,"about_ca_topic_score_gemma":0.003685801,"teacher_disagreement_score":0.9612487,"about_ca_system_score_codex":0.00024035135,"about_ca_system_score_gemma":0.00010994349,"threshold_uncertainty_score":0.9999912},"labels":[],"label_agreement":null},{"id":"W3145795915","doi":"10.1109/icc.2006.255068","title":"Dynamically Anchored Conferencing Handoff for Dual-Mode Cellular/WLAN Handsets","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada); McMaster University","funders":"","keywords":"Handover; Handset; Computer network; Computer science; Bridging (networking); Scalability; Default gateway; Gateway (web page); Dual mode; Telecommunications; Engineering; Operating system","score_opus":0.042650692150154886,"score_gpt":0.30214398654551694,"score_spread":0.25949329439536206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3145795915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17919393,0.0009009863,0.57721835,0.004698133,0.005515256,0.0027284229,0.003989804,0.0017648551,0.22399028],"genre_scores_gemma":[0.99136454,0.00018606127,0.0053380528,0.00009652402,0.00034846622,0.00033066628,0.0014452258,0.00005605844,0.00083438674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981682,0.000090173264,0.00062262715,0.0003505729,0.00035942087,0.00040902433],"domain_scores_gemma":[0.9975793,0.00035543324,0.00013804526,0.0012824025,0.00054518844,0.000099676115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002744523,0.00032418844,0.0003178838,0.00019121634,0.0002631448,0.00023884536,0.0011553719,0.00019666516,0.00017683364],"category_scores_gemma":[0.000052711363,0.00036254557,0.00016037465,0.00015444342,0.00018407451,0.00022762435,0.00012726271,0.00047010885,0.00007713387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004431045,0.0019172115,0.002438907,0.0002318957,0.0007216572,0.000014341184,0.001109559,0.07790135,0.1659885,0.7039349,0.027394613,0.017903982],"study_design_scores_gemma":[0.0011643795,0.000058608453,0.0011863444,0.00013593076,0.000044772707,0.000005378688,0.00005746818,0.96517706,0.004313604,0.017767722,0.009613618,0.00047513464],"about_ca_topic_score_codex":0.0003261214,"about_ca_topic_score_gemma":0.0038395345,"teacher_disagreement_score":0.8872757,"about_ca_system_score_codex":0.00030742644,"about_ca_system_score_gemma":0.00009742828,"threshold_uncertainty_score":0.99988264},"labels":[],"label_agreement":null},{"id":"W3148423167","doi":"10.1109/icc.2006.255489","title":"Bluetooth Receiver Design Based on Laurent's Decomposition","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Bluetooth and Wireless Communication Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bluetooth; Computer science; Robustness (evolution); Detector; Electronic engineering; Transmission (telecommunications); Equalization (audio); Wireless; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.08956790192202022,"score_gpt":0.33234795544621515,"score_spread":0.24278005352419493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3148423167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007227419,0.0000793153,0.8087544,0.05237004,0.000479553,0.00037717892,0.000048552614,0.00091986806,0.13624835],"genre_scores_gemma":[0.88991755,0.00020639769,0.10763371,0.0012013323,0.000044468175,0.0001692532,0.00014014012,0.000015466936,0.0006716724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981323,0.0003016904,0.0004203404,0.00039416898,0.00049178523,0.00025972098],"domain_scores_gemma":[0.99539703,0.0005323906,0.00025839216,0.0033155617,0.00043477872,0.000061857834],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00031600575,0.00023820711,0.00017833567,0.00045424947,0.0004101186,0.0003927842,0.006189025,0.00014513785,0.000095839954],"category_scores_gemma":[0.000059669008,0.00023860703,0.000101126956,0.00041730166,0.00021580371,0.00044828022,0.00031587752,0.00046678676,0.00037056603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031294043,0.0007188383,0.00019529299,0.000002451868,0.00001984054,0.0000021016797,0.00003814339,0.008413436,0.0014030441,0.9516591,0.019956391,0.017560065],"study_design_scores_gemma":[0.0007647012,0.00021274129,0.0022388306,0.00014170268,0.000009275339,0.000005103852,0.0000312774,0.9141318,0.010137927,0.044990346,0.02687695,0.000459301],"about_ca_topic_score_codex":0.00012829121,"about_ca_topic_score_gemma":0.0001247473,"teacher_disagreement_score":0.9066688,"about_ca_system_score_codex":0.00017658035,"about_ca_system_score_gemma":0.00015427284,"threshold_uncertainty_score":0.99918795},"labels":[],"label_agreement":null}]}