{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060245812,0.0009807963,0.9359186,0.00024515044,0.000075352626,0.000051042865,0.000009910599,0.00037205566,0.0021012598],"genre_scores_gemma":[0.9590616,0.0002832209,0.03958328,0.000048985698,0.000062882755,0.000054881108,0.00001179088,0.000021576896,0.0008717073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785054,0.0008738624,0.00008488974,0.00018591982,0.00076227624,0.0002425018],"domain_scores_gemma":[0.99862087,0.0007545889,0.0002489824,0.00013487674,0.0001692085,0.00007144706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023700746,0.0005786932,0.0007886626,0.0005406448,0.00058843713,0.0012585063,0.0010213066,0.00091367256,0.00052161864],"category_scores_gemma":[0.0067130076,0.00033694095,0.00035856137,0.00075315044,0.0010579173,0.0012223527,0.00083992525,0.00091100426,0.00008081845],"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.00022840098,0.00014982019,0.0011077342,0.000064540975,0.000061138344,0.000106546155,0.00013040708,0.84462386,0.008398455,0.031208795,0.0008638041,0.11305653],"study_design_scores_gemma":[0.000010699591,0.000030983832,0.00017874641,0.0000027334809,0.000010383799,0.00002540122,0.000006206981,0.99383545,0.001055204,0.004566629,0.00026950473,0.000008164589],"about_ca_topic_score_codex":0.004762508,"about_ca_topic_score_gemma":0.002696361,"teacher_disagreement_score":0.004762508,"about_ca_system_score_codex":0.001127603,"about_ca_system_score_gemma":0.001562255,"threshold_uncertainty_score":0.01253432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7485362,0.0008511914,0.24499607,0.00025370315,0.000059964663,0.000054431977,0.00009272817,0.0004692596,0.0046863817],"genre_scores_gemma":[0.98198754,0.000177741,0.01733786,0.000032502892,0.000012991222,0.000019556126,0.000034182915,0.000061006835,0.00033663295],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986652,0.00040269925,0.00006553942,0.00014928605,0.0005804541,0.00013669726],"domain_scores_gemma":[0.98232585,0.011769503,0.0026542519,0.0009290779,0.0020830857,0.00023814793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092266884,0.00062184845,0.0003083645,0.00050931814,0.0003581552,0.00064297224,0.00038869333,0.0006098519,0.00089936116],"category_scores_gemma":[0.014170826,0.00025823282,0.000190851,0.0004974723,0.0004987044,0.0006581183,0.0003468498,0.0005267936,0.0002910788],"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.0021151328,0.00019204864,0.013624189,0.00049685594,0.00015655566,0.00062442047,0.0005811642,0.40903398,0.4301264,0.012820352,0.0006225783,0.12960632],"study_design_scores_gemma":[0.00007094105,0.0010878831,0.006799166,0.00006256873,0.00012300491,0.0016941112,0.00012379409,0.5974623,0.3877754,0.0021837603,0.0025333364,0.00008375456],"about_ca_topic_score_codex":0.0004798609,"about_ca_topic_score_gemma":0.0005067627,"teacher_disagreement_score":0.00092266884,"about_ca_system_score_codex":0.0005833452,"about_ca_system_score_gemma":0.0003268048,"threshold_uncertainty_score":0.004879594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13523357,0.008277465,0.8130715,0.0010493001,0.00021367038,0.00012868638,0.0006257589,0.0011956533,0.04020451],"genre_scores_gemma":[0.95137215,0.0021966987,0.041387226,0.0002221193,0.00015871714,0.00016386174,0.00040581534,0.00017373133,0.003919723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955052,0.0012664673,0.00012099055,0.0002955655,0.0019078712,0.00090374314],"domain_scores_gemma":[0.9723976,0.020824112,0.0016865872,0.0016482089,0.003113956,0.0003295269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048680454,0.0020058297,0.0015649906,0.0013433971,0.0007815824,0.0024732419,0.0010427177,0.0012970614,0.003962293],"category_scores_gemma":[0.023224397,0.00062335236,0.0006561705,0.0016392416,0.002034278,0.002687616,0.0026904293,0.0015763359,0.0009273492],"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.00030977392,0.000044317138,0.00074369746,0.00016401558,0.00008030033,0.000109505985,0.00009471965,0.9374034,0.005884725,0.036495134,0.0011642381,0.01750619],"study_design_scores_gemma":[0.000012745627,0.0000934588,0.0003572083,0.000058904952,0.000029560884,0.00008171345,0.000024149473,0.985457,0.0027865001,0.010360611,0.00070891407,0.000029222285],"about_ca_topic_score_codex":0.004153448,"about_ca_topic_score_gemma":0.003706353,"teacher_disagreement_score":0.0048680454,"about_ca_system_score_codex":0.0031430766,"about_ca_system_score_gemma":0.0019010857,"threshold_uncertainty_score":0.025744975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038636897,0.000109215245,0.9926871,0.00015931147,0.00002059157,0.000007556153,0.000021840757,0.000049825543,0.00308085],"genre_scores_gemma":[0.7368475,0.001611649,0.25003177,0.00030292213,0.0003962099,0.00013693764,0.00012923309,0.00015108561,0.010392667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996611,0.000103864055,0.000013284103,0.000053692984,0.0001310459,0.000037009504],"domain_scores_gemma":[0.99951506,0.00020290552,0.000060391092,0.00008087913,0.000108504595,0.000032176285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000776915,0.0004856664,0.00044442486,0.0005982692,0.00044769765,0.0014855518,0.0008521476,0.00058660883,0.0016312724],"category_scores_gemma":[0.0016387634,0.00020881997,0.000587096,0.0007880567,0.0012621075,0.0028258371,0.0007731609,0.001434667,0.00035913184],"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.000014115871,0.000012989002,0.00021670523,0.000022804063,0.000008729906,0.000060324597,0.000087745655,0.16420704,0.0027552492,0.81766593,0.00066575775,0.014282564],"study_design_scores_gemma":[0.0000027427009,0.000010601543,0.00008140258,0.000005690568,0.0000034712505,0.000030276107,0.000025009025,0.6930219,0.00079171086,0.3018439,0.0041758567,0.0000074037457],"about_ca_topic_score_codex":0.0020394216,"about_ca_topic_score_gemma":0.00083603413,"teacher_disagreement_score":0.0020394216,"about_ca_system_score_codex":0.00092856266,"about_ca_system_score_gemma":0.0007633694,"threshold_uncertainty_score":0.006737232},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17820314,0.0010519556,0.80283934,0.00083929463,0.0004333333,0.00022704032,0.00042817922,0.0013257798,0.014651972],"genre_scores_gemma":[0.8315275,0.00037012374,0.16078636,0.00038684788,0.00015287798,0.0001354256,0.0002491224,0.00002284137,0.0063689537],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919695,0.00015096199,0.000049577546,0.00012610147,0.0003557834,0.00012059765],"domain_scores_gemma":[0.9995322,0.000059242342,0.00010910913,0.00007753312,0.00017727616,0.00004454149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006150541,0.0006269239,0.0005564089,0.0005370406,0.0004812812,0.00089118455,0.0009050614,0.0009089161,0.0016398028],"category_scores_gemma":[0.0009617305,0.00023871119,0.00024997597,0.0005141897,0.00041747594,0.0008341248,0.0009929787,0.0005031367,0.0006491471],"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.0018267856,0.00021096824,0.001812203,0.0003594469,0.0001049913,0.000898218,0.0002894419,0.035875555,0.6204006,0.09632938,0.004737973,0.23715444],"study_design_scores_gemma":[0.00047816924,0.002181396,0.0018829501,0.00010225005,0.00023059234,0.0030804523,0.00009927934,0.56296974,0.38797906,0.01171343,0.029039472,0.00024325773],"about_ca_topic_score_codex":0.0007813977,"about_ca_topic_score_gemma":0.0014402192,"teacher_disagreement_score":0.0016398028,"about_ca_system_score_codex":0.0006119577,"about_ca_system_score_gemma":0.0010413527,"threshold_uncertainty_score":0.0054857135},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066803016,0.00037005602,0.93132,0.000095738986,0.00005208749,0.000020842397,0.00004165199,0.00054991804,0.0007466947],"genre_scores_gemma":[0.86268663,0.00040231922,0.13545889,0.00005782255,0.000057151192,0.000041427375,0.00009541541,0.000025355559,0.0011749269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971956,0.00007706388,0.000012957363,0.000036467336,0.000106841995,0.00004703911],"domain_scores_gemma":[0.99891305,0.0005920308,0.0001275445,0.00013394468,0.00020058142,0.000032892716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048642274,0.00045563135,0.00037266506,0.00020862653,0.00022342638,0.000300076,0.00051068683,0.0003399453,0.00044315317],"category_scores_gemma":[0.0026700827,0.00024423838,0.00017168971,0.00027839726,0.00036166125,0.0007300434,0.00041877374,0.0006592196,0.00021869804],"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.0007191446,0.000093627015,0.0023236643,0.00013419754,0.00006325884,0.00045651122,0.00037894593,0.6146269,0.09746505,0.007837257,0.0020062947,0.2738951],"study_design_scores_gemma":[0.000013070779,0.000076966055,0.00027975516,0.0000052915375,0.000007628533,0.0000657152,0.000009312445,0.9891635,0.009242747,0.0007145362,0.000410101,0.00001131393],"about_ca_topic_score_codex":0.0022112506,"about_ca_topic_score_gemma":0.0029198702,"teacher_disagreement_score":0.0022112506,"about_ca_system_score_codex":0.00018243775,"about_ca_system_score_gemma":0.00073374,"threshold_uncertainty_score":0.004396796},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39423853,0.004659073,0.58896345,0.0006405486,0.00007723583,0.000058650214,0.00015189222,0.00039992295,0.010810636],"genre_scores_gemma":[0.9882196,0.00087065756,0.009631366,0.000059119906,0.000050457715,0.000020573361,0.000047001453,0.000042749052,0.0010584863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794894,0.00074484217,0.00005445607,0.00014960112,0.00081855094,0.0002834967],"domain_scores_gemma":[0.988437,0.009146295,0.00073853007,0.0004377883,0.0011266776,0.0001136415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028388305,0.0010946399,0.0007970307,0.0008658878,0.000546596,0.0013657028,0.0005982296,0.0011122667,0.0016274444],"category_scores_gemma":[0.013197239,0.00036974292,0.00046637616,0.0007214156,0.0013304113,0.0018257692,0.0010409883,0.00080693624,0.00031312768],"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.00015593649,0.000021692676,0.0015024918,0.00009609534,0.000060800103,0.00013900994,0.00008808102,0.9681497,0.0064882305,0.0155271245,0.00013616974,0.007634673],"study_design_scores_gemma":[0.000008740542,0.000100095014,0.00081963744,0.000015359996,0.00001802309,0.0001678506,0.000029034954,0.9906503,0.0037035511,0.0042685503,0.00020128668,0.000017581257],"about_ca_topic_score_codex":0.002247271,"about_ca_topic_score_gemma":0.000991265,"teacher_disagreement_score":0.0028388305,"about_ca_system_score_codex":0.0014979808,"about_ca_system_score_gemma":0.00086635613,"threshold_uncertainty_score":0.015013397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014192638,0.00035682975,0.99537283,0.00018771196,0.0000666196,0.00007994787,0.000045905083,0.00028947814,0.002181338],"genre_scores_gemma":[0.12860747,0.0011791792,0.86410713,0.00016516725,0.00020877823,0.0007546311,0.00020805334,0.00008673805,0.004682741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993673,0.00017572237,0.000045810073,0.00007035148,0.00027380296,0.00006706797],"domain_scores_gemma":[0.99973553,0.000074618736,0.000041200954,0.000040936033,0.00007625383,0.00003141879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017395134,0.00083319424,0.00069599913,0.0005580088,0.0007327774,0.001404734,0.0021216392,0.0008905665,0.00237141],"category_scores_gemma":[0.0012076998,0.0003587344,0.0008017657,0.0005415631,0.0006938732,0.0014248794,0.0012479905,0.0013876627,0.00074561255],"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.000039610615,0.00012931746,0.00032433515,0.00019549645,0.000069258334,0.00033775182,0.00019392683,0.4666947,0.008588909,0.417793,0.0072791977,0.09835441],"study_design_scores_gemma":[0.000028816152,0.00008215897,0.00011494868,0.000036113644,0.000030276899,0.00012655683,0.00003648147,0.91652524,0.0016351414,0.051805615,0.029548023,0.00003065022],"about_ca_topic_score_codex":0.0039505707,"about_ca_topic_score_gemma":0.0045529185,"teacher_disagreement_score":0.0039505707,"about_ca_system_score_codex":0.0010191692,"about_ca_system_score_gemma":0.0015373292,"threshold_uncertainty_score":0.00919956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07825242,0.000230461,0.9168358,0.00036429087,0.000043930842,0.00014249756,0.00005743969,0.000089899775,0.0039832266],"genre_scores_gemma":[0.941548,0.0002405487,0.053133726,0.000116723684,0.000036664063,0.0002923782,0.0000672232,0.000038724564,0.004526044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972132,0.0015857472,0.00008437955,0.00031052207,0.000453053,0.00035306864],"domain_scores_gemma":[0.99267673,0.005649904,0.00068557024,0.00018065411,0.00046057702,0.0003465834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036639501,0.0012873791,0.0017426643,0.0006058698,0.00068644516,0.0015662146,0.0021458718,0.0019229,0.0014927563],"category_scores_gemma":[0.0104279,0.0006508733,0.0006676869,0.0009815188,0.002154817,0.002581362,0.0014793137,0.0016430941,0.00024491837],"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.00012583057,0.00005724764,0.0003633621,0.000043152904,0.000024303414,0.00028167907,0.0001542947,0.9486949,0.0009137871,0.045537792,0.0002838704,0.0035197479],"study_design_scores_gemma":[0.00001883193,0.000037550326,0.000049623945,0.0000021677,0.0000036103306,0.000020616522,0.000019789404,0.99015397,0.00010862978,0.0094718225,0.000107685475,0.000005699142],"about_ca_topic_score_codex":0.0052117137,"about_ca_topic_score_gemma":0.0029150972,"teacher_disagreement_score":0.0052117137,"about_ca_system_score_codex":0.0019972564,"about_ca_system_score_gemma":0.0013051654,"threshold_uncertainty_score":0.019377112},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023229204,0.00015932883,0.99493545,0.00015074697,0.000022331253,0.000016268657,0.000019147936,0.000061491155,0.0023123445],"genre_scores_gemma":[0.46134531,0.0014923448,0.5231871,0.000395017,0.00028776232,0.00026932952,0.00020131242,0.00038532238,0.012436583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952626,0.00016625399,0.00001247484,0.00007901384,0.00015196078,0.00006399938],"domain_scores_gemma":[0.9996045,0.00024454357,0.000025414722,0.000026804055,0.00007637556,0.000022414344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000981078,0.0015800272,0.00095218635,0.00048013747,0.00048074542,0.001182993,0.0010716848,0.00091485947,0.0023350348],"category_scores_gemma":[0.0016316747,0.0005471141,0.0006542615,0.0007160914,0.0010837585,0.0011443698,0.0011361424,0.001712414,0.0005562084],"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.000045493503,0.00005875865,0.00019197131,0.00009378187,0.000021862605,0.00006138083,0.00005624785,0.8850026,0.0033999248,0.061062053,0.0028500224,0.04715595],"study_design_scores_gemma":[0.0000038462767,0.000018465806,0.00003158252,0.0000035300934,0.0000028975905,0.0000106088155,0.0000063662146,0.9915991,0.0005261819,0.0069463234,0.000847724,0.0000033075619],"about_ca_topic_score_codex":0.0024901135,"about_ca_topic_score_gemma":0.00222472,"teacher_disagreement_score":0.0024901135,"about_ca_system_score_codex":0.0011060749,"about_ca_system_score_gemma":0.0011383487,"threshold_uncertainty_score":0.00802511},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53471386,0.0022874367,0.4117237,0.0011733876,0.00007563604,0.000089658104,0.0018827517,0.00059748394,0.047456015],"genre_scores_gemma":[0.9947955,0.00059494784,0.0032544425,0.00003859354,0.000040930012,0.00005122184,0.00012723467,0.000022555789,0.0010746673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810827,0.00052254996,0.000045534103,0.00018733776,0.00032068838,0.00081563805],"domain_scores_gemma":[0.98693746,0.010272365,0.0008748405,0.00059196755,0.0010213534,0.00030205204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016576201,0.00093322125,0.0012849094,0.001044182,0.00067613565,0.0022075325,0.0011559812,0.00093200844,0.004017182],"category_scores_gemma":[0.011329915,0.00041440994,0.0003674021,0.0015261379,0.0026732641,0.0016321517,0.0014188193,0.00075030327,0.00048116123],"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.000075916054,0.000015288932,0.00058610475,0.00008095484,0.000027028513,0.00023314693,0.000088902765,0.931894,0.0014596831,0.06120068,0.0008987274,0.0034394588],"study_design_scores_gemma":[0.000014215575,0.000024518033,0.0006495096,0.00002755614,0.0000124650605,0.00011372868,0.00006175395,0.93819785,0.0006804768,0.0596139,0.00058067095,0.000023451339],"about_ca_topic_score_codex":0.007279491,"about_ca_topic_score_gemma":0.0026331362,"teacher_disagreement_score":0.007279491,"about_ca_system_score_codex":0.0020243842,"about_ca_system_score_gemma":0.001325906,"threshold_uncertainty_score":0.014688015},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012848084,0.00024734045,0.98452824,0.00015185759,0.00003001324,0.00006118194,0.000046364636,0.000153059,0.0019338395],"genre_scores_gemma":[0.3373384,0.00076215225,0.6600268,0.00009274552,0.000045956513,0.00025985015,0.00022129883,0.00008997316,0.0011628229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995803,0.00017363516,0.000031585743,0.000041634295,0.00013923066,0.0000336908],"domain_scores_gemma":[0.9993703,0.00032863754,0.00010186077,0.00007243193,0.00009807726,0.000028766874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009711439,0.00038039658,0.00027220082,0.00067699864,0.0003676274,0.0008589616,0.0006753143,0.0003557166,0.0014675739],"category_scores_gemma":[0.0019617465,0.00032850564,0.00038116708,0.00050064526,0.0005589683,0.0012487515,0.00065506046,0.000474998,0.00018986617],"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.000052251427,0.00004680881,0.00048436265,0.0002804346,0.000035425324,0.00019436085,0.00010248468,0.8075569,0.02071833,0.07014277,0.0013945854,0.09899124],"study_design_scores_gemma":[0.00003699621,0.000105912004,0.000117128075,0.000029219116,0.000023971534,0.00009584883,0.000056723165,0.922648,0.005506519,0.06268617,0.008679807,0.0000136282],"about_ca_topic_score_codex":0.00038996595,"about_ca_topic_score_gemma":0.0009205706,"teacher_disagreement_score":0.0014675739,"about_ca_system_score_codex":0.0006431828,"about_ca_system_score_gemma":0.00056382903,"threshold_uncertainty_score":0.0051359534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16684762,0.0028949366,0.80979645,0.00034800384,0.00008143935,0.00006313235,0.00021810936,0.00039055396,0.01935971],"genre_scores_gemma":[0.9834146,0.0013697399,0.012684677,0.000055900044,0.000045638124,0.00005269232,0.00009879933,0.00002962256,0.0022483484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956363,0.00011831864,0.000015469652,0.000061528364,0.00014990006,0.00009115183],"domain_scores_gemma":[0.99760455,0.0016050776,0.00014182129,0.00014001498,0.0003758792,0.00013261409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000637935,0.00040793014,0.0004462456,0.00074929715,0.00036126445,0.0011301591,0.00089459564,0.00037286902,0.002387248],"category_scores_gemma":[0.0041048736,0.00020068034,0.00021666611,0.0006341194,0.0011991679,0.002375765,0.0009807425,0.0006180218,0.00023410613],"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.00015083104,0.000035999354,0.0010942337,0.00025645114,0.000050272618,0.00036444466,0.00029528717,0.4964838,0.01139253,0.44992036,0.0018415259,0.03811425],"study_design_scores_gemma":[0.000008743894,0.00007891826,0.00040185376,0.000032227803,0.00001163231,0.00019084684,0.000120108394,0.8546025,0.003558467,0.1388647,0.0021028991,0.000027146089],"about_ca_topic_score_codex":0.00088640396,"about_ca_topic_score_gemma":0.0003243947,"teacher_disagreement_score":0.002387248,"about_ca_system_score_codex":0.0006239295,"about_ca_system_score_gemma":0.0005121419,"threshold_uncertainty_score":0.007986188},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13110101,0.00036062923,0.8651513,0.00017081037,0.00006404571,0.000048577112,0.000024832303,0.00022268484,0.0028561358],"genre_scores_gemma":[0.9714578,0.00010270358,0.027351387,0.000040074043,0.000035933273,0.000036379075,0.000011330978,0.000017212978,0.00094716996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997459,0.0012096396,0.00008919259,0.00028797484,0.00058009755,0.00037413964],"domain_scores_gemma":[0.9967894,0.0018721373,0.0003916573,0.00047797858,0.00032164538,0.00014714655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044631436,0.0003879664,0.0006475439,0.0006153493,0.0008264923,0.0011477929,0.0015050727,0.00056504004,0.0007364752],"category_scores_gemma":[0.0066555543,0.00037645875,0.00046622258,0.00045817555,0.0013851632,0.0016483951,0.0011909804,0.00070729817,0.00010519659],"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.00043101187,0.000080588456,0.0013951727,0.00005018485,0.00005153644,0.00016382511,0.00029324603,0.75041395,0.0067724874,0.21429363,0.0005990074,0.025455315],"study_design_scores_gemma":[0.00001795783,0.000062574225,0.00016229186,0.0000041016265,0.000010984951,0.00003942854,0.000016460039,0.9721791,0.0015889058,0.025285969,0.00062053493,0.000011705413],"about_ca_topic_score_codex":0.0015979717,"about_ca_topic_score_gemma":0.00095915457,"teacher_disagreement_score":0.0044631436,"about_ca_system_score_codex":0.001537109,"about_ca_system_score_gemma":0.00086408725,"threshold_uncertainty_score":0.023603678},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006060433,0.00034845824,0.9905372,0.000101250305,0.00007084215,0.000043292966,0.00009888428,0.00016582393,0.0025738804],"genre_scores_gemma":[0.4802098,0.0013626819,0.50696266,0.00039017445,0.00023831367,0.00036313932,0.00074063573,0.00010718834,0.009625431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871325,0.00030738302,0.00006477897,0.00021135053,0.00056798285,0.00013528524],"domain_scores_gemma":[0.99765104,0.0008032815,0.0002641265,0.000560444,0.0006563164,0.00006473427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008070863,0.0006154634,0.00063487166,0.000572808,0.00036351502,0.0008955896,0.0012016508,0.00066805264,0.0016752341],"category_scores_gemma":[0.003152464,0.00020100224,0.0004609746,0.00097422895,0.00077405956,0.0012015558,0.00065008353,0.0010526818,0.00078593625],"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.0004350799,0.00008157343,0.0008990187,0.00027356375,0.00007561395,0.0002842426,0.00016022226,0.43347386,0.039045446,0.28222144,0.0044831457,0.23856682],"study_design_scores_gemma":[0.000046451398,0.00014326033,0.00016462106,0.000030046012,0.000018201386,0.00034947295,0.000021358994,0.94312423,0.015767891,0.027209504,0.013090735,0.000034293735],"about_ca_topic_score_codex":0.0020144265,"about_ca_topic_score_gemma":0.0024666358,"teacher_disagreement_score":0.0020144265,"about_ca_system_score_codex":0.0010636122,"about_ca_system_score_gemma":0.0013845052,"threshold_uncertainty_score":0.0077171326},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01653517,0.0011606201,0.97652143,0.00020170624,0.00006192235,0.00007172194,0.00009529618,0.0009788494,0.004373227],"genre_scores_gemma":[0.4292652,0.0018738684,0.5613439,0.0003121778,0.00021316166,0.00022666156,0.0003749878,0.00028242418,0.0061076297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877125,0.0003379524,0.00007988575,0.00015793247,0.00054590806,0.000106990134],"domain_scores_gemma":[0.9979019,0.0010946483,0.00024688675,0.00034301088,0.0003706456,0.00004294354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078730873,0.00083036267,0.00058130245,0.000601054,0.00047335456,0.00093474303,0.0006530782,0.00066295324,0.0030190342],"category_scores_gemma":[0.0043293186,0.00029943645,0.00052425946,0.0010413225,0.0005516152,0.00095447886,0.0005530329,0.0009627449,0.0012714583],"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.0005037779,0.00010239897,0.0007104217,0.00037530088,0.00009379046,0.0003523745,0.00034555432,0.24077529,0.2152783,0.07867076,0.003928344,0.45886374],"study_design_scores_gemma":[0.000050119877,0.0005505369,0.0007413514,0.00008015644,0.00006055305,0.0009910624,0.000053636286,0.7010519,0.24458402,0.030379668,0.021382865,0.000074118594],"about_ca_topic_score_codex":0.0007404125,"about_ca_topic_score_gemma":0.0010878987,"teacher_disagreement_score":0.0030190342,"about_ca_system_score_codex":0.0008059776,"about_ca_system_score_gemma":0.0010201727,"threshold_uncertainty_score":0.010099649},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45944187,0.0008732564,0.53495896,0.00020855946,0.000043435808,0.000042831696,0.00003049767,0.00023010104,0.00417045],"genre_scores_gemma":[0.9849689,0.00014507002,0.0141712185,0.000020743462,0.000012315613,0.000023854709,0.000015552085,0.000025431302,0.0006169061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923766,0.00031055394,0.00002864674,0.00009155109,0.00019187272,0.00013975779],"domain_scores_gemma":[0.9981528,0.001088317,0.00026350463,0.00011581058,0.0002991528,0.0000803125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001706174,0.00065371714,0.00060897204,0.00061485334,0.00036770574,0.00069610856,0.0005856772,0.00042077573,0.0005100488],"category_scores_gemma":[0.0042020264,0.00036452836,0.00026501267,0.00042542687,0.0005673919,0.0008147815,0.0006594729,0.0003344316,0.0001287618],"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.0001534274,0.000050680464,0.0013800068,0.000031984993,0.000030296069,0.00008672502,0.00008841603,0.96652216,0.008430814,0.006056733,0.00033668816,0.016832033],"study_design_scores_gemma":[0.000014170982,0.00007295817,0.0004331032,0.000003521235,0.000011877405,0.000053985525,0.000023576478,0.994651,0.0021366328,0.0023382667,0.00025321447,0.000007781188],"about_ca_topic_score_codex":0.0013472608,"about_ca_topic_score_gemma":0.0013767285,"teacher_disagreement_score":0.001706174,"about_ca_system_score_codex":0.000791216,"about_ca_system_score_gemma":0.0004914981,"threshold_uncertainty_score":0.00902319},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33471525,0.0005299503,0.65817076,0.0003584502,0.00004591,0.00021007376,0.00011464368,0.0011861803,0.004668756],"genre_scores_gemma":[0.57658666,0.00029161817,0.42013758,0.000119257376,0.000031632564,0.00012763422,0.00029536054,0.00011341515,0.002296819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994579,0.00016320484,0.000028554985,0.00011189222,0.000117009346,0.00012145519],"domain_scores_gemma":[0.9990852,0.00040882436,0.00017790313,0.00017369419,0.00006855278,0.00008577503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068119285,0.00072814233,0.0007902801,0.00056945044,0.000758288,0.0006541699,0.0012655715,0.0007741665,0.0014836751],"category_scores_gemma":[0.0015906972,0.00052751886,0.0005881271,0.00078510767,0.0006621214,0.001408124,0.0013368675,0.00064765743,0.00021342513],"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.0012280332,0.0005481731,0.0030055358,0.0005108324,0.00012664014,0.00055624556,0.0006828998,0.5149647,0.066636205,0.04274505,0.00659254,0.36240315],"study_design_scores_gemma":[0.000052333,0.000089986905,0.00031437285,0.000010935323,0.000014527375,0.00012084674,0.000088760586,0.9746772,0.010900287,0.012255032,0.0014648256,0.000010953159],"about_ca_topic_score_codex":0.0015964904,"about_ca_topic_score_gemma":0.0033341474,"teacher_disagreement_score":0.0015964904,"about_ca_system_score_codex":0.0004871763,"about_ca_system_score_gemma":0.0005663187,"threshold_uncertainty_score":0.004963398},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030188972,0.0008796693,0.96104664,0.0002015394,0.000067445464,0.00002493667,0.0000364706,0.00020982417,0.0073444545],"genre_scores_gemma":[0.84887403,0.0018501111,0.1381404,0.00022118817,0.000111931404,0.000064677406,0.00008485517,0.000047913596,0.010604895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979943,0.00004365684,0.000009585892,0.00002892837,0.000097438475,0.000021020222],"domain_scores_gemma":[0.9998242,0.00009823107,0.000021046259,0.00001674573,0.00003600455,0.000003713879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022145968,0.0003256804,0.0002713954,0.00019638853,0.00020734327,0.00053117133,0.00020971026,0.00044808615,0.0027670327],"category_scores_gemma":[0.0007092425,0.00015591648,0.00021314286,0.0002157679,0.00029452384,0.00050982914,0.00034795763,0.0003757576,0.00076295197],"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.00033382667,0.000055148234,0.0010619285,0.00043598685,0.00008548273,0.00027352307,0.0002352077,0.47729194,0.1815658,0.1219316,0.0023784763,0.21435107],"study_design_scores_gemma":[0.000015540252,0.000065362416,0.00045182815,0.000038967093,0.000020778762,0.0001684529,0.00004539282,0.9467926,0.029674433,0.016114546,0.006589266,0.000022751987],"about_ca_topic_score_codex":0.0005379438,"about_ca_topic_score_gemma":0.0008020355,"teacher_disagreement_score":0.0027670327,"about_ca_system_score_codex":0.0004521126,"about_ca_system_score_gemma":0.00028126207,"threshold_uncertainty_score":0.009256601},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009027967,0.000635342,0.98052925,0.00034239577,0.00013773175,0.0001833133,0.00021636508,0.00061615935,0.008311522],"genre_scores_gemma":[0.34739727,0.0009987287,0.638572,0.0004081566,0.00019386847,0.00074251316,0.001341518,0.00033430368,0.010011685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989542,0.00028396363,0.00006587814,0.0002096532,0.00031637042,0.000169897],"domain_scores_gemma":[0.9988875,0.0005388772,0.00009035268,0.00014137656,0.00028302142,0.00005888795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001104797,0.0007891708,0.0010715638,0.0012803815,0.0007812093,0.0012327895,0.0015453126,0.0008915412,0.007601897],"category_scores_gemma":[0.0036370235,0.00038693406,0.0005202593,0.0014972663,0.00052896095,0.0015129137,0.0011753764,0.0009406194,0.0018593797],"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.00030668243,0.0001317195,0.0013484476,0.0001638466,0.00008165472,0.00007008745,0.00008172522,0.5469903,0.005645952,0.061205804,0.014504472,0.36946937],"study_design_scores_gemma":[0.000050960083,0.000041003652,0.00023076315,0.000014149606,0.000015531441,0.00007386932,0.000021563146,0.9676458,0.0019143204,0.021140572,0.008837999,0.000013425842],"about_ca_topic_score_codex":0.0030559783,"about_ca_topic_score_gemma":0.0032151025,"teacher_disagreement_score":0.007601897,"about_ca_system_score_codex":0.0013658134,"about_ca_system_score_gemma":0.002889011,"threshold_uncertainty_score":0.025430858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03958264,0.0022114574,0.9537034,0.00045690412,0.00015831598,0.0000748364,0.00005664219,0.00012966739,0.003626269],"genre_scores_gemma":[0.94485396,0.0018130331,0.04893796,0.00018878495,0.00026914763,0.00014867897,0.00008274599,0.000067667475,0.0036379537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833894,0.0006010894,0.000065177235,0.00014902337,0.00062070583,0.00022493213],"domain_scores_gemma":[0.99695396,0.0018537636,0.00021888799,0.00015065171,0.0007021664,0.00012061324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029035194,0.0010321985,0.00079833955,0.0009250393,0.0005861776,0.0012922285,0.0015451448,0.0008647553,0.000939276],"category_scores_gemma":[0.007464917,0.00048026492,0.0006564864,0.0006363219,0.0013108691,0.0014021076,0.0010684767,0.00096247805,0.000161848],"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.00006128664,0.00006825371,0.00076030655,0.00011348642,0.000051299678,0.00016058225,0.00017408031,0.8779025,0.0036194846,0.10446484,0.0009444552,0.0116793895],"study_design_scores_gemma":[0.0000038363087,0.000012168183,0.00009271481,0.000003509467,0.0000049814785,0.000009670673,0.000010379145,0.99216956,0.00012123538,0.0073572462,0.00021071256,0.000003932977],"about_ca_topic_score_codex":0.010168679,"about_ca_topic_score_gemma":0.0032938186,"teacher_disagreement_score":0.010168679,"about_ca_system_score_codex":0.0032896134,"about_ca_system_score_gemma":0.0018355043,"threshold_uncertainty_score":0.023867905},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27776012,0.0015706752,0.6844679,0.0018500601,0.00024444362,0.000074721276,0.001162984,0.0019325551,0.030936582],"genre_scores_gemma":[0.9243158,0.0007210763,0.063639134,0.0003060809,0.00008699653,0.000096141855,0.0006732037,0.00019285642,0.009968592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811375,0.0005285119,0.000081316175,0.00022528987,0.00085456995,0.00019660067],"domain_scores_gemma":[0.9973833,0.0017222514,0.00019206552,0.00015644808,0.0004951773,0.000050811166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025514767,0.0010282231,0.0012183493,0.00051095977,0.000560989,0.0012125422,0.00082274654,0.0026496337,0.0051531144],"category_scores_gemma":[0.005877164,0.00034132742,0.00033069486,0.0005057103,0.0011811621,0.001754993,0.0009122704,0.0008187476,0.0019717943],"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.0018166996,0.00014396688,0.0072981,0.0010135825,0.00019419992,0.00092828216,0.00060823065,0.7560089,0.07899446,0.08927977,0.004352207,0.05936152],"study_design_scores_gemma":[0.000089507914,0.00036297928,0.005863434,0.00014004712,0.00006420898,0.0014571884,0.00010494238,0.94086444,0.028246934,0.019832848,0.0028745,0.00009898217],"about_ca_topic_score_codex":0.0009136699,"about_ca_topic_score_gemma":0.0005550031,"teacher_disagreement_score":0.0051531144,"about_ca_system_score_codex":0.0010600782,"about_ca_system_score_gemma":0.0007111622,"threshold_uncertainty_score":0.017238915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42287454,0.00076727377,0.56731373,0.00017424831,0.000032322518,0.000045796216,0.00009531926,0.0003731243,0.008323708],"genre_scores_gemma":[0.9830329,0.0003243629,0.015874963,0.000030495945,0.000015031796,0.00001933011,0.00003663508,0.00000838788,0.00065788114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994824,0.00018526378,0.000018237666,0.000047547375,0.00017247876,0.00009399372],"domain_scores_gemma":[0.99905616,0.00052634126,0.00014262543,0.0001325842,0.00011021838,0.0000321239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007791381,0.0007450816,0.0006549325,0.00034047515,0.0002645474,0.00085392647,0.0004984991,0.00040241753,0.00066789024],"category_scores_gemma":[0.001642625,0.00023694073,0.00042337453,0.0011972482,0.00082943623,0.00063181104,0.00064110896,0.0002676823,0.00017375924],"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.00015280885,0.000012295004,0.0015101223,0.00006191784,0.00008041563,0.00041860022,0.00008479695,0.94149464,0.007851539,0.032363523,0.0002733898,0.015696026],"study_design_scores_gemma":[0.000024568926,0.00008309182,0.0007984004,0.000007805035,0.000033930635,0.00017495795,0.000019684232,0.98275626,0.0034237355,0.012356324,0.0003053408,0.000015886582],"about_ca_topic_score_codex":0.001731599,"about_ca_topic_score_gemma":0.0019928026,"teacher_disagreement_score":0.001731599,"about_ca_system_score_codex":0.00078226125,"about_ca_system_score_gemma":0.00072260044,"threshold_uncertainty_score":0.0056757927},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07450168,0.0010516742,0.9184495,0.00028537793,0.00011824386,0.00011026732,0.0001162366,0.00073506957,0.0046318807],"genre_scores_gemma":[0.75453836,0.0011166894,0.23879816,0.00018485826,0.00012729876,0.00014165926,0.0001789894,0.00005858466,0.004855473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996408,0.00007975813,0.000018025004,0.000051137733,0.00017368639,0.00003657906],"domain_scores_gemma":[0.9992694,0.0002740677,0.00011187005,0.00014925704,0.00016842732,0.000026934804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038135608,0.00049073645,0.0003567296,0.0005554008,0.0003637832,0.0004477544,0.00054548244,0.0004907201,0.0010238815],"category_scores_gemma":[0.0016877605,0.00018728065,0.00021585883,0.0005568248,0.00046442685,0.00079835893,0.0006719922,0.00056165433,0.00036056648],"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.00063848536,0.0001540967,0.0017324412,0.0006415218,0.00013579788,0.0011142999,0.0004032055,0.17117165,0.3556057,0.09301298,0.003746678,0.37164313],"study_design_scores_gemma":[0.000100953104,0.00041080028,0.00070604554,0.0000744393,0.00008479283,0.0010999626,0.0000551056,0.7999794,0.16592382,0.015461426,0.016014416,0.000088819594],"about_ca_topic_score_codex":0.0007071671,"about_ca_topic_score_gemma":0.0007152706,"teacher_disagreement_score":0.0010238815,"about_ca_system_score_codex":0.00034739234,"about_ca_system_score_gemma":0.00034066814,"threshold_uncertainty_score":0.0034252405},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020705994,0.00030171784,0.9681873,0.00022767059,0.00014154208,0.00047946363,0.00018761531,0.0026445678,0.007124128],"genre_scores_gemma":[0.666189,0.00065062416,0.32344094,0.00023942682,0.00020124148,0.0006121411,0.0007996642,0.00013843991,0.0077285054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986135,0.0001920964,0.00009723781,0.0002492823,0.0007510299,0.00009687702],"domain_scores_gemma":[0.99772877,0.00046750178,0.00018648077,0.0005478639,0.0009406664,0.00012870849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010013584,0.0004555753,0.000554791,0.0004668839,0.00056473236,0.0019884033,0.0017097417,0.00089360535,0.0026502197],"category_scores_gemma":[0.002953819,0.00015980203,0.00026074072,0.0004820668,0.00073609286,0.001196738,0.0010017916,0.0007957451,0.00096466613],"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.00068375753,0.0004421394,0.0021919063,0.00055686245,0.00014575693,0.0007497328,0.00053142925,0.3500286,0.11294242,0.16958337,0.019299062,0.342845],"study_design_scores_gemma":[0.00011809588,0.00024579893,0.00041982697,0.00002586411,0.00004065978,0.00017978849,0.00008424999,0.90451646,0.034032837,0.027569193,0.03272862,0.000038652837],"about_ca_topic_score_codex":0.0020098705,"about_ca_topic_score_gemma":0.0010233066,"teacher_disagreement_score":0.0026502197,"about_ca_system_score_codex":0.0005737454,"about_ca_system_score_gemma":0.0016087904,"threshold_uncertainty_score":0.008865893},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00214607,0.0022132015,0.99373925,0.00013952171,0.00012442487,0.000030950272,0.000020182293,0.00064556714,0.0009409569],"genre_scores_gemma":[0.21893889,0.005979351,0.7709042,0.00018563104,0.00030947523,0.00023475566,0.00027778692,0.00013079721,0.0030391102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893564,0.00037246716,0.00005392533,0.00017104976,0.00042722654,0.000039644594],"domain_scores_gemma":[0.99895334,0.00034277196,0.00022354617,0.0001928848,0.00024065806,0.00004679749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010265709,0.00076286506,0.0005756807,0.0008135112,0.0006343799,0.0004894671,0.0013866284,0.0008637416,0.0012708718],"category_scores_gemma":[0.003948211,0.00032988185,0.00042343143,0.0017621464,0.0009405114,0.0013985218,0.0010696138,0.00069301703,0.0009550438],"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.00028452708,0.000046062887,0.0014271837,0.0009615399,0.00009843482,0.00027611654,0.0004444375,0.13627288,0.031125974,0.112608686,0.015937058,0.700517],"study_design_scores_gemma":[0.00010095967,0.00040223668,0.0009637881,0.00015640282,0.000098830336,0.0015841948,0.00013029516,0.77252877,0.022219134,0.0735787,0.12812407,0.00011261255],"about_ca_topic_score_codex":0.0015529727,"about_ca_topic_score_gemma":0.0012862147,"teacher_disagreement_score":0.0015529727,"about_ca_system_score_codex":0.0005701249,"about_ca_system_score_gemma":0.0006835212,"threshold_uncertainty_score":0.005429089},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001896471,0.0002160706,0.9973132,0.000040805626,0.000037213806,0.000015185707,0.000038775142,0.00017071984,0.0002716389],"genre_scores_gemma":[0.14893727,0.0009268856,0.8453516,0.0002177853,0.00036527697,0.00015904335,0.00064706797,0.00012123197,0.00327385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836284,0.0005035251,0.000078418,0.00021711744,0.0007207335,0.00011733179],"domain_scores_gemma":[0.9972447,0.0014071646,0.00029801027,0.00027453442,0.00069293886,0.00008264878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016612372,0.0011063695,0.0014097791,0.00091704604,0.00047605825,0.0012081244,0.0010707629,0.0011798475,0.0016459007],"category_scores_gemma":[0.008471815,0.0005015834,0.0005769438,0.0009500752,0.0006786883,0.0020406933,0.0010828158,0.0014076125,0.0014495855],"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.0004330646,0.00018036675,0.0026815762,0.0004827362,0.00020927779,0.00030659774,0.00012885242,0.33349788,0.04351418,0.039932456,0.006425597,0.57220745],"study_design_scores_gemma":[0.00003344597,0.00013230735,0.0005871762,0.000020233567,0.000028483768,0.00029887861,0.000015721833,0.9819225,0.007209288,0.00614945,0.003559407,0.000043115037],"about_ca_topic_score_codex":0.0009765779,"about_ca_topic_score_gemma":0.0016501609,"teacher_disagreement_score":0.0016612372,"about_ca_system_score_codex":0.00039514306,"about_ca_system_score_gemma":0.0011703053,"threshold_uncertainty_score":0.008785605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10363296,0.0037649935,0.8624562,0.0008586943,0.000105707215,0.00015401767,0.0001899644,0.00048631342,0.028351128],"genre_scores_gemma":[0.94923383,0.0032302935,0.0440453,0.0001350343,0.0001369877,0.00049116893,0.00016416608,0.00010374907,0.002459406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952246,0.0022540546,0.00017443161,0.00032785,0.0012849563,0.0007341415],"domain_scores_gemma":[0.9800703,0.016149443,0.0011494786,0.0010256453,0.00132347,0.00028163168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052114786,0.0024400325,0.0014161377,0.0017166465,0.001183906,0.0032147877,0.0018409351,0.0015581932,0.0016075836],"category_scores_gemma":[0.022475716,0.0008899842,0.00078920537,0.0018549486,0.002440391,0.0034644934,0.0031091915,0.0019979873,0.0007682241],"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.0002644889,0.00011932078,0.00065264996,0.00052307564,0.000098644196,0.00042686384,0.0005759286,0.61609757,0.009275938,0.33641824,0.0020479532,0.033499327],"study_design_scores_gemma":[0.00007218257,0.00019816228,0.00024245752,0.0001287347,0.00006357563,0.00029959873,0.00016060745,0.76836056,0.0063343896,0.22206368,0.0020140097,0.000062010935],"about_ca_topic_score_codex":0.0006937115,"about_ca_topic_score_gemma":0.00047846074,"teacher_disagreement_score":0.0052114786,"about_ca_system_score_codex":0.0017925688,"about_ca_system_score_gemma":0.0009551812,"threshold_uncertainty_score":0.027561247},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015291696,0.0012336873,0.98236555,0.000103220475,0.000046075038,0.000026477805,0.000014910564,0.00017895296,0.0007395071],"genre_scores_gemma":[0.84721214,0.002144028,0.14864972,0.00010700636,0.0001227742,0.00009751945,0.000050239036,0.000062849846,0.0015537116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989806,0.000386123,0.000050039296,0.00010189789,0.00037462608,0.00010672677],"domain_scores_gemma":[0.9989145,0.0005303651,0.00017157987,0.00010263232,0.00024625452,0.000034727535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014231185,0.0007816543,0.00073056284,0.00044570846,0.0004234936,0.0007929576,0.0010742162,0.0006279623,0.0006926054],"category_scores_gemma":[0.0042693694,0.00031803138,0.00033427126,0.00052008976,0.0005011012,0.0011923811,0.00072648027,0.0009434681,0.00025626432],"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.00012619919,0.00006215205,0.00043502258,0.00016302506,0.00006341181,0.00017681882,0.00014024279,0.8673264,0.025932329,0.024749001,0.0010090608,0.07981641],"study_design_scores_gemma":[0.000003802389,0.000023752036,0.000044216576,0.0000050541835,0.0000061932537,0.000026982125,0.000005982379,0.9965102,0.0013201443,0.0018061071,0.00023929484,0.000008220009],"about_ca_topic_score_codex":0.002247028,"about_ca_topic_score_gemma":0.0018630197,"teacher_disagreement_score":0.002247028,"about_ca_system_score_codex":0.0008014399,"about_ca_system_score_gemma":0.0005601651,"threshold_uncertainty_score":0.0075262785},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024066878,0.00013675624,0.97493535,0.00006179019,0.000017012813,0.00001117768,0.000013657331,0.00016398451,0.00059334957],"genre_scores_gemma":[0.5000278,0.00025912895,0.4983021,0.00006944554,0.000052668187,0.000054531152,0.00008524793,0.0000339758,0.0011152318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963033,0.00010945576,0.000015437847,0.000056267978,0.0001427157,0.000045634995],"domain_scores_gemma":[0.99952996,0.0002726769,0.00006436042,0.00004782031,0.00006777226,0.000017479026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000547316,0.0003880833,0.0006783068,0.00027468818,0.00020001402,0.0003389741,0.00043280062,0.0006574942,0.0004103667],"category_scores_gemma":[0.0026799864,0.00028160444,0.00022364185,0.00043543256,0.00044937967,0.00064034475,0.00042099482,0.00046429402,0.00020135866],"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.00021704422,0.00006249759,0.0012437879,0.00006567072,0.000028100774,0.00010103307,0.000081261445,0.7698245,0.027767152,0.014617808,0.00073019223,0.18526097],"study_design_scores_gemma":[0.000012952695,0.00002291695,0.00018379049,0.000003270519,0.0000037245213,0.00003887471,0.0000031206557,0.99323857,0.0045719543,0.0016178815,0.00029666311,0.0000063157045],"about_ca_topic_score_codex":0.0017387717,"about_ca_topic_score_gemma":0.0019122271,"teacher_disagreement_score":0.0017387717,"about_ca_system_score_codex":0.000263345,"about_ca_system_score_gemma":0.000856207,"threshold_uncertainty_score":0.0034573078},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050133593,0.0006694493,0.9472978,0.000293569,0.00007668773,0.000053172997,0.000023469407,0.00025774149,0.0011945263],"genre_scores_gemma":[0.9574901,0.00019848243,0.04140949,0.000040432165,0.000069620684,0.00007118461,0.000027459531,0.00003214621,0.0006611587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874616,0.00060003676,0.00004847297,0.00015709181,0.00024007044,0.00020823118],"domain_scores_gemma":[0.9979498,0.0012504242,0.0002838995,0.00014607303,0.00023794758,0.00013193932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024237784,0.00061664823,0.0008635523,0.00068007654,0.00067174406,0.00096644904,0.0009707836,0.00055215386,0.000717434],"category_scores_gemma":[0.0054109273,0.0004877288,0.00034561395,0.0006997368,0.0012275799,0.0014601091,0.0011957074,0.0006888936,0.00007108608],"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.00008501805,0.00003877191,0.0003503968,0.00002897331,0.000022385424,0.000022417,0.00003822756,0.9737781,0.0008581861,0.007749802,0.00046139548,0.016566165],"study_design_scores_gemma":[0.000009043864,0.000011657524,0.000047237292,0.0000010872666,0.0000036500983,0.0000035021167,0.000004635039,0.9968411,0.00014158982,0.0028538352,0.00008026863,0.0000025278794],"about_ca_topic_score_codex":0.004563806,"about_ca_topic_score_gemma":0.0036651501,"teacher_disagreement_score":0.004563806,"about_ca_system_score_codex":0.0012977064,"about_ca_system_score_gemma":0.0014119854,"threshold_uncertainty_score":0.0128183365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045646507,0.0006144749,0.95124704,0.00020449793,0.000047157904,0.00003608082,0.00009442476,0.00034287744,0.0017669692],"genre_scores_gemma":[0.88912827,0.0009480416,0.109126754,0.00003682549,0.0000629463,0.00007531222,0.00012745698,0.000033432156,0.0004608244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944395,0.00027332304,0.000024235813,0.000053802534,0.00017664218,0.000028064263],"domain_scores_gemma":[0.99762124,0.0016599805,0.00023092728,0.00021411182,0.0002412403,0.00003254257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016006497,0.0008044009,0.0005030562,0.0005991983,0.00030336677,0.00071742723,0.00057820446,0.00061512,0.0006211604],"category_scores_gemma":[0.009685362,0.000298998,0.00024342077,0.00071437855,0.00047781196,0.0010523681,0.00049855036,0.00075967057,0.00013924066],"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.000025954952,0.0000064621768,0.0008733846,0.000020012372,0.000014143258,0.00001674075,0.00001990039,0.98211527,0.0008859024,0.004775759,0.0001413248,0.011105169],"study_design_scores_gemma":[0.0000015869659,0.000006795751,0.00013150617,0.0000031890982,0.0000023805899,0.0000035623539,0.000004060963,0.9974216,0.00035518737,0.0019136452,0.00015444432,0.0000020958705],"about_ca_topic_score_codex":0.0039634616,"about_ca_topic_score_gemma":0.0034560764,"teacher_disagreement_score":0.0039634616,"about_ca_system_score_codex":0.00079341605,"about_ca_system_score_gemma":0.0004088647,"threshold_uncertainty_score":0.008465171},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034414243,0.00027252274,0.96226305,0.00015301637,0.000051262767,0.00006073675,0.000018482935,0.00038868684,0.0023779513],"genre_scores_gemma":[0.90306103,0.00021007349,0.09544635,0.00009120273,0.00004014262,0.00007864005,0.000025429137,0.0000127624035,0.0010343178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994386,0.0001139465,0.000038295493,0.000110555186,0.00022958437,0.00006902603],"domain_scores_gemma":[0.9993092,0.00040940844,0.00009301198,0.0000254251,0.00013653048,0.000026386488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010159764,0.00042769097,0.00044145485,0.00041829117,0.0005980073,0.0009789827,0.0009628628,0.00061135925,0.00095820363],"category_scores_gemma":[0.0021455898,0.00017178549,0.00039858965,0.00028008356,0.000790526,0.0006878102,0.00036695422,0.00077568734,0.00013450092],"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.00044119117,0.0003250082,0.0015207129,0.00018084237,0.0000987882,0.00025455456,0.00042973316,0.7325323,0.029707462,0.04396101,0.0011980804,0.18935025],"study_design_scores_gemma":[0.000020912506,0.00003657907,0.000099865756,0.000007979508,0.000013452081,0.000021019998,0.000007781845,0.993133,0.0024575645,0.003857616,0.00033419143,0.000010130466],"about_ca_topic_score_codex":0.0067946548,"about_ca_topic_score_gemma":0.0045743203,"teacher_disagreement_score":0.0067946548,"about_ca_system_score_codex":0.001307771,"about_ca_system_score_gemma":0.0009293845,"threshold_uncertainty_score":0.013510227},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21379192,0.0033736844,0.7627124,0.0006843967,0.00008778697,0.00005954665,0.00024731542,0.0006213555,0.018421607],"genre_scores_gemma":[0.9884263,0.0012071828,0.00847442,0.000052434574,0.00010121362,0.000055761404,0.0001022564,0.000044091303,0.0015362616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834144,0.00061740825,0.00004171576,0.000113603775,0.00059369404,0.00029198063],"domain_scores_gemma":[0.9931946,0.0043720272,0.0005924888,0.00043515032,0.0012927355,0.000112966045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002023843,0.0012546644,0.0008310818,0.001813767,0.0005406464,0.0012831099,0.00090973795,0.0011838587,0.0012311044],"category_scores_gemma":[0.009049276,0.0004077447,0.00047124334,0.0015573893,0.0015266002,0.0017665589,0.0010042967,0.0010648556,0.00034490824],"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.0001143364,0.000058588263,0.00088790257,0.00011817674,0.000036479167,0.0002434187,0.00015326597,0.900598,0.00624489,0.077646546,0.00080021116,0.013098187],"study_design_scores_gemma":[0.0000016791378,0.00002437454,0.0002759042,0.000008132291,0.0000056087165,0.00005723875,0.000015281532,0.99164635,0.00065169274,0.0071557043,0.00014707104,0.000011026605],"about_ca_topic_score_codex":0.003499733,"about_ca_topic_score_gemma":0.0014212696,"teacher_disagreement_score":0.003499733,"about_ca_system_score_codex":0.0013054475,"about_ca_system_score_gemma":0.0008184813,"threshold_uncertainty_score":0.010703266},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01086067,0.0011471563,0.9846497,0.00020128653,0.0001828625,0.00006700768,0.00002758421,0.00019533953,0.0026683535],"genre_scores_gemma":[0.36828172,0.0021618754,0.6244496,0.00023047184,0.0007158724,0.0002585513,0.0001099259,0.00006728742,0.0037246817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994217,0.00018123335,0.000041995896,0.00006310984,0.00023990977,0.000052122326],"domain_scores_gemma":[0.9991841,0.00042632897,0.00011061255,0.00007036381,0.00017906941,0.0000294907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013034082,0.00055502105,0.0004664766,0.00057785487,0.0005780937,0.0008453328,0.000841851,0.0006535212,0.0011729079],"category_scores_gemma":[0.0037431049,0.00020507786,0.0002462183,0.0009033749,0.00044933386,0.0009846695,0.00053225417,0.00071349915,0.00035820814],"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.00020113275,0.00014693668,0.00064477697,0.00021863557,0.000041115174,0.00011918954,0.00015571035,0.4385948,0.01527749,0.18671781,0.005813468,0.35206884],"study_design_scores_gemma":[0.000021838894,0.000034286993,0.000084881765,0.000009397888,0.000006371854,0.00006274913,0.000013896744,0.97890455,0.0015648563,0.0154513605,0.0038377868,0.000007957794],"about_ca_topic_score_codex":0.0009961388,"about_ca_topic_score_gemma":0.0011474426,"teacher_disagreement_score":0.0013034082,"about_ca_system_score_codex":0.0009174327,"about_ca_system_score_gemma":0.00092605036,"threshold_uncertainty_score":0.006893158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01742829,0.00036342003,0.9707737,0.00034865056,0.00013756637,0.000110129215,0.000104095176,0.00047682907,0.010257305],"genre_scores_gemma":[0.9672815,0.0004704342,0.02335924,0.00012388057,0.00007000634,0.00046705088,0.00010898444,0.000035950292,0.008082967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994698,0.000101766534,0.000026314729,0.00012770739,0.00019104441,0.000083430874],"domain_scores_gemma":[0.9994435,0.0002385063,0.00009703283,0.000030700685,0.00016256186,0.000027763916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077891274,0.0010137922,0.0008360919,0.0004049603,0.0006962781,0.0016375319,0.0014261758,0.00159666,0.003939804],"category_scores_gemma":[0.0014484918,0.00034812433,0.00067795976,0.0003787543,0.0010099597,0.0010472859,0.00073600514,0.0013264252,0.0005220581],"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.00006392693,0.000046868532,0.00024156712,0.00009982908,0.000022256467,0.00019191207,0.00014606013,0.95073533,0.0040482497,0.034886915,0.00081875495,0.008698262],"study_design_scores_gemma":[0.0000166057,0.000043763164,0.000067730725,0.000005714113,0.0000069093576,0.000015352574,0.000009226101,0.9959241,0.00028056372,0.003054136,0.00056896434,0.0000068756763],"about_ca_topic_score_codex":0.011807823,"about_ca_topic_score_gemma":0.0054034116,"teacher_disagreement_score":0.011807823,"about_ca_system_score_codex":0.00109544,"about_ca_system_score_gemma":0.0009199673,"threshold_uncertainty_score":0.02347821},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023329196,0.00016597737,0.9740879,0.0001019793,0.00003428983,0.000058794634,0.000032556545,0.00042353015,0.0017658706],"genre_scores_gemma":[0.5453139,0.00021154831,0.45003158,0.00011450566,0.000044776276,0.00026757875,0.00017592036,0.000086969696,0.0037532307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996333,0.000109084576,0.000015570033,0.000065453714,0.00009098039,0.000085607506],"domain_scores_gemma":[0.9996675,0.00014485797,0.000051588137,0.000032736887,0.00006926217,0.000034106226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061494124,0.0005854208,0.00074829394,0.00040539692,0.0004957051,0.00090746756,0.0008721481,0.00058747944,0.0017564578],"category_scores_gemma":[0.0011407151,0.00032750622,0.00026416202,0.0006772104,0.00039326784,0.0006286627,0.00068413024,0.0006635756,0.00049909815],"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.00020967567,0.00013073217,0.0005547362,0.00004916193,0.000028812083,0.000058941732,0.00006779618,0.8449435,0.0035950353,0.011108118,0.002235164,0.13701816],"study_design_scores_gemma":[0.000016007245,0.00001810421,0.000040659805,0.0000013821755,0.0000029099199,0.00000872894,0.0000061413944,0.9979632,0.00044929475,0.0012318458,0.00025983775,0.0000019993045],"about_ca_topic_score_codex":0.004534022,"about_ca_topic_score_gemma":0.0040770574,"teacher_disagreement_score":0.004534022,"about_ca_system_score_codex":0.0011089848,"about_ca_system_score_gemma":0.0015943008,"threshold_uncertainty_score":0.009015262},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016344812,0.0006867956,0.9786144,0.000120864395,0.00006603032,0.00007690144,0.000040452465,0.00026880918,0.0037809392],"genre_scores_gemma":[0.4721381,0.00073107507,0.52267545,0.00018333174,0.00006609441,0.00019391402,0.000120340184,0.000037976333,0.0038537846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936515,0.00023741809,0.000027962938,0.00004133167,0.00026888528,0.0000592007],"domain_scores_gemma":[0.9993979,0.00017702242,0.00008615675,0.00013773759,0.00017193767,0.000029270059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005911171,0.0007094294,0.0005000086,0.0006326172,0.0006161753,0.00059331674,0.0011800089,0.00069361506,0.0010364051],"category_scores_gemma":[0.0013428056,0.0002630311,0.00028842213,0.0009023684,0.00059670437,0.0006471592,0.0007640437,0.00072650553,0.0007055236],"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.00038603565,0.00019584165,0.0013624534,0.00059213437,0.00009820509,0.0005951667,0.00043524936,0.3740657,0.10179439,0.18481365,0.004753376,0.33090782],"study_design_scores_gemma":[0.000042763044,0.0003286224,0.00028199717,0.000042453976,0.000023524328,0.00061443076,0.00003660257,0.94925565,0.028905192,0.014569902,0.0058273,0.00007149288],"about_ca_topic_score_codex":0.001009446,"about_ca_topic_score_gemma":0.00205381,"teacher_disagreement_score":0.0011800089,"about_ca_system_score_codex":0.0005912379,"about_ca_system_score_gemma":0.0008568771,"threshold_uncertainty_score":0.0042897463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05248948,0.0005136888,0.94349164,0.000103518156,0.00010675061,0.00012279353,0.00006076251,0.0007660249,0.002345304],"genre_scores_gemma":[0.48100165,0.00023088572,0.5141848,0.00013577589,0.00005620543,0.00012236547,0.00007642939,0.000027862447,0.0041641556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874794,0.00041865307,0.00006891448,0.00020692777,0.00045995484,0.000097572716],"domain_scores_gemma":[0.9980611,0.0009693791,0.0002475873,0.00023483923,0.00043231001,0.000054714896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014985986,0.00070765143,0.0006733484,0.00067674846,0.00046326284,0.00059688237,0.0009132587,0.0010558581,0.00095196493],"category_scores_gemma":[0.0047615226,0.00042264946,0.0002911396,0.0003583309,0.0006649262,0.00095495465,0.00063971314,0.0005724634,0.00063284644],"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.0024967722,0.00035626537,0.0039635473,0.0007028105,0.0001825113,0.0003305836,0.00052744756,0.08244491,0.36675692,0.05513588,0.0022163577,0.4848861],"study_design_scores_gemma":[0.000107098145,0.0005898977,0.001440406,0.000033161134,0.00005131877,0.00050817744,0.000022777038,0.7868102,0.19823268,0.0074534295,0.004650858,0.00009997726],"about_ca_topic_score_codex":0.0007618557,"about_ca_topic_score_gemma":0.0014227023,"teacher_disagreement_score":0.0014985986,"about_ca_system_score_codex":0.0005473141,"about_ca_system_score_gemma":0.00095491955,"threshold_uncertainty_score":0.007925451},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37295702,0.0025532043,0.59271187,0.0020449318,0.00034325794,0.00023407087,0.0005870186,0.0008018793,0.027766718],"genre_scores_gemma":[0.98790956,0.00043458896,0.007702939,0.00009475079,0.00007465029,0.00005086311,0.00015050365,0.000054440075,0.00352767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891174,0.0002641014,0.000038679605,0.0001303619,0.00039818912,0.00025685885],"domain_scores_gemma":[0.99619114,0.0020150477,0.0002836915,0.00013450676,0.0012098026,0.00016583409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020608637,0.0006142635,0.0006894374,0.00087340554,0.0007600037,0.001438462,0.001302581,0.0007511109,0.002341471],"category_scores_gemma":[0.006709629,0.00030848687,0.00043100858,0.00065042864,0.0010813685,0.0013917437,0.000731981,0.0009490462,0.000347061],"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.00017673116,0.00013036285,0.0020615663,0.00006818437,0.0000378473,0.00021838043,0.00028877036,0.82200104,0.00881618,0.1561328,0.0026888137,0.0073793065],"study_design_scores_gemma":[0.000003173278,0.0000062410427,0.00014049534,0.000001358763,0.0000017836842,0.0000057560133,0.000011352604,0.9972651,0.00015546448,0.0023032234,0.00010177394,0.0000042456836],"about_ca_topic_score_codex":0.03452307,"about_ca_topic_score_gemma":0.0088237785,"teacher_disagreement_score":0.03452307,"about_ca_system_score_codex":0.004478301,"about_ca_system_score_gemma":0.0019380843,"threshold_uncertainty_score":0.068644226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84909064,0.0026682091,0.13691977,0.00054034276,0.00006307636,0.000037063324,0.00020692854,0.0004544856,0.010019541],"genre_scores_gemma":[0.99135864,0.00039099934,0.0071711387,0.00004965893,0.000036210804,0.000014142216,0.00006241612,0.000024777888,0.0008920993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789846,0.0008454136,0.00007899575,0.00021888317,0.00054379343,0.00041442597],"domain_scores_gemma":[0.9869466,0.010439204,0.0007998773,0.00050378905,0.0011543691,0.00015604171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024743443,0.0011351494,0.0010969301,0.0006056273,0.00085879175,0.0013095321,0.00043548798,0.0017610984,0.0012187846],"category_scores_gemma":[0.01600603,0.0003008635,0.00034445184,0.0007587496,0.0012379964,0.0011936903,0.0015374991,0.0006038302,0.00042484736],"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.0042670667,0.000114604736,0.010938681,0.00037879756,0.00029851007,0.0008624332,0.0005824362,0.8111379,0.08863235,0.011846007,0.00072597084,0.070215285],"study_design_scores_gemma":[0.00016455162,0.0016912501,0.008871897,0.00010060604,0.0001912265,0.001323926,0.00023017621,0.88820785,0.088881716,0.009229193,0.000970557,0.0001371108],"about_ca_topic_score_codex":0.0014528738,"about_ca_topic_score_gemma":0.00081385736,"teacher_disagreement_score":0.0024743443,"about_ca_system_score_codex":0.0007090134,"about_ca_system_score_gemma":0.0006219966,"threshold_uncertainty_score":0.013085723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026470568,0.00045816155,0.97068465,0.00025219694,0.00001757576,0.00003493774,0.000021224709,0.00011109345,0.0019496087],"genre_scores_gemma":[0.8209498,0.00062300154,0.17648904,0.00011566981,0.00004072515,0.00018696589,0.00005394311,0.00002658288,0.0015143047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991912,0.00037449304,0.000021782116,0.00004580366,0.00031469157,0.00005193032],"domain_scores_gemma":[0.9981115,0.0012626969,0.00020097554,0.00022668939,0.00017218255,0.000025978652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014712022,0.00046052775,0.00039787177,0.00042931977,0.00032760022,0.0005270254,0.00076255033,0.0006692822,0.0005015891],"category_scores_gemma":[0.0052249315,0.00023529034,0.00028003522,0.00054258306,0.0012841944,0.0011054529,0.0010121611,0.0007319245,0.00014782831],"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.00010058848,0.00003411763,0.0003956222,0.00012137742,0.000024200846,0.00017092215,0.0002970455,0.67149043,0.013586884,0.2826123,0.00084061775,0.03032577],"study_design_scores_gemma":[0.000014580902,0.000035206944,0.000056234465,0.0000107827655,0.000004765178,0.000044554414,0.000012710946,0.95170707,0.0014639151,0.04601003,0.00063096883,0.000009146381],"about_ca_topic_score_codex":0.001279895,"about_ca_topic_score_gemma":0.0012956724,"teacher_disagreement_score":0.0014712022,"about_ca_system_score_codex":0.0010521249,"about_ca_system_score_gemma":0.00073357986,"threshold_uncertainty_score":0.007780552},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052940425,0.0022122385,0.9417926,0.00020199524,0.00020845834,0.00011056198,0.00002260073,0.00051009335,0.0020010818],"genre_scores_gemma":[0.7176042,0.0013281667,0.27670345,0.00035919476,0.00023279924,0.00017460102,0.00006533043,0.000057173656,0.003475066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924016,0.00023654771,0.000039538932,0.0000877381,0.00028878805,0.00010726303],"domain_scores_gemma":[0.99907136,0.00034119436,0.000086926724,0.00015447671,0.0002566107,0.00008934239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009417039,0.00056231476,0.0007528594,0.00065603637,0.00081541494,0.00092401437,0.0013567739,0.00068502605,0.001139578],"category_scores_gemma":[0.0028742317,0.00030320775,0.00030624456,0.0006235321,0.0005987287,0.0016402011,0.0015639755,0.0010105208,0.00035626942],"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.0010595669,0.00034254635,0.0015998464,0.00070639746,0.00022230072,0.00097403396,0.001296273,0.09792479,0.15867305,0.079025075,0.004487762,0.6536884],"study_design_scores_gemma":[0.00031500834,0.0015135447,0.00082367414,0.00006859544,0.00021527497,0.001531786,0.00027547692,0.91000825,0.034183417,0.033362255,0.017557962,0.00014478041],"about_ca_topic_score_codex":0.0005004961,"about_ca_topic_score_gemma":0.0006648758,"teacher_disagreement_score":0.0013567739,"about_ca_system_score_codex":0.00028034352,"about_ca_system_score_gemma":0.0006437049,"threshold_uncertainty_score":0.004980266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21874563,0.0008121863,0.73325646,0.00052667555,0.0000649016,0.00009600731,0.0002878403,0.00080214394,0.04540813],"genre_scores_gemma":[0.9832525,0.0004923459,0.010468438,0.0000635492,0.000026060774,0.000059154772,0.00009100364,0.000058049187,0.0054888898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968934,0.00006445067,0.000006964258,0.000038182516,0.00013224936,0.00006880723],"domain_scores_gemma":[0.9997944,0.000079926496,0.000029705487,0.000017325307,0.00006425172,0.000014428409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041271746,0.0007719362,0.00038999718,0.00051359704,0.00032856548,0.0009532215,0.00082296564,0.00072073395,0.0023662164],"category_scores_gemma":[0.0009588475,0.00023381368,0.0003190822,0.00035112497,0.00040905163,0.00083618076,0.0004896972,0.00040314166,0.0006098519],"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.00008265858,0.000022477538,0.00049928774,0.000024291685,0.000009222063,0.00012427212,0.00006814052,0.9628482,0.008864657,0.021249931,0.00042735453,0.0057794712],"study_design_scores_gemma":[0.000003353879,0.000019299487,0.00007704166,0.0000025754425,0.000003365192,0.000022354385,0.000006359235,0.9966074,0.0007017871,0.0021626411,0.00039104634,0.000002762791],"about_ca_topic_score_codex":0.0038867283,"about_ca_topic_score_gemma":0.00096646236,"teacher_disagreement_score":0.0038867283,"about_ca_system_score_codex":0.0010882445,"about_ca_system_score_gemma":0.00069441303,"threshold_uncertainty_score":0.007915795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058900103,0.0014840572,0.9251948,0.0003830512,0.00005199254,0.000037879094,0.00039740547,0.0003566176,0.013194079],"genre_scores_gemma":[0.950901,0.0035959678,0.04105931,0.00019661302,0.0002590996,0.00018945434,0.00061287807,0.00018446054,0.0030011486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986941,0.0004670524,0.000044879765,0.00013328693,0.00050004676,0.00016069686],"domain_scores_gemma":[0.9896226,0.0075693806,0.0007466974,0.0006530461,0.0012874961,0.00012081407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028186094,0.00093181833,0.0010056472,0.0017104571,0.00040641363,0.001339854,0.0011248625,0.00070829777,0.0023367093],"category_scores_gemma":[0.01654856,0.0004865681,0.0005716332,0.0020298876,0.0021871314,0.003348908,0.0011376283,0.0013267866,0.0006406485],"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.000041871244,0.000020776513,0.0007350683,0.000082203274,0.000021359283,0.00016108087,0.0001019216,0.7688035,0.0019273938,0.21966915,0.0008232347,0.0076124785],"study_design_scores_gemma":[0.0000034003415,0.000013841497,0.00051123067,0.000030076597,0.000005982344,0.00011779305,0.000029338771,0.9301499,0.0011221395,0.06739199,0.0005962082,0.000028153188],"about_ca_topic_score_codex":0.002072051,"about_ca_topic_score_gemma":0.0010522692,"teacher_disagreement_score":0.0028186094,"about_ca_system_score_codex":0.0010965066,"about_ca_system_score_gemma":0.0010307191,"threshold_uncertainty_score":0.014906406},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21636246,0.00026842585,0.7750871,0.00054869306,0.00006406453,0.00005938288,0.00008632565,0.00023060932,0.007292968],"genre_scores_gemma":[0.94533277,0.0002032234,0.050923835,0.00006124796,0.00004784886,0.00006921532,0.00009340465,0.000026551612,0.0032418533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975437,0.000089411646,0.000009564403,0.00003562497,0.000058686433,0.000052455034],"domain_scores_gemma":[0.9993819,0.00035995158,0.00006636589,0.000047501988,0.000106918626,0.00003735065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036826878,0.00024462736,0.00021120964,0.0005025721,0.00054304994,0.0007517149,0.0004746694,0.00057688303,0.0010375081],"category_scores_gemma":[0.0023432036,0.00018603109,0.00017775665,0.00042976794,0.00036897918,0.0009020834,0.00044852035,0.00036777515,0.00012607398],"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.00021178437,0.000055068504,0.0020353715,0.000042380063,0.000019249277,0.0001823188,0.00014415152,0.850555,0.015562762,0.07023238,0.0016163423,0.05934325],"study_design_scores_gemma":[0.000005601387,0.00001635605,0.00021270546,0.0000023458754,0.000002441992,0.00003065669,0.000026456617,0.9832266,0.001080461,0.014575683,0.000817306,0.000003440875],"about_ca_topic_score_codex":0.0025871708,"about_ca_topic_score_gemma":0.0020952357,"teacher_disagreement_score":0.0025871708,"about_ca_system_score_codex":0.0008499232,"about_ca_system_score_gemma":0.00034468967,"threshold_uncertainty_score":0.006166637},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71361625,0.0024723283,0.27584457,0.00046670812,0.000079351914,0.0001342162,0.000116611394,0.0002895315,0.006980365],"genre_scores_gemma":[0.9830952,0.0004386322,0.015757417,0.000032618034,0.000015914782,0.000045770736,0.00006140539,0.000031316482,0.0005216567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745136,0.0010958933,0.00009833066,0.00025619045,0.0007918082,0.00030645146],"domain_scores_gemma":[0.9849194,0.011194805,0.001056782,0.00087250985,0.0016884326,0.00026805172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004157458,0.00094275153,0.00066368753,0.0008312731,0.00057149923,0.0009885267,0.0009210724,0.0007376296,0.0010702474],"category_scores_gemma":[0.019327642,0.00032026012,0.00034018976,0.0010806178,0.0009894784,0.0022595397,0.0007512258,0.0005083564,0.00016728659],"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.0004647363,0.00010159088,0.002239057,0.0001399623,0.00006457059,0.00008243487,0.00012206634,0.9403672,0.009840715,0.00673955,0.0004323554,0.0394057],"study_design_scores_gemma":[0.000007742717,0.0002679553,0.00049211836,0.000008661084,0.000013267007,0.00005593764,0.000048276655,0.99389243,0.0031588147,0.0018556737,0.00019178212,0.0000073810047],"about_ca_topic_score_codex":0.001645886,"about_ca_topic_score_gemma":0.0017200295,"teacher_disagreement_score":0.004157458,"about_ca_system_score_codex":0.0012271549,"about_ca_system_score_gemma":0.00085193367,"threshold_uncertainty_score":0.021986961},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04662407,0.00053591246,0.94377744,0.00046228446,0.00029161572,0.0001416895,0.00009247722,0.0012206928,0.006853807],"genre_scores_gemma":[0.7576568,0.0005210773,0.23492923,0.00017005317,0.00026361318,0.00014776505,0.00014697463,0.00008688714,0.006077556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947983,0.000110811816,0.000017629114,0.000089068504,0.00022720807,0.000075415046],"domain_scores_gemma":[0.99954504,0.00010387151,0.000042374722,0.00013001905,0.00012950561,0.00004906594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010078965,0.00031132085,0.00039199545,0.00040080686,0.0007860655,0.0012000444,0.0010317748,0.00046752836,0.0017637754],"category_scores_gemma":[0.0015425032,0.00020280374,0.0002921539,0.0005397543,0.00041176938,0.0007978031,0.0004972078,0.0009496621,0.00045176584],"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.00035185844,0.00034212187,0.0011668353,0.00009614543,0.000042041578,0.00019071737,0.00012958243,0.32501382,0.037393253,0.17706794,0.013539839,0.44466594],"study_design_scores_gemma":[0.000018248242,0.00007312214,0.00016297861,0.000004721662,0.000006501685,0.00003985942,0.000007917271,0.98349607,0.0038417962,0.007184494,0.0051550204,0.0000092828195],"about_ca_topic_score_codex":0.00464801,"about_ca_topic_score_gemma":0.005700689,"teacher_disagreement_score":0.00464801,"about_ca_system_score_codex":0.001487072,"about_ca_system_score_gemma":0.0032208504,"threshold_uncertainty_score":0.010789573},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7529179,0.0007006854,0.23680158,0.00022251568,0.00005622221,0.000023279636,0.00005208921,0.0003472467,0.0088785775],"genre_scores_gemma":[0.9775597,0.00021185094,0.020505384,0.000028626975,0.000028262637,0.000009613034,0.000027652359,0.000022261585,0.0016065906],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986017,0.00002520781,0.0000046096966,0.000020544368,0.0000639573,0.000025382173],"domain_scores_gemma":[0.9997464,0.000107309286,0.000059949798,0.000030808314,0.0000452426,0.000010266896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090869966,0.00029126895,0.000181815,0.00019117867,0.00020239133,0.00023674403,0.0002215507,0.0001635974,0.0014951569],"category_scores_gemma":[0.00044779087,0.000099412035,0.00013462667,0.00023058036,0.00019116043,0.00029956806,0.00021234507,0.0002142472,0.00025420316],"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.00038873957,0.000104122926,0.001984579,0.00016093474,0.000032076903,0.00016711089,0.00009806607,0.037674278,0.7742278,0.004058611,0.0006374341,0.18046613],"study_design_scores_gemma":[0.000028227163,0.00048610222,0.002273821,0.000014133564,0.000039564384,0.00039209815,0.000053271186,0.20826836,0.7819382,0.001559894,0.004928018,0.000018264864],"about_ca_topic_score_codex":0.0001810937,"about_ca_topic_score_gemma":0.00042227958,"teacher_disagreement_score":0.0014951569,"about_ca_system_score_codex":0.00019174039,"about_ca_system_score_gemma":0.000096313976,"threshold_uncertainty_score":0.0050017834},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046780564,0.0003077536,0.9474324,0.00022114,0.00004629868,0.000076722914,0.000043377062,0.00033992168,0.004751787],"genre_scores_gemma":[0.9316269,0.0003320517,0.06372442,0.00008405116,0.00003337762,0.00014257811,0.00004419206,0.00011638329,0.0038959936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990294,0.0003046264,0.000029787736,0.00014593654,0.00034258724,0.00014763624],"domain_scores_gemma":[0.9975802,0.0013752898,0.0003435938,0.00018479236,0.00045357214,0.00006253946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021891638,0.00060385873,0.0007536346,0.00096540444,0.0007624592,0.0010998097,0.0023462311,0.0011815289,0.0014210592],"category_scores_gemma":[0.0069366214,0.00052910537,0.0007345585,0.00051018957,0.0010974136,0.0019342942,0.0006620564,0.0009983706,0.00028357687],"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.00003499568,0.000027656182,0.0005844605,0.000020556956,0.000011416208,0.00009085781,0.00010998651,0.9609311,0.0024254955,0.030988341,0.00024453615,0.0045305616],"study_design_scores_gemma":[0.0000014930691,0.000004086547,0.000026288144,0.0000013621673,0.0000013784187,0.000009229618,0.0000024178876,0.9984201,0.00025666095,0.0011759999,0.00009816331,0.0000027711621],"about_ca_topic_score_codex":0.0117963385,"about_ca_topic_score_gemma":0.0035286846,"teacher_disagreement_score":0.0117963385,"about_ca_system_score_codex":0.0026192626,"about_ca_system_score_gemma":0.001545977,"threshold_uncertainty_score":0.023455322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17647603,0.00068088894,0.7940156,0.001895646,0.0001223246,0.00018082405,0.00002969728,0.00012175861,0.026477223],"genre_scores_gemma":[0.9820079,0.00027431044,0.016237548,0.000107221116,0.000048823746,0.00006313877,0.000004648474,0.000011833944,0.0012444766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979899,0.0013096445,0.000044013443,0.000118748176,0.0003701784,0.00016749736],"domain_scores_gemma":[0.9952494,0.0035846692,0.00037765567,0.00022541809,0.000295739,0.0002670422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002494291,0.00072448986,0.00064883346,0.00043850535,0.00083741307,0.0015655786,0.0011185549,0.0012682304,0.0015397011],"category_scores_gemma":[0.008614554,0.00034996652,0.00044831476,0.00061682635,0.0025949762,0.0033465885,0.0019400296,0.0012559048,0.00021895739],"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.00020404987,0.00023092303,0.0014662099,0.000138811,0.00006844455,0.00057638646,0.0006203683,0.34058142,0.010800436,0.5959471,0.00141048,0.047955472],"study_design_scores_gemma":[0.000089121604,0.0002025859,0.000334715,0.000024251389,0.000027287979,0.0002614845,0.00019550517,0.5729036,0.0014980697,0.42111042,0.0033146234,0.000038379305],"about_ca_topic_score_codex":0.0004927095,"about_ca_topic_score_gemma":0.00047415547,"teacher_disagreement_score":0.002494291,"about_ca_system_score_codex":0.0010249161,"about_ca_system_score_gemma":0.0007425903,"threshold_uncertainty_score":0.013191223},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040981255,0.005731272,0.94705534,0.00065767503,0.00019357861,0.00009840877,0.00019930162,0.0019165114,0.0031666972],"genre_scores_gemma":[0.30742565,0.0046966653,0.68466425,0.00012949963,0.00030799618,0.00013624511,0.0005407373,0.00030163772,0.001797303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99365693,0.0029410112,0.00033300873,0.00062937377,0.0022550481,0.00018467644],"domain_scores_gemma":[0.97061104,0.019334784,0.0012092944,0.0025348624,0.006068346,0.00024174992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008723445,0.0016436959,0.0011985855,0.0035694407,0.00048161368,0.0011902932,0.0019548414,0.0013813489,0.0018279812],"category_scores_gemma":[0.035190888,0.0007158366,0.0009310348,0.003192553,0.00056777656,0.0041874545,0.0014506604,0.0015612347,0.0005641225],"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.00044725795,0.00023035846,0.007060326,0.00051521516,0.00035145038,0.0000652653,0.0002532037,0.23243953,0.005127163,0.0077508613,0.0034493026,0.7423101],"study_design_scores_gemma":[0.000029495795,0.00012226938,0.0038917523,0.00004880052,0.00006528668,0.00012969118,0.000062235646,0.98473233,0.0060239234,0.0026285292,0.0022107023,0.000054925284],"about_ca_topic_score_codex":0.008398614,"about_ca_topic_score_gemma":0.0048814802,"teacher_disagreement_score":0.008723445,"about_ca_system_score_codex":0.00091598375,"about_ca_system_score_gemma":0.00087526167,"threshold_uncertainty_score":0.04613459},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004213207,0.0006581713,0.9921663,0.0003679016,0.000045058587,0.000023857057,0.000043363252,0.00005194611,0.002430201],"genre_scores_gemma":[0.3625151,0.005607729,0.61193264,0.0008698082,0.0006738872,0.00046895968,0.00040859025,0.00020785228,0.017315373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993529,0.00023450558,0.000023707025,0.00009572299,0.00021866788,0.00007440907],"domain_scores_gemma":[0.99915993,0.00057332206,0.000080808306,0.000044704833,0.00011904396,0.000022291502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000988474,0.0012502755,0.0009630783,0.0003381933,0.0004788082,0.001403745,0.0005528261,0.0011003698,0.0027909956],"category_scores_gemma":[0.002152486,0.00048062584,0.0006040331,0.0008123941,0.00091269717,0.001498697,0.0009918314,0.0016115168,0.0011167321],"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.0000996404,0.00010085917,0.00042328372,0.00047310843,0.000077263,0.00020881073,0.00021386388,0.83940464,0.009816534,0.06843018,0.004153313,0.0765985],"study_design_scores_gemma":[0.000017601757,0.000069078036,0.000092178336,0.000027084905,0.000016612279,0.000056632365,0.000047501137,0.9755511,0.0025928854,0.019124916,0.0023902322,0.000014237857],"about_ca_topic_score_codex":0.001403745,"about_ca_topic_score_gemma":0.0020832305,"teacher_disagreement_score":0.0027909956,"about_ca_system_score_codex":0.00068209163,"about_ca_system_score_gemma":0.0013723609,"threshold_uncertainty_score":0.00933677},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009233539,0.0004982102,0.9745534,0.0006206597,0.0005410383,0.0022442082,0.00044459882,0.005848281,0.0060160966],"genre_scores_gemma":[0.21478394,0.0018025825,0.7546208,0.0006626646,0.00044954589,0.004860157,0.0024659536,0.0007322961,0.01962212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893826,0.00021386273,0.00018027089,0.000116833806,0.00046609787,0.0000846579],"domain_scores_gemma":[0.99849164,0.00048242952,0.00013861887,0.00026603392,0.0004361231,0.0001851029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014478327,0.00082816003,0.0005614999,0.00091635477,0.0011884487,0.0013416492,0.0016374789,0.0010686503,0.0035507223],"category_scores_gemma":[0.0037023688,0.0004773644,0.0004362585,0.0010081845,0.00073373294,0.0019600582,0.001867558,0.0017618279,0.0009119379],"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.0012965526,0.00047733865,0.0010000301,0.0015249737,0.0002666261,0.0026408173,0.0018064472,0.047381286,0.20942514,0.15412104,0.0646399,0.5154199],"study_design_scores_gemma":[0.0006569784,0.0011593279,0.0012055213,0.00015086817,0.00017331152,0.0018920735,0.0003297571,0.60959226,0.09613681,0.03763616,0.2507527,0.00031424244],"about_ca_topic_score_codex":0.0017619268,"about_ca_topic_score_gemma":0.0017641674,"teacher_disagreement_score":0.0035507223,"about_ca_system_score_codex":0.0008112055,"about_ca_system_score_gemma":0.0016158842,"threshold_uncertainty_score":0.011878312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023509886,0.00010344196,0.97360647,0.00007566785,0.000023509312,0.000053297048,0.000040360148,0.00033197724,0.0022553522],"genre_scores_gemma":[0.28015053,0.00011004233,0.7168293,0.000077102595,0.000019879068,0.00018587564,0.00022296615,0.00012616116,0.0022781794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995615,0.00013388139,0.000019996716,0.00004846214,0.00015317654,0.00008291247],"domain_scores_gemma":[0.999483,0.00025370167,0.000046762372,0.00006645228,0.0001044079,0.000045702436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064836367,0.000598842,0.0005184858,0.0006139,0.0004768721,0.0006399119,0.00067055656,0.00045075233,0.0023346338],"category_scores_gemma":[0.001821484,0.0003726146,0.00035941988,0.0005318695,0.00049459946,0.0009934272,0.0009426411,0.00073461136,0.000529639],"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.00043199226,0.000114759816,0.00073623034,0.0001603116,0.000040218765,0.000106866355,0.00016427645,0.6102189,0.0167413,0.07524701,0.00477814,0.29125997],"study_design_scores_gemma":[0.000020625734,0.000024654362,0.000050428946,0.0000052215905,0.000001969288,0.000017304492,0.000014428307,0.97391045,0.0021339036,0.022796618,0.0010193685,0.000005089069],"about_ca_topic_score_codex":0.0019931667,"about_ca_topic_score_gemma":0.0023382285,"teacher_disagreement_score":0.0023346338,"about_ca_system_score_codex":0.0008510805,"about_ca_system_score_gemma":0.0012146836,"threshold_uncertainty_score":0.007810116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077412575,0.0017749687,0.9141581,0.00015442334,0.0000683527,0.000035306097,0.00006433622,0.00011748155,0.0062144483],"genre_scores_gemma":[0.9071478,0.00093079597,0.09001717,0.000044272656,0.000035863555,0.000034517907,0.00004943453,0.000008445435,0.0017317024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998367,0.00005822447,0.0000047221524,0.000017744425,0.0000651551,0.000017338501],"domain_scores_gemma":[0.9996611,0.00017581042,0.000038953927,0.00003825948,0.00007742319,0.00000840879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025509833,0.00027528146,0.00023531143,0.0001477263,0.00013153591,0.0002970191,0.00037665278,0.00034819654,0.00080536306],"category_scores_gemma":[0.00079053914,0.0000731615,0.00016396362,0.0002479186,0.00018620215,0.00028189292,0.0001924918,0.00025587858,0.00018758462],"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.00017050872,0.000072840136,0.00094820204,0.00031930406,0.00006810127,0.00046630428,0.00014193321,0.6977859,0.0945768,0.101201974,0.0014669634,0.10278116],"study_design_scores_gemma":[0.0000069531698,0.00006226386,0.00012924695,0.000007815177,0.000008541207,0.00008434823,0.0000073421133,0.99116474,0.004465642,0.0028860795,0.0011715785,0.0000054744064],"about_ca_topic_score_codex":0.0008711411,"about_ca_topic_score_gemma":0.0012940839,"teacher_disagreement_score":0.0008711411,"about_ca_system_score_codex":0.00034112053,"about_ca_system_score_gemma":0.00039621093,"threshold_uncertainty_score":0.00269413},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054246583,0.00029378023,0.99329776,0.00012849519,0.000027334576,0.000024628196,0.000010618377,0.00011206075,0.0006806447],"genre_scores_gemma":[0.47736758,0.00074092014,0.5188098,0.00012961544,0.00010622647,0.00025781017,0.00008949246,0.000079592435,0.0024189695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993267,0.00024907073,0.000024556084,0.00012617788,0.00022505227,0.00004854261],"domain_scores_gemma":[0.99940467,0.00035594567,0.00006956219,0.00007135729,0.00007279141,0.000025622367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010873941,0.0006671755,0.0011245137,0.00037428876,0.00058958324,0.00066730176,0.0011615598,0.0007853515,0.0005865859],"category_scores_gemma":[0.001829959,0.00037314728,0.0003686028,0.0006765788,0.00071636174,0.0012149225,0.0010956284,0.00084250106,0.00017951017],"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.00012135084,0.00008318167,0.00040046865,0.00020257155,0.000044503053,0.00007131685,0.00011989909,0.8624635,0.0061598397,0.0431533,0.0019951942,0.08518487],"study_design_scores_gemma":[0.000021767099,0.000032018605,0.00005542723,0.0000041516855,0.0000054388533,0.000019696072,0.000010419553,0.98589295,0.0010862227,0.011617132,0.0012508195,0.0000039118218],"about_ca_topic_score_codex":0.00093687355,"about_ca_topic_score_gemma":0.0010815051,"teacher_disagreement_score":0.0011615598,"about_ca_system_score_codex":0.00058070687,"about_ca_system_score_gemma":0.00079814973,"threshold_uncertainty_score":0.0057507753},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033594117,0.008978733,0.55700403,0.004556392,0.0053548873,0.00591776,0.008553838,0.028778413,0.34726188],"genre_scores_gemma":[0.5674102,0.011545503,0.18971306,0.0061439425,0.0022030775,0.008993619,0.02750936,0.0016056683,0.1848757],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841225,0.00016492269,0.00012270329,0.00014988169,0.0008244795,0.00032580073],"domain_scores_gemma":[0.99867153,0.00022085354,0.00010576638,0.00031934388,0.0005362871,0.0001463014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091363385,0.00082681095,0.000627157,0.0013455631,0.0021212567,0.002973159,0.002250943,0.0017204079,0.015368184],"category_scores_gemma":[0.0032148473,0.00039710442,0.00037799374,0.0011023665,0.0005385048,0.0024682907,0.003980156,0.0025529624,0.008032048],"study_design_candidate":"not_applicable","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.00096639874,0.00044349095,0.0016236503,0.0013013255,0.000115535455,0.0018980729,0.0006032811,0.0070066475,0.031409778,0.094591126,0.34074986,0.51929075],"study_design_scores_gemma":[0.00018092975,0.00028520272,0.0016607711,0.0002957229,0.00012952251,0.0024438659,0.0003099644,0.07089656,0.03382772,0.032778375,0.85698116,0.00021021269],"about_ca_topic_score_codex":0.002387718,"about_ca_topic_score_gemma":0.002019603,"teacher_disagreement_score":0.015368184,"about_ca_system_score_codex":0.0007011743,"about_ca_system_score_gemma":0.0015997224,"threshold_uncertainty_score":0.051411748},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057853118,0.000957086,0.93851715,0.00019955376,0.000049968385,0.000029112325,0.00004812824,0.0001379632,0.0022078606],"genre_scores_gemma":[0.9447484,0.00036533095,0.05411098,0.000038364633,0.00004030053,0.000041334835,0.000038386515,0.000020265075,0.0005966857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898344,0.00041627517,0.000041191164,0.00010747658,0.0002880494,0.0001634773],"domain_scores_gemma":[0.9982687,0.0011071396,0.00023084985,0.00014728175,0.00018042412,0.00006561631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011254953,0.0005704323,0.00091264327,0.00047319467,0.00046673923,0.0008810871,0.00076475315,0.00057374866,0.0002947019],"category_scores_gemma":[0.0056368387,0.00045542658,0.00025462377,0.0009834728,0.0009226543,0.0012159363,0.0008968252,0.00043957718,0.000059861035],"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.000051727886,0.000009438692,0.00037224105,0.000016341215,0.000010301509,0.000021305383,0.000021202353,0.97810566,0.0004686103,0.009654829,0.00020292074,0.011065317],"study_design_scores_gemma":[0.000003169834,0.000006754262,0.000045002333,0.0000013676298,0.000001550004,0.000007564241,0.000005372779,0.99581414,0.00011831269,0.0038645072,0.0001304999,0.0000017759668],"about_ca_topic_score_codex":0.006045737,"about_ca_topic_score_gemma":0.004163644,"teacher_disagreement_score":0.006045737,"about_ca_system_score_codex":0.0012768254,"about_ca_system_score_gemma":0.0013303796,"threshold_uncertainty_score":0.012021065},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03176087,0.0013478729,0.9590479,0.00056035025,0.0007064298,0.00017269989,0.00008211396,0.0013510077,0.0049707647],"genre_scores_gemma":[0.5056254,0.0012895948,0.4827368,0.00041011663,0.0003782878,0.00017972928,0.00032433876,0.00011562956,0.008940113],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994654,0.00011119872,0.00005131884,0.00008441252,0.00023593882,0.000051778632],"domain_scores_gemma":[0.99932563,0.00011131961,0.000093334376,0.0001355466,0.00026447096,0.00006975677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073610933,0.0004992147,0.00039029846,0.00058515667,0.00092618406,0.00074497785,0.0010753266,0.000617063,0.0012476732],"category_scores_gemma":[0.0015450299,0.0001885278,0.00030896367,0.00045656893,0.00050202745,0.0010850871,0.0008247909,0.00083514396,0.00060986995],"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.0005012825,0.00020806224,0.0009753825,0.00039658076,0.00007831116,0.00055008294,0.0005457944,0.055096373,0.25602898,0.109960355,0.0073914495,0.56826735],"study_design_scores_gemma":[0.00020150935,0.0015098586,0.0013766646,0.00009706272,0.00019307002,0.0025602346,0.00023852008,0.7069079,0.14749227,0.028872976,0.11028395,0.00026588925],"about_ca_topic_score_codex":0.00052529335,"about_ca_topic_score_gemma":0.0007473703,"teacher_disagreement_score":0.0012476732,"about_ca_system_score_codex":0.00061701686,"about_ca_system_score_gemma":0.0004467889,"threshold_uncertainty_score":0.0044767857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84963423,0.00034203308,0.14384729,0.00021801946,0.00002989712,0.000054658787,0.00007112593,0.0024259135,0.0033768613],"genre_scores_gemma":[0.98631775,0.00007139626,0.013138409,0.00002128008,0.000012237184,0.000012257111,0.00004569853,0.00002685407,0.0003539858],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992004,0.0002785208,0.000031327432,0.000057484067,0.00031822574,0.0001139889],"domain_scores_gemma":[0.99832135,0.00060614216,0.00022162752,0.00035736596,0.00041512225,0.00007843673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011727627,0.00023934615,0.0003388087,0.0004916722,0.00046279875,0.00067774433,0.00061129016,0.00052301615,0.0006915929],"category_scores_gemma":[0.0030151315,0.00016048491,0.000093431314,0.00026514003,0.00039122472,0.0012406966,0.00062543433,0.0003293285,0.00024442756],"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.0021213575,0.0005137706,0.010963838,0.00027732705,0.00008804668,0.000817296,0.0006331537,0.1322242,0.6496771,0.010168203,0.003229144,0.18928653],"study_design_scores_gemma":[0.000092953494,0.00083521195,0.003386724,0.000012795016,0.000039725113,0.000368514,0.00026425318,0.8146139,0.17099461,0.005660483,0.0036967911,0.000033983],"about_ca_topic_score_codex":0.00084896566,"about_ca_topic_score_gemma":0.000673237,"teacher_disagreement_score":0.0011727627,"about_ca_system_score_codex":0.00041802166,"about_ca_system_score_gemma":0.00021157891,"threshold_uncertainty_score":0.0062022805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005640156,0.0018856813,0.9840845,0.0003383698,0.00016964482,0.000054420667,0.00006512202,0.000350578,0.007411537],"genre_scores_gemma":[0.41026688,0.004430551,0.56699,0.00039724636,0.0003671487,0.0002798993,0.0003333297,0.000116202165,0.01681881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995747,0.00014404625,0.000019984209,0.000046483732,0.00018317609,0.000031603977],"domain_scores_gemma":[0.9995455,0.00018975092,0.000053946012,0.000060598897,0.00014075967,0.000009439668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005243711,0.00042894814,0.00035873285,0.00040913274,0.0004733257,0.0004761127,0.00048787176,0.00073942007,0.0034799334],"category_scores_gemma":[0.0019545243,0.00020428767,0.0002762972,0.0006941162,0.00049368024,0.00057944516,0.000367153,0.0007726509,0.0017414785],"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.0004044012,0.00006627285,0.00089648913,0.0005700429,0.00008175937,0.0007994181,0.00025992614,0.3125201,0.047208402,0.2920881,0.014484657,0.33062047],"study_design_scores_gemma":[0.000030676143,0.00009956506,0.00028121498,0.000054405125,0.000019926387,0.00034323896,0.00001568554,0.9459521,0.013133374,0.025235798,0.014789328,0.00004470807],"about_ca_topic_score_codex":0.0021545056,"about_ca_topic_score_gemma":0.0026291658,"teacher_disagreement_score":0.0034799334,"about_ca_system_score_codex":0.0005144417,"about_ca_system_score_gemma":0.0010411523,"threshold_uncertainty_score":0.011641502},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7538498,0.007746563,0.13511163,0.0020639491,0.0005192126,0.00011575138,0.0002516331,0.00075755146,0.099583805],"genre_scores_gemma":[0.98749334,0.00199585,0.004323926,0.00008699293,0.00012180582,0.000013911847,0.00003188717,0.000047574405,0.005884617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996136,0.0000924709,0.000009340512,0.000043161148,0.00017572327,0.00006570784],"domain_scores_gemma":[0.9979583,0.0012002566,0.00025278394,0.00021997928,0.0002945889,0.00007406724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051621447,0.0003632251,0.00023299585,0.0005261427,0.00077085634,0.0006323216,0.00027936004,0.00043757271,0.0042107226],"category_scores_gemma":[0.0022646606,0.00015565207,0.00015266538,0.0006540081,0.00082959514,0.0009241438,0.00052899116,0.00045975644,0.00032723218],"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.001227167,0.00023768208,0.01399553,0.0005433848,0.00017496319,0.0019743212,0.0015551535,0.4436969,0.19197893,0.2018465,0.0054444326,0.13732506],"study_design_scores_gemma":[0.00010950459,0.00075209426,0.023853403,0.0002365112,0.00015906939,0.001884917,0.00046637622,0.79101914,0.06563785,0.079885855,0.03585045,0.00014480462],"about_ca_topic_score_codex":0.0056152153,"about_ca_topic_score_gemma":0.004276582,"teacher_disagreement_score":0.0056152153,"about_ca_system_score_codex":0.0010771566,"about_ca_system_score_gemma":0.00040742548,"threshold_uncertainty_score":0.0140862465},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35879982,0.001150411,0.63385254,0.00066909706,0.000069425914,0.000072046336,0.000107346386,0.0001317142,0.0051475796],"genre_scores_gemma":[0.97984844,0.00033440493,0.018622039,0.00004276649,0.00003288149,0.000033109784,0.000021596787,0.0000149338,0.0010497591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944156,0.0002420897,0.000017119375,0.00006158131,0.00009075974,0.0001468571],"domain_scores_gemma":[0.9982292,0.0012506414,0.00022772331,0.000045757643,0.00016669111,0.00007994572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013403939,0.0006679906,0.0008768895,0.00044867408,0.00039141814,0.0010040159,0.00054923544,0.0007521674,0.0008167708],"category_scores_gemma":[0.0033142336,0.00046605527,0.0002954209,0.0006959514,0.001010402,0.00092722947,0.0006424066,0.00039878688,0.000108914355],"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.00005129909,0.00001814152,0.00025922505,0.000019653035,0.000011885477,0.000045360524,0.000024167282,0.98933756,0.00096675626,0.006806539,0.00016541932,0.0022940072],"study_design_scores_gemma":[0.0000109779985,0.0000147508035,0.000056449167,0.0000012099148,0.00000345013,0.000004249305,0.0000057456314,0.99783117,0.00014588278,0.0018974316,0.000026474278,0.0000022560466],"about_ca_topic_score_codex":0.0074680797,"about_ca_topic_score_gemma":0.0043894514,"teacher_disagreement_score":0.0074680797,"about_ca_system_score_codex":0.0014671758,"about_ca_system_score_gemma":0.0015387507,"threshold_uncertainty_score":0.014849186},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1320869,0.0026044946,0.85417086,0.0006846558,0.00040423404,0.00008821073,0.000059317466,0.0008742708,0.009027065],"genre_scores_gemma":[0.94941676,0.00044139996,0.047674015,0.00009209313,0.00015306528,0.000038808666,0.000038933074,0.000023528097,0.0021214704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989858,0.00033037105,0.000059278773,0.0001319758,0.00037618933,0.00011628955],"domain_scores_gemma":[0.99806565,0.00083311327,0.00013897699,0.00039547504,0.00043341916,0.00013331896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016688037,0.0003547161,0.0004391979,0.0003217545,0.00048339498,0.0011601814,0.0009231182,0.0005936561,0.0007908854],"category_scores_gemma":[0.0046524284,0.00024780515,0.00015292311,0.00041467787,0.00046830974,0.0014921436,0.0011652219,0.0009093219,0.00019162543],"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.00086814637,0.00036702465,0.0042567505,0.0004120372,0.00007609741,0.0011386333,0.000616551,0.28681132,0.08851194,0.1920013,0.0056742844,0.41926593],"study_design_scores_gemma":[0.000044746805,0.000086087864,0.00062379625,0.000018908704,0.000020641784,0.00033934173,0.000058429556,0.95449036,0.0067490158,0.028678542,0.008866567,0.000023700255],"about_ca_topic_score_codex":0.00056311925,"about_ca_topic_score_gemma":0.00063081674,"teacher_disagreement_score":0.0016688037,"about_ca_system_score_codex":0.0006020192,"about_ca_system_score_gemma":0.00050995307,"threshold_uncertainty_score":0.0088256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70097095,0.0038230012,0.27686515,0.0003846755,0.0000661819,0.00005077648,0.0003473418,0.00060157187,0.016890297],"genre_scores_gemma":[0.9916232,0.00059231324,0.0069011496,0.000029772362,0.000020080806,0.00001357224,0.000080604616,0.000026712445,0.00071254215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981688,0.00058208307,0.0000584317,0.00010224224,0.000777303,0.0003111993],"domain_scores_gemma":[0.9928048,0.00490946,0.0006667629,0.0004457894,0.001072723,0.000100355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001986045,0.0011862348,0.00067576236,0.0007740946,0.00032879453,0.0007707492,0.000625041,0.00084678724,0.0010894872],"category_scores_gemma":[0.010644111,0.00032612815,0.00038146588,0.0010048207,0.001056151,0.00088667386,0.00084640726,0.00041723243,0.0002618798],"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.00013401528,0.00001577628,0.0012045891,0.0000655439,0.000042741147,0.000099149525,0.00004438281,0.97637695,0.006043974,0.007873369,0.00016144762,0.007937993],"study_design_scores_gemma":[0.00000571185,0.00006530398,0.0006300932,0.000012712528,0.000017208007,0.00008032941,0.000009106331,0.9935986,0.0035986903,0.0018437076,0.00012562801,0.000012934438],"about_ca_topic_score_codex":0.004789493,"about_ca_topic_score_gemma":0.0040275725,"teacher_disagreement_score":0.004789493,"about_ca_system_score_codex":0.0014506018,"about_ca_system_score_gemma":0.0008957628,"threshold_uncertainty_score":0.010524869},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022088442,0.0017157742,0.96809053,0.0010744907,0.00013860723,0.00006201275,0.00010958712,0.00010219398,0.0066183065],"genre_scores_gemma":[0.9100368,0.0038913207,0.07963252,0.00044050266,0.0004835734,0.00020755926,0.0001650227,0.00009307046,0.005049606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987282,0.0005308433,0.000045057262,0.00017213802,0.00028371345,0.00024011511],"domain_scores_gemma":[0.99331266,0.005784202,0.00031135816,0.00016718972,0.00031287683,0.00011182403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020380558,0.0014882549,0.0016880463,0.0005986859,0.0007344637,0.0017707371,0.0010289086,0.0015733929,0.0033098261],"category_scores_gemma":[0.0081440685,0.0006730927,0.0005135449,0.001409945,0.0027636099,0.0029580053,0.0019393925,0.0020700563,0.0003258158],"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.0001567108,0.000051520266,0.00018444436,0.00015225726,0.000026849,0.00008866159,0.000079553916,0.89229935,0.001526881,0.08852333,0.0016230043,0.015287387],"study_design_scores_gemma":[0.00003702721,0.00004857147,0.000060129067,0.000012387939,0.0000069237676,0.00001804741,0.000019200195,0.9462917,0.00034410844,0.052734073,0.00041545718,0.0000124297485],"about_ca_topic_score_codex":0.0032893552,"about_ca_topic_score_gemma":0.0017423292,"teacher_disagreement_score":0.0033098261,"about_ca_system_score_codex":0.0011955041,"about_ca_system_score_gemma":0.0012498802,"threshold_uncertainty_score":0.011072457},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7958243,0.002936287,0.1782857,0.00059426675,0.00020276471,0.00005755985,0.000096961994,0.0029228975,0.019079298],"genre_scores_gemma":[0.9945911,0.00019431331,0.0043963897,0.000038406524,0.00004564395,0.00000888703,0.00003328299,0.000020008521,0.00067185453],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994112,0.00013571912,0.00002080056,0.00005757587,0.00018990754,0.00018471181],"domain_scores_gemma":[0.9987998,0.00052887516,0.00009051361,0.00008214993,0.00040301328,0.000095599426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006353995,0.00043310088,0.00041800496,0.00046906882,0.0003222266,0.00085445715,0.0004058724,0.00053990196,0.0021564388],"category_scores_gemma":[0.0018592876,0.00012825413,0.00019351221,0.00046223815,0.00023157775,0.00045757322,0.000572817,0.0004940743,0.00061561354],"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.0040765316,0.00064126024,0.01124564,0.00034689726,0.000119399,0.0011150468,0.00026185307,0.17113285,0.5375355,0.0092485435,0.0040107975,0.26026574],"study_design_scores_gemma":[0.00010108165,0.0015053389,0.0039449753,0.000031587802,0.00011747547,0.0007004129,0.00010935528,0.88374275,0.10495562,0.0015095044,0.0032283925,0.000053427462],"about_ca_topic_score_codex":0.0005737019,"about_ca_topic_score_gemma":0.0004929519,"teacher_disagreement_score":0.0021564388,"about_ca_system_score_codex":0.0005349699,"about_ca_system_score_gemma":0.0002732195,"threshold_uncertainty_score":0.0072140098},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05870268,0.025577035,0.90043885,0.0020446654,0.00076033734,0.00007476098,0.00015362239,0.00027238103,0.011975711],"genre_scores_gemma":[0.8844822,0.03476236,0.07205259,0.00056937686,0.002049652,0.0003015954,0.00028482947,0.00021433133,0.0052830777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987037,0.00039667683,0.000065909124,0.00020763736,0.00049243093,0.00013359159],"domain_scores_gemma":[0.9843998,0.012715263,0.0010736104,0.00032036484,0.0012942175,0.00019676477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020754011,0.0014344,0.00094858103,0.001810174,0.0006086677,0.001544202,0.0013994911,0.0011595219,0.0016095527],"category_scores_gemma":[0.02382371,0.00044870639,0.0004921282,0.0027900338,0.0019907136,0.005006245,0.0009306321,0.0016012996,0.00039502594],"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.00014772815,0.000064999665,0.0017559663,0.00040011297,0.000082417086,0.00043611115,0.00033447656,0.74029213,0.0036481684,0.20582347,0.002539286,0.044475064],"study_design_scores_gemma":[0.000022289641,0.00013361814,0.0006850065,0.000102948776,0.00005093535,0.00042637397,0.000080931815,0.8537734,0.001148349,0.13653149,0.0070044496,0.00004030121],"about_ca_topic_score_codex":0.0018168681,"about_ca_topic_score_gemma":0.0009752087,"teacher_disagreement_score":0.0020754011,"about_ca_system_score_codex":0.0016644518,"about_ca_system_score_gemma":0.0006310236,"threshold_uncertainty_score":0.0120764375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85532224,0.0009996606,0.13939613,0.00017480848,0.000050830753,0.0000556618,0.000078466765,0.00034014593,0.0035819062],"genre_scores_gemma":[0.997024,0.00010804792,0.0026737703,0.000010756628,0.0000074253335,0.000009898278,0.0000215462,0.0000074792188,0.00013718245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998847,0.0004086509,0.00005401231,0.0001501387,0.0003463363,0.00019369244],"domain_scores_gemma":[0.99722147,0.0015210486,0.00026496622,0.000335852,0.0005286586,0.00012798641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024810585,0.00070047344,0.0007497658,0.00068708527,0.0006761318,0.0015382511,0.0008142976,0.0006516802,0.00028573198],"category_scores_gemma":[0.009247138,0.00026991885,0.00031706927,0.0008173831,0.000854989,0.0016115692,0.0010017696,0.0005997614,0.00009180443],"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.00042582004,0.0000906611,0.004880501,0.000057521735,0.00006929823,0.0003623758,0.00011699782,0.947566,0.014926222,0.010087835,0.00043190084,0.020984968],"study_design_scores_gemma":[0.000005762895,0.000057527173,0.0006348765,0.0000042890047,0.000013239985,0.00005409917,0.000019000196,0.99560297,0.0022294968,0.0012641046,0.00010520877,0.000009510301],"about_ca_topic_score_codex":0.0034330217,"about_ca_topic_score_gemma":0.0012414757,"teacher_disagreement_score":0.0034330217,"about_ca_system_score_codex":0.0013597272,"about_ca_system_score_gemma":0.00059019186,"threshold_uncertainty_score":0.013121247},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89749295,0.00012008315,0.0989197,0.00016332879,0.000039281913,0.000105888044,0.000059693608,0.00048824766,0.0026108867],"genre_scores_gemma":[0.9854374,0.00006805722,0.01320806,0.000033958633,0.0000067032474,0.000056317233,0.000042775955,0.0000114067625,0.0011352864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939775,0.00016085026,0.00003146874,0.00012284983,0.00016015366,0.00012691424],"domain_scores_gemma":[0.9980248,0.0008977691,0.00032443804,0.0003782522,0.00025165992,0.00012313479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010768566,0.00040241715,0.000629575,0.0003292236,0.00084289454,0.0011890109,0.0012051333,0.00081842317,0.0012153294],"category_scores_gemma":[0.0035534105,0.00038936493,0.000281357,0.0005222619,0.0014210687,0.0017024179,0.00081875944,0.0008148824,0.00014541193],"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.0003500442,0.0001440184,0.0034099948,0.000056054487,0.000060455797,0.0001669652,0.00035308744,0.9707987,0.01009643,0.008355178,0.00035633153,0.005852814],"study_design_scores_gemma":[0.000072531155,0.00020280523,0.00070448907,0.000004640416,0.000023242188,0.000045985926,0.00007297494,0.99026674,0.004637673,0.0033812285,0.00057092734,0.000016736714],"about_ca_topic_score_codex":0.0055367635,"about_ca_topic_score_gemma":0.0031548848,"teacher_disagreement_score":0.0055367635,"about_ca_system_score_codex":0.00092112157,"about_ca_system_score_gemma":0.0011488523,"threshold_uncertainty_score":0.011009097},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015533484,0.0003354074,0.97968847,0.00012685679,0.00007061627,0.000041576553,0.000033663302,0.0002800139,0.0038899225],"genre_scores_gemma":[0.19319032,0.00039858138,0.80330485,0.000093460425,0.00003312008,0.00012786676,0.00009258537,0.00005134496,0.0027078397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997304,0.00009671991,0.000016980726,0.000042566036,0.000094485884,0.000018910192],"domain_scores_gemma":[0.9995882,0.00013334991,0.000041001964,0.0001320904,0.000084918676,0.00002042767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035553012,0.00062328257,0.00036517673,0.00049589365,0.0005562023,0.0005332136,0.0005276758,0.000593347,0.0019818782],"category_scores_gemma":[0.001768904,0.0002164584,0.00030038945,0.00051945564,0.0006084064,0.0009010758,0.00084941846,0.0006374543,0.00094004103],"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.00029184934,0.00011805496,0.0010527107,0.0003300407,0.00004626623,0.00030214633,0.00044132327,0.13111724,0.12080244,0.22276533,0.0034656597,0.51926684],"study_design_scores_gemma":[0.000050143655,0.00042028798,0.00056193036,0.00009567398,0.000026991904,0.0012559346,0.00008979189,0.8113895,0.06560675,0.08999127,0.030414766,0.00009691574],"about_ca_topic_score_codex":0.00023087932,"about_ca_topic_score_gemma":0.00030530352,"teacher_disagreement_score":0.0019818782,"about_ca_system_score_codex":0.00028494577,"about_ca_system_score_gemma":0.00044362448,"threshold_uncertainty_score":0.006630063},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09360639,0.0003112869,0.8808541,0.00018458588,0.00015043796,0.0009027762,0.000048596132,0.021774696,0.0021670836],"genre_scores_gemma":[0.69420874,0.00018436821,0.30014214,0.0002803919,0.00010385508,0.0005794152,0.00014931818,0.0003627781,0.0039889994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877435,0.00028001162,0.00012515206,0.00021237314,0.00053091027,0.00007725255],"domain_scores_gemma":[0.9947916,0.0014991629,0.00063034915,0.0012286783,0.001563449,0.00028679587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001886145,0.00079744885,0.00064104487,0.0012043598,0.000714464,0.00093167234,0.001698508,0.0009809083,0.0011619781],"category_scores_gemma":[0.006788421,0.00041627084,0.00031705567,0.0003082552,0.00075722655,0.0013331388,0.00075191335,0.0010450911,0.000639985],"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.0012477565,0.0016046818,0.013440681,0.0003536281,0.00028367323,0.00079927954,0.001067163,0.062320396,0.3521462,0.01169756,0.006010371,0.5490287],"study_design_scores_gemma":[0.00014395292,0.0016207914,0.0044255177,0.000038666476,0.00017422208,0.0009802876,0.00006638701,0.8181364,0.16171145,0.0024297768,0.010136808,0.0001357551],"about_ca_topic_score_codex":0.00090920756,"about_ca_topic_score_gemma":0.0007663329,"teacher_disagreement_score":0.001886145,"about_ca_system_score_codex":0.00046759722,"about_ca_system_score_gemma":0.00082280685,"threshold_uncertainty_score":0.009975016},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19840139,0.0011098043,0.7977096,0.0001832227,0.000027470363,0.00003195032,0.000093593844,0.00040559078,0.0020374558],"genre_scores_gemma":[0.9595597,0.0008429717,0.03828886,0.000042075935,0.00003123822,0.000041096933,0.00010728963,0.000057506157,0.0010292465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981729,0.0006336605,0.00008267995,0.00013802988,0.0008137091,0.00015902454],"domain_scores_gemma":[0.9784806,0.018023172,0.0012554218,0.0005608233,0.0015932587,0.00008678004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00279819,0.00077075313,0.00082893536,0.0010909489,0.00033036966,0.000763081,0.00058055605,0.00085469085,0.0008618758],"category_scores_gemma":[0.017819606,0.00030150096,0.0003599881,0.0010160422,0.00092105404,0.0014188706,0.0006779439,0.00075208466,0.00021821418],"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.00042233564,0.000035655852,0.004002348,0.00014875205,0.00007152369,0.00036140997,0.00021030524,0.93303895,0.010294722,0.013727927,0.00027287457,0.037413087],"study_design_scores_gemma":[0.000002773622,0.000035990495,0.0006819715,0.000006919677,0.000011115829,0.00010715848,0.000011408967,0.9944957,0.0034199448,0.0011394491,0.00007607084,0.000011490337],"about_ca_topic_score_codex":0.0017514419,"about_ca_topic_score_gemma":0.0010316201,"teacher_disagreement_score":0.00279819,"about_ca_system_score_codex":0.0009995869,"about_ca_system_score_gemma":0.0005878833,"threshold_uncertainty_score":0.014798403},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4907703,0.0012783288,0.50132537,0.00048042642,0.0000343773,0.00007317629,0.0000957577,0.0002155946,0.0057266713],"genre_scores_gemma":[0.99330306,0.00029660654,0.005539665,0.000030393661,0.0000090845415,0.000032402146,0.000027186275,0.000016936878,0.000744709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996331,0.00012426237,0.000014224262,0.000045028504,0.000097039214,0.000086407286],"domain_scores_gemma":[0.9985436,0.0010015491,0.00018662507,0.00006267011,0.00015229845,0.000053314998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010796547,0.0004899444,0.0005347517,0.0004237179,0.0003366927,0.000590943,0.00068860705,0.0004910654,0.00075659],"category_scores_gemma":[0.004389566,0.00032155117,0.00037167675,0.0003605304,0.0006084249,0.0010214229,0.0003738423,0.00026561876,0.00008523621],"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.00006827596,0.000028603641,0.0010188506,0.00005032309,0.00003149805,0.00007439505,0.00007022293,0.974396,0.0045772963,0.010396534,0.00020560827,0.009082372],"study_design_scores_gemma":[0.000003351407,0.00002131677,0.0002659487,0.000002681987,0.000005827319,0.00001432846,0.000014442711,0.99720806,0.00043176775,0.001969997,0.000059639777,0.0000025178342],"about_ca_topic_score_codex":0.002453433,"about_ca_topic_score_gemma":0.0021588216,"teacher_disagreement_score":0.002453433,"about_ca_system_score_codex":0.0008206403,"about_ca_system_score_gemma":0.0005048224,"threshold_uncertainty_score":0.0059541464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2559469,0.0015114979,0.72236055,0.0006387582,0.00007789794,0.00007377641,0.0002937653,0.00047220665,0.018624622],"genre_scores_gemma":[0.9860681,0.00066244573,0.010670477,0.00004257137,0.000037739675,0.000034672583,0.00008198821,0.000024727255,0.002377233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996019,0.00010991803,0.000012468863,0.00005641048,0.00013915788,0.00008007115],"domain_scores_gemma":[0.99966323,0.00012741575,0.000068610556,0.000037118032,0.0000884275,0.00001519873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005957104,0.00072423124,0.0005151891,0.00036966134,0.00027895364,0.0008270749,0.0008173367,0.0006714848,0.00081899425],"category_scores_gemma":[0.0013169866,0.00022429314,0.0004037786,0.000555683,0.00036319724,0.001009521,0.00041493864,0.00050851627,0.00015783789],"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.000017002183,0.000016416074,0.00040622987,0.000012269033,0.0000103279845,0.00004564358,0.000024886302,0.97938114,0.0015561203,0.01354768,0.00029269324,0.004689713],"study_design_scores_gemma":[7.742423e-7,0.000008388823,0.00010998537,9.743401e-7,0.000002958998,0.000007878112,0.0000030353312,0.99805427,0.00011789169,0.0015313402,0.00016068321,0.000001717522],"about_ca_topic_score_codex":0.008392445,"about_ca_topic_score_gemma":0.004868057,"teacher_disagreement_score":0.008392445,"about_ca_system_score_codex":0.0012808206,"about_ca_system_score_gemma":0.00077449775,"threshold_uncertainty_score":0.016687214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002080172,0.00014511781,0.99680495,0.00007190528,0.000017896593,0.000011337102,0.000023969305,0.00015569075,0.000688931],"genre_scores_gemma":[0.107257225,0.0005515049,0.8894323,0.00013355141,0.00008107289,0.00006457884,0.0002097235,0.00006959396,0.0022004955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985813,0.00065050833,0.00006812751,0.00018846002,0.00044674752,0.000064943786],"domain_scores_gemma":[0.99876404,0.0005470883,0.00009612605,0.0002988317,0.00024981017,0.000044185756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008579383,0.0011190807,0.0010761581,0.00057232886,0.0005106204,0.0009886548,0.0006502889,0.0009243406,0.0018404592],"category_scores_gemma":[0.0035281947,0.00029920728,0.0005167646,0.0011187083,0.00091876986,0.0009794856,0.0014655922,0.0010977748,0.0011072593],"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.00022182615,0.00006130388,0.0005942093,0.00026794957,0.00011706719,0.00024866057,0.00029844904,0.3404519,0.027079761,0.10286834,0.0058194627,0.5219711],"study_design_scores_gemma":[0.000021543075,0.00006323927,0.00015668132,0.000015836798,0.000011400988,0.00026679167,0.000030253825,0.9589328,0.010258533,0.024377562,0.005829779,0.000035608846],"about_ca_topic_score_codex":0.0020042048,"about_ca_topic_score_gemma":0.0030987156,"teacher_disagreement_score":0.0020042048,"about_ca_system_score_codex":0.0005367302,"about_ca_system_score_gemma":0.0013956724,"threshold_uncertainty_score":0.006156981},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3076262,0.0025393644,0.6747961,0.00034746667,0.00018348383,0.00009355668,0.00010972853,0.0010718821,0.013232219],"genre_scores_gemma":[0.8574311,0.0010430148,0.13621771,0.00016174484,0.000080038815,0.000038497354,0.00014123898,0.00007604137,0.004810621],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929774,0.00023342167,0.000029439425,0.000043825017,0.00031902466,0.000076512486],"domain_scores_gemma":[0.9964914,0.0023763622,0.00010410145,0.00020794524,0.00075969327,0.00006059492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076645083,0.00037856933,0.00047909032,0.0006854636,0.00026159006,0.00046317608,0.00045758716,0.00089199323,0.002099526],"category_scores_gemma":[0.004806394,0.00015377032,0.00021421736,0.0005687439,0.00035093186,0.0008126701,0.00039051543,0.00034472617,0.00047704644],"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.0048029185,0.00024220024,0.0067976285,0.0006825815,0.00036089006,0.0004207463,0.0002446604,0.33834037,0.13024677,0.01733157,0.0021400603,0.4983897],"study_design_scores_gemma":[0.000109180866,0.0007372243,0.003921965,0.000045231107,0.00015535233,0.0007017356,0.00003693032,0.8562338,0.13260774,0.0018382695,0.003534887,0.00007781225],"about_ca_topic_score_codex":0.0014662852,"about_ca_topic_score_gemma":0.0023406935,"teacher_disagreement_score":0.002099526,"about_ca_system_score_codex":0.0003740111,"about_ca_system_score_gemma":0.0005198078,"threshold_uncertainty_score":0.007023573},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38609353,0.0011339879,0.60587573,0.00033494557,0.00003425591,0.0000743536,0.00009646767,0.00034705733,0.006009675],"genre_scores_gemma":[0.9878654,0.00040494278,0.010385337,0.00003262194,0.000021077822,0.000055722852,0.00004970274,0.00004110039,0.0011440944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928755,0.00018040308,0.000030021907,0.000068454676,0.00029575537,0.00013787126],"domain_scores_gemma":[0.9979792,0.0013554638,0.0002471016,0.0001001415,0.0002694808,0.000048606682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012125203,0.00056999153,0.00047793039,0.0008341542,0.00042511287,0.00074588717,0.0006177103,0.0005345746,0.0011562064],"category_scores_gemma":[0.005120507,0.00040149826,0.00036373935,0.0005742509,0.00080648356,0.0014372646,0.00057069905,0.00083912956,0.00016944968],"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.00017369004,0.00006340265,0.0037925583,0.00008824255,0.000045053206,0.00028419434,0.00030931,0.9077527,0.013472138,0.05775953,0.00050551584,0.015753612],"study_design_scores_gemma":[0.0000035963942,0.000020817719,0.00042713495,0.00000601619,0.000004734355,0.000039998715,0.000020329948,0.9954461,0.0007113904,0.0031454433,0.00016990368,0.0000045586676],"about_ca_topic_score_codex":0.0033624216,"about_ca_topic_score_gemma":0.0011310143,"teacher_disagreement_score":0.0033624216,"about_ca_system_score_codex":0.0011269839,"about_ca_system_score_gemma":0.0004939474,"threshold_uncertainty_score":0.008176923},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051025115,0.00031228468,0.993772,0.00007003683,0.000032265812,0.000013440353,0.000007583002,0.0001643006,0.0005255481],"genre_scores_gemma":[0.3147266,0.0006951666,0.6809559,0.00018331634,0.00015931221,0.00009275405,0.000057634716,0.000039044524,0.003090191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901855,0.00034570834,0.000033901375,0.00017113591,0.00034876613,0.000081815575],"domain_scores_gemma":[0.99900925,0.0004934564,0.000087424865,0.00015788381,0.0002208305,0.00003117149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007627215,0.0004794357,0.0006769536,0.00046360015,0.00046075432,0.0007707018,0.00067547447,0.0011641735,0.0011169044],"category_scores_gemma":[0.0024147872,0.0003311757,0.0003261241,0.0005549793,0.00080360525,0.0013415336,0.00094502146,0.0009319813,0.0005833116],"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.0008236651,0.00020595673,0.0013423056,0.00036608905,0.00016770036,0.00023592685,0.00025498637,0.30047578,0.088775754,0.12918164,0.0028699744,0.47530022],"study_design_scores_gemma":[0.000029294677,0.00010312424,0.000271859,0.000009003337,0.000018053212,0.0001390363,0.000015766696,0.96343386,0.016208382,0.016582897,0.0031647687,0.000024011237],"about_ca_topic_score_codex":0.0010383927,"about_ca_topic_score_gemma":0.0013751588,"teacher_disagreement_score":0.0011641735,"about_ca_system_score_codex":0.0004340242,"about_ca_system_score_gemma":0.00088290754,"threshold_uncertainty_score":0.0040336847},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11717469,0.00059564423,0.87856966,0.00010043161,0.00007959758,0.000043420438,0.000019290374,0.0006293892,0.002787839],"genre_scores_gemma":[0.7527268,0.00032387665,0.24469991,0.00008545485,0.00003751562,0.000045059718,0.000028923161,0.00001510161,0.0020373862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978215,0.00004188518,0.000008238641,0.00002373961,0.00012490602,0.000019082829],"domain_scores_gemma":[0.9998061,0.00005522606,0.000029772144,0.00003285522,0.00006288635,0.000013129516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027292143,0.00035796384,0.00032363762,0.00032455867,0.00018530595,0.0002669763,0.0003735753,0.00041797326,0.0005996736],"category_scores_gemma":[0.0007575828,0.000113902766,0.00016730861,0.00035239273,0.00021939709,0.00031232447,0.00023712241,0.00029412087,0.0002247684],"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.00034117608,0.000109747525,0.004452121,0.00019940446,0.00011354185,0.00064155215,0.00015249204,0.53928655,0.21675837,0.038558897,0.0010901074,0.19829597],"study_design_scores_gemma":[0.00003951265,0.00033414605,0.0014015173,0.000019288174,0.000044159027,0.0006049951,0.000018932666,0.95474344,0.03522402,0.0046951757,0.002850481,0.000024429879],"about_ca_topic_score_codex":0.00078281155,"about_ca_topic_score_gemma":0.0012121017,"teacher_disagreement_score":0.00078281155,"about_ca_system_score_codex":0.00021961035,"about_ca_system_score_gemma":0.00030514286,"threshold_uncertainty_score":0.0020061135},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94403934,0.0021282379,0.043042284,0.0007422006,0.00040342414,0.0003114202,0.0003341191,0.0010077639,0.007991174],"genre_scores_gemma":[0.9934809,0.00043422845,0.004915512,0.0001636246,0.00007048052,0.00006903831,0.00016359652,0.00008666681,0.0006159122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978102,0.00046357338,0.00016421871,0.00030866542,0.00086466316,0.000388717],"domain_scores_gemma":[0.99038494,0.003389869,0.0014937659,0.0019716327,0.0019074451,0.0008524336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035765604,0.00096772646,0.0010206058,0.0014655147,0.00089433487,0.0024912804,0.0020042812,0.0011914565,0.00085650117],"category_scores_gemma":[0.019574165,0.00048050308,0.00073396374,0.0011906634,0.0014871584,0.0035762205,0.0011995741,0.0020796668,0.00028729418],"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.013716615,0.0024157357,0.1433269,0.0012813918,0.0020433324,0.002979101,0.0023449387,0.3949524,0.110677145,0.07273579,0.009397044,0.2441296],"study_design_scores_gemma":[0.000555229,0.0070077176,0.07803325,0.0002289336,0.0009932859,0.0034959663,0.0018531709,0.7931998,0.061471578,0.03838265,0.01416506,0.00061340234],"about_ca_topic_score_codex":0.001490984,"about_ca_topic_score_gemma":0.0015591801,"teacher_disagreement_score":0.0035765604,"about_ca_system_score_codex":0.0007968693,"about_ca_system_score_gemma":0.00064016937,"threshold_uncertainty_score":0.018914878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008046265,0.00019569576,0.9912634,0.000027013342,0.000008749014,0.000006401721,0.000027285514,0.00014250916,0.0002826729],"genre_scores_gemma":[0.43791956,0.0010566416,0.5578978,0.00009000832,0.00008157734,0.00013845392,0.00036678606,0.00012475162,0.0023244075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994599,0.00021245872,0.000020914162,0.000086940374,0.00017603034,0.000043691234],"domain_scores_gemma":[0.99802727,0.0012405111,0.0002145015,0.000193732,0.00028714587,0.000036759717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094752555,0.0006048627,0.0009251561,0.0007228956,0.0002850395,0.0008209512,0.00071996957,0.00081574597,0.0010462686],"category_scores_gemma":[0.006920394,0.00047333175,0.0005010993,0.00066008844,0.00050953764,0.0015323069,0.00089019403,0.000950927,0.0005898606],"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.0004456441,0.000055429766,0.0038775897,0.0002957378,0.00016865728,0.0001882118,0.00016384765,0.6971101,0.022566848,0.033357404,0.0016595952,0.24011084],"study_design_scores_gemma":[0.000018290486,0.000046428297,0.0012294417,0.000020520487,0.000025267193,0.00020657807,0.000027910575,0.9803372,0.0065217614,0.010229721,0.001300877,0.000036034537],"about_ca_topic_score_codex":0.00087815995,"about_ca_topic_score_gemma":0.00073541794,"teacher_disagreement_score":0.0010462686,"about_ca_system_score_codex":0.0003623658,"about_ca_system_score_gemma":0.00063218176,"threshold_uncertainty_score":0.005011022},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031017855,0.00018092847,0.96379596,0.00012204918,0.000049995866,0.00013538425,0.00022311811,0.0039025224,0.0005722256],"genre_scores_gemma":[0.43439126,0.00020234832,0.5623965,0.00011615146,0.00010320326,0.00027384242,0.0013321276,0.0001383253,0.0010461615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960814,0.0008660713,0.0003227611,0.000793588,0.0016861919,0.00025004515],"domain_scores_gemma":[0.9942965,0.001944462,0.0010082106,0.001061131,0.0015483557,0.00014139456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020514745,0.0009651667,0.0017112806,0.0034997598,0.0005586713,0.0012449874,0.001834824,0.0010522797,0.00048805668],"category_scores_gemma":[0.007822873,0.00038804967,0.00112517,0.0030588605,0.0007253084,0.0020718677,0.0015551791,0.0012450935,0.00042023777],"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.0004834411,0.00073840684,0.03406646,0.00026410812,0.00058047246,0.00049525755,0.00022249493,0.1819373,0.025006419,0.007480446,0.007069998,0.7416552],"study_design_scores_gemma":[0.0000219885,0.0001229711,0.004263192,0.000011931737,0.000038661634,0.0005299633,0.000040117404,0.9731232,0.0124305915,0.006935985,0.0024469397,0.00003441344],"about_ca_topic_score_codex":0.0016478302,"about_ca_topic_score_gemma":0.0020646388,"teacher_disagreement_score":0.0034997598,"about_ca_system_score_codex":0.0005695085,"about_ca_system_score_gemma":0.00083501317,"threshold_uncertainty_score":0.010849357},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013841402,0.00006506824,0.99599874,0.000027110023,0.000019298648,0.00008593179,0.000065073575,0.00085579633,0.0014987943],"genre_scores_gemma":[0.044916384,0.00025782,0.9509088,0.000065195316,0.00003267735,0.00051691034,0.0004498095,0.0003607239,0.0024916967],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981823,0.00033483206,0.00020318471,0.00019768454,0.00091788755,0.00016406373],"domain_scores_gemma":[0.9975624,0.0007591677,0.00017494243,0.0005891489,0.00083429884,0.000079998594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012576514,0.0011416972,0.0007137981,0.0013085159,0.00080541027,0.001067711,0.0012227555,0.00085597904,0.0052294196],"category_scores_gemma":[0.0054686936,0.0005805505,0.00073593814,0.0011273565,0.0007085442,0.0010268776,0.0018462832,0.001780743,0.0046497067],"study_design_candidate":"not_applicable","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.00026126925,0.00017824714,0.00067807944,0.0004623216,0.000084780535,0.0004926482,0.0004924806,0.075950675,0.110983774,0.18899304,0.008064323,0.61335844],"study_design_scores_gemma":[0.00015086967,0.00033377038,0.000611663,0.00016566853,0.00006148677,0.0014419891,0.00011741497,0.53645885,0.24696179,0.16510409,0.048396297,0.00019615586],"about_ca_topic_score_codex":0.0010177676,"about_ca_topic_score_gemma":0.00163109,"teacher_disagreement_score":0.0052294196,"about_ca_system_score_codex":0.00060135144,"about_ca_system_score_gemma":0.0019499924,"threshold_uncertainty_score":0.017494142},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007039284,0.00026291204,0.9859693,0.00019664441,0.000051743995,0.000102673774,0.000040635867,0.000053963722,0.0062827817],"genre_scores_gemma":[0.7860525,0.00082916423,0.20016752,0.00023509885,0.0001315095,0.00063627237,0.000090465786,0.000047878973,0.011809569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891925,0.0005731522,0.000031262698,0.00012016261,0.00021634427,0.0001397699],"domain_scores_gemma":[0.9993272,0.00040852657,0.00006584506,0.00002682285,0.00009883667,0.00007274135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019955272,0.0013300951,0.0011488026,0.00060758204,0.0008387727,0.0016860025,0.002330425,0.001590498,0.00347287],"category_scores_gemma":[0.0023257036,0.0004355353,0.0008166634,0.0008191879,0.0016552025,0.0019229961,0.001302091,0.0016005033,0.00038788043],"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.0000413003,0.00005160047,0.00012836957,0.00005734023,0.000029732231,0.0001380226,0.00012231077,0.7308074,0.0009135405,0.25545514,0.0015722215,0.01068306],"study_design_scores_gemma":[0.00001592459,0.000025081248,0.000027197513,0.0000054457573,0.0000061964865,0.000018450768,0.000019230773,0.9606113,0.00007920414,0.038304564,0.0008796626,0.00000771865],"about_ca_topic_score_codex":0.009017356,"about_ca_topic_score_gemma":0.006789781,"teacher_disagreement_score":0.009017356,"about_ca_system_score_codex":0.0024154016,"about_ca_system_score_gemma":0.0022102713,"threshold_uncertainty_score":0.017929733},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035158438,0.007644914,0.97413796,0.0024636358,0.0018063681,0.00027056597,0.000066665874,0.0004660862,0.009628048],"genre_scores_gemma":[0.14456333,0.016548628,0.81573415,0.002661483,0.0038148023,0.0007981042,0.00028702692,0.00016706932,0.015425372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994936,0.0011138126,0.00032268092,0.00064544094,0.0027454258,0.00023651446],"domain_scores_gemma":[0.9976265,0.0011600187,0.00017818088,0.0004380627,0.00045009723,0.00014716861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031342055,0.0011675656,0.001589349,0.002214919,0.0015030961,0.003926979,0.003921499,0.00247559,0.002280723],"category_scores_gemma":[0.0064615207,0.0006449847,0.0011426416,0.0032746831,0.0033121374,0.0077196145,0.003652032,0.005321755,0.0011613828],"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.00025853876,0.00023313978,0.000484436,0.0010087008,0.0002183167,0.00029104756,0.0004960376,0.036702026,0.009496794,0.545878,0.016200589,0.3887324],"study_design_scores_gemma":[0.00020316997,0.00074594404,0.00030020432,0.0002401621,0.0002377997,0.0017118852,0.0002410762,0.44994643,0.0073678056,0.32774046,0.2111275,0.00013748348],"about_ca_topic_score_codex":0.0011402577,"about_ca_topic_score_gemma":0.0013084904,"teacher_disagreement_score":0.003926979,"about_ca_system_score_codex":0.0015293668,"about_ca_system_score_gemma":0.0015934858,"threshold_uncertainty_score":0.016575456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15536813,0.00040920562,0.84196055,0.00018539626,0.00002729803,0.00003257309,0.00002142451,0.00013889048,0.0018565981],"genre_scores_gemma":[0.98953736,0.00012394816,0.009800914,0.000027890954,0.000012856227,0.000015388929,0.000005396965,0.000008679493,0.00046763226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976057,0.00007980931,0.000007175608,0.00003256123,0.00006441231,0.000055570956],"domain_scores_gemma":[0.99934536,0.00042563624,0.00009622365,0.000036466,0.000073631105,0.000022636425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006556222,0.00047866532,0.00044120834,0.00017815219,0.0002196428,0.0004926045,0.0006981409,0.00026345678,0.0007903934],"category_scores_gemma":[0.0014566268,0.00023827144,0.00021622489,0.00024193579,0.0005236721,0.00043031148,0.00042714048,0.00040806743,0.00008655914],"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.00011418267,0.000054955195,0.00048407065,0.00005627141,0.00003601847,0.00012422778,0.00009292153,0.9515098,0.013876968,0.009829939,0.00038677597,0.023433978],"study_design_scores_gemma":[0.000006671917,0.000042622545,0.00008642773,0.0000015222926,0.0000062036515,0.000017577673,0.0000066248845,0.9980367,0.0008575568,0.0008919498,0.000042934593,0.0000032144337],"about_ca_topic_score_codex":0.0014062439,"about_ca_topic_score_gemma":0.0014245884,"teacher_disagreement_score":0.0014062439,"about_ca_system_score_codex":0.00039077352,"about_ca_system_score_gemma":0.0004379429,"threshold_uncertainty_score":0.0034673214},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5798405,0.0016103337,0.41397887,0.00052401476,0.000039376853,0.000065479086,0.00007337282,0.00029962772,0.0035683825],"genre_scores_gemma":[0.9862002,0.00036890229,0.012857506,0.000028968661,0.000030589126,0.000023995053,0.000025288757,0.000010221704,0.00045433693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935764,0.0002638209,0.000018223169,0.00008274991,0.00012670054,0.00015081301],"domain_scores_gemma":[0.9975038,0.0017005474,0.00041647482,0.00016989709,0.00013925157,0.000070124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011049765,0.0005369495,0.00045396073,0.00046452333,0.00050754973,0.0007858149,0.0007179925,0.00080592267,0.0006289126],"category_scores_gemma":[0.0040383595,0.00026545013,0.00030146533,0.0005340226,0.0008911942,0.0018655973,0.00093931047,0.00049359887,0.00007160969],"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.00030814824,0.00007955004,0.0015929154,0.00015626682,0.000047827103,0.0002240392,0.00013191906,0.90345484,0.014350234,0.031000182,0.00051994045,0.04813412],"study_design_scores_gemma":[0.000019050663,0.00010920691,0.00045889252,0.0000084837975,0.000013928794,0.00008210802,0.000041353887,0.97756255,0.002341572,0.018970726,0.00038455462,0.000007579818],"about_ca_topic_score_codex":0.0014761061,"about_ca_topic_score_gemma":0.0011153963,"teacher_disagreement_score":0.0014761061,"about_ca_system_score_codex":0.0005761536,"about_ca_system_score_gemma":0.00031590217,"threshold_uncertainty_score":0.0058437586},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009660242,0.006301093,0.9648574,0.0017010728,0.0007110833,0.0005052709,0.00016706953,0.0029773568,0.013119392],"genre_scores_gemma":[0.4065229,0.010113759,0.56051403,0.00048657996,0.0016715203,0.0013792292,0.00094593904,0.00039836857,0.017967653],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875605,0.00030353258,0.00010235119,0.00019751297,0.00054907845,0.00009136456],"domain_scores_gemma":[0.9989448,0.0002500587,0.00015400001,0.0002736812,0.0002825414,0.000094852774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013852048,0.00065187836,0.0008119445,0.00058450364,0.0017804082,0.0019604855,0.002589607,0.0010835206,0.0038766393],"category_scores_gemma":[0.003932354,0.00030799082,0.0003436869,0.0010546865,0.0008124762,0.0032967613,0.0017209625,0.0011628241,0.0019521002],"study_design_candidate":"not_applicable","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.0002889284,0.00016449108,0.0011813139,0.0012303311,0.00011627824,0.0010165911,0.0008529422,0.0630867,0.0251907,0.26284802,0.05520632,0.58881736],"study_design_scores_gemma":[0.00012399534,0.00032351282,0.0013086336,0.00018485956,0.0001381633,0.0013941217,0.0002978095,0.49060175,0.010301324,0.21796052,0.27722216,0.00014311519],"about_ca_topic_score_codex":0.0017101795,"about_ca_topic_score_gemma":0.0018714909,"teacher_disagreement_score":0.0038766393,"about_ca_system_score_codex":0.0008783374,"about_ca_system_score_gemma":0.0013217272,"threshold_uncertainty_score":0.0129686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0536276,0.0002667321,0.94257325,0.00010184338,0.000031163734,0.00003896778,0.00006957207,0.0005725307,0.0027183644],"genre_scores_gemma":[0.602672,0.00022767212,0.39229432,0.00013454682,0.00004283352,0.00006645291,0.00018201336,0.000058529502,0.0043216813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943084,0.00014151458,0.000031200118,0.000045702884,0.00027446455,0.00007621867],"domain_scores_gemma":[0.9993037,0.00029029645,0.00009578841,0.00008578299,0.00019468533,0.000029777113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004991086,0.0004623093,0.00037373917,0.0003595232,0.00042905836,0.00056336896,0.0004906244,0.0005622204,0.0011725387],"category_scores_gemma":[0.00165041,0.00017151806,0.00027963158,0.00037966695,0.0003443865,0.0004469263,0.00044954722,0.0005354706,0.0005214136],"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.0007085029,0.0001053429,0.0017577356,0.00027025992,0.00015468182,0.00042660645,0.00030793063,0.5055903,0.15146944,0.032793563,0.002716653,0.30369905],"study_design_scores_gemma":[0.000032993674,0.00015438414,0.00044904146,0.000018227007,0.00002834025,0.00019592984,0.00002144983,0.9385912,0.05499152,0.003652964,0.0018373188,0.000026624572],"about_ca_topic_score_codex":0.0026403314,"about_ca_topic_score_gemma":0.0071852007,"teacher_disagreement_score":0.0026403314,"about_ca_system_score_codex":0.00057598396,"about_ca_system_score_gemma":0.0011878212,"threshold_uncertainty_score":0.005249858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05223806,0.00039341455,0.94313633,0.00012697591,0.00001857946,0.000044342516,0.000038692793,0.00010256565,0.0039010441],"genre_scores_gemma":[0.8715151,0.00041308775,0.12508908,0.00007878634,0.00002180527,0.00015417144,0.000054151278,0.000037419173,0.0026364108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935704,0.00024729082,0.000027236762,0.000101411235,0.00017328771,0.000093642055],"domain_scores_gemma":[0.9987417,0.0008470532,0.00012897413,0.00010324358,0.0001353389,0.000043761094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011382276,0.00048747478,0.00057733053,0.00045212856,0.00035475075,0.00080773025,0.00076872687,0.0005371709,0.001578008],"category_scores_gemma":[0.0038517541,0.00036997529,0.00020179515,0.0005243699,0.0009713832,0.0015157589,0.00090358756,0.0004302178,0.00040274407],"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.00034308943,0.00013201743,0.00054239377,0.00013329797,0.00004748292,0.00016693756,0.00028745888,0.75620043,0.016942898,0.09845829,0.0017448817,0.12500077],"study_design_scores_gemma":[0.000026823442,0.00004665732,0.000117646014,0.000006705624,0.0000064829896,0.00005352069,0.000039080765,0.96781117,0.0023101862,0.028819244,0.0007517295,0.000010738933],"about_ca_topic_score_codex":0.00060592697,"about_ca_topic_score_gemma":0.00069589034,"teacher_disagreement_score":0.001578008,"about_ca_system_score_codex":0.0007139759,"about_ca_system_score_gemma":0.00070291664,"threshold_uncertainty_score":0.0060195923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17040804,0.0007825885,0.81826496,0.00018669222,0.00006670946,0.00005660435,0.00006240686,0.0007657623,0.009406178],"genre_scores_gemma":[0.8367466,0.00046681985,0.15930474,0.00004374087,0.000030990013,0.000045293935,0.000055990527,0.000025193816,0.0032805793],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999894,0.000024598652,0.000003754889,0.00002025434,0.000041512543,0.000015837615],"domain_scores_gemma":[0.99982125,0.000046187783,0.000025385492,0.000046410405,0.00004470048,0.000016116532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020062485,0.00029683905,0.00014788922,0.00020283971,0.0002970542,0.00036490927,0.0005091376,0.0002531998,0.0013803146],"category_scores_gemma":[0.00027463294,0.00013735097,0.00014671766,0.0002718932,0.00034044898,0.0005333353,0.00030226796,0.00039938188,0.0003144961],"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.0003062861,0.000101142585,0.0017827088,0.00028366194,0.00004800217,0.00026735314,0.00027070305,0.17572726,0.5047352,0.094127715,0.0019311807,0.22041883],"study_design_scores_gemma":[0.000070589755,0.00085529557,0.0014618803,0.000031343166,0.000050729872,0.0010574481,0.00011280016,0.7473961,0.19491655,0.018268697,0.03569074,0.000087888744],"about_ca_topic_score_codex":0.00048505227,"about_ca_topic_score_gemma":0.0008468388,"teacher_disagreement_score":0.0013803146,"about_ca_system_score_codex":0.0003435534,"about_ca_system_score_gemma":0.000268426,"threshold_uncertainty_score":0.0046176314},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006652093,0.00024242014,0.9822311,0.0008688505,0.000109715365,0.00020327681,0.00013313787,0.00009396972,0.009465497],"genre_scores_gemma":[0.643994,0.0012805008,0.33163294,0.0007785017,0.0003517011,0.0011545777,0.00025954042,0.00010693145,0.020441443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973219,0.0013725244,0.00011270676,0.00036063977,0.0005048017,0.00032745168],"domain_scores_gemma":[0.9976088,0.001576056,0.00025502028,0.00013717054,0.00020825247,0.00021483075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002728459,0.001968761,0.0013997337,0.0010333743,0.0011729699,0.002794742,0.0036191638,0.0029968696,0.004673098],"category_scores_gemma":[0.004637765,0.0008537402,0.0013679562,0.0011879276,0.002500337,0.0046460647,0.0019442424,0.0036961825,0.0007724767],"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.0000491853,0.00010476535,0.00027485352,0.00008411231,0.000046678688,0.0002272471,0.00016759442,0.5350177,0.000993968,0.45389956,0.0020646842,0.0070695844],"study_design_scores_gemma":[0.000027381691,0.000051398427,0.000051350216,0.00001204302,0.00001426884,0.000069074624,0.000036910733,0.88976985,0.00012310069,0.10686313,0.0029643169,0.000017255981],"about_ca_topic_score_codex":0.0071686916,"about_ca_topic_score_gemma":0.0054866043,"teacher_disagreement_score":0.0071686916,"about_ca_system_score_codex":0.0034645298,"about_ca_system_score_gemma":0.002550854,"threshold_uncertainty_score":0.025137067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032476686,0.004175011,0.9470948,0.0007478283,0.00007544965,0.000033268985,0.00015836154,0.00028655396,0.014952031],"genre_scores_gemma":[0.9374215,0.0061350935,0.049535956,0.00038798456,0.00039783338,0.00018913059,0.00028923553,0.00021118629,0.005432029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972826,0.0008771529,0.00010186778,0.0001947927,0.0010684457,0.00047511936],"domain_scores_gemma":[0.97086483,0.024315063,0.0016477781,0.0010265543,0.001855182,0.00029066243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048256894,0.0017613263,0.0018779597,0.001378163,0.0008894052,0.0025581585,0.0014910742,0.001438123,0.004425961],"category_scores_gemma":[0.027215203,0.00092292955,0.0006717181,0.0018532807,0.0021493153,0.004872982,0.0024058633,0.0023345095,0.00094396813],"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.000064905325,0.000030191006,0.0007923414,0.00021598658,0.000054909822,0.00039748772,0.0002322678,0.8631349,0.0019801953,0.12175989,0.0013475309,0.0099892905],"study_design_scores_gemma":[0.000007896274,0.00002617438,0.00052559015,0.000078623285,0.000023018454,0.0002516303,0.00006246488,0.94496995,0.0008589528,0.052252874,0.0009127384,0.00003003871],"about_ca_topic_score_codex":0.0016489696,"about_ca_topic_score_gemma":0.0016907324,"teacher_disagreement_score":0.0048256894,"about_ca_system_score_codex":0.0022943332,"about_ca_system_score_gemma":0.001286812,"threshold_uncertainty_score":0.02552104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01202808,0.0002041542,0.9833128,0.00012909803,0.0000336146,0.00005367399,0.00009632072,0.0002239133,0.0039182715],"genre_scores_gemma":[0.38627493,0.0007682892,0.608578,0.00014142224,0.000037712074,0.00020192568,0.00018421908,0.000084367945,0.0037290817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996972,0.000077961915,0.00001408164,0.000038212725,0.00014408602,0.000028504026],"domain_scores_gemma":[0.9994154,0.00020620726,0.00006665215,0.00014867319,0.00014434643,0.000018745068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003555698,0.00032684903,0.00025190075,0.0003741668,0.0003291047,0.0004927849,0.00041046864,0.0005192635,0.0016070304],"category_scores_gemma":[0.0018883143,0.00015862941,0.00025681758,0.00041424186,0.0005570305,0.00064809434,0.0005571839,0.00081976416,0.0006328184],"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.00011585583,0.000038743463,0.00033596295,0.0001684606,0.000015696332,0.00014151295,0.00015229979,0.21313103,0.048588656,0.65569335,0.0019602117,0.07965817],"study_design_scores_gemma":[0.000020445199,0.00005906099,0.0001612627,0.00002898981,0.000010837621,0.00018559399,0.000015795857,0.87793916,0.019408,0.08974302,0.012399465,0.000028395716],"about_ca_topic_score_codex":0.0011508391,"about_ca_topic_score_gemma":0.0010985887,"teacher_disagreement_score":0.0016070304,"about_ca_system_score_codex":0.00049516745,"about_ca_system_score_gemma":0.0008215569,"threshold_uncertainty_score":0.005376041},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9537167,0.0006156286,0.04052652,0.00015737268,0.000020597476,0.000012813399,0.000116687865,0.0001771043,0.004656491],"genre_scores_gemma":[0.99528766,0.00018506704,0.0038950697,0.000017384635,0.000009822179,0.000005924557,0.000050023387,0.000011099015,0.0005378467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889815,0.00029818795,0.000043924836,0.000107684704,0.00040690138,0.00024509005],"domain_scores_gemma":[0.99693334,0.0018325507,0.00044838575,0.00019491509,0.00048222125,0.00010847107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015968515,0.0008830522,0.00071406853,0.0005417521,0.00033638068,0.00082226103,0.00040480436,0.00074995763,0.0009392474],"category_scores_gemma":[0.005049042,0.00027246098,0.00029607225,0.00087646215,0.0011067784,0.00087603554,0.00071628054,0.0003712113,0.00025018246],"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.002706319,0.00009675743,0.010274531,0.00024097705,0.00013617684,0.0005094393,0.00019283808,0.86727685,0.07839339,0.01189292,0.0006391489,0.027640611],"study_design_scores_gemma":[0.000085963155,0.0005690204,0.006907416,0.00004025939,0.000085233354,0.00035634337,0.00007712451,0.949601,0.0368999,0.0049007856,0.00041344026,0.00006356037],"about_ca_topic_score_codex":0.002797872,"about_ca_topic_score_gemma":0.0027451015,"teacher_disagreement_score":0.002797872,"about_ca_system_score_codex":0.0010973744,"about_ca_system_score_gemma":0.0010562163,"threshold_uncertainty_score":0.008445084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07437988,0.00013915094,0.9216125,0.00008531165,0.000015309619,0.000026855485,0.00006294375,0.0004009797,0.0032771125],"genre_scores_gemma":[0.91636086,0.00015608095,0.080327615,0.000062881765,0.000024516617,0.00003452231,0.000101568075,0.00011872845,0.0028133865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988279,0.00044403688,0.000051631636,0.00012318911,0.0004238072,0.00012946739],"domain_scores_gemma":[0.99637395,0.002121022,0.00045093015,0.00027311148,0.00065125385,0.00012970969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022577979,0.0006800493,0.00066607643,0.0007319385,0.0003568997,0.0012151418,0.00051806046,0.0005418987,0.0015550992],"category_scores_gemma":[0.0068548284,0.00030571362,0.00038810034,0.0003698843,0.0010486655,0.0011350363,0.0008789917,0.00074609474,0.0003877514],"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.00092766574,0.000073459465,0.00417589,0.00015542028,0.00007992747,0.00041622977,0.00039707473,0.7185407,0.049247175,0.17015985,0.0010098283,0.05481674],"study_design_scores_gemma":[0.0000058781498,0.000071219125,0.00026538828,0.000009723863,0.000008580492,0.00008564889,0.0000118671815,0.97987133,0.011740604,0.00759408,0.00032027354,0.000015435213],"about_ca_topic_score_codex":0.0005710538,"about_ca_topic_score_gemma":0.00034516814,"teacher_disagreement_score":0.0022577979,"about_ca_system_score_codex":0.0009751674,"about_ca_system_score_gemma":0.0006679259,"threshold_uncertainty_score":0.011940479},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009533695,0.0007782032,0.98584634,0.000118463206,0.000042709635,0.000026491663,0.00008511835,0.00028240346,0.0032866583],"genre_scores_gemma":[0.57956225,0.0056848526,0.4038376,0.000313502,0.00016377268,0.00040209026,0.00062732125,0.00040713232,0.009001552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984925,0.00038314468,0.00007062351,0.00012883267,0.000751692,0.00017327473],"domain_scores_gemma":[0.99384165,0.0043942397,0.00043155518,0.00044458976,0.0008341347,0.000053746724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002701017,0.0012321227,0.0011553537,0.0010440621,0.0006029923,0.002073405,0.0014648031,0.0014649238,0.0029541126],"category_scores_gemma":[0.01887537,0.0006586648,0.00061618676,0.0011273151,0.0013023881,0.0037207645,0.0010920662,0.0018977798,0.0019347444],"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.00005117093,0.000029382418,0.0005227585,0.00017682862,0.000023234363,0.00013784909,0.00026221477,0.8781279,0.0026138073,0.090605654,0.001294821,0.026154451],"study_design_scores_gemma":[0.000007170302,0.000017694565,0.00020027437,0.00006553634,0.000009161864,0.00015662807,0.00005745826,0.9716916,0.0019291625,0.024360599,0.001481012,0.000023689623],"about_ca_topic_score_codex":0.003015808,"about_ca_topic_score_gemma":0.0027302967,"teacher_disagreement_score":0.003015808,"about_ca_system_score_codex":0.0020730963,"about_ca_system_score_gemma":0.0012007625,"threshold_uncertainty_score":0.015041411},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16263697,0.0010593152,0.8284856,0.00038587317,0.000064288004,0.000050787563,0.00015683883,0.0005785253,0.006581867],"genre_scores_gemma":[0.9890003,0.0003599955,0.0091527775,0.000035434296,0.00002601282,0.0000441906,0.000034478482,0.00003191063,0.00131488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989164,0.00034795413,0.00003101787,0.000099238154,0.00029936366,0.00030609747],"domain_scores_gemma":[0.99765885,0.0014416008,0.0002966199,0.000237202,0.00028522633,0.000080571255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015292924,0.00080392085,0.0009233327,0.00067636673,0.00065745093,0.0012248672,0.0013353461,0.0007301508,0.00140231],"category_scores_gemma":[0.00510068,0.00037627757,0.00050757005,0.00087865,0.000898089,0.0014776462,0.000636837,0.0006763609,0.00026923802],"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.00013157705,0.000037264665,0.0007986296,0.000056137716,0.00002534172,0.00010200751,0.00010482057,0.96529895,0.002425212,0.021558905,0.0005391616,0.008921903],"study_design_scores_gemma":[0.000003007178,0.000018343537,0.00012395422,0.000003434649,0.0000074749255,0.000027847005,0.000014855049,0.99674535,0.0004014746,0.002520443,0.00012794092,0.0000058704163],"about_ca_topic_score_codex":0.006236842,"about_ca_topic_score_gemma":0.0037997281,"teacher_disagreement_score":0.006236842,"about_ca_system_score_codex":0.0026041337,"about_ca_system_score_gemma":0.0012085019,"threshold_uncertainty_score":0.018894374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92443186,0.00062446203,0.069373436,0.00016648453,0.000041060706,0.000029400675,0.000058747562,0.00046365528,0.004810928],"genre_scores_gemma":[0.9922827,0.00012073169,0.006924554,0.00005895923,0.000015040347,0.000013054151,0.000028394306,0.000028111826,0.00052854524],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997795,0.0005051722,0.00011199363,0.00023230638,0.00096085784,0.00039461066],"domain_scores_gemma":[0.9952743,0.0030178279,0.0004929514,0.00029970528,0.0007374876,0.0001776818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016354169,0.0008682668,0.0012810699,0.0004338868,0.0006016943,0.00095000694,0.00069275126,0.0016590032,0.0010254683],"category_scores_gemma":[0.0076886183,0.00022668559,0.00041164338,0.00037356446,0.00092394225,0.0010304434,0.0007753958,0.00073037983,0.0005625981],"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.008203301,0.00038922048,0.026123706,0.00068831485,0.00040339472,0.001566185,0.0010077633,0.37947398,0.517721,0.007828887,0.0004875396,0.056106854],"study_design_scores_gemma":[0.00014904435,0.002716577,0.009107533,0.000088150795,0.0002904614,0.0015793311,0.00019946278,0.69901747,0.28430882,0.0014984454,0.00096276024,0.00008190708],"about_ca_topic_score_codex":0.0014190822,"about_ca_topic_score_gemma":0.00040907328,"teacher_disagreement_score":0.0016590032,"about_ca_system_score_codex":0.0006496747,"about_ca_system_score_gemma":0.00052620843,"threshold_uncertainty_score":0.008648992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012139009,0.00061211956,0.98077387,0.00010154498,0.00009617872,0.000053152435,0.000016891092,0.00041496244,0.0057922793],"genre_scores_gemma":[0.2754566,0.0009533066,0.71278924,0.00017729064,0.000084192376,0.00011805194,0.00004395028,0.00007327384,0.01030408],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99972457,0.000040765884,0.000010994216,0.00004324088,0.00016588956,0.000014609722],"domain_scores_gemma":[0.99972504,0.00009644233,0.00003597081,0.00007726947,0.000054562774,0.000010681512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021830408,0.00031315812,0.00029103248,0.00040949153,0.00039014983,0.00037379438,0.0005302944,0.00052226364,0.0016016412],"category_scores_gemma":[0.00069456757,0.00019405471,0.00023686123,0.00035432065,0.0006456908,0.0004973038,0.0004109222,0.00048081003,0.0005872939],"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.00026295698,0.00008195554,0.000348489,0.0002844641,0.000033615597,0.00027083946,0.00030501653,0.01621123,0.5074252,0.06960864,0.0013229435,0.40384462],"study_design_scores_gemma":[0.00009080676,0.0005387693,0.0011291686,0.000115464194,0.000051799576,0.0034825762,0.0001281465,0.32039505,0.56873465,0.02681544,0.07842083,0.0000973036],"about_ca_topic_score_codex":0.00023221297,"about_ca_topic_score_gemma":0.0003731656,"teacher_disagreement_score":0.0016016412,"about_ca_system_score_codex":0.00031267543,"about_ca_system_score_gemma":0.00030764742,"threshold_uncertainty_score":0.0053579807},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012340099,0.00022414973,0.98689646,0.00002574134,0.000010907368,0.000011880339,0.00001954197,0.00014691395,0.00032427878],"genre_scores_gemma":[0.3997378,0.00095612905,0.5970533,0.00008193799,0.00011552343,0.00011567424,0.00022462157,0.00012002207,0.0015950908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989209,0.00040994902,0.00006626193,0.00022340147,0.00030984412,0.00006974881],"domain_scores_gemma":[0.9953402,0.0028129262,0.00080482656,0.00049807975,0.00049129163,0.000052650394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002741268,0.0012889433,0.0012031496,0.000829983,0.00028126634,0.0011116645,0.0007966259,0.0010355636,0.0007830391],"category_scores_gemma":[0.014832624,0.0006241695,0.0005805367,0.0008547047,0.0012140145,0.0025632225,0.0010109382,0.00076750334,0.00061273796],"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.0006862276,0.000081474165,0.004148507,0.00035921737,0.000226443,0.00021620556,0.0002928027,0.73699635,0.028537605,0.03922689,0.0009075779,0.18832064],"study_design_scores_gemma":[0.000039189177,0.00008963625,0.0008369324,0.000042110343,0.00003991945,0.00015961904,0.000029919565,0.973697,0.01472367,0.009482182,0.00080322486,0.00005664458],"about_ca_topic_score_codex":0.00055853743,"about_ca_topic_score_gemma":0.00085092115,"teacher_disagreement_score":0.002741268,"about_ca_system_score_codex":0.00044013234,"about_ca_system_score_gemma":0.0005855427,"threshold_uncertainty_score":0.01449734},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04305141,0.00026190508,0.95461786,0.00021099285,0.00004440426,0.00003785892,0.000056531077,0.000147604,0.001571498],"genre_scores_gemma":[0.9374301,0.0005540976,0.05941261,0.000111842375,0.00011841435,0.00009939928,0.00007709529,0.00008807363,0.0021083083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916995,0.00021747913,0.000032067772,0.000164905,0.00029276908,0.00012283998],"domain_scores_gemma":[0.9983095,0.00084456126,0.0002570178,0.0001411084,0.00036651202,0.00008120633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012321298,0.0007335865,0.0006822343,0.00072875875,0.00047181032,0.00082484126,0.0015382451,0.0005798811,0.0010645945],"category_scores_gemma":[0.00380804,0.0004127037,0.0007979996,0.00083930994,0.00080335874,0.0015758151,0.00087434147,0.0010899081,0.00013005725],"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.000032366373,0.000040470433,0.0011044109,0.000049339556,0.00003782425,0.00011877578,0.00006454279,0.93026596,0.006455822,0.054235063,0.00055337365,0.0070420466],"study_design_scores_gemma":[0.0000010271145,0.000005184976,0.00015652982,0.0000010215384,0.0000022840597,0.0000064016203,0.000004762791,0.99746287,0.0001561773,0.0021052605,0.000095084746,0.000003347656],"about_ca_topic_score_codex":0.007708851,"about_ca_topic_score_gemma":0.0028987415,"teacher_disagreement_score":0.007708851,"about_ca_system_score_codex":0.001540743,"about_ca_system_score_gemma":0.0011147414,"threshold_uncertainty_score":0.01532793},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055075917,0.009178599,0.9302046,0.00035152785,0.00024349248,0.00011946943,0.00007140148,0.0006000364,0.004154985],"genre_scores_gemma":[0.6913235,0.009506468,0.2944994,0.00014478127,0.00033719622,0.00022621667,0.00014640663,0.000101103404,0.003714922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919325,0.00035060942,0.000037941874,0.00007062551,0.00027960193,0.00006792099],"domain_scores_gemma":[0.9987336,0.0006973966,0.00019427185,0.00015600359,0.00016705199,0.00005171359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011073917,0.0007488168,0.0005279492,0.0008115133,0.00058245903,0.0009563154,0.00083229557,0.00071403413,0.000771359],"category_scores_gemma":[0.0028816727,0.0004067716,0.00031973934,0.0012974852,0.0007201792,0.0017071457,0.001048278,0.00048207917,0.00020085702],"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.00014253109,0.000046850328,0.00089287735,0.00039550968,0.00014246533,0.00028163166,0.00016520909,0.7451404,0.013759958,0.05658314,0.002012079,0.18043737],"study_design_scores_gemma":[0.00003623895,0.0003046062,0.00050788256,0.000043076332,0.000058751655,0.00056789414,0.0000811637,0.91156185,0.005129029,0.07347104,0.008191885,0.000046544963],"about_ca_topic_score_codex":0.0007518704,"about_ca_topic_score_gemma":0.0010911132,"teacher_disagreement_score":0.0011073917,"about_ca_system_score_codex":0.0005377016,"about_ca_system_score_gemma":0.00052514893,"threshold_uncertainty_score":0.005856514},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7163115,0.0009874539,0.2714808,0.00026217703,0.00020036334,0.0002041165,0.000055659908,0.000372752,0.010125124],"genre_scores_gemma":[0.97851413,0.00018317573,0.020050202,0.000034700082,0.00003402532,0.000034858924,0.000018737026,0.000011846677,0.0011183275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993057,0.000179536,0.00003220761,0.000092676084,0.00021994588,0.00016999229],"domain_scores_gemma":[0.99906486,0.00044431887,0.000102674894,0.00013117437,0.00011448108,0.0001425202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008069555,0.0005643476,0.00046911938,0.00045008125,0.0007849321,0.0012432382,0.0008652626,0.000799589,0.0018907477],"category_scores_gemma":[0.0021252565,0.0002480368,0.00037017107,0.00033188908,0.0007150225,0.0011680223,0.001488335,0.0008406134,0.00021863029],"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.001123065,0.0005425009,0.006724608,0.00025700155,0.00012201875,0.0017249784,0.0005462278,0.6774291,0.13288938,0.054713223,0.0015931763,0.12233478],"study_design_scores_gemma":[0.00005678919,0.00034665462,0.0014664239,0.000013105996,0.000044455694,0.00033513264,0.00013780015,0.98473835,0.0059557324,0.005318862,0.0015461406,0.00004054908],"about_ca_topic_score_codex":0.0024562203,"about_ca_topic_score_gemma":0.002222157,"teacher_disagreement_score":0.0024562203,"about_ca_system_score_codex":0.00064240536,"about_ca_system_score_gemma":0.00059970043,"threshold_uncertainty_score":0.0063251853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011877153,0.00037572277,0.98377544,0.00010680144,0.00007845524,0.00006363674,0.000020265717,0.0002757227,0.0034267402],"genre_scores_gemma":[0.22748159,0.0007341252,0.7605135,0.00037192568,0.00023799736,0.00014060015,0.00011519924,0.000059721675,0.010345324],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945194,0.00014924574,0.000031826898,0.00010237327,0.00022076555,0.000043911357],"domain_scores_gemma":[0.9996965,0.00007185368,0.000050790823,0.000039917002,0.00011421736,0.000026880198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005662439,0.00061875174,0.00065004634,0.0004716323,0.00030631345,0.0006335401,0.0005977223,0.00060547463,0.0011820733],"category_scores_gemma":[0.000703952,0.00029329088,0.0003508645,0.00026497224,0.00038177255,0.00063617853,0.000454257,0.0007215714,0.0011564806],"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.00056853535,0.00015373377,0.0008991351,0.00039570316,0.00009324014,0.00040335997,0.0003805288,0.025216486,0.59141934,0.07812545,0.0032046046,0.29913986],"study_design_scores_gemma":[0.00016452844,0.0012955338,0.0015140622,0.000104897765,0.00012419802,0.0027523532,0.00007764409,0.5468152,0.3774808,0.01241617,0.057088584,0.0001659158],"about_ca_topic_score_codex":0.00019313656,"about_ca_topic_score_gemma":0.00038260323,"teacher_disagreement_score":0.0011820733,"about_ca_system_score_codex":0.00035605652,"about_ca_system_score_gemma":0.00044225767,"threshold_uncertainty_score":0.00395447},"labels":[],"label_agreement":null}]}